[CGP] Merge empty case blocks if no extra moves are added.

[bmakam]

Summary

Currently we skip merging when extra moves may be added in the header of switch instead of the case block, if the case block is used as an incoming
block of a PHI. If all the incoming values of the PHIs are non-constants and the destination block is dominated by the switch block then extra moves are likely not added by ISel, so there is no need to skip merging in this case.

[junbuml]

I agree that skipping merging is not desirable when an extra mov is not actually added in the header of switch. If we can somehow estimate the generation of an extra mov in here, allowing merging must be a good choice. I'm not perfectly clear if checking constants is good enough for that estimation. However, it's very difficult to perfectly estimate that in CGP, so I'm okay with it if doing this is cheap enough and provide us with a reasonable level of estimation.

[bmakam]

• Added some more checks to allow merging empty cases when we can estimate extra moves are not added.
• Added test cases.
• spec2017/perlbench improves by 4.5%. No other improvements or regressions observed in Spec.

Please take a look.

[bmakam]

kindly ping.

[efriedma]

lib/CodeGen/CodeGenPrepare.cpp

814 ↗

(On Diff #114502)

Checking specifically for ConstantInt here seems a little weird... I would normally expect any constant to behave the same way.

[bmakam]

Address Eli's comment.

[efriedma]

I think this needs more testcases to illustrate the different possibilities here.

lib/CodeGen/CodeGenPrepare.cpp

737 ↗

(On Diff #115236)

If you really need domtree, at least hoist computing it into it out into eliminateMostlyEmptyBlocks. (Computing it here leads to quadratic complexity for large functions.)

784 ↗

(On Diff #115236)

Is this predicate significantly different from dominates(Pred, DestBB)? I mean, in theory it's slightly different, but the difference isn't relevant in your testcase.

816 ↗

(On Diff #115236)

Leftover debug dump?

test/Transforms/CodeGenPrepare/skip-merging-case-block.ll

26 ↗

(On Diff #115236)

Please try to avoid undef in testcases.

[bmakam]

In D37343#875637, @efriedma wrote:

I think this needs more testcases to illustrate the different possibilities here.

Thanks for taking a look Eli. I'll add more testcases.

lib/CodeGen/CodeGenPrepare.cpp

737 ↗

(On Diff #115236)

DT gets modified whenever an empty block is eliminated so I had it here. I agree this is not efficient, let me see if I can hoist it out safely.

784 ↗

(On Diff #115236)

I'll add a testcase and hopefully it will be easier to understand.

816 ↗

(On Diff #115236)

Oops! I will fix this.

test/Transforms/CodeGenPrepare/skip-merging-case-block.ll

26 ↗

(On Diff #115236)

I will fix this.

[bmakam]

Address review comments:

• Added more test cases.

• Remove quadratic complexity to calculate DT.

• Simplified the predicate to dominates(Pred, DestBB) as suggested by Eli.

[efriedma]

Remove quadratic complexity to calculate DT.

You're still computing DT once for every empty block?

[bmakam]

In D37343#880344, @efriedma wrote:

Remove quadratic complexity to calculate DT.

You're still computing DT once for every empty block?

I'm now lazily computing DT only when an empty block can be merged into destination block that have all non-constant incoming phi values. In my tests I found I was computing DT for <10 times. If I have compute DT in eliminateMostlyEmptyBlocks I will be computing for all the functions even though we might not need it and will have to update the DT whenever an empty block is eliminated.

[efriedma]

The real problem with computing DT there isn't how long it takes in common cases, it's that the total time will blow up quadratically for large functions.

Adding a couple more reviewers... the heuristic sort of makes sense to me, but I'd like another opinion.

[hfinkel]

In D37343#881515, @efriedma wrote:

The real problem with computing DT there isn't how long it takes in common cases, it's that the total time will blow up quadratically for large functions.

This certainly makes me nervous.

Can you just precompute the DT for the function? Maintaining the DT while removing mostly-empty blocks might not be hard.

Adding a couple more reviewers... the heuristic sort of makes sense to me, but I'd like another opinion.

lib/CodeGen/CodeGenPrepare.cpp

799 ↗

(On Diff #116503)

You don't need to change this line (AFAIKT).

[bmakam]

Precompute DT as suggested by Hal and Eli. Please take a look.

[efriedma]

lib/CodeGen/CodeGenPrepare.cpp

713 ↗

(On Diff #117074)

This usage of "ModifiedDT" is weird; if the CFG is ever modified, you recompute every time you visit a basic blocK?

720 ↗

(On Diff #117074)

New code should be using insertEdge/deleteEdge/applyUpdates to do domtree updates.

[bmakam]

lib/CodeGen/CodeGenPrepare.cpp

713 ↗

(On Diff #117074)

In some corner cases [1], the entry block is removed and dominator tree cannot be notified of this change. In such cases we will have to recalculate the entire tree. This was primarily the reason why I was lazily computing DT earlier. Please let me know if there is a better way to handle this.
[1] test/Transforms/CodeGenPrepare/2008-11-24-RAUW-Self.ll

720 ↗

(On Diff #117074)

I found this to be more easy to understand, I am happy to change this to DominatorTree::UpdateTypes/applyUpdates if this is the new coding standard.

[bmakam]

lib/CodeGen/CodeGenPrepare.cpp

713 ↗

(On Diff #117074)

It seems like r314435 has taken care of this corner case in MergeBasicBlockIntoOnlyPred. So we can now simply pass DT to MergeBasicBlockIntoOnlyPred. I will rebase and update the patch.

[bmakam]

Rebased.

[bmakam]

lib/CodeGen/CodeGenPrepare.cpp

720 ↗

(On Diff #117074)

I tried using the new batch updater interface for DominatorTree. I create a vector of updates. First, insert edges from all predecessors of BB to DestBB. Second, remove edges from all predecessors of BB to BB and finally, delete edge from BB to DestBB. IIUC, the batch updater is efficient for multiple CFG updates, but in this case updating the IDom and erasing the Node seems more efficient to me.

+    eliminateMostlyEmptyBlock(BB);
     if (DT && !ModifiedDT) {
+/*
       BasicBlock *BBIDom = DT->getNode(BB)->getIDom()->getBlock();
       BasicBlock *DestBBIDom = DT->getNode(DestBB)->getIDom()->getBlock();
       BasicBlock *NewIDom = DT->findNearestCommonDominator(BBIDom, DestBBIDom);
       DT->changeImmediateDominator(DestBB, NewIDom);
       DT->eraseNode(BB);
+*/
+      SmallVector<DominatorTree::UpdateType, 3> Updates;
+      for (auto *PredBB : predecessors(BB)) {
+        if (PredBB == BB)
+          continue;
+        DominatorTree::UpdateType UT = {DominatorTree::Insert, PredBB, DestBB};
+        if (find(Updates, UT) == Updates.end()) {
+          Updates.push_back(UT);
+          Updates.push_back({DominatorTree::Delete, PredBB, BB});
+        }
+      }
+      if (!Updates.empty()) {
+        Updates.push_back({DominatorTree::Delete, BB, DestBB});
+        DT->applyUpdates(Updates);
+      }
     }
-    eliminateMostlyEmptyBlock(BB);

What do you think?

[bmakam]

Use batch updater to inform DT about CFG updates.

[bmakam]

Fix make-check asserts.

[efriedma]

lib/CodeGen/CodeGenPrepare.cpp

349 ↗

(On Diff #117191)

You should be able to guarantee DT is available by putting "AU.addRequired<DominatorTreeWrapperPass>();" in getAnalysisUsage(). That will simplify a bunch of null checks. (It's okay not to preserve it for now, but add a comment noting that you're intentionally not preserving it.)

720 ↗

(On Diff #117074)

IIRC some later dom operations become more expensive after you use changeImmediateDominator, but I don't remember the details. Adding a couple people to the CC list who would know more.

[bmakam]

Address review changes.

lib/CodeGen/CodeGenPrepare.cpp

720 ↗

(On Diff #117074)

Interesting. Thanks, Eli. Anyways, I have now updated the patch to not use changeImmediateDominator and use the new batch update interfaces.

[• dberlin]

lib/CodeGen/CodeGenPrepare.cpp

720 ↗

(On Diff #117074)

FWIW: One of our usual concerns is that what people think is the right way to change the dominator tree is often incorrect in practice.
As for the niceness or not niceness, one significant advantage is that this can update the postdominatortree as well.

What you see as "change a simple dominator", even assuming it is right all the time for dominators, is definitely not right for postdominators :)

Let me tackle the inefficiency and verbosity:

Verbosity is something i mentioned to Jakub, and we're thinking about the kind of Updater interface that hides a little more of this (and updates both dom and postdom).

So i guess i'd much prefer to use the thing you think is inefficient because we know it is right, unless the inefficiency actually

1. is real
2. matters.

(but we are completely aware the interface is a little verbose at the moment, and we're gathering data from how it's being used to know what to do to fix it)

[bmakam]

Thanks Daniel/Eli, I learnt something new today and am glad I asked the question. :)

[efriedma]

lib/CodeGen/CodeGenPrepare.cpp

954 ↗

(On Diff #117210)

"BB->getParent() == DestBB->getParent()"?

Also, you can't use the pointer "BB" after you free it (so this needs to be before the eraseFromParent() call.)

[kuhar]

lib/CodeGen/CodeGenPrepare.cpp

954 ↗

(On Diff #117210)

@efriedma deleteEdge requires the edge to be actually deleted, so the right thing to do is:

1.  BB->removeFromParent()
2.  DT->deleteEdge(BB, DestBB)
3.  delete BB

[kuhar]

lib/CodeGen/CodeGenPrepare.cpp

776 ↗

(On Diff #117210)

Isn't this the same thing as saying all_of(PNs, ... == ...)? I think that would be more straight-forward and easy to read here.

951 ↗

(On Diff #117210)

I think that it'd be better to leave this micro-optimization for the updater to do :)
I'll add it there tomorrow.

[bmakam]

Address review comments.

[efriedma]

lib/CodeGen/CodeGenPrepare.cpp

953 ↗

(On Diff #117725)

"BB->getParent() == DestBB->getParent()" still here. What is that trying to check for?

[bmakam]

lib/CodeGen/CodeGenPrepare.cpp

953 ↗

(On Diff #117725)

err, I was trying to avoid hitting this assert from DT->deleteEdge:
void llvm::DominatorTreeBase<llvm::BasicBlock, false>::deleteEdge(NodeT *, NodeT *) [NodeT = llvm::BasicBlock, IsPostDom = false]: Assertion `From->getParent() == Parent' failed.

But looks like this code is unreachable, so I don't need to delete the edge BB, DestBB after BB->eraseFromParent()?

[bmakam]

lib/CodeGen/CodeGenPrepare.cpp

953 ↗

(On Diff #117725)

I think the right way to delete the edge is

1. BB->getTerminator()->eraseFromParent()
2. DT->deleteEdge(BB, DestBB)
3. BB->eraseFromParent()

This way I don't hit the assert and I can delete the edge in DT.

[bmakam]

fix the sequence of deleting an edge from DT.

[• dberlin]

(Gonna let jakub comment on what should work/not work here)

[kuhar]

lib/CodeGen/CodeGenPrepare.cpp

953 ↗

(On Diff #117725)

Are you sure that calling BB->removeFromParent() actually sets the BB's Parent pointer? The sequence of calls I mention is used in a couple of places quite some time now.

Your method looks correct as well, but I wouldn't call it the most intuitive one :).

[bmakam]

lib/CodeGen/CodeGenPrepare.cpp

953 ↗

(On Diff #117725)

Its possible I might be missing something here, but if I call BB->removeFromParent() and then DT->deleteEdge(BB, DestBB) I hit the above assert for 533 lit test cases with ninja check.

[kuhar]

lib/CodeGen/CodeGenPrepare.cpp

953 ↗

(On Diff #117725)

Ah, I see, I missed that you have an edge BB -> DestBB and want to delete *BB*. In this case, your code looks fine.

[bmakam]

Minor nit, use is_contained. NFCI.

[bmakam]

Hi everyone,

Are there anymore comments on this patch? Thanks!

[efriedma]

LGTM.

[bmakam]

Thanks for the reviews.

llvm/trunk/lib/CodeGen/CodeGenPrepare.cpp

class TypePromotionTransaction;
   class CodeGenPrepare : public FunctionPass {
     const TargetMachine *TM = nullptr;
     const TargetSubtargetInfo *SubtargetInfo;
     const TargetLowering *TLI = nullptr;
     const TargetRegisterInfo *TRI;
     const TargetTransformInfo *TTI = nullptr;
     const TargetLibraryInfo *TLInfo;
     const LoopInfo *LI;
+    DominatorTree *DT;
     std::unique_ptr<BlockFrequencyInfo> BFI;
     std::unique_ptr<BranchProbabilityInfo> BPI;
 
     /// As we scan instructions optimizing them, this is the next instruction
     /// to optimize. Transforms that can invalidate this should update it.
     BasicBlock::iterator CurInstIterator;
 
     /// Keeps track of non-local addresses that have been sunk into a block.
public:
     }
 
     bool runOnFunction(Function &F) override;
 
     StringRef getPassName() const override { return "CodeGen Prepare"; }
 
     void getAnalysisUsage(AnalysisUsage &AU) const override {
       // FIXME: When we can selectively preserve passes, preserve the domtree.
+      AU.addRequired<DominatorTreeWrapperPass>();
       AU.addRequired<ProfileSummaryInfoWrapperPass>();
       AU.addRequired<TargetLibraryInfoWrapperPass>();
       AU.addRequired<TargetTransformInfoWrapperPass>();
       AU.addRequired<LoopInfoWrapperPass>();
     }
 
   private:
     bool eliminateFallThrough(Function &F);
if (auto *TPC = getAnalysisIfAvailable<TargetPassConfig>()) {
     TM = &TPC->getTM<TargetMachine>();
     SubtargetInfo = TM->getSubtargetImpl(F);
     TLI = SubtargetInfo->getTargetLowering();
     TRI = SubtargetInfo->getRegisterInfo();
   }
   TLInfo = &getAnalysis<TargetLibraryInfoWrapperPass>().getTLI();
   TTI = &getAnalysis<TargetTransformInfoWrapperPass>().getTTI(F);
   LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
+  DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
+
   OptSize = F.optForSize();
 
   if (ProfileGuidedSectionPrefix) {
     ProfileSummaryInfo *PSI =
         getAnalysis<ProfileSummaryInfoWrapperPass>().getPSI();
     if (PSI->isFunctionHotInCallGraph(&F))
       F.setSectionPrefix(".hot");
     else if (PSI->isFunctionColdInCallGraph(&F))
bool CodeGenPrepare::isMergingEmptyBlockProfitable(BasicBlock *BB,
   // Note that if there are multiple empty blocks sharing the same incoming
   // value for the PHIs in the DestBB, we consider them together. In such
   // case, Cost(merging BB) will be the sum of their frequencies.
 
   if (!isa<PHINode>(DestBB->begin()))
     return true;
 
   SmallPtrSet<BasicBlock *, 16> SameIncomingValueBBs;
+  SmallVector<PHINode *, 16> PNs;
+
+  for (auto DestBBI = DestBB->begin();
+       auto *DestPN = dyn_cast<PHINode>(&*DestBBI); ++DestBBI)
+    PNs.push_back(DestPN);
 
   // Find all other incoming blocks from which incoming values of all PHIs in
   // DestBB are the same as the ones from BB.
   for (pred_iterator PI = pred_begin(DestBB), E = pred_end(DestBB); PI != E;
        ++PI) {
     BasicBlock *DestBBPred = *PI;
     if (DestBBPred == BB)
       continue;
 
-    bool HasAllSameValue = true;
-    BasicBlock::const_iterator DestBBI = DestBB->begin();
-    while (const PHINode *DestPN = dyn_cast<PHINode>(DestBBI++)) {
-      if (DestPN->getIncomingValueForBlock(BB) !=
-          DestPN->getIncomingValueForBlock(DestBBPred)) {
-        HasAllSameValue = false;
-        break;
-      }
-    }
-    if (HasAllSameValue)
+    if (llvm::all_of(PNs, [&](PHINode *PN) {
+      return (PN->getIncomingValueForBlock(BB) ==
+              PN->getIncomingValueForBlock(DestBBPred));
+        }))
       SameIncomingValueBBs.insert(DestBBPred);
   }
 
   // See if all BB's incoming values are same as the value from Pred. In this
   // case, no reason to skip merging because COPYs are expected to be place in
   // Pred already.
   if (SameIncomingValueBBs.count(Pred))
     return true;
 
+  // Check to see if none of the phis have constant incoming values for BB and
+  // Pred dominates DestBB, in such case extra COPYs are likely not added, so
+  // there is no reason to skip merging.
+  if (DT->dominates(Pred, DestBB) && llvm::none_of(PNs, [BB](PHINode *PN) {
+        return isa<Constant>(PN->getIncomingValueForBlock(BB));
+      }))
+    return true;
+
   if (!BFI) {
     Function &F = *BB->getParent();
     LoopInfo LI{DominatorTree(F)};
     BPI.reset(new BranchProbabilityInfo(F, LI));
     BFI.reset(new BlockFrequencyInfo(F, *BPI, LI));
   }
 
   BlockFrequency PredFreq = BFI->getBlockFreq(Pred);
void CodeGenPrepare::eliminateMostlyEmptyBlock(BasicBlock *BB) {
 
   // If the destination block has a single pred, then this is a trivial edge,
   // just collapse it.
   if (BasicBlock *SinglePred = DestBB->getSinglePredecessor()) {
     if (SinglePred != DestBB) {
       // Remember if SinglePred was the entry block of the function.  If so, we
       // will need to move BB back to the entry position.
       bool isEntry = SinglePred == &SinglePred->getParent()->getEntryBlock();
-      MergeBasicBlockIntoOnlyPred(DestBB, nullptr);
+      MergeBasicBlockIntoOnlyPred(DestBB, DT);
 
       if (isEntry && BB != &BB->getParent()->getEntryBlock())
         BB->moveBefore(&BB->getParent()->getEntryBlock());
 
       DEBUG(dbgs() << "AFTER:\n" << *DestBB << "\n\n\n");
       return;
     }
   }
if (InValPhi && InValPhi->getParent() == BB) {
         for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
           PN->addIncoming(InVal, *PI);
       }
     }
   }
 
   // The PHIs are now updated, change everything that refers to BB to use
   // DestBB and remove BB.
+  SmallVector<DominatorTree::UpdateType, 3> Updates;
+  for (auto *PredBB : predecessors(BB)) {
+    if (PredBB == BB)
+      continue;
+    DominatorTree::UpdateType UT = {DominatorTree::Delete, PredBB, BB};
+    if (!is_contained(Updates, UT)) {
+      Updates.push_back(UT);
+      if (PredBB != DestBB)
+        Updates.push_back({DominatorTree::Insert, PredBB, DestBB});
+    }
+  }
   BB->replaceAllUsesWith(DestBB);
+  DT->applyUpdates(Updates);
+  BB->getTerminator()->eraseFromParent();
+  DT->deleteEdge(BB, DestBB);
   BB->eraseFromParent();
   ++NumBlocksElim;
 
   DEBUG(dbgs() << "AFTER:\n" << *DestBB << "\n\n\n");
 }
 
 // Computes a map of base pointer relocation instructions to corresponding
 // derived pointer relocation instructions given a vector of all relocate calls

llvm/trunk/test/Transforms/CodeGenPrepare/skip-merging-case-block.ll

 declare void @callcase3(...) local_unnamed_addr
 declare void @callcase4(...) local_unnamed_addr
 declare void @calldefault(...) local_unnamed_addr
 
 !0 = !{!"branch_weights", i32 5, i32 1, i32 1,i32 5, i32 5}
 !1 = !{!"branch_weights", i32 1 , i32 5, i32 1,i32 1, i32 1}
 !2 = !{!"branch_weights", i32 1 , i32 4, i32 1,i32 1, i32 1}
 
+; while.cond does not dominate return, expect to skip merging empty block
+; return.loopexit into return.
+@b = external global i32, align 4
+@a = external global i32*, align 8
+
+define void @f_switch4(i32 %i) local_unnamed_addr personality i8* bitcast (i32 (...)* @__gxx_personality_v0 to i8*) {
+; CHECK-LABEL: @f_switch4
+entry:
+  %0 = load i32, i32* @b, align 4
+  %cond = icmp eq i32 %0, 6
+  br i1 %cond, label %return, label %if.end
+
+if.end:                                           ; preds = %entry
+  %add = add i32 %i, 2
+  %1 = load i32*, i32** @a, align 8
+  %magicptr = ptrtoint i32* %1 to i32
+  br label %while.cond
+
+; CHECK-LABEL: while.cond:
+; CHECK: i32 0, label %return.loopexit
+; CHECK: i32 47, label %return.loopexit
+while.cond:                                       ; preds = %while.cond.backedge, %if.end
+  switch i32 %magicptr, label %while.cond.if.end10_crit_edge [
+    i32 0, label %return.loopexit
+    i32 47, label %return.loopexit
+  ]
+
+while.cond.if.end10_crit_edge:                    ; preds = %while.cond
+  br label %while.cond.backedge
+
+while.cond.backedge:                              ; preds = %while.cond.if.end10_crit_edge, %if.then9
+  br label %while.cond
+
+return.loopexit:                                  ; preds = %while.cond
+  br label %return
+
+; CHECK_LABEL: return:
+; CHECK: %{{.*}} = phi i32 [ 0, %entry ], [ %add, %return.loopexit ]
+return:                                           ; preds = %return.loopexit, %entry
+  %retval.4 = phi i32 [ 0, %entry ], [ %add, %return.loopexit ]
+  ret void
+}
+declare i32 @__gxx_personality_v0(...)
+
+; Expect to merge empty block while.cond2.loopexit into while.cond2
+define i32 @f_switch5(i32 %i) local_unnamed_addr {
+; CHECK-LABEL: @f_switch5
+entry:
+  %0 = load i32, i32* @b, align 4
+  %cond = icmp eq i32 %0, 6
+  br i1 %cond, label %while.cond.preheader, label %sw.epilog
+
+while.cond.preheader:                             ; preds = %entry
+  %1 = load i32*, i32** @a, align 8
+  %magicptr = ptrtoint i32* %1 to i64
+  %arrayidx = getelementptr inbounds i32, i32* %1, i64 1
+  br label %while.cond
+
+; CHECK-LABEL: while.cond:
+; CHECK: i64 32, label %while.cond2
+; CHECK: i64 0, label %while.cond2
+while.cond:                                       ; preds = %land.rhs, %while.cond.preheader
+  switch i64 %magicptr, label %land.rhs [
+    i64 32, label %while.cond2.loopexit
+    i64 0, label %while.cond2.loopexit
+  ]
+
+land.rhs:                                         ; preds = %while.cond
+  %2 = load i32, i32* %arrayidx, align 4
+  %tobool1 = icmp eq i32 %2, 0
+  br i1 %tobool1, label %while.cond2thread-pre-split.loopexit, label %while.cond
+
+while.cond2thread-pre-split.loopexit:             ; preds = %land.rhs
+  br label %while.cond2thread-pre-split
+
+while.cond2thread-pre-split:                      ; preds = %while.body4, %while.cond2thread-pre-split.loopexit
+  %.pr = phi i32* [ %.pr.pre, %while.body4 ], [ %1, %while.cond2thread-pre-split.loopexit ]
+  br label %while.cond2
+
+while.cond2.loopexit:                             ; preds = %while.cond, %while.cond
+  br label %while.cond2
+
+; CHECK-LABEL: while.cond2:
+; CHECK: %{{.*}} = phi i32* [ %.pr.pre, %while.body4 ], [ %1, %land.rhs ], [ %1, %while.cond ], [ %1, %while.cond ]
+while.cond2:                                      ; preds = %while.cond2.loopexit, %while.cond2thread-pre-split
+  %3 = phi i32* [ %.pr, %while.cond2thread-pre-split ], [ %1, %while.cond2.loopexit ]
+  %tobool3 = icmp eq i32* %3, null
+  br i1 %tobool3, label %sw.epilog, label %while.body4
+
+while.body4:                                      ; preds = %while.cond2
+  tail call void bitcast (void (...)* @fn2 to void ()*)()
+  %.pr.pre = load i32*, i32** @a, align 8
+  br label %while.cond2thread-pre-split
+
+sw.epilog:                                        ; preds = %while.cond2, %entry
+  ret i32 undef
+}
+
 
 ; This test that BFI/BPI is created without any assertion in isMergingEmptyBlockProfitable()
 ; in the case where empty blocks are removed before creating BFI/BPI.
-@b = common global i32 0, align 4
-@a = common global i32* null, align 8
 define i32 @should_not_assert(i32 %i) local_unnamed_addr {
 entry:
   %0 = load i32, i32* @b, align 4
   %cond = icmp eq i32 %0, 6
   br i1 %cond, label %while.cond.preheader, label %sw.epilog
 
 while.cond.preheader:                             ; preds = %entry
   %1 = load i32*, i32** @a, align 8