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 | 14852 | struct AVTreeNode *av_tree_node_alloc(void) | |
35 | { | ||
36 | 14852 | return av_mallocz(sizeof(struct AVTreeNode)); | |
37 | } | ||
38 | |||
39 | 150845 | 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 133888 times.
✓ Branch 1 taken 16957 times.
|
150845 | if (t) { |
43 | 133888 | unsigned int v = cmp(key, t->elem); | |
44 |
2/2✓ Branch 0 taken 131787 times.
✓ Branch 1 taken 2101 times.
|
133888 | if (v) { |
45 |
2/2✓ Branch 0 taken 11861 times.
✓ Branch 1 taken 119926 times.
|
131787 | if (next) |
46 | 11861 | next[v >> 31] = t->elem; | |
47 | 131787 | return av_tree_find(t->child[(v >> 31) ^ 1], key, cmp, next); | |
48 | } else { | ||
49 |
1/2✓ Branch 0 taken 2101 times.
✗ Branch 1 not taken.
|
2101 | if (next) { |
50 | 2101 | av_tree_find(t->child[0], key, cmp, next); | |
51 | 2101 | av_tree_find(t->child[1], key, cmp, next); | |
52 | } | ||
53 | 2101 | return t->elem; | |
54 | } | ||
55 | } | ||
56 | 16957 | return NULL; | |
57 | } | ||
58 | |||
59 | 275424 | void *av_tree_insert(AVTreeNode **tp, void *key, | |
60 | int (*cmp)(const void *key, const void *b), AVTreeNode **next) | ||
61 | { | ||
62 | 275424 | AVTreeNode *t = *tp; | |
63 |
2/2✓ Branch 0 taken 251144 times.
✓ Branch 1 taken 24280 times.
|
275424 | if (t) { |
64 | 251144 | unsigned int v = cmp(t->elem, key); | |
65 | void *ret; | ||
66 |
2/2✓ Branch 0 taken 1412 times.
✓ Branch 1 taken 249732 times.
|
251144 | if (!v) { |
67 |
2/2✓ Branch 0 taken 510 times.
✓ Branch 1 taken 902 times.
|
1412 | if (*next) |
68 | 510 | return t->elem; | |
69 |
4/4✓ Branch 0 taken 592 times.
✓ Branch 1 taken 310 times.
✓ Branch 2 taken 43 times.
✓ Branch 3 taken 549 times.
|
902 | else if (t->child[0] || t->child[1]) { |
70 | 353 | int i = !t->child[0]; | |
71 | void *next_elem[2]; | ||
72 | 353 | av_tree_find(t->child[i], key, cmp, next_elem); | |
73 | 353 | key = t->elem = next_elem[i]; | |
74 | 353 | v = -i; | |
75 | } else { | ||
76 | 549 | *next = t; | |
77 | 549 | *tp = NULL; | |
78 | 549 | return NULL; | |
79 | } | ||
80 | } | ||
81 | 250085 | ret = av_tree_insert(&t->child[v >> 31], key, cmp, next); | |
82 |
2/2✓ Branch 0 taken 34530 times.
✓ Branch 1 taken 215555 times.
|
250085 | if (!ret) { |
83 | 34530 | int i = (v >> 31) ^ !!*next; | |
84 | 34530 | AVTreeNode **child = &t->child[i]; | |
85 | 34530 | t->state += 2 * i - 1; | |
86 | |||
87 |
2/2✓ Branch 0 taken 12287 times.
✓ Branch 1 taken 22243 times.
|
34530 | if (!(t->state & 1)) { |
88 |
2/2✓ Branch 0 taken 6807 times.
✓ Branch 1 taken 5480 times.
|
12287 | 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 2289 times.
✓ Branch 1 taken 4518 times.
|
6807 | if ((*child)->state * 2 == -t->state) { |
110 | 2289 | *tp = (*child)->child[i ^ 1]; | |
111 | 2289 | (*child)->child[i ^ 1] = (*tp)->child[i]; | |
112 | 2289 | (*tp)->child[i] = *child; | |
113 | 2289 | *child = (*tp)->child[i ^ 1]; | |
114 | 2289 | (*tp)->child[i ^ 1] = t; | |
115 | |||
116 | 2289 | (*tp)->child[0]->state = -((*tp)->state > 0); | |
117 | 2289 | (*tp)->child[1]->state = (*tp)->state < 0; | |
118 | 2289 | (*tp)->state = 0; | |
119 | } else { | ||
120 | 4518 | *tp = *child; | |
121 | 4518 | *child = (*child)->child[i ^ 1]; | |
122 | 4518 | (*tp)->child[i ^ 1] = t; | |
123 |
2/2✓ Branch 0 taken 4474 times.
✓ Branch 1 taken 44 times.
|
4518 | if ((*tp)->state) |
124 | 4474 | t->state = 0; | |
125 | else | ||
126 | 44 | t->state >>= 1; | |
127 | 4518 | (*tp)->state = -t->state; | |
128 | } | ||
129 | } | ||
130 | } | ||
131 |
2/2✓ Branch 0 taken 12265 times.
✓ Branch 1 taken 22265 times.
|
34530 | if (!(*tp)->state ^ !!*next) |
132 | 12265 | return key; | |
133 | } | ||
134 | 237820 | return ret; | |
135 | } else { | ||
136 | 24280 | *tp = *next; | |
137 | 24280 | *next = NULL; | |
138 |
2/2✓ Branch 0 taken 14829 times.
✓ Branch 1 taken 9451 times.
|
24280 | if (*tp) { |
139 | 14829 | (*tp)->elem = key; | |
140 | 14829 | return NULL; | |
141 | } else | ||
142 | 9451 | return key; | |
143 | } | ||
144 | } | ||
145 | |||
146 | 30965 | void av_tree_destroy(AVTreeNode *t) | |
147 | { | ||
148 |
2/2✓ Branch 0 taken 14280 times.
✓ Branch 1 taken 16685 times.
|
30965 | if (t) { |
149 | 14280 | av_tree_destroy(t->child[0]); | |
150 | 14280 | av_tree_destroy(t->child[1]); | |
151 | 14280 | av_free(t); | |
152 | } | ||
153 | 30965 | } | |
154 | |||
155 | 13036 | 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 5316 times.
✓ Branch 1 taken 7720 times.
|
13036 | if (t) { |
160 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 5316 times.
|
5316 | int v = cmp ? cmp(opaque, t->elem) : 0; |
161 |
1/2✓ Branch 0 taken 5316 times.
✗ Branch 1 not taken.
|
5316 | if (v >= 0) |
162 | 5316 | av_tree_enumerate(t->child[0], opaque, cmp, enu); | |
163 |
1/2✓ Branch 0 taken 5316 times.
✗ Branch 1 not taken.
|
5316 | if (v == 0) |
164 | 5316 | enu(opaque, t->elem); | |
165 |
1/2✓ Branch 0 taken 5316 times.
✗ Branch 1 not taken.
|
5316 | if (v <= 0) |
166 | 5316 | av_tree_enumerate(t->child[1], opaque, cmp, enu); | |
167 | } | ||
168 | 13036 | } | |
169 |