[llvm] c1211d5 - [IPO] Avoid repeated hash lookups (NFC) (#129419)

[via llvm-commits]

Author: Kazu Hirata
Date: 2025-03-02T01:10:50-08:00
New Revision: c1211d5cc41fe245245a33e8a69389ea618ecec8

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

LOG: [IPO] Avoid repeated hash lookups (NFC) (#129419)

Added: 
    

Modified: 
    llvm/include/llvm/Transforms/IPO/ProfiledCallGraph.h

Removed: 
    


################################################################################
diff  --git a/llvm/include/llvm/Transforms/IPO/ProfiledCallGraph.h b/llvm/include/llvm/Transforms/IPO/ProfiledCallGraph.h
index 3e7cc74fcf23b..9ee92c38ffa23 100644
--- a/llvm/include/llvm/Transforms/IPO/ProfiledCallGraph.h
+++ b/llvm/include/llvm/Transforms/IPO/ProfiledCallGraph.h
@@ -135,14 +135,15 @@ class ProfiledCallGraph {
   ProfiledCallGraphNode *getEntryNode() { return &Root; }
   
   void addProfiledFunction(FunctionId Name) {
-    if (!ProfiledFunctions.count(Name)) {
+    auto [It, Inserted] = ProfiledFunctions.try_emplace(Name);
+    if (Inserted) {
       // Link to synthetic root to make sure every node is reachable
       // from root. This does not affect SCC order.
       // Store the pointer of the node because the map can be rehashed.
       auto &Node =
           ProfiledCallGraphNodeList.emplace_back(ProfiledCallGraphNode(Name));
-      ProfiledFunctions[Name] = &Node;
-      Root.Edges.emplace(&Root, ProfiledFunctions[Name], 0);
+      It->second = &Node;
+      Root.Edges.emplace(&Root, It->second, 0);
     }
   }