libavcodec/dv.c

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