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 #define DEBUG_TYPE "structurizecfg"
11 #include "llvm/Transforms/Scalar.h"
12 #include "llvm/ADT/MapVector.h"
13 #include "llvm/ADT/SCCIterator.h"
14 #include "llvm/Analysis/RegionInfo.h"
15 #include "llvm/Analysis/RegionIterator.h"
16 #include "llvm/Analysis/RegionPass.h"
17 #include "llvm/IR/Module.h"
18 #include "llvm/Support/PatternMatch.h"
19 #include "llvm/Transforms/Utils/SSAUpdater.h"
22 using namespace llvm::PatternMatch;
26 // Definition of the complex types used in this pass.
28 typedef std::pair<BasicBlock *, Value *> BBValuePair;
30 typedef SmallVector<RegionNode*, 8> RNVector;
31 typedef SmallVector<BasicBlock*, 8> BBVector;
32 typedef SmallVector<BranchInst*, 8> BranchVector;
33 typedef SmallVector<BBValuePair, 2> BBValueVector;
35 typedef SmallPtrSet<BasicBlock *, 8> BBSet;
37 typedef MapVector<PHINode *, BBValueVector> PhiMap;
38 typedef MapVector<BasicBlock *, BBVector> BB2BBVecMap;
40 typedef DenseMap<DomTreeNode *, unsigned> DTN2UnsignedMap;
41 typedef DenseMap<BasicBlock *, PhiMap> BBPhiMap;
42 typedef DenseMap<BasicBlock *, Value *> BBPredicates;
43 typedef DenseMap<BasicBlock *, BBPredicates> PredMap;
44 typedef DenseMap<BasicBlock *, BasicBlock*> BB2BBMap;
46 // The name for newly created blocks.
48 static const char *const FlowBlockName = "Flow";
50 /// @brief Find the nearest common dominator for multiple BasicBlocks
52 /// Helper class for StructurizeCFG
53 /// TODO: Maybe move into common code
54 class NearestCommonDominator {
57 DTN2UnsignedMap IndexMap;
61 bool ExplicitMentioned;
64 /// \brief Start a new query
65 NearestCommonDominator(DominatorTree *DomTree) {
70 /// \brief Add BB to the resulting dominator
71 void addBlock(BasicBlock *BB, bool Remember = true) {
72 DomTreeNode *Node = DT->getNode(BB);
75 unsigned Numbering = 0;
76 for (;Node;Node = Node->getIDom())
77 IndexMap[Node] = ++Numbering;
80 ExplicitMentioned = Remember;
84 for (;Node;Node = Node->getIDom())
85 if (IndexMap.count(Node))
90 assert(Node && "Dominator tree invalid!");
92 unsigned Numbering = IndexMap[Node];
93 if (Numbering > ResultIndex) {
94 Result = Node->getBlock();
95 ResultIndex = Numbering;
96 ExplicitMentioned = Remember && (Result == BB);
97 } else if (Numbering == ResultIndex) {
98 ExplicitMentioned |= Remember;
102 /// \brief Is "Result" one of the BBs added with "Remember" = True?
103 bool wasResultExplicitMentioned() {
104 return ExplicitMentioned;
107 /// \brief Get the query result
108 BasicBlock *getResult() {
113 /// @brief Transforms the control flow graph on one single entry/exit region
116 /// After the transform all "If"/"Then"/"Else" style control flow looks like
128 /// | | 1 = "If" block, calculates the condition
129 /// 4 | 2 = "Then" subregion, runs if the condition is true
130 /// | / 3 = "Flow" blocks, newly inserted flow blocks, rejoins the flow
131 /// |/ 4 = "Else" optional subregion, runs if the condition is false
132 /// 5 5 = "End" block, also rejoins the control flow
135 /// Control flow is expressed as a branch where the true exit goes into the
136 /// "Then"/"Else" region, while the false exit skips the region
137 /// The condition for the optional "Else" region is expressed as a PHI node.
138 /// The incomming values of the PHI node are true for the "If" edge and false
139 /// for the "Then" edge.
141 /// Additionally to that even complicated loops look like this:
148 /// | / 1 = "Entry" block
149 /// |/ 2 = "Loop" optional subregion, with all exits at "Flow" block
150 /// 3 3 = "Flow" block, with back edge to entry block
154 /// The back edge of the "Flow" block is always on the false side of the branch
155 /// while the true side continues the general flow. So the loop condition
156 /// consist of a network of PHI nodes where the true incoming values expresses
157 /// breaks and the false values expresses continue states.
158 class StructurizeCFG : public RegionPass {
160 ConstantInt *BoolTrue;
161 ConstantInt *BoolFalse;
162 UndefValue *BoolUndef;
165 Region *ParentRegion;
172 BBPhiMap DeletedPhis;
173 BB2BBVecMap AddedPhis;
176 BranchVector Conditions;
180 BranchVector LoopConds;
182 RegionNode *PrevNode;
186 void analyzeLoops(RegionNode *N);
188 Value *invert(Value *Condition);
190 Value *buildCondition(BranchInst *Term, unsigned Idx, bool Invert);
192 void gatherPredicates(RegionNode *N);
196 void insertConditions(bool Loops);
198 void delPhiValues(BasicBlock *From, BasicBlock *To);
200 void addPhiValues(BasicBlock *From, BasicBlock *To);
204 void killTerminator(BasicBlock *BB);
206 void changeExit(RegionNode *Node, BasicBlock *NewExit,
207 bool IncludeDominator);
209 BasicBlock *getNextFlow(BasicBlock *Dominator);
211 BasicBlock *needPrefix(bool NeedEmpty);
213 BasicBlock *needPostfix(BasicBlock *Flow, bool ExitUseAllowed);
215 void setPrevNode(BasicBlock *BB);
217 bool dominatesPredicates(BasicBlock *BB, RegionNode *Node);
219 bool isPredictableTrue(RegionNode *Node);
221 void wireFlow(bool ExitUseAllowed, BasicBlock *LoopEnd);
223 void handleLoops(bool ExitUseAllowed, BasicBlock *LoopEnd);
234 initializeStructurizeCFGPass(*PassRegistry::getPassRegistry());
237 using Pass::doInitialization;
238 virtual bool doInitialization(Region *R, RGPassManager &RGM);
240 virtual bool runOnRegion(Region *R, RGPassManager &RGM);
242 virtual const char *getPassName() const {
243 return "Structurize control flow";
246 void getAnalysisUsage(AnalysisUsage &AU) const {
247 AU.addRequiredID(LowerSwitchID);
248 AU.addRequired<DominatorTree>();
249 AU.addPreserved<DominatorTree>();
250 RegionPass::getAnalysisUsage(AU);
254 } // end anonymous namespace
256 char StructurizeCFG::ID = 0;
258 INITIALIZE_PASS_BEGIN(StructurizeCFG, "structurizecfg", "Structurize the CFG",
260 INITIALIZE_PASS_DEPENDENCY(LowerSwitch)
261 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
262 INITIALIZE_PASS_DEPENDENCY(RegionInfo)
263 INITIALIZE_PASS_END(StructurizeCFG, "structurizecfg", "Structurize the CFG",
266 /// \brief Initialize the types and constants used in the pass
267 bool StructurizeCFG::doInitialization(Region *R, RGPassManager &RGM) {
268 LLVMContext &Context = R->getEntry()->getContext();
270 Boolean = Type::getInt1Ty(Context);
271 BoolTrue = ConstantInt::getTrue(Context);
272 BoolFalse = ConstantInt::getFalse(Context);
273 BoolUndef = UndefValue::get(Boolean);
278 /// \brief Build up the general order of nodes
279 void StructurizeCFG::orderNodes() {
280 scc_iterator<Region *> I = scc_begin(ParentRegion),
281 E = scc_end(ParentRegion);
282 for (Order.clear(); I != E; ++I) {
283 std::vector<RegionNode *> &Nodes = *I;
284 Order.append(Nodes.begin(), Nodes.end());
288 /// \brief Determine the end of the loops
289 void StructurizeCFG::analyzeLoops(RegionNode *N) {
290 if (N->isSubRegion()) {
291 // Test for exit as back edge
292 BasicBlock *Exit = N->getNodeAs<Region>()->getExit();
293 if (Visited.count(Exit))
294 Loops[Exit] = N->getEntry();
297 // Test for sucessors as back edge
298 BasicBlock *BB = N->getNodeAs<BasicBlock>();
299 BranchInst *Term = cast<BranchInst>(BB->getTerminator());
301 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) {
302 BasicBlock *Succ = Term->getSuccessor(i);
304 if (Visited.count(Succ))
310 /// \brief Invert the given condition
311 Value *StructurizeCFG::invert(Value *Condition) {
312 // First: Check if it's a constant
313 if (Condition == BoolTrue)
316 if (Condition == BoolFalse)
319 if (Condition == BoolUndef)
322 // Second: If the condition is already inverted, return the original value
323 if (match(Condition, m_Not(m_Value(Condition))))
326 // Third: Check all the users for an invert
327 BasicBlock *Parent = cast<Instruction>(Condition)->getParent();
328 for (Value::use_iterator I = Condition->use_begin(),
329 E = Condition->use_end(); I != E; ++I) {
331 Instruction *User = dyn_cast<Instruction>(*I);
332 if (!User || User->getParent() != Parent)
335 if (match(*I, m_Not(m_Specific(Condition))))
339 // Last option: Create a new instruction
340 return BinaryOperator::CreateNot(Condition, "", Parent->getTerminator());
343 /// \brief Build the condition for one edge
344 Value *StructurizeCFG::buildCondition(BranchInst *Term, unsigned Idx,
346 Value *Cond = Invert ? BoolFalse : BoolTrue;
347 if (Term->isConditional()) {
348 Cond = Term->getCondition();
350 if (Idx != (unsigned)Invert)
356 /// \brief Analyze the predecessors of each block and build up predicates
357 void StructurizeCFG::gatherPredicates(RegionNode *N) {
358 RegionInfo *RI = ParentRegion->getRegionInfo();
359 BasicBlock *BB = N->getEntry();
360 BBPredicates &Pred = Predicates[BB];
361 BBPredicates &LPred = LoopPreds[BB];
363 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB);
366 // Ignore it if it's a branch from outside into our region entry
367 if (!ParentRegion->contains(*PI))
370 Region *R = RI->getRegionFor(*PI);
371 if (R == ParentRegion) {
373 // It's a top level block in our region
374 BranchInst *Term = cast<BranchInst>((*PI)->getTerminator());
375 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) {
376 BasicBlock *Succ = Term->getSuccessor(i);
380 if (Visited.count(*PI)) {
381 // Normal forward edge
382 if (Term->isConditional()) {
383 // Try to treat it like an ELSE block
384 BasicBlock *Other = Term->getSuccessor(!i);
385 if (Visited.count(Other) && !Loops.count(Other) &&
386 !Pred.count(Other) && !Pred.count(*PI)) {
388 Pred[Other] = BoolFalse;
389 Pred[*PI] = BoolTrue;
393 Pred[*PI] = buildCondition(Term, i, false);
397 LPred[*PI] = buildCondition(Term, i, true);
403 // It's an exit from a sub region
404 while(R->getParent() != ParentRegion)
407 // Edge from inside a subregion to its entry, ignore it
411 BasicBlock *Entry = R->getEntry();
412 if (Visited.count(Entry))
413 Pred[Entry] = BoolTrue;
415 LPred[Entry] = BoolFalse;
420 /// \brief Collect various loop and predicate infos
421 void StructurizeCFG::collectInfos() {
429 // Reset the visited nodes
432 for (RNVector::reverse_iterator OI = Order.rbegin(), OE = Order.rend();
435 // Analyze all the conditions leading to a node
436 gatherPredicates(*OI);
438 // Remember that we've seen this node
439 Visited.insert((*OI)->getEntry());
441 // Find the last back edges
446 /// \brief Insert the missing branch conditions
447 void StructurizeCFG::insertConditions(bool Loops) {
448 BranchVector &Conds = Loops ? LoopConds : Conditions;
449 Value *Default = Loops ? BoolTrue : BoolFalse;
450 SSAUpdater PhiInserter;
452 for (BranchVector::iterator I = Conds.begin(),
453 E = Conds.end(); I != E; ++I) {
455 BranchInst *Term = *I;
456 assert(Term->isConditional());
458 BasicBlock *Parent = Term->getParent();
459 BasicBlock *SuccTrue = Term->getSuccessor(0);
460 BasicBlock *SuccFalse = Term->getSuccessor(1);
462 PhiInserter.Initialize(Boolean, "");
463 PhiInserter.AddAvailableValue(&Func->getEntryBlock(), Default);
464 PhiInserter.AddAvailableValue(Loops ? SuccFalse : Parent, Default);
466 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue];
468 NearestCommonDominator Dominator(DT);
469 Dominator.addBlock(Parent, false);
471 Value *ParentValue = 0;
472 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
475 if (PI->first == Parent) {
476 ParentValue = PI->second;
479 PhiInserter.AddAvailableValue(PI->first, PI->second);
480 Dominator.addBlock(PI->first);
484 Term->setCondition(ParentValue);
486 if (!Dominator.wasResultExplicitMentioned())
487 PhiInserter.AddAvailableValue(Dominator.getResult(), Default);
489 Term->setCondition(PhiInserter.GetValueInMiddleOfBlock(Parent));
494 /// \brief Remove all PHI values coming from "From" into "To" and remember
495 /// them in DeletedPhis
496 void StructurizeCFG::delPhiValues(BasicBlock *From, BasicBlock *To) {
497 PhiMap &Map = DeletedPhis[To];
498 for (BasicBlock::iterator I = To->begin(), E = To->end();
499 I != E && isa<PHINode>(*I);) {
501 PHINode &Phi = cast<PHINode>(*I++);
502 while (Phi.getBasicBlockIndex(From) != -1) {
503 Value *Deleted = Phi.removeIncomingValue(From, false);
504 Map[&Phi].push_back(std::make_pair(From, Deleted));
509 /// \brief Add a dummy PHI value as soon as we knew the new predecessor
510 void StructurizeCFG::addPhiValues(BasicBlock *From, BasicBlock *To) {
511 for (BasicBlock::iterator I = To->begin(), E = To->end();
512 I != E && isa<PHINode>(*I);) {
514 PHINode &Phi = cast<PHINode>(*I++);
515 Value *Undef = UndefValue::get(Phi.getType());
516 Phi.addIncoming(Undef, From);
518 AddedPhis[To].push_back(From);
521 /// \brief Add the real PHI value as soon as everything is set up
522 void StructurizeCFG::setPhiValues() {
524 for (BB2BBVecMap::iterator AI = AddedPhis.begin(), AE = AddedPhis.end();
527 BasicBlock *To = AI->first;
528 BBVector &From = AI->second;
530 if (!DeletedPhis.count(To))
533 PhiMap &Map = DeletedPhis[To];
534 for (PhiMap::iterator PI = Map.begin(), PE = Map.end();
537 PHINode *Phi = PI->first;
538 Value *Undef = UndefValue::get(Phi->getType());
539 Updater.Initialize(Phi->getType(), "");
540 Updater.AddAvailableValue(&Func->getEntryBlock(), Undef);
541 Updater.AddAvailableValue(To, Undef);
543 NearestCommonDominator Dominator(DT);
544 Dominator.addBlock(To, false);
545 for (BBValueVector::iterator VI = PI->second.begin(),
546 VE = PI->second.end(); VI != VE; ++VI) {
548 Updater.AddAvailableValue(VI->first, VI->second);
549 Dominator.addBlock(VI->first);
552 if (!Dominator.wasResultExplicitMentioned())
553 Updater.AddAvailableValue(Dominator.getResult(), Undef);
555 for (BBVector::iterator FI = From.begin(), FE = From.end();
558 int Idx = Phi->getBasicBlockIndex(*FI);
560 Phi->setIncomingValue(Idx, Updater.GetValueAtEndOfBlock(*FI));
564 DeletedPhis.erase(To);
566 assert(DeletedPhis.empty());
569 /// \brief Remove phi values from all successors and then remove the terminator.
570 void StructurizeCFG::killTerminator(BasicBlock *BB) {
571 TerminatorInst *Term = BB->getTerminator();
575 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB);
578 delPhiValues(BB, *SI);
581 Term->eraseFromParent();
584 /// \brief Let node exit(s) point to NewExit
585 void StructurizeCFG::changeExit(RegionNode *Node, BasicBlock *NewExit,
586 bool IncludeDominator) {
587 if (Node->isSubRegion()) {
588 Region *SubRegion = Node->getNodeAs<Region>();
589 BasicBlock *OldExit = SubRegion->getExit();
590 BasicBlock *Dominator = 0;
592 // Find all the edges from the sub region to the exit
593 for (pred_iterator I = pred_begin(OldExit), E = pred_end(OldExit);
596 BasicBlock *BB = *I++;
597 if (!SubRegion->contains(BB))
600 // Modify the edges to point to the new exit
601 delPhiValues(BB, OldExit);
602 BB->getTerminator()->replaceUsesOfWith(OldExit, NewExit);
603 addPhiValues(BB, NewExit);
605 // Find the new dominator (if requested)
606 if (IncludeDominator) {
610 Dominator = DT->findNearestCommonDominator(Dominator, BB);
614 // Change the dominator (if requested)
616 DT->changeImmediateDominator(NewExit, Dominator);
618 // Update the region info
619 SubRegion->replaceExit(NewExit);
622 BasicBlock *BB = Node->getNodeAs<BasicBlock>();
624 BranchInst::Create(NewExit, BB);
625 addPhiValues(BB, NewExit);
626 if (IncludeDominator)
627 DT->changeImmediateDominator(NewExit, BB);
631 /// \brief Create a new flow node and update dominator tree and region info
632 BasicBlock *StructurizeCFG::getNextFlow(BasicBlock *Dominator) {
633 LLVMContext &Context = Func->getContext();
634 BasicBlock *Insert = Order.empty() ? ParentRegion->getExit() :
635 Order.back()->getEntry();
636 BasicBlock *Flow = BasicBlock::Create(Context, FlowBlockName,
638 DT->addNewBlock(Flow, Dominator);
639 ParentRegion->getRegionInfo()->setRegionFor(Flow, ParentRegion);
643 /// \brief Create a new or reuse the previous node as flow node
644 BasicBlock *StructurizeCFG::needPrefix(bool NeedEmpty) {
645 BasicBlock *Entry = PrevNode->getEntry();
647 if (!PrevNode->isSubRegion()) {
648 killTerminator(Entry);
649 if (!NeedEmpty || Entry->getFirstInsertionPt() == Entry->end())
654 // create a new flow node
655 BasicBlock *Flow = getNextFlow(Entry);
658 changeExit(PrevNode, Flow, true);
659 PrevNode = ParentRegion->getBBNode(Flow);
663 /// \brief Returns the region exit if possible, otherwise just a new flow node
664 BasicBlock *StructurizeCFG::needPostfix(BasicBlock *Flow,
665 bool ExitUseAllowed) {
666 if (Order.empty() && ExitUseAllowed) {
667 BasicBlock *Exit = ParentRegion->getExit();
668 DT->changeImmediateDominator(Exit, Flow);
669 addPhiValues(Flow, Exit);
672 return getNextFlow(Flow);
675 /// \brief Set the previous node
676 void StructurizeCFG::setPrevNode(BasicBlock *BB) {
677 PrevNode = ParentRegion->contains(BB) ? ParentRegion->getBBNode(BB) : 0;
680 /// \brief Does BB dominate all the predicates of Node ?
681 bool StructurizeCFG::dominatesPredicates(BasicBlock *BB, RegionNode *Node) {
682 BBPredicates &Preds = Predicates[Node->getEntry()];
683 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end();
686 if (!DT->dominates(BB, PI->first))
692 /// \brief Can we predict that this node will always be called?
693 bool StructurizeCFG::isPredictableTrue(RegionNode *Node) {
694 BBPredicates &Preds = Predicates[Node->getEntry()];
695 bool Dominated = false;
697 // Regionentry is always true
701 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end();
704 if (I->second != BoolTrue)
707 if (!Dominated && DT->dominates(I->first, PrevNode->getEntry()))
711 // TODO: The dominator check is too strict
715 /// Take one node from the order vector and wire it up
716 void StructurizeCFG::wireFlow(bool ExitUseAllowed,
717 BasicBlock *LoopEnd) {
718 RegionNode *Node = Order.pop_back_val();
719 Visited.insert(Node->getEntry());
721 if (isPredictableTrue(Node)) {
722 // Just a linear flow
724 changeExit(PrevNode, Node->getEntry(), true);
729 // Insert extra prefix node (or reuse last one)
730 BasicBlock *Flow = needPrefix(false);
732 // Insert extra postfix node (or use exit instead)
733 BasicBlock *Entry = Node->getEntry();
734 BasicBlock *Next = needPostfix(Flow, ExitUseAllowed);
736 // let it point to entry and next block
737 Conditions.push_back(BranchInst::Create(Entry, Next, BoolUndef, Flow));
738 addPhiValues(Flow, Entry);
739 DT->changeImmediateDominator(Entry, Flow);
742 while (!Order.empty() && !Visited.count(LoopEnd) &&
743 dominatesPredicates(Entry, Order.back())) {
744 handleLoops(false, LoopEnd);
747 changeExit(PrevNode, Next, false);
752 void StructurizeCFG::handleLoops(bool ExitUseAllowed,
753 BasicBlock *LoopEnd) {
754 RegionNode *Node = Order.back();
755 BasicBlock *LoopStart = Node->getEntry();
757 if (!Loops.count(LoopStart)) {
758 wireFlow(ExitUseAllowed, LoopEnd);
762 if (!isPredictableTrue(Node))
763 LoopStart = needPrefix(true);
765 LoopEnd = Loops[Node->getEntry()];
766 wireFlow(false, LoopEnd);
767 while (!Visited.count(LoopEnd)) {
768 handleLoops(false, LoopEnd);
771 // Create an extra loop end node
772 LoopEnd = needPrefix(false);
773 BasicBlock *Next = needPostfix(LoopEnd, ExitUseAllowed);
774 LoopConds.push_back(BranchInst::Create(Next, LoopStart,
775 BoolUndef, LoopEnd));
776 addPhiValues(LoopEnd, LoopStart);
780 /// After this function control flow looks like it should be, but
781 /// branches and PHI nodes only have undefined conditions.
782 void StructurizeCFG::createFlow() {
783 BasicBlock *Exit = ParentRegion->getExit();
784 bool EntryDominatesExit = DT->dominates(ParentRegion->getEntry(), Exit);
794 while (!Order.empty()) {
795 handleLoops(EntryDominatesExit, 0);
799 changeExit(PrevNode, Exit, EntryDominatesExit);
801 assert(EntryDominatesExit);
804 /// Handle a rare case where the disintegrated nodes instructions
805 /// no longer dominate all their uses. Not sure if this is really nessasary
806 void StructurizeCFG::rebuildSSA() {
808 for (Region::block_iterator I = ParentRegion->block_begin(),
809 E = ParentRegion->block_end();
813 for (BasicBlock::iterator II = BB->begin(), IE = BB->end();
816 bool Initialized = false;
817 for (Use *I = &II->use_begin().getUse(), *Next; I; I = Next) {
821 Instruction *User = cast<Instruction>(I->getUser());
822 if (User->getParent() == BB) {
825 } else if (PHINode *UserPN = dyn_cast<PHINode>(User)) {
826 if (UserPN->getIncomingBlock(*I) == BB)
830 if (DT->dominates(II, User))
834 Value *Undef = UndefValue::get(II->getType());
835 Updater.Initialize(II->getType(), "");
836 Updater.AddAvailableValue(&Func->getEntryBlock(), Undef);
837 Updater.AddAvailableValue(BB, II);
840 Updater.RewriteUseAfterInsertions(*I);
846 /// \brief Run the transformation for each region found
847 bool StructurizeCFG::runOnRegion(Region *R, RGPassManager &RGM) {
848 if (R->isTopLevelRegion())
851 Func = R->getEntry()->getParent();
854 DT = &getAnalysis<DominatorTree>();
859 insertConditions(false);
860 insertConditions(true);
878 /// \brief Create the pass
879 Pass *llvm::createStructurizeCFGPass() {
880 return new StructurizeCFG();