mirror of
https://github.com/Z3Prover/z3
synced 2025-07-31 08:23:17 +00:00
0a93ff515d
* Introduce X-macro-based trace tag definition - Created trace_tags.def to centralize TRACE tag definitions - Each tag includes a symbolic name and description - Set up enum class TraceTag for type-safe usage in TRACE macros * Add script to generate Markdown documentation from trace_tags.def - Python script parses trace_tags.def and outputs trace_tags.md * Refactor TRACE_NEW to prepend TraceTag and pass enum to is_trace_enabled * trace: improve trace tag handling system with hierarchical tagging - Introduce hierarchical tag-class structure: enabling a tag class activates all child tags - Unify TRACE, STRACE, SCTRACE, and CTRACE under enum TraceTag - Implement initial version of trace_tag.def using X(tag, tag_class, description) (class names and descriptions to be refined in a future update) * trace: replace all string-based TRACE tags with enum TraceTag - Migrated all TRACE, STRACE, SCTRACE, and CTRACE macros to use enum TraceTag values instead of raw string literals * trace : add cstring header * trace : Add Markdown documentation generation from trace_tags.def via mk_api_doc.py * trace : rename macro parameter 'class' to 'tag_class' and remove Unicode comment in trace_tags.h. * trace : Add TODO comment for future implementation of tag_class activation * trace : Disable code related to tag_class until implementation is ready (#7663).
76 lines
2.2 KiB
C++
76 lines
2.2 KiB
C++
/*++
|
|
Copyright (c) 2011 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
bit_blaster.cpp
|
|
|
|
Abstract:
|
|
|
|
Apply bit-blasting
|
|
|
|
Author:
|
|
|
|
Leonardo (leonardo) 2011-10-25
|
|
|
|
--*/
|
|
|
|
#include "ast/simplifiers/bit_blaster.h"
|
|
|
|
|
|
void bit_blaster_simplifier::updt_params(params_ref const & p) {
|
|
m_params.append(p);
|
|
m_rewriter.updt_params(m_params);
|
|
}
|
|
|
|
void bit_blaster_simplifier::collect_param_descrs(param_descrs & r) {
|
|
insert_max_memory(r);
|
|
insert_max_steps(r);
|
|
r.insert("blast_mul", CPK_BOOL, "(default: true) bit-blast multipliers (and dividers, remainders).");
|
|
r.insert("blast_add", CPK_BOOL, "(default: true) bit-blast adders.");
|
|
r.insert("blast_quant", CPK_BOOL, "(default: false) bit-blast quantified variables.");
|
|
r.insert("blast_full", CPK_BOOL, "(default: false) bit-blast any term with bit-vector sort, this option will make E-matching ineffective in any pattern containing bit-vector terms.");
|
|
}
|
|
|
|
void bit_blaster_simplifier::reduce() {
|
|
m_rewriter.start_rewrite();
|
|
expr_ref new_curr(m);
|
|
proof_ref new_pr(m);
|
|
bool change = false;
|
|
for (unsigned idx : indices()) {
|
|
auto [curr, p, d] = m_fmls[idx]();
|
|
m_rewriter(curr, new_curr, new_pr);
|
|
if (curr != new_curr) {
|
|
m_num_steps += m_rewriter.get_num_steps();
|
|
change = true;
|
|
TRACE(bit_blaster, tout << mk_pp(curr, m) << " -> " << new_curr << "\n";);
|
|
m_fmls.update(idx, dependent_expr(m, new_curr, mp(p, new_pr), d));
|
|
}
|
|
}
|
|
|
|
if (change) {
|
|
obj_map<func_decl, expr*> const2bits;
|
|
ptr_vector<func_decl> newbits;
|
|
m_rewriter.end_rewrite(const2bits, newbits);
|
|
for (auto* f : newbits)
|
|
m_fmls.model_trail().hide(f);
|
|
for (auto const& [f, v] : const2bits)
|
|
m_fmls.model_trail().push(f, v, nullptr, {});
|
|
}
|
|
m_rewriter.cleanup();
|
|
}
|
|
|
|
|
|
void bit_blaster_simplifier::collect_statistics(statistics& st) const {
|
|
st.update("bit-blaster-num-steps", m_num_steps);
|
|
}
|
|
|
|
void bit_blaster_simplifier::push() {
|
|
m_rewriter.push();
|
|
dependent_expr_simplifier::push();
|
|
}
|
|
|
|
void bit_blaster_simplifier::pop(unsigned n) {
|
|
dependent_expr_simplifier::pop(n);
|
|
m_rewriter.pop(n);
|
|
}
|