Lines Matching refs:worklist
238 // cycles). Instead we put that Node on a worklist to be handled
257 roots.push(in); // Visit this guy later, using worklist
275 // Process next node on the worklist 'roots'.
347 Block_List worklist;
348 worklist.push(LCA);
349 while (worklist.size() > 0) {
350 Block* mid = worklist.pop();
363 worklist.push(LCA);
370 worklist.push(mid_parent);
529 // Therefore, the branches visited by the worklist are of this form:
655 assert(found_match, "no worklist bug");
1386 Block_List worklist;
1391 worklist.push(pb);
1394 while (worklist.size() > 0) {
1395 Block* uct = worklist.pop();
1400 worklist.push(pb);
1424 Block_List worklist;
1429 worklist.push(pb);
1432 while (worklist.size() > 0) {
1433 Block* uct = worklist.pop();
1438 worklist.push(pb);
1486 Block_List worklist;
1505 assert(worklist.size() == 0, "nonempty worklist");
1511 nloop->push_pred(loop_head, LoopNode::LoopBackControl, worklist, _bbs);
1513 while (worklist.size() > 0) {
1514 Block* member = worklist.pop();
1517 nloop->push_pred(member, j, worklist, _bbs);
1554 void CFGLoop::push_pred(Block* blk, int i, Block_List& worklist, Block_Array& node_to_blk) {
1563 worklist.push(pred);
1577 push_pred(pred_head, LoopNode::EntryControl, worklist, node_to_blk);