mirror of
https://github.com/Z3Prover/z3
synced 2026-03-18 19:14:29 +00:00
Centralize and document TRACE tags using X-macros (#7657)
* 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).
This commit is contained in:
parent
d766292dab
commit
0a93ff515d
583 changed files with 8698 additions and 7299 deletions
|
|
@ -53,7 +53,7 @@ br_status factor_rewriter::mk_eq(expr * arg1, expr * arg2, expr_ref & result) {
|
|||
return BR_DONE;
|
||||
}
|
||||
if (!extract_factors()) {
|
||||
TRACE("factor_rewriter", tout << mk_pp(arg1, m()) << " = " << mk_pp(arg2, m()) << "\n";);
|
||||
TRACE(factor_rewriter, tout << mk_pp(arg1, m()) << " = " << mk_pp(arg2, m()) << "\n";);
|
||||
return BR_FAILED;
|
||||
}
|
||||
powers_t::iterator it = m_powers.begin(), end = m_powers.end();
|
||||
|
|
@ -74,7 +74,7 @@ br_status factor_rewriter::mk_le(expr * arg1, expr * arg2, expr_ref & result) {
|
|||
return BR_DONE;
|
||||
}
|
||||
if (!extract_factors()) {
|
||||
TRACE("factor_rewriter", tout << mk_pp(arg1, m()) << " <= " << mk_pp(arg2, m()) << "\n";);
|
||||
TRACE(factor_rewriter, tout << mk_pp(arg1, m()) << " <= " << mk_pp(arg2, m()) << "\n";);
|
||||
return BR_FAILED;
|
||||
}
|
||||
|
||||
|
|
@ -87,7 +87,7 @@ br_status factor_rewriter::mk_le(expr * arg1, expr * arg2, expr_ref & result) {
|
|||
mk_is_negative(neg, eqs);
|
||||
eqs.push_back(neg);
|
||||
result = m().mk_or(eqs.size(), eqs.data());
|
||||
TRACE("factor_rewriter",
|
||||
TRACE(factor_rewriter,
|
||||
tout << mk_pp(arg1, m()) << " <= " << mk_pp(arg2, m()) << "\n";
|
||||
tout << mk_pp(result.get(), m()) << "\n";);
|
||||
return BR_DONE;
|
||||
|
|
@ -101,7 +101,7 @@ br_status factor_rewriter::mk_lt(expr * arg1, expr * arg2, expr_ref & result) {
|
|||
return BR_DONE;
|
||||
}
|
||||
if (!extract_factors()) {
|
||||
TRACE("factor_rewriter", tout << mk_pp(arg1, m()) << " < " << mk_pp(arg2, m()) << "\n";);
|
||||
TRACE(factor_rewriter, tout << mk_pp(arg1, m()) << " < " << mk_pp(arg2, m()) << "\n";);
|
||||
return BR_FAILED;
|
||||
}
|
||||
// a^2 * b^3 * c < 0 ->
|
||||
|
|
@ -116,7 +116,7 @@ br_status factor_rewriter::mk_lt(expr * arg1, expr * arg2, expr_ref & result) {
|
|||
}
|
||||
eqs.push_back(neg);
|
||||
result = m().mk_and(eqs.size(), eqs.data());
|
||||
TRACE("factor_rewriter", tout << mk_pp(result.get(), m()) << "\n";);
|
||||
TRACE(factor_rewriter, tout << mk_pp(result.get(), m()) << "\n";);
|
||||
return BR_DONE;
|
||||
}
|
||||
|
||||
|
|
@ -163,7 +163,7 @@ void factor_rewriter::mk_adds(expr* arg1, expr* arg2) {
|
|||
bool sign = m_adds[i].second;
|
||||
expr* _e = m_adds[i].first;
|
||||
|
||||
TRACE("factor_rewriter", tout << i << " " << mk_pp(_e, m_manager) << "\n";);
|
||||
TRACE(factor_rewriter, tout << i << " " << mk_pp(_e, m_manager) << "\n";);
|
||||
|
||||
if (!is_app(_e)) {
|
||||
++i;
|
||||
|
|
@ -195,7 +195,7 @@ void factor_rewriter::mk_adds(expr* arg1, expr* arg2) {
|
|||
++i;
|
||||
}
|
||||
}
|
||||
TRACE("factor_rewriter",
|
||||
TRACE(factor_rewriter,
|
||||
for (unsigned i = 0; i < m_adds.size(); ++i) {
|
||||
if (!m_adds[i].second) tout << "-"; else tout << "+";
|
||||
tout << mk_pp(m_adds[i].first, m()) << " ";
|
||||
|
|
@ -216,7 +216,7 @@ void factor_rewriter::mk_muls() {
|
|||
--i;
|
||||
}
|
||||
}
|
||||
TRACE("factor_rewriter",
|
||||
TRACE(factor_rewriter,
|
||||
for (unsigned i = 0; i < m_muls.size(); ++i) {
|
||||
for (unsigned j = 0; j < m_muls[i].size(); ++j) {
|
||||
tout << mk_pp(m_muls[i][j], m()) << " ";
|
||||
|
|
@ -329,7 +329,7 @@ bool factor_rewriter::extract_factors() {
|
|||
m_factors.push_back(a().mk_add(trail.size(), trail.data()));
|
||||
break;
|
||||
}
|
||||
TRACE("factor_rewriter",
|
||||
TRACE(factor_rewriter,
|
||||
for (unsigned i = 0; i < m_factors.size(); ++i) {
|
||||
tout << mk_pp(m_factors[i].get(), m()) << " ";
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue