summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp
diff options
context:
space:
mode:
authorOwen Anderson <resistor@mac.com>2009-06-26 21:39:56 +0000
committerOwen Anderson <resistor@mac.com>2009-06-26 21:39:56 +0000
commit01ad6605c0cf573216ecf5563877a2ef78b8cc78 (patch)
tree9f82bf23fb469c381c15f1015b0fe807940c4c77 /llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp
parent99152f3a2ca32874985484c584ff34e947a32564 (diff)
downloadbcm5719-llvm-01ad6605c0cf573216ecf5563877a2ef78b8cc78.tar.gz
bcm5719-llvm-01ad6605c0cf573216ecf5563877a2ef78b8cc78.zip
Constify this value.
llvm-svn: 74330
Diffstat (limited to 'llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp')
-rw-r--r--llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp5
1 files changed, 2 insertions, 3 deletions
diff --git a/llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp b/llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp
index b9b5688dfdf..a3cb751921d 100644
--- a/llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp
+++ b/llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp
@@ -110,6 +110,8 @@ STATISTIC(NumSimple , "Number of simple replacements");
STATISTIC(NumBlocks , "Number of blocks marked unreachable");
STATISTIC(NumSnuggle , "Number of comparisons snuggled");
+static const ConstantRange empty(1, false);
+
namespace {
class DomTreeDFS {
public:
@@ -939,7 +941,6 @@ namespace {
const_iterator end() const { return RangeList.end(); }
iterator find(DomTreeDFS::Node *Subtree) {
- static ConstantRange empty(1, false);
iterator E = end();
iterator I = std::lower_bound(begin(), E,
std::make_pair(Subtree, empty), swo);
@@ -949,7 +950,6 @@ namespace {
}
const_iterator find(DomTreeDFS::Node *Subtree) const {
- static const ConstantRange empty(1, false);
const_iterator E = end();
const_iterator I = std::lower_bound(begin(), E,
std::make_pair(Subtree, empty), swo);
@@ -962,7 +962,6 @@ namespace {
assert(!CR.isEmptySet() && "Empty ConstantRange.");
assert(!CR.isSingleElement() && "Refusing to store single element.");
- static ConstantRange empty(1, false);
iterator E = end();
iterator I =
std::lower_bound(begin(), E, std::make_pair(Subtree, empty), swo);
OpenPOWER on IntegriCloud