Lines Matching defs:bits
19 #define MPFR_PREC 96 /* good enough for float or double + a few extra bits */
297 * we need 1024 bits of pi at least. Plus, the remainder might
303 * 0x3c2, i.e. of the order of 2^-61. So we need 1024 bits of pi
304 * to get us down to the units digit, another 61 or so bits (say
306 * some bits to make the actual mantissa big enough.
817 int n, bits;
839 * - each of two sign bits (2)
843 * * all bits (1)
861 * All bits.
920 f = random32(); /* some random bits */
921 bits = random32() % 22 + 1; /* 1-22 */
926 f |= (1<<bits)-1;
929 f &= ~((1<<bits)-1);
932 f |= ~((1<<bits)-1);
935 f &= (1<<bits)-1;
944 int n, bits;
967 * - each of two sign bits (2)
971 * * all bits (1)
991 * All bits.
1088 f = random32(); /* some random bits */
1089 g = random32(); /* some random bits */
1090 bits = random32() % 51 + 1; /* 1-51 */
1095 if (bits <= 32)
1096 f |= (1<<bits)-1;
1098 bits -= 32;
1099 g |= (1<<bits)-1;
1104 if (bits <= 32)
1105 f &= ~((1<<bits)-1);
1107 bits -= 32;
1108 g &= ~((1<<bits)-1);
1113 if (bits <= 32)
1114 g &= (1<<bits)-1;
1116 bits -= 32;
1117 f &= (1<<bits)-1;
1122 if (bits <= 32)
1123 g |= ~((1<<bits)-1);
1125 bits -= 32;
1126 f |= ~((1<<bits)-1);
1359 * of useful bits in the mantissa (1 thru 52, so 1 must imply
1397 /* Compute the number of mantissa bits. */
1450 * of useful bits in the mantissa (1 thru 23, so 1 must imply
1487 /* Compute the number of mantissa bits. */
1892 * output. If we output the extra bits and set
1896 * suppress the extra bits and set
1922 * and we suppress the extra bits to make
1996 * Decide whether to print the extra bits based on