aboutsummaryrefslogtreecommitdiffstats
path: root/test/ruby/test_backtrace.rb
diff options
context:
space:
mode:
authorko1 <ko1@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>2012-05-25 11:01:01 +0000
committerko1 <ko1@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>2012-05-25 11:01:01 +0000
commit4258db79543d97845f0684f9b69911b67181cecd (patch)
tree5c1ab5e2bc5ec1f1e89853efa273cceb8a7e5470 /test/ruby/test_backtrace.rb
parenta5f190615e894c0d1931300b27d8651f7eedf5e1 (diff)
downloadruby-4258db79543d97845f0684f9b69911b67181cecd.tar.gz
* vm_eval.c (rb_f_caller): caller() method accepts second optional
argument `n' which specify how many frames should return. For example, `caller(0, 1)' returns only one frame information which calls caller() method. If there are less than n frame information, then all frame information are returned. If n is 0, then always return []. This fix is part of [ruby-dev:42345] [Ruby 1.9-Feature#3917]. However, performance and features are not enough. RDoc is also not available. * test/ruby/test_backtrace.rb: add a test for above. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@35792 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
Diffstat (limited to 'test/ruby/test_backtrace.rb')
-rw-r--r--test/ruby/test_backtrace.rb34
1 files changed, 32 insertions, 2 deletions
diff --git a/test/ruby/test_backtrace.rb b/test/ruby/test_backtrace.rb
index 9f2d4c465c..c35b95c9e1 100644
--- a/test/ruby/test_backtrace.rb
+++ b/test/ruby/test_backtrace.rb
@@ -40,7 +40,7 @@ class TestBacktrace < Test::Unit::TestCase
rec[n-1]
}
else
- max.times{|i|
+ (max*3).times{|i|
total_size = caller(0).size
c = caller(i)
if c
@@ -53,5 +53,35 @@ class TestBacktrace < Test::Unit::TestCase
rec[max]
}.resume
end
-end
+ def test_caller_lev_and_n
+ m = 10
+ rec = lambda{|n|
+ if n < 0
+ (m*6).times{|lev|
+ (m*6).times{|n|
+ t = caller(0).size
+ r = caller(lev, n)
+ r = r.size if r.respond_to? :size
+
+ # STDERR.puts [t, lev, n, r].inspect
+ if n == 0
+ assert_equal(0, r, [t, lev, n, r].inspect)
+ elsif t < lev
+ assert_equal(nil, r, [t, lev, n, r].inspect)
+ else
+ if t - lev > n
+ assert_equal(n, r, [t, lev, n, r].inspect)
+ else
+ assert_equal(t - lev, r, [t, lev, n, r].inspect)
+ end
+ end
+ }
+ }
+ else
+ rec[n-1]
+ end
+ }
+ rec[m]
+ end
+end