mirror of
https://github.com/ruby/ruby.git
synced 2025-09-15 16:44:01 +02:00
merge revision(s) 63549,63551,63554: [Backport #14805]
memo->u3.cnt is long not int [Bug #14805] enum.c: mitigate overflows * enum.c (enum_count): convert counters to Integer as unsigned long, instead of long, to mitigate overflows. [ruby-core:87348] [Bug #14805] * enum.c (ary_inject_op): ditto. * enum.c (each_with_index_i): ditto, instead of int. * enum.c (find_index_i, find_index_iter_i): ditto, instead of unsigned int. enum.c: bignum counter * enum.c (imemo_count_up, imemo_count_value): promote the counter value to a bignum on overflow. [Bug #14805] git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/branches/ruby_2_4@64125 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
parent
c0e77089b2
commit
7367d5db54
2 changed files with 44 additions and 14 deletions
52
enum.c
52
enum.c
|
@ -140,6 +140,34 @@ enum_grep_v(VALUE obj, VALUE pat)
|
||||||
return ary;
|
return ary;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#define COUNT_BIGNUM IMEMO_FL_USER0
|
||||||
|
#define MEMO_V3_SET(m, v) RB_OBJ_WRITE((m), &(m)->u3.value, (v))
|
||||||
|
|
||||||
|
static void
|
||||||
|
imemo_count_up(struct MEMO *memo)
|
||||||
|
{
|
||||||
|
if (memo->flags & COUNT_BIGNUM) {
|
||||||
|
MEMO_V3_SET(memo, rb_int_succ(memo->u3.value));
|
||||||
|
}
|
||||||
|
else if (++memo->u3.cnt == 0) {
|
||||||
|
/* overflow */
|
||||||
|
unsigned long buf[2] = {0, 1};
|
||||||
|
MEMO_V3_SET(memo, rb_big_unpack(buf, 2));
|
||||||
|
memo->flags |= COUNT_BIGNUM;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static VALUE
|
||||||
|
imemo_count_value(struct MEMO *memo)
|
||||||
|
{
|
||||||
|
if (memo->flags & COUNT_BIGNUM) {
|
||||||
|
return memo->u3.value;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
return ULONG2NUM(memo->u3.cnt);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
static VALUE
|
static VALUE
|
||||||
count_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, memop))
|
count_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, memop))
|
||||||
{
|
{
|
||||||
|
@ -148,7 +176,7 @@ count_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, memop))
|
||||||
ENUM_WANT_SVALUE();
|
ENUM_WANT_SVALUE();
|
||||||
|
|
||||||
if (rb_equal(i, memo->v1)) {
|
if (rb_equal(i, memo->v1)) {
|
||||||
memo->u3.cnt++;
|
imemo_count_up(memo);
|
||||||
}
|
}
|
||||||
return Qnil;
|
return Qnil;
|
||||||
}
|
}
|
||||||
|
@ -159,7 +187,7 @@ count_iter_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, memop))
|
||||||
struct MEMO *memo = MEMO_CAST(memop);
|
struct MEMO *memo = MEMO_CAST(memop);
|
||||||
|
|
||||||
if (RTEST(rb_yield_values2(argc, argv))) {
|
if (RTEST(rb_yield_values2(argc, argv))) {
|
||||||
memo->u3.cnt++;
|
imemo_count_up(memo);
|
||||||
}
|
}
|
||||||
return Qnil;
|
return Qnil;
|
||||||
}
|
}
|
||||||
|
@ -169,7 +197,7 @@ count_all_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, memop))
|
||||||
{
|
{
|
||||||
struct MEMO *memo = MEMO_CAST(memop);
|
struct MEMO *memo = MEMO_CAST(memop);
|
||||||
|
|
||||||
memo->u3.cnt++;
|
imemo_count_up(memo);
|
||||||
return Qnil;
|
return Qnil;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -216,7 +244,7 @@ enum_count(int argc, VALUE *argv, VALUE obj)
|
||||||
|
|
||||||
memo = MEMO_NEW(item, 0, 0);
|
memo = MEMO_NEW(item, 0, 0);
|
||||||
rb_block_call(obj, id_each, 0, 0, func, (VALUE)memo);
|
rb_block_call(obj, id_each, 0, 0, func, (VALUE)memo);
|
||||||
return INT2NUM(memo->u3.cnt);
|
return imemo_count_value(memo);
|
||||||
}
|
}
|
||||||
|
|
||||||
static VALUE
|
static VALUE
|
||||||
|
@ -284,10 +312,10 @@ find_index_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, memop))
|
||||||
ENUM_WANT_SVALUE();
|
ENUM_WANT_SVALUE();
|
||||||
|
|
||||||
if (rb_equal(i, memo->v2)) {
|
if (rb_equal(i, memo->v2)) {
|
||||||
MEMO_V1_SET(memo, UINT2NUM(memo->u3.cnt));
|
MEMO_V1_SET(memo, imemo_count_value(memo));
|
||||||
rb_iter_break();
|
rb_iter_break();
|
||||||
}
|
}
|
||||||
memo->u3.cnt++;
|
imemo_count_up(memo);
|
||||||
return Qnil;
|
return Qnil;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -297,10 +325,10 @@ find_index_iter_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, memop))
|
||||||
struct MEMO *memo = MEMO_CAST(memop);
|
struct MEMO *memo = MEMO_CAST(memop);
|
||||||
|
|
||||||
if (RTEST(rb_yield_values2(argc, argv))) {
|
if (RTEST(rb_yield_values2(argc, argv))) {
|
||||||
MEMO_V1_SET(memo, UINT2NUM(memo->u3.cnt));
|
MEMO_V1_SET(memo, imemo_count_value(memo));
|
||||||
rb_iter_break();
|
rb_iter_break();
|
||||||
}
|
}
|
||||||
memo->u3.cnt++;
|
imemo_count_up(memo);
|
||||||
return Qnil;
|
return Qnil;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -688,7 +716,7 @@ ary_inject_op(VALUE ary, VALUE init, VALUE op)
|
||||||
if (FIXNUM_P(e)) {
|
if (FIXNUM_P(e)) {
|
||||||
n += FIX2LONG(e); /* should not overflow long type */
|
n += FIX2LONG(e); /* should not overflow long type */
|
||||||
if (!FIXABLE(n)) {
|
if (!FIXABLE(n)) {
|
||||||
v = rb_big_plus(LONG2NUM(n), v);
|
v = rb_big_plus(ULONG2NUM(n), v);
|
||||||
n = 0;
|
n = 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -2182,9 +2210,11 @@ enum_member(VALUE obj, VALUE val)
|
||||||
static VALUE
|
static VALUE
|
||||||
each_with_index_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, memo))
|
each_with_index_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, memo))
|
||||||
{
|
{
|
||||||
long n = MEMO_CAST(memo)->u3.cnt++;
|
struct MEMO *m = MEMO_CAST(memo);
|
||||||
|
VALUE n = imemo_count_value(m);
|
||||||
|
|
||||||
return rb_yield_values(2, rb_enum_values_pack(argc, argv), INT2NUM(n));
|
imemo_count_up(m);
|
||||||
|
return rb_yield_values(2, rb_enum_values_pack(argc, argv), n);
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
|
|
|
@ -1,9 +1,9 @@
|
||||||
#define RUBY_VERSION "2.4.5"
|
#define RUBY_VERSION "2.4.5"
|
||||||
#define RUBY_RELEASE_DATE "2018-06-30"
|
#define RUBY_RELEASE_DATE "2018-07-30"
|
||||||
#define RUBY_PATCHLEVEL 305
|
#define RUBY_PATCHLEVEL 306
|
||||||
|
|
||||||
#define RUBY_RELEASE_YEAR 2018
|
#define RUBY_RELEASE_YEAR 2018
|
||||||
#define RUBY_RELEASE_MONTH 6
|
#define RUBY_RELEASE_MONTH 7
|
||||||
#define RUBY_RELEASE_DAY 30
|
#define RUBY_RELEASE_DAY 30
|
||||||
|
|
||||||
#include "ruby/version.h"
|
#include "ruby/version.h"
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue