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

remove default destructors & some default constructors

Browse source 
Another ~700 KB reduction in binary size
This commit is contained in:
Nuno Lopes 2024-09-04 22:30:23 +01:00
parent 0837e3b8e8
commit 8061765574
66 changed files with 22 additions and 131 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/muz/base/rule_properties.cpp
View file

@ -31,8 +31,6 @@ rule_properties::rule_properties(ast_manager & m, rule_manager& rm, context& ctx
m_dt(m), m_dl(m), m_a(m), m_bv(m), m_ar(m), m_rec(m),
m_generate_proof(false), m_collected(false), m_is_monotone(true) {}
rule_properties::~rule_properties() {}
void rule_properties::collect(rule_set const& rules) {
reset();
m_collected = true;

1
src/muz/base/rule_properties.h
View file

@ -58,7 +58,6 @@ namespace datalog {
bool check_accessor(app* n);
public:
rule_properties(ast_manager & m, rule_manager& rm, context& ctx, i_expr_pred& is_predicate);
~rule_properties();
void set_generate_proof(bool generate_proof) { m_generate_proof = generate_proof; }
void collect(rule_set const& r);
void check_quantifier_free();

2
src/muz/bmc/dl_bmc_engine.cpp
View file

@ -1443,8 +1443,6 @@ namespace datalog {
m_rule_trace(ctx.get_rule_manager()) {
}
bmc::~bmc() {}
lbool bmc::query(expr* query) {
m_solver = nullptr;
m_answer = nullptr;

2
src/muz/bmc/dl_bmc_engine.h
View file

@ -51,8 +51,6 @@ namespace datalog {
public:
bmc(context& ctx);
~bmc() override;
lbool query(expr* query) override;
void display_certificate(std::ostream& out) const override;

2
src/muz/clp/clp_context.cpp
View file

@ -59,8 +59,6 @@ namespace datalog {
m_fparams.m_mbqi = false;
}
~imp() {}
lbool query(expr* query) {
m_ctx.ensure_opened();
m_solver.reset();

6
src/muz/ddnf/ddnf.cpp
View file

@ -78,8 +78,6 @@ namespace datalog {
m_descendants(DEFAULT_HASHTABLE_INITIAL_CAPACITY, m_hash, m_eq) {
}
~ddnf_node() {}
unsigned inc_ref() {
return ++m_refs;
}
@ -429,8 +427,6 @@ namespace datalog {
class ddnfs {
u_map<ddnf_mgr*> m_mgrs;
public:
ddnfs() {}
~ddnfs() {
u_map<ddnf_mgr*>::iterator it = m_mgrs.begin(), end = m_mgrs.end();
for (; it != end; ++it) {
@ -503,8 +499,6 @@ namespace datalog {
m_inner_ctx.updt_params(params);
}
~imp() {}
lbool query(expr* query) {
m_ctx.ensure_opened();
rule_set& old_rules = m_ctx.get_rules();

1
src/muz/spacer/spacer_expand_bnd_generalizer.h
View file

@ -43,7 +43,6 @@ class lemma_expand_bnd_generalizer : public lemma_generalizer {
public:
lemma_expand_bnd_generalizer(context &ctx);
~lemma_expand_bnd_generalizer() override {}
void operator()(lemma_ref &lemma) override;

1
src/muz/spacer/spacer_global_generalizer.h
View file

@ -161,7 +161,6 @@ class lemma_global_generalizer : public lemma_generalizer {
public:
lemma_global_generalizer(context &ctx);
~lemma_global_generalizer() override {}
void operator()(lemma_ref &lemma) override;

2
src/muz/tab/tab_context.cpp
View file

@ -1354,8 +1354,6 @@ namespace datalog {
m_fparams.m_mbqi = false;
}
~imp() {}
lbool query(expr* query) {
m_ctx.ensure_opened();
m_index.reset();

1
src/muz/transforms/dl_mk_array_eq_rewrite.h
View file

@ -40,7 +40,6 @@ namespace datalog {
public:
mk_array_eq_rewrite(context & ctx, unsigned priority);
rule_set * operator()(rule_set const & source) override;
~mk_array_eq_rewrite() override{}
};

1
src/muz/transforms/dl_mk_array_instantiation.h
View file

@ -112,7 +112,6 @@ namespace datalog {
public:
mk_array_instantiation(context & ctx, unsigned priority);
rule_set * operator()(rule_set const & source) override;
~mk_array_instantiation() override{}
};

2
src/muz/transforms/dl_mk_backwards.cpp
View file

@ -27,8 +27,6 @@ namespace datalog {
m(ctx.get_manager()),
m_ctx(ctx) {
}
mk_backwards::~mk_backwards() { }
rule_set * mk_backwards::operator()(rule_set const & source) {
context& ctx = source.get_context();

1
src/muz/transforms/dl_mk_backwards.h
View file

@ -27,7 +27,6 @@ namespace datalog {
context& m_ctx;
public:
mk_backwards(context & ctx, unsigned priority = 33000);
~mk_backwards() override;
rule_set * operator()(rule_set const & source) override;
};

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

@ -146,8 +146,6 @@ namespace datalog {
m_dst(nullptr)
{}
~expand_mkbv_cfg() {}
void set_src(rule_set const* src) { m_src = src; }
void set_dst(rule_set* dst) { m_dst = dst; }
func_decl_ref_vector const& old_funcs() const { return m_old_funcs; }

2
src/muz/transforms/dl_mk_elim_term_ite.cpp
View file

@ -80,8 +80,6 @@ namespace datalog {
rm(ctx.get_rule_manager()),
m_ground(m) {}
mk_elim_term_ite::~mk_elim_term_ite() {}
/**
\brief map free variables in e to ground, fresh, constants
m_ground is reset on every new rule so it is safe to assume

1
src/muz/transforms/dl_mk_elim_term_ite.h
View file

@ -35,7 +35,6 @@ namespace datalog {
expr_ref ground(expr* e);
public:
mk_elim_term_ite(context &ctx, unsigned priority);
~mk_elim_term_ite() override;
rule_set * operator()(const rule_set &source) override;
};
}

2
src/muz/transforms/dl_mk_karr_invariants.cpp
View file

@ -58,8 +58,6 @@ namespace datalog {
m_inner_ctx.updt_params(params);
}
mk_karr_invariants::~mk_karr_invariants() { }
void matrix::display_row(
std::ostream& out, vector<rational> const& row, rational const& b, bool is_eq) {
for (unsigned j = 0; j < row.size(); ++j) {

2
src/muz/transforms/dl_mk_karr_invariants.h
View file

@ -62,8 +62,6 @@ namespace datalog {
rule_set* update_rules(rule_set const& src);
public:
mk_karr_invariants(context & ctx, unsigned priority);
~mk_karr_invariants() override;
rule_set * operator()(rule_set const & source) override;

2
src/muz/transforms/dl_mk_loop_counter.cpp
View file

@ -30,8 +30,6 @@ namespace datalog {
m_refs(m) {
}
mk_loop_counter::~mk_loop_counter() { }
app_ref mk_loop_counter::add_arg(rule_set const& src, rule_set& dst, app* fn, unsigned idx) {
expr_ref_vector args(m);
func_decl* new_fn, *old_fn = fn->get_decl();

1
src/muz/transforms/dl_mk_loop_counter.h
View file

@ -35,7 +35,6 @@ namespace datalog {
app_ref del_arg(app* fn);
public:
mk_loop_counter(context & ctx, unsigned priority = 33000);
~mk_loop_counter() override;
rule_set * operator()(rule_set const & source) override;

2
src/muz/transforms/dl_mk_magic_symbolic.cpp
View file

@ -63,8 +63,6 @@ namespace datalog {
m(ctx.get_manager()),
m_ctx(ctx) {
}
mk_magic_symbolic::~mk_magic_symbolic() { }
rule_set * mk_magic_symbolic::operator()(rule_set const & source) {
if (!m_ctx.magic()) {

1
src/muz/transforms/dl_mk_magic_symbolic.h
View file

@ -29,7 +29,6 @@ namespace datalog {
app_ref mk_query(app* q);
public:
mk_magic_symbolic(context & ctx, unsigned priority = 33037);
~mk_magic_symbolic() override;
rule_set * operator()(rule_set const & source) override;
};