FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavcodec/rl.c
Date: 2026-08-19 01:31:13
Exec Total Coverage
Lines: 66 66 100.0%
Functions: 3 3 100.0%
Branches: 32 34 94.1%
Line Branch Exec Source
1 /*
2 * This file is part of FFmpeg.
3 *
4 * FFmpeg 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.
8 *
9 * FFmpeg 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.
13 *
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with FFmpeg; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
17 */
18
19 #include <stdint.h>
20 #include <string.h>
21
22 #include "libavutil/attributes.h"
23
24 #include "rl.h"
25
26 86 av_cold void ff_rl_init_level_run(uint8_t max_level[MAX_LEVEL + 1],
27 uint8_t index_run[MAX_RUN + 1],
28 const uint8_t table_run[/* n */],
29 const uint8_t table_level[/* n*/],
30 int n)
31 {
32 86 memset(index_run, n, MAX_RUN + 1);
33
2/2
✓ Branch 0 taken 9636 times.
✓ Branch 1 taken 86 times.
 9722 for (int i = 0; i < n; i++) {
34 9636 int run = table_run[i];
35 9636 int level = table_level[i];
36
2/2
✓ Branch 0 taken 2752 times.
✓ Branch 1 taken 6884 times.
 9636 if (index_run[run] == n)
37 2752 index_run[run] = i;
38
1/2
✓ Branch 0 taken 9636 times.
✗ Branch 1 not taken.
 9636 if (level > max_level[run])
39 9636 max_level[run] = level;
40 }
41 86 }
42
43 712 av_cold void ff_rl_init(RLTable *rl,
44 uint8_t static_store[2][2 * MAX_RUN + MAX_LEVEL + 3])
45 {
46 int last, run, level, start, end, i;
47
48 /* compute max_level[], max_run[] and index_run[] */
49
2/2
✓ Branch 0 taken 1424 times.
✓ Branch 1 taken 712 times.
 2136 for (last = 0; last < 2; last++) {
50 1424 int8_t *max_level = static_store[last];
51 1424 int8_t *max_run = static_store[last] + MAX_RUN + 1;
52 1424 uint8_t *index_run = static_store[last] + MAX_RUN + 1 + MAX_LEVEL + 1;
53
2/2
✓ Branch 0 taken 712 times.
✓ Branch 1 taken 712 times.
 1424 if (last == 0) {
54 712 start = 0;
55 712 end = rl->last;
56 } else {
57 712 start = rl->last;
58 712 end = rl->n;
59 }
60
61 1424 memset(index_run, rl->n, MAX_RUN + 1);
62
2/2
✓ Branch 0 taken 82299 times.
✓ Branch 1 taken 1424 times.
 83723 for (i = start; i < end; i++) {
63 82299 run = rl->table_run[i];
64 82299 level = rl->table_level[i];
65
2/2
✓ Branch 0 taken 39289 times.
✓ Branch 1 taken 43010 times.
 82299 if (index_run[run] == rl->n)
66 39289 index_run[run] = i;
67
1/2
✓ Branch 0 taken 82299 times.
✗ Branch 1 not taken.
 82299 if (level > max_level[run])
68 82299 max_level[run] = level;
69
2/2
✓ Branch 0 taken 64671 times.
✓ Branch 1 taken 17628 times.
 82299 if (run > max_run[level])
70 64671 max_run[level] = run;
71 }
72 1424 rl->max_level[last] = max_level;
73 1424 rl->max_run[last] = max_run;
74 1424 rl->index_run[last] = index_run;
75 }
76 712 }
77
78 786 av_cold void ff_rl_init_vlc(RLTable *rl, unsigned static_size)
79 {
80 VLCElem *vlc;
81
82 786 ff_vlc_init_table_sparse(rl->rl_vlc[0], static_size, 9, rl->n + 1,
83 786 &rl->table_vlc[0][1], 4, 2,
84 786 &rl->table_vlc[0][0], 4, 2,
85 NULL, 0, 0, 0);
86
87 786 vlc = rl->rl_vlc[0];
88
89 // We count down to avoid trashing the first RL-VLC
90
2/2
✓ Branch 0 taken 25152 times.
✓ Branch 1 taken 786 times.
 25938 for (int q = 32; --q >= 0;) {
91 25152 int qmul = q * 2;
92 25152 int qadd = (q - 1) | 1;
93
94
2/2
✓ Branch 0 taken 14322 times.
✓ Branch 1 taken 10830 times.
 25152 if (!rl->rl_vlc[q])
95 14322 continue;
96
97
2/2
✓ Branch 0 taken 786 times.
✓ Branch 1 taken 10044 times.
 10830 if (q == 0) {
98 786 qmul = 1;
99 786 qadd = 0;
100 }
101
2/2
✓ Branch 0 taken 8471872 times.
✓ Branch 1 taken 10830 times.
 8482702 for (unsigned i = 0; i < static_size; i++) {
102 8471872 int idx = vlc[i].sym;
103 8471872 int len = vlc[i].len;
104 int level, run;
105
106
2/2
✓ Branch 0 taken 102669 times.
✓ Branch 1 taken 8369203 times.
 8471872 if (len == 0) { // illegal code
107 102669 run = 66;
108 102669 level = MAX_LEVEL;
109
2/2
✓ Branch 0 taken 159373 times.
✓ Branch 1 taken 8209830 times.
 8369203 } else if (len < 0) { // more bits needed
110 159373 run = 0;
111 159373 level = idx;
112 } else {
113
2/2
✓ Branch 0 taken 135298 times.
✓ Branch 1 taken 8074532 times.
 8209830 if (idx == rl->n) { // esc
114 135298 run = 66;
115 135298 level = 0;
116 } else {
117 8074532 run = rl->table_run[idx] + 1;
118 8074532 level = rl->table_level[idx] * qmul + qadd;
119
2/2
✓ Branch 0 taken 2425439 times.
✓ Branch 1 taken 5649093 times.
 8074532 if (idx >= rl->last) run += 192;
120 }
121 }
122 8471872 rl->rl_vlc[q][i].len8 = len;
123 8471872 rl->rl_vlc[q][i].level = level;
124 8471872 rl->rl_vlc[q][i].run = run;
125 }
126 }
127 786 }
128