FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavutil/tree.c
Date: 2026-04-20 16:43:18
Exec Total Coverage
Lines: 77 77 100.0%
Functions: 5 5 100.0%
Branches: 43 44 97.7%
Line Branch Exec Source
1 /*
2 * copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at>
3 *
4 * This file is part of FFmpeg.
5 *
6 * FFmpeg is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
10 *
11 * FFmpeg is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with FFmpeg; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
21 #include "error.h"
22 #include "log.h"
23 #include "mem.h"
24 #include "tree.h"
25
26 typedef struct AVTreeNode {
27 struct AVTreeNode *child[2];
28 void *elem;
29 int state;
30 } AVTreeNode;
31
32 const int av_tree_node_size = sizeof(AVTreeNode);
33
34 16436 struct AVTreeNode *av_tree_node_alloc(void)
35 {
36 16436 return av_mallocz(sizeof(struct AVTreeNode));
37 }
38
39 159356 void *av_tree_find(const AVTreeNode *t, void *key,
40 int (*cmp)(const void *key, const void *b), void *next[2])
41 {
42
2/2
✓ Branch 0 taken 139634 times.
✓ Branch 1 taken 19722 times.
 159356 if (t) {
43 139634 unsigned int v = cmp(key, t->elem);
44
2/2
✓ Branch 0 taken 136351 times.
✓ Branch 1 taken 3283 times.
 139634 if (v) {
45
2/2
✓ Branch 0 taken 15859 times.
✓ Branch 1 taken 120492 times.
 136351 if (next)
46 15859 next[v >> 31] = t->elem;
47 136351 return av_tree_find(t->child[(v >> 31) ^ 1], key, cmp, next);
48 } else {
49
2/2
✓ Branch 0 taken 3202 times.
✓ Branch 1 taken 81 times.
 3283 if (next) {
50 3202 av_tree_find(t->child[0], key, cmp, next);
51 3202 av_tree_find(t->child[1], key, cmp, next);
52 }
53 3283 return t->elem;
54 }
55 }
56 19722 return NULL;
57 }
58
59 281120 void *av_tree_insert(AVTreeNode **tp, void *key,
60 int (*cmp)(const void *key, const void *b), AVTreeNode **next)
61 {
62 281120 AVTreeNode *t = *tp;
63
2/2
✓ Branch 0 taken 255256 times.
✓ Branch 1 taken 25864 times.
 281120 if (t) {
64 255256 unsigned int v = cmp(t->elem, key);
65 void *ret;
66
2/2
✓ Branch 0 taken 1634 times.
✓ Branch 1 taken 253622 times.
 255256 if (!v) {
67
2/2
✓ Branch 0 taken 510 times.
✓ Branch 1 taken 1124 times.
 1634 if (*next)
68 510 return t->elem;
69
4/4
✓ Branch 0 taken 752 times.
✓ Branch 1 taken 372 times.
✓ Branch 2 taken 57 times.
✓ Branch 3 taken 695 times.
 1124 else if (t->child[0] || t->child[1]) {
70 429 int i = !t->child[0];
71 void *next_elem[2];
72 429 av_tree_find(t->child[i], key, cmp, next_elem);
73 429 key = t->elem = next_elem[i];
74 429 v = -i;
75 } else {
76 695 *next = t;
77 695 *tp = NULL;
78 695 return NULL;
79 }
80 }
81 254051 ret = av_tree_insert(&t->child[v >> 31], key, cmp, next);
82
2/2
✓ Branch 0 taken 37155 times.
✓ Branch 1 taken 216896 times.
 254051 if (!ret) {
83 37155 int i = (v >> 31) ^ !!*next;
84 37155 AVTreeNode **child = &t->child[i];
85 37155 t->state += 2 * i - 1;
86
87
2/2
✓ Branch 0 taken 13143 times.
✓ Branch 1 taken 24012 times.
 37155 if (!(t->state & 1)) {
88
2/2
✓ Branch 0 taken 7560 times.
✓ Branch 1 taken 5583 times.
 13143 if (t->state) {
89 /* The following code is equivalent to
90 * if ((*child)->state * 2 == -t->state)
91 * rotate(child, i ^ 1);
92 * rotate(tp, i);
93 *
94 * with rotate():
95 * static void rotate(AVTreeNode **tp, int i)
96 * {
97 * AVTreeNode *t= *tp;
98 *
99 * *tp = t->child[i];
100 * t->child[i] = t->child[i]->child[i ^ 1];
101 * (*tp)->child[i ^ 1] = t;
102 * i = 4 * t->state + 2 * (*tp)->state + 12;
103 * t->state = ((0x614586 >> i) & 3) - 1;
104 * (*tp)->state = ((0x400EEA >> i) & 3) - 1 +
105 * ((*tp)->state >> 1);
106 * }
107 * but such a rotate function is both bigger and slower
108 */
109
2/2
✓ Branch 0 taken 2309 times.
✓ Branch 1 taken 5251 times.
 7560 if ((*child)->state * 2 == -t->state) {
110 2309 *tp = (*child)->child[i ^ 1];
111 2309 (*child)->child[i ^ 1] = (*tp)->child[i];
112 2309 (*tp)->child[i] = *child;
113 2309 *child = (*tp)->child[i ^ 1];
114 2309 (*tp)->child[i ^ 1] = t;
115
116 2309 (*tp)->child[0]->state = -((*tp)->state > 0);
117 2309 (*tp)->child[1]->state = (*tp)->state < 0;
118 2309 (*tp)->state = 0;
119 } else {
120 5251 *tp = *child;
121 5251 *child = (*child)->child[i ^ 1];
122 5251 (*tp)->child[i ^ 1] = t;
123
2/2
✓ Branch 0 taken 5180 times.
✓ Branch 1 taken 71 times.
 5251 if ((*tp)->state)
124 5180 t->state = 0;
125 else
126 71 t->state >>= 1;
127 5251 (*tp)->state = -t->state;
128 }
129 }
130 }
131
2/2
✓ Branch 0 taken 13137 times.
✓ Branch 1 taken 24018 times.
 37155 if (!(*tp)->state ^ !!*next)
132 13137 return key;
133 }
134 240914 return ret;
135 } else {
136 25864 *tp = *next;
137 25864 *next = NULL;
138
2/2
✓ Branch 0 taken 16413 times.
✓ Branch 1 taken 9451 times.
 25864 if (*tp) {
139 16413 (*tp)->elem = key;
140 16413 return NULL;
141 } else
142 9451 return key;
143 }
144 }
145
146 34252 void av_tree_destroy(AVTreeNode *t)
147 {
148
2/2
✓ Branch 0 taken 15718 times.
✓ Branch 1 taken 18534 times.
 34252 if (t) {
149 15718 av_tree_destroy(t->child[0]);
150 15718 av_tree_destroy(t->child[1]);
151 15718 av_free(t);
152 }
153 34252 }
154
155 16350 void av_tree_enumerate(AVTreeNode *t, void *opaque,
156 int (*cmp)(void *opaque, void *elem),
157 int (*enu)(void *opaque, void *elem))
158 {
159
2/2
✓ Branch 0 taken 6770 times.
✓ Branch 1 taken 9580 times.
 16350 if (t) {
160
2/2
✓ Branch 0 taken 16 times.
✓ Branch 1 taken 6754 times.
 6770 int v = cmp ? cmp(opaque, t->elem) : 0;
161
1/2
✓ Branch 0 taken 6770 times.
✗ Branch 1 not taken.
 6770 if (v >= 0)
162 6770 av_tree_enumerate(t->child[0], opaque, cmp, enu);
163
2/2
✓ Branch 0 taken 6760 times.
✓ Branch 1 taken 10 times.
 6770 if (v == 0)
164 6760 enu(opaque, t->elem);
165
2/2
✓ Branch 0 taken 6760 times.
✓ Branch 1 taken 10 times.
 6770 if (v <= 0)
166 6760 av_tree_enumerate(t->child[1], opaque, cmp, enu);
167 }
168 16350 }
169