| Line | Branch | Exec | Source |
|---|---|---|---|
| 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 <stdint.h> | ||
| 42 | |||
| 43 | #include "libavutil/pixfmt.h" | ||
| 44 | |||
| 45 | #include "dv_internal.h" | ||
| 46 | #include "dv_profile.h" | ||
| 47 | |||
| 48 | 47223 | static inline void dv_calc_mb_coordinates(const AVDVProfile *d, int chan, | |
| 49 | int seq, int slot, uint16_t *tbl) | ||
| 50 | { | ||
| 51 | static const uint8_t off[] = { 2, 6, 8, 0, 4 }; | ||
| 52 | static const uint8_t shuf1[] = { 36, 18, 54, 0, 72 }; | ||
| 53 | static const uint8_t shuf2[] = { 24, 12, 36, 0, 48 }; | ||
| 54 | static const uint8_t shuf3[] = { 18, 9, 27, 0, 36 }; | ||
| 55 | |||
| 56 | static const uint8_t l_start[] = { 0, 4, 9, 13, 18, 22, 27, 31, 36, 40 }; | ||
| 57 | static const uint8_t l_start_shuffled[] = { 9, 4, 13, 0, 18 }; | ||
| 58 | |||
| 59 | static const uint8_t serpent1[] = { | ||
| 60 | 0, 1, 2, 2, 1, 0, | ||
| 61 | 0, 1, 2, 2, 1, 0, | ||
| 62 | 0, 1, 2, 2, 1, 0, | ||
| 63 | 0, 1, 2, 2, 1, 0, | ||
| 64 | 0, 1, 2 | ||
| 65 | }; | ||
| 66 | static const uint8_t serpent2[] = { | ||
| 67 | 0, 1, 2, 3, 4, 5, 5, 4, 3, 2, 1, 0, | ||
| 68 | 0, 1, 2, 3, 4, 5, 5, 4, 3, 2, 1, 0, | ||
| 69 | 0, 1, 2, 3, 4, 5 | ||
| 70 | }; | ||
| 71 | |||
| 72 | static const uint8_t remap[][2] = { | ||
| 73 | { 0, 0 }, { 0, 0 }, { 0, 0 }, { 0, 0 }, /* dummy */ | ||
| 74 | { 0, 0 }, { 0, 1 }, { 0, 2 }, { 0, 3 }, { 10, 0 }, | ||
| 75 | { 10, 1 }, { 10, 2 }, { 10, 3 }, { 20, 0 }, { 20, 1 }, | ||
| 76 | { 20, 2 }, { 20, 3 }, { 30, 0 }, { 30, 1 }, { 30, 2 }, | ||
| 77 | { 30, 3 }, { 40, 0 }, { 40, 1 }, { 40, 2 }, { 40, 3 }, | ||
| 78 | { 50, 0 }, { 50, 1 }, { 50, 2 }, { 50, 3 }, { 60, 0 }, | ||
| 79 | { 60, 1 }, { 60, 2 }, { 60, 3 }, { 70, 0 }, { 70, 1 }, | ||
| 80 | { 70, 2 }, { 70, 3 }, { 0, 64 }, { 0, 65 }, { 0, 66 }, | ||
| 81 | { 10, 64 }, { 10, 65 }, { 10, 66 }, { 20, 64 }, { 20, 65 }, | ||
| 82 | { 20, 66 }, { 30, 64 }, { 30, 65 }, { 30, 66 }, { 40, 64 }, | ||
| 83 | { 40, 65 }, { 40, 66 }, { 50, 64 }, { 50, 65 }, { 50, 66 }, | ||
| 84 | { 60, 64 }, { 60, 65 }, { 60, 66 }, { 70, 64 }, { 70, 65 }, | ||
| 85 | { 70, 66 }, { 0, 67 }, { 20, 67 }, { 40, 67 }, { 60, 67 } | ||
| 86 | }; | ||
| 87 | |||
| 88 | int i, k, m; | ||
| 89 | int x, y, blk; | ||
| 90 | |||
| 91 |
2/2✓ Branch 0 taken 236115 times.
✓ Branch 1 taken 47223 times.
|
283338 | for (m = 0; m < 5; m++) { |
| 92 |
3/5✓ Branch 0 taken 91125 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 35100 times.
✓ Branch 3 taken 109890 times.
✗ Branch 4 not taken.
|
236115 | switch (d->width) { |
| 93 | 91125 | case 1440: | |
| 94 | 91125 | blk = (chan * 11 + seq) * 27 + slot; | |
| 95 | |||
| 96 |
4/4✓ Branch 0 taken 24300 times.
✓ Branch 1 taken 66825 times.
✓ Branch 2 taken 2025 times.
✓ Branch 3 taken 22275 times.
|
91125 | if (chan == 0 && seq == 11) { |
| 97 | 2025 | x = m * 27 + slot; | |
| 98 |
2/2✓ Branch 0 taken 1350 times.
✓ Branch 1 taken 675 times.
|
2025 | if (x < 90) { |
| 99 | 1350 | y = 0; | |
| 100 | } else { | ||
| 101 | 675 | x = (x - 90) * 2; | |
| 102 | 675 | y = 67; | |
| 103 | } | ||
| 104 | } else { | ||
| 105 | 89100 | i = (4 * chan + blk + off[m]) % 11; | |
| 106 | 89100 | k = (blk / 11) % 27; | |
| 107 | |||
| 108 | 89100 | x = shuf1[m] + (chan & 1) * 9 + k % 9; | |
| 109 | 89100 | y = (i * 3 + k / 9) * 2 + (chan >> 1) + 1; | |
| 110 | } | ||
| 111 | 91125 | tbl[m] = (x << 1) | (y << 9); | |
| 112 | 91125 | 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 | 35100 | case 960: | |
| 129 | 35100 | blk = (chan * 10 + seq) * 27 + slot; | |
| 130 | |||
| 131 | 35100 | i = (4 * chan + (seq / 5) + 2 * blk + off[m]) % 10; | |
| 132 | 35100 | k = (blk / 5) % 27 + (i & 1) * 3; | |
| 133 | |||
| 134 | 35100 | x = shuf2[m] + k % 6 + 6 * (chan & 1); | |
| 135 | 35100 | y = l_start[i] + k / 6 + 45 * (chan >> 1); | |
| 136 | 35100 | tbl[m] = (x << 1) | (y << 9); | |
| 137 | 35100 | break; | |
| 138 | 109890 | case 720: | |
| 139 |
3/4✓ Branch 0 taken 45360 times.
✓ Branch 1 taken 38880 times.
✓ Branch 2 taken 25650 times.
✗ Branch 3 not taken.
|
109890 | switch (d->pix_fmt) { |
| 140 | 45360 | case AV_PIX_FMT_YUV422P: | |
| 141 | 45360 | x = shuf3[m] + slot / 3; | |
| 142 | 45360 | y = serpent1[slot] + | |
| 143 | 45360 | ((((seq + off[m]) % d->difseg_size) << 1) + chan) * 3; | |
| 144 | 45360 | tbl[m] = (x << 1) | (y << 8); | |
| 145 | 45360 | break; | |
| 146 | 38880 | case AV_PIX_FMT_YUV420P: | |
| 147 | 38880 | x = shuf3[m] + slot / 3; | |
| 148 | 38880 | y = serpent1[slot] + | |
| 149 | 38880 | ((seq + off[m]) % d->difseg_size) * 3; | |
| 150 | 38880 | tbl[m] = (x << 1) | (y << 9); | |
| 151 | 38880 | break; | |
| 152 | 25650 | case AV_PIX_FMT_YUV411P: | |
| 153 | 25650 | i = (seq + off[m]) % d->difseg_size; | |
| 154 |
4/4✓ Branch 0 taken 20520 times.
✓ Branch 1 taken 5130 times.
✓ Branch 2 taken 5130 times.
✓ Branch 3 taken 15390 times.
|
25650 | k = slot + ((m == 1 || m == 2) ? 3 : 0); |
| 155 | |||
| 156 | 25650 | x = l_start_shuffled[m] + k / 6; | |
| 157 | 25650 | y = serpent2[k] + i * 6; | |
| 158 |
2/2✓ Branch 0 taken 570 times.
✓ Branch 1 taken 25080 times.
|
25650 | if (x > 21) |
| 159 | 570 | y = y * 2 - i * 6; | |
| 160 | 25650 | tbl[m] = (x << 2) | (y << 8); | |
| 161 | 25650 | break; | |
| 162 | } | ||
| 163 | default: | ||
| 164 | 109890 | break; | |
| 165 | } | ||
| 166 | } | ||
| 167 | 47223 | } | |
| 168 | |||
| 169 | 83 | void ff_dv_init_dynamic_tables(DVwork_chunk *work_chunks, const AVDVProfile *d) | |
| 170 | { | ||
| 171 | int j, i, c, s, p; | ||
| 172 | |||
| 173 | 83 | p = i = 0; | |
| 174 |
2/2✓ Branch 0 taken 155 times.
✓ Branch 1 taken 83 times.
|
238 | for (c = 0; c < d->n_difchan; c++) { |
| 175 |
2/2✓ Branch 0 taken 1846 times.
✓ Branch 1 taken 155 times.
|
2001 | for (s = 0; s < d->difseg_size; s++) { |
| 176 | 1846 | p += 6; | |
| 177 |
2/2✓ Branch 0 taken 49842 times.
✓ Branch 1 taken 1846 times.
|
51688 | for (j = 0; j < 27; j++) { |
| 178 | 49842 | p += !(j % 3); | |
| 179 |
7/8✓ Branch 0 taken 19440 times.
✓ Branch 1 taken 30402 times.
✓ Branch 2 taken 19440 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 14580 times.
✓ Branch 5 taken 4860 times.
✓ Branch 6 taken 13365 times.
✓ Branch 7 taken 1215 times.
|
49842 | if (!(DV_PROFILE_IS_1080i50(d) && c != 0 && s == 11) && |
| 180 |
5/6✓ Branch 0 taken 8424 times.
✓ Branch 1 taken 40203 times.
✓ Branch 2 taken 8424 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 7020 times.
✓ Branch 5 taken 1404 times.
|
48627 | !(DV_PROFILE_IS_720p50(d) && s > 9)) { |
| 181 | 47223 | dv_calc_mb_coordinates(d, c, s, j, &work_chunks[i].mb_coordinates[0]); | |
| 182 | 47223 | work_chunks[i++].buf_offset = p; | |
| 183 | } | ||
| 184 | 49842 | p += 5; | |
| 185 | } | ||
| 186 | } | ||
| 187 | } | ||
| 188 | 83 | } | |
| 189 |