[llvm-commits] CVS: llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp

[Reid Spencer]

Changes in directory llvm/lib/Transforms/Scalar:

PredicateSimplifier.cpp updated: 1.48 -> 1.49
---
Log message:

For PR1094: http://llvm.org/PR1094 :
Adjust the use of SetVector for changes in SetVector's interface.
Patch by Gordon Henriksen.


---
Diffs of the changes:  (+4 -4)

 PredicateSimplifier.cpp |    8 ++++----
 1 files changed, 4 insertions(+), 4 deletions(-)


Index: llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp
diff -u llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp:1.48 llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp:1.49
--- llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp:1.48	Mon Jan 15 08:30:07 2007
+++ llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp	Tue Jan 16 20:23:37 2007
@@ -857,8 +857,8 @@
         // 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 @@
 
       // 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 @@
       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);
         }