forked from OSchip/llvm-project
Actually use reduced set of checkers in EvalAssume.
llvm-svn: 110904
This commit is contained in:
parent
e9e91b0597
commit
2f7ee3ca40
|
@ -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.
|
||||
|
|
Loading…
Reference in New Issue