| /src/lib/libm/ld128/ |
| s_nanl.c | 38 uint32_t bits[4]; member in union:__anon500
41 _scan_nan(u.bits, 4, s);
|
| /src/lib/libm/ld80/ |
| s_nanl.c | 39 uint32_t bits[3]; member in union:__anon504
42 _scan_nan(u.bits, 3, s);
|
| /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| bn_mp_montgomery_calc_normalization.c | 28 int x, bits, res; local
30 /* how many bits of last digit does b use */
31 bits = mp_count_bits (b) % DIGIT_BIT;
34 if ((res = mp_2expt (a, (b->used - 1) * DIGIT_BIT + bits - 1)) != MP_OKAY) {
39 bits = 1;
44 for (x = bits - 1; x < (int)DIGIT_BIT; x++) {
|
| /src/external/bsd/ipf/dist/lib/ |
| genmask.c | 21 int bits; local
44 * set x most significant bits
46 bits = (int)strtol(msk, &endptr, 0);
51 if ((*endptr != '\0') || (bits < 0) || (bits > 128))
53 fill6bits(bits, mskp->i6);
56 if (*endptr != '\0' || bits > 32 || bits < 0)
58 if (bits == 0)
61 addr = htonl(0xffffffff << (32 - bits));
[all...] |
| /src/lib/libc/gdtoa/test/ |
| xQtest.c | 34 union { long double d; unsigned int bits[4]; } u, w; member in union:__anon339
37 w.bits[0] = w.bits[3] = 0;
41 if (w.bits[0] && w.bits[3])
|
| /src/external/bsd/nsd/dist/ |
| bitset.h | 19 size_t size; /** Number of available bits in the set */
20 unsigned char bits[]; member in struct:nsd_bitset
23 size_t nsd_bitset_size(size_t bits);
27 void nsd_bitset_init(struct nsd_bitset *bset, size_t bits);
|
| /src/external/bsd/wpa/dist/src/crypto/ |
| md5_i.h | 14 u32 bits[2]; member in struct:MD5Context
|
| /src/external/gpl3/binutils/dist/include/cgen/ |
| bitset.h | 31 bits from most significant to least within each byte.
33 For example, the bit representing member number 6 is (set->bits[0] & 0x02).
38 char *bits; member in struct:cgen_bitset
|
| /src/external/gpl3/binutils.old/dist/include/cgen/ |
| bitset.h | 31 bits from most significant to least within each byte.
33 For example, the bit representing member number 6 is (set->bits[0] & 0x02).
38 char *bits; member in struct:cgen_bitset
|
| /src/external/gpl3/gcc/dist/libgfortran/intrinsics/ |
| ishftc.c | 34 GFC_UINTEGER_4 mask, bits; local
43 is greater than or equal to the number of bits in the left operand. So we
47 bits = i & mask;
49 return (i & ~mask) | ((bits << shift) & mask) | (bits >> (size - shift));
58 GFC_UINTEGER_8 mask, bits; local
67 is greater than or equal to the number of bits in the left operand. So we
71 bits = i & mask;
73 return (i & ~mask) | ((bits << shift) & mask) | (bits >> (size - shift))
83 GFC_UINTEGER_16 mask, bits; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libgfortran/intrinsics/ |
| ishftc.c | 34 GFC_UINTEGER_4 mask, bits; local
43 is greater than or equal to the number of bits in the left operand. So we
47 bits = i & mask;
49 return (i & ~mask) | ((bits << shift) & mask) | (bits >> (size - shift));
58 GFC_UINTEGER_8 mask, bits; local
67 is greater than or equal to the number of bits in the left operand. So we
71 bits = i & mask;
73 return (i & ~mask) | ((bits << shift) & mask) | (bits >> (size - shift))
83 GFC_UINTEGER_16 mask, bits; local
[all...] |
| /src/external/gpl3/gdb.old/dist/include/cgen/ |
| bitset.h | 31 bits from most significant to least within each byte.
33 For example, the bit representing member number 6 is (set->bits[0] & 0x02).
38 char *bits; member in struct:cgen_bitset
|
| /src/external/gpl3/gdb/dist/include/cgen/ |
| bitset.h | 31 bits from most significant to least within each byte.
33 For example, the bit representing member number 6 is (set->bits[0] & 0x02).
38 char *bits; member in struct:cgen_bitset
|
| /src/lib/libc/gdtoa/ |
| ldtoa.c | 71 uint32_t bits[(LDBL_MANT_DIG + 31) / 32]; local
76 EXT_TO_ARRAY32(u, bits);
82 bits[LDBL_MANT_DIG / 32] |= 1 << ((LDBL_MANT_DIG - 1) % 32);
102 ret = gdtoa(&fpi, be, (ULong *)bits, &kind, mode, ndigits, decpt, rve);
|
| strtopd.c | 44 ULong bits[2]; local
53 k = strtodg(s, sp, fpi, &expt, bits);
56 ULtod((ULong*)d, bits, expt, k);
|
| strtopf.c | 44 ULong bits[1], *L; local
53 k = strtodg(s, sp, fpi, &expt, bits);
65 L[0] = (bits[0] & 0x7fffff) | ((expt + 0x7f + 23) << 23);
69 L[0] = bits[0];
|
| strtodI.c | 61 ULong bits[2], sign; local
66 k = strtodg(s, sp, &fpi, &exp, bits);
91 word1(&u[0]) = bits[0];
92 word0(&u[0]) = bits[1];
96 word1(&u[0]) = bits[0];
97 word0(&u[0]) = (bits[1] & ~0x100000) | ((exp + 0x3ff + 52) << 20);
163 word0(&u[0]) = word0(&u[1]) = 0x7ff00000 | sign | bits[1];
164 word1(&u[0]) = word1(&u[1]) = bits[0];
|
| /src/sys/crypto/camellia/ |
| camellia.h | 37 int bits; /* key-length */ member in struct:__anon2458
|
| /src/tests/usr.bin/xlint/lint1/ |
| expr.c | 17 struct bit_fields bits = { 0 }; local
20 return bits.u32 < ul ? bits.u32 : ul;
|
| msg_145.c | 8 struct bits { struct
16 struct bits local_bits;
25 struct bits local_bits;
|
| msg_166.c | 34 struct bit_set bits; local
38 bits.minus_1_to_0 = -2;
39 bits.minus_1_to_0 = -1;
40 bits.minus_1_to_0 = 0;
42 bits.minus_1_to_0 = 1;
44 bits.minus_1_to_0 = 2;
47 bits.minus_8_to_7 = -9;
48 bits.minus_8_to_7 = -8;
49 bits.minus_8_to_7 = 7;
51 bits.minus_8_to_7 = 8
[all...] |
| /src/external/bsd/openldap/dist/include/ |
| lutil_md5.h | 26 32 bits, merely 32 bits or more. Choosing a data type which is 32
27 bits instead of 64 is not important; speed is considerably more
35 ber_uint_t bits[2]; member in struct:lutil_MD5Context
|
| /src/external/lgpl3/gmp/dist/rand/ |
| randmui.c | 37 the "bits" calculation correct and let it go through normally.
39 If n is 1 then will have bits==0 and _gmp_rand will produce no output and
49 unsigned long ret, bits, leading; local
55 /* start with zeros, since if bits==0 then _gmp_rand will store nothing at
56 all (bits==0 arises when n==1), or if bits <= GMP_NUMB_BITS then it
64 bits = GMP_LIMB_BITS - leading - (POW2_P(n) != 0);
68 _gmp_rand (a, rstate, bits);
|
| /src/external/lgpl3/gmp/dist/tests/rand/ |
| t-urbui.c | 25 /* Expect numbers generated by rstate to obey the number of bits requested.
26 No point testing bits==BITS_PER_ULONG, since any return is acceptable in
31 unsigned long bits, limit, got; local
34 for (bits = 0; bits < BITS_PER_ULONG; bits++)
37 limit = (1UL << bits);
41 got = gmp_urandomb_ui (rstate, bits);
46 printf (" bits: %lu\n", bits);
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/isc/ |
| fsaccess.c | 30 * and the number of bits in each function.
74 isc_fsaccess_t bits; local
77 * Check for disallowed user bits.
80 bits = ISC_FSACCESS_READ | ISC_FSACCESS_WRITE |
83 bits = ISC_FSACCESS_CREATECHILD | ISC_FSACCESS_ACCESSCHILD |
88 * Set group bad bits.
90 bits |= bits << STEP;
92 * Set other bad bits.
94 bits |= bits << STEP
[all...] |
