[llvm] abcb66d - [Scalar] Avoid repeated hash lookups (NFC) (#128463)

[via llvm-commits]

Author: Kazu Hirata
Date: 2025-02-23T23:44:00-08:00
New Revision: abcb66d18e3898ee42d3d313b46e18b97639a3cc

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

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

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 a18defa9ff5cb..b775977073dbb 100644
--- a/llvm/lib/Transforms/Scalar/ConstantHoisting.cpp
+++ b/llvm/lib/Transforms/Scalar/ConstantHoisting.cpp
@@ -274,8 +274,7 @@ static void findBestInsertionSet(DominatorTree &DT, BlockFrequencyInfo &BFI,
   InsertPtsMap.reserve(Orders.size() + 1);
   for (BasicBlock *Node : llvm::reverse(Orders)) {
     bool NodeInBBs = BBs.count(Node);
-    auto &InsertPts = InsertPtsMap[Node].first;
-    BlockFrequency &InsertPtsFreq = InsertPtsMap[Node].second;
+    auto &[InsertPts, InsertPtsFreq] = InsertPtsMap[Node];
 
     // Return the optimal insert points in BBs.
     if (Node == Entry) {