Lines Matching defs:fraction
244 } fraction;
258 fractype fraction:FRACBITS ATTRIBUTE_PACKED;
260 fractype fraction:FRACBITS ATTRIBUTE_PACKED;
324 fractype fraction = src->fraction.ll; /* wasn't unsigned before? */
331 dst.bits.fraction = src->fraction.ll;
334 dst.bits.fraction |= QUIET_NAN;
340 dst.bits.fraction = 0;
345 dst.bits.fraction = 0;
347 else if (fraction == 0)
357 shift the fraction to the right to make up for it. */
366 fraction = 0;
371 fraction >>= shift;
373 fraction >>= NGARDS;
374 dst.bits.fraction = fraction;
379 dst.bits.fraction = 0;
387 if ((fraction & GARDMASK) == GARDMSB)
389 if (fraction & (1 << NGARDS))
390 fraction += GARDROUND + 1;
395 fraction += GARDROUND;
397 if (fraction >= IMPLICIT_2)
399 fraction >>= 1;
402 fraction >>= NGARDS;
403 dst.bits.fraction = fraction;
412 fractype fraction = src->bits.fraction;
418 if (fraction == 0)
425 /* Zero exponent with non zero fraction - it's denormalized,
429 fraction <<= NGARDS;
433 while (fraction < IMPLICIT_1)
435 fraction <<= 1;
439 dst->fraction.ll = fraction;
445 if (fraction == 0)
447 /* Attached to a zero fraction - means infinity */
452 /* Non zero fraction, means nan */
461 /* Keep the fraction part as the nan number */
462 dst->fraction.ll = fraction;
470 dst->fraction.ll = (fraction << NGARDS) | IMPLICIT_1;
522 a_fraction = a->fraction.ll;
523 b_fraction = b->fraction.ll;
573 tmp->fraction.ll = tfraction;
579 tmp->fraction.ll = -tfraction;
583 while (tmp->fraction.ll < IMPLICIT_1 && tmp->fraction.ll)
585 tmp->fraction.ll <<= 1;
593 tmp->fraction.ll = a_fraction + b_fraction;
596 /* Now the fraction is added, we have to shift down to renormalize the
599 if (tmp->fraction.ll >= IMPLICIT_2)
601 LSHIFT (tmp->fraction.ll);
690 fractype x = a->fraction.ll;
691 fractype ylow = b->fraction.ll;
721 DItype answer = (DItype)(a->fraction.ll) * (DItype)(b->fraction.ll);
729 UDItype nl = a->fraction.ll & 0xffffffff;
730 UDItype nh = a->fraction.ll >> 32;
731 UDItype ml = b->fraction.ll & 0xffffffff;
732 UDItype mh = b->fraction.ll >>32;
807 tmp->fraction.ll = high;
860 a->fraction.ll = 0;
881 numerator = a->fraction.ll;
882 denominator = b->fraction.ll;
886 /* Fraction will be less than 1.0 */
918 a->fraction.ll = quotient;
1010 if (a->fraction.ll > b->fraction.ll)
1014 if (a->fraction.ll < b->fraction.ll)
1151 in.fraction.ll = (-arg_a);
1154 in.fraction.ll = arg_a;
1156 while (in.fraction.ll < (1LL << (FRACBITS + NGARDS)))
1158 in.fraction.ll <<= 1;
1184 tmp = a.fraction.ll >> ((FRACBITS + NGARDS) - a.normal_exp);
1217 return a.fraction.ll << ((FRACBITS + NGARDS) - a.normal_exp);
1219 return a.fraction.ll >> ((FRACBITS + NGARDS) - a.normal_exp);
1246 in.fraction.ll = frac;
1266 ((UDItype) in.fraction.ll) << F_D_BITOFF);
1284 in.fraction.ll = frac;
1295 in.fraction.ll >> F_D_BITOFF);
Indexes created Thu Aug 27 00:25:27 UTC 2026