mirror of
https://github.com/ruby/ruby.git
synced 2022-11-09 12:17:21 -05:00
* vm_trace.c: clear and restore recursive checking thread local data
to avoid unexpected throw from TracePoint. [Bug #9940] * test/ruby/test_settracefunc.rb: add a test. * thread.c: adde * rb_threadptr_reset_recursive_data(rb_thread_t *th); * rb_threadptr_restore_recursive_data(rb_thread_t *th, VALUE old); * vm_core.h: ditto. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@46419 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
parent
537b4a6422
commit
ddae6a05d7
5 changed files with 76 additions and 19 deletions
14
ChangeLog
14
ChangeLog
|
@ -1,3 +1,17 @@
|
|||
Fri Jun 13 17:46:31 2014 Koichi Sasada <ko1@atdot.net>
|
||||
|
||||
* vm_trace.c: clear and restore recursive checking thread local data
|
||||
to avoid unexpected throw from TracePoint.
|
||||
[Bug #9940]
|
||||
|
||||
* test/ruby/test_settracefunc.rb: add a test.
|
||||
|
||||
* thread.c: adde
|
||||
* rb_threadptr_reset_recursive_data(rb_thread_t *th);
|
||||
* rb_threadptr_restore_recursive_data(rb_thread_t *th, VALUE old);
|
||||
|
||||
* vm_core.h: ditto.
|
||||
|
||||
Fri Jun 13 17:33:14 2014 Nobuyoshi Nakada <nobu@ruby-lang.org>
|
||||
|
||||
* array.c (rb_ary_combination): iterate on a shared copy, and use
|
||||
|
|
|
@ -1188,6 +1188,18 @@ class TestSetTraceFunc < Test::Unit::TestCase
|
|||
assert_equal([['call', :foo], ['return', :foo]], events, 'Bug #9759')
|
||||
ensure
|
||||
end
|
||||
end
|
||||
|
||||
def test_recursive
|
||||
assert_ruby_status [], %q{
|
||||
stack = []
|
||||
TracePoint.new(:c_call){|tp|
|
||||
p 2
|
||||
stack << tp.method_id
|
||||
}.enable{
|
||||
p 1
|
||||
}
|
||||
raise if stack != [:p, :hash, :inspect]
|
||||
}, '[Bug #9940]'
|
||||
end
|
||||
end
|
||||
|
|
64
thread.c
64
thread.c
|
@ -2738,20 +2738,23 @@ rb_thread_inspect(VALUE thread)
|
|||
return str;
|
||||
}
|
||||
|
||||
static VALUE
|
||||
threadptr_local_aref(rb_thread_t *th, ID id)
|
||||
{
|
||||
st_data_t val;
|
||||
|
||||
if (th->local_storage && st_lookup(th->local_storage, id, &val)) {
|
||||
return (VALUE)val;
|
||||
}
|
||||
return Qnil;
|
||||
}
|
||||
|
||||
VALUE
|
||||
rb_thread_local_aref(VALUE thread, ID id)
|
||||
{
|
||||
rb_thread_t *th;
|
||||
st_data_t val;
|
||||
|
||||
GetThreadPtr(thread, th);
|
||||
if (!th->local_storage) {
|
||||
return Qnil;
|
||||
}
|
||||
if (st_lookup(th->local_storage, id, &val)) {
|
||||
return (VALUE)val;
|
||||
}
|
||||
return Qnil;
|
||||
return threadptr_local_aref(th, id);
|
||||
}
|
||||
|
||||
/*
|
||||
|
@ -2822,6 +2825,23 @@ rb_thread_aref(VALUE thread, VALUE key)
|
|||
return rb_thread_local_aref(thread, id);
|
||||
}
|
||||
|
||||
static VALUE
|
||||
threadptr_local_aset(rb_thread_t *th, ID id, VALUE val)
|
||||
{
|
||||
if (NIL_P(val)) {
|
||||
if (!th->local_storage) return Qnil;
|
||||
st_delete_wrap(th->local_storage, id);
|
||||
return Qnil;
|
||||
}
|
||||
else {
|
||||
if (!th->local_storage) {
|
||||
th->local_storage = st_init_numtable();
|
||||
}
|
||||
st_insert(th->local_storage, id, val);
|
||||
return val;
|
||||
}
|
||||
}
|
||||
|
||||
VALUE
|
||||
rb_thread_local_aset(VALUE thread, ID id, VALUE val)
|
||||
{
|
||||
|
@ -2831,16 +2851,8 @@ rb_thread_local_aset(VALUE thread, ID id, VALUE val)
|
|||
if (OBJ_FROZEN(thread)) {
|
||||
rb_error_frozen("thread locals");
|
||||
}
|
||||
if (NIL_P(val)) {
|
||||
if (!th->local_storage) return Qnil;
|
||||
st_delete_wrap(th->local_storage, id);
|
||||
return Qnil;
|
||||
}
|
||||
if (!th->local_storage) {
|
||||
th->local_storage = st_init_numtable();
|
||||
}
|
||||
st_insert(th->local_storage, id, val);
|
||||
return val;
|
||||
|
||||
return threadptr_local_aset(th, id, val);
|
||||
}
|
||||
|
||||
/*
|
||||
|
@ -4674,6 +4686,20 @@ recursive_list_access(void)
|
|||
return list;
|
||||
}
|
||||
|
||||
VALUE
|
||||
rb_threadptr_reset_recursive_data(rb_thread_t *th)
|
||||
{
|
||||
VALUE old = threadptr_local_aref(th, recursive_key);
|
||||
threadptr_local_aset(th, recursive_key, Qnil);
|
||||
return old;
|
||||
}
|
||||
|
||||
void
|
||||
rb_threadptr_restore_recursive_data(rb_thread_t *th, VALUE old)
|
||||
{
|
||||
threadptr_local_aset(th, recursive_key, old);
|
||||
}
|
||||
|
||||
/*
|
||||
* Returns Qtrue iff obj_id (or the pair <obj, paired_obj>) is already
|
||||
* in the recursion list.
|
||||
|
|
|
@ -1046,6 +1046,9 @@ void rb_threadptr_exec_event_hooks_and_pop_frame(struct rb_trace_arg_struct *tra
|
|||
#define EXEC_EVENT_HOOK_AND_POP_FRAME(th_, flag_, self_, id_, klass_, data_) \
|
||||
EXEC_EVENT_HOOK_ORIG(th_, flag_, self_, id_, klass_, data_, 1)
|
||||
|
||||
VALUE rb_threadptr_reset_recursive_data(rb_thread_t *th);
|
||||
void rb_threadptr_restore_recursive_data(rb_thread_t *th, VALUE old);
|
||||
|
||||
RUBY_SYMBOL_EXPORT_BEGIN
|
||||
|
||||
int rb_thread_check_trap_pending(void);
|
||||
|
|
|
@ -331,6 +331,7 @@ rb_threadptr_exec_event_hooks_orig(rb_trace_arg_t *trace_arg, int pop_p)
|
|||
trace_arg->self != rb_mRubyVMFrozenCore /* skip special methods. TODO: remove it. */) {
|
||||
const VALUE errinfo = th->errinfo;
|
||||
const int outer_state = th->state;
|
||||
const VALUE old_recursive = rb_threadptr_reset_recursive_data(th);
|
||||
int state = 0;
|
||||
th->state = 0;
|
||||
th->errinfo = Qnil;
|
||||
|
@ -351,6 +352,7 @@ rb_threadptr_exec_event_hooks_orig(rb_trace_arg_t *trace_arg, int pop_p)
|
|||
terminate:
|
||||
th->trace_arg = 0;
|
||||
th->vm->trace_running--;
|
||||
rb_threadptr_restore_recursive_data(th, old_recursive);
|
||||
|
||||
if (state) {
|
||||
if (pop_p) {
|
||||
|
|
Loading…
Add table
Reference in a new issue