Lines Matching refs:visited
123 void PhaseCFG::schedule_pinned_nodes( VectorSet &visited ) {
129 if( !visited.test_set(n->_idx) ) { // Test node and flag it as visited
204 bool PhaseCFG::schedule_early(VectorSet &visited, Node_List &roots) {
209 visited.set(C->top()->_idx);
245 int is_visited = visited.test_set(in->_idx);
248 // assert( !visited.test(in->_idx), "did not schedule early" );
256 } else if (!is_visited) { // Input not yet visited?
353 // Test and set the visited bit.
354 if (mid->raise_LCA_visited() == mark) continue; // already visited
365 continue; // Don't mark as visited to avoid early termination.
504 Node_List worklist_visited(area); // visited mergemem nodes
529 // Therefore, the branches visited by the worklist are of this form:
696 // (Worklist is now empty; all nearby stores have been visited.)
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) {
775 // Clear the visited bits
776 visited.Clear();
811 // Skip already visited children
830 break; // Not visited, not anti-dep; schedule it NOW
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);
1245 } // Loop until all nodes have been visited
1266 VectorSet visited(a);
1267 schedule_pinned_nodes( visited );
1272 visited.Clear();
1275 if (!schedule_early(visited, stack)) {
1290 ComputeLatenciesBackwards(visited, stack);
1295 // ( visited.Clear() called in schedule_late()->Node_Backward_Iterator() )
1296 schedule_late(visited, stack);
1349 visited.Clear();
1351 if (!_blocks[i]->schedule_local(this, matcher, ready_cnt, visited)) {