commit 230e46be77d67296a2f8611b44ebc0cc12fefd28
author Fangrui Song <maskray@google.com> Thu Mar 21 08:47:40 2019 +0000
committer Fangrui Song <maskray@google.com> Thu Mar 21 08:47:40 2019 +0000
tree 8bca91285eb1452f5b0e45fe76391b36017831cd
parent a182adac957632e51c8e1994c971019b672db503

[BasicAA] Use DenseMap::try_emplace after D59151. NFC

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@356651 91177308-0d34-0410-b5e6-96231b3b80d8

lib/Analysis/BasicAliasAnalysis.cpp

diff --git a/lib/Analysis/BasicAliasAnalysis.cpp b/lib/Analysis/BasicAliasAnalysis.cpp
index 532314d..2b10e9e 100644
--- a/lib/Analysis/BasicAliasAnalysis.cpp
+++ b/lib/Analysis/BasicAliasAnalysis.cpp
@@ -1803,7 +1803,7 @@
   if (V1 > V2)
     std::swap(Locs.first, Locs.second);
   std::pair<AliasCacheTy::iterator, bool> Pair =
-      AliasCache.insert(std::make_pair(Locs, MayAlias));
+      AliasCache.try_emplace(Locs, MayAlias);
   if (!Pair.second)
     return Pair.first->second;
 
@@ -1832,7 +1832,7 @@
     AliasResult Result = aliasPHI(PN, V1Size, V1AAInfo,
                                   V2, V2Size, V2AAInfo, O2);
     if (Result != MayAlias) {
-      Pair = AliasCache.insert(std::make_pair(Locs, Result));
+      Pair = AliasCache.try_emplace(Locs, Result);
       assert(!Pair.second && "Entry must have existed");
       return Pair.first->second = Result;
     }
@@ -1848,7 +1848,7 @@
     AliasResult Result =
         aliasSelect(S1, V1Size, V1AAInfo, V2, V2Size, V2AAInfo, O2);
     if (Result != MayAlias) {
-      Pair = AliasCache.insert(std::make_pair(Locs, Result));
+      Pair = AliasCache.try_emplace(Locs, Result);
       assert(!Pair.second && "Entry must have existed");
       return Pair.first->second = Result;
     }
@@ -1860,7 +1860,7 @@
     if (V1Size.isPrecise() && V2Size.isPrecise() &&
         (isObjectSize(O1, V1Size.getValue(), DL, TLI, NullIsValidLocation) ||
          isObjectSize(O2, V2Size.getValue(), DL, TLI, NullIsValidLocation))) {
-      Pair = AliasCache.insert(std::make_pair(Locs, PartialAlias));
+      Pair = AliasCache.try_emplace(Locs, PartialAlias);
       assert(!Pair.second && "Entry must have existed");
       return Pair.first->second = PartialAlias;
     }
@@ -1869,7 +1869,7 @@
   // memory locations. We have already ensured that BasicAA has a MayAlias
   // cache result for these, so any recursion back into BasicAA won't loop.
   AliasResult Result = getBestAAResults().alias(Locs.first, Locs.second);
-  Pair = AliasCache.insert(std::make_pair(Locs, Result));
+  Pair = AliasCache.try_emplace(Locs, Result);
   assert(!Pair.second && "Entry must have existed");
   return Pair.first->second = Result;
 }