Improve red-black tree map implementation

This implements a single allocation strategy that combines node, key,
and value into one contiguous memory block, reducing memory usage by
54%. It optimizes insertion by eliminating double tree traversal,
achieving 3-4x faster performance.

In addition, this enhances the test suite with red-black tree property
validation, memory stress testing for 100,000 elements, and edge case
coverage.

Author: jserv

src/breakpoint.c

@@ -12,7 +12,9 @@
 static inline int cmp(const void *arg0, const void *arg1)
 {
     riscv_word_t *a = (riscv_word_t *) arg0, *b = (riscv_word_t *) arg1;
-    return (*a < *b) ? _CMP_LESS : (*a > *b) ? _CMP_GREATER : _CMP_EQUAL;
+    return (*a < *b)   ? MAP_CMP_LESS
+           : (*a > *b) ? MAP_CMP_GREATER
+                       : MAP_CMP_EQUAL;
 }
 
 breakpoint_map_t breakpoint_map_new()