Lines Matching defs:bits

48 	ULong bits[4];
62 rv = strtodg(s, sp, fpi, &expt, bits);
73 u->L[_1] = (bits[1] >> 21 | bits[2] << 11) & 0xffffffffL;
74 u->L[_0] = (bits[2] >> 21) | ((bits[3] << 11) & 0xfffff)
77 if (bits[1] &= 0x1fffff) {
78 i = hi0bits(bits[1]) - 11;
86 bits[1] = bits[1] << i | bits[0] >> (32-i);
87 bits[0] = bits[0] << i & 0xffffffffL;
90 else if (bits[0]) {
91 i = hi0bits(bits[0]) + 21;
99 bits[1] = bits[0] >> (32 - i);
100 bits[0] = bits[0] << i & 0xffffffffL;
103 bits[1] = bits[0] << (i - 32);
104 bits[0] = 0;
111 u->L[2+_1] = bits[0];
112 u->L[2+_0] = (bits[1] & 0xfffff) | (expt << 20);
116 if (bits[3])
118 if (bits[2])
120 if (bits[1] & 0xffe00000)
124 u->L[_1] = bits[0];
125 u->L[_0] = bits[1];
129 i = hi0bits(bits[3]) - 11; /* i >= 12 */
131 u->L[_0] = ((bits[3] << i | bits[2] >> j) & 0xfffff)
133 u->L[_1] = (bits[2] << i | bits[1] >> j) & 0xffffffffL;
134 u->L[2+_0] = bits[1] & ((1L << j) - 1);
135 u->L[2+_1] = bits[0];
139 i = hi0bits(bits[2]) - 11;
143 u->L[_0] = (bits[2] >> j & 0xfffff) | (33 + j) << 20;
144 u->L[_1] = ((bits[2] << i) | (bits[1] >> j)) & 0xffffffffL;
145 u->L[2+_0] = bits[1] & ((1L << j) - 1);
146 u->L[2+_1] = bits[0];
150 u->L[_0] = (bits[2] & 0xfffff) | (33 << 20);
151 u->L[_1] = bits[1];
153 u->L[2+_1] = bits[0];
157 u->L[_0] = (((bits[2] << i) | (bits[1] >> j)) & 0xfffff)
159 u->L[_1] = (bits[1] << i | bits[0] >> j) & 0xffffffffL;
161 u->L[2+_1] = bits[0] & ((1L << j) - 1);
165 j = 11 - hi0bits(bits[1]);
167 u->L[_0] = (bits[1] >> j & 0xfffff) | ((j + 1) << 20);
168 u->L[_1] = (bits[1] << i | bits[0] >> j) & 0xffffffffL;
170 u->L[2+_1] = bits[0] & ((1L << j) - 1);