Lines Matching defs:asize
42 * 20 Apr 98 JF grammarsquareg fixed for asize == 0.
861 int asize = a->sign, bsize = b->sign;
866 if (asize < bsize)
868 for (j=0; j<asize; j++)
879 for (j=asize; j<bsize; j++)
904 for (j=bsize; j<asize; j++)
1735 int asize = abs(a->sign), bsize = abs(b->sign);
1748 for (i=0; i<asize+bsize; i++) scratch->n[i]=0;
1784 int asize = abs(a->sign), bsize = abs(b->sign);
1799 for (i=0; i<asize+bsize; i++) scratch->n[i]=0;
1825 for (j = 0; j < asize; j++) {
2630 int asize = abs(a->sign), bsize = abs(b->sign);
2635 for (i=0; i<asize+bsize; ++i)
2649 for (j=0; j<asize; ++j)
2658 bsize+=asize;
2675 int asize = abs(a->sign), max = asize * 2 - 1;
2679 if(asize == 0) {
2686 asize--;
2695 if (cur_term <= asize) {
2698 ptr1 += cur_term - asize;
2699 ptr2 += asize;