Lines Matching defs:bits
56 uint64_t bits = bit_cast<uint64_t>(d); \
57 (ix0) = bits >> 32; \
58 (ix1) = bits & 0xFFFFFFFFu; \
65 uint64_t bits = bit_cast<uint64_t>(d); \
66 (i) = bits >> 32; \
73 uint64_t bits = bit_cast<uint64_t>(d); \
74 (i) = bits & 0xFFFFFFFFu; \
81 uint64_t bits = 0; \
82 bits |= static_cast<uint64_t>(ix0) << 32; \
83 bits |= static_cast<uint32_t>(ix1); \
84 (d) = bit_cast<double>(bits); \
87 /* Set the more significant 32 bits of a double from an int. */
91 uint64_t bits = bit_cast<uint64_t>(d); \
92 bits &= 0x0000'0000'FFFF'FFFF; \
93 bits |= static_cast<uint64_t>(v) << 32; \
94 (d) = bit_cast<double>(bits); \
97 /* Set the less significant 32 bits of a double from an int. */
101 uint64_t bits = bit_cast<uint64_t>(d); \
102 bits &= 0xFFFF'FFFF'0000'0000; \
103 bits |= static_cast<uint32_t>(v); \
104 (d) = bit_cast<double>(bits); \
145 * invpio2: 53 bits of 2/pi
226 if (i > 49) { /* 3rd iteration need, 151 bits acc */
298 * the last 32 bits mask off, and if x > 0.78125, let qx = 0.28125.
358 * match x's up to 24 bits.
388 * 0 24 bits (single)
389 * 1 53 bits (double)
390 * 2 64 bits (extended)
391 * 3 113 bits (quad)
425 * 24-bits chunk of the product of x and 2/pi.
431 * into 24 bits chunks.
435 * iq[] integer array by breaking up q[] in 24-bits chunk.
2018 * Dekker splitting step with the clear-low-bits step.
2053 * Let log10_2hi = leading 40 bits of log10(2) and
2066 * [1/log(10)] rounded to 53 bits has error .198 ulps;
2352 * Rough cbrt to 5 bits:
2360 * ordinary integer division of the value in bits magically gives
2377 * New cbrt to 23 bits:
2390 * Round t away from zero to 23 bits (sloppily except for ensuring that
2399 uint64_t bits = bit_cast<uint64_t>(t);
2400 bits = (bits + 0x80000000) & 0xFFFFFFFFC0000000ULL;
2401 t = bit_cast<double>(bits);
2403 /* one step Newton iteration to 53 bits with error < 0.667 ulps */
2778 u = ivln2_h * t; /* ivln2_h has 21 sig. bits */