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/math/lp/int_cube.cpp

@@ -26,7 +26,7 @@ namespace lp {
 
     lia_move int_cube::operator()() {
         lia.settings().stats().m_cube_calls++;
-        TRACE("cube",
+        TRACE(cube,
               for (unsigned j = 0; j < lra.number_of_vars(); j++)
                   lia.display_column(tout, j);
               tout << lra.constraints();
@@ -41,7 +41,7 @@ namespace lp {
         
         lp_status st = lra.find_feasible_solution();
         if (st != lp_status::FEASIBLE && st != lp_status::OPTIMAL) {
-            TRACE("cube", tout << "cannot find a feasible solution";);
+            TRACE(cube, tout << "cannot find a feasible solution";);
             lra.pop();
             lra.move_non_basic_columns_to_bounds();
             // it can happen that we found an integer solution here
@@ -51,7 +51,7 @@ namespace lp {
         lra.round_to_integer_solution();
         lra.set_status(lp_status::FEASIBLE);
         SASSERT(lia.settings().get_cancel_flag() || lia.is_feasible());
-        TRACE("cube", tout << "success";);
+        TRACE(cube, tout << "success";);
         lia.settings().stats().m_cube_success++;
         return lia_move::sat;
     }
@@ -61,7 +61,7 @@ namespace lp {
             return true;
         const lar_term& t = lra.get_term(i);
         impq delta = get_cube_delta_for_term(t);
-        TRACE("cube", lra.print_term_as_indices(t, tout); tout << ", delta = " << delta << "\n";);
+        TRACE(cube, lra.print_term_as_indices(t, tout); tout << ", delta = " << delta << "\n";);
         if (is_zero(delta))
             return true;
         return lra.tighten_term_bounds_by_delta(i, delta);
@@ -70,7 +70,7 @@ namespace lp {
     bool int_cube::tighten_terms_for_cube() {
         for (const lar_term* t: lra.terms())
             if (!tighten_term_for_cube(t->j())) {
-                TRACE("cube", tout << "cannot tighten";);
+                TRACE(cube, tout << "cannot tighten";);
                 return false;
             }
         return true;