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).

src/ast/rewriter/bit2int.cpp

@@ -38,7 +38,7 @@ void bit2int::operator()(expr * n, expr_ref & result, proof_ref& p) {
         // TBD: rough
         p = m.mk_rewrite(n, result);
     }
-    TRACE("bit2int", 
+    TRACE(bit2int, 
           tout << mk_pp(n, m) << "======>\n" << result << "\n";);
 
 }
@@ -221,7 +221,7 @@ bool bit2int::is_bv_poly(expr* n, expr_ref& pos, expr_ref& neg) {
             VERIFY(mk_add(arg1, neg, neg));
         }
         else {
-            TRACE("bit2int", tout << "Not a poly: " << mk_pp(n, m) << "\n";);
+            TRACE(bit2int, tout << "Not a poly: " << mk_pp(n, m) << "\n";);
             return false;
         }
     }
@@ -407,12 +407,12 @@ expr * bit2int::get_cached(expr * n) const {
     expr* r = nullptr;
     proof* p = nullptr;
     const_cast<bit2int*>(this)->m_cache.get(n, r, p);
-    CTRACE("bit2int", !r, tout << mk_pp(n, m) << "\n";);
+    CTRACE(bit2int, !r, tout << mk_pp(n, m) << "\n";);
     return r;
 }
 
 void bit2int::cache_result(expr * n, expr * r) { 
-    TRACE("bit2int_verbose", tout << "caching:\n" << mk_pp(n, m) <<
+    TRACE(bit2int_verbose, tout << "caching:\n" << mk_pp(n, m) <<
           "======>\n" << mk_ll_pp(r, m) << "\n";);
     m_cache.insert(n, r, nullptr); 
 }