contrib/gdtoa/strtopdd.c

46 	ULong bits[4];
60 	rv = strtodg(s, sp, fpi, &exp, bits);
69 		u->L[_1] = (bits[1] >> 21 | bits[2] << 11) & 0xffffffffL;
70 		u->L[_0] = (bits[2] >> 21) | ((bits[3] << 11) & 0xfffff)
73 		if (bits[1] &= 0x1fffff) {
74 			i = hi0bits(bits[1]) - 11;
82 				bits[1] = bits[1] << i | bits[0] >> (32-i);
83 				bits[0] = bits[0] << i & 0xffffffffL;
86 		else if (bits[0]) {
87 			i = hi0bits(bits[0]) + 21;
95 				bits[1] = bits[0] >> (32 - i);
96 				bits[0] = bits[0] << i & 0xffffffffL;
99 				bits[1] = bits[0] << (i - 32);
100 				bits[0] = 0;
107 		u->L[2+_1] = bits[0];
108 		u->L[2+_0] = (bits[1] & 0xfffff) | (exp << 20);
112 		if (bits[3])
114 		if (bits[2])
116 		if (bits[1] & 0xffe00000)
120 		u->L[_1] = bits[0];
121 		u->L[_0] = bits[1];
125 		i = hi0bits(bits[3]) - 11;	/* i >= 12 */
127 		u->L[_0] = ((bits[3] << i | bits[2] >> j) & 0xfffff)
129 		u->L[_1] = (bits[2] << i | bits[1] >> j) & 0xffffffffL;
130 		u->L[2+_0] = bits[1] & ((1L << j) - 1);
131 		u->L[2+_1] = bits[0];
135 		i = hi0bits(bits[2]) - 11;
139 			u->L[_0] = (bits[2] >> j & 0xfffff) | (33 + j) << 20;
140 			u->L[_1] = ((bits[2] << i) | (bits[1] >> j)) & 0xffffffffL;
141 			u->L[2+_0] = bits[1] & ((1L << j) - 1);
142 			u->L[2+_1] = bits[0];
146 			u->L[_0] = (bits[2] & 0xfffff) | (33 << 20);
147 			u->L[_1] = bits[1];
149 			u->L[2+_1] = bits[0];
153 		u->L[_0] = (((bits[2] << i) | (bits[1] >> j)) & 0xfffff)
155 		u->L[_1] = (bits[1] << i | bits[0] >> j) & 0xffffffffL;
157 		u->L[2+_1] = bits[0] & ((1L << j) - 1);
161 		j = 11 - hi0bits(bits[1]);
163 		u->L[_0] = (bits[1] >> j & 0xfffff) | ((j + 1) << 20);
164 		u->L[_1] = (bits[1] << i | bits[0] >> j) & 0xffffffffL;
166 		u->L[2+_1] = bits[0] & ((1L << j) - 1);