FFmpeg
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
dv.c
Go to the documentation of this file.
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 
41 #include "libavutil/internal.h"
42 #include "libavutil/pixdesc.h"
43 #include "avcodec.h"
44 #include "get_bits.h"
45 #include "internal.h"
46 #include "put_bits.h"
47 #include "simple_idct.h"
48 #include "dvdata.h"
49 #include "dv.h"
50 
51 /* XXX: also include quantization */
53 
54 static inline void dv_calc_mb_coordinates(const AVDVProfile *d, int chan, int seq, int slot,
55  uint16_t *tbl)
56 {
57  static const uint8_t off[] = { 2, 6, 8, 0, 4 };
58  static const uint8_t shuf1[] = { 36, 18, 54, 0, 72 };
59  static const uint8_t shuf2[] = { 24, 12, 36, 0, 48 };
60  static const uint8_t shuf3[] = { 18, 9, 27, 0, 36 };
61 
62  static const uint8_t l_start[] = {0, 4, 9, 13, 18, 22, 27, 31, 36, 40};
63  static const uint8_t l_start_shuffled[] = { 9, 4, 13, 0, 18 };
64 
65  static const uint8_t serpent1[] = {0, 1, 2, 2, 1, 0,
66  0, 1, 2, 2, 1, 0,
67  0, 1, 2, 2, 1, 0,
68  0, 1, 2, 2, 1, 0,
69  0, 1, 2};
70  static const uint8_t serpent2[] = {0, 1, 2, 3, 4, 5, 5, 4, 3, 2, 1, 0,
71  0, 1, 2, 3, 4, 5, 5, 4, 3, 2, 1, 0,
72  0, 1, 2, 3, 4, 5};
73 
74  static const uint8_t remap[][2] = {{ 0, 0}, { 0, 0}, { 0, 0}, { 0, 0}, /* dummy */
75  { 0, 0}, { 0, 1}, { 0, 2}, { 0, 3}, {10, 0},
76  {10, 1}, {10, 2}, {10, 3}, {20, 0}, {20, 1},
77  {20, 2}, {20, 3}, {30, 0}, {30, 1}, {30, 2},
78  {30, 3}, {40, 0}, {40, 1}, {40, 2}, {40, 3},
79  {50, 0}, {50, 1}, {50, 2}, {50, 3}, {60, 0},
80  {60, 1}, {60, 2}, {60, 3}, {70, 0}, {70, 1},
81  {70, 2}, {70, 3}, { 0,64}, { 0,65}, { 0,66},
82  {10,64}, {10,65}, {10,66}, {20,64}, {20,65},
83  {20,66}, {30,64}, {30,65}, {30,66}, {40,64},
84  {40,65}, {40,66}, {50,64}, {50,65}, {50,66},
85  {60,64}, {60,65}, {60,66}, {70,64}, {70,65},
86  {70,66}, { 0,67}, {20,67}, {40,67}, {60,67}};
87 
88  int i, k, m;
89  int x, y, blk;
90 
91  for (m=0; m<5; m++) {
92  switch (d->width) {
93  case 1440:
94  blk = (chan*11+seq)*27+slot;
95 
96  if (chan == 0 && seq == 11) {
97  x = m*27+slot;
98  if (x<90) {
99  y = 0;
100  } else {
101  x = (x - 90)*2;
102  y = 67;
103  }
104  } else {
105  i = (4*chan + blk + off[m])%11;
106  k = (blk/11)%27;
107 
108  x = shuf1[m] + (chan&1)*9 + k%9;
109  y = (i*3+k/9)*2 + (chan>>1) + 1;
110  }
111  tbl[m] = (x<<1)|(y<<9);
112  break;
113  case 1280:
114  blk = (chan*10+seq)*27+slot;
115 
116  i = (4*chan + (seq/5) + 2*blk + off[m])%10;
117  k = (blk/5)%27;
118 
119  x = shuf1[m]+(chan&1)*9 + k%9;
120  y = (i*3+k/9)*2 + (chan>>1) + 4;
121 
122  if (x >= 80) {
123  x = remap[y][0]+((x-80)<<(y>59));
124  y = remap[y][1];
125  }
126  tbl[m] = (x<<1)|(y<<9);
127  break;
128  case 960:
129  blk = (chan*10+seq)*27+slot;
130 
131  i = (4*chan + (seq/5) + 2*blk + off[m])%10;
132  k = (blk/5)%27 + (i&1)*3;
133 
134  x = shuf2[m] + k%6 + 6*(chan&1);
135  y = l_start[i] + k/6 + 45*(chan>>1);
136  tbl[m] = (x<<1)|(y<<9);
137  break;
138  case 720:
139  switch (d->pix_fmt) {
140  case AV_PIX_FMT_YUV422P:
141  x = shuf3[m] + slot/3;
142  y = serpent1[slot] +
143  ((((seq + off[m]) % d->difseg_size)<<1) + chan)*3;
144  tbl[m] = (x<<1)|(y<<8);
145  break;
146  case AV_PIX_FMT_YUV420P:
147  x = shuf3[m] + slot/3;
148  y = serpent1[slot] +
149  ((seq + off[m]) % d->difseg_size)*3;
150  tbl[m] = (x<<1)|(y<<9);
151  break;
152  case AV_PIX_FMT_YUV411P:
153  i = (seq + off[m]) % d->difseg_size;
154  k = slot + ((m==1||m==2)?3:0);
155 
156  x = l_start_shuffled[m] + k/6;
157  y = serpent2[k] + i*6;
158  if (x>21)
159  y = y*2 - i*6;
160  tbl[m] = (x<<2)|(y<<8);
161  break;
162  }
163  default:
164  break;
165  }
166  }
167 }
168 
169 /* quantization quanta by QNO for DV100 */
170 static const uint8_t dv100_qstep[16] = {
171  1, /* QNO = 0 and 1 both have no quantization */
172  1,
173  2, 3, 4, 5, 6, 7, 8, 16, 18, 20, 22, 24, 28, 52
174 };
175 
176 static const uint8_t dv_quant_areas[4] = { 6, 21, 43, 64 };
177 
179 {
180  int j,i,c,s,p;
181  uint32_t *factor1, *factor2;
182  const int *iweight1, *iweight2;
183 
184  p = i = 0;
185  for (c = 0; c < d->n_difchan; c++) {
186  for (s = 0; s < d->difseg_size; s++) {
187  p += 6;
188  for (j = 0; j < 27; j++) {
189  p += !(j % 3);
190  if (!(DV_PROFILE_IS_1080i50(d) && c != 0 && s == 11) &&
191  !(DV_PROFILE_IS_720p50(d) && s > 9)) {
192  dv_calc_mb_coordinates(d, c, s, j, &ctx->work_chunks[i].mb_coordinates[0]);
193  ctx->work_chunks[i++].buf_offset = p;
194  }
195  p += 5;
196  }
197  }
198  }
199 
200  factor1 = &ctx->idct_factor[0];
201  factor2 = &ctx->idct_factor[DV_PROFILE_IS_HD(d) ? 4096 : 2816];
202  if (d->height == 720) {
203  iweight1 = &ff_dv_iweight_720_y[0];
204  iweight2 = &ff_dv_iweight_720_c[0];
205  } else {
206  iweight1 = &ff_dv_iweight_1080_y[0];
207  iweight2 = &ff_dv_iweight_1080_c[0];
208  }
209  if (DV_PROFILE_IS_HD(d)) {
210  for (c = 0; c < 4; c++) {
211  for (s = 0; s < 16; s++) {
212  for (i = 0; i < 64; i++) {
213  *factor1++ = (dv100_qstep[s] << (c + 9)) * iweight1[i];
214  *factor2++ = (dv100_qstep[s] << (c + 9)) * iweight2[i];
215  }
216  }
217  }
218  } else {
219  iweight1 = &ff_dv_iweight_88[0];
220  for (j = 0; j < 2; j++, iweight1 = &ff_dv_iweight_248[0]) {
221  for (s = 0; s < 22; s++) {
222  for (i = c = 0; c < 4; c++) {
223  for (; i < dv_quant_areas[c]; i++) {
224  *factor1 = iweight1[i] << (ff_dv_quant_shifts[s][c] + 1);
225  *factor2++ = (*factor1++) << 1;
226  }
227  }
228  }
229  }
230  }
231 
232  return 0;
233 }
234 
236 {
237  DVVideoContext *s = avctx->priv_data;
238  static int done = 0;
239  int i, j;
240 
241  if (!done) {
242  VLC dv_vlc;
243  uint16_t new_dv_vlc_bits[NB_DV_VLC*2];
244  uint8_t new_dv_vlc_len[NB_DV_VLC*2];
245  uint8_t new_dv_vlc_run[NB_DV_VLC*2];
246  int16_t new_dv_vlc_level[NB_DV_VLC*2];
247 
248  done = 1;
249 
250  /* it's faster to include sign bit in a generic VLC parsing scheme */
251  for (i = 0, j = 0; i < NB_DV_VLC; i++, j++) {
252  new_dv_vlc_bits[j] = ff_dv_vlc_bits[i];
253  new_dv_vlc_len[j] = ff_dv_vlc_len[i];
254  new_dv_vlc_run[j] = ff_dv_vlc_run[i];
255  new_dv_vlc_level[j] = ff_dv_vlc_level[i];
256 
257  if (ff_dv_vlc_level[i]) {
258  new_dv_vlc_bits[j] <<= 1;
259  new_dv_vlc_len[j]++;
260 
261  j++;
262  new_dv_vlc_bits[j] = (ff_dv_vlc_bits[i] << 1) | 1;
263  new_dv_vlc_len[j] = ff_dv_vlc_len[i] + 1;
264  new_dv_vlc_run[j] = ff_dv_vlc_run[i];
265  new_dv_vlc_level[j] = -ff_dv_vlc_level[i];
266  }
267  }
268 
269  /* NOTE: as a trick, we use the fact the no codes are unused
270  to accelerate the parsing of partial codes */
271  init_vlc(&dv_vlc, TEX_VLC_BITS, j,
272  new_dv_vlc_len, 1, 1, new_dv_vlc_bits, 2, 2, 0);
273  av_assert1(dv_vlc.table_size == 1184);
274 
275  for (i = 0; i < dv_vlc.table_size; i++){
276  int code = dv_vlc.table[i][0];
277  int len = dv_vlc.table[i][1];
278  int level, run;
279 
280  if (len < 0){ //more bits needed
281  run = 0;
282  level = code;
283  } else {
284  run = new_dv_vlc_run [code] + 1;
285  level = new_dv_vlc_level[code];
286  }
287  ff_dv_rl_vlc[i].len = len;
288  ff_dv_rl_vlc[i].level = level;
289  ff_dv_rl_vlc[i].run = run;
290  }
291  ff_free_vlc(&dv_vlc);
292  }
293 
294  s->avctx = avctx;
296 
297  return 0;
298 }
299