Lines Matching defs:stack
27 #include <stack>
422 std::stack<BasicBlock *> stack;
429 stack.push(pb);
433 if (stack.empty())
448 while (!stack.empty()) {
449 pb = stack.top();
451 stack.pop();
825 std::stack<uint32_t> stack;
1371 stack.push(node->getValue()->id);
1396 // lowest requirement will be allocated first, since it's a stack.
1473 while (!stack.empty()) {
1474 RIG_Node *node = &nodes[stack.top()];
1475 stack.pop();