summaryrefslogtreecommitdiff
path: root/src/gallium/drivers/nouveau/codegen/nv50_ir.h
diff options
context:
space:
mode:
authorTobias Klausmann <tobias.johannes.klausmann@mni.thm.de>2014-07-08 04:19:13 +0200
committerIlia Mirkin <imirkin@alum.mit.edu>2014-07-08 19:41:00 -0400
commita9b21015f5e3a6a37e53a8b3c755519f7b70479e (patch)
tree8d8534a6853c03d67c08cdcffc4fe20f831a48dc /src/gallium/drivers/nouveau/codegen/nv50_ir.h
parent503391b46f753e1f8c0bc771776a51719d0507e4 (diff)
nv50/ir: use unordered_set instead of list to keep track of var uses
The set of variable uses does not need to be ordered in any way, and removing/adding elements is a fairly common operation in various optimization passes. This shortens runtime of piglit test fp-long-alu to ~22s from ~4h Signed-off-by: Tobias Klausmann <tobias.johannes.klausmann@mni.thm.de> Reviewed-by: Ilia Mirkin <imirkin@alum.mit.edu>
Diffstat (limited to 'src/gallium/drivers/nouveau/codegen/nv50_ir.h')
-rw-r--r--src/gallium/drivers/nouveau/codegen/nv50_ir.h7
1 files changed, 4 insertions, 3 deletions
diff --git a/src/gallium/drivers/nouveau/codegen/nv50_ir.h b/src/gallium/drivers/nouveau/codegen/nv50_ir.h
index 88440309e6b..0ff5e5dc3b2 100644
--- a/src/gallium/drivers/nouveau/codegen/nv50_ir.h
+++ b/src/gallium/drivers/nouveau/codegen/nv50_ir.h
@@ -29,6 +29,7 @@
#include <deque>
#include <list>
#include <vector>
+#include <tr1/unordered_set>
#include "codegen/nv50_ir_util.h"
#include "codegen/nv50_ir_graph.h"
@@ -581,10 +582,10 @@ public:
static inline Value *get(Iterator&);
- std::list<ValueRef *> uses;
+ std::tr1::unordered_set<ValueRef *> uses;
std::list<ValueDef *> defs;
- typedef std::list<ValueRef *>::iterator UseIterator;
- typedef std::list<ValueRef *>::const_iterator UseCIterator;
+ typedef std::tr1::unordered_set<ValueRef *>::iterator UseIterator;
+ typedef std::tr1::unordered_set<ValueRef *>::const_iterator UseCIterator;
typedef std::list<ValueDef *>::iterator DefIterator;
typedef std::list<ValueDef *>::const_iterator DefCIterator;