diff options
author | Reid Spencer <rspencer@reidspencer.com> | 2007-01-17 02:23:37 +0000 |
---|---|---|
committer | Reid Spencer <rspencer@reidspencer.com> | 2007-01-17 02:23:37 +0000 |
commit | a8a15473707f66c6d2f8ab81cd2198a4be1c7cc3 (patch) | |
tree | ce389ae46bf5bd8d40cd3893c60564ef18da4320 /llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp | |
parent | 2854cb9ab8f166bb9faf9c470ffb48a135248e4f (diff) | |
download | bcm5719-llvm-a8a15473707f66c6d2f8ab81cd2198a4be1c7cc3.tar.gz bcm5719-llvm-a8a15473707f66c6d2f8ab81cd2198a4be1c7cc3.zip |
For PR1094:
Adjust the use of SetVector for changes in SetVector's interface.
Patch by Gordon Henriksen.
llvm-svn: 33280
Diffstat (limited to 'llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp')
-rw-r--r-- | llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp b/llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp index 70643f2f1cc..47066ab76a9 100644 --- a/llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp +++ b/llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp @@ -857,8 +857,8 @@ namespace { // See if one of the nodes about to be removed is actually a better // canonical choice than n1. unsigned orig_n1 = n1; - std::vector<unsigned>::iterator DontRemove = Remove.end(); - for (std::vector<unsigned>::iterator I = Remove.begin()+1 /* skip n2 */, + SetVector<unsigned>::iterator DontRemove = Remove.end(); + for (SetVector<unsigned>::iterator I = Remove.begin()+1 /* skip n2 */, E = Remove.end(); I != E; ++I) { unsigned n = *I; Value *V = IG.node(n)->getValue(); @@ -949,7 +949,7 @@ namespace { // Migrate relationships from removed nodes to N1. Node *N1 = IG.node(n1); - for (std::vector<unsigned>::iterator I = Remove.begin(), E = Remove.end(); + for (SetVector<unsigned>::iterator I = Remove.begin(), E = Remove.end(); I != E; ++I) { unsigned n = *I; Node *N = IG.node(n); @@ -972,7 +972,7 @@ namespace { if (!n2) IG.addEquality(n1, V2, Top); else { - for (std::vector<unsigned>::iterator I = Remove.begin(), + for (SetVector<unsigned>::iterator I = Remove.begin(), E = Remove.end(); I != E; ++I) { IG.addEquality(n1, IG.node(*I)->getValue(), Top); } |