@@ -149,8 +149,8 @@ class ThreadPlanStackMap {
149
149
ThreadPlanStack *removed_stack = result->second ;
150
150
m_plans_list.erase (result);
151
151
// Now find it in the stack storage:
152
- PlansStore::iterator end = m_plans_up_container.end ();
153
- PlansStore::iterator iter = std::find_if (m_plans_up_container.begin (), end,
152
+ auto end = m_plans_up_container.end ();
153
+ auto iter = std::find_if (m_plans_up_container.begin (), end,
154
154
[&] (std::unique_ptr<ThreadPlanStack> &stack) {
155
155
return stack->IsTID (tid);
156
156
});
@@ -184,9 +184,8 @@ class ThreadPlanStackMap {
184
184
// rename to Reactivate?
185
185
void Activate (ThreadPlanStack &stack) {
186
186
// Remove this from the detached plan list:
187
- std::vector<ThreadPlanStack *>::iterator end = m_detached_plans.end ();
188
- std::vector<ThreadPlanStack *>::iterator iter
189
- = std::find_if (m_detached_plans.begin (), end,
187
+ auto end = m_detached_plans.end ();
188
+ auto iter = std::find_if (m_detached_plans.begin (), end,
190
189
[&] (ThreadPlanStack *elem) {
191
190
return elem == &stack; });
192
191
if (iter != end)
@@ -212,6 +211,11 @@ class ThreadPlanStackMap {
212
211
}
213
212
}
214
213
214
+ // This gets the vector of pointers to thread plans that aren't
215
+ // currently running on a thread. This is generally for thread
216
+ // plans that represent asynchronous operations waiting to be
217
+ // scheduled.
218
+ // The vector will never have null ThreadPlanStacks in it.
215
219
std::vector<ThreadPlanStack *> &GetDetachedPlanStacks () {
216
220
return m_detached_plans;
217
221
}
0 commit comments