Lines Matching defs:source
2771 /* % [Reformatted original Numerical Turing source code follows.] */
3372 /* src is the source decNumber */
3401 smsup=src->lsu+D2U(src->digits); /* -> source msu+1 */
3476 /* dn is the source decNumber */
3509 /* bcd is the uInt array that will source n BCD bytes, most- */
3511 /* n is the number of digits in the source BCD array (bcd) */
3520 const uByte *ub=bcd; /* -> source msd */
4283 const Unit *source; /* .. */
4475 source=lhs->lsu+D2U(lhs->digits)-1; /* msu of input array */
4476 for (target=msu1; source>=lhs->lsu; source--, target--) *target=*source;
6726 Unit *target, *source, *first; /* work */
6737 source=uar+D2U(digits)-1; /* where msu comes from */
6738 target=source+D2U(shift); /* where upper part of first cut goes */
6741 for (; source>=uar; source--, target--) *target=*source;
6744 first=uar+D2U(digits+shift)-1; /* where msu of source will end up */
6745 for (; source>=uar; source--, target--) {
6746 /* split the source Unit and accumulate remainder for next */
6748 uInt quot=QUOT10(*source, cut);
6749 uInt rem=*source-quot*powers[cut];
6752 uInt rem=*source%powers[cut];
6753 next+=*source/powers[cut];
6801 up=uar+D2U(shift-cut); /* source; correct to whole Units */
6875 /* src is the source decNumber */
6896 /* lsu -> lsu of the source coefficient [may be dn->lsu] */
6897 /* len is digits in the source coefficient [may be dn->digits] */
7734 /* This decision tree ends up with LHS being the source pointer, */
