Lines Matching defs:cut
504 Int cut, out; /* .. */
668 cut=d-(up-res)*DECDPUN; /* digits in top unit */
670 if (*c=='.') continue; /* ignore '.' [don't decrement cut] */
673 cut--;
674 if (cut>0) continue; /* more for this unit */
677 cut=DECDPUN; /* .. */
3459 uInt cut=DECDPUN; /* downcounter through unit */
3463 cut--;
3464 if (cut>0) continue; /* more in this unit */
3467 cut=DECDPUN;
3492 /* calculate how many digits in msu, and hence first cut */
3493 Int cut=MSUDIGITS(n); /* [faster than remainder] */
3496 for (; cut>0; ub++, cut--) *up=X10(*up)+*ub;
3497 cut=DECDPUN; /* next Unit has all digits */
3619 Int cut; /* for counting digits in a Unit */
3652 /* calculate how many digits in msu, and hence first cut */
3653 cut=MSUDIGITS(dn->digits); /* [faster than remainder] */
3654 cut--; /* power of ten for digit */
3659 for (; cut>=0; c++, cut--) TODIGIT(u, cut, c, pow);
3660 cut=DECDPUN-1; /* next Unit has all digits */
3700 for (; pre>0; pre--, c++, cut--) {
3701 if (cut<0) { /* need new Unit */
3704 cut=DECDPUN-1;
3707 TODIGIT(u, cut, c, pow);
3711 for (;; c++, cut--) {
3712 if (cut<0) { /* need new Unit */
3715 cut=DECDPUN-1;
3718 TODIGIT(u, cut, c, pow);
3727 for (; ; c++, cut--) {
3728 if (cut<0) { /* need new Unit */
3731 cut=DECDPUN-1;
3734 TODIGIT(u, cut, c, pow);
3751 for (cut=9; cut>=0; cut--) {
3752 TODIGIT(u, cut, c, pow);
3756 } /* cut */
4250 Int shift, cut; /* .. */
4479 if (exponent<0) cut=-exponent;
4480 else cut=DECDPUN-exponent%DECDPUN;
4481 decShiftToLeast(var1, var1units, cut);
4482 exponent+=cut; /* maintain numerical value */
4483 var1initpad-=cut; /* .. and reduce padding */
4485 for (u=msu1; cut>=DECDPUN; cut-=DECDPUN, u--) *u=0;
6588 uInt cut; /* .. */
6605 cut=1; /* digit (1-DECDPUN) in Unit */
6610 uInt quot=QUOT10(*up, cut);
6611 if ((*up-quot*powers[cut])!=0) break; /* found non-0 digit */
6613 if (*up%powers[cut]!=0) break; /* found non-0 digit */
6623 cut++; /* next power */
6624 if (cut>DECDPUN) { /* need new Unit */
6626 cut=1;
6681 Int cut; /* odd 0's to add */
6692 target=source+D2U(shift); /* where upper part of first cut goes */
6693 cut=DECDPUN-MSUDIGITS(shift); /* where to slice */
6694 if (cut==0) { /* unit-boundary case */
6702 uInt quot=QUOT10(*source, cut);
6703 uInt rem=*source-quot*powers[cut];
6706 uInt rem=*source%powers[cut];
6707 next+=*source/powers[cut];
6710 next=rem*powers[DECDPUN-cut]; /* save remainder for next Unit */
6737 Int cut, count; /* work */
6747 cut=MSUDIGITS(shift);
6748 if (cut==DECDPUN) { /* unit-boundary case; easy */
6755 up=uar+D2U(shift-cut); /* source; correct to whole Units */
6758 quot=QUOT10(*up, cut);
6760 quot=*up/powers[cut];
6764 count-=(DECDPUN-cut);
6769 quot=QUOT10(quot, cut);
6770 rem=*up-quot*powers[cut];
6772 rem=quot%powers[cut];
6773 quot=quot/powers[cut];
6775 *target=(Unit)(*target+rem*powers[DECDPUN-cut]);
6776 count-=cut;
6886 uInt cut; /* cut point in Unit */
6944 cut=discard-(count-DECDPUN)-1;
6945 if (cut==DECDPUN-1) { /* unit-boundary case (fast) */
6972 if (cut==0) quot=*up; /* is at bottom of unit */
6973 else /* cut>0 */ { /* it's not at bottom of unit */
6975 quot=QUOT10(*up, cut);
6976 rem=*up-quot*powers[cut];
6978 rem=*up%powers[cut];
6979 quot=*up/powers[cut];
6996 cut++; /* update cut */
6998 /* cut is the division point for each Unit */
7010 count-=(DECDPUN-cut);
7015 quot=QUOT10(quot, cut);
7016 rem=*up-quot*powers[cut];
7018 rem=quot%powers[cut];
7019 quot=quot/powers[cut];
7021 *target=(Unit)(*target+rem*powers[DECDPUN-cut]);
7022 count-=cut;
7626 Unit *msu; /* -> target cut point */
7627 Int cut; /* work */
7639 cut=MSUDIGITS(dn->digits-drop); /* digits to be in use in msu */
7640 if (cut!=DECDPUN) *msu%=powers[cut]; /* clear left digits */
7810 Int cut; /* .. */
7837 for (cut=DECDPUN-1; cut>=0; cut--) {
7838 d=u/powers[cut];
7839 u-=d*powers[cut];
7841 } /* cut */