HomeSort by: relevance | last modified time | path
    Searched defs:bits (Results 1 - 25 of 608) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/lib/libm/ld128/
s_nanl.c 38 uint32_t bits[4]; member in union:nanl::__anonca8e8a6c010a
41 _scan_nan(u.bits, 4, s);
s_nanl.c 38 uint32_t bits[4]; member in union:nanl::__anonca8e8a6c010a
41 _scan_nan(u.bits, 4, s);
  /src/lib/libm/ld80/
s_nanl.c 39 uint32_t bits[3]; member in union:nanl::__anona18dc699010a
42 _scan_nan(u.bits, 3, s);
s_nanl.c 39 uint32_t bits[3]; member in union:nanl::__anona18dc699010a
42 _scan_nan(u.bits, 3, s);
  /src/lib/libc/gdtoa/
ldtoa.c 71 uint32_t bits[(LDBL_MANT_DIG + 31) / 32]; local in function:ldtoa
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 in function:strtopd
53 k = strtodg(s, sp, fpi, &expt, bits);
56 ULtod((ULong*)d, bits, expt, k);
strtopf.c 44 ULong bits[1], *L; local in function:strtopf
53 k = strtodg(s, sp, fpi, &expt, bits);
65 L[0] = (bits[0] & 0x7fffff) | ((expt + 0x7f + 23) << 23);
69 L[0] = bits[0];
ldtoa.c 71 uint32_t bits[(LDBL_MANT_DIG + 31) / 32]; local in function:ldtoa
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 in function:strtopd
53 k = strtodg(s, sp, fpi, &expt, bits);
56 ULtod((ULong*)d, bits, expt, k);
strtopf.c 44 ULong bits[1], *L; local in function:strtopf
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 in function:strtodI
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];
strtodnrp.c 35 /* require setting the precision control to 53 bits. */
50 ULong bits[2]; local in function:strtod
55 k = strtodg(s, sp, &fpi, &expt, bits);
69 u.L[_1] = bits[0];
70 u.L[_0] = (bits[1] & ~0x100000) | ((expt + 0x3ff + 52) << 20);
74 u.L[_1] = bits[0];
75 u.L[_0] = bits[1];
89 u.L[_0] = 0x7ff00000 | bits[1];
90 u.L[_1] = bits[0];
strtopxL.c 56 ULong bits[2]; local in function:strtopxL
66 k = strtodg(s, sp, fpi, &expt, bits, loc);
78 L[_2] = bits[0];
79 L[_1] = bits[1];
strtord.c 38 ULtod(L, bits, expt, k) ULong *L; ULong *bits; Long expt; int k;
40 ULtod(ULong *L, ULong *bits, Long expt, int k)
50 L[_1] = bits[0];
51 L[_0] = bits[1];
56 L[_1] = bits[0];
57 L[_0] = (bits[1] & ~0x100000) | ((expt + 0x3ff + 52) << 20);
81 ULong bits[2]; local in function:strtord
91 k = strtodg(s, sp, fpi, &expt, bits, loc);
94 ULtod((/* LINTED */(U*)d)->L, bits, expt, k)
    [all...]
strtordd.c 38 ULtodd(L, bits, expt, k) ULong *L; ULong *bits; Long expt; int k;
40 ULtodd(ULong *L, ULong *bits, Long expt, int k)
52 L[_1] = (bits[1] >> 21 | bits[2] << 11) & (ULong)0xffffffffL;
53 L[_0] = (bits[2] >> 21) | (bits[3] << 11 & 0xfffff)
56 if (bits[1] &= 0x1fffff) {
57 i = hi0bits(bits[1]) - 11;
65 bits[1] = bits[1] << i | bits[0] >> (32-i)
189 ULong bits[4]; local in function:strtordd
    [all...]
  /src/lib/libc/gdtoa/test/
xQtest.c 34 union { long double d; unsigned int bits[4]; } u, w; member in union:main::__anond0e14a83010a
37 w.bits[0] = w.bits[3] = 0;
41 if (w.bits[0] && w.bits[3])
xQtest.c 34 union { long double d; unsigned int bits[4]; } u, w; member in union:main::__anond0e14a83010a
37 w.bits[0] = w.bits[3] = 0;
41 if (w.bits[0] && w.bits[3])
  /src/sys/crypto/camellia/
camellia.h 37 int bits; /* key-length */ member in struct:__anon09886de00108
camellia.h 37 int bits; /* key-length */ member in struct:__anon09886de00108
  /src/tests/usr.bin/xlint/lint1/
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 in function:example
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...]
expr.c 17 struct bit_fields bits = { 0 }; local in function:expr_cond_cvt
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 in function:example
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...]
expr.c 17 struct bit_fields bits = { 0 }; local in function:expr_cond_cvt
20 return bits.u32 < ul ? bits.u32 : ul;

Completed in 32 milliseconds

1 2 3 4 5 6 7 8 91011>>