1 //===-- StructurizeCFG.cpp ------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/Transforms/Scalar.h"
11 #include "llvm/ADT/MapVector.h"
12 #include "llvm/ADT/PostOrderIterator.h"
13 #include "llvm/ADT/SCCIterator.h"
14 #include "llvm/Analysis/LoopInfo.h"
15 #include "llvm/Analysis/RegionInfo.h"
16 #include "llvm/Analysis/RegionIterator.h"
17 #include "llvm/Analysis/RegionPass.h"
18 #include "llvm/IR/Module.h"
19 #include "llvm/IR/PatternMatch.h"
20 #include "llvm/Support/Debug.h"
21 #include "llvm/Support/raw_ostream.h"
22 #include "llvm/Transforms/Utils/SSAUpdater.h"
25 using namespace llvm::PatternMatch;
27 #define DEBUG_TYPE "structurizecfg"
31 // Definition of the complex types used in this pass.
33 typedef std::pair<BasicBlock *, Value *> BBValuePair;
35 typedef SmallVector<RegionNode*, 8> RNVector;
36 typedef SmallVector<BasicBlock*, 8> BBVector;
37 typedef SmallVector<BranchInst*, 8> BranchVector;
38 typedef SmallVector<BBValuePair, 2> BBValueVector;
40 typedef SmallPtrSet<BasicBlock *, 8> BBSet;
42 typedef MapVector<PHINode *, BBValueVector> PhiMap;
43 typedef MapVector<BasicBlock *, BBVector> BB2BBVecMap;
45 typedef DenseMap<DomTreeNode *, unsigned> DTN2UnsignedMap;
46 typedef DenseMap<BasicBlock *, PhiMap> BBPhiMap;
47 typedef DenseMap<BasicBlock *, Value *> BBPredicates;
48 typedef DenseMap<BasicBlock *, BBPredicates> PredMap;
49 typedef DenseMap<BasicBlock *, BasicBlock*> BB2BBMap;
51 // The name for newly created blocks.
53 static const char *const FlowBlockName = "Flow";
55 /// @brief Find the nearest common dominator for multiple BasicBlocks
57 /// Helper class for StructurizeCFG
58 /// TODO: Maybe move into common code
59 class NearestCommonDominator {
62 DTN2UnsignedMap IndexMap;
66 bool ExplicitMentioned;
69 /// \brief Start a new query
70 NearestCommonDominator(DominatorTree *DomTree) {
75 /// \brief Add BB to the resulting dominator
76 void addBlock(BasicBlock *BB, bool Remember = true) {
77 DomTreeNode *Node = DT->getNode(BB);
80 unsigned Numbering = 0;
81 for (;Node;Node = Node->getIDom())
82 IndexMap[Node] = ++Numbering;
85 ExplicitMentioned = Remember;
89 for (;Node;Node = Node->getIDom())
90 if (IndexMap.count(Node))
95 assert(Node && "Dominator tree invalid!");
97 unsigned Numbering = IndexMap[Node];
98 if (Numbering > ResultIndex) {
99 Result = Node->getBlock();
100 ResultIndex = Numbering;
101 ExplicitMentioned = Remember && (Result == BB);
102 } else if (Numbering == ResultIndex) {
103 ExplicitMentioned |= Remember;
107 /// \brief Is "Result" one of the BBs added with "Remember" = True?
108 bool wasResultExplicitMentioned() {
109 return ExplicitMentioned;
112 /// \brief Get the query result
113 BasicBlock *getResult() {
118 /// @brief Transforms the control flow graph on one single entry/exit region
121 /// After the transform all "If"/"Then"/"Else" style control flow looks like
133 /// | | 1 = "If" block, calculates the condition
134 /// 4 | 2 = "Then" subregion, runs if the condition is true
135 /// | / 3 = "Flow" blocks, newly inserted flow blocks, rejoins the flow
136 /// |/ 4 = "Else" optional subregion, runs if the condition is false
137 /// 5 5 = "End" block, also rejoins the control flow
140 /// Control flow is expressed as a branch where the true exit goes into the
141 /// "Then"/"Else" region, while the false exit skips the region
142 /// The condition for the optional "Else" region is expressed as a PHI node.
143 /// The incomming values of the PHI node are true for the "If" edge and false
144 /// for the "Then" edge.
146 /// Additionally to that even complicated loops look like this:
153 /// | / 1 = "Entry" block
154 /// |/ 2 = "Loop" optional subregion, with all exits at "Flow" block
155 /// 3 3 = "Flow" block, with back edge to entry block
159 /// The back edge of the "Flow" block is always on the false side of the branch
160 /// while the true side continues the general flow. So the loop condition
161 /// consist of a network of PHI nodes where the true incoming values expresses
162 /// breaks and the false values expresses continue states.
163 class StructurizeCFG : public RegionPass {
165 ConstantInt *BoolTrue;
166 ConstantInt *BoolFalse;
167 UndefValue *BoolUndef;
170 Region *ParentRegion;
178 BBPhiMap DeletedPhis;
179 BB2BBVecMap AddedPhis;
182 BranchVector Conditions;
186 BranchVector LoopConds;
188 RegionNode *PrevNode;
192 void analyzeLoops(RegionNode *N);
194 Value *invert(Value *Condition);
196 Value *buildCondition(BranchInst *Term, unsigned Idx, bool Invert);
198 void gatherPredicates(RegionNode *N);
202 void insertConditions(bool Loops);
204 void delPhiValues(BasicBlock *From, BasicBlock *To);
206 void addPhiValues(BasicBlock *From, BasicBlock *To);
210 void killTerminator(BasicBlock *BB);
212 void changeExit(RegionNode *Node, BasicBlock *NewExit,
213 bool IncludeDominator);
215 BasicBlock *getNextFlow(BasicBlock *Dominator);
217 BasicBlock *needPrefix(bool NeedEmpty);
219 BasicBlock *needPostfix(BasicBlock *Flow, bool ExitUseAllowed);
221 void setPrevNode(BasicBlock *BB);
223 bool dominatesPredicates(BasicBlock *BB, RegionNode *Node);
225 bool isPredictableTrue(RegionNode *Node);
227 void wireFlow(bool ExitUseAllowed, BasicBlock *LoopEnd);
229 void handleLoops(bool ExitUseAllowed, BasicBlock *LoopEnd);
240 initializeStructurizeCFGPass(*PassRegistry::getPassRegistry());
243 using Pass::doInitialization;
244 bool doInitialization(Region *R, RGPassManager &RGM) override;
246 bool runOnRegion(Region *R, RGPassManager &RGM) override;
248 const char *getPassName() const override {
249 return "Structurize control flow";
252 void getAnalysisUsage(AnalysisUsage &AU) const override {
253 AU.addRequiredID(LowerSwitchID);
254 AU.addRequired<DominatorTreeWrapperPass>();
255 AU.addRequired<LoopInfoWrapperPass>();
256 AU.addPreserved<DominatorTreeWrapperPass>();
257 RegionPass::getAnalysisUsage(AU);
261 } // end anonymous namespace
263 char StructurizeCFG::ID = 0;
265 INITIALIZE_PASS_BEGIN(StructurizeCFG, "structurizecfg", "Structurize the CFG",
267 INITIALIZE_PASS_DEPENDENCY(LowerSwitch)
268 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
269 INITIALIZE_PASS_DEPENDENCY(RegionInfoPass)
270 INITIALIZE_PASS_END(StructurizeCFG, "structurizecfg", "Structurize the CFG",
273 /// \brief Initialize the types and constants used in the pass
274 bool StructurizeCFG::doInitialization(Region *R, RGPassManager &RGM) {
275 LLVMContext &Context = R->getEntry()->getContext();
277 Boolean = Type::getInt1Ty(Context);
278 BoolTrue = ConstantInt::getTrue(Context);
279 BoolFalse = ConstantInt::getFalse(Context);
280 BoolUndef = UndefValue::get(Boolean);
285 /// \brief Build up the general order of nodes
286 void StructurizeCFG::orderNodes() {
288 ReversePostOrderTraversal<Region*> RPOT(ParentRegion);
289 TempOrder.append(RPOT.begin(), RPOT.end());
291 std::map<Loop*, unsigned> LoopBlocks;
294 // The reverse post-order traversal of the list gives us an ordering close
295 // to what we want. The only problem with it is that sometimes backedges
296 // for outer loops will be visited before backedges for inner loops.
297 for (RegionNode *RN : TempOrder) {
298 BasicBlock *BB = RN->getEntry();
299 Loop *Loop = LI->getLoopFor(BB);
300 if (!LoopBlocks.count(Loop)) {
301 LoopBlocks[Loop] = 1;
307 unsigned CurrentLoopDepth = 0;
308 Loop *CurrentLoop = nullptr;
310 for (RNVector::iterator I = TempOrder.begin(), E = TempOrder.end(); I != E; ++I) {
311 BasicBlock *BB = (*I)->getEntry();
312 unsigned LoopDepth = LI->getLoopDepth(BB);
314 if (std::find(Order.begin(), Order.end(), *I) != Order.end())
317 if (LoopDepth < CurrentLoopDepth) {
318 // Make sure we have visited all blocks in this loop before moving back to
321 RNVector::iterator LoopI = I;
322 while(LoopBlocks[CurrentLoop]) {
324 BasicBlock *LoopBB = (*LoopI)->getEntry();
325 if (LI->getLoopFor(LoopBB) == CurrentLoop) {
326 LoopBlocks[CurrentLoop]--;
327 Order.push_back(*LoopI);
332 CurrentLoop = LI->getLoopFor(BB);
334 LoopBlocks[CurrentLoop]--;
337 CurrentLoopDepth = LoopDepth;
341 // This pass originally used a post-order traversal and then operated on
342 // the list in reverse. Now that we are using a reverse post-order traversal
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.
345 std::reverse(Order.begin(), Order.end());
348 /// \brief Determine the end of the loops
349 void StructurizeCFG::analyzeLoops(RegionNode *N) {
350 if (N->isSubRegion()) {
351 // Test for exit as back edge
352 BasicBlock *Exit = N->getNodeAs<Region>()->getExit();
353 if (Visited.count(Exit))
354 Loops[Exit] = N->getEntry();
357 // Test for sucessors as back edge
358 BasicBlock *BB = N->getNodeAs<BasicBlock>();
359 BranchInst *Term = cast<BranchInst>(BB->getTerminator());
361 for (BasicBlock *Succ : Term->successors())
362 if (Visited.count(Succ))
367 /// \brief Invert the given condition
368 Value *StructurizeCFG::invert(Value *Condition) {
369 // First: Check if it's a constant
370 if (Condition == BoolTrue)
373 if (Condition == BoolFalse)
376 if (Condition == BoolUndef)
379 // Second: If the condition is already inverted, return the original value
380 if (match(Condition, m_Not(m_Value(Condition))))
383 if (Instruction *Inst = dyn_cast<Instruction>(Condition)) {
384 // Third: Check all the users for an invert
385 BasicBlock *Parent = Inst->getParent();
386 for (User *U : Condition->users())
387 if (Instruction *I = dyn_cast<Instruction>(U))
388 if (I->getParent() == Parent && match(I, m_Not(m_Specific(Condition))))
391 // Last option: Create a new instruction
392 return BinaryOperator::CreateNot(Condition, "", Parent->getTerminator());
395 if (Argument *Arg = dyn_cast<Argument>(Condition)) {
396 BasicBlock &EntryBlock = Arg->getParent()->getEntryBlock();
397 return BinaryOperator::CreateNot(Condition,
398 Arg->getName() + ".inv",
399 EntryBlock.getTerminator());
402 llvm_unreachable("Unhandled condition to invert");
405 /// \brief Build the condition for one edge
406 Value *StructurizeCFG::buildCondition(BranchInst *Term, unsigned Idx,
408 Value *Cond = Invert ? BoolFalse : BoolTrue;
409 if (Term->isConditional()) {
410 Cond = Term->getCondition();
412 if (Idx != (unsigned)Invert)
418 /// \brief Analyze the predecessors of each block and build up predicates
419 void StructurizeCFG::gatherPredicates(RegionNode *N) {
420 RegionInfo *RI = ParentRegion->getRegionInfo();
421 BasicBlock *BB = N->getEntry();
422 BBPredicates &Pred = Predicates[BB];
423 BBPredicates &LPred = LoopPreds[BB];
425 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB);
428 // Ignore it if it's a branch from outside into our region entry
429 if (!ParentRegion->contains(*PI))
432 Region *R = RI->getRegionFor(*PI);
433 if (R == ParentRegion) {
435 // It's a top level block in our region
436 BranchInst *Term = cast<BranchInst>((*PI)->getTerminator());
437 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) {
438 BasicBlock *Succ = Term->getSuccessor(i);
442 if (Visited.count(*PI)) {
443 // Normal forward edge
444 if (Term->isConditional()) {
445 // Try to treat it like an ELSE block
446 BasicBlock *Other = Term->getSuccessor(!i);
447 if (Visited.count(Other) && !Loops.count(Other) &&
448 !Pred.count(Other) && !Pred.count(*PI)) {
450 Pred[Other] = BoolFalse;
451 Pred[*PI] = BoolTrue;
455 Pred[*PI] = buildCondition(Term, i, false);
459 LPred[*PI] = buildCondition(Term, i, true);
465 // It's an exit from a sub region
466 while (R->getParent() != ParentRegion)
469 // Edge from inside a subregion to its entry, ignore it
473 BasicBlock *Entry = R->getEntry();
474 if (Visited.count(Entry))
475 Pred[Entry] = BoolTrue;
477 LPred[Entry] = BoolFalse;
482 /// \brief Collect various loop and predicate infos
483 void StructurizeCFG::collectInfos() {
491 // Reset the visited nodes
494 for (RNVector::reverse_iterator OI = Order.rbegin(), OE = Order.rend();
497 DEBUG(dbgs() << "Visiting: " <<
498 ((*OI)->isSubRegion() ? "SubRegion with entry: " : "") <<
499 (*OI)->getEntry()->getName() << " Loop Depth: " << LI->getLoopDepth((*OI)->getEntry()) << "\n");
501 // Analyze all the conditions leading to a node
502 gatherPredicates(*OI);
504 // Remember that we've seen this node
505 Visited.insert((*OI)->getEntry());
507 // Find the last back edges
512 /// \brief Insert the missing branch conditions
513 void StructurizeCFG::insertConditions(bool Loops) {
514 BranchVector &Conds = Loops ? LoopConds : Conditions;
515 Value *Default = Loops ? BoolTrue : BoolFalse;
516 SSAUpdater PhiInserter;
518 for (BranchInst *Term : Conds) {
519 assert(Term->isConditional());
521 BasicBlock *Parent = Term->getParent();
522 BasicBlock *SuccTrue = Term->getSuccessor(0);
523 BasicBlock *SuccFalse = Term->getSuccessor(1);
525 PhiInserter.Initialize(Boolean, "");
526 PhiInserter.AddAvailableValue(&Func->getEntryBlock(), Default);
527 PhiInserter.AddAvailableValue(Loops ? SuccFalse : Parent, Default);
529 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue];
531 NearestCommonDominator Dominator(DT);
532 Dominator.addBlock(Parent, false);
534 Value *ParentValue = nullptr;
535 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
538 if (PI->first == Parent) {
539 ParentValue = PI->second;
542 PhiInserter.AddAvailableValue(PI->first, PI->second);
543 Dominator.addBlock(PI->first);
547 Term->setCondition(ParentValue);
549 if (!Dominator.wasResultExplicitMentioned())
550 PhiInserter.AddAvailableValue(Dominator.getResult(), Default);
552 Term->setCondition(PhiInserter.GetValueInMiddleOfBlock(Parent));
557 /// \brief Remove all PHI values coming from "From" into "To" and remember
558 /// them in DeletedPhis
559 void StructurizeCFG::delPhiValues(BasicBlock *From, BasicBlock *To) {
560 PhiMap &Map = DeletedPhis[To];
561 for (BasicBlock::iterator I = To->begin(), E = To->end();
562 I != E && isa<PHINode>(*I);) {
564 PHINode &Phi = cast<PHINode>(*I++);
565 while (Phi.getBasicBlockIndex(From) != -1) {
566 Value *Deleted = Phi.removeIncomingValue(From, false);
567 Map[&Phi].push_back(std::make_pair(From, Deleted));
572 /// \brief Add a dummy PHI value as soon as we knew the new predecessor
573 void StructurizeCFG::addPhiValues(BasicBlock *From, BasicBlock *To) {
574 for (BasicBlock::iterator I = To->begin(), E = To->end();
575 I != E && isa<PHINode>(*I);) {
577 PHINode &Phi = cast<PHINode>(*I++);
578 Value *Undef = UndefValue::get(Phi.getType());
579 Phi.addIncoming(Undef, From);
581 AddedPhis[To].push_back(From);
584 /// \brief Add the real PHI value as soon as everything is set up
585 void StructurizeCFG::setPhiValues() {
587 for (BB2BBVecMap::iterator AI = AddedPhis.begin(), AE = AddedPhis.end();
590 BasicBlock *To = AI->first;
591 BBVector &From = AI->second;
593 if (!DeletedPhis.count(To))
596 PhiMap &Map = DeletedPhis[To];
597 for (PhiMap::iterator PI = Map.begin(), PE = Map.end();
600 PHINode *Phi = PI->first;
601 Value *Undef = UndefValue::get(Phi->getType());
602 Updater.Initialize(Phi->getType(), "");
603 Updater.AddAvailableValue(&Func->getEntryBlock(), Undef);
604 Updater.AddAvailableValue(To, Undef);
606 NearestCommonDominator Dominator(DT);
607 Dominator.addBlock(To, false);
608 for (BBValueVector::iterator VI = PI->second.begin(),
609 VE = PI->second.end(); VI != VE; ++VI) {
611 Updater.AddAvailableValue(VI->first, VI->second);
612 Dominator.addBlock(VI->first);
615 if (!Dominator.wasResultExplicitMentioned())
616 Updater.AddAvailableValue(Dominator.getResult(), Undef);
618 for (BBVector::iterator FI = From.begin(), FE = From.end();
621 int Idx = Phi->getBasicBlockIndex(*FI);
623 Phi->setIncomingValue(Idx, Updater.GetValueAtEndOfBlock(*FI));
627 DeletedPhis.erase(To);
629 assert(DeletedPhis.empty());
632 /// \brief Remove phi values from all successors and then remove the terminator.
633 void StructurizeCFG::killTerminator(BasicBlock *BB) {
634 TerminatorInst *Term = BB->getTerminator();
638 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB);
641 delPhiValues(BB, *SI);
644 Term->eraseFromParent();
647 /// \brief Let node exit(s) point to NewExit
648 void StructurizeCFG::changeExit(RegionNode *Node, BasicBlock *NewExit,
649 bool IncludeDominator) {
650 if (Node->isSubRegion()) {
651 Region *SubRegion = Node->getNodeAs<Region>();
652 BasicBlock *OldExit = SubRegion->getExit();
653 BasicBlock *Dominator = nullptr;
655 // Find all the edges from the sub region to the exit
656 for (pred_iterator I = pred_begin(OldExit), E = pred_end(OldExit);
659 BasicBlock *BB = *I++;
660 if (!SubRegion->contains(BB))
663 // Modify the edges to point to the new exit
664 delPhiValues(BB, OldExit);
665 BB->getTerminator()->replaceUsesOfWith(OldExit, NewExit);
666 addPhiValues(BB, NewExit);
668 // Find the new dominator (if requested)
669 if (IncludeDominator) {
673 Dominator = DT->findNearestCommonDominator(Dominator, BB);
677 // Change the dominator (if requested)
679 DT->changeImmediateDominator(NewExit, Dominator);
681 // Update the region info
682 SubRegion->replaceExit(NewExit);
685 BasicBlock *BB = Node->getNodeAs<BasicBlock>();
687 BranchInst::Create(NewExit, BB);
688 addPhiValues(BB, NewExit);
689 if (IncludeDominator)
690 DT->changeImmediateDominator(NewExit, BB);
694 /// \brief Create a new flow node and update dominator tree and region info
695 BasicBlock *StructurizeCFG::getNextFlow(BasicBlock *Dominator) {
696 LLVMContext &Context = Func->getContext();
697 BasicBlock *Insert = Order.empty() ? ParentRegion->getExit() :
698 Order.back()->getEntry();
699 BasicBlock *Flow = BasicBlock::Create(Context, FlowBlockName,
701 DT->addNewBlock(Flow, Dominator);
702 ParentRegion->getRegionInfo()->setRegionFor(Flow, ParentRegion);
706 /// \brief Create a new or reuse the previous node as flow node
707 BasicBlock *StructurizeCFG::needPrefix(bool NeedEmpty) {
708 BasicBlock *Entry = PrevNode->getEntry();
710 if (!PrevNode->isSubRegion()) {
711 killTerminator(Entry);
712 if (!NeedEmpty || Entry->getFirstInsertionPt() == Entry->end())
717 // create a new flow node
718 BasicBlock *Flow = getNextFlow(Entry);
721 changeExit(PrevNode, Flow, true);
722 PrevNode = ParentRegion->getBBNode(Flow);
726 /// \brief Returns the region exit if possible, otherwise just a new flow node
727 BasicBlock *StructurizeCFG::needPostfix(BasicBlock *Flow,
728 bool ExitUseAllowed) {
729 if (Order.empty() && ExitUseAllowed) {
730 BasicBlock *Exit = ParentRegion->getExit();
731 DT->changeImmediateDominator(Exit, Flow);
732 addPhiValues(Flow, Exit);
735 return getNextFlow(Flow);
738 /// \brief Set the previous node
739 void StructurizeCFG::setPrevNode(BasicBlock *BB) {
740 PrevNode = ParentRegion->contains(BB) ? ParentRegion->getBBNode(BB)
744 /// \brief Does BB dominate all the predicates of Node ?
745 bool StructurizeCFG::dominatesPredicates(BasicBlock *BB, RegionNode *Node) {
746 BBPredicates &Preds = Predicates[Node->getEntry()];
747 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
750 if (!DT->dominates(BB, PI->first))
756 /// \brief Can we predict that this node will always be called?
757 bool StructurizeCFG::isPredictableTrue(RegionNode *Node) {
758 BBPredicates &Preds = Predicates[Node->getEntry()];
759 bool Dominated = false;
761 // Regionentry is always true
765 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end();
768 if (I->second != BoolTrue)
771 if (!Dominated && DT->dominates(I->first, PrevNode->getEntry()))
775 // TODO: The dominator check is too strict
779 /// Take one node from the order vector and wire it up
780 void StructurizeCFG::wireFlow(bool ExitUseAllowed,
781 BasicBlock *LoopEnd) {
782 RegionNode *Node = Order.pop_back_val();
783 Visited.insert(Node->getEntry());
785 if (isPredictableTrue(Node)) {
786 // Just a linear flow
788 changeExit(PrevNode, Node->getEntry(), true);
793 // Insert extra prefix node (or reuse last one)
794 BasicBlock *Flow = needPrefix(false);
796 // Insert extra postfix node (or use exit instead)
797 BasicBlock *Entry = Node->getEntry();
798 BasicBlock *Next = needPostfix(Flow, ExitUseAllowed);
800 // let it point to entry and next block
801 Conditions.push_back(BranchInst::Create(Entry, Next, BoolUndef, Flow));
802 addPhiValues(Flow, Entry);
803 DT->changeImmediateDominator(Entry, Flow);
806 while (!Order.empty() && !Visited.count(LoopEnd) &&
807 dominatesPredicates(Entry, Order.back())) {
808 handleLoops(false, LoopEnd);
811 changeExit(PrevNode, Next, false);
816 void StructurizeCFG::handleLoops(bool ExitUseAllowed,
817 BasicBlock *LoopEnd) {
818 RegionNode *Node = Order.back();
819 BasicBlock *LoopStart = Node->getEntry();
821 if (!Loops.count(LoopStart)) {
822 wireFlow(ExitUseAllowed, LoopEnd);
826 if (!isPredictableTrue(Node))
827 LoopStart = needPrefix(true);
829 LoopEnd = Loops[Node->getEntry()];
830 wireFlow(false, LoopEnd);
831 while (!Visited.count(LoopEnd)) {
832 handleLoops(false, LoopEnd);
835 // If the start of the loop is the entry block, we can't branch to it so
836 // insert a new dummy entry block.
837 Function *LoopFunc = LoopStart->getParent();
838 if (LoopStart == &LoopFunc->getEntryBlock()) {
839 LoopStart->setName("entry.orig");
841 BasicBlock *NewEntry =
842 BasicBlock::Create(LoopStart->getContext(),
846 BranchInst::Create(LoopStart, NewEntry);
849 // Create an extra loop end node
850 LoopEnd = needPrefix(false);
851 BasicBlock *Next = needPostfix(LoopEnd, ExitUseAllowed);
852 LoopConds.push_back(BranchInst::Create(Next, LoopStart,
853 BoolUndef, LoopEnd));
854 addPhiValues(LoopEnd, LoopStart);
858 /// After this function control flow looks like it should be, but
859 /// branches and PHI nodes only have undefined conditions.
860 void StructurizeCFG::createFlow() {
861 BasicBlock *Exit = ParentRegion->getExit();
862 bool EntryDominatesExit = DT->dominates(ParentRegion->getEntry(), Exit);
872 while (!Order.empty()) {
873 handleLoops(EntryDominatesExit, nullptr);
877 changeExit(PrevNode, Exit, EntryDominatesExit);
879 assert(EntryDominatesExit);
882 /// Handle a rare case where the disintegrated nodes instructions
883 /// no longer dominate all their uses. Not sure if this is really nessasary
884 void StructurizeCFG::rebuildSSA() {
886 for (auto *BB : ParentRegion->blocks())
887 for (BasicBlock::iterator II = BB->begin(), IE = BB->end();
890 bool Initialized = false;
891 for (auto I = II->use_begin(), E = II->use_end(); I != E;) {
893 Instruction *User = cast<Instruction>(U.getUser());
894 if (User->getParent() == BB) {
897 } else if (PHINode *UserPN = dyn_cast<PHINode>(User)) {
898 if (UserPN->getIncomingBlock(U) == BB)
902 if (DT->dominates(&*II, User))
906 Value *Undef = UndefValue::get(II->getType());
907 Updater.Initialize(II->getType(), "");
908 Updater.AddAvailableValue(&Func->getEntryBlock(), Undef);
909 Updater.AddAvailableValue(BB, &*II);
912 Updater.RewriteUseAfterInsertions(U);
917 /// \brief Run the transformation for each region found
918 bool StructurizeCFG::runOnRegion(Region *R, RGPassManager &RGM) {
919 if (R->isTopLevelRegion())
922 Func = R->getEntry()->getParent();
925 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
926 LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
931 insertConditions(false);
932 insertConditions(true);
950 /// \brief Create the pass
951 Pass *llvm::createStructurizeCFGPass() {
952 return new StructurizeCFG();