Actually use reduced set of checkers in EvalAssume.

git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@110904 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/Checker/GRExprEngine.cpp b/lib/Checker/GRExprEngine.cpp
index 71bdbb38f040385d4e6805f264340aaa82103a53..1f6c266e3a3aead68d2826fbe03988ad4b055b76 100644 (file)
--- a/lib/Checker/GRExprEngine.cpp
+++ b/lib/Checker/GRExprEngine.cpp
@@ -527,8 +527,7 @@ const GRState *GRExprEngine::ProcessAssume(const GRState *state, SVal cond,
   if (!CO->empty()) {
     // Let the checkers have a crack at the assume before the transfer functions
     // get their turn.
-    for (CheckersOrdered::iterator I = Checkers.begin(), E = Checkers.end();
-          I != E; ++I) {
+    for (CheckersOrdered::iterator I = CO->begin(), E = CO->end(); I!=E; ++I) {
 
       // If any checker declares the state infeasible (or if it starts that
       // way), bail out.