Allow tail duplication in more cases, relaxing the previous restriction a
authorChris Lattner <sabre@nondot.org>
Sun, 10 Sep 2006 18:17:58 +0000 (18:17 +0000)
committerChris Lattner <sabre@nondot.org>
Sun, 10 Sep 2006 18:17:58 +0000 (18:17 +0000)
bit.  This fixes Regression/Transforms/TailDup/MergeTest.ll

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@30237 91177308-0d34-0410-b5e6-96231b3b80d8

lib/Transforms/Scalar/TailDuplication.cpp

index 43aaced37892527164f0787d6f230eb0453e7679..72f28aacd740f2395c5c183c7045c61ee2ff811e 100644 (file)
@@ -144,7 +144,18 @@ bool TailDup::shouldEliminateUnconditionalBranch(TerminatorInst *TI) {
     // if (b)
     //   foo();
     // Cloning the 'if b' block into the end of the first foo block is messy.
-    return false;
+    
+    // The messy case is when the fall-through block falls through to other
+    // blocks.  This is what we would be preventing if we cloned the block.
+    DestI = Dest;
+    if (++DestI != Dest->getParent()->end()) {
+      BasicBlock *DestSucc = DestI;
+      // If any of Dest's successors are fall-throughs, don't do this xform.
+      for (succ_iterator SI = succ_begin(Dest), SE = succ_end(Dest);
+           SI != SE; ++SI)
+        if (*SI == DestSucc)
+          return false;
+    }
   }
 
   return true;