Lines Matching refs:stack_size
1153 int stack_size = m_completed_plan_stack.size();
1154 for (int i = stack_size - 1; i > 0; i--)
1160 if (stack_size > 0 && m_completed_plan_stack[0].get() == current_plan)
1168 stack_size = m_plan_stack.size();
1169 for (int i = stack_size - 1; i > 0; i--)
1190 int stack_size = m_plan_stack.size();
1191 for (int i = 0; i < stack_size; i++)
1204 int stack_size = m_plan_stack.size();
1205 for (int i = 0; i < stack_size; i++)
1224 int stack_size = m_plan_stack.size();
1231 for (int i = stack_size - 1; i > 0; i--)
1237 for (int i = stack_size - 1; i > 0; i--)
1245 for (int i = stack_size - 1; i > 0 && !last_one ; i--)
1267 int stack_size = m_plan_stack.size();
1268 for (int i = stack_size - 1; i > 0; i--)
1335 int stack_size = m_plan_stack.size();
1340 for (int i = stack_size - 1; i > 0; i--)
1517 uint32_t stack_size = m_plan_stack.size();
1520 s->Printf ("Plan Stack for thread #%u: tid = 0x%4.4" PRIx64 ", stack_size = %d\n", GetIndexID(), GetID(), stack_size);
1521 for (i = stack_size - 1; i >= 0; i--)
1531 stack_size = m_completed_plan_stack.size();
1532 if (stack_size > 0)
1535 s->Printf ("Completed Plan Stack: %d elements.\n", stack_size);
1536 for (i = stack_size - 1; i >= 0; i--)
1547 stack_size = m_discarded_plan_stack.size();
1548 if (stack_size > 0)
1551 s->Printf ("Discarded Plan Stack: %d elements.\n", stack_size);
1552 for (i = stack_size - 1; i >= 0; i--)
