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

unused variables

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2022-10-20 09:09:06 -07:00
parent 6292b06c67
commit fc30461828
12 changed files with 21 additions and 16 deletions
Download patch file Download diff file Expand all files Collapse all files

4
src/muz/base/dl_rule_subsumption_index.h
View file

@ -29,7 +29,7 @@ namespace datalog {
typedef obj_hashtable<app> app_set;
ast_manager & m;
context & m_context;
// context & m_context;
rule_ref_vector m_ref_holder;
@ -42,7 +42,7 @@ namespace datalog {
public:
rule_subsumption_index(context & ctx) :
m(ctx.get_manager()),
m_context(ctx),
// m_context(ctx),
m_ref_holder(ctx.get_rule_manager()) {}
~rule_subsumption_index() {

1
src/muz/spacer/spacer_cluster.cpp
View file

@ -381,6 +381,7 @@ void lemma_cluster_finder::cluster(lemma_ref &lemma) {
for (const lemma_ref &l : neighbours) {
SASSERT(cluster->can_contain(l));
bool added = cluster->add_lemma(l, false);
(void)added;
CTRACE("cluster_stats", added,
tout << "Added neighbour lemma\n" << mk_and(l->get_cube()) << "\n";);
}

1
src/muz/spacer/spacer_convex_closure.cpp
View file

@ -261,6 +261,7 @@ bool convex_closure::infer_div_pred(const vector<rational> &data, rational &m,
});
SASSERT(data.size() > 1);
SASSERT(is_sorted(data));
(void)is_sorted;
m = rational(2);

2
src/muz/spacer/spacer_sem_matcher.cpp
View file

@ -84,7 +84,7 @@ bool sem_matcher::operator()(expr * e1, expr * e2, substitution & s, bool &pos)
top = false;
if (n1->get_decl() != n2->get_decl()) {
expr *e1 = nullptr, *e2 = nullptr, *e3 = nullptr, *e4 = nullptr, *e5 = nullptr;
expr *e1 = nullptr, *e2 = nullptr;
rational val1, val2;
// x<=y == !(x>y)

4
src/muz/transforms/dl_mk_slice.cpp
View file

@ -260,7 +260,9 @@ namespace datalog {
rm(ctx.get_rule_manager()),
m_pinned_rules(rm),
m_pinned_exprs(m),
m_unifier(ctx) {}
m_unifier(ctx) {
(void)m_ctx;
}
void insert(rule* orig_rule, rule* slice_rule, unsigned sz, unsigned const* renaming) {
m_rule2slice.insert(orig_rule, slice_rule);