ruby-changes:11913
From: matz <ko1@a...>
Date: Tue, 26 May 2009 11:19:50 +0900 (JST)
Subject: [ruby-changes:11913] Ruby:r23574 (trunk): * bignum.c (bignew_1): inline memory allocation.
matz 2009-05-26 11:19:33 +0900 (Tue, 26 May 2009) New Revision: 23574 http://svn.ruby-lang.org/cgi-bin/viewvc.cgi?view=rev&revision=23574 Log: * bignum.c (bignew_1): inline memory allocation. * bignum.c (bigtrunc): call rb_big_resize() only when needed. * bignum.c (bigfixize): declare inline. Modified files: trunk/ChangeLog trunk/bignum.c Index: ChangeLog =================================================================== --- ChangeLog (revision 23573) +++ ChangeLog (revision 23574) @@ -2,6 +2,14 @@ * lib/mkmf.rb: use map! to replace strings in $objs array. +Tue May 26 10:12:08 2009 Yukihiro Matsumoto <matz@r...> + + * bignum.c (bignew_1): inline memory allocation. + + * bignum.c (bigtrunc): call rb_big_resize() only when needed. + + * bignum.c (bigfixize): declare inline. + Tue May 26 05:39:28 2009 Nobuyoshi Nakada <nobu@r...> * include/ruby/ruby.h (FilePathValue): prevent from GC. Index: bignum.c =================================================================== --- bignum.c (revision 23573) +++ bignum.c (revision 23574) @@ -132,7 +132,8 @@ RBIGNUM_SET_LEN(big, len); } else { - rb_big_resize((VALUE)big, len); + RBIGNUM(big)->as.heap.digits = ALLOC_N(BDIGIT, len); + RBIGNUM(big)->as.heap.len = len; } return (VALUE)big; @@ -186,11 +187,13 @@ if (len == 0) return x; while (--len && !ds[len]); - rb_big_resize(x, len+1); + if (RBIGNUM_LEN(x) > len+1) { + rb_big_resize(x, len+1); + } return x; } -static VALUE +static inline VALUE bigfixize(VALUE x) { long len = RBIGNUM_LEN(x); @@ -2392,7 +2395,8 @@ VALUE z; int ex, ey; - ex = (RBIGNUM_LEN(bigtrunc(x)) - 1) * BITSPERDIG; + bigtrunc(x); + ex = (RBIGNUM_LEN(x) - 1) * BITSPERDIG; ex += bdigbitsize(BDIGITS(x)[RBIGNUM_LEN(x) - 1]); ex -= 2 * DBL_BIGDIG * BITSPERDIG; if (ex) x = big_shift(x, ex); @@ -2401,7 +2405,8 @@ case T_FIXNUM: y = rb_int2big(FIX2LONG(y)); case T_BIGNUM: { - ey = (RBIGNUM_LEN(bigtrunc(y)) - 1) * BITSPERDIG; + bigtrunc(y); + ey = (RBIGNUM_LEN(y) - 1) * BITSPERDIG; ey += bdigbitsize(BDIGITS(y)[RBIGNUM_LEN(y) - 1]); ey -= DBL_BIGDIG * BITSPERDIG; if (ey) y = big_shift(y, ey); @@ -2875,7 +2880,8 @@ if (TYPE(y) == T_BIGNUM) { if (!RBIGNUM_SIGN(y)) return INT2FIX(0); - if (RBIGNUM_LEN(bigtrunc(y)) > DIGSPERLONG) { + bigtrunc(y); + if (RBIGNUM_LEN(y) > DIGSPERLONG) { out_of_range: return RBIGNUM_SIGN(x) ? INT2FIX(0) : INT2FIX(1); } -- ML: ruby-changes@q... Info: http://www.atdot.net/~ko1/quickml/