FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/tests/checkasm/ext/src/function.c
Date: 2026-08-15 14:54:27
Exec Total Coverage
Lines: 66 66 100.0%
Functions: 7 7 100.0%
Branches: 62 64 96.9%
Line Branch Exec Source
1 /*
2 * Copyright © 2025, Niklas Haas
3 * Copyright © 2018, VideoLAN and dav1d authors
4 * Copyright © 2018, Two Orioles, LLC
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions are met:
9 *
10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer.
12 *
13 * 2. Redistributions in binary form must reproduce the above copyright notice,
14 * this list of conditions and the following disclaimer in the documentation
15 * and/or other materials provided with the distribution.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27 * POSSIBILITY OF SUCH DAMAGE.
28 */
29
30 #include <stdio.h>
31 #include <stdlib.h>
32
33 #include "function.h"
34 #include "internal.h"
35
36 /* Deallocate a tree */
37 26831 static void func_uninit(CheckasmFunc *const f)
38 {
39
2/2
✓ Branch 0 taken 13465 times.
✓ Branch 1 taken 13366 times.
 26831 if (!f)
40 13465 return;
41
42 13366 CheckasmFuncVersion *v = f->versions.next;
43
2/2
✓ Branch 0 taken 15371 times.
✓ Branch 1 taken 13366 times.
 28737 while (v) {
44 15371 CheckasmFuncVersion *next = v->next;
45 15371 free(v->suffix);
46 15371 free(v);
47 15371 v = next;
48 }
49
50 13366 CheckasmFunc *const left = f->child[0];
51 13366 CheckasmFunc *const right = f->child[1];
52 13366 free(f->report_name);
53 13366 free(f);
54
55 13366 func_uninit(right);
56 13366 func_uninit(left);
57 }
58
59 99 void checkasm_func_tree_uninit(CheckasmFuncTree *tree)
60 {
61 99 func_uninit(tree->root);
62 99 memset(tree, 0, sizeof(*tree));
63 99 }
64
65 #define is_digit(x) ((x) >= '0' && (x) <= '9')
66
67 /* ASCIIbetical sort except preserving natural order for numbers */
68 1817918 static int cmp_func_names(const char *a, const char *b)
69 {
70 1817918 const char *const start = a;
71
72 int ascii_diff, digit_diff;
73
4/4
✓ Branch 0 taken 30628228 times.
✓ Branch 1 taken 1636381 times.
✓ Branch 2 taken 30446691 times.
✓ Branch 3 taken 181537 times.
 32264609 for (; !(ascii_diff = *(const unsigned char *) a - *(const unsigned char *) b) && *a;
74 30446691 a++, b++)
75 ;
76
8/8
✓ Branch 0 taken 3045194 times.
✓ Branch 1 taken 288294 times.
✓ Branch 2 taken 1804601 times.
✓ Branch 3 taken 1240593 times.
✓ Branch 4 taken 1719058 times.
✓ Branch 5 taken 85543 times.
✓ Branch 6 taken 1515570 times.
✓ Branch 7 taken 203488 times.
 3333488 for (; is_digit(*a) && is_digit(*b); a++, b++)
77 ;
78
79
16/16
✓ Branch 0 taken 1744135 times.
✓ Branch 1 taken 73783 times.
✓ Branch 2 taken 1742232 times.
✓ Branch 3 taken 1903 times.
✓ Branch 4 taken 1234642 times.
✓ Branch 5 taken 507590 times.
✓ Branch 6 taken 988278 times.
✓ Branch 7 taken 246364 times.
✓ Branch 8 taken 258036 times.
✓ Branch 9 taken 730242 times.
✓ Branch 10 taken 928744 times.
✓ Branch 11 taken 305898 times.
✓ Branch 12 taken 185693 times.
✓ Branch 13 taken 743051 times.
✓ Branch 14 taken 443729 times.
✓ Branch 15 taken 790913 times.
 1817918 if (a > start && is_digit(a[-1]) && (digit_diff = is_digit(*a) - is_digit(*b)))
80 443729 return digit_diff;
81
82 1374189 return ascii_diff;
83 }
84
85 /* Perform a tree rotation in the specified direction and return the new root */
86 12874 static CheckasmFunc *tree_rotate(CheckasmFunc *const f, const int dir)
87 {
88 12874 CheckasmFunc *const r = f->child[dir ^ 1];
89
90 12874 f->child[dir ^ 1] = r->child[dir];
91 12874 r->child[dir] = f;
92 12874 r->color = f->color;
93 12874 f->color = 0;
94 12874 return r;
95 }
96
97 #define is_red(f) ((f) && !(f)->color)
98
99 /* Balance a left-leaning red-black tree at the specified node */
100 121422 static void tree_balance(CheckasmFunc **const root)
101 {
102 121422 CheckasmFunc *const f = *root;
103
104
8/8
✓ Branch 0 taken 115288 times.
✓ Branch 1 taken 6134 times.
✓ Branch 2 taken 48774 times.
✓ Branch 3 taken 66514 times.
✓ Branch 4 taken 43661 times.
✓ Branch 5 taken 5113 times.
✓ Branch 6 taken 9611 times.
✓ Branch 7 taken 34050 times.
 121422 if (is_red(f->child[0]) && is_red(f->child[1])) {
105 9611 f->color ^= 1;
106 9611 f->child[0]->color = f->child[1]->color = 1;
107
7/8
✓ Branch 0 taken 105677 times.
✓ Branch 1 taken 6134 times.
✓ Branch 2 taken 66514 times.
✓ Branch 3 taken 39163 times.
✓ Branch 4 taken 72648 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 9347 times.
✓ Branch 7 taken 63301 times.
 111811 } else if (!is_red(f->child[0]) && is_red(f->child[1]))
108 9347 *root = tree_rotate(f, 0); /* Rotate left */
109
7/8
✓ Branch 0 taken 102464 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 39163 times.
✓ Branch 3 taken 63301 times.
✓ Branch 4 taken 35842 times.
✓ Branch 5 taken 3321 times.
✓ Branch 6 taken 3527 times.
✓ Branch 7 taken 32315 times.
 102464 else if (is_red(f->child[0]) && is_red(f->child[0]->child[0]))
110 3527 *root = tree_rotate(f, 1); /* Rotate right */
111 121422 }
112
113 /* Get a node with the specified name, creating it if it doesn't exist; returns
114 * 1 if a new node was inserted, 0 otherwise. */
115 1831284 static int func_get(CheckasmFunc **const root, const char *const name,
116 CheckasmFunc **const out_func)
117 {
118 1831284 CheckasmFunc *f = *root;
119
2/2
✓ Branch 0 taken 13366 times.
✓ Branch 1 taken 1817918 times.
 1831284 if (!f) {
120 /* Allocate and insert a new node into the tree */
121 13366 const size_t name_length = strlen(name) + 1;
122 13366 f = checkasm_mallocz(offsetof(CheckasmFunc, name) + name_length);
123 13366 memcpy(f->name, name, name_length);
124 13366 *out_func = *root = f;
125 13366 return 1;
126 }
127
128 /* Search the tree for a matching node */
129 1817918 const int cmp = cmp_func_names(name, f->name);
130
2/2
✓ Branch 0 taken 181537 times.
✓ Branch 1 taken 1636381 times.
 1817918 if (!cmp) {
131 181537 *out_func = f;
132 181537 return 0;
133 }
134
135 1636381 int inserted = func_get(&f->child[cmp > 0], name, out_func);
136
2/2
✓ Branch 0 taken 121422 times.
✓ Branch 1 taken 1514959 times.
 1636381 if (inserted)
137 121422 tree_balance(root); /* Rebalance the tree on the way up */
138 1636381 return inserted;
139 }
140
141 194903 CheckasmFunc *checkasm_func_get(CheckasmFuncTree *tree, const char *const name)
142 {
143 194903 CheckasmFunc *func = NULL;
144 194903 int inserted = func_get(&tree->root, name, &func);
145
2/2
✓ Branch 0 taken 13366 times.
✓ Branch 1 taken 181537 times.
 194903 if (inserted)
146 13366 tree->root->color = 1; /* Ensure root is black */
147 194903 return func;
148 }
149