Line | Branch | Exec | Source |
---|---|---|---|
1 | /* | ||
2 | * Windows Media Audio Lossless decoder | ||
3 | * Copyright (c) 2007 Baptiste Coudurier, Benjamin Larsson, Ulion | ||
4 | * Copyright (c) 2008 - 2011 Sascha Sommer, Benjamin Larsson | ||
5 | * Copyright (c) 2011 Andreas Ă–man | ||
6 | * Copyright (c) 2011 - 2012 Mashiat Sarker Shakkhar | ||
7 | * | ||
8 | * This file is part of FFmpeg. | ||
9 | * | ||
10 | * FFmpeg is free software; you can redistribute it and/or | ||
11 | * modify it under the terms of the GNU Lesser General Public | ||
12 | * License as published by the Free Software Foundation; either | ||
13 | * version 2.1 of the License, or (at your option) any later version. | ||
14 | * | ||
15 | * FFmpeg is distributed in the hope that it will be useful, | ||
16 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
17 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
18 | * Lesser General Public License for more details. | ||
19 | * | ||
20 | * You should have received a copy of the GNU Lesser General Public | ||
21 | * License along with FFmpeg; if not, write to the Free Software | ||
22 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | ||
23 | */ | ||
24 | |||
25 | #include <inttypes.h> | ||
26 | |||
27 | #include "libavutil/attributes.h" | ||
28 | #include "libavutil/avassert.h" | ||
29 | #include "libavutil/mem.h" | ||
30 | #include "libavutil/mem_internal.h" | ||
31 | |||
32 | #include "avcodec.h" | ||
33 | #include "codec_internal.h" | ||
34 | #include "decode.h" | ||
35 | #include "get_bits.h" | ||
36 | #include "put_bits.h" | ||
37 | #include "lossless_audiodsp.h" | ||
38 | #include "wma_common.h" | ||
39 | |||
40 | /** current decoder limitations */ | ||
41 | #define WMALL_MAX_CHANNELS 8 ///< max number of handled channels | ||
42 | #define MAX_SUBFRAMES 32 ///< max number of subframes per channel | ||
43 | #define MAX_BANDS 29 ///< max number of scale factor bands | ||
44 | #define MAX_FRAMESIZE 32768 ///< maximum compressed frame size | ||
45 | #define MAX_ORDER 256 | ||
46 | |||
47 | #define WMALL_BLOCK_MIN_BITS 6 ///< log2 of min block size | ||
48 | #define WMALL_BLOCK_MAX_BITS 14 ///< log2 of max block size | ||
49 | #define WMALL_BLOCK_MAX_SIZE (1 << WMALL_BLOCK_MAX_BITS) ///< maximum block size | ||
50 | #define WMALL_BLOCK_SIZES (WMALL_BLOCK_MAX_BITS - WMALL_BLOCK_MIN_BITS + 1) ///< possible block sizes | ||
51 | |||
52 | #define WMALL_COEFF_PAD_SIZE 16 ///< pad coef buffers with 0 for use with SIMD | ||
53 | |||
54 | /** | ||
55 | * @brief frame-specific decoder context for a single channel | ||
56 | */ | ||
57 | typedef struct WmallChannelCtx { | ||
58 | int16_t prev_block_len; ///< length of the previous block | ||
59 | uint8_t transmit_coefs; | ||
60 | uint8_t num_subframes; | ||
61 | uint16_t subframe_len[MAX_SUBFRAMES]; ///< subframe length in samples | ||
62 | uint16_t subframe_offsets[MAX_SUBFRAMES]; ///< subframe positions in the current frame | ||
63 | uint8_t cur_subframe; ///< current subframe number | ||
64 | uint16_t decoded_samples; ///< number of already processed samples | ||
65 | int quant_step; ///< quantization step for the current subframe | ||
66 | int transient_counter; ///< number of transient samples from the beginning of the transient zone | ||
67 | } WmallChannelCtx; | ||
68 | |||
69 | /** | ||
70 | * @brief main decoder context | ||
71 | */ | ||
72 | typedef struct WmallDecodeCtx { | ||
73 | /* generic decoder variables */ | ||
74 | AVCodecContext *avctx; | ||
75 | AVFrame *frame; | ||
76 | LLAudDSPContext dsp; ///< accelerated DSP functions | ||
77 | uint8_t *frame_data; ///< compressed frame data | ||
78 | int max_frame_size; ///< max bitstream size | ||
79 | PutBitContext pb; ///< context for filling the frame_data buffer | ||
80 | |||
81 | /* frame size dependent frame information (set during initialization) */ | ||
82 | uint32_t decode_flags; ///< used compression features | ||
83 | int len_prefix; ///< frame is prefixed with its length | ||
84 | int dynamic_range_compression; ///< frame contains DRC data | ||
85 | uint8_t bits_per_sample; ///< integer audio sample size for the unscaled IMDCT output (used to scale to [-1.0, 1.0]) | ||
86 | uint16_t samples_per_frame; ///< number of samples to output | ||
87 | uint16_t log2_frame_size; | ||
88 | int8_t num_channels; ///< number of channels in the stream (same as AVCodecContext.num_channels) | ||
89 | int8_t lfe_channel; ///< lfe channel index | ||
90 | uint8_t max_num_subframes; | ||
91 | uint8_t subframe_len_bits; ///< number of bits used for the subframe length | ||
92 | uint8_t max_subframe_len_bit; ///< flag indicating that the subframe is of maximum size when the first subframe length bit is 1 | ||
93 | uint16_t min_samples_per_subframe; | ||
94 | |||
95 | /* packet decode state */ | ||
96 | GetBitContext pgb; ///< bitstream reader context for the packet | ||
97 | int next_packet_start; ///< start offset of the next WMA packet in the demuxer packet | ||
98 | uint8_t packet_offset; ///< offset to the frame in the packet | ||
99 | uint8_t packet_sequence_number; ///< current packet number | ||
100 | int num_saved_bits; ///< saved number of bits | ||
101 | int frame_offset; ///< frame offset in the bit reservoir | ||
102 | int subframe_offset; ///< subframe offset in the bit reservoir | ||
103 | uint8_t packet_loss; ///< set in case of bitstream error | ||
104 | uint8_t packet_done; ///< set when a packet is fully decoded | ||
105 | |||
106 | /* frame decode state */ | ||
107 | uint32_t frame_num; ///< current frame number (not used for decoding) | ||
108 | GetBitContext gb; ///< bitstream reader context | ||
109 | int buf_bit_size; ///< buffer size in bits | ||
110 | int16_t *samples_16[WMALL_MAX_CHANNELS]; ///< current sample buffer pointer (16-bit) | ||
111 | int32_t *samples_32[WMALL_MAX_CHANNELS]; ///< current sample buffer pointer (24-bit) | ||
112 | uint8_t drc_gain; ///< gain for the DRC tool | ||
113 | int8_t skip_frame; ///< skip output step | ||
114 | int8_t parsed_all_subframes; ///< all subframes decoded? | ||
115 | |||
116 | /* subframe/block decode state */ | ||
117 | int16_t subframe_len; ///< current subframe length | ||
118 | int8_t channels_for_cur_subframe; ///< number of channels that contain the subframe | ||
119 | int8_t channel_indexes_for_cur_subframe[WMALL_MAX_CHANNELS]; | ||
120 | |||
121 | WmallChannelCtx channel[WMALL_MAX_CHANNELS]; ///< per channel data | ||
122 | |||
123 | // WMA Lossless-specific | ||
124 | |||
125 | uint8_t do_arith_coding; | ||
126 | uint8_t do_ac_filter; | ||
127 | uint8_t do_inter_ch_decorr; | ||
128 | uint8_t do_mclms; | ||
129 | uint8_t do_lpc; | ||
130 | |||
131 | int8_t acfilter_order; | ||
132 | int8_t acfilter_scaling; | ||
133 | int16_t acfilter_coeffs[16]; | ||
134 | int acfilter_prevvalues[WMALL_MAX_CHANNELS][16]; | ||
135 | |||
136 | int8_t mclms_order; | ||
137 | int8_t mclms_scaling; | ||
138 | int16_t mclms_coeffs[WMALL_MAX_CHANNELS * WMALL_MAX_CHANNELS * 32]; | ||
139 | int16_t mclms_coeffs_cur[WMALL_MAX_CHANNELS * WMALL_MAX_CHANNELS]; | ||
140 | int32_t mclms_prevvalues[WMALL_MAX_CHANNELS * 2 * 32]; | ||
141 | int32_t mclms_updates[WMALL_MAX_CHANNELS * 2 * 32]; | ||
142 | int mclms_recent; | ||
143 | |||
144 | int movave_scaling; | ||
145 | int quant_stepsize; | ||
146 | |||
147 | struct { | ||
148 | int order; | ||
149 | int scaling; | ||
150 | int coefsend; | ||
151 | int bitsend; | ||
152 | DECLARE_ALIGNED(16, int16_t, coefs)[MAX_ORDER + WMALL_COEFF_PAD_SIZE/sizeof(int16_t)]; | ||
153 | DECLARE_ALIGNED(16, int32_t, lms_prevvalues)[MAX_ORDER * 2 + WMALL_COEFF_PAD_SIZE/sizeof(int16_t)]; | ||
154 | DECLARE_ALIGNED(16, int16_t, lms_updates)[MAX_ORDER * 2 + WMALL_COEFF_PAD_SIZE/sizeof(int16_t)]; | ||
155 | int recent; | ||
156 | } cdlms[WMALL_MAX_CHANNELS][9]; | ||
157 | |||
158 | int cdlms_ttl[WMALL_MAX_CHANNELS]; | ||
159 | |||
160 | int bV3RTM; | ||
161 | |||
162 | int is_channel_coded[WMALL_MAX_CHANNELS]; | ||
163 | int update_speed[WMALL_MAX_CHANNELS]; | ||
164 | |||
165 | int transient[WMALL_MAX_CHANNELS]; | ||
166 | int transient_pos[WMALL_MAX_CHANNELS]; | ||
167 | int seekable_tile; | ||
168 | |||
169 | unsigned ave_sum[WMALL_MAX_CHANNELS]; | ||
170 | |||
171 | int channel_residues[WMALL_MAX_CHANNELS][WMALL_BLOCK_MAX_SIZE]; | ||
172 | |||
173 | int lpc_coefs[WMALL_MAX_CHANNELS][40]; | ||
174 | int lpc_order; | ||
175 | int lpc_scaling; | ||
176 | int lpc_intbits; | ||
177 | } WmallDecodeCtx; | ||
178 | |||
179 | /** Get sign of integer (1 for positive, -1 for negative and 0 for zero) */ | ||
180 | #define WMASIGN(x) (((x) > 0) - ((x) < 0)) | ||
181 | |||
182 | 8 | static av_cold int decode_init(AVCodecContext *avctx) | |
183 | { | ||
184 | 8 | WmallDecodeCtx *s = avctx->priv_data; | |
185 | 8 | uint8_t *edata_ptr = avctx->extradata; | |
186 | unsigned int channel_mask; | ||
187 | int i, log2_max_num_subframes; | ||
188 | |||
189 |
2/4✓ Branch 0 taken 8 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 8 times.
|
8 | if (avctx->block_align <= 0 || avctx->block_align > (1<<21)) { |
190 | ✗ | av_log(avctx, AV_LOG_ERROR, "block_align is not set or invalid\n"); | |
191 | ✗ | return AVERROR(EINVAL); | |
192 | } | ||
193 | |||
194 |
1/2✓ Branch 0 taken 8 times.
✗ Branch 1 not taken.
|
8 | if (avctx->extradata_size >= 18) { |
195 | 8 | s->decode_flags = AV_RL16(edata_ptr + 14); | |
196 | 8 | channel_mask = AV_RL32(edata_ptr + 2); | |
197 | 8 | s->bits_per_sample = AV_RL16(edata_ptr); | |
198 |
2/2✓ Branch 0 taken 2 times.
✓ Branch 1 taken 6 times.
|
8 | if (s->bits_per_sample == 16) |
199 | 2 | avctx->sample_fmt = AV_SAMPLE_FMT_S16P; | |
200 |
1/2✓ Branch 0 taken 6 times.
✗ Branch 1 not taken.
|
6 | else if (s->bits_per_sample == 24) { |
201 | 6 | avctx->sample_fmt = AV_SAMPLE_FMT_S32P; | |
202 | 6 | avctx->bits_per_raw_sample = 24; | |
203 | } else { | ||
204 | ✗ | av_log(avctx, AV_LOG_ERROR, "Unknown bit-depth: %"PRIu8"\n", | |
205 | ✗ | s->bits_per_sample); | |
206 | ✗ | return AVERROR_INVALIDDATA; | |
207 | } | ||
208 | /* dump the extradata */ | ||
209 |
2/2✓ Branch 0 taken 144 times.
✓ Branch 1 taken 8 times.
|
152 | for (i = 0; i < avctx->extradata_size; i++) |
210 | ff_dlog(avctx, "[%x] ", avctx->extradata[i]); | ||
211 | ff_dlog(avctx, "\n"); | ||
212 | |||
213 | } else { | ||
214 | ✗ | avpriv_request_sample(avctx, "Unsupported extradata size"); | |
215 | ✗ | return AVERROR_PATCHWELCOME; | |
216 | } | ||
217 | |||
218 |
1/2✓ Branch 0 taken 8 times.
✗ Branch 1 not taken.
|
8 | if (channel_mask) { |
219 | 8 | av_channel_layout_uninit(&avctx->ch_layout); | |
220 | 8 | av_channel_layout_from_mask(&avctx->ch_layout, channel_mask); | |
221 | } | ||
222 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 8 times.
|
8 | av_assert0(avctx->ch_layout.nb_channels >= 0); |
223 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 8 times.
|
8 | if (avctx->ch_layout.nb_channels > WMALL_MAX_CHANNELS) { |
224 | ✗ | avpriv_request_sample(avctx, | |
225 | "More than " AV_STRINGIFY(WMALL_MAX_CHANNELS) " channels"); | ||
226 | ✗ | return AVERROR_PATCHWELCOME; | |
227 | } | ||
228 | |||
229 | 8 | s->num_channels = avctx->ch_layout.nb_channels; | |
230 | |||
231 | /* extract lfe channel position */ | ||
232 | 8 | s->lfe_channel = -1; | |
233 | |||
234 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 8 times.
|
8 | if (channel_mask & 8) { |
235 | unsigned int mask; | ||
236 | ✗ | for (mask = 1; mask < 16; mask <<= 1) | |
237 | ✗ | if (channel_mask & mask) | |
238 | ✗ | ++s->lfe_channel; | |
239 | } | ||
240 | |||
241 | 8 | s->max_frame_size = MAX_FRAMESIZE * avctx->ch_layout.nb_channels; | |
242 | 8 | s->frame_data = av_mallocz(s->max_frame_size + AV_INPUT_BUFFER_PADDING_SIZE); | |
243 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 8 times.
|
8 | if (!s->frame_data) |
244 | ✗ | return AVERROR(ENOMEM); | |
245 | |||
246 | 8 | s->avctx = avctx; | |
247 | 8 | ff_llauddsp_init(&s->dsp); | |
248 | 8 | init_put_bits(&s->pb, s->frame_data, s->max_frame_size); | |
249 | |||
250 | /* generic init */ | ||
251 | 8 | s->log2_frame_size = av_log2(avctx->block_align) + 4; | |
252 | |||
253 | /* frame info */ | ||
254 | 8 | s->skip_frame = 1; /* skip first frame */ | |
255 | 8 | s->packet_loss = 1; | |
256 | 8 | s->len_prefix = s->decode_flags & 0x40; | |
257 | |||
258 | /* get frame len */ | ||
259 | 8 | s->samples_per_frame = 1 << ff_wma_get_frame_len_bits(avctx->sample_rate, | |
260 | 3, s->decode_flags); | ||
261 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 8 times.
|
8 | av_assert0(s->samples_per_frame <= WMALL_BLOCK_MAX_SIZE); |
262 | |||
263 | /* init previous block len */ | ||
264 |
2/2✓ Branch 0 taken 16 times.
✓ Branch 1 taken 8 times.
|
24 | for (i = 0; i < avctx->ch_layout.nb_channels; i++) |
265 | 16 | s->channel[i].prev_block_len = s->samples_per_frame; | |
266 | |||
267 | /* subframe info */ | ||
268 | 8 | log2_max_num_subframes = (s->decode_flags & 0x38) >> 3; | |
269 | 8 | s->max_num_subframes = 1 << log2_max_num_subframes; | |
270 | 8 | s->max_subframe_len_bit = 0; | |
271 | 8 | s->subframe_len_bits = av_log2(log2_max_num_subframes) + 1; | |
272 | |||
273 | 8 | s->min_samples_per_subframe = s->samples_per_frame / s->max_num_subframes; | |
274 | 8 | s->dynamic_range_compression = s->decode_flags & 0x80; | |
275 | 8 | s->bV3RTM = s->decode_flags & 0x100; | |
276 | |||
277 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 8 times.
|
8 | if (s->max_num_subframes > MAX_SUBFRAMES) { |
278 | ✗ | av_log(avctx, AV_LOG_ERROR, "invalid number of subframes %"PRIu8"\n", | |
279 | ✗ | s->max_num_subframes); | |
280 | ✗ | return AVERROR_INVALIDDATA; | |
281 | } | ||
282 | |||
283 | 8 | s->frame = av_frame_alloc(); | |
284 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 8 times.
|
8 | if (!s->frame) |
285 | ✗ | return AVERROR(ENOMEM); | |
286 | |||
287 | 8 | return 0; | |
288 | } | ||
289 | |||
290 | /** | ||
291 | * @brief Decode the subframe length. | ||
292 | * @param s context | ||
293 | * @param offset sample offset in the frame | ||
294 | * @return decoded subframe length on success, < 0 in case of an error | ||
295 | */ | ||
296 | 269 | static int decode_subframe_length(WmallDecodeCtx *s, int offset) | |
297 | { | ||
298 | int frame_len_ratio, subframe_len, len; | ||
299 | |||
300 | /* no need to read from the bitstream when only one length is possible */ | ||
301 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 269 times.
|
269 | if (offset == s->samples_per_frame - s->min_samples_per_subframe) |
302 | ✗ | return s->min_samples_per_subframe; | |
303 | |||
304 | 269 | len = av_log2(s->max_num_subframes - 1) + 1; | |
305 | 269 | frame_len_ratio = get_bits(&s->gb, len); | |
306 | 269 | subframe_len = s->min_samples_per_subframe * (frame_len_ratio + 1); | |
307 | |||
308 | /* sanity check the length */ | ||
309 |
1/2✓ Branch 0 taken 269 times.
✗ Branch 1 not taken.
|
269 | if (subframe_len < s->min_samples_per_subframe || |
310 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 269 times.
|
269 | subframe_len > s->samples_per_frame) { |
311 | ✗ | av_log(s->avctx, AV_LOG_ERROR, "broken frame: subframe_len %i\n", | |
312 | subframe_len); | ||
313 | ✗ | return AVERROR_INVALIDDATA; | |
314 | } | ||
315 | 269 | return subframe_len; | |
316 | } | ||
317 | |||
318 | /** | ||
319 | * @brief Decode how the data in the frame is split into subframes. | ||
320 | * Every WMA frame contains the encoded data for a fixed number of | ||
321 | * samples per channel. The data for every channel might be split | ||
322 | * into several subframes. This function will reconstruct the list of | ||
323 | * subframes for every channel. | ||
324 | * | ||
325 | * If the subframes are not evenly split, the algorithm estimates the | ||
326 | * channels with the lowest number of total samples. | ||
327 | * Afterwards, for each of these channels a bit is read from the | ||
328 | * bitstream that indicates if the channel contains a subframe with the | ||
329 | * next subframe size that is going to be read from the bitstream or not. | ||
330 | * If a channel contains such a subframe, the subframe size gets added to | ||
331 | * the channel's subframe list. | ||
332 | * The algorithm repeats these steps until the frame is properly divided | ||
333 | * between the individual channels. | ||
334 | * | ||
335 | * @param s context | ||
336 | * @return 0 on success, < 0 in case of an error | ||
337 | */ | ||
338 | 269 | static int decode_tilehdr(WmallDecodeCtx *s) | |
339 | { | ||
340 | 269 | uint16_t num_samples[WMALL_MAX_CHANNELS] = { 0 }; /* sum of samples for all currently known subframes of a channel */ | |
341 | uint8_t contains_subframe[WMALL_MAX_CHANNELS]; /* flag indicating if a channel contains the current subframe */ | ||
342 | 269 | int channels_for_cur_subframe = s->num_channels; /* number of channels that contain the current subframe */ | |
343 | 269 | int fixed_channel_layout = 0; /* flag indicating that all channels use the same subfra2me offsets and sizes */ | |
344 | 269 | int min_channel_len = 0; /* smallest sum of samples (channels with this length will be processed first) */ | |
345 | int c, tile_aligned; | ||
346 | |||
347 | /* reset tiling information */ | ||
348 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 269 times.
|
807 | for (c = 0; c < s->num_channels; c++) |
349 | 538 | s->channel[c].num_subframes = 0; | |
350 | |||
351 | 269 | tile_aligned = get_bits1(&s->gb); | |
352 |
2/4✓ Branch 0 taken 269 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 269 times.
|
269 | if (s->max_num_subframes == 1 || tile_aligned) |
353 | ✗ | fixed_channel_layout = 1; | |
354 | |||
355 | /* loop until the frame data is split between the subframes */ | ||
356 | do { | ||
357 | 269 | int subframe_len, in_use = 0; | |
358 | |||
359 | /* check which channels contain the subframe */ | ||
360 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 269 times.
|
807 | for (c = 0; c < s->num_channels; c++) { |
361 |
1/2✓ Branch 0 taken 538 times.
✗ Branch 1 not taken.
|
538 | if (num_samples[c] == min_channel_len) { |
362 |
2/4✓ Branch 0 taken 538 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 538 times.
✗ Branch 3 not taken.
|
538 | if (fixed_channel_layout || channels_for_cur_subframe == 1 || |
363 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 538 times.
|
538 | (min_channel_len == s->samples_per_frame - s->min_samples_per_subframe)) { |
364 | ✗ | contains_subframe[c] = 1; | |
365 | } else { | ||
366 | 538 | contains_subframe[c] = get_bits1(&s->gb); | |
367 | } | ||
368 | 538 | in_use |= contains_subframe[c]; | |
369 | } else | ||
370 | ✗ | contains_subframe[c] = 0; | |
371 | } | ||
372 | |||
373 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 269 times.
|
269 | if (!in_use) { |
374 | ✗ | av_log(s->avctx, AV_LOG_ERROR, | |
375 | "Found empty subframe\n"); | ||
376 | ✗ | return AVERROR_INVALIDDATA; | |
377 | } | ||
378 | |||
379 | /* get subframe length, subframe_len == 0 is not allowed */ | ||
380 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 269 times.
|
269 | if ((subframe_len = decode_subframe_length(s, min_channel_len)) <= 0) |
381 | ✗ | return AVERROR_INVALIDDATA; | |
382 | /* add subframes to the individual channels and find new min_channel_len */ | ||
383 | 269 | min_channel_len += subframe_len; | |
384 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 269 times.
|
807 | for (c = 0; c < s->num_channels; c++) { |
385 | 538 | WmallChannelCtx *chan = &s->channel[c]; | |
386 | |||
387 |
1/2✓ Branch 0 taken 538 times.
✗ Branch 1 not taken.
|
538 | if (contains_subframe[c]) { |
388 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 538 times.
|
538 | if (chan->num_subframes >= MAX_SUBFRAMES) { |
389 | ✗ | av_log(s->avctx, AV_LOG_ERROR, | |
390 | "broken frame: num subframes > 31\n"); | ||
391 | ✗ | return AVERROR_INVALIDDATA; | |
392 | } | ||
393 | 538 | chan->subframe_len[chan->num_subframes] = subframe_len; | |
394 | 538 | num_samples[c] += subframe_len; | |
395 | 538 | ++chan->num_subframes; | |
396 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 538 times.
|
538 | if (num_samples[c] > s->samples_per_frame) { |
397 | ✗ | av_log(s->avctx, AV_LOG_ERROR, "broken frame: " | |
398 | "channel len(%"PRIu16") > samples_per_frame(%"PRIu16")\n", | ||
399 | ✗ | num_samples[c], s->samples_per_frame); | |
400 | ✗ | return AVERROR_INVALIDDATA; | |
401 | } | ||
402 | ✗ | } else if (num_samples[c] <= min_channel_len) { | |
403 | ✗ | if (num_samples[c] < min_channel_len) { | |
404 | ✗ | channels_for_cur_subframe = 0; | |
405 | ✗ | min_channel_len = num_samples[c]; | |
406 | } | ||
407 | ✗ | ++channels_for_cur_subframe; | |
408 | } | ||
409 | } | ||
410 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 269 times.
|
269 | } while (min_channel_len < s->samples_per_frame); |
411 | |||
412 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 269 times.
|
807 | for (c = 0; c < s->num_channels; c++) { |
413 | 538 | int i, offset = 0; | |
414 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 538 times.
|
1076 | for (i = 0; i < s->channel[c].num_subframes; i++) { |
415 | 538 | s->channel[c].subframe_offsets[i] = offset; | |
416 | 538 | offset += s->channel[c].subframe_len[i]; | |
417 | } | ||
418 | } | ||
419 | |||
420 | 269 | return 0; | |
421 | } | ||
422 | |||
423 | 26 | static void decode_ac_filter(WmallDecodeCtx *s) | |
424 | { | ||
425 | int i; | ||
426 | 26 | s->acfilter_order = get_bits(&s->gb, 4) + 1; | |
427 | 26 | s->acfilter_scaling = get_bits(&s->gb, 4); | |
428 | |||
429 |
2/2✓ Branch 0 taken 26 times.
✓ Branch 1 taken 26 times.
|
52 | for (i = 0; i < s->acfilter_order; i++) |
430 | 26 | s->acfilter_coeffs[i] = get_bitsz(&s->gb, s->acfilter_scaling) + 1; | |
431 | 26 | } | |
432 | |||
433 | 23 | static void decode_mclms(WmallDecodeCtx *s) | |
434 | { | ||
435 | 23 | s->mclms_order = (get_bits(&s->gb, 4) + 1) * 2; | |
436 | 23 | s->mclms_scaling = get_bits(&s->gb, 4); | |
437 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 23 times.
|
23 | if (get_bits1(&s->gb)) { |
438 | int i, send_coef_bits; | ||
439 | ✗ | int cbits = av_log2(s->mclms_scaling + 1); | |
440 | ✗ | if (1 << cbits < s->mclms_scaling + 1) | |
441 | ✗ | cbits++; | |
442 | |||
443 | ✗ | send_coef_bits = get_bitsz(&s->gb, cbits) + 2; | |
444 | |||
445 | ✗ | for (i = 0; i < s->mclms_order * s->num_channels * s->num_channels; i++) | |
446 | ✗ | s->mclms_coeffs[i] = get_bits(&s->gb, send_coef_bits); | |
447 | |||
448 | ✗ | for (i = 0; i < s->num_channels; i++) { | |
449 | int c; | ||
450 | ✗ | for (c = 0; c < i; c++) | |
451 | ✗ | s->mclms_coeffs_cur[i * s->num_channels + c] = get_bits(&s->gb, send_coef_bits); | |
452 | } | ||
453 | } | ||
454 | 23 | } | |
455 | |||
456 | 26 | static int decode_cdlms(WmallDecodeCtx *s) | |
457 | { | ||
458 | int c, i; | ||
459 | 26 | int cdlms_send_coef = get_bits1(&s->gb); | |
460 | |||
461 |
2/2✓ Branch 0 taken 52 times.
✓ Branch 1 taken 26 times.
|
78 | for (c = 0; c < s->num_channels; c++) { |
462 | 52 | s->cdlms_ttl[c] = get_bits(&s->gb, 3) + 1; | |
463 |
2/2✓ Branch 0 taken 98 times.
✓ Branch 1 taken 52 times.
|
150 | for (i = 0; i < s->cdlms_ttl[c]; i++) { |
464 | 98 | s->cdlms[c][i].order = (get_bits(&s->gb, 7) + 1) * 8; | |
465 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 98 times.
|
98 | if (s->cdlms[c][i].order > MAX_ORDER) { |
466 | ✗ | av_log(s->avctx, AV_LOG_ERROR, | |
467 | "Order[%d][%d] %d > max (%d), not supported\n", | ||
468 | c, i, s->cdlms[c][i].order, MAX_ORDER); | ||
469 | ✗ | s->cdlms[0][0].order = 0; | |
470 | ✗ | return AVERROR_INVALIDDATA; | |
471 | } | ||
472 |
3/4✓ Branch 0 taken 8 times.
✓ Branch 1 taken 90 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 8 times.
|
98 | if(s->cdlms[c][i].order & 8 && s->bits_per_sample == 16) { |
473 | static int warned; | ||
474 | ✗ | if(!warned) | |
475 | ✗ | avpriv_request_sample(s->avctx, "CDLMS of order %d", | |
476 | s->cdlms[c][i].order); | ||
477 | ✗ | warned = 1; | |
478 | } | ||
479 | } | ||
480 | |||
481 |
2/2✓ Branch 0 taken 98 times.
✓ Branch 1 taken 52 times.
|
150 | for (i = 0; i < s->cdlms_ttl[c]; i++) |
482 | 98 | s->cdlms[c][i].scaling = get_bits(&s->gb, 4); | |
483 | |||
484 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 52 times.
|
52 | if (cdlms_send_coef) { |
485 | ✗ | for (i = 0; i < s->cdlms_ttl[c]; i++) { | |
486 | int cbits, shift_l, shift_r, j; | ||
487 | ✗ | cbits = av_log2(s->cdlms[c][i].order); | |
488 | ✗ | if ((1 << cbits) < s->cdlms[c][i].order) | |
489 | ✗ | cbits++; | |
490 | ✗ | s->cdlms[c][i].coefsend = get_bits(&s->gb, cbits) + 1; | |
491 | |||
492 | ✗ | cbits = av_log2(s->cdlms[c][i].scaling + 1); | |
493 | ✗ | if ((1 << cbits) < s->cdlms[c][i].scaling + 1) | |
494 | ✗ | cbits++; | |
495 | |||
496 | ✗ | s->cdlms[c][i].bitsend = get_bitsz(&s->gb, cbits) + 2; | |
497 | ✗ | shift_l = 32 - s->cdlms[c][i].bitsend; | |
498 | ✗ | shift_r = 32 - s->cdlms[c][i].scaling - 2; | |
499 | ✗ | for (j = 0; j < s->cdlms[c][i].coefsend; j++) | |
500 | ✗ | s->cdlms[c][i].coefs[j] = | |
501 | ✗ | (get_bits(&s->gb, s->cdlms[c][i].bitsend) << shift_l) >> shift_r; | |
502 | } | ||
503 | } | ||
504 | |||
505 |
2/2✓ Branch 0 taken 98 times.
✓ Branch 1 taken 52 times.
|
150 | for (i = 0; i < s->cdlms_ttl[c]; i++) |
506 | 98 | memset(s->cdlms[c][i].coefs + s->cdlms[c][i].order, | |
507 | 0, WMALL_COEFF_PAD_SIZE); | ||
508 | } | ||
509 | |||
510 | 26 | return 0; | |
511 | } | ||
512 | |||
513 | 504 | static int decode_channel_residues(WmallDecodeCtx *s, int ch, int tile_size) | |
514 | { | ||
515 | 504 | int i = 0; | |
516 | unsigned int ave_mean; | ||
517 | 504 | s->transient[ch] = get_bits1(&s->gb); | |
518 |
2/2✓ Branch 0 taken 1 times.
✓ Branch 1 taken 503 times.
|
504 | if (s->transient[ch]) { |
519 | 1 | s->transient_pos[ch] = get_bits(&s->gb, av_log2(tile_size)); | |
520 |
1/2✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
|
1 | if (s->transient_pos[ch]) |
521 | 1 | s->transient[ch] = 0; | |
522 | 1 | s->channel[ch].transient_counter = | |
523 | 1 | FFMAX(s->channel[ch].transient_counter, s->samples_per_frame / 2); | |
524 |
1/2✓ Branch 0 taken 503 times.
✗ Branch 1 not taken.
|
503 | } else if (s->channel[ch].transient_counter) |
525 | 503 | s->transient[ch] = 1; | |
526 | |||
527 |
2/2✓ Branch 0 taken 51 times.
✓ Branch 1 taken 453 times.
|
504 | if (s->seekable_tile) { |
528 | 51 | ave_mean = get_bits(&s->gb, s->bits_per_sample); | |
529 | 51 | s->ave_sum[ch] = ave_mean << (s->movave_scaling + 1); | |
530 | } | ||
531 | |||
532 |
2/2✓ Branch 0 taken 51 times.
✓ Branch 1 taken 453 times.
|
504 | if (s->seekable_tile) { |
533 |
1/2✓ Branch 0 taken 51 times.
✗ Branch 1 not taken.
|
51 | if (s->do_inter_ch_decorr) |
534 | 51 | s->channel_residues[ch][0] = get_sbits_long(&s->gb, s->bits_per_sample + 1); | |
535 | else | ||
536 | ✗ | s->channel_residues[ch][0] = get_sbits_long(&s->gb, s->bits_per_sample); | |
537 | 51 | i++; | |
538 | } | ||
539 |
2/2✓ Branch 0 taken 1031564 times.
✓ Branch 1 taken 503 times.
|
1032067 | for (; i < tile_size; i++) { |
540 | int rem, rem_bits; | ||
541 | 1031564 | unsigned quo = 0, residue; | |
542 |
2/2✓ Branch 1 taken 1000907 times.
✓ Branch 2 taken 1031563 times.
|
2032470 | while(get_bits1(&s->gb)) { |
543 | 1000907 | quo++; | |
544 |
2/2✓ Branch 1 taken 1 times.
✓ Branch 2 taken 1000906 times.
|
1000907 | if (get_bits_left(&s->gb) <= 0) |
545 | 1 | return -1; | |
546 | } | ||
547 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 1031563 times.
|
1031563 | if (quo >= 32) |
548 | ✗ | quo += get_bits_long(&s->gb, get_bits(&s->gb, 5) + 1); | |
549 | |||
550 | 1031563 | ave_mean = (s->ave_sum[ch] + (1 << s->movave_scaling)) >> (s->movave_scaling + 1); | |
551 |
2/2✓ Branch 0 taken 52125 times.
✓ Branch 1 taken 979438 times.
|
1031563 | if (ave_mean <= 1) |
552 | 52125 | residue = quo; | |
553 | else { | ||
554 | 979438 | rem_bits = av_ceil_log2(ave_mean); | |
555 | 979438 | rem = get_bits_long(&s->gb, rem_bits); | |
556 | 979438 | residue = (quo << rem_bits) + rem; | |
557 | } | ||
558 | |||
559 | 1031563 | s->ave_sum[ch] = residue + s->ave_sum[ch] - | |
560 | 1031563 | (s->ave_sum[ch] >> s->movave_scaling); | |
561 | |||
562 | 1031563 | residue = (residue >> 1) ^ -(residue & 1); | |
563 | 1031563 | s->channel_residues[ch][i] = residue; | |
564 | } | ||
565 | |||
566 | 503 | return 0; | |
567 | |||
568 | } | ||
569 | |||
570 | ✗ | static void decode_lpc(WmallDecodeCtx *s) | |
571 | { | ||
572 | int ch, i, cbits; | ||
573 | ✗ | s->lpc_order = get_bits(&s->gb, 5) + 1; | |
574 | ✗ | s->lpc_scaling = get_bits(&s->gb, 4); | |
575 | ✗ | s->lpc_intbits = get_bits(&s->gb, 3) + 1; | |
576 | ✗ | cbits = s->lpc_scaling + s->lpc_intbits; | |
577 | ✗ | for (ch = 0; ch < s->num_channels; ch++) | |
578 | ✗ | for (i = 0; i < s->lpc_order; i++) | |
579 | ✗ | s->lpc_coefs[ch][i] = get_sbits(&s->gb, cbits); | |
580 | ✗ | } | |
581 | |||
582 | 26 | static void clear_codec_buffers(WmallDecodeCtx *s) | |
583 | { | ||
584 | int ich, ilms; | ||
585 | |||
586 | 26 | memset(s->acfilter_coeffs, 0, sizeof(s->acfilter_coeffs)); | |
587 | 26 | memset(s->acfilter_prevvalues, 0, sizeof(s->acfilter_prevvalues)); | |
588 | 26 | memset(s->lpc_coefs, 0, sizeof(s->lpc_coefs)); | |
589 | |||
590 | 26 | memset(s->mclms_coeffs, 0, sizeof(s->mclms_coeffs)); | |
591 | 26 | memset(s->mclms_coeffs_cur, 0, sizeof(s->mclms_coeffs_cur)); | |
592 | 26 | memset(s->mclms_prevvalues, 0, sizeof(s->mclms_prevvalues)); | |
593 | 26 | memset(s->mclms_updates, 0, sizeof(s->mclms_updates)); | |
594 | |||
595 |
2/2✓ Branch 0 taken 52 times.
✓ Branch 1 taken 26 times.
|
78 | for (ich = 0; ich < s->num_channels; ich++) { |
596 |
2/2✓ Branch 0 taken 88 times.
✓ Branch 1 taken 52 times.
|
140 | for (ilms = 0; ilms < s->cdlms_ttl[ich]; ilms++) { |
597 | 88 | memset(s->cdlms[ich][ilms].coefs, 0, | |
598 | sizeof(s->cdlms[ich][ilms].coefs)); | ||
599 | 88 | memset(s->cdlms[ich][ilms].lms_prevvalues, 0, | |
600 | sizeof(s->cdlms[ich][ilms].lms_prevvalues)); | ||
601 | 88 | memset(s->cdlms[ich][ilms].lms_updates, 0, | |
602 | sizeof(s->cdlms[ich][ilms].lms_updates)); | ||
603 | } | ||
604 | 52 | s->ave_sum[ich] = 0; | |
605 | } | ||
606 | 26 | } | |
607 | |||
608 | /** | ||
609 | * @brief Reset filter parameters and transient area at new seekable tile. | ||
610 | */ | ||
611 | 26 | static void reset_codec(WmallDecodeCtx *s) | |
612 | { | ||
613 | int ich, ilms; | ||
614 | 26 | s->mclms_recent = s->mclms_order * s->num_channels; | |
615 |
2/2✓ Branch 0 taken 52 times.
✓ Branch 1 taken 26 times.
|
78 | for (ich = 0; ich < s->num_channels; ich++) { |
616 |
2/2✓ Branch 0 taken 98 times.
✓ Branch 1 taken 52 times.
|
150 | for (ilms = 0; ilms < s->cdlms_ttl[ich]; ilms++) |
617 | 98 | s->cdlms[ich][ilms].recent = s->cdlms[ich][ilms].order; | |
618 | /* first sample of a seekable subframe is considered as the starting of | ||
619 | a transient area which is samples_per_frame samples long */ | ||
620 | 52 | s->channel[ich].transient_counter = s->samples_per_frame; | |
621 | 52 | s->transient[ich] = 1; | |
622 | 52 | s->transient_pos[ich] = 0; | |
623 | } | ||
624 | 26 | } | |
625 | |||
626 | 448512 | static void mclms_update(WmallDecodeCtx *s, int icoef, int *pred) | |
627 | { | ||
628 | int i, j, ich, pred_error; | ||
629 | 448512 | int order = s->mclms_order; | |
630 | 448512 | int num_channels = s->num_channels; | |
631 | 448512 | int range = 1 << (s->bits_per_sample - 1); | |
632 | |||
633 |
2/2✓ Branch 0 taken 897024 times.
✓ Branch 1 taken 448512 times.
|
1345536 | for (ich = 0; ich < num_channels; ich++) { |
634 | 897024 | pred_error = s->channel_residues[ich][icoef] - (unsigned)pred[ich]; | |
635 |
2/2✓ Branch 0 taken 449621 times.
✓ Branch 1 taken 447403 times.
|
897024 | if (pred_error > 0) { |
636 |
2/2✓ Branch 0 taken 1798484 times.
✓ Branch 1 taken 449621 times.
|
2248105 | for (i = 0; i < order * num_channels; i++) |
637 | 1798484 | s->mclms_coeffs[i + ich * order * num_channels] += | |
638 | 1798484 | s->mclms_updates[s->mclms_recent + i]; | |
639 |
2/2✓ Branch 0 taken 223215 times.
✓ Branch 1 taken 449621 times.
|
672836 | for (j = 0; j < ich; j++) |
640 | 223215 | s->mclms_coeffs_cur[ich * num_channels + j] += WMASIGN(s->channel_residues[j][icoef]); | |
641 |
2/2✓ Branch 0 taken 443941 times.
✓ Branch 1 taken 3462 times.
|
447403 | } else if (pred_error < 0) { |
642 |
2/2✓ Branch 0 taken 1775764 times.
✓ Branch 1 taken 443941 times.
|
2219705 | for (i = 0; i < order * num_channels; i++) |
643 | 1775764 | s->mclms_coeffs[i + ich * order * num_channels] -= | |
644 | 1775764 | s->mclms_updates[s->mclms_recent + i]; | |
645 |
2/2✓ Branch 0 taken 223308 times.
✓ Branch 1 taken 443941 times.
|
667249 | for (j = 0; j < ich; j++) |
646 | 223308 | s->mclms_coeffs_cur[ich * num_channels + j] -= WMASIGN(s->channel_residues[j][icoef]); | |
647 | } | ||
648 | } | ||
649 | |||
650 |
2/2✓ Branch 0 taken 897024 times.
✓ Branch 1 taken 448512 times.
|
1345536 | for (ich = num_channels - 1; ich >= 0; ich--) { |
651 | 897024 | s->mclms_recent--; | |
652 | 897024 | s->mclms_prevvalues[s->mclms_recent] = av_clip(s->channel_residues[ich][icoef], | |
653 | -range, range - 1); | ||
654 | 897024 | s->mclms_updates[s->mclms_recent] = WMASIGN(s->channel_residues[ich][icoef]); | |
655 | } | ||
656 | |||
657 |
2/2✓ Branch 0 taken 224256 times.
✓ Branch 1 taken 224256 times.
|
448512 | if (s->mclms_recent == 0) { |
658 | 224256 | memcpy(&s->mclms_prevvalues[order * num_channels], | |
659 | 224256 | s->mclms_prevvalues, | |
660 | 224256 | sizeof(int32_t) * order * num_channels); | |
661 | 224256 | memcpy(&s->mclms_updates[order * num_channels], | |
662 | 224256 | s->mclms_updates, | |
663 | 224256 | sizeof(int32_t) * order * num_channels); | |
664 | 224256 | s->mclms_recent = num_channels * order; | |
665 | } | ||
666 | 448512 | } | |
667 | |||
668 | 448512 | static void mclms_predict(WmallDecodeCtx *s, int icoef, int *pred) | |
669 | { | ||
670 | int ich, i; | ||
671 | 448512 | int order = s->mclms_order; | |
672 | 448512 | int num_channels = s->num_channels; | |
673 | |||
674 |
2/2✓ Branch 0 taken 897024 times.
✓ Branch 1 taken 448512 times.
|
1345536 | for (ich = 0; ich < num_channels; ich++) { |
675 | 897024 | pred[ich] = 0; | |
676 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 897024 times.
|
897024 | if (!s->is_channel_coded[ich]) |
677 | ✗ | continue; | |
678 |
2/2✓ Branch 0 taken 3588096 times.
✓ Branch 1 taken 897024 times.
|
4485120 | for (i = 0; i < order * num_channels; i++) |
679 | 3588096 | pred[ich] += (uint32_t)s->mclms_prevvalues[i + s->mclms_recent] * | |
680 | 3588096 | s->mclms_coeffs[i + order * num_channels * ich]; | |
681 |
2/2✓ Branch 0 taken 448512 times.
✓ Branch 1 taken 897024 times.
|
1345536 | for (i = 0; i < ich; i++) |
682 | 448512 | pred[ich] += (uint32_t)s->channel_residues[i][icoef] * | |
683 | 448512 | s->mclms_coeffs_cur[i + num_channels * ich]; | |
684 | 897024 | pred[ich] += (1U << s->mclms_scaling) >> 1; | |
685 | 897024 | pred[ich] >>= s->mclms_scaling; | |
686 | 897024 | s->channel_residues[ich][icoef] += (unsigned)pred[ich]; | |
687 | } | ||
688 | 448512 | } | |
689 | |||
690 | 219 | static void revert_mclms(WmallDecodeCtx *s, int tile_size) | |
691 | { | ||
692 | 219 | int icoef, pred[WMALL_MAX_CHANNELS] = { 0 }; | |
693 |
2/2✓ Branch 0 taken 448512 times.
✓ Branch 1 taken 219 times.
|
448731 | for (icoef = 0; icoef < tile_size; icoef++) { |
694 | 448512 | mclms_predict(s, icoef, pred); | |
695 | 448512 | mclms_update(s, icoef, pred); | |
696 | } | ||
697 | 219 | } | |
698 | |||
699 | 51 | static void use_high_update_speed(WmallDecodeCtx *s, int ich) | |
700 | { | ||
701 | int ilms, recent, icoef; | ||
702 |
2/2✓ Branch 0 taken 97 times.
✓ Branch 1 taken 51 times.
|
148 | for (ilms = s->cdlms_ttl[ich] - 1; ilms >= 0; ilms--) { |
703 | 97 | recent = s->cdlms[ich][ilms].recent; | |
704 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 97 times.
|
97 | if (s->update_speed[ich] == 16) |
705 | ✗ | continue; | |
706 |
2/2✓ Branch 0 taken 9 times.
✓ Branch 1 taken 88 times.
|
97 | if (s->bV3RTM) { |
707 |
2/2✓ Branch 0 taken 88 times.
✓ Branch 1 taken 9 times.
|
97 | for (icoef = 0; icoef < s->cdlms[ich][ilms].order; icoef++) |
708 | 88 | s->cdlms[ich][ilms].lms_updates[icoef + recent] *= 2; | |
709 | } else { | ||
710 |
2/2✓ Branch 0 taken 3520 times.
✓ Branch 1 taken 88 times.
|
3608 | for (icoef = 0; icoef < s->cdlms[ich][ilms].order; icoef++) |
711 | 3520 | s->cdlms[ich][ilms].lms_updates[icoef] *= 2; | |
712 | } | ||
713 | } | ||
714 | 51 | s->update_speed[ich] = 16; | |
715 | 51 | } | |
716 | |||
717 | 453 | static void use_normal_update_speed(WmallDecodeCtx *s, int ich) | |
718 | { | ||
719 | int ilms, recent, icoef; | ||
720 |
2/2✓ Branch 0 taken 845 times.
✓ Branch 1 taken 453 times.
|
1298 | for (ilms = s->cdlms_ttl[ich] - 1; ilms >= 0; ilms--) { |
721 | 845 | recent = s->cdlms[ich][ilms].recent; | |
722 |
2/2✓ Branch 0 taken 747 times.
✓ Branch 1 taken 98 times.
|
845 | if (s->update_speed[ich] == 8) |
723 | 747 | continue; | |
724 |
2/2✓ Branch 0 taken 10 times.
✓ Branch 1 taken 88 times.
|
98 | if (s->bV3RTM) |
725 |
2/2✓ Branch 0 taken 96 times.
✓ Branch 1 taken 10 times.
|
106 | for (icoef = 0; icoef < s->cdlms[ich][ilms].order; icoef++) |
726 | 96 | s->cdlms[ich][ilms].lms_updates[icoef + recent] /= 2; | |
727 | else | ||
728 |
2/2✓ Branch 0 taken 3520 times.
✓ Branch 1 taken 88 times.
|
3608 | for (icoef = 0; icoef < s->cdlms[ich][ilms].order; icoef++) |
729 | 3520 | s->cdlms[ich][ilms].lms_updates[icoef] /= 2; | |
730 | } | ||
731 | 453 | s->update_speed[ich] = 8; | |
732 | 453 | } | |
733 | |||
734 | #define CD_LMS(bits, ROUND) \ | ||
735 | static void lms_update ## bits (WmallDecodeCtx *s, int ich, int ilms, int input) \ | ||
736 | { \ | ||
737 | int recent = s->cdlms[ich][ilms].recent; \ | ||
738 | int range = 1 << s->bits_per_sample - 1; \ | ||
739 | int order = s->cdlms[ich][ilms].order; \ | ||
740 | int ##bits##_t *prev = (int##bits##_t *)s->cdlms[ich][ilms].lms_prevvalues; \ | ||
741 | \ | ||
742 | if (recent) \ | ||
743 | recent--; \ | ||
744 | else { \ | ||
745 | memcpy(prev + order, prev, (bits/8) * order); \ | ||
746 | memcpy(s->cdlms[ich][ilms].lms_updates + order, \ | ||
747 | s->cdlms[ich][ilms].lms_updates, \ | ||
748 | sizeof(*s->cdlms[ich][ilms].lms_updates) * order); \ | ||
749 | recent = order - 1; \ | ||
750 | } \ | ||
751 | \ | ||
752 | prev[recent] = av_clip(input, -range, range - 1); \ | ||
753 | s->cdlms[ich][ilms].lms_updates[recent] = WMASIGN(input) * s->update_speed[ich]; \ | ||
754 | \ | ||
755 | s->cdlms[ich][ilms].lms_updates[recent + (order >> 4)] >>= 2; \ | ||
756 | s->cdlms[ich][ilms].lms_updates[recent + (order >> 3)] >>= 1; \ | ||
757 | s->cdlms[ich][ilms].recent = recent; \ | ||
758 | memset(s->cdlms[ich][ilms].lms_updates + recent + order, 0, \ | ||
759 | sizeof(s->cdlms[ich][ilms].lms_updates) - \ | ||
760 | sizeof(*s->cdlms[ich][ilms].lms_updates)*(recent+order)); \ | ||
761 | } \ | ||
762 | \ | ||
763 | static void revert_cdlms ## bits (WmallDecodeCtx *s, int ch, \ | ||
764 | int coef_begin, int coef_end) \ | ||
765 | { \ | ||
766 | int icoef, ilms, num_lms, residue, input; \ | ||
767 | unsigned pred;\ | ||
768 | \ | ||
769 | num_lms = s->cdlms_ttl[ch]; \ | ||
770 | for (ilms = num_lms - 1; ilms >= 0; ilms--) { \ | ||
771 | for (icoef = coef_begin; icoef < coef_end; icoef++) { \ | ||
772 | int##bits##_t *prevvalues = (int##bits##_t *)s->cdlms[ch][ilms].lms_prevvalues; \ | ||
773 | pred = (1 << s->cdlms[ch][ilms].scaling) >> 1; \ | ||
774 | residue = s->channel_residues[ch][icoef]; \ | ||
775 | pred += s->dsp.scalarproduct_and_madd_int## bits (s->cdlms[ch][ilms].coefs, \ | ||
776 | prevvalues + s->cdlms[ch][ilms].recent, \ | ||
777 | s->cdlms[ch][ilms].lms_updates + \ | ||
778 | s->cdlms[ch][ilms].recent, \ | ||
779 | FFALIGN(s->cdlms[ch][ilms].order, ROUND), \ | ||
780 | WMASIGN(residue)); \ | ||
781 | input = residue + (unsigned)((int)pred >> s->cdlms[ch][ilms].scaling); \ | ||
782 | lms_update ## bits(s, ch, ilms, input); \ | ||
783 | s->channel_residues[ch][icoef] = input; \ | ||
784 | } \ | ||
785 | } \ | ||
786 | } | ||
787 | |||
788 |
6/6✓ Branch 0 taken 1653208 times.
✓ Branch 1 taken 67112 times.
✓ Branch 2 taken 1720320 times.
✓ Branch 3 taken 840 times.
✓ Branch 4 taken 840 times.
✓ Branch 5 taken 420 times.
|
6883800 | CD_LMS(16, WMALL_COEFF_PAD_SIZE) |
789 |
6/6✓ Branch 0 taken 185098 times.
✓ Branch 1 taken 23798 times.
✓ Branch 2 taken 208896 times.
✓ Branch 3 taken 102 times.
✓ Branch 4 taken 102 times.
✓ Branch 5 taken 84 times.
|
835956 | CD_LMS(32, 8) |
790 | |||
791 | 264 | static void revert_inter_ch_decorr(WmallDecodeCtx *s, int tile_size) | |
792 | { | ||
793 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 264 times.
|
264 | if (s->num_channels != 2) |
794 | ✗ | return; | |
795 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 264 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
|
264 | else if (s->is_channel_coded[0] || s->is_channel_coded[1]) { |
796 | int icoef; | ||
797 |
2/2✓ Branch 0 taken 540672 times.
✓ Branch 1 taken 264 times.
|
540936 | for (icoef = 0; icoef < tile_size; icoef++) { |
798 | 540672 | s->channel_residues[0][icoef] -= (unsigned)(s->channel_residues[1][icoef] >> 1); | |
799 | 540672 | s->channel_residues[1][icoef] += (unsigned) s->channel_residues[0][icoef]; | |
800 | } | ||
801 | } | ||
802 | } | ||
803 | |||
804 | 264 | static void revert_acfilter(WmallDecodeCtx *s, int tile_size) | |
805 | { | ||
806 | int ich, pred, i, j; | ||
807 | 264 | int16_t *filter_coeffs = s->acfilter_coeffs; | |
808 | 264 | int scaling = s->acfilter_scaling; | |
809 | 264 | int order = s->acfilter_order; | |
810 | |||
811 |
2/2✓ Branch 0 taken 528 times.
✓ Branch 1 taken 264 times.
|
792 | for (ich = 0; ich < s->num_channels; ich++) { |
812 | 528 | int *prevvalues = s->acfilter_prevvalues[ich]; | |
813 |
2/2✓ Branch 0 taken 528 times.
✓ Branch 1 taken 528 times.
|
1056 | for (i = 0; i < order; i++) { |
814 | 528 | pred = 0; | |
815 |
2/2✓ Branch 0 taken 528 times.
✓ Branch 1 taken 528 times.
|
1056 | for (j = 0; j < order; j++) { |
816 |
1/2✓ Branch 0 taken 528 times.
✗ Branch 1 not taken.
|
528 | if (i <= j) |
817 | 528 | pred += (uint32_t)filter_coeffs[j] * prevvalues[j - i]; | |
818 | else | ||
819 | ✗ | pred += (uint32_t)s->channel_residues[ich][i - j - 1] * filter_coeffs[j]; | |
820 | } | ||
821 | 528 | pred >>= scaling; | |
822 | 528 | s->channel_residues[ich][i] += (unsigned)pred; | |
823 | } | ||
824 |
2/2✓ Branch 0 taken 1080816 times.
✓ Branch 1 taken 528 times.
|
1081344 | for (i = order; i < tile_size; i++) { |
825 | 1080816 | pred = 0; | |
826 |
2/2✓ Branch 0 taken 1080816 times.
✓ Branch 1 taken 1080816 times.
|
2161632 | for (j = 0; j < order; j++) |
827 | 1080816 | pred += (uint32_t)s->channel_residues[ich][i - j - 1] * filter_coeffs[j]; | |
828 | 1080816 | pred >>= scaling; | |
829 | 1080816 | s->channel_residues[ich][i] += (unsigned)pred; | |
830 | } | ||
831 |
2/2✓ Branch 0 taken 528 times.
✓ Branch 1 taken 528 times.
|
1056 | for (j = order - 1; j >= 0; j--) |
832 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 528 times.
|
528 | if (tile_size <= j) { |
833 | ✗ | prevvalues[j] = prevvalues[j - tile_size]; | |
834 | }else | ||
835 | 528 | prevvalues[j] = s->channel_residues[ich][tile_size - j - 1]; | |
836 | } | ||
837 | 264 | } | |
838 | |||
839 | 269 | static int decode_subframe(WmallDecodeCtx *s) | |
840 | { | ||
841 | 269 | int offset = s->samples_per_frame; | |
842 | 269 | int subframe_len = s->samples_per_frame; | |
843 | 269 | int total_samples = s->samples_per_frame * s->num_channels; | |
844 | int i, j, rawpcm_tile, padding_zeroes, res; | ||
845 | |||
846 | 269 | s->subframe_offset = get_bits_count(&s->gb); | |
847 | |||
848 | /* reset channel context and find the next block offset and size | ||
849 | == the next block of the channel with the smallest number of | ||
850 | decoded samples */ | ||
851 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 269 times.
|
807 | for (i = 0; i < s->num_channels; i++) { |
852 |
2/2✓ Branch 0 taken 269 times.
✓ Branch 1 taken 269 times.
|
538 | if (offset > s->channel[i].decoded_samples) { |
853 | 269 | offset = s->channel[i].decoded_samples; | |
854 | 269 | subframe_len = | |
855 | 269 | s->channel[i].subframe_len[s->channel[i].cur_subframe]; | |
856 | } | ||
857 | } | ||
858 | |||
859 | /* get a list of all channels that contain the estimated block */ | ||
860 | 269 | s->channels_for_cur_subframe = 0; | |
861 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 269 times.
|
807 | for (i = 0; i < s->num_channels; i++) { |
862 | 538 | const int cur_subframe = s->channel[i].cur_subframe; | |
863 | /* subtract already processed samples */ | ||
864 | 538 | total_samples -= s->channel[i].decoded_samples; | |
865 | |||
866 | /* and count if there are multiple subframes that match our profile */ | ||
867 |
1/2✓ Branch 0 taken 538 times.
✗ Branch 1 not taken.
|
538 | if (offset == s->channel[i].decoded_samples && |
868 |
1/2✓ Branch 0 taken 538 times.
✗ Branch 1 not taken.
|
538 | subframe_len == s->channel[i].subframe_len[cur_subframe]) { |
869 | 538 | total_samples -= s->channel[i].subframe_len[cur_subframe]; | |
870 | 538 | s->channel[i].decoded_samples += | |
871 | 538 | s->channel[i].subframe_len[cur_subframe]; | |
872 | 538 | s->channel_indexes_for_cur_subframe[s->channels_for_cur_subframe] = i; | |
873 | 538 | ++s->channels_for_cur_subframe; | |
874 | } | ||
875 | } | ||
876 | |||
877 | /* check if the frame will be complete after processing the | ||
878 | estimated block */ | ||
879 |
1/2✓ Branch 0 taken 269 times.
✗ Branch 1 not taken.
|
269 | if (!total_samples) |
880 | 269 | s->parsed_all_subframes = 1; | |
881 | |||
882 | |||
883 | 269 | s->seekable_tile = get_bits1(&s->gb); | |
884 |
2/2✓ Branch 0 taken 26 times.
✓ Branch 1 taken 243 times.
|
269 | if (s->seekable_tile) { |
885 | 26 | clear_codec_buffers(s); | |
886 | |||
887 | 26 | s->do_arith_coding = get_bits1(&s->gb); | |
888 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 26 times.
|
26 | if (s->do_arith_coding) { |
889 | ✗ | avpriv_request_sample(s->avctx, "Arithmetic coding"); | |
890 | ✗ | return AVERROR_PATCHWELCOME; | |
891 | } | ||
892 | 26 | s->do_ac_filter = get_bits1(&s->gb); | |
893 | 26 | s->do_inter_ch_decorr = get_bits1(&s->gb); | |
894 | 26 | s->do_mclms = get_bits1(&s->gb); | |
895 | |||
896 |
1/2✓ Branch 0 taken 26 times.
✗ Branch 1 not taken.
|
26 | if (s->do_ac_filter) |
897 | 26 | decode_ac_filter(s); | |
898 | |||
899 |
2/2✓ Branch 0 taken 23 times.
✓ Branch 1 taken 3 times.
|
26 | if (s->do_mclms) |
900 | 23 | decode_mclms(s); | |
901 | |||
902 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 26 times.
|
26 | if ((res = decode_cdlms(s)) < 0) |
903 | ✗ | return res; | |
904 | 26 | s->movave_scaling = get_bits(&s->gb, 3); | |
905 | 26 | s->quant_stepsize = get_bits(&s->gb, 8) + 1; | |
906 | |||
907 | 26 | reset_codec(s); | |
908 | } | ||
909 | |||
910 | 269 | rawpcm_tile = get_bits1(&s->gb); | |
911 | |||
912 |
3/4✓ Branch 0 taken 264 times.
✓ Branch 1 taken 5 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 264 times.
|
269 | if (!rawpcm_tile && !s->cdlms[0][0].order) { |
913 | ✗ | av_log(s->avctx, AV_LOG_DEBUG, | |
914 | "Waiting for seekable tile\n"); | ||
915 | ✗ | av_frame_unref(s->frame); | |
916 | ✗ | return -1; | |
917 | } | ||
918 | |||
919 | |||
920 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 269 times.
|
807 | for (i = 0; i < s->num_channels; i++) |
921 | 538 | s->is_channel_coded[i] = 1; | |
922 | |||
923 |
2/2✓ Branch 0 taken 264 times.
✓ Branch 1 taken 5 times.
|
269 | if (!rawpcm_tile) { |
924 |
2/2✓ Branch 0 taken 528 times.
✓ Branch 1 taken 264 times.
|
792 | for (i = 0; i < s->num_channels; i++) |
925 | 528 | s->is_channel_coded[i] = get_bits1(&s->gb); | |
926 | |||
927 |
2/2✓ Branch 0 taken 54 times.
✓ Branch 1 taken 210 times.
|
264 | if (s->bV3RTM) { |
928 | // LPC | ||
929 | 54 | s->do_lpc = get_bits1(&s->gb); | |
930 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 54 times.
|
54 | if (s->do_lpc) { |
931 | ✗ | decode_lpc(s); | |
932 | ✗ | avpriv_request_sample(s->avctx, "Expect wrong output since " | |
933 | "inverse LPC filter"); | ||
934 | } | ||
935 | } else | ||
936 | 210 | s->do_lpc = 0; | |
937 | } | ||
938 | |||
939 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 269 times.
|
269 | if (get_bits_left(&s->gb) < 1) |
940 | ✗ | return AVERROR_INVALIDDATA; | |
941 | |||
942 |
2/2✓ Branch 1 taken 9 times.
✓ Branch 2 taken 260 times.
|
269 | if (get_bits1(&s->gb)) |
943 | 9 | padding_zeroes = get_bits(&s->gb, 5); | |
944 | else | ||
945 | 260 | padding_zeroes = 0; | |
946 | |||
947 |
2/2✓ Branch 0 taken 5 times.
✓ Branch 1 taken 264 times.
|
269 | if (rawpcm_tile) { |
948 | 5 | int bits = s->bits_per_sample - padding_zeroes; | |
949 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 5 times.
|
5 | if (bits <= 0) { |
950 | ✗ | av_log(s->avctx, AV_LOG_ERROR, | |
951 | "Invalid number of padding bits in raw PCM tile\n"); | ||
952 | ✗ | return AVERROR_INVALIDDATA; | |
953 | } | ||
954 | ff_dlog(s->avctx, "RAWPCM %d bits per sample. " | ||
955 | "total %d bits, remain=%d\n", bits, | ||
956 | bits * s->num_channels * subframe_len, get_bits_count(&s->gb)); | ||
957 |
2/2✓ Branch 0 taken 10 times.
✓ Branch 1 taken 5 times.
|
15 | for (i = 0; i < s->num_channels; i++) |
958 |
2/2✓ Branch 0 taken 20480 times.
✓ Branch 1 taken 10 times.
|
20490 | for (j = 0; j < subframe_len; j++) |
959 | 20480 | s->channel_residues[i][j] = get_sbits_long(&s->gb, bits); | |
960 | } else { | ||
961 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 264 times.
|
264 | if (s->bits_per_sample < padding_zeroes) |
962 | ✗ | return AVERROR_INVALIDDATA; | |
963 |
2/2✓ Branch 0 taken 528 times.
✓ Branch 1 taken 264 times.
|
792 | for (i = 0; i < s->num_channels; i++) { |
964 |
2/2✓ Branch 0 taken 504 times.
✓ Branch 1 taken 24 times.
|
528 | if (s->is_channel_coded[i]) { |
965 | 504 | decode_channel_residues(s, i, subframe_len); | |
966 |
2/2✓ Branch 0 taken 51 times.
✓ Branch 1 taken 453 times.
|
504 | if (s->seekable_tile) |
967 | 51 | use_high_update_speed(s, i); | |
968 | else | ||
969 | 453 | use_normal_update_speed(s, i); | |
970 |
2/2✓ Branch 0 taken 84 times.
✓ Branch 1 taken 420 times.
|
504 | if (s->bits_per_sample > 16) |
971 | 84 | revert_cdlms32(s, i, 0, subframe_len); | |
972 | else | ||
973 | 420 | revert_cdlms16(s, i, 0, subframe_len); | |
974 | } else { | ||
975 | 24 | memset(s->channel_residues[i], 0, sizeof(**s->channel_residues) * subframe_len); | |
976 | } | ||
977 | } | ||
978 | |||
979 |
2/2✓ Branch 0 taken 219 times.
✓ Branch 1 taken 45 times.
|
264 | if (s->do_mclms) |
980 | 219 | revert_mclms(s, subframe_len); | |
981 |
1/2✓ Branch 0 taken 264 times.
✗ Branch 1 not taken.
|
264 | if (s->do_inter_ch_decorr) |
982 | 264 | revert_inter_ch_decorr(s, subframe_len); | |
983 |
1/2✓ Branch 0 taken 264 times.
✗ Branch 1 not taken.
|
264 | if (s->do_ac_filter) |
984 | 264 | revert_acfilter(s, subframe_len); | |
985 | |||
986 | /* Dequantize */ | ||
987 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 264 times.
|
264 | if (s->quant_stepsize != 1) |
988 | ✗ | for (i = 0; i < s->num_channels; i++) | |
989 | ✗ | for (j = 0; j < subframe_len; j++) | |
990 | ✗ | s->channel_residues[i][j] *= (unsigned)s->quant_stepsize; | |
991 | } | ||
992 | |||
993 | /* Write to proper output buffer depending on bit-depth */ | ||
994 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 269 times.
|
807 | for (i = 0; i < s->channels_for_cur_subframe; i++) { |
995 | 538 | int c = s->channel_indexes_for_cur_subframe[i]; | |
996 | 538 | int subframe_len = s->channel[c].subframe_len[s->channel[c].cur_subframe]; | |
997 | |||
998 |
2/2✓ Branch 0 taken 1101824 times.
✓ Branch 1 taken 538 times.
|
1102362 | for (j = 0; j < subframe_len; j++) { |
999 |
2/2✓ Branch 0 taken 860160 times.
✓ Branch 1 taken 241664 times.
|
1101824 | if (s->bits_per_sample == 16) { |
1000 | 860160 | *s->samples_16[c]++ = (int16_t) s->channel_residues[c][j] * (1 << padding_zeroes); | |
1001 | } else { | ||
1002 | 241664 | *s->samples_32[c]++ = s->channel_residues[c][j] * (256U << padding_zeroes); | |
1003 | } | ||
1004 | } | ||
1005 | } | ||
1006 | |||
1007 | /* handled one subframe */ | ||
1008 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 269 times.
|
807 | for (i = 0; i < s->channels_for_cur_subframe; i++) { |
1009 | 538 | int c = s->channel_indexes_for_cur_subframe[i]; | |
1010 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 538 times.
|
538 | if (s->channel[c].cur_subframe >= s->channel[c].num_subframes) { |
1011 | ✗ | av_log(s->avctx, AV_LOG_ERROR, "broken subframe\n"); | |
1012 | ✗ | return AVERROR_INVALIDDATA; | |
1013 | } | ||
1014 | 538 | ++s->channel[c].cur_subframe; | |
1015 | } | ||
1016 | 269 | return 0; | |
1017 | } | ||
1018 | |||
1019 | /** | ||
1020 | * @brief Decode one WMA frame. | ||
1021 | * @param s codec context | ||
1022 | * @return 0 if the trailer bit indicates that this is the last frame, | ||
1023 | * 1 if there are additional frames | ||
1024 | */ | ||
1025 | 269 | static int decode_frame(WmallDecodeCtx *s) | |
1026 | { | ||
1027 | 269 | GetBitContext* gb = &s->gb; | |
1028 | 269 | int more_frames = 0, len = 0, i, ret; | |
1029 | |||
1030 | 269 | s->frame->nb_samples = s->samples_per_frame; | |
1031 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 269 times.
|
269 | if ((ret = ff_get_buffer(s->avctx, s->frame, 0)) < 0) { |
1032 | /* return an error if no frame could be decoded at all */ | ||
1033 | ✗ | s->packet_loss = 1; | |
1034 | ✗ | s->frame->nb_samples = 0; | |
1035 | ✗ | return ret; | |
1036 | } | ||
1037 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 269 times.
|
807 | for (i = 0; i < s->num_channels; i++) { |
1038 | 538 | s->samples_16[i] = (int16_t *)s->frame->extended_data[i]; | |
1039 | 538 | s->samples_32[i] = (int32_t *)s->frame->extended_data[i]; | |
1040 | } | ||
1041 | |||
1042 | /* get frame length */ | ||
1043 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 269 times.
|
269 | if (s->len_prefix) |
1044 | ✗ | len = get_bits(gb, s->log2_frame_size); | |
1045 | |||
1046 | /* decode tile information */ | ||
1047 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 269 times.
|
269 | if ((ret = decode_tilehdr(s))) { |
1048 | ✗ | s->packet_loss = 1; | |
1049 | ✗ | av_frame_unref(s->frame); | |
1050 | ✗ | return ret; | |
1051 | } | ||
1052 | |||
1053 | /* read drc info */ | ||
1054 |
2/2✓ Branch 0 taken 50 times.
✓ Branch 1 taken 219 times.
|
269 | if (s->dynamic_range_compression) |
1055 | 50 | s->drc_gain = get_bits(gb, 8); | |
1056 | |||
1057 | /* no idea what these are for, might be the number of samples | ||
1058 | that need to be skipped at the beginning or end of a stream */ | ||
1059 |
2/2✓ Branch 1 taken 1 times.
✓ Branch 2 taken 268 times.
|
269 | if (get_bits1(gb)) { |
1060 | int av_unused skip; | ||
1061 | |||
1062 | /* usually true for the first frame */ | ||
1063 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 1 times.
|
1 | if (get_bits1(gb)) { |
1064 | ✗ | skip = get_bits(gb, av_log2(s->samples_per_frame * 2)); | |
1065 | ff_dlog(s->avctx, "start skip: %i\n", skip); | ||
1066 | } | ||
1067 | |||
1068 | /* sometimes true for the last frame */ | ||
1069 |
1/2✓ Branch 1 taken 1 times.
✗ Branch 2 not taken.
|
1 | if (get_bits1(gb)) { |
1070 | 1 | skip = get_bits(gb, av_log2(s->samples_per_frame * 2)); | |
1071 | ff_dlog(s->avctx, "end skip: %i\n", skip); | ||
1072 | 1 | s->frame->nb_samples -= skip; | |
1073 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
|
1 | if (s->frame->nb_samples <= 0) |
1074 | ✗ | return AVERROR_INVALIDDATA; | |
1075 | } | ||
1076 | |||
1077 | } | ||
1078 | |||
1079 | /* reset subframe states */ | ||
1080 | 269 | s->parsed_all_subframes = 0; | |
1081 |
2/2✓ Branch 0 taken 538 times.
✓ Branch 1 taken 269 times.
|
807 | for (i = 0; i < s->num_channels; i++) { |
1082 | 538 | s->channel[i].decoded_samples = 0; | |
1083 | 538 | s->channel[i].cur_subframe = 0; | |
1084 | } | ||
1085 | |||
1086 | /* decode all subframes */ | ||
1087 |
2/2✓ Branch 0 taken 269 times.
✓ Branch 1 taken 269 times.
|
538 | while (!s->parsed_all_subframes) { |
1088 | 269 | int decoded_samples = s->channel[0].decoded_samples; | |
1089 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 269 times.
|
269 | if (decode_subframe(s) < 0) { |
1090 | ✗ | s->packet_loss = 1; | |
1091 | ✗ | if (s->frame->nb_samples) | |
1092 | ✗ | s->frame->nb_samples = decoded_samples; | |
1093 | ✗ | return 0; | |
1094 | } | ||
1095 | } | ||
1096 | |||
1097 | ff_dlog(s->avctx, "Frame done\n"); | ||
1098 | |||
1099 | 269 | s->skip_frame = 0; | |
1100 | |||
1101 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 269 times.
|
269 | if (s->len_prefix) { |
1102 | ✗ | if (len != (get_bits_count(gb) - s->frame_offset) + 2) { | |
1103 | /* FIXME: not sure if this is always an error */ | ||
1104 | ✗ | av_log(s->avctx, AV_LOG_ERROR, | |
1105 | "frame[%"PRIu32"] would have to skip %i bits\n", | ||
1106 | s->frame_num, | ||
1107 | ✗ | len - (get_bits_count(gb) - s->frame_offset) - 1); | |
1108 | ✗ | s->packet_loss = 1; | |
1109 | ✗ | return 0; | |
1110 | } | ||
1111 | |||
1112 | /* skip the rest of the frame data */ | ||
1113 | ✗ | skip_bits_long(gb, len - (get_bits_count(gb) - s->frame_offset) - 1); | |
1114 | } | ||
1115 | |||
1116 | /* decode trailer bit */ | ||
1117 | 269 | more_frames = get_bits1(gb); | |
1118 | 269 | ++s->frame_num; | |
1119 | 269 | return more_frames; | |
1120 | } | ||
1121 | |||
1122 | /** | ||
1123 | * @brief Calculate remaining input buffer length. | ||
1124 | * @param s codec context | ||
1125 | * @param gb bitstream reader context | ||
1126 | * @return remaining size in bits | ||
1127 | */ | ||
1128 | 463 | static int remaining_bits(WmallDecodeCtx *s, GetBitContext *gb) | |
1129 | { | ||
1130 | 463 | return s->buf_bit_size - get_bits_count(gb); | |
1131 | } | ||
1132 | |||
1133 | /** | ||
1134 | * @brief Fill the bit reservoir with a (partial) frame. | ||
1135 | * @param s codec context | ||
1136 | * @param gb bitstream reader context | ||
1137 | * @param len length of the partial frame | ||
1138 | * @param append decides whether to reset the buffer or not | ||
1139 | */ | ||
1140 | 177 | static void save_bits(WmallDecodeCtx *s, GetBitContext* gb, int len, | |
1141 | int append) | ||
1142 | { | ||
1143 | int buflen; | ||
1144 | PutBitContext tmp; | ||
1145 | |||
1146 | /* when the frame data does not need to be concatenated, the input buffer | ||
1147 | is reset and additional bits from the previous frame are copied | ||
1148 | and skipped later so that a fast byte copy is possible */ | ||
1149 | |||
1150 |
2/2✓ Branch 0 taken 89 times.
✓ Branch 1 taken 88 times.
|
177 | if (!append) { |
1151 | 89 | s->frame_offset = get_bits_count(gb) & 7; | |
1152 | 89 | s->num_saved_bits = s->frame_offset; | |
1153 | 89 | init_put_bits(&s->pb, s->frame_data, s->max_frame_size); | |
1154 | } | ||
1155 | |||
1156 | 177 | buflen = (s->num_saved_bits + len + 8) >> 3; | |
1157 | |||
1158 |
2/4✓ Branch 0 taken 177 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 177 times.
|
177 | if (len <= 0 || buflen > s->max_frame_size) { |
1159 | ✗ | avpriv_request_sample(s->avctx, "Too small input buffer"); | |
1160 | ✗ | s->packet_loss = 1; | |
1161 | ✗ | s->num_saved_bits = 0; | |
1162 | ✗ | return; | |
1163 | } | ||
1164 | |||
1165 | 177 | s->num_saved_bits += len; | |
1166 |
2/2✓ Branch 0 taken 89 times.
✓ Branch 1 taken 88 times.
|
177 | if (!append) { |
1167 | 89 | ff_copy_bits(&s->pb, gb->buffer + (get_bits_count(gb) >> 3), | |
1168 | s->num_saved_bits); | ||
1169 | } else { | ||
1170 | 88 | int align = 8 - (get_bits_count(gb) & 7); | |
1171 | 88 | align = FFMIN(align, len); | |
1172 | 88 | put_bits(&s->pb, align, get_bits(gb, align)); | |
1173 | 88 | len -= align; | |
1174 | 88 | ff_copy_bits(&s->pb, gb->buffer + (get_bits_count(gb) >> 3), len); | |
1175 | } | ||
1176 | 177 | skip_bits_long(gb, len); | |
1177 | |||
1178 | 177 | tmp = s->pb; | |
1179 | 177 | flush_put_bits(&tmp); | |
1180 | |||
1181 | 177 | init_get_bits(&s->gb, s->frame_data, s->num_saved_bits); | |
1182 | 177 | skip_bits(&s->gb, s->frame_offset); | |
1183 | } | ||
1184 | |||
1185 | 285 | static int decode_packet(AVCodecContext *avctx, AVFrame *rframe, | |
1186 | int *got_frame_ptr, AVPacket* avpkt) | ||
1187 | { | ||
1188 | 285 | WmallDecodeCtx *s = avctx->priv_data; | |
1189 | 285 | GetBitContext* gb = &s->pgb; | |
1190 | 285 | const uint8_t* buf = avpkt->data; | |
1191 | 285 | int buf_size = avpkt->size; | |
1192 | int num_bits_prev_frame, packet_sequence_number, spliced_packet; | ||
1193 | |||
1194 | 285 | s->frame->nb_samples = 0; | |
1195 | |||
1196 |
2/2✓ Branch 0 taken 14 times.
✓ Branch 1 taken 271 times.
|
285 | if (!buf_size) { |
1197 | 14 | s->packet_done = 0; | |
1198 |
2/2✓ Branch 1 taken 3 times.
✓ Branch 2 taken 11 times.
|
14 | if (s->num_saved_bits <= get_bits_count(&s->gb)) |
1199 | 3 | return 0; | |
1200 |
2/2✓ Branch 1 taken 4 times.
✓ Branch 2 taken 7 times.
|
11 | if (!decode_frame(s)) |
1201 | 4 | s->num_saved_bits = 0; | |
1202 |
4/4✓ Branch 0 taken 183 times.
✓ Branch 1 taken 88 times.
✓ Branch 2 taken 4 times.
✓ Branch 3 taken 179 times.
|
271 | } else if (s->packet_done || s->packet_loss) { |
1203 | 92 | s->packet_done = 0; | |
1204 | |||
1205 | 92 | s->next_packet_start = buf_size - FFMIN(avctx->block_align, buf_size); | |
1206 | 92 | buf_size = FFMIN(avctx->block_align, buf_size); | |
1207 | 92 | s->buf_bit_size = buf_size << 3; | |
1208 | |||
1209 | /* parse packet header */ | ||
1210 | 92 | init_get_bits(gb, buf, s->buf_bit_size); | |
1211 | 92 | packet_sequence_number = get_bits(gb, 4); | |
1212 | 92 | skip_bits(gb, 1); // Skip seekable_frame_in_packet, currently unused | |
1213 | 92 | spliced_packet = get_bits1(gb); | |
1214 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 92 times.
|
92 | if (spliced_packet) |
1215 | ✗ | avpriv_request_sample(avctx, "Bitstream splicing"); | |
1216 | |||
1217 | /* get number of bits that need to be added to the previous frame */ | ||
1218 | 92 | num_bits_prev_frame = get_bits(gb, s->log2_frame_size); | |
1219 | |||
1220 | /* check for packet loss */ | ||
1221 |
2/2✓ Branch 0 taken 88 times.
✓ Branch 1 taken 4 times.
|
92 | if (!s->packet_loss && |
1222 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 88 times.
|
88 | ((s->packet_sequence_number + 1) & 0xF) != packet_sequence_number) { |
1223 | ✗ | s->packet_loss = 1; | |
1224 | ✗ | av_log(avctx, AV_LOG_ERROR, | |
1225 | "Packet loss detected! seq %"PRIx8" vs %x\n", | ||
1226 | ✗ | s->packet_sequence_number, packet_sequence_number); | |
1227 | } | ||
1228 | 92 | s->packet_sequence_number = packet_sequence_number; | |
1229 | |||
1230 |
2/2✓ Branch 0 taken 88 times.
✓ Branch 1 taken 4 times.
|
92 | if (num_bits_prev_frame > 0) { |
1231 | 88 | int remaining_packet_bits = s->buf_bit_size - get_bits_count(gb); | |
1232 |
2/2✓ Branch 0 taken 3 times.
✓ Branch 1 taken 85 times.
|
88 | if (num_bits_prev_frame >= remaining_packet_bits) { |
1233 | 3 | num_bits_prev_frame = remaining_packet_bits; | |
1234 | 3 | s->packet_done = 1; | |
1235 | } | ||
1236 | |||
1237 | /* Append the previous frame data to the remaining data from the | ||
1238 | * previous packet to create a full frame. */ | ||
1239 | 88 | save_bits(s, gb, num_bits_prev_frame, 1); | |
1240 | |||
1241 | /* decode the cross packet frame if it is valid */ | ||
1242 |
3/4✓ Branch 0 taken 85 times.
✓ Branch 1 taken 3 times.
✓ Branch 2 taken 85 times.
✗ Branch 3 not taken.
|
88 | if (num_bits_prev_frame < remaining_packet_bits && !s->packet_loss) |
1243 | 85 | decode_frame(s); | |
1244 | 4 | } else if (s->num_saved_bits - s->frame_offset) { | |
1245 | ff_dlog(avctx, "ignoring %x previously saved bits\n", | ||
1246 | s->num_saved_bits - s->frame_offset); | ||
1247 | } | ||
1248 | |||
1249 |
2/2✓ Branch 0 taken 4 times.
✓ Branch 1 taken 88 times.
|
92 | if (s->packet_loss) { |
1250 | /* Reset number of saved bits so that the decoder does not start | ||
1251 | * to decode incomplete frames in the s->len_prefix == 0 case. */ | ||
1252 | 4 | s->num_saved_bits = 0; | |
1253 | 4 | s->packet_loss = 0; | |
1254 | 4 | init_put_bits(&s->pb, s->frame_data, s->max_frame_size); | |
1255 | } | ||
1256 | |||
1257 | } else { | ||
1258 | int frame_size; | ||
1259 | |||
1260 | 179 | s->buf_bit_size = (avpkt->size - s->next_packet_start) << 3; | |
1261 | 179 | init_get_bits(gb, avpkt->data, s->buf_bit_size); | |
1262 | 179 | skip_bits(gb, s->packet_offset); | |
1263 | |||
1264 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 179 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
|
179 | if (s->len_prefix && remaining_bits(s, gb) > s->log2_frame_size && |
1265 | ✗ | (frame_size = show_bits(gb, s->log2_frame_size)) && | |
1266 | ✗ | frame_size <= remaining_bits(s, gb)) { | |
1267 | ✗ | save_bits(s, gb, frame_size, 0); | |
1268 | |||
1269 | ✗ | if (!s->packet_loss) | |
1270 | ✗ | s->packet_done = !decode_frame(s); | |
1271 |
1/2✓ Branch 0 taken 179 times.
✗ Branch 1 not taken.
|
179 | } else if (!s->len_prefix |
1272 |
2/2✓ Branch 1 taken 173 times.
✓ Branch 2 taken 6 times.
|
179 | && s->num_saved_bits > get_bits_count(&s->gb)) { |
1273 | /* when the frames do not have a length prefix, we don't know the | ||
1274 | * compressed length of the individual frames however, we know what | ||
1275 | * part of a new packet belongs to the previous frame therefore we | ||
1276 | * save the incoming packet first, then we append the "previous | ||
1277 | * frame" data from the next packet so that we get a buffer that | ||
1278 | * only contains full frames */ | ||
1279 | 173 | s->packet_done = !decode_frame(s); | |
1280 | } else { | ||
1281 | 6 | s->packet_done = 1; | |
1282 | } | ||
1283 | } | ||
1284 | |||
1285 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 282 times.
|
282 | if (remaining_bits(s, gb) < 0) { |
1286 | ✗ | av_log(avctx, AV_LOG_ERROR, "Overread %d\n", -remaining_bits(s, gb)); | |
1287 | ✗ | s->packet_loss = 1; | |
1288 | } | ||
1289 | |||
1290 |
5/6✓ Branch 0 taken 92 times.
✓ Branch 1 taken 190 times.
✓ Branch 2 taken 92 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 89 times.
✓ Branch 5 taken 3 times.
|
374 | if (s->packet_done && !s->packet_loss && |
1291 | 92 | remaining_bits(s, gb) > 0) { | |
1292 | /* save the rest of the data so that it can be decoded | ||
1293 | * with the next packet */ | ||
1294 | 89 | save_bits(s, gb, remaining_bits(s, gb), 0); | |
1295 | } | ||
1296 | |||
1297 | 282 | *got_frame_ptr = s->frame->nb_samples > 0; | |
1298 | 282 | av_frame_move_ref(rframe, s->frame); | |
1299 | |||
1300 | 282 | s->packet_offset = get_bits_count(gb) & 7; | |
1301 | |||
1302 |
1/2✓ Branch 0 taken 282 times.
✗ Branch 1 not taken.
|
282 | return (s->packet_loss) ? AVERROR_INVALIDDATA : get_bits_count(gb) >> 3; |
1303 | } | ||
1304 | |||
1305 | ✗ | static void flush(AVCodecContext *avctx) | |
1306 | { | ||
1307 | ✗ | WmallDecodeCtx *s = avctx->priv_data; | |
1308 | ✗ | s->packet_loss = 1; | |
1309 | ✗ | s->packet_done = 0; | |
1310 | ✗ | s->num_saved_bits = 0; | |
1311 | ✗ | s->frame_offset = 0; | |
1312 | ✗ | s->next_packet_start = 0; | |
1313 | ✗ | s->cdlms[0][0].order = 0; | |
1314 | ✗ | s->frame->nb_samples = 0; | |
1315 | ✗ | init_put_bits(&s->pb, s->frame_data, s->max_frame_size); | |
1316 | ✗ | } | |
1317 | |||
1318 | 8 | static av_cold int decode_close(AVCodecContext *avctx) | |
1319 | { | ||
1320 | 8 | WmallDecodeCtx *s = avctx->priv_data; | |
1321 | |||
1322 | 8 | av_frame_free(&s->frame); | |
1323 | 8 | av_freep(&s->frame_data); | |
1324 | |||
1325 | 8 | return 0; | |
1326 | } | ||
1327 | |||
1328 | const FFCodec ff_wmalossless_decoder = { | ||
1329 | .p.name = "wmalossless", | ||
1330 | CODEC_LONG_NAME("Windows Media Audio Lossless"), | ||
1331 | .p.type = AVMEDIA_TYPE_AUDIO, | ||
1332 | .p.id = AV_CODEC_ID_WMALOSSLESS, | ||
1333 | .priv_data_size = sizeof(WmallDecodeCtx), | ||
1334 | .init = decode_init, | ||
1335 | .close = decode_close, | ||
1336 | FF_CODEC_DECODE_CB(decode_packet), | ||
1337 | .flush = flush, | ||
1338 | .p.capabilities = | ||
1339 | #if FF_API_SUBFRAMES | ||
1340 | AV_CODEC_CAP_SUBFRAMES | | ||
1341 | #endif | ||
1342 | AV_CODEC_CAP_DR1 | AV_CODEC_CAP_DELAY, | ||
1343 | .caps_internal = FF_CODEC_CAP_INIT_CLEANUP, | ||
1344 | .p.sample_fmts = (const enum AVSampleFormat[]) { AV_SAMPLE_FMT_S16P, | ||
1345 | AV_SAMPLE_FMT_S32P, | ||
1346 | AV_SAMPLE_FMT_NONE }, | ||
1347 | }; | ||
1348 |