1berry/ruby
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

* bignum.c (bary_mul_balance): Extracted from bigmul1_balance and

Browse Source 
use bary_mul2 and bary_add to decrease allocations.



git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@41783 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
akr 2013-07-04 20:31:01 +00:00
parent a0011cd54d
commit c311134319
2 changed files with 43 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
ChangeLog
View File

@ -1,3 +1,8 @@
Fri Jul 5 04:58:05 2013 Tanaka Akira <akr@fsij.org>
* bignum.c (bary_mul_balance): Extracted from bigmul1_balance and
use bary_mul2 and bary_add to decrease allocations.
Fri Jul 5 02:14:00 2013 Akinori MUSHA <knu@iDaemons.org> Fri Jul 5 02:14:00 2013 Akinori MUSHA <knu@iDaemons.org>
* lib/fileutils.rb (FileUtils#symbolic_modes_to_i): Fix the wrong * lib/fileutils.rb (FileUtils#symbolic_modes_to_i): Fix the wrong

58
bignum.c
View File

@ -3930,6 +3930,37 @@ bigmul1_normal(VALUE x, VALUE y)
return z; return z;
} }
static void
bary_mul_balance(BDIGIT *zds, size_t zl, BDIGIT *xds, size_t xl, BDIGIT *yds, size_t yl)
{
VALUE work = 0;
size_t r, n;
BDIGIT *wds;
size_t wl;
assert(xl + yl <= zl);
assert(2 * xl <= yl || 3 * xl <= 2*(yl+2));
wl = xl * 2;
wds = ALLOCV_N(BDIGIT, work, wl);
MEMZERO(zds, BDIGIT, zl);
n = 0;
while (yl > 0) {
r = xl > yl ? yl : xl;
bary_mul2(wds, xl + r, xds, xl, yds + n, r);
bary_add(zds + n, zl - n,
zds + n, zl - n,
wds, xl + r);
yl -= r;
n += r;
}
if (work)
ALLOCV_END(work);
}
static void static void
bary_mul(BDIGIT *zds, size_t zl, BDIGIT *xds, size_t xl, BDIGIT *yds, size_t yl) bary_mul(BDIGIT *zds, size_t zl, BDIGIT *xds, size_t xl, BDIGIT *yds, size_t yl)
{ {
@ -3971,35 +4002,22 @@ bary_mul2(BDIGIT *zds, size_t zl, BDIGIT *xds, size_t xl, BDIGIT *yds, size_t yl
static VALUE static VALUE
bigmul1_balance(VALUE x, VALUE y) bigmul1_balance(VALUE x, VALUE y)
{ {
VALUE z, t1, t2; VALUE z;
long i, xn, yn, r, n; long xn, yn, zn;
BDIGIT *yds, *zds, *t1ds; BDIGIT *xds, *yds, *zds;
xn = RBIGNUM_LEN(x); xn = RBIGNUM_LEN(x);
yn = RBIGNUM_LEN(y); yn = RBIGNUM_LEN(y);
assert(2 * xn <= yn || 3 * xn <= 2*(yn+2)); assert(2 * xn <= yn || 3 * xn <= 2*(yn+2));
z = bignew(xn + yn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y)); zn = xn + yn;
t1 = bignew(xn, 1); z = bignew(zn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
xds = BDIGITS(x);
yds = BDIGITS(y); yds = BDIGITS(y);
zds = BDIGITS(z); zds = BDIGITS(z);
t1ds = BDIGITS(t1);
for (i = 0; i < xn + yn; i++) zds[i] = 0; bary_mul_balance(zds, zn, xds, xn, yds, yn);
n = 0;
while (yn > 0) {
r = xn > yn ? yn : xn;
MEMCPY(t1ds, yds + n, BDIGIT, r);
RBIGNUM_SET_LEN(t1, r);
t2 = bigmul0(x, t1);
bigadd_core(zds + n, RBIGNUM_LEN(z) - n,
BDIGITS(t2), big_real_len(t2),
zds + n, RBIGNUM_LEN(z) - n);
yn -= r;
n += r;
}
return z; return z;
} }