mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 09:05: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

1
src/muz/pdr/pdr_farkas_learner.cpp
View file

@ -923,6 +923,7 @@ namespace pdr {
if (p->get_decl_kind() == PR_ASSERTED &&
bs.contains(m.get_fact(p))) {
expr* fact = m.get_fact(p);
(void)p0;
TRACE("farkas_learner",
tout << mk_ll_pp(p0,m) << "\n";
tout << "Add: " << mk_pp(p,m) << "\n";);

3
src/muz/rel/dl_external_relation.cpp
View file

@ -338,9 +338,8 @@ namespace datalog {
: m_plugin(p),
m_condition(condition, p.get_ast_manager()),
m_filter_fn(p.get_ast_manager()) {
ast_manager& m = p.get_ast_manager();
p.mk_filter_fn(relation_sort, condition, m_filter_fn);
SASSERT(m.is_bool(condition));
SASSERT(p.get_ast_manager().is_bool(condition));
}
virtual void operator()(relation_base & r) {

9
src/muz/rel/dl_finite_product_relation.cpp
View file

@ -1566,13 +1566,12 @@ namespace datalog {
return;
}
finite_product_relation_plugin & plugin = r.get_plugin();
if(!m_neg_intersection_join) {
}
scoped_rel<finite_product_relation> intersection = get((*m_neg_intersection_join)(r, neg));
SASSERT(&intersection->get_plugin()==&plugin); //the result of join is also finite product
SASSERT(r.get_signature()==intersection->get_signature());
DEBUG_CODE(
finite_product_relation_plugin & plugin = r.get_plugin();
SASSERT(&intersection->get_plugin()==&plugin); //the result of join is also finite product
SASSERT(r.get_signature()==intersection->get_signature()););
table_base & r_table = r.get_table();
table_plugin & tplugin = r_table.get_plugin();
relation_manager & rmgr = r.get_manager();

3
src/muz/rel/udoc_relation.cpp
View file

@ -404,7 +404,7 @@ namespace datalog {
rename_fn(udoc_relation const& t, unsigned cycle_len, const unsigned * cycle)
: convenient_relation_rename_fn(t.get_signature(), cycle_len, cycle) {
udoc_plugin& p = t.get_plugin();
ast_manager& m = p.get_ast_manager();
relation_signature const& sig1 = t.get_signature();
relation_signature const& sig2 = get_result_signature();
unsigned_vector permutation0, column_info;
@ -429,6 +429,7 @@ namespace datalog {
SASSERT(column == t.get_num_bits());
TRACE("doc",
ast_manager& m = p.get_ast_manager();
sig1.output(m, tout << "sig1: "); tout << "\n";
sig2.output(m, tout << "sig2: "); tout << "\n";
tout << "permute: ";

3
src/muz/transforms/dl_mk_bit_blast.cpp
View file

@ -70,13 +70,12 @@ namespace datalog {
func_interp* f = model->get_func_interp(p);
if (!f) continue;
expr_ref body(m);
unsigned arity_p = p->get_arity();
unsigned arity_q = q->get_arity();
TRACE("dl",
model_v2_pp(tout, *model);
tout << mk_pp(p, m) << "\n";
tout << mk_pp(q, m) << "\n";);
SASSERT(0 < arity_p);
SASSERT(0 < p->get_arity());
SASSERT(f);
model->register_decl(p, f->copy());
func_interp* g = alloc(func_interp, m, arity_q);

3
src/muz/transforms/dl_mk_quantifier_abstraction.cpp
View file

@ -71,9 +71,8 @@ namespace datalog {
svector<bool> const& is_bound = m_bound[i];
func_interp* f = old_model->get_func_interp(p);
expr_ref body(m);
unsigned arity_p = p->get_arity();
unsigned arity_q = q->get_arity();
SASSERT(0 < arity_p);
SASSERT(0 < p->get_arity());
func_interp* g = alloc(func_interp, m, arity_q);
if (f) {