mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-11-24 06:31:27 +00:00
Code Activity

Centralize and document TRACE tags using X-macros (#7657)

Browse source 
* 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:
LeeYoungJoon 2025-05-28 22:31:25 +09:00 • committed by GitHub
parent d766292dab
commit 0a93ff515d
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
583 changed files with 8698 additions and 7299 deletions
Download patch file Download diff file Expand all files Collapse all files

32
src/test/rational.cpp
View file

@ -93,11 +93,11 @@ static void tst1() {
ENSURE(rational(3,4) >= rational(3,4));
ENSURE(rational(3,4) > rational(2,8));
ENSURE(rational(3,4) < rational(7,8));
TRACE("rational", tout << rational(3,4) << "\n";);
TRACE("rational", tout << rational(7,9) << "\n";);
TRACE("rational", tout << rational(-3,7) << "\n";);
TRACE("rational", tout << rational(5,8) << "\n";);
TRACE("rational", tout << rational(4,2) << "\n";);
TRACE(rational, tout << rational(3,4) << "\n";);
TRACE(rational, tout << rational(7,9) << "\n";);
TRACE(rational, tout << rational(-3,7) << "\n";);
TRACE(rational, tout << rational(5,8) << "\n";);
TRACE(rational, tout << rational(4,2) << "\n";);
ENSURE(rational(3) + rational(2) == rational(5));
ENSURE(rational(3) - rational(2) == rational(1));
ENSURE(rational(3) * rational(2) == rational(6));
@ -112,9 +112,9 @@ static void tst2() {
rational r1("10000000000000000000000000000000000");
rational r2("10000000000000000000000000000000000/3");
rational r3("20000000000000000000000000000000000/6");
TRACE("rational", tout << r1 << std::endl;);
TRACE("rational", tout << r2 << std::endl;);
TRACE("rational", tout << r3 << std::endl;);
TRACE(rational, tout << r1 << std::endl;);
TRACE(rational, tout << r2 << std::endl;);
TRACE(rational, tout << r3 << std::endl;);
ENSURE(r2 == r3);
ENSURE(r1 != r2);
@ -207,16 +207,16 @@ static void tst2() {
void tst3() {
rational n1 = power(rational(2), 32);
TRACE("rational", tout << "n1: " << n1 << "\n";);
TRACE(rational, tout << "n1: " << n1 << "\n";);
rational n2 = div(n1, rational(2));
rational n3 = div(rational(2), n2);
TRACE("rational",
TRACE(rational,
tout << "n1: " << n1 << "\n";
tout << "n2: " << n2 << "\n";
tout << "n3: " << n3 << "\n";);
rational n4 = n1 - rational(3);
rational n5 = div(n4, rational(2));
TRACE("rational",
TRACE(rational,
tout << "n4: " << n4 << "\n";
tout << "n5: " << n5 << "\n";);
ENSURE(n5 == rational("2147483646"));
@ -224,7 +224,7 @@ void tst3() {
void tst4() {
rational n1("4294967293");
TRACE("rational", tout << "n1: " << n1 << "\n";);
TRACE(rational, tout << "n1: " << n1 << "\n";);
rational n2 = div(n1, rational(2));
}
@ -233,9 +233,9 @@ void tst5() {
n1.neg();
rational n2("4294967295");
n1 /= n2;
TRACE("rational", tout << n1 << " " << n2 << " " << n1.is_big() << " " << n2.is_big() << "\n";);
TRACE(rational, tout << n1 << " " << n2 << " " << n1.is_big() << " " << n2.is_big() << "\n";);
n1 *= n2;
TRACE("rational", tout << "after: " << n1 << " " << n2 << "\n";);
TRACE(rational, tout << "after: " << n1 << " " << n2 << "\n";);
ENSURE(n1.is_minus_one());
}
@ -305,7 +305,7 @@ static void tst7() {
rational y;
rational gcd;
extended_gcd(n, p, gcd, x, y);
TRACE("gcd", tout << n << " " << p << ": " << gcd << " " << x << " " << y << "\n";);
TRACE(gcd, tout << n << " " << p << ": " << gcd << " " << x << " " << y << "\n";);
ENSURE(!mod(n, rational(2)).is_one() || mod(n * x, p).is_one());
}
}
@ -490,7 +490,7 @@ static void tst13() {
void tst_rational() {
TRACE("rational", tout << "starting rational test...\n";);
TRACE(rational, tout << "starting rational test...\n";);
std::cout << "sizeof(rational): " << sizeof(rational) << "\n";
rational r1("10000000000000000000000000000000001");
r1.hash();