Lines Matching defs:plan

19 static void PrintPlanElement(Stream &s, const ThreadPlanSP &plan,
25   plan->GetDescription(&s, desc_level);
44   PrintOneStackNoLock(s, "Active plan stack", m_plans, desc_level,
46   PrintOneStackNoLock(s, "Completed plan stack", m_completed_plans, desc_level,
48   PrintOneStackNoLock(s, "Discarded plan stack", m_discarded_plans, desc_level,
64     for (auto plan : stack) {
65       if (!plan->GetPrivate()) {
76     for (auto plan : stack) {
77       if (!include_internal && plan->GetPrivate())
79       PrintPlanElement(s, plan, desc_level, print_idx++);
107   // Tell the plan stacks that this thread is going away:
109   for (ThreadPlanSP plan : m_plans)
110     plan->ThreadDestroyed();
112   for (ThreadPlanSP plan : m_discarded_plans)
113     plan->ThreadDestroyed();
115   for (ThreadPlanSP plan : m_completed_plans)
116     plan->ThreadDestroyed();
118   // Now clear the current plan stacks:
123   // Push a ThreadPlanNull on the plan stack.  That way we can continue
124   // assuming that the plan stack is never empty, but if somebody errantly asks
134   // If the thread plan doesn't already have a tracer, give it its parent's
136   // The first plan has to be a base plan:
140            "Zeroth plan must be a base plan");
153   assert(m_plans.size() > 1 && "Can't pop the base thread plan");
171   assert(m_plans.size() > 1 && "Can't discard the base thread plan");
183 // If the input plan is nullptr, discard all plans.  Otherwise make sure this
184 // plan is in the stack, and if so discard up to and including it.
227     // Find the first controlling plan, see if it wants discarding, and if yes
237     // If the controlling plan doesn't want to get discarded, then we're done.
246     // Now discard the controlling plan itself.
247     // The bottom-most plan never gets discarded.  "OkayToDiscard" for it
261   assert(m_plans.size() != 0 && "There will always be a base plan.");
326   // There is always a base plan...
342   for (auto plan : m_completed_plans) {
343     if (plan.get() == in_plan)
351   for (auto plan : m_discarded_plans) {
352     if (plan.get() == in_plan)
363   // Look first in the completed plans, if the plan is here and there is
364   // a completed plan above it, return that.
371   // If this is the first completed plan, the previous one is the
372   // bottom of the regular plan stack.
431   // If we are going to delete plans from the plan stack,