Lines Matching defs:cut
510 Int cut, out; /* .. */
674 cut=d-(up-res)*DECDPUN; /* digits in top unit */
676 if (*c=='.') continue; /* ignore '.' [don't decrement cut] */
679 cut--;
680 if (cut>0) continue; /* more for this unit */
683 cut=DECDPUN; /* .. */
3479 uInt cut=DECDPUN; /* downcounter through unit */
3483 cut--;
3484 if (cut>0) continue; /* more in this unit */
3487 cut=DECDPUN;
3512 /* calculate how many digits in msu, and hence first cut */
3513 Int cut=MSUDIGITS(n); /* [faster than remainder] */
3516 for (; cut>0; ub++, cut--) *up=X10(*up)+*ub;
3517 cut=DECDPUN; /* next Unit has all digits */
3639 Int cut; /* for counting digits in a Unit */
3672 /* calculate how many digits in msu, and hence first cut */
3673 cut=MSUDIGITS(dn->digits); /* [faster than remainder] */
3674 cut--; /* power of ten for digit */
3679 for (; cut>=0; c++, cut--) TODIGIT(u, cut, c, pow);
3680 cut=DECDPUN-1; /* next Unit has all digits */
3720 for (; pre>0; pre--, c++, cut--) {
3721 if (cut<0) { /* need new Unit */
3724 cut=DECDPUN-1;
3727 TODIGIT(u, cut, c, pow);
3731 for (;; c++, cut--) {
3732 if (cut<0) { /* need new Unit */
3735 cut=DECDPUN-1;
3738 TODIGIT(u, cut, c, pow);
3747 for (; ; c++, cut--) {
3748 if (cut<0) { /* need new Unit */
3751 cut=DECDPUN-1;
3754 TODIGIT(u, cut, c, pow);
3771 for (cut=9; cut>=0; cut--) {
3772 TODIGIT(u, cut, c, pow);
3776 } /* cut */
4270 Int shift, cut; /* .. */
4499 if (exponent<0) cut=-exponent;
4500 else cut=DECDPUN-exponent%DECDPUN;
4501 decShiftToLeast(var1, var1units, cut);
4502 exponent+=cut; /* maintain numerical value */
4503 var1initpad-=cut; /* .. and reduce padding */
4505 for (u=msu1; cut>=DECDPUN; cut-=DECDPUN, u--) *u=0;
6615 uInt cut; /* .. */
6632 cut=1; /* digit (1-DECDPUN) in Unit */
6637 uInt quot=QUOT10(*up, cut);
6638 if ((*up-quot*powers[cut])!=0) break; /* found non-0 digit */
6640 if (*up%powers[cut]!=0) break; /* found non-0 digit */
6650 cut++; /* next power */
6651 if (cut>DECDPUN) { /* need new Unit */
6653 cut=1;
6708 Int cut; /* odd 0's to add */
6719 target=source+D2U(shift); /* where upper part of first cut goes */
6720 cut=DECDPUN-MSUDIGITS(shift); /* where to slice */
6721 if (cut==0) { /* unit-boundary case */
6729 uInt quot=QUOT10(*source, cut);
6730 uInt rem=*source-quot*powers[cut];
6733 uInt rem=*source%powers[cut];
6734 next+=*source/powers[cut];
6737 next=rem*powers[DECDPUN-cut]; /* save remainder for next Unit */
6764 Int cut, count; /* work */
6774 cut=MSUDIGITS(shift);
6775 if (cut==DECDPUN) { /* unit-boundary case; easy */
6782 up=uar+D2U(shift-cut); /* source; correct to whole Units */
6785 quot=QUOT10(*up, cut);
6787 quot=*up/powers[cut];
6791 count-=(DECDPUN-cut);
6796 quot=QUOT10(quot, cut);
6797 rem=*up-quot*powers[cut];
6799 rem=quot%powers[cut];
6800 quot=quot/powers[cut];
6802 *target=(Unit)(*target+rem*powers[DECDPUN-cut]);
6803 count-=cut;
6913 uInt cut; /* cut point in Unit */
6971 cut=discard-(count-DECDPUN)-1;
6972 if (cut==DECDPUN-1) { /* unit-boundary case (fast) */
6999 if (cut==0) quot=*up; /* is at bottom of unit */
7000 else /* cut>0 */ { /* it's not at bottom of unit */
7002 quot=QUOT10(*up, cut);
7003 rem=*up-quot*powers[cut];
7005 rem=*up%powers[cut];
7006 quot=*up/powers[cut];
7023 cut++; /* update cut */
7025 /* cut is the division point for each Unit */
7037 count-=(DECDPUN-cut);
7042 quot=QUOT10(quot, cut);
7043 rem=*up-quot*powers[cut];
7045 rem=quot%powers[cut];
7046 quot=quot/powers[cut];
7048 *target=(Unit)(*target+rem*powers[DECDPUN-cut]);
7049 count-=cut;
7653 Unit *msu; /* -> target cut point */
7654 Int cut; /* work */
7666 cut=MSUDIGITS(dn->digits-drop); /* digits to be in use in msu */
7667 if (cut!=DECDPUN) *msu%=powers[cut]; /* clear left digits */
7837 Int cut; /* .. */
7864 for (cut=DECDPUN-1; cut>=0; cut--) {
7865 d=u/powers[cut];
7866 u-=d*powers[cut];
7868 } /* cut */
