253     m_completed_plan_stack(),  in Thread()
294     m_completed_plan_stack.clear();  in DestroyThread()
602     m_completed_plan_stack.clear();  in ShouldResume()
937     if (m_completed_plan_stack.size() > 0)  in ShouldReportStop()
942         return m_completed_plan_stack.back()->ShouldReportStop (event_ptr);  in ShouldReportStop()
979     if (m_completed_plan_stack.size() > 0)  in ShouldReportRun()
988                          m_completed_plan_stack.back()->GetName());  in ShouldReportRun()
990         return m_completed_plan_stack.back()->ShouldReportRun (event_ptr);  in ShouldReportRun()
1054         m_completed_plan_stack.push_back (plan);  in PopPlan()
1090     if (!m_completed_plan_stack.empty())  in GetCompletedPlan()
1092         for (int i = m_completed_plan_stack.size() - 1; i >= 0; i--)  in GetCompletedPlan()
1095             completed_plan_sp = m_completed_plan_stack[i];  in GetCompletedPlan()
1106     if (!m_completed_plan_stack.empty())  in GetReturnValueObject()
1108         for (int i = m_completed_plan_stack.size() - 1; i >= 0; i--)  in GetReturnValueObject()
1111             return_valobj_sp = m_completed_plan_stack[i]->GetReturnValueObject();  in GetReturnValueObject()
1122     if (!m_completed_plan_stack.empty())  in IsThreadPlanDone()
1124         for (int i = m_completed_plan_stack.size() - 1; i >= 0; i--)  in IsThreadPlanDone()
1126             if (m_completed_plan_stack[i].get() == plan)  in IsThreadPlanDone()
1153     int stack_size = m_completed_plan_stack.size();  in GetPreviousPlan()
1156         if (current_plan == m_completed_plan_stack[i].get())  in GetPreviousPlan()
1157             return m_completed_plan_stack[i-1].get();  in GetPreviousPlan()
1160     if (stack_size > 0 && m_completed_plan_stack[0].get() == current_plan)  in GetPreviousPlan()
1531     stack_size = m_completed_plan_stack.size();  in DumpThreadPlans()
1541             m_completed_plan_stack[i]->GetDescription (s, eDescriptionLevelFull);  in DumpThreadPlans()