FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavcodec/rl.c
Date: 2025-04-25 22:50:00
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 64 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 64 memset(index_run, n, MAX_RUN + 1);
33
2/2
✓ Branch 0 taken 7194 times.
✓ Branch 1 taken 64 times.
 7258 for (int i = 0; i < n; i++) {
34 7194 int run = table_run[i];
35 7194 int level = table_level[i];
36
2/2
✓ Branch 0 taken 2048 times.
✓ Branch 1 taken 5146 times.
 7194 if (index_run[run] == n)
37 2048 index_run[run] = i;
38
1/2
✓ Branch 0 taken 7194 times.
✗ Branch 1 not taken.
 7194 if (level > max_level[run])
39 7194 max_level[run] = level;
40 }
41 64 }
42
43 1031 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 2062 times.
✓ Branch 1 taken 1031 times.
 3093 for (last = 0; last < 2; last++) {
50 2062 int8_t *max_level = static_store[last];
51 2062 int8_t *max_run = static_store[last] + MAX_RUN + 1;
52 2062 uint8_t *index_run = static_store[last] + MAX_RUN + 1 + MAX_LEVEL + 1;
53
2/2
✓ Branch 0 taken 1031 times.
✓ Branch 1 taken 1031 times.
 2062 if (last == 0) {
54 1031 start = 0;
55 1031 end = rl->last;
56 } else {
57 1031 start = rl->last;
58 1031 end = rl->n;
59 }
60
61 2062 memset(index_run, rl->n, MAX_RUN + 1);
62
2/2
✓ Branch 0 taken 128639 times.
✓ Branch 1 taken 2062 times.
 130701 for (i = start; i < end; i++) {
63 128639 run = rl->table_run[i];
64 128639 level = rl->table_level[i];
65
2/2
✓ Branch 0 taken 60488 times.
✓ Branch 1 taken 68151 times.
 128639 if (index_run[run] == rl->n)
66 60488 index_run[run] = i;
67
1/2
✓ Branch 0 taken 128639 times.
✗ Branch 1 not taken.
 128639 if (level > max_level[run])
68 128639 max_level[run] = level;
69
2/2
✓ Branch 0 taken 102408 times.
✓ Branch 1 taken 26231 times.
 128639 if (run > max_run[level])
70 102408 max_run[level] = run;
71 }
72 2062 rl->max_level[last] = max_level;
73 2062 rl->max_run[last] = max_run;
74 2062 rl->index_run[last] = index_run;
75 }
76 1031 }
77
78 776 av_cold void ff_rl_init_vlc(RLTable *rl, unsigned static_size)
79 {
80 VLCElem *vlc;
81
82 776 ff_vlc_init_table_sparse(rl->rl_vlc[0], static_size, 9, rl->n + 1,
83 776 &rl->table_vlc[0][1], 4, 2,
84 776 &rl->table_vlc[0][0], 4, 2,
85 NULL, 0, 0, 0);
86
87 776 vlc = rl->rl_vlc[0];
88
89 // We count down to avoid trashing the first RL-VLC
90
2/2
✓ Branch 0 taken 24832 times.
✓ Branch 1 taken 776 times.
 25608 for (int q = 32; --q >= 0;) {
91 24832 int qmul = q * 2;
92 24832 int qadd = (q - 1) | 1;
93
94
2/2
✓ Branch 0 taken 14136 times.
✓ Branch 1 taken 10696 times.
 24832 if (!rl->rl_vlc[q])
95 14136 continue;
96
97
2/2
✓ Branch 0 taken 776 times.
✓ Branch 1 taken 9920 times.
 10696 if (q == 0) {
98 776 qmul = 1;
99 776 qadd = 0;
100 }
101
2/2
✓ Branch 0 taken 8363448 times.
✓ Branch 1 taken 10696 times.
 8374144 for (unsigned i = 0; i < static_size; i++) {
102 8363448 int idx = vlc[i].sym;
103 8363448 int len = vlc[i].len;
104 int level, run;
105
106
2/2
✓ Branch 0 taken 100753 times.
✓ Branch 1 taken 8262695 times.
 8363448 if (len == 0) { // illegal code
107 100753 run = 66;
108 100753 level = MAX_LEVEL;
109
2/2
✓ Branch 0 taken 157369 times.
✓ Branch 1 taken 8105326 times.
 8262695 } else if (len < 0) { // more bits needed
110 157369 run = 0;
111 157369 level = idx;
112 } else {
113
2/2
✓ Branch 0 taken 132914 times.
✓ Branch 1 taken 7972412 times.
 8105326 if (idx == rl->n) { // esc
114 132914 run = 66;
115 132914 level = 0;
116 } else {
117 7972412 run = rl->table_run[idx] + 1;
118 7972412 level = rl->table_level[idx] * qmul + qadd;
119
2/2
✓ Branch 0 taken 2399233 times.
✓ Branch 1 taken 5573179 times.
 7972412 if (idx >= rl->last) run += 192;
120 }
121 }
122 8363448 rl->rl_vlc[q][i].len8 = len;
123 8363448 rl->rl_vlc[q][i].level = level;
124 8363448 rl->rl_vlc[q][i].run = run;
125 }
126 }
127 776 }
128