Lines Matching refs:lsu
153 /* lsu -- least significant Unit (of coefficient) */
558 res = dn->lsu; /* fits into given decNumber */
574 /* res now -> number lsu, buffer, or allocated storage for Unit array */
603 up = res; /* -> lsu */
1071 *res->lsu = 1; /* [-]Inf**0 => 1 */
1109 *dac->lsu = 1; /* .. */
1381 *res->lsu = ret;
1602 t->lsu[0] = 259;
1603 a->lsu[0] = 819;
1605 t->lsu[0] = 59;
1606 t->lsu[1] = 2;
1607 a->lsu[0] = 19;
1608 a->lsu[1] = 8;
1610 t->lsu[0] = 9;
1611 t->lsu[1] = 5;
1612 t->lsu[2] = 2;
1613 a->lsu[0] = 9;
1614 a->lsu[1] = 1;
1615 a->lsu[2] = 8;
1626 t->lsu[0] = 819;
1627 a->lsu[0] = 259;
1629 t->lsu[0] = 19;
1630 t->lsu[1] = 8;
1631 a->lsu[0] = 59;
1632 a->lsu[1] = 2;
1634 t->lsu[0] = 9;
1635 t->lsu[1] = 1;
1636 t->lsu[2] = 8;
1637 a->lsu[0] = 9;
1638 a->lsu[1] = 5;
1639 a->lsu[2] = 2;
1650 t->lsu[0] = 5; /* .. */
1685 t->lsu[0] = 1; /* .. */
1700 t->lsu[0] = 1; /* .. */
1758 decShiftToLeast (a->lsu, D2U (a->digits), todrop);
1887 /* more than just the lsu (for small DECDPUN). This would not affect */
1893 dest->lsu[0] = src->lsu[0];
1900 d = dest->lsu + 1; /* -> first destination */
1901 smsup = src->lsu + D2U (src->digits); /* -> source msu+1 */
1902 for (s = src->lsu + 1; s < smsup; s++, d++)
1956 dn->lsu[0] = 0;
2010 const Unit *up = dn->lsu + D2U (dn->digits) - 1; /* -> msu [input pointer] */
2043 if (exp != 0 || (*dn->lsu == 0 && dn->digits == 1))
2057 for (; up >= dn->lsu; up--)
2115 if (up == dn->lsu)
2123 if (up > dn->lsu || (up == dn->lsu && cut >= 0))
2131 if (up == dn->lsu)
2156 if (up == dn->lsu)
2349 decShiftToMost (res->lsu, res->digits, -adjust);
2382 decShiftToMost (res->lsu, res->digits, -adjust);
2403 Int partial = *lhs->lsu;
2409 partial += *rhs->lsu;
2414 *res->lsu = (Unit) partial; /* [copy could have overwritten RHS] */
2421 partial -= *rhs->lsu;
2426 *res->lsu = (Unit) partial;
2428 res->digits = decGetDigits (res->lsu, D2U (res->digits));
2480 res->digits = decShiftToMost (res->lsu, res->digits, shift);
2505 acc = res->lsu; /* assume build direct */
2533 decDumpAr ('A', lhs->lsu, D2U (lhs->digits));
2534 decDumpAr ('B', rhs->lsu, D2U (rhs->digits));
2539 res->digits = decUnitAddSub (lhs->lsu, D2U (lhs->digits), rhs->lsu, D2U (rhs->digits), rhsshift, acc, mult) * DECDPUN; /* [units -> digits] */
2553 if (acc != res->lsu)
2603 res->digits = decGetDigits (res->lsu, D2U (res->digits));
2977 source = lhs->lsu + D2U (lhs->digits) - 1; /* msu of input array */
2978 for (target = msu1; source >= lhs->lsu; source--, target--)
2986 var2 = rhs->lsu; /* -> rhs array */
3103 /* The var2 msu is one unit towards the lsu of the var1 msu, */
3172 /* if early stop), starting at accnext+1 (its lsu) */
3198 Unit lsu = *accnext;
3199 if (!(lsu & 0x01) && (lsu != 0))
3204 { /* [will terminate because lsu!=0] */
3208 if ((lsu - QUOT10 (lsu, drop + 1)
3212 if (lsu % powers[drop + 1] != 0)
3307 decUnitCompare (accnext, tarunits, rhs->lsu,
3317 /* lsu is even. */
3369 rhs->lsu, D2U (rhs->digits),
3525 /* is no advantage in calculating from msu to lsu. So we do it */
3529 *acc = 0; /* .. (lsu=0) */
3532 mermsup = rhs->lsu + D2U (rhs->digits); /* -> msu+1 of multiplier */
3534 for (mer = rhs->lsu; mer < mermsup; mer++)
3541 decUnitAddSub (&acc[shift], accunits - shift, lhs->lsu,
3730 res->digits = decShiftToMost (res->lsu, res->digits, 1); /* shift */
3747 decShiftToMost (res->lsu, res->digits, -adjust);
3882 *res->lsu = 1;
4002 compare = decUnitCompare (lhs->lsu, D2U (lhs->digits),
4003 rhs->lsu, D2U (rhs->digits),
4018 /* Arg1 is A first Unit (lsu) */
4020 /* Arg3 is B first Unit (lsu) */
4118 /* C is filled from the lsu; only those units necessary to complete */
4121 /* Arg1 is A first Unit (lsu) */
4123 /* Arg3 is B first Unit (lsu) */
4126 /* Arg6 is C first Unit (lsu) */
4151 const Unit *alsu = a; /* A lsu [need to remember it] */
4382 || (*dn->lsu & 0x01))
4393 up = dn->lsu; /* -> current Unit */
4427 decShiftToLeast (dn->lsu, D2U (dn->digits), d);
4498 /* shift is the number of digits to remove from the lsu end; it */
4619 decSetCoeff (dest, set, src->lsu, src->digits, residue, status);
4628 /* lsu -> lsu of the source coefficient [may be dn->lsu] */
4638 /* external intermediate array. If it is in the number, lsu must == */
4639 /* dn->lsu and len must == dn->digits. */
4643 /* if dn->lsu==lsu). */
4650 /* dn->digits, dn->lsu (and as required), and dn->exponent are */
4662 decSetCoeff (decNumber * dn, decContext * set, const Unit * lsu,
4679 if (dn->lsu != lsu)
4682 up = lsu;
4683 for (target = dn->lsu; target < dn->lsu + D2U (len); target++, up++)
4705 for (up = lsu + D2U (len) - 1; up >= lsu; up--)
4715 *dn->lsu = 0; /* coefficient will now be 0 */
4728 for (up = lsu;; up++)
4792 *dn->lsu = 0; /* .. result is 0 */
4802 for (target = dn->lsu; target < dn->lsu + D2U (count);
4809 for (target = dn->lsu;; target++)
4907 if (*dn->lsu & 0x01)
4983 for (up = dn->lsu;; up++)
4992 for (up = up - 1; up >= dn->lsu; up--)
5014 for (up = dn->lsu;; up++)
5025 for (up = up - 1; up >= dn->lsu; up--)
5059 decUnitAddSub (dn->lsu, D2U (dn->digits), one, 1, 0, dn->lsu, bump);
5096 dn->digits = decShiftToMost (dn->lsu, dn->digits, dn->exponent);
5163 dn->digits = decShiftToMost (dn->lsu, dn->digits, shift);
5229 for (up = dn->lsu;; up++)
5331 decSetCoeff (dn, &workset, dn->lsu, dn->digits, residue, status);
5343 dn->digits = decShiftToMost (dn->lsu, dn->digits, 1);
5391 up = dn->lsu; /* ready for lsu */
5630 if (dn->exponent == 0 && dn->digits == 1 && *dn->lsu == 0)
5640 up = dn->lsu + D2U (dn->digits) - 1; /* msu */
5642 for (up = up - 1; up >= dn->lsu; up--)
5802 if (*dn->lsu != 0)
5805 printf ("LSU %d (not 0) for an infinity.\n", *dn->lsu);
5833 for (up = dn->lsu; d > 0; up++)
5853 *up, up - dn->lsu, maxuint);