Lines Matching refs:stack
124 // Allocate node stack of size C->unique()+8 to avoid frequent realloc
205 // Allocate stack with enough space to avoid frequent realloc
213 // on stack's top.
218 // Get parent node and next input's index from stack's top.
274 // Finished all nodes on stack.
757 Node_Backward_Iterator(Node *root, VectorSet &visited, Node_List &stack, Block_Array &bbs);
769 Node_Backward_Iterator::Node_Backward_Iterator( Node *root, VectorSet &visited, Node_List &stack, Block_Array &bbs )
770 : _visited(visited), _stack(stack), _bbs(bbs) {
771 // The stack should contain exactly the root
772 stack.clear();
773 stack.push(root);
849 void PhaseCFG::ComputeLatenciesBackwards(VectorSet &visited, Node_List &stack) {
855 Node_Backward_Iterator iter((Node *)_root, visited, stack, _bbs);
1118 void PhaseCFG::schedule_late(VectorSet &visited, Node_List &stack) {
1124 Node_Backward_Iterator iter((Node *)_root, visited, stack, _bbs);
1273 Node_List stack(a);
1274 stack.map( (unique >> 1) + 16, NULL); // Pre-grow the list
1275 if (!schedule_early(visited, stack)) {
1290 ComputeLatenciesBackwards(visited, stack);
1296 schedule_late(visited, stack);