FFmpeg coverage


Directory: ../../../ffmpeg/
File: src/libavcodec/vorbis.c
Date: 2024-04-19 07:31:02
Exec Total Coverage
Lines: 108 118 91.5%
Functions: 6 6 100.0%
Branches: 67 82 81.7%

Line Branch Exec Source
1 /**
2 * @file
3 * Common code for Vorbis I encoder and decoder
4 * @author Denes Balatoni ( dbalatoni programozo hu )
5 *
6 * This file is part of FFmpeg.
7 *
8 * FFmpeg is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
12 *
13 * FFmpeg is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
17 *
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with FFmpeg; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 */
22
23 /**
24 * @file
25 * Common code for Vorbis I encoder and decoder
26 * @author Denes Balatoni ( dbalatoni programozo hu )
27 */
28
29 #include "libavutil/common.h"
30 #include "libavutil/error.h"
31 #include "libavutil/log.h"
32 #include "libavutil/macros.h"
33
34 #include "vorbis.h"
35 #include "vorbis_data.h"
36
37
38 /* Helper functions */
39
40 // x^(1/n)
41 939 unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n)
42 {
43 939 unsigned int ret = 0, i, j;
44
45 do {
46 18546 ++ret;
47
2/2
✓ Branch 0 taken 14136 times.
✓ Branch 1 taken 18546 times.
32682 for (i = 0, j = ret; i < n - 1; i++)
48 14136 j *= ret;
49
2/2
✓ Branch 0 taken 17607 times.
✓ Branch 1 taken 939 times.
18546 } while (j <= x);
50
51 939 return ret - 1;
52 }
53
54 // Generate vlc codes from vorbis huffman code lengths
55
56 // the two bits[p] > 32 checks should be redundant, all calling code should
57 // already ensure that, but since it allows overwriting the stack it seems
58 // reasonable to check redundantly.
59 2075 int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, unsigned num)
60 {
61 2075 uint32_t exit_at_level[33] = { 404 };
62 unsigned i, j, p, code;
63
64
3/4
✓ Branch 0 taken 14397 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 12322 times.
✓ Branch 3 taken 2075 times.
14397 for (p = 0; (p < num) && (bits[p] == 0); ++p)
65 ;
66
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2075 times.
2075 if (p == num)
67 return 0;
68
69 2075 codes[p] = 0;
70
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2075 times.
2075 if (bits[p] > 32)
71 return AVERROR_INVALIDDATA;
72
2/2
✓ Branch 0 taken 7116 times.
✓ Branch 1 taken 2075 times.
9191 for (i = 0; i < bits[p]; ++i)
73 7116 exit_at_level[i+1] = 1u << i;
74
75 2075 ++p;
76
77
2/4
✓ Branch 0 taken 2075 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 2075 times.
2075 for (i = p; (i < num) && (bits[i] == 0); ++i)
78 ;
79
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2075 times.
2075 if (i == num)
80 return 0;
81
82
2/2
✓ Branch 0 taken 411230 times.
✓ Branch 1 taken 2075 times.
413305 for (; p < num; ++p) {
83
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 411230 times.
411230 if (bits[p] > 32)
84 return AVERROR_INVALIDDATA;
85
2/2
✓ Branch 0 taken 7798 times.
✓ Branch 1 taken 403432 times.
411230 if (bits[p] == 0)
86 7798 continue;
87 // find corresponding exit(node which the tree can grow further from)
88
1/2
✓ Branch 0 taken 799748 times.
✗ Branch 1 not taken.
799748 for (i = bits[p]; i > 0; --i)
89
2/2
✓ Branch 0 taken 403432 times.
✓ Branch 1 taken 396316 times.
799748 if (exit_at_level[i])
90 403432 break;
91
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 403432 times.
403432 if (!i) // overspecified tree
92 return AVERROR_INVALIDDATA;
93 403432 code = exit_at_level[i];
94 403432 exit_at_level[i] = 0;
95 // construct code (append 0s to end) and introduce new exits
96
2/2
✓ Branch 0 taken 396316 times.
✓ Branch 1 taken 403432 times.
799748 for (j = i + 1 ;j <= bits[p]; ++j)
97 396316 exit_at_level[j] = code + (1u << (j - 1));
98 403432 codes[p] = code;
99 }
100
101 //no exits should be left (underspecified tree - ie. unused valid vlcs - not allowed by SPEC)
102
2/2
✓ Branch 0 taken 66400 times.
✓ Branch 1 taken 2075 times.
68475 for (p = 1; p < 33; p++)
103
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 66400 times.
66400 if (exit_at_level[p])
104 return AVERROR_INVALIDDATA;
105
106 2075 return 0;
107 }
108
109 89 int ff_vorbis_ready_floor1_list(void *logctx,
110 vorbis_floor1_entry *list, int values)
111 {
112 int i;
113 89 list[0].sort = 0;
114 89 list[1].sort = 1;
115
2/2
✓ Branch 0 taken 1645 times.
✓ Branch 1 taken 89 times.
1734 for (i = 2; i < values; i++) {
116 int j;
117 1645 list[i].low = 0;
118 1645 list[i].high = 1;
119 1645 list[i].sort = i;
120
2/2
✓ Branch 0 taken 19080 times.
✓ Branch 1 taken 1645 times.
20725 for (j = 2; j < i; j++) {
121 19080 int tmp = list[j].x;
122
2/2
✓ Branch 0 taken 13304 times.
✓ Branch 1 taken 5776 times.
19080 if (tmp < list[i].x) {
123
2/2
✓ Branch 0 taken 2420 times.
✓ Branch 1 taken 10884 times.
13304 if (tmp > list[list[i].low].x)
124 2420 list[i].low = j;
125 } else {
126
2/2
✓ Branch 0 taken 2266 times.
✓ Branch 1 taken 3510 times.
5776 if (tmp < list[list[i].high].x)
127 2266 list[i].high = j;
128 }
129 }
130 }
131
2/2
✓ Branch 0 taken 1734 times.
✓ Branch 1 taken 89 times.
1823 for (i = 0; i < values - 1; i++) {
132 int j;
133
2/2
✓ Branch 0 taken 22459 times.
✓ Branch 1 taken 1734 times.
24193 for (j = i + 1; j < values; j++) {
134
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 22459 times.
22459 if (list[i].x == list[j].x) {
135 av_log(logctx, AV_LOG_ERROR,
136 "Duplicate value found in floor 1 X coordinates\n");
137 return AVERROR_INVALIDDATA;
138 }
139
2/2
✓ Branch 0 taken 7421 times.
✓ Branch 1 taken 15038 times.
22459 if (list[list[i].sort].x > list[list[j].sort].x) {
140 7421 int tmp = list[i].sort;
141 7421 list[i].sort = list[j].sort;
142 7421 list[j].sort = tmp;
143 }
144 }
145 }
146 89 return 0;
147 }
148
149 78233 static inline void render_line_unrolled(intptr_t x, int y, int x1,
150 intptr_t sy, int ady, int adx,
151 float *buf)
152 {
153 78233 int err = -adx;
154 78233 x -= x1 - 1;
155 78233 buf += x1 - 1;
156
2/2
✓ Branch 0 taken 6379412 times.
✓ Branch 1 taken 78233 times.
6457645 while (++x < 0) {
157 6379412 err += ady;
158
2/2
✓ Branch 0 taken 657532 times.
✓ Branch 1 taken 5721880 times.
6379412 if (err >= 0) {
159 657532 err += ady - adx;
160 657532 y += sy;
161 657532 buf[x++] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)];
162 }
163 6379412 buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)];
164 }
165
2/2
✓ Branch 0 taken 65495 times.
✓ Branch 1 taken 12738 times.
78233 if (x <= 0) {
166
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 65495 times.
65495 if (err + ady >= 0)
167 y += sy;
168 65495 buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)];
169 }
170 78233 }
171
172 130102 static void render_line(int x0, int y0, int x1, int y1, float *buf)
173 {
174 130102 int dy = y1 - y0;
175 130102 int adx = x1 - x0;
176 130102 int ady = FFABS(dy);
177
2/2
✓ Branch 0 taken 68943 times.
✓ Branch 1 taken 61159 times.
130102 int sy = dy < 0 ? -1 : 1;
178 130102 buf[x0] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y0)];
179
2/2
✓ Branch 0 taken 78233 times.
✓ Branch 1 taken 51869 times.
130102 if (ady*2 <= adx) { // optimized common case
180 78233 render_line_unrolled(x0, y0, x1, sy, ady, adx, buf);
181 } else {
182 51869 int base = dy / adx;
183 51869 int x = x0;
184 51869 int y = y0;
185 51869 int err = -adx;
186 51869 ady -= FFABS(base) * adx;
187
2/2
✓ Branch 0 taken 598067 times.
✓ Branch 1 taken 51869 times.
649936 while (++x < x1) {
188 598067 y += base;
189 598067 err += ady;
190
2/2
✓ Branch 0 taken 290455 times.
✓ Branch 1 taken 307612 times.
598067 if (err >= 0) {
191 290455 err -= adx;
192 290455 y += sy;
193 }
194 598067 buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)];
195 }
196 }
197 130102 }
198
199 10284 void ff_vorbis_floor1_render_list(vorbis_floor1_entry * list, int values,
200 uint16_t *y_list, int *flag,
201 int multiplier, float *out, int samples)
202 {
203 int lx, ly, i;
204 10284 lx = 0;
205 10284 ly = y_list[0] * multiplier;
206
1/2
✓ Branch 0 taken 248908 times.
✗ Branch 1 not taken.
248908 for (i = 1; i < values; i++) {
207 248908 int pos = list[i].sort;
208
2/2
✓ Branch 0 taken 130102 times.
✓ Branch 1 taken 118806 times.
248908 if (flag[pos]) {
209 130102 int x1 = list[pos].x;
210 130102 int y1 = y_list[pos] * multiplier;
211
1/2
✓ Branch 0 taken 130102 times.
✗ Branch 1 not taken.
130102 if (lx < samples)
212 130102 render_line(lx, ly, FFMIN(x1,samples), y1, out);
213 130102 lx = x1;
214 130102 ly = y1;
215 }
216
2/2
✓ Branch 0 taken 10284 times.
✓ Branch 1 taken 238624 times.
248908 if (lx >= samples)
217 10284 break;
218 }
219
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 10284 times.
10284 if (lx < samples)
220 render_line(lx, ly, samples, ly, out);
221 10284 }
222