diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2014-10-21 20:20:22 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2014-10-21 20:20:22 -0700 |
| commit | c49f35835bd90e716ef0377f825562d850524566 (patch) | |
| tree | 409ff76d5868a89b141ccf6d2c2189bc21096138 | |
| parent | 5bd9edb52d9f08e83f4410d7cfaa314230d41229 (diff) | |
| download | abc-c49f35835bd90e716ef0377f825562d850524566.tar.gz abc-c49f35835bd90e716ef0377f825562d850524566.tar.bz2 abc-c49f35835bd90e716ef0377f825562d850524566.zip | |
Compiler problems.
| -rw-r--r-- | src/sat/bsat2/Solver.cpp | 7 |
1 files changed, 4 insertions, 3 deletions
diff --git a/src/sat/bsat2/Solver.cpp b/src/sat/bsat2/Solver.cpp index f868fd9f..451beed8 100644 --- a/src/sat/bsat2/Solver.cpp +++ b/src/sat/bsat2/Solver.cpp @@ -839,8 +839,8 @@ void Solver::toDimacs(FILE* f, const vec<Lit>& assumps) // Cannot use removeClauses here because it is not safe // to deallocate them at this point. Could be improved. - int cnt = 0; - for (int i = 0; i < clauses.size(); i++) + int i, cnt = 0; + for (i = 0; i < clauses.size(); i++) if (!satisfied(ca[clauses[i]])) cnt++; @@ -890,7 +890,8 @@ void Solver::relocAll(ClauseAllocator& to) // All reasons: // - for (int i = 0; i < trail.size(); i++){ + int i; + for (i = 0; i < trail.size(); i++){ Var v = var(trail[i]); if (reason(v) != CRef_Undef && (ca[reason(v)].reloced() || locked(ca[reason(v)]))) |