mirror of
https://github.com/Z3Prover/z3
synced 2025-08-05 02:40:24 +00:00
reduce set of mainly verbose warnings raised by -Wmaybe-uninitialized and unused variable warnings from release mode builds
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
fa6f9b4a37
commit
5b497b6249
44 changed files with 68 additions and 70 deletions
|
@ -993,7 +993,7 @@ class fm_tactic : public tactic {
|
|||
sbuffer<var> xs;
|
||||
buffer<rational> as;
|
||||
rational c;
|
||||
bool strict;
|
||||
bool strict = false;
|
||||
unsigned num;
|
||||
expr * const * args;
|
||||
if (m.is_or(f)) {
|
||||
|
|
|
@ -147,11 +147,10 @@ class elim_small_bv_tactic : public tactic {
|
|||
expr_ref body(old_body, m);
|
||||
for (unsigned i = num_decls-1; i != ((unsigned)-1) && !max_steps_exceeded(num_steps); i--) {
|
||||
sort * s = q->get_decl_sort(i);
|
||||
symbol const & name = q->get_decl_name(i);
|
||||
unsigned bv_sz = m_util.get_bv_size(s);
|
||||
|
||||
if (is_small_bv(s) && !max_steps_exceeded(num_steps)) {
|
||||
TRACE("elim_small_bv", tout << "eliminating " << name <<
|
||||
TRACE("elim_small_bv", tout << "eliminating " << q->get_decl_name(i) <<
|
||||
"; sort = " << mk_ismt2_pp(s, m) <<
|
||||
"; body = " << mk_ismt2_pp(body, m) << std::endl;);
|
||||
|
||||
|
|
|
@ -176,7 +176,7 @@ private:
|
|||
app_map coloring;
|
||||
app_map depth;
|
||||
inv_app_map inv_color;
|
||||
unsigned num_occs;
|
||||
unsigned num_occs = 0;
|
||||
compute_sort_colors(fml, coloring);
|
||||
compute_max_depth(fml, depth);
|
||||
merge_colors(occs, coloring);
|
||||
|
@ -233,7 +233,7 @@ private:
|
|||
typedef map<u_pair, unsigned, u_pair::hash, u_pair::eq> pair_map;
|
||||
bool merge_colors(app_map const& colors1, app_map& colors2) {
|
||||
pair_map recolor;
|
||||
unsigned num_colors = 0, v1, v2, w, old_max = 0;
|
||||
unsigned num_colors = 0, v1 = 0, v2 = 0, w = 0, old_max = 0;
|
||||
app_map::iterator it = colors2.begin(), end = colors2.end();
|
||||
for (; it != end; ++it) {
|
||||
app* a = it->m_key;
|
||||
|
@ -545,7 +545,7 @@ private:
|
|||
term_set& cts, term_set const& consts, app_map const& occs) {
|
||||
SASSERT(!T.empty());
|
||||
app* t = T[0];
|
||||
unsigned weight, weight1;
|
||||
unsigned weight = 0, weight1 = 0;
|
||||
VERIFY(occs.find(t, weight));
|
||||
unsigned cts_delta = compute_cts_delta(t, cts, consts);
|
||||
TRACE("symmetry_reduce", tout << mk_pp(t, m()) << " " << weight << " " << cts_delta << "\n";);
|
||||
|
@ -559,9 +559,9 @@ private:
|
|||
TRACE("symmetry_reduce", tout << mk_pp(t1, m()) << " " << weight1 << " " << cts_delta1 << "\n";);
|
||||
if ((t->get_num_args() == t1->get_num_args() && (weight1 > weight || cts_delta1 < cts_delta)) ||
|
||||
t->get_num_args() > t1->get_num_args()) {
|
||||
cts_delta = cts_delta1;
|
||||
weight = weight1;
|
||||
t = t1;
|
||||
cts_delta = cts_delta1;
|
||||
weight = weight1;
|
||||
t = t1;
|
||||
}
|
||||
}
|
||||
return t;
|
||||
|
|
|
@ -154,8 +154,7 @@ public:
|
|||
|
||||
void mk_interface_bool(func_decl * f, unsigned num, expr* const* args, expr_ref& result, proof_ref& pr) {
|
||||
expr_ref old_pred(m.mk_app(f, num, args), m);
|
||||
polarity_t pol;
|
||||
VERIFY(m_polarities.find(old_pred, pol));
|
||||
polarity_t pol = m_polarities.find(old_pred);
|
||||
result = m.mk_fresh_const(0, m.mk_bool_sort());
|
||||
m_polarities.insert(result, pol);
|
||||
m_new_preds.push_back(to_app(result));
|
||||
|
|
|
@ -48,7 +48,7 @@ tactic * or_else(tactic * t1, tactic * t2, tactic * t3, tactic * t4, tactic * t5
|
|||
tactic * repeat(tactic * t, unsigned max = UINT_MAX);
|
||||
/**
|
||||
\brief Fails if \c t produeces more than \c threshold subgoals.
|
||||
Otherwise, it behabes like \c t.
|
||||
Otherwise, it behaves like \c t.
|
||||
*/
|
||||
tactic * fail_if_branching(tactic * t, unsigned threshold = 1);
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue