[Utils] Avoid repeated hash lookups (NFC)

[kazutakahirata]

No description provided.

[llvmbot]

@llvm/pr-subscribers-llvm-transforms

Author: Kazu Hirata (kazutakahirata)

Changes

---

Full diff: https://github.com/llvm/llvm-project/pull/130709.diff

1 Files Affected:

• (modified) llvm/lib/Transforms/Utils/LCSSA.cpp (+8-7)

diff --git a/llvm/lib/Transforms/Utils/LCSSA.cpp b/llvm/lib/Transforms/Utils/LCSSA.cpp
index d76a0c2e4ce75..c3c3cdf50a985 100644
--- a/llvm/lib/Transforms/Utils/LCSSA.cpp
+++ b/llvm/lib/Transforms/Utils/LCSSA.cpp
@@ -99,10 +99,10 @@ formLCSSAForInstructionsImpl(SmallVectorImpl<Instruction *> &Worklist,
     BasicBlock *InstBB = I->getParent();
     Loop *L = LI.getLoopFor(InstBB);
     assert(L && "Instruction belongs to a BB that's not part of a loop");
-    if (!LoopExitBlocks.count(L))
-      L->getExitBlocks(LoopExitBlocks[L]);
-    assert(LoopExitBlocks.count(L));
-    const SmallVectorImpl<BasicBlock *> &ExitBlocks = LoopExitBlocks[L];
+    auto [It, Inserted] = LoopExitBlocks.try_emplace(L);
+    if (Inserted)
+      L->getExitBlocks(It->second);
+    const SmallVectorImpl<BasicBlock *> &ExitBlocks = It->second;
 
     if (ExitBlocks.empty())
       continue;
@@ -389,9 +389,10 @@ static bool formLCSSAImpl(Loop &L, const DominatorTree &DT, const LoopInfo *LI,
   }
 #endif
 
-  if (!LoopExitBlocks.count(&L))
-    L.getExitBlocks(LoopExitBlocks[&L]);
-  const SmallVectorImpl<BasicBlock *> &ExitBlocks = LoopExitBlocks[&L];
+  auto [It, Inserted] = LoopExitBlocks.try_emplace(&L);
+  if (Inserted)
+    L.getExitBlocks(It->second);
+  const SmallVectorImpl<BasicBlock *> &ExitBlocks = It->second;
   if (ExitBlocks.empty())
     return false;