blob: da25348c2dd9e14fa1a717177e41a2a5a27e7d65 [file] [log] [blame]
Chris Lattner30fdc8d2010-06-08 16:52:24 +00001//===-- ThreadPlanStepRange.cpp ---------------------------------*- C++ -*-===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10#include "lldb/Target/ThreadPlanStepRange.h"
11
12// C Includes
13// C++ Includes
14// Other libraries and framework includes
15// Project includes
16
17#include "lldb/lldb-private-log.h"
Jim Ingham0c61dee2013-03-13 01:56:41 +000018#include "lldb/Breakpoint/BreakpointLocation.h"
19#include "lldb/Breakpoint/BreakpointSite.h"
Jim Ingham564d8bc22012-03-09 04:10:47 +000020#include "lldb/Core/Disassembler.h"
Chris Lattner30fdc8d2010-06-08 16:52:24 +000021#include "lldb/Core/Log.h"
22#include "lldb/Core/Stream.h"
Chris Lattner30fdc8d2010-06-08 16:52:24 +000023#include "lldb/Symbol/Function.h"
24#include "lldb/Symbol/Symbol.h"
Jim Ingham564d8bc22012-03-09 04:10:47 +000025#include "lldb/Target/ExecutionContext.h"
Greg Claytonf4b47e12010-08-04 01:40:35 +000026#include "lldb/Target/Process.h"
27#include "lldb/Target/RegisterContext.h"
28#include "lldb/Target/StopInfo.h"
Jim Ingham564d8bc22012-03-09 04:10:47 +000029#include "lldb/Target/Target.h"
Greg Claytonf4b47e12010-08-04 01:40:35 +000030#include "lldb/Target/Thread.h"
Jim Ingham564d8bc22012-03-09 04:10:47 +000031#include "lldb/Target/ThreadPlanRunToAddress.h"
Chris Lattner30fdc8d2010-06-08 16:52:24 +000032
33using namespace lldb;
34using namespace lldb_private;
35
36
37//----------------------------------------------------------------------
38// ThreadPlanStepRange: Step through a stack range, either stepping over or into
39// based on the value of \a type.
40//----------------------------------------------------------------------
41
Jim Ingham242e0ad2011-02-08 04:27:50 +000042ThreadPlanStepRange::ThreadPlanStepRange (ThreadPlanKind kind,
43 const char *name,
44 Thread &thread,
45 const AddressRange &range,
46 const SymbolContext &addr_context,
47 lldb::RunMode stop_others) :
Jim Ingham35b21fe2010-07-10 02:23:31 +000048 ThreadPlan (kind, name, thread, eVoteNoOpinion, eVoteNoOpinion),
Chris Lattner30fdc8d2010-06-08 16:52:24 +000049 m_addr_context (addr_context),
Jim Inghamc4c9fed2011-10-15 00:24:48 +000050 m_address_ranges (),
Chris Lattner30fdc8d2010-06-08 16:52:24 +000051 m_stop_others (stop_others),
Chris Lattner30fdc8d2010-06-08 16:52:24 +000052 m_stack_id (),
Greg Claytonc982c762010-07-09 20:39:50 +000053 m_no_more_plans (false),
Jim Ingham0c61dee2013-03-13 01:56:41 +000054 m_first_run_event (true),
55 m_use_fast_step(false)
Chris Lattner30fdc8d2010-06-08 16:52:24 +000056{
Jim Ingham63c5c2a2013-07-19 02:18:31 +000057 llvm::Triple::ArchType arch_type = GetTarget().GetArchitecture().GetMachine();
58 if (arch_type == llvm::Triple::arm || arch_type == llvm::Triple::thumb)
59 m_use_fast_step = false;
60 else
61 m_use_fast_step = GetTarget().GetUseFastStepping();
Jim Inghamc4c9fed2011-10-15 00:24:48 +000062 AddRange(range);
Chris Lattner30fdc8d2010-06-08 16:52:24 +000063 m_stack_id = m_thread.GetStackFrameAtIndex(0)->GetStackID();
64}
65
66ThreadPlanStepRange::~ThreadPlanStepRange ()
67{
Jim Ingham564d8bc22012-03-09 04:10:47 +000068 ClearNextBranchBreakpoint();
Jim Ingham56d40422013-07-31 02:19:15 +000069
70 size_t num_instruction_ranges = m_instruction_ranges.size();
71
72 // FIXME: The DisassemblerLLVMC has a reference cycle and won't go away if it has any active instructions.
73 // I'll fix that but for now, just clear the list and it will go away nicely.
74 for (size_t i = 0; i < num_instruction_ranges; i++)
75 {
76 if (m_instruction_ranges[i])
77 m_instruction_ranges[i]->GetInstructionList().Clear();
78 }
Jim Ingham564d8bc22012-03-09 04:10:47 +000079}
80
81void
82ThreadPlanStepRange::DidPush ()
83{
84 // See if we can find a "next range" breakpoint:
85 SetNextBranchBreakpoint();
Chris Lattner30fdc8d2010-06-08 16:52:24 +000086}
87
88bool
89ThreadPlanStepRange::ValidatePlan (Stream *error)
90{
91 return true;
92}
93
Chris Lattner30fdc8d2010-06-08 16:52:24 +000094Vote
95ThreadPlanStepRange::ShouldReportStop (Event *event_ptr)
96{
Greg Clayton5160ce52013-03-27 23:08:40 +000097 Log *log(lldb_private::GetLogIfAllCategoriesSet (LIBLLDB_LOG_STEP));
Greg Clayton2cad65a2010-09-03 17:10:42 +000098
99 const Vote vote = IsPlanComplete() ? eVoteYes : eVoteNo;
100 if (log)
Greg Clayton411c0ce2011-01-18 21:44:45 +0000101 log->Printf ("ThreadPlanStepRange::ShouldReportStop() returning vote %i\n", vote);
Greg Clayton2cad65a2010-09-03 17:10:42 +0000102 return vote;
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000103}
104
Jim Inghamc4c9fed2011-10-15 00:24:48 +0000105void
106ThreadPlanStepRange::AddRange(const AddressRange &new_range)
107{
108 // For now I'm just adding the ranges. At some point we may want to
109 // condense the ranges if they overlap, though I don't think it is likely
110 // to be very important.
111 m_address_ranges.push_back (new_range);
Jim Ingham56d40422013-07-31 02:19:15 +0000112
113 // Fill the slot for this address range with an empty DisassemblerSP in the instruction ranges. I want the
114 // indices to match, but I don't want to do the work to disassemble this range if I don't step into it.
Jim Ingham564d8bc22012-03-09 04:10:47 +0000115 m_instruction_ranges.push_back (DisassemblerSP());
Jim Inghamc4c9fed2011-10-15 00:24:48 +0000116}
117
118void
119ThreadPlanStepRange::DumpRanges(Stream *s)
120{
121 size_t num_ranges = m_address_ranges.size();
122 if (num_ranges == 1)
123 {
Greg Clayton1ac04c32012-02-21 00:09:25 +0000124 m_address_ranges[0].Dump (s, m_thread.CalculateTarget().get(), Address::DumpStyleLoadAddress);
Jim Inghamc4c9fed2011-10-15 00:24:48 +0000125 }
126 else
127 {
128 for (size_t i = 0; i < num_ranges; i++)
129 {
130 s->PutCString("%d: ");
Greg Clayton1ac04c32012-02-21 00:09:25 +0000131 m_address_ranges[i].Dump (s, m_thread.CalculateTarget().get(), Address::DumpStyleLoadAddress);
Jim Inghamc4c9fed2011-10-15 00:24:48 +0000132 }
133 }
134}
135
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000136bool
137ThreadPlanStepRange::InRange ()
138{
Greg Clayton5160ce52013-03-27 23:08:40 +0000139 Log *log(lldb_private::GetLogIfAllCategoriesSet (LIBLLDB_LOG_STEP));
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000140 bool ret_value = false;
141
142 lldb::addr_t pc_load_addr = m_thread.GetRegisterContext()->GetPC();
143
Jim Inghamc4c9fed2011-10-15 00:24:48 +0000144 size_t num_ranges = m_address_ranges.size();
145 for (size_t i = 0; i < num_ranges; i++)
146 {
Greg Clayton1ac04c32012-02-21 00:09:25 +0000147 ret_value = m_address_ranges[i].ContainsLoadAddress(pc_load_addr, m_thread.CalculateTarget().get());
Jim Inghamc4c9fed2011-10-15 00:24:48 +0000148 if (ret_value)
149 break;
150 }
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000151
152 if (!ret_value)
153 {
154 // See if we've just stepped to another part of the same line number...
155 StackFrame *frame = m_thread.GetStackFrameAtIndex(0).get();
156
157 SymbolContext new_context(frame->GetSymbolContext(eSymbolContextEverything));
158 if (m_addr_context.line_entry.IsValid() && new_context.line_entry.IsValid())
159 {
Jim Ingham843bfb22011-09-23 21:08:11 +0000160 if (m_addr_context.line_entry.file == new_context.line_entry.file)
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000161 {
Jim Ingham843bfb22011-09-23 21:08:11 +0000162 if (m_addr_context.line_entry.line == new_context.line_entry.line)
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000163 {
Jim Ingham843bfb22011-09-23 21:08:11 +0000164 m_addr_context = new_context;
Jim Inghamc4c9fed2011-10-15 00:24:48 +0000165 AddRange(m_addr_context.line_entry.range);
Jim Ingham843bfb22011-09-23 21:08:11 +0000166 ret_value = true;
167 if (log)
168 {
169 StreamString s;
Jim Ingham927bfa32012-09-10 23:42:44 +0000170 m_addr_context.line_entry.Dump (&s,
171 m_thread.CalculateTarget().get(),
172 true,
173 Address::DumpStyleLoadAddress,
174 Address::DumpStyleLoadAddress,
175 true);
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000176
Jim Ingham843bfb22011-09-23 21:08:11 +0000177 log->Printf ("Step range plan stepped to another range of same line: %s", s.GetData());
178 }
179 }
Greg Clayton1ac04c32012-02-21 00:09:25 +0000180 else if (new_context.line_entry.range.GetBaseAddress().GetLoadAddress(m_thread.CalculateTarget().get())
Jim Ingham843bfb22011-09-23 21:08:11 +0000181 != pc_load_addr)
182 {
183 // Another thing that sometimes happens here is that we step out of one line into the MIDDLE of another
184 // line. So far I mostly see this due to bugs in the debug information.
185 // But we probably don't want to be in the middle of a line range, so in that case reset the stepping
186 // range to the line we've stepped into the middle of and continue.
187 m_addr_context = new_context;
Jim Inghamc4c9fed2011-10-15 00:24:48 +0000188 m_address_ranges.clear();
189 AddRange(m_addr_context.line_entry.range);
Jim Ingham843bfb22011-09-23 21:08:11 +0000190 ret_value = true;
191 if (log)
192 {
193 StreamString s;
Jim Ingham927bfa32012-09-10 23:42:44 +0000194 m_addr_context.line_entry.Dump (&s,
195 m_thread.CalculateTarget().get(),
196 true,
197 Address::DumpStyleLoadAddress,
198 Address::DumpStyleLoadAddress,
199 true);
Jim Ingham843bfb22011-09-23 21:08:11 +0000200
201 log->Printf ("Step range plan stepped to the middle of new line(%d): %s, continuing to clear this line.",
202 new_context.line_entry.line,
203 s.GetData());
204 }
205
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000206 }
207 }
Jim Ingham843bfb22011-09-23 21:08:11 +0000208
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000209 }
210
211 }
212
213 if (!ret_value && log)
Daniel Malead01b2952012-11-29 21:49:15 +0000214 log->Printf ("Step range plan out of range to 0x%" PRIx64, pc_load_addr);
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000215
216 return ret_value;
217}
218
219bool
220ThreadPlanStepRange::InSymbol()
221{
222 lldb::addr_t cur_pc = m_thread.GetRegisterContext()->GetPC();
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000223 if (m_addr_context.function != NULL)
224 {
Greg Clayton1ac04c32012-02-21 00:09:25 +0000225 return m_addr_context.function->GetAddressRange().ContainsLoadAddress (cur_pc, m_thread.CalculateTarget().get());
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000226 }
Greg Claytone7612132012-03-07 21:03:09 +0000227 else if (m_addr_context.symbol)
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000228 {
Greg Claytone7612132012-03-07 21:03:09 +0000229 AddressRange range(m_addr_context.symbol->GetAddress(), m_addr_context.symbol->GetByteSize());
230 return range.ContainsLoadAddress (cur_pc, m_thread.CalculateTarget().get());
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000231 }
232 return false;
233}
234
235// FIXME: This should also handle inlining if we aren't going to do inlining in the
236// main stack.
237//
238// Ideally we should remember the whole stack frame list, and then compare that
239// to the current list.
240
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000241lldb::FrameComparison
242ThreadPlanStepRange::CompareCurrentFrameToStartFrame()
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000243{
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000244 FrameComparison frame_order;
Jim Ingham7ce490c2010-09-16 00:58:09 +0000245
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000246 StackID cur_frame_id = m_thread.GetStackFrameAtIndex(0)->GetStackID();
Jim Ingham7ce490c2010-09-16 00:58:09 +0000247
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000248 if (cur_frame_id == m_stack_id)
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000249 {
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000250 frame_order = eFrameCompareEqual;
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000251 }
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000252 else if (cur_frame_id < m_stack_id)
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000253 {
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000254 frame_order = eFrameCompareYounger;
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000255 }
256 else
257 {
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000258 frame_order = eFrameCompareOlder;
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000259 }
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000260 return frame_order;
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000261}
262
263bool
264ThreadPlanStepRange::StopOthers ()
265{
266 if (m_stop_others == lldb::eOnlyThisThread
267 || m_stop_others == lldb::eOnlyDuringStepping)
268 return true;
269 else
270 return false;
271}
272
Jim Ingham564d8bc22012-03-09 04:10:47 +0000273InstructionList *
274ThreadPlanStepRange::GetInstructionsForAddress(lldb::addr_t addr, size_t &range_index, size_t &insn_offset)
275{
276 size_t num_ranges = m_address_ranges.size();
277 for (size_t i = 0; i < num_ranges; i++)
278 {
279 if (m_address_ranges[i].ContainsLoadAddress(addr, &GetTarget()))
280 {
281 // Some joker added a zero size range to the stepping range...
282 if (m_address_ranges[i].GetByteSize() == 0)
283 return NULL;
284
285 if (!m_instruction_ranges[i])
286 {
287 //Disassemble the address range given:
288 ExecutionContext exe_ctx (m_thread.GetProcess());
Jim Ingham0f063ba2013-03-02 00:26:47 +0000289 const char *plugin_name = NULL;
290 const char *flavor = NULL;
Jim Ingham564d8bc22012-03-09 04:10:47 +0000291 m_instruction_ranges[i] = Disassembler::DisassembleRange(GetTarget().GetArchitecture(),
Jim Ingham0f063ba2013-03-02 00:26:47 +0000292 plugin_name,
293 flavor,
Jim Ingham564d8bc22012-03-09 04:10:47 +0000294 exe_ctx,
295 m_address_ranges[i]);
296
297 }
298 if (!m_instruction_ranges[i])
299 return NULL;
300 else
301 {
302 // Find where we are in the instruction list as well. If we aren't at an instruction,
303 // return NULL. In this case, we're probably lost, and shouldn't try to do anything fancy.
304
305 insn_offset = m_instruction_ranges[i]->GetInstructionList().GetIndexOfInstructionAtLoadAddress(addr, GetTarget());
306 if (insn_offset == UINT32_MAX)
307 return NULL;
308 else
309 {
310 range_index = i;
311 return &m_instruction_ranges[i]->GetInstructionList();
312 }
313 }
314 }
315 }
316 return NULL;
317}
318
319void
320ThreadPlanStepRange::ClearNextBranchBreakpoint()
321{
322 if (m_next_branch_bp_sp)
323 {
Greg Clayton5160ce52013-03-27 23:08:40 +0000324 Log *log(lldb_private::GetLogIfAllCategoriesSet (LIBLLDB_LOG_STEP));
Jim Ingham0c61dee2013-03-13 01:56:41 +0000325 if (log)
326 log->Printf ("Removing next branch breakpoint: %d.", m_next_branch_bp_sp->GetID());
Jim Ingham564d8bc22012-03-09 04:10:47 +0000327 GetTarget().RemoveBreakpointByID (m_next_branch_bp_sp->GetID());
328 m_next_branch_bp_sp.reset();
329 }
330}
331
332bool
333ThreadPlanStepRange::SetNextBranchBreakpoint ()
334{
Jim Ingham0c61dee2013-03-13 01:56:41 +0000335 if (m_next_branch_bp_sp)
336 return true;
337
Greg Clayton5160ce52013-03-27 23:08:40 +0000338 Log *log(lldb_private::GetLogIfAllCategoriesSet (LIBLLDB_LOG_STEP));
Jim Ingham564d8bc22012-03-09 04:10:47 +0000339 // Stepping through ranges using breakpoints doesn't work yet, but with this off we fall back to instruction
340 // single stepping.
Jim Ingham0c61dee2013-03-13 01:56:41 +0000341 if (!m_use_fast_step)
342 return false;
343
Jim Ingham564d8bc22012-03-09 04:10:47 +0000344 lldb::addr_t cur_addr = GetThread().GetRegisterContext()->GetPC();
345 // Find the current address in our address ranges, and fetch the disassembly if we haven't already:
346 size_t pc_index;
347 size_t range_index;
348 InstructionList *instructions = GetInstructionsForAddress (cur_addr, range_index, pc_index);
349 if (instructions == NULL)
350 return false;
351 else
352 {
353 uint32_t branch_index;
354 branch_index = instructions->GetIndexOfNextBranchInstruction (pc_index);
355
356 Address run_to_address;
357
358 // If we didn't find a branch, run to the end of the range.
359 if (branch_index == UINT32_MAX)
360 {
Jim Ingham0c61dee2013-03-13 01:56:41 +0000361 branch_index = instructions->GetSize() - 1;
Jim Ingham564d8bc22012-03-09 04:10:47 +0000362 }
Jim Ingham0c61dee2013-03-13 01:56:41 +0000363
Jim Ingham564d8bc22012-03-09 04:10:47 +0000364 if (branch_index - pc_index > 1)
365 {
366 const bool is_internal = true;
367 run_to_address = instructions->GetInstructionAtIndex(branch_index)->GetAddress();
368 m_next_branch_bp_sp = GetTarget().CreateBreakpoint(run_to_address, is_internal);
Jim Ingham29950772013-01-26 02:19:28 +0000369 if (m_next_branch_bp_sp)
370 {
Jim Ingham0c61dee2013-03-13 01:56:41 +0000371 if (log)
372 {
373 lldb::break_id_t bp_site_id = LLDB_INVALID_BREAK_ID;
374 BreakpointLocationSP bp_loc = m_next_branch_bp_sp->GetLocationAtIndex(0);
375 if (bp_loc)
376 {
377 BreakpointSiteSP bp_site = bp_loc->GetBreakpointSite();
378 if (bp_site)
379 {
380 bp_site_id = bp_site->GetID();
381 }
382 }
383 log->Printf ("ThreadPlanStepRange::SetNextBranchBreakpoint - Setting breakpoint %d (site %d) to run to address 0x%" PRIx64,
384 m_next_branch_bp_sp->GetID(),
385 bp_site_id,
386 run_to_address.GetLoadAddress(&m_thread.GetProcess()->GetTarget()));
387 }
Jim Ingham29950772013-01-26 02:19:28 +0000388 m_next_branch_bp_sp->SetThreadID(m_thread.GetID());
389 m_next_branch_bp_sp->SetBreakpointKind ("next-branch-location");
Jim Ingham0c61dee2013-03-13 01:56:41 +0000390 return true;
Jim Ingham29950772013-01-26 02:19:28 +0000391 }
392 else
393 return false;
Jim Ingham564d8bc22012-03-09 04:10:47 +0000394 }
395 }
396 return false;
397}
398
399bool
400ThreadPlanStepRange::NextRangeBreakpointExplainsStop (lldb::StopInfoSP stop_info_sp)
401{
Greg Clayton5160ce52013-03-27 23:08:40 +0000402 Log *log(lldb_private::GetLogIfAllCategoriesSet (LIBLLDB_LOG_STEP));
Jim Ingham564d8bc22012-03-09 04:10:47 +0000403 if (!m_next_branch_bp_sp)
404 return false;
405
406 break_id_t bp_site_id = stop_info_sp->GetValue();
407 BreakpointSiteSP bp_site_sp = m_thread.GetProcess()->GetBreakpointSiteList().FindByID(bp_site_id);
Jim Ingham0c61dee2013-03-13 01:56:41 +0000408 if (!bp_site_sp)
409 return false;
410 else if (!bp_site_sp->IsBreakpointAtThisSite (m_next_branch_bp_sp->GetID()))
Jim Ingham564d8bc22012-03-09 04:10:47 +0000411 return false;
412 else
Jim Ingham0c61dee2013-03-13 01:56:41 +0000413 {
414 // If we've hit the next branch breakpoint, then clear it.
415 size_t num_owners = bp_site_sp->GetNumberOfOwners();
416 bool explains_stop = true;
417 // If all the owners are internal, then we are probably just stepping over this range from multiple threads,
418 // or multiple frames, so we want to continue. If one is not internal, then we should not explain the stop,
419 // and let the user breakpoint handle the stop.
420 for (size_t i = 0; i < num_owners; i++)
421 {
422 if (!bp_site_sp->GetOwnerAtIndex(i)->GetBreakpoint().IsInternal())
423 {
424 explains_stop = false;
425 break;
426 }
427 }
428 if (log)
429 log->Printf ("ThreadPlanStepRange::NextRangeBreakpointExplainsStop - Hit next range breakpoint which has %zu owners - explains stop: %u.",
430 num_owners,
431 explains_stop);
432 ClearNextBranchBreakpoint();
433 return explains_stop;
434 }
Jim Ingham564d8bc22012-03-09 04:10:47 +0000435}
436
437bool
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000438ThreadPlanStepRange::WillStop ()
439{
440 return true;
441}
442
443StateType
Jim Ingham06e827c2010-11-11 19:26:09 +0000444ThreadPlanStepRange::GetPlanRunState ()
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000445{
Jim Ingham564d8bc22012-03-09 04:10:47 +0000446 if (m_next_branch_bp_sp)
447 return eStateRunning;
448 else
449 return eStateStepping;
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000450}
451
452bool
453ThreadPlanStepRange::MischiefManaged ()
454{
Jim Ingham927bfa32012-09-10 23:42:44 +0000455 // If we have pushed some plans between ShouldStop & MischiefManaged, then we're not done...
456 // I do this check first because we might have stepped somewhere that will fool InRange into
457 // thinking it needs to step past the end of that line. This happens, for instance, when stepping
458 // over inlined code that is in the middle of the current line.
459
460 if (!m_no_more_plans)
461 return false;
462
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000463 bool done = true;
464 if (!IsPlanComplete())
465 {
466 if (InRange())
467 {
468 done = false;
469 }
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000470 else
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000471 {
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000472 FrameComparison frame_order = CompareCurrentFrameToStartFrame();
473 if (frame_order != eFrameCompareOlder)
474 {
475 if (m_no_more_plans)
476 done = true;
477 else
478 done = false;
479 }
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000480 else
Jim Inghamb5c0d1c2012-03-01 00:50:50 +0000481 done = true;
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000482 }
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000483 }
484
485 if (done)
486 {
Greg Clayton5160ce52013-03-27 23:08:40 +0000487 Log *log(lldb_private::GetLogIfAllCategoriesSet (LIBLLDB_LOG_STEP));
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000488 if (log)
489 log->Printf("Completed step through range plan.");
Jim Ingham0c61dee2013-03-13 01:56:41 +0000490 ClearNextBranchBreakpoint();
Chris Lattner30fdc8d2010-06-08 16:52:24 +0000491 ThreadPlan::MischiefManaged ();
492 return true;
493 }
494 else
495 {
496 return false;
497 }
498
499}
Jim Ingham64e7ead2012-05-03 21:19:36 +0000500
501bool
502ThreadPlanStepRange::IsPlanStale ()
503{
Greg Clayton5160ce52013-03-27 23:08:40 +0000504 Log *log(lldb_private::GetLogIfAllCategoriesSet (LIBLLDB_LOG_STEP));
Jim Ingham64e7ead2012-05-03 21:19:36 +0000505 FrameComparison frame_order = CompareCurrentFrameToStartFrame();
506
507 if (frame_order == eFrameCompareOlder)
508 {
509 if (log)
510 {
511 log->Printf("ThreadPlanStepRange::IsPlanStale returning true, we've stepped out.");
512 }
513 return true;
514 }
515 else if (frame_order == eFrameCompareEqual && InSymbol())
516 {
517 // If we are not in a place we should step through, we've gotten stale.
518 // One tricky bit here is that some stubs don't push a frame, so we should.
519 // check that we are in the same symbol.
520 if (!InRange())
521 {
522 return true;
523 }
524 }
525 return false;
526}