Lines Matching defs:mantissa
43 * Sign exponent mantissa (80 bits)
48 * Mantissa does NOT have an implied one bit (it's explicit).
51 /*@only@*/ wordptr mantissa; /* Allocated to MANT_BITS bits */
78 unsigned char mantissa[MANT_BYTES]; /* little endian mantissa */
145 /* Initialize mantissa */
146 e->f.mantissa = BitVector_Create(MANT_BITS, FALSE);
147 BitVector_Block_Store(e->f.mantissa, s->mantissa, MANT_BYTES);
201 BitVector_Destroy(POT_TableN[i].f.mantissa);
202 BitVector_Destroy(POT_TableP[i].f.mantissa);
204 BitVector_Destroy(POT_TableP[14].f.mantissa);
216 if (BitVector_is_empty(flt->mantissa)) {
223 norm_amt = (MANT_BITS-1)-Set_Max(flt->mantissa);
226 BitVector_Move_Left(flt->mantissa, (N_int)norm_amt);
242 if (BitVector_is_empty(acc->mantissa) || BitVector_is_empty(op->mantissa)) {
243 BitVector_Empty(acc->mantissa);
253 BitVector_Empty(acc->mantissa);
258 BitVector_Empty(acc->mantissa);
274 BitVector_Copy(op1, acc->mantissa);
276 BitVector_Copy(op2, op->mantissa);
295 BitVector_Interval_Copy(acc->mantissa, product, 0, MANT_BITS, MANT_BITS);
316 flt->mantissa = BitVector_Create(MANT_BITS, TRUE);
358 /* Multiply mantissa by 10 [x = (x<<1)+(x<<3)] */
359 BitVector_shift_left(flt->mantissa, 0);
360 BitVector_Copy(operand[0], flt->mantissa);
361 BitVector_Move_Left(flt->mantissa, 2);
363 BitVector_add(operand[1], operand[0], flt->mantissa, &carry);
369 BitVector_add(flt->mantissa, operand[1], operand[0], &carry);
371 /* Can't integrate more digits with mantissa, so instead just
394 /* Multiply mantissa by 10 [x = (x<<1)+(x<<3)] */
395 BitVector_shift_left(flt->mantissa, 0);
396 BitVector_Copy(operand[0], flt->mantissa);
397 BitVector_Move_Left(flt->mantissa, 2);
399 BitVector_add(operand[1], operand[0], flt->mantissa, &carry);
405 BitVector_add(flt->mantissa, operand[1], operand[0], &carry);
427 if (BitVector_is_empty(flt->mantissa)) {
428 /* Mantissa is 0, zero exponent too. */
484 * increment if this would cause the mantissa to wrap.
487 !BitVector_is_full(flt->mantissa))
488 BitVector_increment(flt->mantissa);
498 f->mantissa = BitVector_Clone(flt->mantissa);
509 BitVector_Destroy(flt->mantissa);
545 * mant_bits -> the size in bits of the output mantissa.
567 /* copy mantissa */
568 BitVector_Interval_Copy(output, flt->mantissa, 0,
572 /* round mantissa */
573 if (BitVector_bit_test(flt->mantissa, (MANT_BITS-implicit1)-(mant_bits+1)))
577 /* overflowed, so zero mantissa (and set explicit bit if necessary) */
641 * m = mantissa bits, bit 10 is an implied one bit.
651 * m = mantissa bits, bit 23 is an implied one bit.
661 * m = mantissa bits. Bit 52 is an implied one bit.
670 * m = 64 bit mantissa with NO implied bit!
671 * s = sign (for mantissa)
735 str = BitVector_to_Hex(flt->mantissa);
