Index: llvm/lib/CodeGen/CodeGenPrepare.cpp
===================================================================
--- llvm/lib/CodeGen/CodeGenPrepare.cpp
+++ llvm/lib/CodeGen/CodeGenPrepare.cpp
@@ -716,7 +716,84 @@
         Assume->eraseFromParent();
 
         resetIteratorIfInvalidatedWhileCalling(&BB, [&]() {
-          RecursivelyDeleteTriviallyDeadInstructions(Operand, TLInfo, nullptr);
+          auto *OperandInst = dyn_cast<Instruction>(Operand);
+          if (!OperandInst ||
+              !wouldInstructionBeTriviallyDead(OperandInst, TLInfo))
+            return;
+          // Keeps the operands of already marked to remove instructions.
+          // Consists only instructions would be trivial dead if no uses.
+          SmallPtrSet<Instruction *, 4> Candidates;
+          // Instructions marked for removal.
+          SmallPtrSet<Instruction *, 4> ToRemove;
+
+          // For a given instruction, add its operands to Candidate set if
+          // it is an instruction and would be trivially dead if no uses.
+          auto AddToCandidates = [&](Instruction *I) {
+            for (Use &OpU : I->operands()) {
+              if (Value *OpV = OpU.get()) {
+                OpU.set(nullptr);
+                if (auto *I = dyn_cast<Instruction>(OpV))
+                  if (!ToRemove.count(I) &&
+                      wouldInstructionBeTriviallyDead(I, TLInfo))
+                    Candidates.insert(I);
+              }
+            }
+          };
+
+          // For instruction I, find transitive closure of users and if
+          // all of them would be trivially dead or other llvm.assume then
+          // mark then for removal and populate Candidate with new instructions.
+          auto ProcessCandidate = [&](Instruction *I) {
+            // Simple Case. no users.
+            if (I->use_empty()) {
+              ToRemove.insert(I);
+              AddToCandidates(I);
+              return;
+            }
+            // Find a cycle of dead instructions.
+            SmallPtrSet<Instruction *, 4> Visited;
+            SmallVector<Instruction *, 4> Worklist;
+            Visited.insert(I);
+            Worklist.push_back(I);
+            while (!Worklist.empty()) {
+              Instruction *Curr = Worklist.pop_back_val();
+              for (auto *U : Curr->users()) {
+                auto *UI = dyn_cast<Instruction>(U);
+                if (!UI)
+                  return;
+                if (!Visited.insert(UI).second)
+                  continue;
+                if (isa<AssumeInst>(UI) ||
+                    wouldInstructionBeTriviallyDead(UI, TLInfo))
+                  Worklist.push_back(UI);
+                else
+                  return;
+              }
+            }
+            // We found a cycle. Add all walked instructions to remove set.
+            ToRemove.insert(Visited.begin(), Visited.end());
+            for (auto *V : Visited)
+              AddToCandidates(V);
+          };
+
+          if (OperandInst->use_empty()) {
+            ToRemove.insert(OperandInst);
+            AddToCandidates(OperandInst);
+          } else
+            Candidates.insert(OperandInst);
+
+          // Process candidates now.
+          while (!Candidates.empty()) {
+            Instruction *Cand = *Candidates.begin();
+            Candidates.erase(Cand);
+            ProcessCandidate(Cand);
+          }
+          // Now, remove everything we found.
+          for (auto *TR : ToRemove) {
+            assert(TR->use_empty() && "Expected no uses!");
+            salvageDebugInfo(*TR);
+            TR->eraseFromParent();
+          }
         });
       }
     }
Index: llvm/test/Transforms/CodeGenPrepare/X86/delete-assume-dead-code.ll
===================================================================
--- llvm/test/Transforms/CodeGenPrepare/X86/delete-assume-dead-code.ll
+++ llvm/test/Transforms/CodeGenPrepare/X86/delete-assume-dead-code.ll
@@ -32,9 +32,7 @@
 ; CHECK-NEXT:    br label [[HEADER:%.*]]
 ; CHECK:       header:
 ; CHECK-NEXT:    [[IV:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[IV_INC:%.*]], [[HEADER]] ]
-; CHECK-NEXT:    [[IV2:%.*]] = phi i32 [ 0, [[ENTRY]] ], [ [[IV2_INC:%.*]], [[HEADER]] ]
 ; CHECK-NEXT:    [[IV_INC]] = add i32 [[IV]], 1
-; CHECK-NEXT:    [[IV2_INC]] = add i32 [[IV2]], 1
 ; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i32 [[IV]], [[N:%.*]]
 ; CHECK-NEXT:    br i1 [[CMP]], label [[EXIT:%.*]], label [[HEADER]]
 ; CHECK:       exit:
@@ -63,9 +61,7 @@
 ; CHECK-NEXT:    br label [[HEADER:%.*]]
 ; CHECK:       header:
 ; CHECK-NEXT:    [[IV:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[IV_INC:%.*]], [[HEADER]] ]
-; CHECK-NEXT:    [[IV2:%.*]] = phi i32 [ 0, [[ENTRY]] ], [ [[IV2_INC:%.*]], [[HEADER]] ]
 ; CHECK-NEXT:    [[IV_INC]] = add i32 [[IV]], 1
-; CHECK-NEXT:    [[IV2_INC]] = add i32 [[IV2]], 1
 ; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i32 [[IV]], [[N:%.*]]
 ; CHECK-NEXT:    br i1 [[CMP]], label [[EXIT:%.*]], label [[HEADER]]
 ; CHECK:       exit: