| /external/compiler-rt/lib/builtins/ppc/ |
| gcc_qadd.c | 30 const doublebits bbits = { .d = B }; local
32 (((uint32_t)(bbits.x >> 32) & infinityHi) == infinityHi)) {
|
| gcc_qsub.c | 30 const doublebits bbits = { .d = B }; local
32 (((uint32_t)(bbits.x >> 32) & infinityHi) == infinityHi)) {
|
| /bionic/libc/upstream-openbsd/lib/libc/gdtoa/ |
| gdtoa.c | 36 bitstob(bits, nbits, bbits) ULong *bits; int nbits; int *bbits;
38 bitstob(ULong *bits, int nbits, int *bbits)
70 *bbits = 0;
74 *bbits = i*ULbits + 32 - hi0bits(b->x[i]);
158 int bbits, b2, b5, be0, dig, i, ieps, ilim, ilim0, ilim1, inex; local
190 b = bitstob(bits, nbits = fpi->nbits, &bbits);
197 bbits -= i;
207 i = be + bbits - 1;
253 j = be + bbits - 1
[all...] |
| dtoa.c | 118 int bbits, b2, b5, be, dig, i, ieps, ilim, ilim0, ilim1, local
200 b = d2b(dval(&d), &be, &bbits);
249 i = bbits + be + (Bias + (P-1) - 1);
268 j = bbits - i - 1;
507 1 + 4*P - 3 - bbits + ((bbits + be - 1) & 3);
509 1 + P - bbits;
|
| /device/linaro/bootloader/edk2/StdLib/LibC/gdtoa/ |
| gdtoa.c | 55 bitstob(ULong *bits, int nbits, int *bbits)
86 *bbits = 0;
90 *bbits = i*ULbits + 32 - hi0bits(b->x[i]);
167 int bbits, b2, b5, be0, dig, i, ieps, ilim = 0, ilim0, ilim1 = 0, inex;
local
202 b = bitstob(bits, nbits = fpi->nbits, &bbits);
209 bbits -= i;
219 i = be + bbits - 1;
265 j = be + bbits - 1;
270 word0(d) += (be + bbits - 1) << Exp_shift;
277 j = bbits - i - 1;
[all...] |
| dtoa.c | 127 int bbits, b2, b5, be, dig, i, ieps, ilim0,
local
200 b = d2b(dval(d), &be, &bbits);
249 i = bbits + be + (Bias + (P-1) - 1);
268 j = bbits - i - 1;
501 1 + 4*P - 3 - bbits + ((bbits + be - 1) & 3);
503 1 + P - bbits;
|
| /external/python/cpython3/Lib/test/ |
| test_long.py | 220 for bbits in bits:
221 if bbits < abits:
223 with self.subTest(abits=abits, bbits=bbits):
224 b = (1 << bbits) - 1
226 y = ((1 << (abits + bbits)) -
228 (1 << bbits) +
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_long.py | 185 for bbits in bits:
186 if bbits < abits:
188 b = (1L << bbits) - 1
190 y = ((1L << (abits + bbits)) -
192 (1L << bbits) +
[all...] |
| /external/python/cpython2/Lib/test/ |
| test_long.py | 193 for bbits in bits:
194 if bbits < abits:
196 b = (1L << bbits) - 1
198 y = ((1L << (abits + bbits)) -
200 (1L << bbits) +
[all...] |
| /external/python/cpython3/Python/ |
| dtoa.c | 1050 such that fabs(d) = b * 2**e. On return, *bbits gives the number of
1051 significant bits of b; that is, 2**(*bbits-1) <= b < 2**(*bbits).
1053 If d is zero, then b == 0, *e == -1010, *bbits = 0.
2309 int bbits, b2, b5, be, dig, i, ieps, ilim, ilim0, ilim1, local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Python/ |
| dtoa.c | 1124 such that fabs(d) = b * 2**e. On return, *bbits gives the number of
1125 significant bits of b; that is, 2**(*bbits-1) <= b < 2**(*bbits).
1127 If d is zero, then b == 0, *e == -1010, *bbits = 0.
2382 int bbits, b2, b5, be, dig, i, ieps, ilim, ilim0, ilim1, local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Python/ |
| dtoa.c | 1107 such that fabs(d) = b * 2**e. On return, *bbits gives the number of
1108 significant bits of b; that is, 2**(*bbits-1) <= b < 2**(*bbits).
1110 If d is zero, then b == 0, *e == -1010, *bbits = 0.
2351 int bbits, b2, b5, be, dig, i, ieps, ilim, ilim0, ilim1, local
[all...] |
| /external/python/cpython2/Python/ |
| dtoa.c | 1124 such that fabs(d) = b * 2**e. On return, *bbits gives the number of
1125 significant bits of b; that is, 2**(*bbits-1) <= b < 2**(*bbits).
1127 If d is zero, then b == 0, *e == -1010, *bbits = 0.
2382 int bbits, b2, b5, be, dig, i, ieps, ilim, ilim0, ilim1, local
[all...] |
