mirror of
https://github.com/Z3Prover/z3
synced 2025-08-20 10:10:21 +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
|
@ -466,7 +466,7 @@ bool paccessor_decl::has_missing_refs(symbol & missing) const {
|
|||
}
|
||||
|
||||
bool paccessor_decl::fix_missing_refs(dictionary<int> const & symbol2idx, symbol & missing) {
|
||||
TRACE("fix_missing_refs", tout << "m_type.kind(): " << (int)m_type.kind() << "\n";
|
||||
TRACE(fix_missing_refs, tout << "m_type.kind(): " << (int)m_type.kind() << "\n";
|
||||
if (m_type.kind() == ptype_kind::PTR_MISSING_REF) tout << m_type.get_missing_ref() << "\n";);
|
||||
if (m_type.kind() != ptype_kind::PTR_MISSING_REF)
|
||||
return true;
|
||||
|
@ -504,7 +504,7 @@ pconstructor_decl::pconstructor_decl(unsigned id, unsigned num_params, pdecl_man
|
|||
m_recogniser_name(r),
|
||||
m_accessors(num_accessors, accessors) {
|
||||
m.inc_ref(num_accessors, accessors);
|
||||
TRACE("pconstructor_decl", tout << "name: " << n << ", recognizer: " << r << "\n";);
|
||||
TRACE(pconstructor_decl, tout << "name: " << n << ", recognizer: " << r << "\n";);
|
||||
}
|
||||
|
||||
void pconstructor_decl::finalize(pdecl_manager & m) {
|
||||
|
@ -651,7 +651,7 @@ std::ostream& pdatatype_decl::display(std::ostream & out) const {
|
|||
}
|
||||
|
||||
bool pdatatype_decl::commit(pdecl_manager& m) {
|
||||
TRACE("datatype", tout << m_name << "\n";);
|
||||
TRACE(datatype, tout << m_name << "\n";);
|
||||
sort_ref_vector ps(m.m());
|
||||
for (unsigned i = 0; i < m_num_params; ++i) {
|
||||
ps.push_back(m.m().mk_uninterpreted_sort(symbol(i), 0, nullptr));
|
||||
|
@ -685,7 +685,7 @@ void pdatatypes_decl::finalize(pdecl_manager & m) {
|
|||
}
|
||||
|
||||
bool pdatatypes_decl::fix_missing_refs(symbol & missing) {
|
||||
TRACE("fix_missing_refs", tout << "pdatatypes_decl::fix_missing_refs\n";);
|
||||
TRACE(fix_missing_refs, tout << "pdatatypes_decl::fix_missing_refs\n";);
|
||||
dictionary<int> symbol2idx;
|
||||
int idx = 0;
|
||||
for (pdatatype_decl* d : m_datatypes)
|
||||
|
@ -697,7 +697,7 @@ bool pdatatypes_decl::fix_missing_refs(symbol & missing) {
|
|||
}
|
||||
|
||||
sort* pdecl_manager::instantiate_datatype(psort_decl* p, symbol const& name, unsigned n, sort * const* s) {
|
||||
TRACE("datatype", tout << name << " "; for (unsigned i = 0; i < n; ++i) tout << s[i]->get_name() << " "; tout << "\n";);
|
||||
TRACE(datatype, tout << name << " "; for (unsigned i = 0; i < n; ++i) tout << s[i]->get_name() << " "; tout << "\n";);
|
||||
|
||||
pdecl_manager& m = *this;
|
||||
sort * r = p->find(s);
|
||||
|
@ -926,7 +926,7 @@ pdecl_manager::~pdecl_manager() {
|
|||
reset_sort_info();
|
||||
for (auto const& kv : m_sort2psort) {
|
||||
del_decl_core(kv.m_value);
|
||||
TRACE("pdecl_manager", tout << "orphan: " << mk_pp(kv.m_key, m()) << "\n";);
|
||||
TRACE(pdecl_manager, tout << "orphan: " << mk_pp(kv.m_key, m()) << "\n";);
|
||||
}
|
||||
for (auto* p : m_table) {
|
||||
del_decl_core(p);
|
||||
|
@ -970,7 +970,7 @@ pconstructor_decl * pdecl_manager::mk_pconstructor_decl(unsigned num_params,
|
|||
}
|
||||
|
||||
pdatatype_decl * pdecl_manager::mk_pdatatype_decl(unsigned num_params, symbol const & s, unsigned num, pconstructor_decl * const * cs) {
|
||||
TRACE("datatype", tout << s << " has " << num_params << " parameters\n";);
|
||||
TRACE(datatype, tout << s << " has " << num_params << " parameters\n";);
|
||||
return new (a().allocate(sizeof(pdatatype_decl))) pdatatype_decl(m_id_gen.mk(), num_params, *this,
|
||||
s, num, cs);
|
||||
}
|
||||
|
@ -1017,7 +1017,7 @@ sort * pdecl_manager::instantiate(psort * p, unsigned num, sort * const * args)
|
|||
|
||||
|
||||
void pdecl_manager::del_decl_core(pdecl * p) {
|
||||
TRACE("pdecl_manager",
|
||||
TRACE(pdecl_manager,
|
||||
tout << "del_decl_core:\n";
|
||||
if (p->is_psort()) static_cast<psort*>(p)->display(tout);
|
||||
else static_cast<psort_decl*>(p)->display(tout);
|
||||
|
@ -1030,7 +1030,7 @@ void pdecl_manager::del_decl_core(pdecl * p) {
|
|||
}
|
||||
|
||||
void pdecl_manager::del_decl(pdecl * p) {
|
||||
TRACE("pdecl_manager", tout << "del psort "; p->display(tout); tout << "\n";);
|
||||
TRACE(pdecl_manager, tout << "del psort "; p->display(tout); tout << "\n";);
|
||||
if (p->is_psort()) {
|
||||
psort * _p = static_cast<psort*>(p);
|
||||
if (_p->is_sort_wrapper()) {
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue