Lines Matching refs:worklist
2224 Node_List worklist(a);
2225 // Don't need C->root() on worklist since
2227 worklist.push( C->top() );
2229 build_loop_early( visited, worklist, nstack );
2239 // Need C->root() on worklist when processing outs
2240 worklist.push( C->root() );
2242 worklist.push( C->top() );
2243 build_loop_late( visited, worklist, nstack );
2350 memset( worklist.adr(), 0, worklist.Size()*sizeof(Node*) );
2351 _ltree_root->_child->iteration_split( this, worklist );
3012 void PhaseIdealLoop::build_loop_early( VectorSet &visited, Node_List &worklist, Node_Stack &nstack ) {
3013 while (worklist.size() != 0) {
3016 Node *nstack_top_n = worklist.pop();
3054 worklist.push(in); // Visit this guy later, using worklist
3085 // Visit him using the worklist instead of recursion, to break
3088 worklist.push(in); // Visit this guy later, using worklist
3102 // Process next node on the worklist.
3240 Node_List worklist;
3245 worklist.push(s);
3247 while(worklist.size() != 0 && LCA != early) {
3248 Node* s = worklist.pop();
3254 worklist.push(s1);
3376 void PhaseIdealLoop::build_loop_late( VectorSet &visited, Node_List &worklist, Node_Stack &nstack ) {
3377 while (worklist.size() != 0) {
3378 Node *n = worklist.pop();
3398 worklist.push(use);
3407 // push dead code onto a worklist
3415 // Process next node on the worklist.