mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 17:15:31 +00:00
Code Activity

fix warnings for unused variables

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2016-05-17 13:54:22 -07:00
parent ec565ae7a0
commit 96e157e201
38 changed files with 180 additions and 184 deletions
Download patch file Download diff file Expand all files Collapse all files

4
src/math/euclid/euclidean_solver.cpp
View file

@ -580,8 +580,8 @@ struct euclidean_solver::imp {
void substitute_most_recent_solution(var x) {
SASSERT(!m_solution.empty());
equation & eq = *(m_solution.back());
TRACE("euclidean_solver", tout << "applying solution for x" << x << "\n"; display(tout, eq); tout << "\n";);
TRACE("euclidean_solver", tout << "applying solution for x" << x << "\n";
display(tout, *(m_solution.back())); tout << "\n";);
occs & use_list = m_occs[x];
occs::iterator it = use_list.begin();
occs::iterator end = use_list.end();

7
src/math/polynomial/upolynomial.cpp
View file

@ -2759,6 +2759,7 @@ namespace upolynomial {
bool manager::refine_core(unsigned sz, numeral const * p, int sign_a, mpbq_manager & bqm, mpbq & a, mpbq & b) {
SASSERT(sign_a == eval_sign_at(sz, p, a));
int sign_b = -sign_a;
(void)sign_b;
SASSERT(sign_b == eval_sign_at(sz, p, b));
SASSERT(sign_a == -sign_b);
SASSERT(sign_a != 0 && sign_b != 0);
@ -2810,9 +2811,8 @@ namespace upolynomial {
bool manager::refine(unsigned sz, numeral const * p, mpbq_manager & bqm, mpbq & a, mpbq & b, unsigned prec_k) {
int sign_a = eval_sign_at(sz, p, a);
int sign_b = -sign_a;
SASSERT(eval_sign_at(sz, p, b) == sign_b);
SASSERT(sign_a != 0 && sign_b != 0);
SASSERT(eval_sign_at(sz, p, b) == -sign_a);
SASSERT(sign_a != 0);
return refine_core(sz, p, sign_a, bqm, a, b, prec_k);
}
@ -2928,6 +2928,7 @@ namespace upolynomial {
SASSERT(sign_a == eval_sign_at(sz, p, a));
}
int sign_b = -sign_a;
(void) sign_b;
SASSERT(sign_b == eval_sign_at(sz, p, b));
SASSERT(sign_a != 0 && sign_b != 0);
if (has_zero_roots(sz, p)) {

6
src/math/polynomial/upolynomial_factorization.cpp
View file

@ -371,9 +371,10 @@ void zp_square_free_factor(zp_manager & upm, numeral_vector const & f, zp_factor
bool zp_factor(zp_manager & upm, numeral_vector const & f, zp_factors & factors) {
unsigned p = get_p_from_manager(upm.m());
TRACE("polynomial::factorization", tout << "polynomial::factor("; upm.display(tout, f); tout << ") over Z_" << p << endl;);
TRACE("polynomial::factorization",
unsigned p = get_p_from_manager(upm.m());
tout << "polynomial::factor("; upm.display(tout, f); tout << ") over Z_" << p << endl;);
// get the sq-free parts (all of them will be monic)
zp_factors sq_free_factors(upm);
@ -435,6 +436,7 @@ bool zp_factor_square_free_berlekamp(zp_manager & upm, numeral_vector const & f,
// process the null space vectors (skip first one, it's [1, 0, ..., 0]) while generating the factors
unsigned d = upm.degree(f);
(void)d;
scoped_numeral_vector v_k(zpm);
while (Q_I.next_null_space_vector(v_k)) {

1
src/math/simplex/simplex_def.h
View file

@ -998,6 +998,7 @@ namespace simplex {
template<typename Ext>
bool simplex<Ext>::well_formed_row(row const& r) const {
var_t s = m_row2base[r.id()];
(void)s;
SASSERT(m_vars[s].m_base2row == r.id());
SASSERT(m_vars[s].m_is_base);
// SASSERT(m.is_neg(m_vars[s].m_base_coeff));

13
src/math/simplex/sparse_matrix_def.h
View file

@ -509,12 +509,13 @@ namespace simplex {
dead.insert(i);
continue;
}
SASSERT(!vars.contains(e.m_var));
SASSERT(!m.is_zero(e.m_coeff));
SASSERT(e.m_var != dead_id);
col_entry const& c = m_columns[e.m_var].m_entries[e.m_col_idx];
SASSERT((unsigned)c.m_row_id == row_id);
SASSERT((unsigned)c.m_row_idx == i);
DEBUG_CODE(
SASSERT(!vars.contains(e.m_var));
SASSERT(!m.is_zero(e.m_coeff));
SASSERT(e.m_var != dead_id);
col_entry const& c = m_columns[e.m_var].m_entries[e.m_col_idx];
SASSERT((unsigned)c.m_row_id == row_id);
SASSERT((unsigned)c.m_row_idx == i););
vars.insert(e.m_var);
}
int idx = r.m_first_free_idx;