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
|
import lldb
from lldbsuite.test.decorators import *
import lldbsuite.test.lldbtest as lldbtest
import lldbsuite.test.lldbutil as lldbutil
import unittest2
class TestSwiftAsyncBacktraceLocals(lldbtest.TestBase):
mydir = lldbtest.TestBase.compute_mydir(__file__)
def setUp(self):
# Call super's setUp().
lldbtest.TestBase.setUp(self)
self.src = lldb.SBFileSpec('main.swift')
self.fibo_naumbers = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
@swiftTest
@skipIfWindows
@skipIfLinux
@skipIf(archs=no_match(["arm64", "arm64e", "arm64_32", "x86_64"]))
def test(self):
"""Test async unwind"""
self.build()
target, process, thread, main_bkpt = lldbutil.run_to_source_breakpoint(
self, 'main breakpoint', self.src)
self.run_fibo_tests(target, process)
@swiftTest
@skipIfWindows
@skipIfLinux
@skipIf(archs=no_match(["arm64", "arm64e", "arm64_32", "x86_64"]))
def test_actor(self):
"""Test async unwind"""
self.build()
target, process, thread, main_bkpt = lldbutil.run_to_source_breakpoint(
self, 'main actor breakpoint', self.src)
self.run_fibo_tests(target, process)
def run_fibo_tests(self, target, process):
self.start_bkpt = target.BreakpointCreateBySourceRegex('function start', self.src, None)
self.end_bkpt = target.BreakpointCreateBySourceRegex('end recursion', self.src, None)
self.recurse_bkpt = target.BreakpointCreateBySourceRegex('recurse', self.src, None)
self.compute_bkpt = target.BreakpointCreateBySourceRegex('compute result', self.src, None)
# cfa[n] contains the CFA for the fibonacci(n) call.
cfa = [ None for _ in range(11) ]
# Continue 10 times, hitting all the initial calls to the fibonacci()
# function with decreasing arguments.
for n in range(10):
threads = lldbutil.continue_to_breakpoint(process, self.start_bkpt)
self.assertEqual(len(threads), 1, "Found 1 thread stopped at breakpoint")
thread = threads[0]
# The top frame is fibonacci(10-n)
for f in range(n+1):
frame = thread.GetFrameAtIndex(f)
# The selected frame is fibonacci(10-n+f)
fibonacci_number = 10-n+f
self.assertIn("fibonacci", frame.GetFunctionName(),
"Redundantly confirm that we're stopped in fibonacci()")
if not cfa[fibonacci_number]:
cfa[fibonacci_number] = frame.GetCFA()
else:
self.assertEqual(cfa[fibonacci_number], frame.GetCFA(),
"Stable CFA for the first 10 recursions")
# Get arguments (arguments, locals, statics, in_scope_only)
n_var = frame.FindVariable("n")
self.assertTrue(n_var, "Found 'n'")
self.assertEqual(n_var.GetValueAsSigned(), fibonacci_number,
"n has correct value (n=%d, f=%d)"%(n, f))
if f != 0:
# The PC of a logical frame is stored in its "callee"
# AsyncContext as the second pointer field.
error = lldb.SBError()
ret_addr = process.ReadPointerFromMemory(
cfa[fibonacci_number-1] + target.addr_size, error)
prologue_to_skip = frame.GetFunction().GetPrologueByteSize()
self.assertSuccess(error, "Managed to read context memory")
self.assertEqual(ret_addr + prologue_to_skip, frame.GetPC())
self.assertIn("Main.main", thread.GetFrameAtIndex(n+1).GetFunctionName())
# After having stopped at all the entry points, we stop at the end recursion
# breakpoint.
thread = lldbutil.continue_to_breakpoint(process, self.end_bkpt)
frame = thread[0].GetFrameAtIndex(0)
args = frame.GetVariables(True, False, False, True)
n_var = frame.FindVariable("n")
self.assertEqual(n_var.GetValueAsSigned(), 1, "n has correct value")
# Callers have n values from 2 to 10
for n in range(1,9):
frame = thread[0].GetFrameAtIndex(n)
n_var = frame.FindVariable("n")
self.assertEqual(n_var.GetValueAsSigned(), n+1, "n has correct value")
# Once we got our first result from the end recursion above, we continue
# executing to the second recursion
thread = lldbutil.continue_to_breakpoint(process, self.recurse_bkpt)
self.assertNotEqual(len(thread), 0, "Hit the correct breakpoint")
frame = thread[0].GetFrameAtIndex(0)
n_var = frame.FindVariable("n")
self.assertEqual(n_var.GetValueAsSigned(), 2, "n has correct value")
# Callers have n values from 3 to 10
for n in range(1,8):
frame = thread[0].GetFrameAtIndex(n)
n_var = frame.FindVariable("n")
self.assertEqual(n_var.GetValueAsSigned(), n+2, "n has correct value")
# The second recursion leads us to a new entry in the function with n == 0
thread = lldbutil.continue_to_breakpoint(process, self.start_bkpt)
self.assertNotEqual(len(thread), 0, "Hit the correct breakpoint")
frame = thread[0].GetFrameAtIndex(0)
n_var = frame.FindVariable("n")
self.assertEqual(n_var.GetValueAsSigned(), 0, "n has correct value")
# Callers have n values from 2 to 10
for n in range(1,9):
frame = thread[0].GetFrameAtIndex(n)
n_var = frame.FindVariable("n")
self.assertEqual(n_var.GetValueAsSigned(), n+1, "n has correct value")
# Let's disable all intermediate breakpoints and verify that we can access
# the locals in the last part of the function.
self.start_bkpt.SetEnabled(False)
self.end_bkpt.SetEnabled(False)
self.recurse_bkpt.SetEnabled(False)
last_result = None
while True:
thread = lldbutil.continue_to_breakpoint(process, self.compute_bkpt)
if len(thread) == 0:
self.assertEqual(last_result, 55, "Computed the right final value")
break
frame = thread[0].GetFrameAtIndex(0)
n_var = frame.FindVariable("n")
self.assertTrue(n_var, "Found n")
n_1_var = frame.FindVariable("n_1")
self.assertTrue(n_1_var, "Found n_1")
n_2_var = frame.FindVariable("n_2")
self.assertTrue(n_2_var, "Found n_2")
n_val = n_var.GetValueAsSigned()
self.assertEqual(n_1_var.GetValueAsSigned(), self.fibo_naumbers[n_val - 1],
"n_1 has correct value")
self.assertEqual(n_2_var.GetValueAsSigned(), self.fibo_naumbers[n_val - 2],
"n_2 has correct value")
last_result = self.fibo_naumbers[n_val]
|
