153: d.d = d0;
154: if (word0(&d) & Sign_bit) {
155: /* set sign for everything, including 0's and NaNs */
156: *sign = 1;
157: word0(&d) &= ~Sign_bit; /* clear sign bit */
158: }
163: #ifdef IEEE_Arith
164: if ((word0(&d) & Exp_mask) == Exp_mask)
165: #else
166: if (word0(&d) == 0x8000)
167: #endif
171: #ifdef IEEE_Arith
172: if (!word1(&d) && !(word0(&d) & 0xfffff))
173: return nrv_alloc("Infinity", rve, 8);
203: #ifdef Sudden_Underflow
204: i = (int)(word0(&d) >> Exp_shift1 & (Exp_mask>>Exp_shift1));
205: #else
206: if (( i = (int)(word0(&d) >> Exp_shift1 & (Exp_mask>>Exp_shift1)) )!=0) {
207: #endif
208: dval(&d2) = dval(&d);
209: word0(&d2) &= Frac_mask1;
210: word0(&d2) |= Exp_11;
211: #ifdef IBM
212: if (( j = 11 - hi0bits(word0(&d2) & Frac_mask) )!=0)
213: dval(&d2) /= 1 << j;
249: i = bbits + be + (Bias + (P-1) - 1);
250: x = i > 32 ? word0(&d) << (64 - i) | word1(&d) >> (i - 32)
251: : word1(&d) << (32 - i);
252: dval(&d2) = x;
253: word0(&d2) -= 31*Exp_msk1; /* adjust exponent */
254: i -= (Bias + (P-1) - 1) + 1;
379: dval(&eps) = ieps*dval(&d) + 7.;
380: word0(&eps) -= (P-1)*Exp_msk1;
381: if (ilim == 0) {
563: ) {
564: if (!word1(&d) && !(word0(&d) & Bndry_mask)
565: #ifndef Sudden_Underflow
566: && word0(&d) & (Exp_mask & ~Exp_msk1)
567: #endif
824: if (!oldinexact) {
825: word0(&d) = Exp_1 + (70 << Exp_shift);
826: word1(&d) = 0;