Lines Matching refs:exp

123   x.s.exp = 1984; /* G[0]..G[4] = 11111: quiet NaN */
143 x.s.exp = 1920; /* G[0]..G[4] = 11110: Inf */
189 long int exp;
210 exp = n;
214 /* we have exp digits before decimal point, and a total of n digits */
215 exp -= n; /* we will consider an integer mantissa */
219 exp += strtol (s + 1, endptr, 10);
221 MPFR_ASSERTN(-398 <= exp && exp <= (long) (385 - n));
225 exp --;
227 /* now n=16 and -398 <= exp <= 369 */
231 exp += 398;
233 MPFR_ASSERTN(exp >= -15);
234 if (exp < 0)
237 n = -exp;
247 exp = 0;
254 G = (3 << 11) | ((exp & 768) << 1) | ((CH(m[0]) & 1) << 8);
256 G = ((exp & 768) << 3) | (CH(m[0]) << 8);
258 G |= exp & 255;
264 x.s.exp = G >> 2;
303 x.s.exp = exp << 1;
306 x.s.exp |= rp[1] >> 20; /* 1 bit */
310 x.s.exp = 1536 | (exp >> 1);
312 x.s.manh = (rp[1] ^ 2097152) | ((exp & 1) << 19);
325 long int exp = 0;
344 /* we will consider an integer mantissa m*10^exp */
348 exp = strtol (s + 1, endptr, 10);
350 MPFR_ASSERTN(-398 <= exp && exp <= (long) (385 - n));
354 exp --;
356 /* now n=16 and -398 <= exp <= 369 */
359 /* the number to convert is m[] * 10^exp where the mantissa is a 16-digit
363 exp += 398;
365 MPFR_ASSERTN(exp >= -15);
366 if (exp < 0)
369 n = -exp;
379 exp = 0;
382 /* the number to convert is m[] * 10^(exp-398) */
383 exp -= 398;
388 /* multiply by 10^exp */
389 if (exp > 0)
397 if (exp >= 256)
400 exp -= 256;
402 if (exp >= 128)
405 exp -= 128;
407 if (exp >= 64)
410 exp -= 64;
412 if (exp >= 32)
415 exp -= 32;
417 if (exp >= 16)
420 exp -= 16;
422 if (exp >= 8)
425 exp -= 8;
427 if (exp >= 4)
430 exp -= 4;
432 if (exp >= 2)
435 exp -= 2;
437 if (exp >= 1)
440 exp -= 1;
443 else if (exp < 0)
451 if (exp <= -256)
454 exp += 256;
456 if (exp <= -128)
459 exp += 128;
461 if (exp <= -64)
464 exp += 64;
466 if (exp <= -32)
469 exp += 32;
471 if (exp <= -16)
474 exp += 16;
476 if (exp <= -8)
479 exp += 8;
481 if (exp <= -4)
484 exp += 4;
486 if (exp <= -2)
489 exp += 2;
491 if (exp <= -1)
494 exp += 1;