1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
require 'test/unit'
require 'thread'
class TestBacktrace < Test::Unit::TestCase
def test_exception
bt = Fiber.new{
begin
raise
rescue => e
e.backtrace
end
}.resume
assert_equal(1, bt.size)
assert_match(/.+:\d+:.+/, bt[0])
end
def test_caller_lev
cs = []
Fiber.new{
Proc.new{
cs << caller(0)
cs << caller(1)
cs << caller(2)
cs << caller(3)
cs << caller(4)
cs << caller(5)
}.call
}.resume
assert_equal(3, cs[0].size)
assert_equal(2, cs[1].size)
assert_equal(1, cs[2].size)
assert_equal(0, cs[3].size)
assert_equal(nil, cs[4])
#
max = 7
rec = lambda{|n|
if n > 0
1.times{
rec[n-1]
}
else
(max*3).times{|i|
total_size = caller(0).size
c = caller(i)
if c
assert_equal(total_size - i, caller(i).size, "[ruby-dev:45673]")
end
}
end
}
bt = Fiber.new{
rec[max]
}.resume
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
def test_caller_locations
cs = caller(0); locs = caller_locations(0).map{|loc|
loc.to_s
}
assert_equal(cs, locs)
end
def test_caller_locations_with_range
cs = caller(0,2); locs = caller_locations(0..1).map { |loc|
loc.to_s
}
assert_equal(cs, locs)
end
def test_caller_locations_to_s_inspect
cs = caller(0); locs = caller_locations(0)
cs.zip(locs){|str, loc|
assert_equal(str, loc.to_s)
assert_equal(str.inspect, loc.inspect)
}
end
def th_rec q, n=10
if n > 1
th_rec q, n-1
else
q.pop
end
end
def test_thread_backtrace
begin
q = Queue.new
th = Thread.new{
th_rec q
}
sleep 0.5
th_backtrace = th.backtrace
th_locations = th.backtrace_locations
assert_equal(10, th_backtrace.count{|e| e =~ /th_rec/})
assert_equal(th_backtrace, th_locations.map{|e| e.to_s})
assert_equal(th_backtrace, th.backtrace(0))
assert_equal(th_locations.map{|e| e.to_s},
th.backtrace_locations(0).map{|e| e.to_s})
th_backtrace.size.times{|n|
assert_equal(n, th.backtrace(0, n).size)
assert_equal(n, th.backtrace_locations(0, n).size)
}
n = th_backtrace.size
assert_equal(n, th.backtrace(0, n + 1).size)
assert_equal(n, th.backtrace_locations(0, n + 1).size)
ensure
q << true
end
end
def test_thread_backtrace_locations_with_range
begin
q = Queue.new
th = Thread.new{
th_rec q
}
sleep 0.5
bt = th.backtrace(0,2)
locs = th.backtrace_locations(0..1).map { |loc|
loc.to_s
}
assert_equal(bt, locs)
ensure
q << true
end
end
end
|
