Line | Branch | Exec | Source |
---|---|---|---|
1 | /* | ||
2 | * LucasArts VIMA decoder | ||
3 | * Copyright (c) 2012 Paul B Mahol | ||
4 | * | ||
5 | * This file is part of FFmpeg. | ||
6 | * | ||
7 | * FFmpeg is free software; you can redistribute it and/or | ||
8 | * modify it under the terms of the GNU Lesser General Public | ||
9 | * License as published by the Free Software Foundation; either | ||
10 | * version 2.1 of the License, or (at your option) any later version. | ||
11 | * | ||
12 | * FFmpeg is distributed in the hope that it will be useful, | ||
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
15 | * Lesser General Public License for more details. | ||
16 | * | ||
17 | * You should have received a copy of the GNU Lesser General Public | ||
18 | * License along with FFmpeg; if not, write to the Free Software | ||
19 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | ||
20 | */ | ||
21 | |||
22 | /** | ||
23 | * @file | ||
24 | * LucasArts VIMA audio decoder | ||
25 | * @author Paul B Mahol | ||
26 | */ | ||
27 | |||
28 | #include "libavutil/channel_layout.h" | ||
29 | #include "libavutil/thread.h" | ||
30 | |||
31 | #include "adpcm_data.h" | ||
32 | #include "avcodec.h" | ||
33 | #include "codec_internal.h" | ||
34 | #include "decode.h" | ||
35 | #include "get_bits.h" | ||
36 | |||
37 | static uint16_t predict_table[5786 * 2]; | ||
38 | |||
39 | static const uint8_t size_table[] = { | ||
40 | 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, | ||
41 | 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, | ||
42 | 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, | ||
43 | 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, | ||
44 | 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, | ||
45 | 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7 | ||
46 | }; | ||
47 | |||
48 | static const int8_t index_table1[] = { | ||
49 | -1, 4, -1, 4 | ||
50 | }; | ||
51 | |||
52 | static const int8_t index_table2[] = { | ||
53 | -1, -1, 2, 6, -1, -1, 2, 6 | ||
54 | }; | ||
55 | |||
56 | static const int8_t index_table3[] = { | ||
57 | -1, -1, -1, -1, 1, 2, 4, 6, -1, -1, -1, -1, 1, 2, 4, 6 | ||
58 | }; | ||
59 | |||
60 | static const int8_t index_table4[] = { | ||
61 | -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, 1, 2, 2, 4, 5, 6, | ||
62 | -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, 1, 2, 2, 4, 5, 6 | ||
63 | }; | ||
64 | |||
65 | static const int8_t index_table5[] = { | ||
66 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | ||
67 | 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 5, 5, 6, 6, | ||
68 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | ||
69 | 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 5, 5, 6, 6 | ||
70 | }; | ||
71 | |||
72 | static const int8_t index_table6[] = { | ||
73 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | ||
74 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | ||
75 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, | ||
76 | 2, 2, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, | ||
77 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | ||
78 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, | ||
79 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, | ||
80 | 2, 2, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6 | ||
81 | }; | ||
82 | |||
83 | static const int8_t *const step_index_tables[] = { | ||
84 | index_table1, index_table2, index_table3, | ||
85 | index_table4, index_table5, index_table6 | ||
86 | }; | ||
87 | |||
88 | 2 | static av_cold void predict_table_init(void) | |
89 | { | ||
90 |
2/2✓ Branch 0 taken 128 times.
✓ Branch 1 taken 2 times.
|
130 | for (int start_pos = 0; start_pos < 64; start_pos++) { |
91 | unsigned int dest_pos, table_pos; | ||
92 | |||
93 | 128 | for (table_pos = 0, dest_pos = start_pos; | |
94 |
2/2✓ Branch 0 taken 11392 times.
✓ Branch 1 taken 128 times.
|
11520 | table_pos < FF_ARRAY_ELEMS(ff_adpcm_step_table); |
95 | 11392 | table_pos++, dest_pos += 64) { | |
96 | 11392 | int put = 0, count, table_value; | |
97 | |||
98 | 11392 | table_value = ff_adpcm_step_table[table_pos]; | |
99 |
2/2✓ Branch 0 taken 68352 times.
✓ Branch 1 taken 11392 times.
|
79744 | for (count = 32; count != 0; count >>= 1) { |
100 |
2/2✓ Branch 0 taken 34176 times.
✓ Branch 1 taken 34176 times.
|
68352 | if (start_pos & count) |
101 | 34176 | put += table_value; | |
102 | 68352 | table_value >>= 1; | |
103 | } | ||
104 | 11392 | predict_table[dest_pos] = put; | |
105 | } | ||
106 | } | ||
107 | 2 | } | |
108 | |||
109 | 3 | static av_cold int decode_init(AVCodecContext *avctx) | |
110 | { | ||
111 | static AVOnce init_static_once = AV_ONCE_INIT; | ||
112 | |||
113 | 3 | avctx->sample_fmt = AV_SAMPLE_FMT_S16; | |
114 | |||
115 | 3 | ff_thread_once(&init_static_once, predict_table_init); | |
116 | |||
117 | 3 | return 0; | |
118 | } | ||
119 | |||
120 | 18 | static int decode_frame(AVCodecContext *avctx, AVFrame *frame, | |
121 | int *got_frame_ptr, AVPacket *pkt) | ||
122 | { | ||
123 | GetBitContext gb; | ||
124 | int16_t pcm_data[2]; | ||
125 | uint32_t samples; | ||
126 | int8_t channel_hint[2]; | ||
127 | int ret, chan; | ||
128 | 18 | int channels = 1; | |
129 | |||
130 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 18 times.
|
18 | if (pkt->size < 13) |
131 | ✗ | return AVERROR_INVALIDDATA; | |
132 | |||
133 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 18 times.
|
18 | if ((ret = init_get_bits8(&gb, pkt->data, pkt->size)) < 0) |
134 | ✗ | return ret; | |
135 | |||
136 | 18 | samples = get_bits_long(&gb, 32); | |
137 |
1/2✓ Branch 0 taken 18 times.
✗ Branch 1 not taken.
|
18 | if (samples == 0xffffffff) { |
138 | 18 | skip_bits_long(&gb, 32); | |
139 | 18 | samples = get_bits_long(&gb, 32); | |
140 | } | ||
141 | |||
142 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 18 times.
|
18 | if (samples > pkt->size * 2) |
143 | ✗ | return AVERROR_INVALIDDATA; | |
144 | |||
145 | 18 | channel_hint[0] = get_sbits(&gb, 8); | |
146 |
1/2✓ Branch 0 taken 18 times.
✗ Branch 1 not taken.
|
18 | if (channel_hint[0] & 0x80) { |
147 | 18 | channel_hint[0] = ~channel_hint[0]; | |
148 | 18 | channels = 2; | |
149 | } | ||
150 | 18 | av_channel_layout_uninit(&avctx->ch_layout); | |
151 | 18 | av_channel_layout_default(&avctx->ch_layout, channels); | |
152 | 18 | pcm_data[0] = get_sbits(&gb, 16); | |
153 |
1/2✓ Branch 0 taken 18 times.
✗ Branch 1 not taken.
|
18 | if (channels > 1) { |
154 | 18 | channel_hint[1] = get_sbits(&gb, 8); | |
155 | 18 | pcm_data[1] = get_sbits(&gb, 16); | |
156 | } | ||
157 | |||
158 | 18 | frame->nb_samples = samples; | |
159 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 18 times.
|
18 | if ((ret = ff_get_buffer(avctx, frame, 0)) < 0) |
160 | ✗ | return ret; | |
161 | |||
162 |
2/2✓ Branch 0 taken 36 times.
✓ Branch 1 taken 18 times.
|
54 | for (chan = 0; chan < channels; chan++) { |
163 | 36 | uint16_t *dest = (uint16_t *)frame->data[0] + chan; | |
164 | 36 | int step_index = channel_hint[chan]; | |
165 | 36 | int output = pcm_data[chan]; | |
166 | int sample; | ||
167 | |||
168 |
2/2✓ Branch 0 taken 485100 times.
✓ Branch 1 taken 36 times.
|
485136 | for (sample = 0; sample < samples; sample++) { |
169 | int lookup_size, lookup, highbit, lowbits; | ||
170 | |||
171 | 485100 | step_index = av_clip(step_index, 0, 88); | |
172 | 485100 | lookup_size = size_table[step_index]; | |
173 | 485100 | lookup = get_bits(&gb, lookup_size); | |
174 | 485100 | highbit = 1 << (lookup_size - 1); | |
175 | 485100 | lowbits = highbit - 1; | |
176 | |||
177 |
2/2✓ Branch 0 taken 235690 times.
✓ Branch 1 taken 249410 times.
|
485100 | if (lookup & highbit) |
178 | 235690 | lookup ^= highbit; | |
179 | else | ||
180 | 249410 | highbit = 0; | |
181 | |||
182 |
2/2✓ Branch 0 taken 20815 times.
✓ Branch 1 taken 464285 times.
|
485100 | if (lookup == lowbits) { |
183 | 20815 | output = get_sbits(&gb, 16); | |
184 | } else { | ||
185 | int predict_index, diff; | ||
186 | |||
187 | 464285 | predict_index = (lookup << (7 - lookup_size)) | (step_index << 6); | |
188 | 464285 | predict_index = av_clip(predict_index, 0, 5785); | |
189 | 464285 | diff = predict_table[predict_index]; | |
190 |
2/2✓ Branch 0 taken 391538 times.
✓ Branch 1 taken 72747 times.
|
464285 | if (lookup) |
191 | 391538 | diff += ff_adpcm_step_table[step_index] >> (lookup_size - 1); | |
192 |
2/2✓ Branch 0 taken 225304 times.
✓ Branch 1 taken 238981 times.
|
464285 | if (highbit) |
193 | 225304 | diff = -diff; | |
194 | |||
195 | 464285 | output = av_clip_int16(output + diff); | |
196 | } | ||
197 | |||
198 | 485100 | *dest = output; | |
199 | 485100 | dest += channels; | |
200 | |||
201 | 485100 | step_index += step_index_tables[lookup_size - 2][lookup]; | |
202 | } | ||
203 | } | ||
204 | |||
205 | 18 | *got_frame_ptr = 1; | |
206 | |||
207 | 18 | return pkt->size; | |
208 | } | ||
209 | |||
210 | const FFCodec ff_adpcm_vima_decoder = { | ||
211 | .p.name = "adpcm_vima", | ||
212 | CODEC_LONG_NAME("LucasArts VIMA audio"), | ||
213 | .p.type = AVMEDIA_TYPE_AUDIO, | ||
214 | .p.id = AV_CODEC_ID_ADPCM_VIMA, | ||
215 | .init = decode_init, | ||
216 | FF_CODEC_DECODE_CB(decode_frame), | ||
217 | .p.capabilities = AV_CODEC_CAP_DR1 | AV_CODEC_CAP_CHANNEL_CONF, | ||
218 | }; | ||
219 |