diff --git a/llvm/include/llvm/Analysis/FunctionPropertiesAnalysis.h b/llvm/include/llvm/Analysis/FunctionPropertiesAnalysis.h
index af72f6e0f90b1..ee447d3e4ebb6 100644
--- a/llvm/include/llvm/Analysis/FunctionPropertiesAnalysis.h
+++ b/llvm/include/llvm/Analysis/FunctionPropertiesAnalysis.h
@@ -15,7 +15,6 @@
 #define LLVM_ANALYSIS_FUNCTIONPROPERTIESANALYSIS_H
 
 #include "llvm/ADT/DenseSet.h"
-#include "llvm/IR/Dominators.h"
 #include "llvm/IR/PassManager.h"
 
 namespace llvm {
@@ -187,12 +186,7 @@ class FunctionPropertiesUpdater {
   static bool isUpdateValid(Function &F, const FunctionPropertiesInfo &FPI,
                             FunctionAnalysisManager &FAM);
 
-  DominatorTree &getUpdatedDominatorTree(FunctionAnalysisManager &FAM) const;
-
   DenseSet<const BasicBlock *> Successors;
-
-  // Edges we might potentially need to remove from the dominator tree.
-  SmallVector<DominatorTree::UpdateType, 2> DomTreeUpdates;
 };
 } // namespace llvm
 #endif // LLVM_ANALYSIS_FUNCTIONPROPERTIESANALYSIS_H
diff --git a/llvm/lib/Analysis/FunctionPropertiesAnalysis.cpp b/llvm/lib/Analysis/FunctionPropertiesAnalysis.cpp
index 07906fa1aa6c6..6d6ec6c7b1cc7 100644
--- a/llvm/lib/Analysis/FunctionPropertiesAnalysis.cpp
+++ b/llvm/lib/Analysis/FunctionPropertiesAnalysis.cpp
@@ -326,14 +326,6 @@ FunctionPropertiesUpdater::FunctionPropertiesUpdater(
   // with the CB BB ('Entry') between which the inlined callee will be pasted.
   Successors.insert(succ_begin(&CallSiteBB), succ_end(&CallSiteBB));
 
-  // the outcome of the inlining may be that some edges get lost (DCEd BBs
-  // because inlining brought some constant, for example). We don't know which
-  // edges will be removed, so we list all of them as potentially removable.
-  for (auto *Succ : successors(&CallSiteBB))
-    DomTreeUpdates.emplace_back(DominatorTree::UpdateKind::Delete,
-                                const_cast<BasicBlock *>(&CallSiteBB),
-                                const_cast<BasicBlock *>(Succ));
-
   // Inlining only handles invoke and calls. If this is an invoke, and inlining
   // it pulls another invoke, the original landing pad may get split, so as to
   // share its content with other potential users. So the edge up to which we
@@ -344,11 +336,6 @@ FunctionPropertiesUpdater::FunctionPropertiesUpdater(
   if (const auto *II = dyn_cast<InvokeInst>(&CB)) {
     const auto *UnwindDest = II->getUnwindDest();
     Successors.insert(succ_begin(UnwindDest), succ_end(UnwindDest));
-    // Same idea as above, we pretend we lose all these edges.
-    for (auto *Succ : successors(UnwindDest))
-      DomTreeUpdates.emplace_back(DominatorTree::UpdateKind::Delete,
-                                  const_cast<BasicBlock *>(UnwindDest),
-                                  const_cast<BasicBlock *>(Succ));
   }
 
   // Exclude the CallSiteBB, if it happens to be its own successor (1-BB loop).
@@ -369,30 +356,6 @@ FunctionPropertiesUpdater::FunctionPropertiesUpdater(
     FPI.updateForBB(*BB, -1);
 }
 
-DominatorTree &FunctionPropertiesUpdater::getUpdatedDominatorTree(
-    FunctionAnalysisManager &FAM) const {
-  auto &DT =
-      FAM.getResult<DominatorTreeAnalysis>(const_cast<Function &>(Caller));
-
-  SmallVector<DominatorTree::UpdateType, 2> FinalDomTreeUpdates;
-
-  for (auto &Upd : DomTreeUpdates)
-    FinalDomTreeUpdates.push_back(Upd);
-
-  DenseSet<const BasicBlock *> Inserted;
-  for (auto *Succ : successors(&CallSiteBB))
-    if (Inserted.insert(Succ).second)
-      FinalDomTreeUpdates.push_back({DominatorTree::UpdateKind::Insert,
-                                     const_cast<BasicBlock *>(&CallSiteBB),
-                                     const_cast<BasicBlock *>(Succ)});
-
-  DT.applyUpdates(FinalDomTreeUpdates);
-#ifdef EXPENSIVE_CHECKS
-  assert(DT.verify(DominatorTree::VerificationLevel::Full));
-#endif
-  return DT;
-}
-
 void FunctionPropertiesUpdater::finish(FunctionAnalysisManager &FAM) const {
   // Update feature values from the BBs that were copied from the callee, or
   // might have been modified because of inlining. The latter have been
@@ -420,7 +383,8 @@ void FunctionPropertiesUpdater::finish(FunctionAnalysisManager &FAM) const {
   // remove E.
   SetVector<const BasicBlock *> Reinclude;
   SetVector<const BasicBlock *> Unreachable;
-  auto &DT = getUpdatedDominatorTree(FAM);
+  const auto &DT =
+      FAM.getResult<DominatorTreeAnalysis>(const_cast<Function &>(Caller));
 
   if (&CallSiteBB != &*Caller.begin())
     Reinclude.insert(&*Caller.begin());
@@ -463,9 +427,6 @@ void FunctionPropertiesUpdater::finish(FunctionAnalysisManager &FAM) const {
 
   const auto &LI = FAM.getResult<LoopAnalysis>(const_cast<Function &>(Caller));
   FPI.updateAggregateStats(Caller, LI);
-#ifdef EXPENSIVE_CHECKS
-  assert(isUpdateValid(Caller, FPI, FAM));
-#endif
 }
 
 bool FunctionPropertiesUpdater::isUpdateValid(Function &F,
diff --git a/llvm/lib/Analysis/MLInlineAdvisor.cpp b/llvm/lib/Analysis/MLInlineAdvisor.cpp
index 8bb5efcf1b2ec..b59aa4810005b 100644
--- a/llvm/lib/Analysis/MLInlineAdvisor.cpp
+++ b/llvm/lib/Analysis/MLInlineAdvisor.cpp
@@ -288,6 +288,7 @@ void MLInlineAdvisor::onSuccessfulInlining(const MLInlineAdvice &Advice,
   {
     PreservedAnalyses PA = PreservedAnalyses::all();
     PA.abandon<FunctionPropertiesAnalysis>();
+    PA.abandon<DominatorTreeAnalysis>();
     PA.abandon<LoopAnalysis>();
     FAM.invalidate(*Caller, PA);
   }