Lines Matching refs:Worklist
20 // This is a simple worklist driven algorithm.
1028 Worklist.Add(Parent.first);
1046 Worklist.Add(Ancestor);
1380 SmallVector<Instruction*, 4> Worklist;
1381 Worklist.push_back(AI);
1384 Instruction *PI = Worklist.pop_back_val();
1396 Worklist.push_back(I);
1451 } while (!Worklist.empty());
1607 Worklist.Add(Cond);
1623 Worklist.Add(Cond);
1647 Worklist.Add(I);
2180 /// all reachable code to the worklist.
2184 /// them to the worklist (this significantly speeds up instcombine on code where
2194 SmallVector<BasicBlock*, 256> Worklist;
2195 Worklist.push_back(BB);
2201 BB = Worklist.pop_back_val();
2258 Worklist.push_back(ReachableBB);
2268 Worklist.push_back(ReachableBB);
2273 Worklist.push_back(SI->getDefaultDest());
2279 Worklist.push_back(TI->getSuccessor(i));
2280 } while (!Worklist.empty());
2282 // Once we've found all of the instructions to add to instcombine's worklist,
2285 // of instructions to the worklist after doing a transformation, thus avoiding
2287 IC.Worklist.AddInitialGroup(&InstrsForInstCombineWorklist[0],
2300 // Do a depth-first traversal of the function, populate the worklist with
2335 while (!Worklist.isEmpty()) {
2336 Instruction *I = Worklist.RemoveOne();
2353 // Add operands to the worklist.
2416 // Push the new instruction and any users onto the worklist.
2417 Worklist.Add(Result);
2418 Worklist.AddUsersToWorkList(*Result);
2443 Worklist.Add(I);
2444 Worklist.AddUsersToWorkList(*I);
2451 Worklist.Zap();
2482 /// instructions into the worklist when they are created.
2485 InstCombineIRInserter(Worklist));
