Searched refs:bitpos (Results 1 - 3 of 3) sorted by relevance

/external/valgrind/main/none/tests/s390x/
H A Dflogr.c17 flogr1(unsigned long input, unsigned long *bitpos, unsigned long *modval, argument
25 "stg 2, %[bitpos]\n\t"
27 : [bitpos]"=m"(*bitpos), [modval]"=m"(*modval),
34 printf("value = %lx, bitpos = %lu, modval = %lx, cc = %d\n",
35 value, *bitpos, *modval, *cc);
41 flogr2(unsigned long input, unsigned long *bitpos, unsigned long *modval, argument
49 "stg 2, %[bitpos]\n\t"
51 : [bitpos]"=m"(*bitpos), [modva
65 flogr3(unsigned long input, unsigned long *bitpos, unsigned long *modval, unsigned int *cc) argument
91 unsigned long bitpos, modval, value; local
[all...]
/external/dropbear/libtomcrypt/src/math/fp/
H A Dltc_ecc_fp_mulmod.c783 unsigned y, z, err, bitlen, bitpos, lut_gap, first; local
864 bitpos = x;
866 z |= ((kb[bitpos>>3] >> (bitpos&7)) & 1) << y;
867 bitpos += lut_gap; /* it's y*lut_gap + x, but here we can avoid the mult in each loop */
908 unsigned y, z, err, bitlen, bitpos, lut_gap, first, zA, zB; local
1051 bitpos = x;
1053 zA |= ((kb[0][bitpos>>3] >> (bitpos&7)) & 1) << y;
1054 zB |= ((kb[1][bitpos>>
[all...]
/external/kernel-headers/original/linux/mtd/
H A Dmap.h331 int bitpos; local
333 bitpos = i*8;
335 bitpos = (map_bankwidth(map)-1-i)*8;
337 orig.x[0] &= ~(0xff << bitpos);
338 orig.x[0] |= buf[i-start] << bitpos;

Completed in 200 milliseconds