1 /*
2 * DV decoder
3 * Copyright (c) 2002 Fabrice Bellard
4 * Copyright (c) 2004 Roman Shaposhnik
5 *
6 * DV encoder
7 * Copyright (c) 2003 Roman Shaposhnik
8 *
9 * 50 Mbps (DVCPRO50) support
10 * Copyright (c) 2006 Daniel Maas <dmaas@maasdigital.com>
11 *
12 * 100 Mbps (DVCPRO HD) support
13 * Initial code by Daniel Maas <dmaas@maasdigital.com> (funded by BBC R&D)
14 * Final code by Roman Shaposhnik
15 *
16 * Many thanks to Dan Dennedy <dan@dennedy.org> for providing wealth
17 * of DV technical info.
18 *
19 * This file is part of FFmpeg.
20 *
21 * FFmpeg is free software; you can redistribute it and/or
22 * modify it under the terms of the GNU Lesser General Public
23 * License as published by the Free Software Foundation; either
24 * version 2.1 of the License, or (at your option) any later version.
25 *
26 * FFmpeg is distributed in the hope that it will be useful,
27 * but WITHOUT ANY WARRANTY; without even the implied warranty of
28 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
29 * Lesser General Public License for more details.
30 *
31 * You should have received a copy of the GNU Lesser General Public
32 * License along with FFmpeg; if not, write to the Free Software
33 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
34 */
35
36 /**
37 * @file
38 * DV codec.
39 */
40
43
51
52 /* XXX: also include quantization */
54
56 int seq, int slot, uint16_t *tbl)
57 {
58 static const uint8_t off[] = { 2, 6, 8, 0, 4 };
59 static const uint8_t shuf1[] = { 36, 18, 54, 0, 72 };
60 static const uint8_t shuf2[] = { 24, 12, 36, 0, 48 };
61 static const uint8_t shuf3[] = { 18, 9, 27, 0, 36 };
62
63 static const uint8_t l_start[] = { 0, 4, 9, 13, 18, 22, 27, 31, 36, 40 };
64 static const uint8_t l_start_shuffled[] = { 9, 4, 13, 0, 18 };
65
66 static const uint8_t serpent1[] = {
67 0, 1, 2, 2, 1, 0,
68 0, 1, 2, 2, 1, 0,
69 0, 1, 2, 2, 1, 0,
70 0, 1, 2, 2, 1, 0,
71 0, 1, 2
72 };
73 static const uint8_t serpent2[] = {
74 0, 1, 2, 3, 4, 5, 5, 4, 3, 2, 1, 0,
75 0, 1, 2, 3, 4, 5, 5, 4, 3, 2, 1, 0,
76 0, 1, 2, 3, 4, 5
77 };
78
80 { 0, 0 }, { 0, 0 }, { 0, 0 }, { 0, 0 }, /* dummy */
81 { 0, 0 }, { 0, 1 }, { 0, 2 }, { 0, 3 }, { 10, 0 },
82 { 10, 1 }, { 10, 2 }, { 10, 3 }, { 20, 0 }, { 20, 1 },
83 { 20, 2 }, { 20, 3 }, { 30, 0 }, { 30, 1 }, { 30, 2 },
84 { 30, 3 }, { 40, 0 }, { 40, 1 }, { 40, 2 }, { 40, 3 },
85 { 50, 0 }, { 50, 1 }, { 50, 2 }, { 50, 3 }, { 60, 0 },
86 { 60, 1 }, { 60, 2 }, { 60, 3 }, { 70, 0 }, { 70, 1 },
87 { 70, 2 }, { 70, 3 }, { 0, 64 }, { 0, 65 }, { 0, 66 },
88 { 10, 64 }, { 10, 65 }, { 10, 66 }, { 20, 64 }, { 20, 65 },
89 { 20, 66 }, { 30, 64 }, { 30, 65 }, { 30, 66 }, { 40, 64 },
90 { 40, 65 }, { 40, 66 }, { 50, 64 }, { 50, 65 }, { 50, 66 },
91 { 60, 64 }, { 60, 65 }, { 60, 66 }, { 70, 64 }, { 70, 65 },
92 { 70, 66 }, { 0, 67 }, { 20, 67 }, { 40, 67 }, { 60, 67 }
93 };
94
97
98 for (m = 0; m < 5; m++) {
100 case 1440:
101 blk = (chan * 11 + seq) * 27 + slot;
102
103 if (chan == 0 && seq == 11) {
104 x = m * 27 + slot;
105 if (x < 90) {
106 y = 0;
107 } else {
108 x = (x - 90) * 2;
109 y = 67;
110 }
111 } else {
112 i = (4 * chan + blk + off[
m]) % 11;
113 k = (blk / 11) % 27;
114
115 x = shuf1[
m] + (chan & 1) * 9 + k % 9;
116 y = (i * 3 + k / 9) * 2 + (chan >> 1) + 1;
117 }
118 tbl[
m] = (x << 1) | (y << 9);
119 break;
120 case 1280:
121 blk = (chan * 10 + seq) * 27 + slot;
122
123 i = (4 * chan + (seq / 5) + 2 * blk + off[m]) % 10;
124 k = (blk / 5) % 27;
125
126 x = shuf1[
m] + (chan & 1) * 9 + k % 9;
127 y = (i * 3 + k / 9) * 2 + (chan >> 1) + 4;
128
129 if (x >= 80) {
130 x = remap[
y][0] + ((x - 80) << (y > 59));
132 }
133 tbl[
m] = (x << 1) | (y << 9);
134 break;
135 case 960:
136 blk = (chan * 10 + seq) * 27 + slot;
137
138 i = (4 * chan + (seq / 5) + 2 * blk + off[m]) % 10;
139 k = (blk / 5) % 27 + (i & 1) * 3;
140
141 x = shuf2[
m] + k % 6 + 6 * (chan & 1);
142 y = l_start[i] + k / 6 + 45 * (chan >> 1);
143 tbl[
m] = (x << 1) | (y << 9);
144 break;
145 case 720:
148 x = shuf3[
m] + slot / 3;
149 y = serpent1[slot] +
151 tbl[
m] = (x << 1) | (y << 8);
152 break;
154 x = shuf3[
m] + slot / 3;
155 y = serpent1[slot] +
157 tbl[
m] = (x << 1) | (y << 9);
158 break;
161 k = slot + ((m == 1 || m == 2) ? 3 : 0);
162
163 x = l_start_shuffled[
m] + k / 6;
164 y = serpent2[k] + i * 6;
165 if (x > 21)
166 y = y * 2 - i * 6;
167 tbl[
m] = (x << 2) | (y << 8);
168 break;
169 }
170 default:
171 break;
172 }
173 }
174 }
175
176 /* quantization quanta by QNO for DV100 */
178 1, /* QNO = 0 and 1 both have no quantization */
179 1,
180 2, 3, 4, 5, 6, 7, 8, 16, 18, 20, 22, 24, 28, 52
181 };
182
184
186 {
188
189 p = i = 0;
192 p += 6;
193 for (j = 0; j < 27; j++) {
194 p += !(j % 3);
199 }
200 p += 5;
201 }
202 }
203 }
204
205 return 0;
206 }
207
209 {
211 static int done = 0;
212 int i, j;
213
214 if (!done) {
220
221 done = 1;
222
223 /* it's faster to include sign bit in a generic VLC parsing scheme */
224 for (i = 0, j = 0; i <
NB_DV_VLC; i++, j++) {
229
231 new_dv_vlc_bits[j] <<= 1;
232 new_dv_vlc_len[j]++;
233
234 j++;
239 }
240 }
241
242 /* NOTE: as a trick, we use the fact the no codes are unused
243 * to accelerate the parsing of partial codes */
245 1, 1, new_dv_vlc_bits, 2, 2, 0);
247
249 int code = dv_vlc.
table[i][0];
252
253 if (len < 0) { // more bits needed
254 run = 0;
255 level = code;
256 } else {
257 run = new_dv_vlc_run[code] + 1;
258 level = new_dv_vlc_level[code];
259 }
260 ff_dv_rl_vlc[i].
len =
len;
262 ff_dv_rl_vlc[i].
run =
run;
263 }
265 }
266
269
270 return 0;
271 }
272