HomeSort by: relevance | last modified time | path
    Searched defs:bits (Results 1 - 25 of 302) 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:__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/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/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];
strtodnrp.c 35 /* require setting the precision control to 53 bits. */
50 ULong bits[2]; local
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];
strtof_vaxf.c 50 ULong bits[1]; local
55 k = strtodg(s, sp, &fpi, &expt, bits, loc);
68 u.L[0] = ((bits[0] & 0x0000ffff) << 16) | /* FracLo */
69 ((bits[0] & 0x007f0000) >> 16) | /* FracHi */
strtopxL.c 56 ULong bits[2]; local
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
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
    [all...]
strtorf.c 38 ULtof(L, bits, expt, k) ULong *L; ULong *bits; Long expt; int k;
40 ULtof(ULong *L, ULong *bits, Long expt, int k)
51 L[0] = (bits[0] & 0x7fffff) | ((expt + 0x7f + 23) << 23);
55 L[0] = bits[0];
79 ULong bits[1]; local
89 k = strtodg(s, sp, fpi, &expt, bits);
92 ULtof((ULong*)f, bits, expt, k);
g_dfmt.c 45 ULong bits[2], *L, sign; local
82 bits[0] = L[_1];
83 bits[1] = L[_0] & 0xfffff;
85 bits[1] |= 0x100000;
95 s = gdtoa(fpi, ex, bits, &i, mode, ndig, &decpt, &se);
  /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/lib/libm/src/
s_nan.c 56 * the same as gcc's __builtin_nan(), namely, discard the high order bits.
68 int bitpos; /* index into words (in bits) */
80 /* Scan backwards, filling in the bits in words[] as we go. */
97 uint32_t bits[2]; member in union:__anon523
100 _scan_nan(u.bits, 2, s);
102 u.bits[1] |= 0x7ff80000;
104 u.bits[0] |= 0x7ff80000;
114 uint32_t bits[1]; member in union:__anon524
117 _scan_nan(u.bits, 1, s);
118 u.bits[0] |= 0x7fc00000
    [all...]
  /src/sys/dev/ic/
smc93cx6.c 43 * **Note: There are 8 address bits for the 93C56/66 chips unlike
44 * the 93C46/26/06 chips which have 6 address bits.
54 * is preceded by an initial zero (leading 0, followed by 16-bits, MSB
84 unsigned char bits[3]; member in struct:seeprom_cmd
130 if (seeprom_read.bits[i] != 0)
136 if (seeprom_read.bits[i] != 0)
  /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/subdev/bios/
M0209.h 11 u8 bits; member in struct:nvbios_M0209E
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/engine/fifo/
nv04.h 10 unsigned bits:6; member in struct:nv04_fifo_ramfc
  /src/common/dist/zlib/contrib/infback9/
inftree9.h 14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bits in this part of the code * member in struct:__anon37
    [all...]
  /src/common/dist/zlib/examples/
zran.h 13 int bits; // 0, or number of bits (1-7) from byte at in-1 member in struct:point
  /src/common/dist/zlib/
inftrees.h 14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bits in this part of the code * member in struct:__anon56
    [all...]

Completed in 25 milliseconds

1 2 3 4 5 6 7 8 91011>>