Lines Matching defs:To
75 /// \brief Add BB to the resulting dominator
146 /// Additionally to that even complicated loops look like this:
155 /// 3 3 = "Flow" block, with back edge to entry block
204 void delPhiValues(BasicBlock *From, BasicBlock *To);
206 void addPhiValues(BasicBlock *From, BasicBlock *To);
295 // to what we want. The only problem with it is that sometimes backedges
318 // Make sure we have visited all blocks in this loop before moving back to
343 // rather than re-working the whole pass to operate on the list in order,
344 // we just reverse the list and continue to operate on it in reverse.
402 llvm_unreachable("Unhandled condition to invert");
445 // Try to treat it like an ELSE block
469 // Edge from inside a subregion to its entry, ignore it
501 // Analyze all the conditions leading to a node
557 /// \brief Remove all PHI values coming from "From" into "To" and remember
559 void StructurizeCFG::delPhiValues(BasicBlock *From, BasicBlock *To) {
560 PhiMap &Map = DeletedPhis[To];
561 for (BasicBlock::iterator I = To->begin(), E = To->end();
573 void StructurizeCFG::addPhiValues(BasicBlock *From, BasicBlock *To) {
574 for (BasicBlock::iterator I = To->begin(), E = To->end();
581 AddedPhis[To].push_back(From);
590 BasicBlock *To = AI->first;
593 if (!DeletedPhis.count(To))
596 PhiMap &Map = DeletedPhis[To];
604 Updater.AddAvailableValue(To, Undef);
607 Dominator.addBlock(To, false);
627 DeletedPhis.erase(To);
647 /// \brief Let node exit(s) point to NewExit
655 // Find all the edges from the sub region to the exit
663 // Modify the edges to point to the new exit
800 // let it point to entry and next block
835 // If the start of the loop is the entry block, we can't branch to it so
