[llvm] 8e85b77 - [Analysis] Avoid repeated hash lookups (NFC) (#123446)

[via llvm-commits]

Author: Kazu Hirata
Date: 2025-01-18T10:32:14-08:00
New Revision: 8e85b77f6a73477ab094acf0dccce61590a29222

URL: https://github.com/llvm/llvm-project/commit/8e85b77f6a73477ab094acf0dccce61590a29222
DIFF: https://github.com/llvm/llvm-project/commit/8e85b77f6a73477ab094acf0dccce61590a29222.diff

LOG: [Analysis] Avoid repeated hash lookups (NFC) (#123446)

Co-authored-by: Nikita Popov <github at npopov.com>

Added: 
    

Modified: 
    llvm/lib/Analysis/InlineCost.cpp

Removed: 
    


################################################################################
diff  --git a/llvm/lib/Analysis/InlineCost.cpp b/llvm/lib/Analysis/InlineCost.cpp
index 85287a39f2caad..8fa150f7d690e7 100644
--- a/llvm/lib/Analysis/InlineCost.cpp
+++ b/llvm/lib/Analysis/InlineCost.cpp
@@ -2698,8 +2698,10 @@ void CallAnalyzer::findDeadBlocks(BasicBlock *CurrBB, BasicBlock *NextBB) {
   auto IsEdgeDead = [&](BasicBlock *Pred, BasicBlock *Succ) {
     // A CFG edge is dead if the predecessor is dead or the predecessor has a
     // known successor which is not the one under exam.
-    return (DeadBlocks.count(Pred) ||
-            (KnownSuccessors[Pred] && KnownSuccessors[Pred] != Succ));
+    if (DeadBlocks.count(Pred))
+      return true;
+    BasicBlock *KnownSucc = KnownSuccessors[Pred];
+    return KnownSucc && KnownSucc != Succ;
   };
 
   auto IsNewlyDead = [&](BasicBlock *BB) {