Home | History | Annotate | Download | only in gdtoa

Lines Matching defs:bits

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);
66 bits[0] = bits[0] << i & (ULong)0xffffffffL;
69 else if (bits[0]) {
70 i = hi0bits(bits[0]) + 21;
78 bits[1] = bits[0] >> (32 - i);
79 bits[0] = bits[0] << i & (ULong)0xffffffffL;
82 bits[1] = bits[0] << (i - 32);
83 bits[0] = 0;
90 L[2+_1] = bits[0];
91 L[2+_0] = (bits[1] & 0xfffff) | (expt << 20);
95 if (bits[3])
97 if (bits[2])
99 if (bits[1] & 0xffe00000)
103 L[_1] = bits[0];
104 L[_0] = bits[1];
108 i = hi0bits(bits[3]) - 11; /* i >= 12 */
110 L[_0] = ((bits[3] << i | bits[2] >> j) & 0xfffff)
112 L[_1] = (bits[2] << i | bits[1] >> j) & 0xffffffffL;
113 L[2+_0] = bits[1] & (((ULong)1L << j) - 1);
114 L[2+_1] = bits[0];
118 i = hi0bits(bits[2]) - 11;
122 L[_0] = (bits[2] >> j & 0xfffff) | ((33 + j) << 20);
123 L[_1] = (bits[2] << i | bits[1] >> j) & 0xffffffffL;
124 L[2+_0] = bits[1] & (((ULong)1L << j) - 1);
125 L[2+_1] = bits[0];
129 L[_0] = (bits[2] & 0xfffff) | (33 << 20);
130 L[_1] = bits[1];
132 L[2+_1] = bits[0];
136 L[_0] = (((bits[2] << i) | (bits[1] >> j)) & 0xfffff)
138 L[_1] = (bits[1] << i | bits[0] >> j) & 0xffffffffL;
140 L[2+_1] = bits[0] & ((1L << j) - 1);
144 j = 11 - hi0bits(bits[1]);
146 L[_0] = (bits[1] >> j & 0xfffff) | ((j + 1) << 20);
147 L[_1] = (bits[1] << i | bits[0] >> j) & 0xffffffffL;
149 L[2+_1] = bits[0] & (((ULong)1L << j) - 1);
163 L[_1] = (bits[1] >> 21 | bits[2] << 11) & (ULong)0xffffffffL;
164 L[_0] = bits[2] >> 21 | bits[3] << 11
166 L[2+_1] = bits[0];
167 L[2+_0] = bits[1] | (ULong)0x7ff00000L;
189 ULong bits[4];
199 k = strtodg(s, sp, fpi, &expt, bits);
202 ULtodd((ULong*)dd, bits, expt, k);