From 72aea01b6e32a0fd0c53e25a7e841d80eb4040e2 Mon Sep 17 00:00:00 2001
From: Duncan Sands <baldrick@free.fr>
Date: Tue, 12 Jun 2012 20:26:43 +0000
Subject: Use DenseMap as SmallMap workaround rather than std::map, at
 Chandler's request.

llvm-svn: 158371
---
 llvm/lib/Transforms/Scalar/Reassociate.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'llvm/lib/Transforms/Scalar/Reassociate.cpp')

diff --git a/llvm/lib/Transforms/Scalar/Reassociate.cpp b/llvm/lib/Transforms/Scalar/Reassociate.cpp
index 0eb4c66eb99..8cace5eebdb 100644
--- a/llvm/lib/Transforms/Scalar/Reassociate.cpp
+++ b/llvm/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.
 
-- 
cgit v1.2.3