summaryrefslogtreecommitdiffstats
path: root/lib
diff options
context:
space:
mode:
authorOwen Anderson <resistor@mac.com>2008-04-07 17:38:23 +0000
committerOwen Anderson <resistor@mac.com>2008-04-07 17:38:23 +0000
commit412821284f16a683e9b734baf2b6c9b4635857f2 (patch)
treee3f2af37f3b0f3acebe01267c3c4c001d1c2261e /lib
parentf02a8070eb01075993129d32ac264c651be55d62 (diff)
downloadexternal_llvm-412821284f16a683e9b734baf2b6c9b4635857f2.zip
external_llvm-412821284f16a683e9b734baf2b6c9b4635857f2.tar.gz
external_llvm-412821284f16a683e9b734baf2b6c9b4635857f2.tar.bz2
Add operator= implementations to SparseBitVector, allowing it to be used in GVN. This results
in both time and memory savings for GVN. For example, one testcase went from 10.5s to 6s with this patch. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@49345 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib')
-rw-r--r--lib/Transforms/Scalar/GVN.cpp24
1 files changed, 8 insertions, 16 deletions
diff --git a/lib/Transforms/Scalar/GVN.cpp b/lib/Transforms/Scalar/GVN.cpp
index 9a03c21..91f72c4 100644
--- a/lib/Transforms/Scalar/GVN.cpp
+++ b/lib/Transforms/Scalar/GVN.cpp
@@ -22,11 +22,11 @@
#include "llvm/Instructions.h"
#include "llvm/ParameterAttributes.h"
#include "llvm/Value.h"
-#include "llvm/ADT/BitVector.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/DepthFirstIterator.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/SmallVector.h"
+#include "llvm/ADT/SparseBitVector.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/Analysis/Dominators.h"
#include "llvm/Analysis/AliasAnalysis.h"
@@ -590,9 +590,9 @@ namespace {
class VISIBILITY_HIDDEN ValueNumberedSet {
private:
SmallPtrSet<Value*, 8> contents;
- BitVector numbers;
+ SparseBitVector<64> numbers;
public:
- ValueNumberedSet() { numbers.resize(1); }
+ ValueNumberedSet() { }
ValueNumberedSet(const ValueNumberedSet& other) {
numbers = other.numbers;
contents = other.contents;
@@ -610,9 +610,6 @@ class VISIBILITY_HIDDEN ValueNumberedSet {
size_t size() { return contents.size(); }
void set(unsigned i) {
- if (i >= numbers.size())
- numbers.resize(i+1);
-
numbers.set(i);
}
@@ -622,21 +619,12 @@ class VISIBILITY_HIDDEN ValueNumberedSet {
}
void reset(unsigned i) {
- if (i < numbers.size())
- numbers.reset(i);
+ numbers.reset(i);
}
bool test(unsigned i) {
- if (i >= numbers.size())
- return false;
-
return numbers.test(i);
}
-
- void clear() {
- contents.clear();
- numbers.clear();
- }
};
}
@@ -1598,6 +1586,10 @@ bool GVN::processInstruction(Instruction *I, ValueNumberedSet &currAvail,
if (isa<AllocationInst>(I))
return false;
+ // Allocations are always unique, so don't bother value numbering them.
+ if (isa<AllocationInst>(I))
+ return false;
+
if (MemCpyInst* M = dyn_cast<MemCpyInst>(I)) {
MemoryDependenceAnalysis& MD = getAnalysis<MemoryDependenceAnalysis>();