Lines Matching refs:stack
1549 void IdealLoopTree::allpaths_check_safepts(VectorSet &visited, Node_List &stack) {
1550 assert(stack.size() == 0, "empty stack");
1551 stack.push(_tail);
1554 while (stack.size() > 0) {
1555 Node* n = stack.pop();
1571 stack.push(in);
1632 void IdealLoopTree::check_safepts(VectorSet &visited, Node_List &stack) {
1635 if (_child) _child->check_safepts(visited, stack);
1636 if (_next) _next ->check_safepts(visited, stack);
1688 allpaths_check_safepts(visited, stack);
2219 // Allocate stack with enough space to avoid frequent realloc
2766 // Allocate stack of size C->unique()/2 to avoid frequent realloc
2774 n = bltstack.top(); // Leave node on stack
2817 (void)bltstack.pop(); // Remove node from stack
2829 (void)bltstack.pop(); // Remove post-visited node from stack
3020 // Get parent node and next input's index from stack's top.
3101 // Finished all nodes on stack.
3414 // Finished all nodes on stack.
3649 Node_Stack stack(arena, C->unique() >> 2);
3653 rpo( C->root(), stack, visited, rpo_list );