180814287SRaphael Isemann //===-- StackFrameList.cpp ------------------------------------------------===//
230fdc8d8SChris Lattner //
32946cd70SChandler Carruth // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
42946cd70SChandler Carruth // See https://llvm.org/LICENSE.txt for license information.
52946cd70SChandler Carruth // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
630fdc8d8SChris Lattner //
730fdc8d8SChris Lattner //===----------------------------------------------------------------------===//
830fdc8d8SChris Lattner 
9d70a6e71SEugene Zelenko #include "lldb/Target/StackFrameList.h"
10c635500dSJim Ingham #include "lldb/Breakpoint/Breakpoint.h"
11b9c1b51eSKate Stone #include "lldb/Breakpoint/BreakpointLocation.h"
12b7f6b2faSJim Ingham #include "lldb/Core/SourceManager.h"
13b9c1b51eSKate Stone #include "lldb/Core/StreamFile.h"
1412daf946SGreg Clayton #include "lldb/Symbol/Block.h"
1512daf946SGreg Clayton #include "lldb/Symbol/Function.h"
1659e8fc1cSGreg Clayton #include "lldb/Symbol/Symbol.h"
17b7f6b2faSJim Ingham #include "lldb/Target/Process.h"
1812daf946SGreg Clayton #include "lldb/Target/RegisterContext.h"
1930fdc8d8SChris Lattner #include "lldb/Target/StackFrame.h"
20513c6bb8SJim Ingham #include "lldb/Target/StopInfo.h"
21b7f6b2faSJim Ingham #include "lldb/Target/Target.h"
2212daf946SGreg Clayton #include "lldb/Target/Thread.h"
2312daf946SGreg Clayton #include "lldb/Target/Unwind.h"
246f9e6901SZachary Turner #include "lldb/Utility/Log.h"
254b36f791SVedant Kumar #include "llvm/ADT/SmallPtrSet.h"
2630fdc8d8SChris Lattner 
27796ac80bSJonas Devlieghere #include <memory>
28796ac80bSJonas Devlieghere 
295082c5fdSGreg Clayton //#define DEBUG_STACK_FRAMES 1
305082c5fdSGreg Clayton 
3130fdc8d8SChris Lattner using namespace lldb;
3230fdc8d8SChris Lattner using namespace lldb_private;
3330fdc8d8SChris Lattner 
3430fdc8d8SChris Lattner // StackFrameList constructor
35b9c1b51eSKate Stone StackFrameList::StackFrameList(Thread &thread,
36b9c1b51eSKate Stone                                const lldb::StackFrameListSP &prev_frames_sp,
37b9c1b51eSKate Stone                                bool show_inline_frames)
38b9c1b51eSKate Stone     : m_thread(thread), m_prev_frames_sp(prev_frames_sp), m_mutex(), m_frames(),
39b9c1b51eSKate Stone       m_selected_frame_idx(0), m_concrete_frames_fetched(0),
40513c6bb8SJim Ingham       m_current_inlined_depth(UINT32_MAX),
41513c6bb8SJim Ingham       m_current_inlined_pc(LLDB_INVALID_ADDRESS),
42b9c1b51eSKate Stone       m_show_inlined_frames(show_inline_frames) {
43b9c1b51eSKate Stone   if (prev_frames_sp) {
44513c6bb8SJim Ingham     m_current_inlined_depth = prev_frames_sp->m_current_inlined_depth;
45513c6bb8SJim Ingham     m_current_inlined_pc = prev_frames_sp->m_current_inlined_pc;
46513c6bb8SJim Ingham   }
4730fdc8d8SChris Lattner }
4830fdc8d8SChris Lattner 
49b9c1b51eSKate Stone StackFrameList::~StackFrameList() {
5005097246SAdrian Prantl   // Call clear since this takes a lock and clears the stack frame list in case
5105097246SAdrian Prantl   // another thread is currently using this stack frame list
52ca5ce187SGreg Clayton   Clear();
5330fdc8d8SChris Lattner }
5430fdc8d8SChris Lattner 
55b9c1b51eSKate Stone void StackFrameList::CalculateCurrentInlinedDepth() {
56513c6bb8SJim Ingham   uint32_t cur_inlined_depth = GetCurrentInlinedDepth();
57b9c1b51eSKate Stone   if (cur_inlined_depth == UINT32_MAX) {
58513c6bb8SJim Ingham     ResetCurrentInlinedDepth();
59513c6bb8SJim Ingham   }
60513c6bb8SJim Ingham }
61513c6bb8SJim Ingham 
62b9c1b51eSKate Stone uint32_t StackFrameList::GetCurrentInlinedDepth() {
63b9c1b51eSKate Stone   if (m_show_inlined_frames && m_current_inlined_pc != LLDB_INVALID_ADDRESS) {
64513c6bb8SJim Ingham     lldb::addr_t cur_pc = m_thread.GetRegisterContext()->GetPC();
65b9c1b51eSKate Stone     if (cur_pc != m_current_inlined_pc) {
66513c6bb8SJim Ingham       m_current_inlined_pc = LLDB_INVALID_ADDRESS;
67513c6bb8SJim Ingham       m_current_inlined_depth = UINT32_MAX;
685160ce5cSGreg Clayton       Log *log(lldb_private::GetLogIfAllCategoriesSet(LIBLLDB_LOG_STEP));
696cd41da7SJim Ingham       if (log && log->GetVerbose())
7063e5fb76SJonas Devlieghere         LLDB_LOGF(
7163e5fb76SJonas Devlieghere             log,
72b9c1b51eSKate Stone             "GetCurrentInlinedDepth: invalidating current inlined depth.\n");
73513c6bb8SJim Ingham     }
74513c6bb8SJim Ingham     return m_current_inlined_depth;
75b9c1b51eSKate Stone   } else {
76513c6bb8SJim Ingham     return UINT32_MAX;
77513c6bb8SJim Ingham   }
78513c6bb8SJim Ingham }
79513c6bb8SJim Ingham 
80b9c1b51eSKate Stone void StackFrameList::ResetCurrentInlinedDepth() {
81e7167e03SVedant Kumar   if (!m_show_inlined_frames)
82e7167e03SVedant Kumar     return;
83e7167e03SVedant Kumar 
84bb19a13cSSaleem Abdulrasool   std::lock_guard<std::recursive_mutex> guard(m_mutex);
8547db4a2cSKeno Fischer 
86513c6bb8SJim Ingham   GetFramesUpTo(0);
87d70a6e71SEugene Zelenko   if (m_frames.empty())
8865d4d5c3SRyan Brown     return;
89b9c1b51eSKate Stone   if (!m_frames[0]->IsInlined()) {
90513c6bb8SJim Ingham     m_current_inlined_depth = UINT32_MAX;
91513c6bb8SJim Ingham     m_current_inlined_pc = LLDB_INVALID_ADDRESS;
925160ce5cSGreg Clayton     Log *log(lldb_private::GetLogIfAllCategoriesSet(LIBLLDB_LOG_STEP));
936cd41da7SJim Ingham     if (log && log->GetVerbose())
9463e5fb76SJonas Devlieghere       LLDB_LOGF(
9563e5fb76SJonas Devlieghere           log,
96b9c1b51eSKate Stone           "ResetCurrentInlinedDepth: Invalidating current inlined depth.\n");
97e7167e03SVedant Kumar     return;
98e7167e03SVedant Kumar   }
99e7167e03SVedant Kumar 
10005097246SAdrian Prantl   // We only need to do something special about inlined blocks when we are
10105097246SAdrian Prantl   // at the beginning of an inlined function:
102b9c1b51eSKate Stone   // FIXME: We probably also have to do something special if the PC is at
103e7167e03SVedant Kumar   // the END of an inlined function, which coincides with the end of either
104e7167e03SVedant Kumar   // its containing function or another inlined function.
105513c6bb8SJim Ingham 
106513c6bb8SJim Ingham   Block *block_ptr = m_frames[0]->GetFrameBlock();
107e7167e03SVedant Kumar   if (!block_ptr)
108e7167e03SVedant Kumar     return;
109e7167e03SVedant Kumar 
110513c6bb8SJim Ingham   Address pc_as_address;
111e7167e03SVedant Kumar   lldb::addr_t curr_pc = m_thread.GetRegisterContext()->GetPC();
112e7167e03SVedant Kumar   pc_as_address.SetLoadAddress(curr_pc, &(m_thread.GetProcess()->GetTarget()));
113513c6bb8SJim Ingham   AddressRange containing_range;
114e7167e03SVedant Kumar   if (!block_ptr->GetRangeContainingAddress(pc_as_address, containing_range) ||
115e7167e03SVedant Kumar       pc_as_address != containing_range.GetBaseAddress())
116e7167e03SVedant Kumar     return;
117e7167e03SVedant Kumar 
118e7167e03SVedant Kumar   // If we got here because of a breakpoint hit, then set the inlined depth
119e7167e03SVedant Kumar   // depending on where the breakpoint was set. If we got here because of a
120e7167e03SVedant Kumar   // crash, then set the inlined depth to the deepest most block.  Otherwise,
121e7167e03SVedant Kumar   // we stopped here naturally as the result of a step, so set ourselves in the
122e7167e03SVedant Kumar   // containing frame of the whole set of nested inlines, so the user can then
123e7167e03SVedant Kumar   // "virtually" step into the frames one by one, or next over the whole mess.
124e7167e03SVedant Kumar   // Note: We don't have to handle being somewhere in the middle of the stack
125e7167e03SVedant Kumar   // here, since ResetCurrentInlinedDepth doesn't get called if there is a
126e7167e03SVedant Kumar   // valid inlined depth set.
127513c6bb8SJim Ingham   StopInfoSP stop_info_sp = m_thread.GetStopInfo();
128e7167e03SVedant Kumar   if (!stop_info_sp)
129e7167e03SVedant Kumar     return;
130b9c1b51eSKate Stone   switch (stop_info_sp->GetStopReason()) {
131513c6bb8SJim Ingham   case eStopReasonWatchpoint:
132513c6bb8SJim Ingham   case eStopReasonException:
13390ba8115SGreg Clayton   case eStopReasonExec:
134*6c37984eSMichał Górny   case eStopReasonFork:
135*6c37984eSMichał Górny   case eStopReasonVFork:
136*6c37984eSMichał Górny   case eStopReasonVForkDone:
137513c6bb8SJim Ingham   case eStopReasonSignal:
138e7167e03SVedant Kumar     // In all these cases we want to stop in the deepest frame.
139513c6bb8SJim Ingham     m_current_inlined_pc = curr_pc;
140513c6bb8SJim Ingham     m_current_inlined_depth = 0;
141513c6bb8SJim Ingham     break;
142b9c1b51eSKate Stone   case eStopReasonBreakpoint: {
143e7167e03SVedant Kumar     // FIXME: Figure out what this break point is doing, and set the inline
144e7167e03SVedant Kumar     // depth appropriately.  Be careful to take into account breakpoints that
145e7167e03SVedant Kumar     // implement step over prologue, since that should do the default
146e7167e03SVedant Kumar     // calculation. For now, if the breakpoints corresponding to this hit are
147e7167e03SVedant Kumar     // all internal, I set the stop location to the top of the inlined stack,
148e7167e03SVedant Kumar     // since that will make things like stepping over prologues work right.
149e7167e03SVedant Kumar     // But if there are any non-internal breakpoints I do to the bottom of the
150e7167e03SVedant Kumar     // stack, since that was the old behavior.
151c635500dSJim Ingham     uint32_t bp_site_id = stop_info_sp->GetValue();
152b9c1b51eSKate Stone     BreakpointSiteSP bp_site_sp(
153e7167e03SVedant Kumar         m_thread.GetProcess()->GetBreakpointSiteList().FindByID(bp_site_id));
154c635500dSJim Ingham     bool all_internal = true;
155b9c1b51eSKate Stone     if (bp_site_sp) {
156c635500dSJim Ingham       uint32_t num_owners = bp_site_sp->GetNumberOfOwners();
157b9c1b51eSKate Stone       for (uint32_t i = 0; i < num_owners; i++) {
158e7167e03SVedant Kumar         Breakpoint &bp_ref = bp_site_sp->GetOwnerAtIndex(i)->GetBreakpoint();
159b9c1b51eSKate Stone         if (!bp_ref.IsInternal()) {
160c635500dSJim Ingham           all_internal = false;
161c635500dSJim Ingham         }
162c635500dSJim Ingham       }
163c635500dSJim Ingham     }
164b9c1b51eSKate Stone     if (!all_internal) {
165c635500dSJim Ingham       m_current_inlined_pc = curr_pc;
166c635500dSJim Ingham       m_current_inlined_depth = 0;
167c635500dSJim Ingham       break;
168c635500dSJim Ingham     }
1697da851a3SJim Ingham   }
170cec91ef9SGreg Clayton     LLVM_FALLTHROUGH;
171b9c1b51eSKate Stone   default: {
172e7167e03SVedant Kumar     // Otherwise, we should set ourselves at the container of the inlining, so
173e7167e03SVedant Kumar     // that the user can descend into them. So first we check whether we have
174e7167e03SVedant Kumar     // more than one inlined block sharing this PC:
175513c6bb8SJim Ingham     int num_inlined_functions = 0;
176513c6bb8SJim Ingham 
177513c6bb8SJim Ingham     for (Block *container_ptr = block_ptr->GetInlinedParent();
178d70a6e71SEugene Zelenko          container_ptr != nullptr;
179b9c1b51eSKate Stone          container_ptr = container_ptr->GetInlinedParent()) {
180e7167e03SVedant Kumar       if (!container_ptr->GetRangeContainingAddress(pc_as_address,
181e7167e03SVedant Kumar                                                     containing_range))
182513c6bb8SJim Ingham         break;
183513c6bb8SJim Ingham       if (pc_as_address != containing_range.GetBaseAddress())
184513c6bb8SJim Ingham         break;
185513c6bb8SJim Ingham 
186513c6bb8SJim Ingham       num_inlined_functions++;
187513c6bb8SJim Ingham     }
188513c6bb8SJim Ingham     m_current_inlined_pc = curr_pc;
189513c6bb8SJim Ingham     m_current_inlined_depth = num_inlined_functions + 1;
190e7167e03SVedant Kumar     Log *log(lldb_private::GetLogIfAllCategoriesSet(LIBLLDB_LOG_STEP));
1916cd41da7SJim Ingham     if (log && log->GetVerbose())
19263e5fb76SJonas Devlieghere       LLDB_LOGF(log,
19363e5fb76SJonas Devlieghere                 "ResetCurrentInlinedDepth: setting inlined "
194b9c1b51eSKate Stone                 "depth: %d 0x%" PRIx64 ".\n",
195b9c1b51eSKate Stone                 m_current_inlined_depth, curr_pc);
196513c6bb8SJim Ingham 
197e7167e03SVedant Kumar     break;
198513c6bb8SJim Ingham   }
199513c6bb8SJim Ingham   }
200513c6bb8SJim Ingham }
201513c6bb8SJim Ingham 
202b9c1b51eSKate Stone bool StackFrameList::DecrementCurrentInlinedDepth() {
203b9c1b51eSKate Stone   if (m_show_inlined_frames) {
204513c6bb8SJim Ingham     uint32_t current_inlined_depth = GetCurrentInlinedDepth();
205b9c1b51eSKate Stone     if (current_inlined_depth != UINT32_MAX) {
206b9c1b51eSKate Stone       if (current_inlined_depth > 0) {
207513c6bb8SJim Ingham         m_current_inlined_depth--;
208513c6bb8SJim Ingham         return true;
209513c6bb8SJim Ingham       }
210513c6bb8SJim Ingham     }
2119786eeebSJim Ingham   }
212513c6bb8SJim Ingham   return false;
213513c6bb8SJim Ingham }
214513c6bb8SJim Ingham 
215b9c1b51eSKate Stone void StackFrameList::SetCurrentInlinedDepth(uint32_t new_depth) {
2166cd41da7SJim Ingham   m_current_inlined_depth = new_depth;
2176cd41da7SJim Ingham   if (new_depth == UINT32_MAX)
2186cd41da7SJim Ingham     m_current_inlined_pc = LLDB_INVALID_ADDRESS;
2196cd41da7SJim Ingham   else
2206cd41da7SJim Ingham     m_current_inlined_pc = m_thread.GetRegisterContext()->GetPC();
2216cd41da7SJim Ingham }
2226cd41da7SJim Ingham 
223eb8fa58eSVedant Kumar void StackFrameList::GetOnlyConcreteFramesUpTo(uint32_t end_idx,
224c0b1af68SPavel Labath                                                Unwind &unwinder) {
225eb8fa58eSVedant Kumar   assert(m_thread.IsValid() && "Expected valid thread");
226eb8fa58eSVedant Kumar   assert(m_frames.size() <= end_idx && "Expected there to be frames to fill");
227eb8fa58eSVedant Kumar 
228eb8fa58eSVedant Kumar   if (end_idx < m_concrete_frames_fetched)
229eb8fa58eSVedant Kumar     return;
230eb8fa58eSVedant Kumar 
231c0b1af68SPavel Labath   uint32_t num_frames = unwinder.GetFramesUpTo(end_idx);
232eb8fa58eSVedant Kumar   if (num_frames <= end_idx + 1) {
233eb8fa58eSVedant Kumar     // Done unwinding.
234eb8fa58eSVedant Kumar     m_concrete_frames_fetched = UINT32_MAX;
235eb8fa58eSVedant Kumar   }
23633e51b14SVedant Kumar 
23733e51b14SVedant Kumar   // Don't create the frames eagerly. Defer this work to GetFrameAtIndex,
23833e51b14SVedant Kumar   // which can lazily query the unwinder to create frames.
239eb8fa58eSVedant Kumar   m_frames.resize(num_frames);
240eb8fa58eSVedant Kumar }
241eb8fa58eSVedant Kumar 
24203e29e2cSVedant Kumar /// A sequence of calls that comprise some portion of a backtrace. Each frame
24303e29e2cSVedant Kumar /// is represented as a pair of a callee (Function *) and an address within the
24403e29e2cSVedant Kumar /// callee.
2450081149fSPavel Labath struct CallDescriptor {
2460081149fSPavel Labath   Function *func;
24717798c60SPavel Labath   CallEdge::AddrType address_type = CallEdge::AddrType::Call;
24817798c60SPavel Labath   addr_t address = LLDB_INVALID_ADDRESS;
2490081149fSPavel Labath };
2500081149fSPavel Labath using CallSequence = std::vector<CallDescriptor>;
25103e29e2cSVedant Kumar 
2524b36f791SVedant Kumar /// Find the unique path through the call graph from \p begin (with return PC
2534b36f791SVedant Kumar /// \p return_pc) to \p end. On success this path is stored into \p path, and
2544b36f791SVedant Kumar /// on failure \p path is unchanged.
2554b36f791SVedant Kumar static void FindInterveningFrames(Function &begin, Function &end,
2564fdbc072SVedant Kumar                                   ExecutionContext &exe_ctx, Target &target,
25703e29e2cSVedant Kumar                                   addr_t return_pc, CallSequence &path,
2584b36f791SVedant Kumar                                   ModuleList &images, Log *log) {
2594b36f791SVedant Kumar   LLDB_LOG(log, "Finding frames between {0} and {1}, retn-pc={2:x}",
2604b36f791SVedant Kumar            begin.GetDisplayName(), end.GetDisplayName(), return_pc);
2614b36f791SVedant Kumar 
2624b36f791SVedant Kumar   // Find a non-tail calling edge with the correct return PC.
2634b36f791SVedant Kumar   if (log)
2644fdbc072SVedant Kumar     for (const auto &edge : begin.GetCallEdges())
2654b36f791SVedant Kumar       LLDB_LOG(log, "FindInterveningFrames: found call with retn-PC = {0:x}",
2664fdbc072SVedant Kumar                edge->GetReturnPCAddress(begin, target));
267ff02109aSVedant Kumar   CallEdge *first_edge = begin.GetCallEdgeForReturnAddress(return_pc, target);
268ff02109aSVedant Kumar   if (!first_edge) {
2694b36f791SVedant Kumar     LLDB_LOG(log, "No call edge outgoing from {0} with retn-PC == {1:x}",
2704b36f791SVedant Kumar              begin.GetDisplayName(), return_pc);
2714b36f791SVedant Kumar     return;
2724b36f791SVedant Kumar   }
2734b36f791SVedant Kumar 
2744b36f791SVedant Kumar   // The first callee may not be resolved, or there may be nothing to fill in.
2754fdbc072SVedant Kumar   Function *first_callee = first_edge->GetCallee(images, exe_ctx);
2764b36f791SVedant Kumar   if (!first_callee) {
2774b36f791SVedant Kumar     LLDB_LOG(log, "Could not resolve callee");
2784b36f791SVedant Kumar     return;
2794b36f791SVedant Kumar   }
2804b36f791SVedant Kumar   if (first_callee == &end) {
2814b36f791SVedant Kumar     LLDB_LOG(log, "Not searching further, first callee is {0} (retn-PC: {1:x})",
2824b36f791SVedant Kumar              end.GetDisplayName(), return_pc);
2834b36f791SVedant Kumar     return;
2844b36f791SVedant Kumar   }
2854b36f791SVedant Kumar 
2864b36f791SVedant Kumar   // Run DFS on the tail-calling edges out of the first callee to find \p end.
2874b36f791SVedant Kumar   // Fully explore the set of functions reachable from the first edge via tail
2884b36f791SVedant Kumar   // calls in order to detect ambiguous executions.
2894b36f791SVedant Kumar   struct DFS {
29003e29e2cSVedant Kumar     CallSequence active_path = {};
29103e29e2cSVedant Kumar     CallSequence solution_path = {};
2924b36f791SVedant Kumar     llvm::SmallPtrSet<Function *, 2> visited_nodes = {};
2934b36f791SVedant Kumar     bool ambiguous = false;
2944b36f791SVedant Kumar     Function *end;
2954b36f791SVedant Kumar     ModuleList &images;
29603e29e2cSVedant Kumar     Target &target;
2974fdbc072SVedant Kumar     ExecutionContext &context;
2984b36f791SVedant Kumar 
29903e29e2cSVedant Kumar     DFS(Function *end, ModuleList &images, Target &target,
30003e29e2cSVedant Kumar         ExecutionContext &context)
30103e29e2cSVedant Kumar         : end(end), images(images), target(target), context(context) {}
3024b36f791SVedant Kumar 
30303e29e2cSVedant Kumar     void search(CallEdge &first_edge, Function &first_callee,
30403e29e2cSVedant Kumar                 CallSequence &path) {
30503e29e2cSVedant Kumar       dfs(first_edge, first_callee);
3064b36f791SVedant Kumar       if (!ambiguous)
3074b36f791SVedant Kumar         path = std::move(solution_path);
3084b36f791SVedant Kumar     }
3094b36f791SVedant Kumar 
31003e29e2cSVedant Kumar     void dfs(CallEdge &current_edge, Function &callee) {
3114b36f791SVedant Kumar       // Found a path to the target function.
312c03c2e88SVedant Kumar       if (&callee == end) {
3134b36f791SVedant Kumar         if (solution_path.empty())
3144b36f791SVedant Kumar           solution_path = active_path;
3154b36f791SVedant Kumar         else
3164b36f791SVedant Kumar           ambiguous = true;
3174b36f791SVedant Kumar         return;
3184b36f791SVedant Kumar       }
3194b36f791SVedant Kumar 
3204b36f791SVedant Kumar       // Terminate the search if tail recursion is found, or more generally if
3214b36f791SVedant Kumar       // there's more than one way to reach a target. This errs on the side of
3224b36f791SVedant Kumar       // caution: it conservatively stops searching when some solutions are
3234b36f791SVedant Kumar       // still possible to save time in the average case.
324c03c2e88SVedant Kumar       if (!visited_nodes.insert(&callee).second) {
3254b36f791SVedant Kumar         ambiguous = true;
3264b36f791SVedant Kumar         return;
3274b36f791SVedant Kumar       }
3284b36f791SVedant Kumar 
3294b36f791SVedant Kumar       // Search the calls made from this callee.
3300081149fSPavel Labath       active_path.push_back(CallDescriptor{&callee});
3314fdbc072SVedant Kumar       for (const auto &edge : callee.GetTailCallingEdges()) {
3324fdbc072SVedant Kumar         Function *next_callee = edge->GetCallee(images, context);
3334b36f791SVedant Kumar         if (!next_callee)
3344b36f791SVedant Kumar           continue;
3354b36f791SVedant Kumar 
3360081149fSPavel Labath         std::tie(active_path.back().address_type, active_path.back().address) =
3370081149fSPavel Labath             edge->GetCallerAddress(callee, target);
33803e29e2cSVedant Kumar 
33903e29e2cSVedant Kumar         dfs(*edge, *next_callee);
3404b36f791SVedant Kumar         if (ambiguous)
3414b36f791SVedant Kumar           return;
3424b36f791SVedant Kumar       }
3434b36f791SVedant Kumar       active_path.pop_back();
3444b36f791SVedant Kumar     }
3454b36f791SVedant Kumar   };
3464b36f791SVedant Kumar 
34703e29e2cSVedant Kumar   DFS(&end, images, target, exe_ctx).search(*first_edge, *first_callee, path);
3484b36f791SVedant Kumar }
3494b36f791SVedant Kumar 
3504b36f791SVedant Kumar /// Given that \p next_frame will be appended to the frame list, synthesize
3514b36f791SVedant Kumar /// tail call frames between the current end of the list and \p next_frame.
3524b36f791SVedant Kumar /// If any frames are added, adjust the frame index of \p next_frame.
3534b36f791SVedant Kumar ///
3544b36f791SVedant Kumar ///   --------------
3554b36f791SVedant Kumar ///   |    ...     | <- Completed frames.
3564b36f791SVedant Kumar ///   --------------
3574b36f791SVedant Kumar ///   | prev_frame |
3584b36f791SVedant Kumar ///   --------------
3594b36f791SVedant Kumar ///   |    ...     | <- Artificial frames inserted here.
3604b36f791SVedant Kumar ///   --------------
3614b36f791SVedant Kumar ///   | next_frame |
3624b36f791SVedant Kumar ///   --------------
3634b36f791SVedant Kumar ///   |    ...     | <- Not-yet-visited frames.
3644b36f791SVedant Kumar ///   --------------
3654b36f791SVedant Kumar void StackFrameList::SynthesizeTailCallFrames(StackFrame &next_frame) {
366e05af081SVedant Kumar   // Cannot synthesize tail call frames when the stack is empty (there is no
367e05af081SVedant Kumar   // "previous" frame).
368e05af081SVedant Kumar   if (m_frames.empty())
369e05af081SVedant Kumar     return;
370e05af081SVedant Kumar 
3714b36f791SVedant Kumar   TargetSP target_sp = next_frame.CalculateTarget();
3724b36f791SVedant Kumar   if (!target_sp)
3734b36f791SVedant Kumar     return;
3744b36f791SVedant Kumar 
3754b36f791SVedant Kumar   lldb::RegisterContextSP next_reg_ctx_sp = next_frame.GetRegisterContext();
3764b36f791SVedant Kumar   if (!next_reg_ctx_sp)
3774b36f791SVedant Kumar     return;
3784b36f791SVedant Kumar 
3794b36f791SVedant Kumar   Log *log(lldb_private::GetLogIfAllCategoriesSet(LIBLLDB_LOG_STEP));
3804b36f791SVedant Kumar 
3814b36f791SVedant Kumar   StackFrame &prev_frame = *m_frames.back().get();
3824b36f791SVedant Kumar 
3834b36f791SVedant Kumar   // Find the functions prev_frame and next_frame are stopped in. The function
3844b36f791SVedant Kumar   // objects are needed to search the lazy call graph for intervening frames.
3854b36f791SVedant Kumar   Function *prev_func =
3864b36f791SVedant Kumar       prev_frame.GetSymbolContext(eSymbolContextFunction).function;
3874b36f791SVedant Kumar   if (!prev_func) {
3884b36f791SVedant Kumar     LLDB_LOG(log, "SynthesizeTailCallFrames: can't find previous function");
3894b36f791SVedant Kumar     return;
3904b36f791SVedant Kumar   }
3914b36f791SVedant Kumar   Function *next_func =
3924b36f791SVedant Kumar       next_frame.GetSymbolContext(eSymbolContextFunction).function;
3934b36f791SVedant Kumar   if (!next_func) {
3944b36f791SVedant Kumar     LLDB_LOG(log, "SynthesizeTailCallFrames: can't find next function");
3954b36f791SVedant Kumar     return;
3964b36f791SVedant Kumar   }
3974b36f791SVedant Kumar 
3984b36f791SVedant Kumar   // Try to find the unique sequence of (tail) calls which led from next_frame
3994b36f791SVedant Kumar   // to prev_frame.
40003e29e2cSVedant Kumar   CallSequence path;
4014b36f791SVedant Kumar   addr_t return_pc = next_reg_ctx_sp->GetPC();
4024b36f791SVedant Kumar   Target &target = *target_sp.get();
4034b36f791SVedant Kumar   ModuleList &images = next_frame.CalculateTarget()->GetImages();
4044fdbc072SVedant Kumar   ExecutionContext exe_ctx(target_sp, /*get_process=*/true);
4054fdbc072SVedant Kumar   exe_ctx.SetFramePtr(&next_frame);
4064fdbc072SVedant Kumar   FindInterveningFrames(*next_func, *prev_func, exe_ctx, target, return_pc,
4074fdbc072SVedant Kumar                         path, images, log);
4084b36f791SVedant Kumar 
4094b36f791SVedant Kumar   // Push synthetic tail call frames.
41003e29e2cSVedant Kumar   for (auto calleeInfo : llvm::reverse(path)) {
4110081149fSPavel Labath     Function *callee = calleeInfo.func;
4124b36f791SVedant Kumar     uint32_t frame_idx = m_frames.size();
4134b36f791SVedant Kumar     uint32_t concrete_frame_idx = next_frame.GetConcreteFrameIndex();
4144b36f791SVedant Kumar     addr_t cfa = LLDB_INVALID_ADDRESS;
4154b36f791SVedant Kumar     bool cfa_is_valid = false;
4160081149fSPavel Labath     addr_t pc = calleeInfo.address;
4170081149fSPavel Labath     // If the callee address refers to the call instruction, we do not want to
4180081149fSPavel Labath     // subtract 1 from this value.
4190081149fSPavel Labath     const bool behaves_like_zeroth_frame =
4200081149fSPavel Labath         calleeInfo.address_type == CallEdge::AddrType::Call;
4214b36f791SVedant Kumar     SymbolContext sc;
4224b36f791SVedant Kumar     callee->CalculateSymbolContext(&sc);
4234b36f791SVedant Kumar     auto synth_frame = std::make_shared<StackFrame>(
4244b36f791SVedant Kumar         m_thread.shared_from_this(), frame_idx, concrete_frame_idx, cfa,
42531e6dbe1SJoseph Tremoulet         cfa_is_valid, pc, StackFrame::Kind::Artificial,
42631e6dbe1SJoseph Tremoulet         behaves_like_zeroth_frame, &sc);
4274b36f791SVedant Kumar     m_frames.push_back(synth_frame);
42803e29e2cSVedant Kumar     LLDB_LOG(log, "Pushed frame {0} at {1:x}", callee->GetDisplayName(), pc);
4294b36f791SVedant Kumar   }
4304b36f791SVedant Kumar 
4314b36f791SVedant Kumar   // If any frames were created, adjust next_frame's index.
4324b36f791SVedant Kumar   if (!path.empty())
4334b36f791SVedant Kumar     next_frame.SetFrameIndex(m_frames.size());
4344b36f791SVedant Kumar }
4354b36f791SVedant Kumar 
436b9c1b51eSKate Stone void StackFrameList::GetFramesUpTo(uint32_t end_idx) {
437eb8fa58eSVedant Kumar   // Do not fetch frames for an invalid thread.
438d70a6e71SEugene Zelenko   if (!m_thread.IsValid())
439ebafd2f1SEnrico Granata     return;
440ebafd2f1SEnrico Granata 
441b9c1b51eSKate Stone   // We've already gotten more frames than asked for, or we've already finished
442b9c1b51eSKate Stone   // unwinding, return.
443b0c72a5fSJim Ingham   if (m_frames.size() > end_idx || GetAllFramesFetched())
444b0c72a5fSJim Ingham     return;
44512daf946SGreg Clayton 
446c0b1af68SPavel Labath   Unwind &unwinder = m_thread.GetUnwinder();
447b0c72a5fSJim Ingham 
448eb8fa58eSVedant Kumar   if (!m_show_inlined_frames) {
449eb8fa58eSVedant Kumar     GetOnlyConcreteFramesUpTo(end_idx, unwinder);
450eb8fa58eSVedant Kumar     return;
451eb8fa58eSVedant Kumar   }
452eb8fa58eSVedant Kumar 
4535082c5fdSGreg Clayton #if defined(DEBUG_STACK_FRAMES)
4542c595273SJohnny Chen   StreamFile s(stdout, false);
4555082c5fdSGreg Clayton #endif
45605097246SAdrian Prantl   // If we are hiding some frames from the outside world, we need to add
45705097246SAdrian Prantl   // those onto the total count of frames to fetch.  However, we don't need
45805097246SAdrian Prantl   // to do that if end_idx is 0 since in that case we always get the first
45905097246SAdrian Prantl   // concrete frame and all the inlined frames below it...  And of course, if
46005097246SAdrian Prantl   // end_idx is UINT32_MAX that means get all, so just do that...
461513c6bb8SJim Ingham 
462513c6bb8SJim Ingham   uint32_t inlined_depth = 0;
463b9c1b51eSKate Stone   if (end_idx > 0 && end_idx != UINT32_MAX) {
464513c6bb8SJim Ingham     inlined_depth = GetCurrentInlinedDepth();
465b9c1b51eSKate Stone     if (inlined_depth != UINT32_MAX) {
466513c6bb8SJim Ingham       if (end_idx > 0)
467513c6bb8SJim Ingham         end_idx += inlined_depth;
468513c6bb8SJim Ingham     }
469513c6bb8SJim Ingham   }
47012daf946SGreg Clayton 
471b57e4a1bSJason Molenda   StackFrameSP unwind_frame_sp;
472b9c1b51eSKate Stone   do {
473b0c72a5fSJim Ingham     uint32_t idx = m_concrete_frames_fetched++;
4748012cadbSGreg Clayton     lldb::addr_t pc = LLDB_INVALID_ADDRESS;
4758012cadbSGreg Clayton     lldb::addr_t cfa = LLDB_INVALID_ADDRESS;
47631e6dbe1SJoseph Tremoulet     bool behaves_like_zeroth_frame = (idx == 0);
477b9c1b51eSKate Stone     if (idx == 0) {
47805097246SAdrian Prantl       // We might have already created frame zero, only create it if we need
479eb8fa58eSVedant Kumar       // to.
480b9c1b51eSKate Stone       if (m_frames.empty()) {
481b3ae8761SGreg Clayton         RegisterContextSP reg_ctx_sp(m_thread.GetRegisterContext());
482b3ae8761SGreg Clayton 
483b9c1b51eSKate Stone         if (reg_ctx_sp) {
484c0b1af68SPavel Labath           const bool success = unwinder.GetFrameInfoAtIndex(
48531e6dbe1SJoseph Tremoulet               idx, cfa, pc, behaves_like_zeroth_frame);
48605097246SAdrian Prantl           // There shouldn't be any way not to get the frame info for frame
48705097246SAdrian Prantl           // 0. But if the unwinder can't make one, lets make one by hand
488eb8fa58eSVedant Kumar           // with the SP as the CFA and see if that gets any further.
489b9c1b51eSKate Stone           if (!success) {
490b3ae8761SGreg Clayton             cfa = reg_ctx_sp->GetSP();
491b3ae8761SGreg Clayton             pc = reg_ctx_sp->GetPC();
492376c4854SJim Ingham           }
493376c4854SJim Ingham 
494796ac80bSJonas Devlieghere           unwind_frame_sp = std::make_shared<StackFrame>(
495796ac80bSJonas Devlieghere               m_thread.shared_from_this(), m_frames.size(), idx, reg_ctx_sp,
49631e6dbe1SJoseph Tremoulet               cfa, pc, behaves_like_zeroth_frame, nullptr);
4975082c5fdSGreg Clayton           m_frames.push_back(unwind_frame_sp);
4985082c5fdSGreg Clayton         }
499b9c1b51eSKate Stone       } else {
5005082c5fdSGreg Clayton         unwind_frame_sp = m_frames.front();
501b57e4a1bSJason Molenda         cfa = unwind_frame_sp->m_id.GetCallFrameAddress();
5025082c5fdSGreg Clayton       }
503b9c1b51eSKate Stone     } else {
504c0b1af68SPavel Labath       const bool success =
505c0b1af68SPavel Labath           unwinder.GetFrameInfoAtIndex(idx, cfa, pc, behaves_like_zeroth_frame);
506b9c1b51eSKate Stone       if (!success) {
507b0c72a5fSJim Ingham         // We've gotten to the end of the stack.
508b0c72a5fSJim Ingham         SetAllFramesFetched();
509b0c72a5fSJim Ingham         break;
510b0c72a5fSJim Ingham       }
51199618476SJason Molenda       const bool cfa_is_valid = true;
512796ac80bSJonas Devlieghere       unwind_frame_sp = std::make_shared<StackFrame>(
513796ac80bSJonas Devlieghere           m_thread.shared_from_this(), m_frames.size(), idx, cfa, cfa_is_valid,
51431e6dbe1SJoseph Tremoulet           pc, StackFrame::Kind::Regular, behaves_like_zeroth_frame, nullptr);
5154b36f791SVedant Kumar 
5164b36f791SVedant Kumar       // Create synthetic tail call frames between the previous frame and the
5174b36f791SVedant Kumar       // newly-found frame. The new frame's index may change after this call,
5184b36f791SVedant Kumar       // although its concrete index will stay the same.
5194b36f791SVedant Kumar       SynthesizeTailCallFrames(*unwind_frame_sp.get());
5204b36f791SVedant Kumar 
5215082c5fdSGreg Clayton       m_frames.push_back(unwind_frame_sp);
52212daf946SGreg Clayton     }
52312daf946SGreg Clayton 
524ff1b5c42SEd Maste     assert(unwind_frame_sp);
525b9c1b51eSKate Stone     SymbolContext unwind_sc = unwind_frame_sp->GetSymbolContext(
526b9c1b51eSKate Stone         eSymbolContextBlock | eSymbolContextFunction);
5271ed54f50SGreg Clayton     Block *unwind_block = unwind_sc.block;
528911d5784STed Woodward     TargetSP target_sp = m_thread.CalculateTarget();
529266bb78fSJason Molenda     if (unwind_block) {
530266bb78fSJason Molenda       Address curr_frame_address(
531266bb78fSJason Molenda           unwind_frame_sp->GetFrameCodeAddressForSymbolication());
5325f4c61e2SGreg Clayton 
5331ed54f50SGreg Clayton       SymbolContext next_frame_sc;
5341ed54f50SGreg Clayton       Address next_frame_address;
5351ed54f50SGreg Clayton 
536b9c1b51eSKate Stone       while (unwind_sc.GetParentOfInlinedScope(
537b9c1b51eSKate Stone           curr_frame_address, next_frame_sc, next_frame_address)) {
538911d5784STed Woodward         next_frame_sc.line_entry.ApplyFileMappings(target_sp);
53931e6dbe1SJoseph Tremoulet         behaves_like_zeroth_frame = false;
54031e6dbe1SJoseph Tremoulet         StackFrameSP frame_sp(new StackFrame(
54131e6dbe1SJoseph Tremoulet             m_thread.shared_from_this(), m_frames.size(), idx,
54231e6dbe1SJoseph Tremoulet             unwind_frame_sp->GetRegisterContextSP(), cfa, next_frame_address,
54331e6dbe1SJoseph Tremoulet             behaves_like_zeroth_frame, &next_frame_sc));
5445082c5fdSGreg Clayton 
5455082c5fdSGreg Clayton         m_frames.push_back(frame_sp);
5461ed54f50SGreg Clayton         unwind_sc = next_frame_sc;
5471ed54f50SGreg Clayton         curr_frame_address = next_frame_address;
548b0c72a5fSJim Ingham       }
549b0c72a5fSJim Ingham     }
550b0c72a5fSJim Ingham   } while (m_frames.size() - 1 < end_idx);
5511ed54f50SGreg Clayton 
552b0c72a5fSJim Ingham   // Don't try to merge till you've calculated all the frames in this stack.
553b9c1b51eSKate Stone   if (GetAllFramesFetched() && m_prev_frames_sp) {
5542cad65a5SGreg Clayton     StackFrameList *prev_frames = m_prev_frames_sp.get();
5555082c5fdSGreg Clayton     StackFrameList *curr_frames = this;
5565082c5fdSGreg Clayton 
5575082c5fdSGreg Clayton #if defined(DEBUG_STACK_FRAMES)
55868275d5eSGreg Clayton     s.PutCString("\nprev_frames:\n");
5595082c5fdSGreg Clayton     prev_frames->Dump(&s);
56068275d5eSGreg Clayton     s.PutCString("\ncurr_frames:\n");
5615082c5fdSGreg Clayton     curr_frames->Dump(&s);
5625082c5fdSGreg Clayton     s.EOL();
5635082c5fdSGreg Clayton #endif
5645082c5fdSGreg Clayton     size_t curr_frame_num, prev_frame_num;
5655082c5fdSGreg Clayton 
566b9c1b51eSKate Stone     for (curr_frame_num = curr_frames->m_frames.size(),
567b9c1b51eSKate Stone         prev_frame_num = prev_frames->m_frames.size();
5685082c5fdSGreg Clayton          curr_frame_num > 0 && prev_frame_num > 0;
569b9c1b51eSKate Stone          --curr_frame_num, --prev_frame_num) {
5705082c5fdSGreg Clayton       const size_t curr_frame_idx = curr_frame_num - 1;
5715082c5fdSGreg Clayton       const size_t prev_frame_idx = prev_frame_num - 1;
572b57e4a1bSJason Molenda       StackFrameSP curr_frame_sp(curr_frames->m_frames[curr_frame_idx]);
573b57e4a1bSJason Molenda       StackFrameSP prev_frame_sp(prev_frames->m_frames[prev_frame_idx]);
5745082c5fdSGreg Clayton 
5755082c5fdSGreg Clayton #if defined(DEBUG_STACK_FRAMES)
5762cad65a5SGreg Clayton       s.Printf("\n\nCurr frame #%u ", curr_frame_idx);
5775082c5fdSGreg Clayton       if (curr_frame_sp)
5782cad65a5SGreg Clayton         curr_frame_sp->Dump(&s, true, false);
5795082c5fdSGreg Clayton       else
5805082c5fdSGreg Clayton         s.PutCString("NULL");
5812cad65a5SGreg Clayton       s.Printf("\nPrev frame #%u ", prev_frame_idx);
5825082c5fdSGreg Clayton       if (prev_frame_sp)
5832cad65a5SGreg Clayton         prev_frame_sp->Dump(&s, true, false);
5845082c5fdSGreg Clayton       else
5855082c5fdSGreg Clayton         s.PutCString("NULL");
5865082c5fdSGreg Clayton #endif
5875082c5fdSGreg Clayton 
588b57e4a1bSJason Molenda       StackFrame *curr_frame = curr_frame_sp.get();
589b57e4a1bSJason Molenda       StackFrame *prev_frame = prev_frame_sp.get();
5905082c5fdSGreg Clayton 
591d70a6e71SEugene Zelenko       if (curr_frame == nullptr || prev_frame == nullptr)
5925082c5fdSGreg Clayton         break;
5935082c5fdSGreg Clayton 
594eb8fa58eSVedant Kumar       // Check the stack ID to make sure they are equal.
59559e8fc1cSGreg Clayton       if (curr_frame->GetStackID() != prev_frame->GetStackID())
5965082c5fdSGreg Clayton         break;
5975082c5fdSGreg Clayton 
59859e8fc1cSGreg Clayton       prev_frame->UpdatePreviousFrameFromCurrentFrame(*curr_frame);
59905097246SAdrian Prantl       // Now copy the fixed up previous frame into the current frames so the
600eb8fa58eSVedant Kumar       // pointer doesn't change.
60159e8fc1cSGreg Clayton       m_frames[curr_frame_idx] = prev_frame_sp;
6025082c5fdSGreg Clayton 
6035082c5fdSGreg Clayton #if defined(DEBUG_STACK_FRAMES)
60468275d5eSGreg Clayton       s.Printf("\n    Copying previous frame to current frame");
6055082c5fdSGreg Clayton #endif
6065082c5fdSGreg Clayton     }
607eb8fa58eSVedant Kumar     // We are done with the old stack frame list, we can release it now.
6082cad65a5SGreg Clayton     m_prev_frames_sp.reset();
6095082c5fdSGreg Clayton   }
61068275d5eSGreg Clayton 
61168275d5eSGreg Clayton #if defined(DEBUG_STACK_FRAMES)
61268275d5eSGreg Clayton   s.PutCString("\n\nNew frames:\n");
61368275d5eSGreg Clayton   Dump(&s);
61468275d5eSGreg Clayton   s.EOL();
61568275d5eSGreg Clayton #endif
616ec6829eaSGreg Clayton }
617b0c72a5fSJim Ingham 
618b9c1b51eSKate Stone uint32_t StackFrameList::GetNumFrames(bool can_create) {
619bb19a13cSSaleem Abdulrasool   std::lock_guard<std::recursive_mutex> guard(m_mutex);
620b0c72a5fSJim Ingham 
621b0c72a5fSJim Ingham   if (can_create)
622b0c72a5fSJim Ingham     GetFramesUpTo(UINT32_MAX);
623513c6bb8SJim Ingham 
624b3b7b1bfSVedant Kumar   return GetVisibleStackFrameIndex(m_frames.size());
62530fdc8d8SChris Lattner }
62630fdc8d8SChris Lattner 
627b9c1b51eSKate Stone void StackFrameList::Dump(Stream *s) {
628d70a6e71SEugene Zelenko   if (s == nullptr)
6295082c5fdSGreg Clayton     return;
630bb19a13cSSaleem Abdulrasool 
631bb19a13cSSaleem Abdulrasool   std::lock_guard<std::recursive_mutex> guard(m_mutex);
63230fdc8d8SChris Lattner 
6335082c5fdSGreg Clayton   const_iterator pos, begin = m_frames.begin(), end = m_frames.end();
634b9c1b51eSKate Stone   for (pos = begin; pos != end; ++pos) {
635b57e4a1bSJason Molenda     StackFrame *frame = (*pos).get();
636324a1036SSaleem Abdulrasool     s->Printf("%p: ", static_cast<void *>(frame));
637b9c1b51eSKate Stone     if (frame) {
63859e8fc1cSGreg Clayton       frame->GetStackID().Dump(s);
6390603aa9dSGreg Clayton       frame->DumpUsingSettingsFormat(s);
640b9c1b51eSKate Stone     } else
641dce502edSGreg Clayton       s->Printf("frame #%u", (uint32_t)std::distance(begin, pos));
6425082c5fdSGreg Clayton     s->EOL();
64312daf946SGreg Clayton   }
6445082c5fdSGreg Clayton   s->EOL();
6455082c5fdSGreg Clayton }
64612daf946SGreg Clayton 
647b9c1b51eSKate Stone StackFrameSP StackFrameList::GetFrameAtIndex(uint32_t idx) {
648b57e4a1bSJason Molenda   StackFrameSP frame_sp;
649bb19a13cSSaleem Abdulrasool   std::lock_guard<std::recursive_mutex> guard(m_mutex);
6505cb9a184SJim Ingham   uint32_t original_idx = idx;
6515cb9a184SJim Ingham 
652513c6bb8SJim Ingham   uint32_t inlined_depth = GetCurrentInlinedDepth();
653513c6bb8SJim Ingham   if (inlined_depth != UINT32_MAX)
654513c6bb8SJim Ingham     idx += inlined_depth;
655513c6bb8SJim Ingham 
6565082c5fdSGreg Clayton   if (idx < m_frames.size())
6575082c5fdSGreg Clayton     frame_sp = m_frames[idx];
65812daf946SGreg Clayton 
6595082c5fdSGreg Clayton   if (frame_sp)
66012daf946SGreg Clayton     return frame_sp;
66112daf946SGreg Clayton 
66205097246SAdrian Prantl   // GetFramesUpTo will fill m_frames with as many frames as you asked for, if
66305097246SAdrian Prantl   // there are that many.  If there weren't then you asked for too many frames.
664b0c72a5fSJim Ingham   GetFramesUpTo(idx);
665b9c1b51eSKate Stone   if (idx < m_frames.size()) {
666b9c1b51eSKate Stone     if (m_show_inlined_frames) {
667b9c1b51eSKate Stone       // When inline frames are enabled we actually create all the frames in
668b9c1b51eSKate Stone       // GetFramesUpTo.
6695082c5fdSGreg Clayton       frame_sp = m_frames[idx];
670b9c1b51eSKate Stone     } else {
67112daf946SGreg Clayton       addr_t pc, cfa;
67231e6dbe1SJoseph Tremoulet       bool behaves_like_zeroth_frame = (idx == 0);
673c0b1af68SPavel Labath       if (m_thread.GetUnwinder().GetFrameInfoAtIndex(
674c0b1af68SPavel Labath               idx, cfa, pc, behaves_like_zeroth_frame)) {
67599618476SJason Molenda         const bool cfa_is_valid = true;
676796ac80bSJonas Devlieghere         frame_sp = std::make_shared<StackFrame>(
677796ac80bSJonas Devlieghere             m_thread.shared_from_this(), idx, idx, cfa, cfa_is_valid, pc,
67831e6dbe1SJoseph Tremoulet             StackFrame::Kind::Regular, behaves_like_zeroth_frame, nullptr);
67959e8fc1cSGreg Clayton 
680b9c1b51eSKate Stone         Function *function =
681b9c1b51eSKate Stone             frame_sp->GetSymbolContext(eSymbolContextFunction).function;
682b9c1b51eSKate Stone         if (function) {
68305097246SAdrian Prantl           // When we aren't showing inline functions we always use the top
68405097246SAdrian Prantl           // most function block as the scope.
68559e8fc1cSGreg Clayton           frame_sp->SetSymbolContextScope(&function->GetBlock(false));
686b9c1b51eSKate Stone         } else {
687b9c1b51eSKate Stone           // Set the symbol scope from the symbol regardless if it is nullptr
688b9c1b51eSKate Stone           // or valid.
689b9c1b51eSKate Stone           frame_sp->SetSymbolContextScope(
690b9c1b51eSKate Stone               frame_sp->GetSymbolContext(eSymbolContextSymbol).symbol);
69159e8fc1cSGreg Clayton         }
6925082c5fdSGreg Clayton         SetFrameAtIndex(idx, frame_sp);
69312daf946SGreg Clayton       }
69412daf946SGreg Clayton     }
695b9c1b51eSKate Stone   } else if (original_idx == 0) {
696b9c1b51eSKate Stone     // There should ALWAYS be a frame at index 0.  If something went wrong with
69705097246SAdrian Prantl     // the CurrentInlinedDepth such that there weren't as many frames as we
69805097246SAdrian Prantl     // thought taking that into account, then reset the current inlined depth
6995cb9a184SJim Ingham     // and return the real zeroth frame.
700b9c1b51eSKate Stone     if (m_frames.empty()) {
701b9c1b51eSKate Stone       // Why do we have a thread with zero frames, that should not ever
702b9c1b51eSKate Stone       // happen...
703a322f36cSDavid Blaikie       assert(!m_thread.IsValid() && "A valid thread has no frames.");
704b9c1b51eSKate Stone     } else {
705d70a6e71SEugene Zelenko       ResetCurrentInlinedDepth();
706d70a6e71SEugene Zelenko       frame_sp = m_frames[original_idx];
7075cb9a184SJim Ingham     }
7085cb9a184SJim Ingham   }
7095cb9a184SJim Ingham 
71030fdc8d8SChris Lattner   return frame_sp;
71130fdc8d8SChris Lattner }
71230fdc8d8SChris Lattner 
713b57e4a1bSJason Molenda StackFrameSP
714b9c1b51eSKate Stone StackFrameList::GetFrameWithConcreteFrameIndex(uint32_t unwind_idx) {
7155ccbd294SGreg Clayton   // First try assuming the unwind index is the same as the frame index. The
71605097246SAdrian Prantl   // unwind index is always greater than or equal to the frame index, so it is
71705097246SAdrian Prantl   // a good place to start. If we have inlined frames we might have 5 concrete
71805097246SAdrian Prantl   // frames (frame unwind indexes go from 0-4), but we might have 15 frames
71905097246SAdrian Prantl   // after we make all the inlined frames. Most of the time the unwind frame
72005097246SAdrian Prantl   // index (or the concrete frame index) is the same as the frame index.
7215ccbd294SGreg Clayton   uint32_t frame_idx = unwind_idx;
722b57e4a1bSJason Molenda   StackFrameSP frame_sp(GetFrameAtIndex(frame_idx));
723b9c1b51eSKate Stone   while (frame_sp) {
7245ccbd294SGreg Clayton     if (frame_sp->GetFrameIndex() == unwind_idx)
7255ccbd294SGreg Clayton       break;
7265ccbd294SGreg Clayton     frame_sp = GetFrameAtIndex(++frame_idx);
7275ccbd294SGreg Clayton   }
7285ccbd294SGreg Clayton   return frame_sp;
7295ccbd294SGreg Clayton }
7305ccbd294SGreg Clayton 
731b9c1b51eSKate Stone static bool CompareStackID(const StackFrameSP &stack_sp,
732b9c1b51eSKate Stone                            const StackID &stack_id) {
7337bcb93d5SGreg Clayton   return stack_sp->GetStackID() < stack_id;
7347bcb93d5SGreg Clayton }
7357bcb93d5SGreg Clayton 
736b9c1b51eSKate Stone StackFrameSP StackFrameList::GetFrameWithStackID(const StackID &stack_id) {
737b57e4a1bSJason Molenda   StackFrameSP frame_sp;
7387bcb93d5SGreg Clayton 
739b9c1b51eSKate Stone   if (stack_id.IsValid()) {
740bb19a13cSSaleem Abdulrasool     std::lock_guard<std::recursive_mutex> guard(m_mutex);
7417bcb93d5SGreg Clayton     uint32_t frame_idx = 0;
7427bcb93d5SGreg Clayton     // Do a binary search in case the stack frame is already in our cache
7437bcb93d5SGreg Clayton     collection::const_iterator begin = m_frames.begin();
7447bcb93d5SGreg Clayton     collection::const_iterator end = m_frames.end();
745b9c1b51eSKate Stone     if (begin != end) {
746b9c1b51eSKate Stone       collection::const_iterator pos =
747b9c1b51eSKate Stone           std::lower_bound(begin, end, stack_id, CompareStackID);
748b9c1b51eSKate Stone       if (pos != end) {
7498012cadbSGreg Clayton         if ((*pos)->GetStackID() == stack_id)
7507bcb93d5SGreg Clayton           return *pos;
7518012cadbSGreg Clayton       }
7527bcb93d5SGreg Clayton     }
753b9c1b51eSKate Stone     do {
7543a195b7eSJim Ingham       frame_sp = GetFrameAtIndex(frame_idx);
7553a195b7eSJim Ingham       if (frame_sp && frame_sp->GetStackID() == stack_id)
7563a195b7eSJim Ingham         break;
7573a195b7eSJim Ingham       frame_idx++;
758b9c1b51eSKate Stone     } while (frame_sp);
7597bcb93d5SGreg Clayton   }
7603a195b7eSJim Ingham   return frame_sp;
7613a195b7eSJim Ingham }
7625ccbd294SGreg Clayton 
763b9c1b51eSKate Stone bool StackFrameList::SetFrameAtIndex(uint32_t idx, StackFrameSP &frame_sp) {
7645082c5fdSGreg Clayton   if (idx >= m_frames.size())
7655082c5fdSGreg Clayton     m_frames.resize(idx + 1);
76612daf946SGreg Clayton   // Make sure allocation succeeded by checking bounds again
767b9c1b51eSKate Stone   if (idx < m_frames.size()) {
7685082c5fdSGreg Clayton     m_frames[idx] = frame_sp;
76930fdc8d8SChris Lattner     return true;
77030fdc8d8SChris Lattner   }
77130fdc8d8SChris Lattner   return false; // resize failed, out of memory?
77230fdc8d8SChris Lattner }
77330fdc8d8SChris Lattner 
774b9c1b51eSKate Stone uint32_t StackFrameList::GetSelectedFrameIndex() const {
775bb19a13cSSaleem Abdulrasool   std::lock_guard<std::recursive_mutex> guard(m_mutex);
7762976d00aSJim Ingham   return m_selected_frame_idx;
77730fdc8d8SChris Lattner }
77830fdc8d8SChris Lattner 
779b9c1b51eSKate Stone uint32_t StackFrameList::SetSelectedFrame(lldb_private::StackFrame *frame) {
780bb19a13cSSaleem Abdulrasool   std::lock_guard<std::recursive_mutex> guard(m_mutex);
78112daf946SGreg Clayton   const_iterator pos;
7825082c5fdSGreg Clayton   const_iterator begin = m_frames.begin();
7835082c5fdSGreg Clayton   const_iterator end = m_frames.end();
784b7f6b2faSJim Ingham   m_selected_frame_idx = 0;
785b9c1b51eSKate Stone   for (pos = begin; pos != end; ++pos) {
786b9c1b51eSKate Stone     if (pos->get() == frame) {
7872976d00aSJim Ingham       m_selected_frame_idx = std::distance(begin, pos);
788513c6bb8SJim Ingham       uint32_t inlined_depth = GetCurrentInlinedDepth();
789513c6bb8SJim Ingham       if (inlined_depth != UINT32_MAX)
790513c6bb8SJim Ingham         m_selected_frame_idx -= inlined_depth;
791b7f6b2faSJim Ingham       break;
79230fdc8d8SChris Lattner     }
79330fdc8d8SChris Lattner   }
794b7f6b2faSJim Ingham   SetDefaultFileAndLineToSelectedFrame();
7952976d00aSJim Ingham   return m_selected_frame_idx;
79630fdc8d8SChris Lattner }
79730fdc8d8SChris Lattner 
798b9c1b51eSKate Stone bool StackFrameList::SetSelectedFrameByIndex(uint32_t idx) {
799bb19a13cSSaleem Abdulrasool   std::lock_guard<std::recursive_mutex> guard(m_mutex);
800b57e4a1bSJason Molenda   StackFrameSP frame_sp(GetFrameAtIndex(idx));
801b9c1b51eSKate Stone   if (frame_sp) {
802b0c72a5fSJim Ingham     SetSelectedFrame(frame_sp.get());
803b0c72a5fSJim Ingham     return true;
804b9c1b51eSKate Stone   } else
805b0c72a5fSJim Ingham     return false;
806b7f6b2faSJim Ingham }
807b7f6b2faSJim Ingham 
808b9c1b51eSKate Stone void StackFrameList::SetDefaultFileAndLineToSelectedFrame() {
809b9c1b51eSKate Stone   if (m_thread.GetID() ==
810b9c1b51eSKate Stone       m_thread.GetProcess()->GetThreadList().GetSelectedThread()->GetID()) {
811b57e4a1bSJason Molenda     StackFrameSP frame_sp(GetFrameAtIndex(GetSelectedFrameIndex()));
812b9c1b51eSKate Stone     if (frame_sp) {
813252d0edeSGreg Clayton       SymbolContext sc = frame_sp->GetSymbolContext(eSymbolContextLineEntry);
814b7f6b2faSJim Ingham       if (sc.line_entry.file)
815b9c1b51eSKate Stone         m_thread.CalculateTarget()->GetSourceManager().SetDefaultFileAndLine(
816b9c1b51eSKate Stone             sc.line_entry.file, sc.line_entry.line);
817b7f6b2faSJim Ingham     }
818b7f6b2faSJim Ingham   }
81930fdc8d8SChris Lattner }
82030fdc8d8SChris Lattner 
82130fdc8d8SChris Lattner // The thread has been run, reset the number stack frames to zero so we can
82230fdc8d8SChris Lattner // determine how many frames we have lazily.
823b9c1b51eSKate Stone void StackFrameList::Clear() {
824bb19a13cSSaleem Abdulrasool   std::lock_guard<std::recursive_mutex> guard(m_mutex);
8255082c5fdSGreg Clayton   m_frames.clear();
826b0c72a5fSJim Ingham   m_concrete_frames_fetched = 0;
82730fdc8d8SChris Lattner }
82830fdc8d8SChris Lattner 
829b57e4a1bSJason Molenda lldb::StackFrameSP
830b9c1b51eSKate Stone StackFrameList::GetStackFrameSPForStackFramePtr(StackFrame *stack_frame_ptr) {
831e4284b71SJim Ingham   const_iterator pos;
832e4284b71SJim Ingham   const_iterator begin = m_frames.begin();
833e4284b71SJim Ingham   const_iterator end = m_frames.end();
834b57e4a1bSJason Molenda   lldb::StackFrameSP ret_sp;
835e4284b71SJim Ingham 
836b9c1b51eSKate Stone   for (pos = begin; pos != end; ++pos) {
837b9c1b51eSKate Stone     if (pos->get() == stack_frame_ptr) {
838e4284b71SJim Ingham       ret_sp = (*pos);
839e4284b71SJim Ingham       break;
840e4284b71SJim Ingham     }
841e4284b71SJim Ingham   }
842e4284b71SJim Ingham   return ret_sp;
843e4284b71SJim Ingham }
844e4284b71SJim Ingham 
845b9c1b51eSKate Stone size_t StackFrameList::GetStatus(Stream &strm, uint32_t first_frame,
846b9c1b51eSKate Stone                                  uint32_t num_frames, bool show_frame_info,
8478ec10efcSJim Ingham                                  uint32_t num_frames_with_source,
8487f1c1211SPavel Labath                                  bool show_unique,
849b9c1b51eSKate Stone                                  const char *selected_frame_marker) {
8507260f620SGreg Clayton   size_t num_frames_displayed = 0;
8517260f620SGreg Clayton 
8527260f620SGreg Clayton   if (num_frames == 0)
8537260f620SGreg Clayton     return 0;
8547260f620SGreg Clayton 
855b57e4a1bSJason Molenda   StackFrameSP frame_sp;
8567260f620SGreg Clayton   uint32_t frame_idx = 0;
8577260f620SGreg Clayton   uint32_t last_frame;
8587260f620SGreg Clayton 
8597260f620SGreg Clayton   // Don't let the last frame wrap around...
8607260f620SGreg Clayton   if (num_frames == UINT32_MAX)
8617260f620SGreg Clayton     last_frame = UINT32_MAX;
8627260f620SGreg Clayton   else
8637260f620SGreg Clayton     last_frame = first_frame + num_frames;
8647260f620SGreg Clayton 
865b57e4a1bSJason Molenda   StackFrameSP selected_frame_sp = m_thread.GetSelectedFrame();
866d70a6e71SEugene Zelenko   const char *unselected_marker = nullptr;
8678ec10efcSJim Ingham   std::string buffer;
868b9c1b51eSKate Stone   if (selected_frame_marker) {
8698ec10efcSJim Ingham     size_t len = strlen(selected_frame_marker);
8708ec10efcSJim Ingham     buffer.insert(buffer.begin(), len, ' ');
8718ec10efcSJim Ingham     unselected_marker = buffer.c_str();
8728ec10efcSJim Ingham   }
873d70a6e71SEugene Zelenko   const char *marker = nullptr;
8748ec10efcSJim Ingham 
875b9c1b51eSKate Stone   for (frame_idx = first_frame; frame_idx < last_frame; ++frame_idx) {
8767260f620SGreg Clayton     frame_sp = GetFrameAtIndex(frame_idx);
877d70a6e71SEugene Zelenko     if (!frame_sp)
8787260f620SGreg Clayton       break;
8797260f620SGreg Clayton 
880b9c1b51eSKate Stone     if (selected_frame_marker != nullptr) {
8818ec10efcSJim Ingham       if (frame_sp == selected_frame_sp)
8828ec10efcSJim Ingham         marker = selected_frame_marker;
8838ec10efcSJim Ingham       else
8848ec10efcSJim Ingham         marker = unselected_marker;
8858ec10efcSJim Ingham     }
8868ec10efcSJim Ingham 
887b9c1b51eSKate Stone     if (!frame_sp->GetStatus(strm, show_frame_info,
888b9c1b51eSKate Stone                              num_frames_with_source > (first_frame - frame_idx),
8897f1c1211SPavel Labath                              show_unique, marker))
8907260f620SGreg Clayton       break;
8917260f620SGreg Clayton     ++num_frames_displayed;
8927260f620SGreg Clayton   }
8937260f620SGreg Clayton 
8947260f620SGreg Clayton   strm.IndentLess();
8957260f620SGreg Clayton   return num_frames_displayed;
8967260f620SGreg Clayton }
897