From: Duncan Sands <baldrick@free.fr>
Date: Tue, 12 Jun 2012 20:26:43 +0000 (+0000)
Subject: Use DenseMap as SmallMap workaround rather than std::map, at Chandler's request.
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=5f9e4c1189ab4a8ea1b0000d9337060ac3cac26e;p=oota-llvm.git

Use DenseMap as SmallMap workaround rather than std::map, at Chandler's request.


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

diff --git a/lib/Transforms/Scalar/Reassociate.cpp b/lib/Transforms/Scalar/Reassociate.cpp
index 0eb4c66eb99..8cace5eebdb 100644
--- a/lib/Transforms/Scalar/Reassociate.cpp
+++ b/lib/Transforms/Scalar/Reassociate.cpp
@@ -485,7 +485,7 @@ static bool LinearizeExprTree(BinaryOperator *I,
 
   // Leaves - Keeps track of the set of putative leaves as well as the number of
   // paths to each leaf seen so far.
-  typedef std::map<Value*, APInt> LeafMap;
+  typedef DenseMap<Value*, APInt> LeafMap;
   LeafMap Leaves; // Leaf -> Total weight so far.
   SmallVector<Value*, 8> LeafOrder; // Ensure deterministic leaf output order.