ruby-106/ruby/bignum.c

1796 bigsub_core(BDIGIT *xds, long xn, BDIGIT *yds, long yn, BDIGIT *zds, long zn)
1806     while (num && i < xn) {
1811     while (i < xn) {
1862     long xn;
1868     xn = RBIGNUM_LEN(x);
1870     z = bignew(xn, RBIGNUM_SIGN(x));
1875     if (xn == 1 && num < 0) {
1893     while (num && i < xn) {
1898     while (i < xn) {
1914     long xn, zn;
1919     xn = RBIGNUM_LEN(x);
1921     if (xn < 2) {
1925 	zn = xn + 1;
1944     while (num && i < xn) {
1950     else while (i < xn) {
1963 bigadd_core(BDIGIT *xds, long xn, BDIGIT *yds, long yn, BDIGIT *zds, long zn)
1968     if (xn > yn) {
1971 	i = xn; xn = yn; yn = i;
1975     while (i < xn) {
2162     long i, xn, yn, r, n;
2165     xn = RBIGNUM_LEN(x);
2167     assert(2 * xn <= yn || 3 * xn <= 2*(yn+2));
2169     z = bignew(xn + yn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
2170     t1 = bignew(xn, 1);
2176     for (i = 0; i < xn + yn; i++) zds[i] = 0;
2180 	r = xn > yn ? yn : xn;
2230     long i, n, xn, yn, t1n, t2n;
2234     xn = RBIGNUM_LEN(x);
2257     z = bignew(xn + yn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
2266     for (i = 2 * n + t1n; i < xn + yn; i++) zds[i] = 0;
2309     i = xn + yn - n;
2323 biglsh_bang(BDIGIT *xds, long xn, unsigned long shift)
2331     if (s1 >= xn) {
2332 	MEMZERO(xds, BDIGIT, xn);
2335     zds = xds + xn - 1;
2336     xn -= s1 + 1;
2337     num = xds[xn]<<s2;
2338     while (0 < xn) {
2339 	*zds-- = num | xds[--xn]>>s3;
2340 	num = xds[xn]<<s2;
2349 bigrsh_bang(BDIGIT* xds, long xn, unsigned long shift)
2357     if (s1 >= xn) {
2358 	MEMZERO(xds, BDIGIT, xn);
2365     while (i < xn - s1 - 1) {
2369     assert(i < xn);
2371     MEMZERO(xds + xn - s1, BDIGIT, s1);
2394     long n, xn, yn, zn;
2400     xn = RBIGNUM_LEN(x);
2402     assert(xn <= yn);  /* assume y >= x */
2614     long xn, yn;
2616     xn = RBIGNUM_LEN(x);
2620     if (xn > yn) {
2624 	tn = xn; xn = yn; yn = tn;
2626     assert(xn <= yn);
2629     if (xn < KARATSUBA_MUL_DIGITS) {
2632 	if (xn == 1 && yn == 1) return bigmul1_single(x, y);
2641     if (2 * xn <= yn) return bigmul1_balance(x, y);
2643     if (xn < TOOM3_MUL_DIGITS) {
2647     else if (3*xn <= 2*(yn + 2))
3232     long xn, zn;
3239     zn = xn = RBIGNUM_LEN(x);
3263     while (i < xn) {
3336     long xn, zn;
3342     zn = xn = RBIGNUM_LEN(x);
3359     while (i < xn) {
3432     long xn, zn;
3438     zn = xn = RBIGNUM_LEN(x);
3455     while (i < xn) {