[llvm] ec66c87 - [Scalar] Avoid repeated hash lookups (NFC) (#129468)

[via llvm-commits]

Author: Kazu Hirata
Date: 2025-03-03T01:03:36-08:00
New Revision: ec66c87c3455f2b22e8c8b830e5b1c3e477bd2cf

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

LOG: [Scalar] Avoid repeated hash lookups (NFC) (#129468)

Added: 
    

Modified: 
    llvm/lib/Transforms/Scalar/ConstantHoisting.cpp

Removed: 
    


################################################################################
diff  --git a/llvm/lib/Transforms/Scalar/ConstantHoisting.cpp b/llvm/lib/Transforms/Scalar/ConstantHoisting.cpp
index b775977073dbb..8cc8e713941b1 100644
--- a/llvm/lib/Transforms/Scalar/ConstantHoisting.cpp
+++ b/llvm/lib/Transforms/Scalar/ConstantHoisting.cpp
@@ -290,8 +290,7 @@ static void findBestInsertionSet(DominatorTree &DT, BlockFrequencyInfo &BFI,
     BasicBlock *Parent = DT.getNode(Node)->getIDom()->getBlock();
     // Initially, ParentInsertPts is empty and ParentPtsFreq is 0. Every child
     // will update its parent's ParentInsertPts and ParentPtsFreq.
-    auto &ParentInsertPts = InsertPtsMap[Parent].first;
-    BlockFrequency &ParentPtsFreq = InsertPtsMap[Parent].second;
+    auto &[ParentInsertPts, ParentPtsFreq] = InsertPtsMap[Parent];
     // Choose to insert in Node or in subtree of Node.
     // Don't hoist to EHPad because we may not find a proper place to insert
     // in EHPad.