2 * This file is part of Libav.
4 * Libav is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
9 * Libav is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with Libav; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 #include "libavutil/tree.c"
23 #include "libavutil/common.h"
24 #include "libavutil/lfg.h"
25 #include "libavutil/log.h"
27 static int check(AVTreeNode *t)
30 int left = check(t->child[0]);
31 int right = check(t->child[1]);
33 if (left > 999 || right > 999)
35 if (right - left != t->state)
37 if (t->state > 1 || t->state < -1)
39 return FFMAX(left, right) + 1;
44 static void print(AVTreeNode *t, int depth)
47 for (i = 0; i < depth * 4; i++)
48 av_log(NULL, AV_LOG_ERROR, " ");
50 av_log(NULL, AV_LOG_ERROR, "Node %p %2d %p\n", t, t->state, t->elem);
51 print(t->child[0], depth + 1);
52 print(t->child[1], depth + 1);
54 av_log(NULL, AV_LOG_ERROR, "NULL\n");
57 static int cmp(void *a, const void *b)
59 return (uint8_t *) a - (const uint8_t *) b;
65 AVTreeNode *root = NULL, *node = NULL;
68 av_lfg_init(&prng, 1);
70 for (i = 0; i < 10000; i++) {
71 AVTreeNode *node2 = NULL;
72 intptr_t j = av_lfg_get(&prng) % 86294;
73 void *ret, *jj = (void *)(j + 1);
75 while (ret = av_tree_find(root, jj, cmp, NULL)) {
76 j = av_lfg_get(&prng) % 86294;
80 if (check(root) > 999) {
81 av_log(NULL, AV_LOG_ERROR, "FATAL error %d\n", i);
87 node = av_tree_node_alloc();
89 av_log(NULL, AV_LOG_ERROR, "Memory allocation failure.\n");
92 av_tree_insert(&root, jj, cmp, &node);
94 while (ret = av_tree_find(root, jj, cmp, NULL)) {
95 j = av_lfg_get(&prng) % 86294;
99 ret = av_tree_insert(&root, jj, cmp, &node2);
101 av_tree_destroy(node2);
102 ret = av_tree_find(root, jj, cmp, NULL);
104 av_log(NULL, AV_LOG_ERROR, "removal failure %d\n", i);
107 av_tree_destroy(root);