Directory: | ../../../ffmpeg/ |
---|---|
File: | src/libavcodec/vorbis.c |
Date: | 2022-07-04 00:18:54 |
Exec | Total | Coverage | |
---|---|---|---|
Lines: | 108 | 118 | 91.5% |
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 | |||
31 | #include "avcodec.h" | ||
32 | #include "vorbis.h" | ||
33 | |||
34 | |||
35 | /* Helper functions */ | ||
36 | |||
37 | // x^(1/n) | ||
38 | 939 | unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n) | |
39 | { | ||
40 | 939 | unsigned int ret = 0, i, j; | |
41 | |||
42 | do { | ||
43 | 18546 | ++ret; | |
44 |
2/2✓ Branch 0 taken 14136 times.
✓ Branch 1 taken 18546 times.
|
32682 | for (i = 0, j = ret; i < n - 1; i++) |
45 | 14136 | j *= ret; | |
46 |
2/2✓ Branch 0 taken 17607 times.
✓ Branch 1 taken 939 times.
|
18546 | } while (j <= x); |
47 | |||
48 | 939 | return ret - 1; | |
49 | } | ||
50 | |||
51 | // Generate vlc codes from vorbis huffman code lengths | ||
52 | |||
53 | // the two bits[p] > 32 checks should be redundant, all calling code should | ||
54 | // already ensure that, but since it allows overwriting the stack it seems | ||
55 | // reasonable to check redundantly. | ||
56 | 2075 | int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, unsigned num) | |
57 | { | ||
58 | 2075 | uint32_t exit_at_level[33] = { 404 }; | |
59 | unsigned i, j, p, code; | ||
60 | |||
61 |
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) |
62 | ; | ||
63 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 2075 times.
|
2075 | if (p == num) |
64 | ✗ | return 0; | |
65 | |||
66 | 2075 | codes[p] = 0; | |
67 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 2075 times.
|
2075 | if (bits[p] > 32) |
68 | ✗ | return AVERROR_INVALIDDATA; | |
69 |
2/2✓ Branch 0 taken 7116 times.
✓ Branch 1 taken 2075 times.
|
9191 | for (i = 0; i < bits[p]; ++i) |
70 | 7116 | exit_at_level[i+1] = 1u << i; | |
71 | |||
72 | 2075 | ++p; | |
73 | |||
74 |
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) |
75 | ; | ||
76 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 2075 times.
|
2075 | if (i == num) |
77 | ✗ | return 0; | |
78 | |||
79 |
2/2✓ Branch 0 taken 411230 times.
✓ Branch 1 taken 2075 times.
|
413305 | for (; p < num; ++p) { |
80 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 411230 times.
|
411230 | if (bits[p] > 32) |
81 | ✗ | return AVERROR_INVALIDDATA; | |
82 |
2/2✓ Branch 0 taken 7798 times.
✓ Branch 1 taken 403432 times.
|
411230 | if (bits[p] == 0) |
83 | 7798 | continue; | |
84 | // find corresponding exit(node which the tree can grow further from) | ||
85 |
1/2✓ Branch 0 taken 799748 times.
✗ Branch 1 not taken.
|
799748 | for (i = bits[p]; i > 0; --i) |
86 |
2/2✓ Branch 0 taken 403432 times.
✓ Branch 1 taken 396316 times.
|
799748 | if (exit_at_level[i]) |
87 | 403432 | break; | |
88 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 403432 times.
|
403432 | if (!i) // overspecified tree |
89 | ✗ | return AVERROR_INVALIDDATA; | |
90 | 403432 | code = exit_at_level[i]; | |
91 | 403432 | exit_at_level[i] = 0; | |
92 | // construct code (append 0s to end) and introduce new exits | ||
93 |
2/2✓ Branch 0 taken 396316 times.
✓ Branch 1 taken 403432 times.
|
799748 | for (j = i + 1 ;j <= bits[p]; ++j) |
94 | 396316 | exit_at_level[j] = code + (1u << (j - 1)); | |
95 | 403432 | codes[p] = code; | |
96 | } | ||
97 | |||
98 | //no exits should be left (underspecified tree - ie. unused valid vlcs - not allowed by SPEC) | ||
99 |
2/2✓ Branch 0 taken 66400 times.
✓ Branch 1 taken 2075 times.
|
68475 | for (p = 1; p < 33; p++) |
100 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 66400 times.
|
66400 | if (exit_at_level[p]) |
101 | ✗ | return AVERROR_INVALIDDATA; | |
102 | |||
103 | 2075 | return 0; | |
104 | } | ||
105 | |||
106 | 89 | int ff_vorbis_ready_floor1_list(AVCodecContext *avctx, | |
107 | vorbis_floor1_entry *list, int values) | ||
108 | { | ||
109 | int i; | ||
110 | 89 | list[0].sort = 0; | |
111 | 89 | list[1].sort = 1; | |
112 |
2/2✓ Branch 0 taken 1645 times.
✓ Branch 1 taken 89 times.
|
1734 | for (i = 2; i < values; i++) { |
113 | int j; | ||
114 | 1645 | list[i].low = 0; | |
115 | 1645 | list[i].high = 1; | |
116 | 1645 | list[i].sort = i; | |
117 |
2/2✓ Branch 0 taken 19080 times.
✓ Branch 1 taken 1645 times.
|
20725 | for (j = 2; j < i; j++) { |
118 | 19080 | int tmp = list[j].x; | |
119 |
2/2✓ Branch 0 taken 13304 times.
✓ Branch 1 taken 5776 times.
|
19080 | if (tmp < list[i].x) { |
120 |
2/2✓ Branch 0 taken 2420 times.
✓ Branch 1 taken 10884 times.
|
13304 | if (tmp > list[list[i].low].x) |
121 | 2420 | list[i].low = j; | |
122 | } else { | ||
123 |
2/2✓ Branch 0 taken 2266 times.
✓ Branch 1 taken 3510 times.
|
5776 | if (tmp < list[list[i].high].x) |
124 | 2266 | list[i].high = j; | |
125 | } | ||
126 | } | ||
127 | } | ||
128 |
2/2✓ Branch 0 taken 1734 times.
✓ Branch 1 taken 89 times.
|
1823 | for (i = 0; i < values - 1; i++) { |
129 | int j; | ||
130 |
2/2✓ Branch 0 taken 22459 times.
✓ Branch 1 taken 1734 times.
|
24193 | for (j = i + 1; j < values; j++) { |
131 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 22459 times.
|
22459 | if (list[i].x == list[j].x) { |
132 | ✗ | av_log(avctx, AV_LOG_ERROR, | |
133 | "Duplicate value found in floor 1 X coordinates\n"); | ||
134 | ✗ | return AVERROR_INVALIDDATA; | |
135 | } | ||
136 |
2/2✓ Branch 0 taken 7421 times.
✓ Branch 1 taken 15038 times.
|
22459 | if (list[list[i].sort].x > list[list[j].sort].x) { |
137 | 7421 | int tmp = list[i].sort; | |
138 | 7421 | list[i].sort = list[j].sort; | |
139 | 7421 | list[j].sort = tmp; | |
140 | } | ||
141 | } | ||
142 | } | ||
143 | 89 | return 0; | |
144 | } | ||
145 | |||
146 | 78233 | static inline void render_line_unrolled(intptr_t x, int y, int x1, | |
147 | intptr_t sy, int ady, int adx, | ||
148 | float *buf) | ||
149 | { | ||
150 | 78233 | int err = -adx; | |
151 | 78233 | x -= x1 - 1; | |
152 | 78233 | buf += x1 - 1; | |
153 |
2/2✓ Branch 0 taken 6379412 times.
✓ Branch 1 taken 78233 times.
|
6457645 | while (++x < 0) { |
154 | 6379412 | err += ady; | |
155 |
2/2✓ Branch 0 taken 657532 times.
✓ Branch 1 taken 5721880 times.
|
6379412 | if (err >= 0) { |
156 | 657532 | err += ady - adx; | |
157 | 657532 | y += sy; | |
158 | 657532 | buf[x++] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)]; | |
159 | } | ||
160 | 6379412 | buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)]; | |
161 | } | ||
162 |
2/2✓ Branch 0 taken 65495 times.
✓ Branch 1 taken 12738 times.
|
78233 | if (x <= 0) { |
163 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 65495 times.
|
65495 | if (err + ady >= 0) |
164 | ✗ | y += sy; | |
165 | 65495 | buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)]; | |
166 | } | ||
167 | 78233 | } | |
168 | |||
169 | 130102 | static void render_line(int x0, int y0, int x1, int y1, float *buf) | |
170 | { | ||
171 | 130102 | int dy = y1 - y0; | |
172 | 130102 | int adx = x1 - x0; | |
173 | 130102 | int ady = FFABS(dy); | |
174 |
2/2✓ Branch 0 taken 68943 times.
✓ Branch 1 taken 61159 times.
|
130102 | int sy = dy < 0 ? -1 : 1; |
175 | 130102 | buf[x0] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y0)]; | |
176 |
2/2✓ Branch 0 taken 78233 times.
✓ Branch 1 taken 51869 times.
|
130102 | if (ady*2 <= adx) { // optimized common case |
177 | 78233 | render_line_unrolled(x0, y0, x1, sy, ady, adx, buf); | |
178 | } else { | ||
179 | 51869 | int base = dy / adx; | |
180 | 51869 | int x = x0; | |
181 | 51869 | int y = y0; | |
182 | 51869 | int err = -adx; | |
183 | 51869 | ady -= FFABS(base) * adx; | |
184 |
2/2✓ Branch 0 taken 598067 times.
✓ Branch 1 taken 51869 times.
|
649936 | while (++x < x1) { |
185 | 598067 | y += base; | |
186 | 598067 | err += ady; | |
187 |
2/2✓ Branch 0 taken 290455 times.
✓ Branch 1 taken 307612 times.
|
598067 | if (err >= 0) { |
188 | 290455 | err -= adx; | |
189 | 290455 | y += sy; | |
190 | } | ||
191 | 598067 | buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)]; | |
192 | } | ||
193 | } | ||
194 | 130102 | } | |
195 | |||
196 | 10284 | void ff_vorbis_floor1_render_list(vorbis_floor1_entry * list, int values, | |
197 | uint16_t *y_list, int *flag, | ||
198 | int multiplier, float *out, int samples) | ||
199 | { | ||
200 | int lx, ly, i; | ||
201 | 10284 | lx = 0; | |
202 | 10284 | ly = y_list[0] * multiplier; | |
203 |
1/2✓ Branch 0 taken 248908 times.
✗ Branch 1 not taken.
|
248908 | for (i = 1; i < values; i++) { |
204 | 248908 | int pos = list[i].sort; | |
205 |
2/2✓ Branch 0 taken 130102 times.
✓ Branch 1 taken 118806 times.
|
248908 | if (flag[pos]) { |
206 | 130102 | int x1 = list[pos].x; | |
207 | 130102 | int y1 = y_list[pos] * multiplier; | |
208 |
1/2✓ Branch 0 taken 130102 times.
✗ Branch 1 not taken.
|
130102 | if (lx < samples) |
209 | 130102 | render_line(lx, ly, FFMIN(x1,samples), y1, out); | |
210 | 130102 | lx = x1; | |
211 | 130102 | ly = y1; | |
212 | } | ||
213 |
2/2✓ Branch 0 taken 10284 times.
✓ Branch 1 taken 238624 times.
|
248908 | if (lx >= samples) |
214 | 10284 | break; | |
215 | } | ||
216 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 10284 times.
|
10284 | if (lx < samples) |
217 | ✗ | render_line(lx, ly, samples, ly, out); | |
218 | 10284 | } | |
219 |