Lines Matching defs:uar
6717 /* uar is the array */
6724 /* No overflow is permitted (that is, the uar array must be known to */
6727 static Int decShiftToMost(Unit *uar, Int digits, Int shift) {
6734 *uar=(Unit)(*uar*powers[shift]);
6739 source=uar+D2U(digits)-1; /* where msu comes from */
6743 for (; source>=uar; source--, target--) *target=*source;
6746 first=uar+D2U(digits+shift)-1; /* where msu of source will end up */
6747 for (; source>=uar; source--, target--) {
6763 for (; target>=uar; target--) {
6773 /* uar is the array */
6783 static Int decShiftToLeast(Unit *uar, Int units, Int shift) {
6790 *uar=0; /* all digits cleared gives zero */
6794 target=uar; /* both paths */
6797 up=uar+D2U(shift);
6798 for (; up<uar+units; target++, up++) *target=*up;
6799 return target-uar;
6803 up=uar+D2U(shift-cut); /* source; correct to whole Units */
6827 return target-uar+1;
7800 /* uar is the Unit array holding the number (this is often an */
7810 static Int decGetDigits(Unit *uar, Int len) {
7811 Unit *up=uar+(len-1); /* -> msu */
7821 for (; up>=uar; up--) {