dig 344 marshal.c int e, s = d < 0, dig = 0; dig 362 marshal.c dig -= len < MANT_BITS / 8 ? 8 * (unsigned)len : MANT_BITS; dig 363 marshal.c d += ldexp((double)m, dig); dig 286 random.c const uint128_t m = ((uint128_t)1 << dig) | 1; dig 298 random.c return ldexp(r, -dig); dig 3166 util.c int bbits, b2, b5, be, dig, i, ieps, ilim, ilim0, ilim1, dig 3655 util.c dig = quorem(b,S) + '0'; dig 3669 util.c if (dig == '9') dig 3672 util.c dig++; dig 3677 util.c *s++ = dig; dig 3702 util.c if ((j1 > 0 || (j1 == 0 && (dig & 1))) && dig++ == '9') dig 3706 util.c *s++ = dig; dig 3714 util.c if (dig == '9') { /* possible if i == 1 */ dig 3719 util.c *s++ = dig + 1; dig 3725 util.c *s++ = dig; dig 3739 util.c *s++ = dig = quorem(b,S) + '0'; dig 3761 util.c if (j > 0 || (j == 0 && (dig & 1))) {