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/sat/sat_xor_finder.cpp

@@ -57,7 +57,7 @@ namespace sat {
         SASSERT(c.size() > 2);
         unsigned filter = get_clause_filter(c);
         s.init_visited();
-        TRACE("sat_xor", tout << c << "\n";);
+        TRACE(sat_xor, tout << c << "\n";);
         bool parity = false;
         unsigned mask = 0, i = 0;        
         for (literal l : c) {
@@ -117,7 +117,7 @@ namespace sat {
             s.set_external(l.var());
         }
         if (parity == (lits.size() % 2 == 0)) lits[0].neg();
-        TRACE("sat_xor", tout << parity << ": " << lits << "\n";);
+        TRACE(sat_xor, tout << parity << ": " << lits << "\n";);
         m_on_xor(lits);
     }
 
@@ -137,7 +137,7 @@ namespace sat {
                 m_missing.push_back(i);
             }
         }
-        TRACE("sat_xor", tout << l1 << " " << l2 << "\n";);
+        TRACE(sat_xor, tout << l1 << " " << l2 << "\n";);
         return update_combinations(c, parity, mask);
     }
 
@@ -154,7 +154,7 @@ namespace sat {
             m_clauses_to_remove.push_back(&c2);
             c2.mark_used();
         }
-        TRACE("sat_xor", tout << c2 << "\n";);
+        TRACE(sat_xor, tout << c2 << "\n";);
         // insert missing
         unsigned mask = 0;
         m_missing.reset();
@@ -192,7 +192,7 @@ namespace sat {
         // return true if xor clause is covered.
         unsigned sz = c.size();
         for (unsigned i = 0; i < (1ul << sz); ++i) {     
-            TRACE("sat_xor", tout << i << ": " << parity << " " << m_parity[sz][i] << " " << get_combination(i) << "\n";);
+            TRACE(sat_xor, tout << i << ": " << parity << " " << m_parity[sz][i] << " " << get_combination(i) << "\n";);
             if (parity == m_parity[sz][i] && !get_combination(i)) {
                 return false;
             }