summaryrefslogtreecommitdiff
path: root/libavutil/tree.c
diff options
context:
space:
mode:
authorDiego Biurrun <diego@biurrun.de>2016-03-17 19:13:17 +0100
committerDiego Biurrun <diego@biurrun.de>2016-04-07 16:14:42 +0200
commitd12b5b2f135aade4099f4b26b0fe678656158c13 (patch)
treed5b44fd428a1c68213fe51aca21b5819bce3d33a /libavutil/tree.c
parent330177b508420a553083df94f22cbd5142de0f4a (diff)
build: Split test programs off into separate files
This avoids spurious library rebuilds when only the test program code is changed and simplifies the build system.
Diffstat (limited to 'libavutil/tree.c')
-rw-r--r--libavutil/tree.c92
1 files changed, 0 insertions, 92 deletions
diff --git a/libavutil/tree.c b/libavutil/tree.c
index 998851f7f2..a65d728f86 100644
--- a/libavutil/tree.c
+++ b/libavutil/tree.c
@@ -19,7 +19,6 @@
*/
#include "error.h"
-#include "log.h"
#include "mem.h"
#include "tree.h"
@@ -164,94 +163,3 @@ void av_tree_enumerate(AVTreeNode *t, void *opaque,
av_tree_enumerate(t->child[1], opaque, cmp, enu);
}
}
-
-#ifdef TEST
-
-#include "common.h"
-#include "lfg.h"
-
-static int check(AVTreeNode *t)
-{
- if (t) {
- int left = check(t->child[0]);
- int right = check(t->child[1]);
-
- if (left > 999 || right > 999)
- return 1000;
- if (right - left != t->state)
- return 1000;
- if (t->state > 1 || t->state < -1)
- return 1000;
- return FFMAX(left, right) + 1;
- }
- return 0;
-}
-
-static void print(AVTreeNode *t, int depth)
-{
- int i;
- for (i = 0; i < depth * 4; i++)
- av_log(NULL, AV_LOG_ERROR, " ");
- if (t) {
- av_log(NULL, AV_LOG_ERROR, "Node %p %2d %p\n", t, t->state, t->elem);
- print(t->child[0], depth + 1);
- print(t->child[1], depth + 1);
- } else
- av_log(NULL, AV_LOG_ERROR, "NULL\n");
-}
-
-static int cmp(void *a, const void *b)
-{
- return (uint8_t *) a - (const uint8_t *) b;
-}
-
-int main(void)
-{
- int i;
- AVTreeNode *root = NULL, *node = NULL;
- AVLFG prng;
-
- av_lfg_init(&prng, 1);
-
- for (i = 0; i < 10000; i++) {
- AVTreeNode *node2 = NULL;
- intptr_t j = av_lfg_get(&prng) % 86294;
- void *ret, *jj = (void *)(j + 1);
-
- while (ret = av_tree_find(root, jj, cmp, NULL)) {
- j = av_lfg_get(&prng) % 86294;
- jj = (void *)(j + 1);
- }
-
- if (check(root) > 999) {
- av_log(NULL, AV_LOG_ERROR, "FATAL error %d\n", i);
- print(root, 0);
- return 1;
- }
-
- if (!node)
- node = av_tree_node_alloc();
- if (!node) {
- av_log(NULL, AV_LOG_ERROR, "Memory allocation failure.\n");
- return 1;
- }
- av_tree_insert(&root, jj, cmp, &node);
-
- while (ret = av_tree_find(root, jj, cmp, NULL)) {
- j = av_lfg_get(&prng) % 86294;
- jj = (void *)(j + 1);
- }
-
- ret = av_tree_insert(&root, jj, cmp, &node2);
- if (ret != jj)
- av_tree_destroy(node2);
- ret = av_tree_find(root, jj, cmp, NULL);
- if (ret)
- av_log(NULL, AV_LOG_ERROR, "removal failure %d\n", i);
- }
-
- av_tree_destroy(root);
-
- return 0;
-}
-#endif