ABI tools: Better reporting of missing files

[libucw.git] / ucw / redblack-test.c

diff --git a/ucw/redblack-test.c b/ucw/redblack-test.c
index 911f8250a76ec2343bb8b3bfc02b4400322b7c40..6ec1b9f7424f54b764f23cd71919654a6b871720 100644 (file)
--- a/ucw/redblack-test.c
+++ b/ucw/redblack-test.c
@@ -39,6 +39,7 @@ static void my_dump_data(struct fastbuf *fb, struct my1_node *n)
 #define TREE_WANT_ITERATOR
 #define TREE_WANT_DUMP
 #define TREE_CONSERVE_SPACE
+#define TREE_AUTO_POOL 4096
 #include "redblack.h"
 
 static void my_check_order(struct fastbuf *fb, struct my_tree *t)
@@ -87,14 +88,14 @@ static void my2_dump_data(struct fastbuf *fb UNUSED, struct my2_node *n UNUSED)
 #define TREE_WANT_FIND_NEXT
 #define TREE_WANT_ITERATOR
 #define TREE_WANT_DUMP
-#define TREE_STATIC
 #define TREE_CONSERVE_SPACE
+#define TREE_AUTO_POOL 4096
 #include "redblack.h"
 
-static void random_string(char *txt, uns max_len)
+static void random_string(char *txt, uint max_len)
 {
-       uns len = random() % max_len;
-       uns j;
+       uint len = random() % max_len;
+       uint j;
        for (j=0; j<len; j++)
                txt[j] = random() % 96 + 32;
        txt[len] = 0;
@@ -127,7 +128,7 @@ main(int argc, char **argv)
        struct my_tree t;
        struct my2_tree t2;
        int i;
-       cf_set_default_file(NULL);
+       cf_def_file = NULL;
        log_init(argv[0]);
        while ((opt = cf_getopt(argc, argv, options, CF_NO_LONG_OPTS, NULL)) >= 0)
                switch (opt)