mirror of
https://github.com/Z3Prover/z3
synced 2025-08-06 11:20:26 +00:00
fix sorting network bug, add network compilation,...
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
72f09e4729
commit
019ff77613
15 changed files with 350 additions and 100 deletions
|
@ -23,6 +23,9 @@ Notes:
|
|||
#include"pb_decl_plugin.h"
|
||||
#include"th_rewriter.h"
|
||||
#include"rewriter.h"
|
||||
#include<typeinfo>
|
||||
#include"sorting_network.h"
|
||||
|
||||
|
||||
class ast_manager;
|
||||
class tactic;
|
||||
|
@ -30,12 +33,20 @@ class tactic;
|
|||
namespace pb {
|
||||
|
||||
class card2bv_rewriter {
|
||||
public:
|
||||
typedef expr* literal;
|
||||
typedef ptr_vector<expr> literal_vector;
|
||||
private:
|
||||
ast_manager& m;
|
||||
arith_util au;
|
||||
pb_util pb;
|
||||
bv_util bv;
|
||||
psort_nw<card2bv_rewriter> m_sort;
|
||||
expr_ref_vector m_lemmas;
|
||||
expr_ref_vector m_trail;
|
||||
|
||||
unsigned get_num_bits(func_decl* f);
|
||||
br_status mk_bv(func_decl * f, unsigned sz, expr * const* args, expr_ref & result);
|
||||
void mk_bv(func_decl * f, unsigned sz, expr * const* args, expr_ref & result);
|
||||
br_status mk_shannon(func_decl * f, unsigned sz, expr * const* args, expr_ref & result);
|
||||
expr* negate(expr* e);
|
||||
expr* mk_ite(expr* c, expr* hi, expr* lo);
|
||||
|
@ -45,6 +56,19 @@ namespace pb {
|
|||
public:
|
||||
card2bv_rewriter(ast_manager& m);
|
||||
br_status mk_app_core(func_decl * f, unsigned sz, expr * const* args, expr_ref & result);
|
||||
void mk_assert(func_decl * f, unsigned sz, expr * const* args, expr_ref & result, expr_ref_vector& lemmas);
|
||||
|
||||
// definitions used for sorting network
|
||||
literal mk_false() { return m.mk_false(); }
|
||||
literal mk_true() { return m.mk_true(); }
|
||||
literal mk_max(literal a, literal b) { return trail(m.mk_or(a, b)); }
|
||||
literal mk_min(literal a, literal b) { return trail(m.mk_and(a, b)); }
|
||||
literal mk_not(literal a) { if (m.is_not(a,a)) return a; return trail(m.mk_not(a)); }
|
||||
std::ostream& pp(std::ostream& out, literal lit);
|
||||
literal fresh();
|
||||
literal trail(literal l);
|
||||
void mk_clause(unsigned n, literal const* lits);
|
||||
|
||||
};
|
||||
|
||||
struct card2bv_rewriter_cfg : public default_rewriter_cfg {
|
||||
|
@ -55,15 +79,23 @@ namespace pb {
|
|||
result_pr = 0;
|
||||
return m_r.mk_app_core(f, num, args, result);
|
||||
}
|
||||
card2bv_rewriter_cfg(ast_manager & m):m_r(m) {}
|
||||
card2bv_rewriter_cfg(ast_manager & m):m_r(m) {}
|
||||
};
|
||||
|
||||
class card_pb_rewriter : public rewriter_tpl<card2bv_rewriter_cfg> {
|
||||
card2bv_rewriter_cfg m_cfg;
|
||||
pb_util pb;
|
||||
expr_ref_vector m_lemmas;
|
||||
public:
|
||||
card_pb_rewriter(ast_manager & m):
|
||||
rewriter_tpl<card2bv_rewriter_cfg>(m, false, m_cfg),
|
||||
m_cfg(m) {}
|
||||
card_pb_rewriter(ast_manager & m):
|
||||
rewriter_tpl<card2bv_rewriter_cfg>(m, false, m_cfg),
|
||||
m_cfg(m),
|
||||
pb(m),
|
||||
m_lemmas(m) {}
|
||||
|
||||
void rewrite(expr* e, expr_ref& result);
|
||||
|
||||
expr_ref_vector& lemmas() { return m_lemmas; }
|
||||
};
|
||||
};
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue