| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /* | ||
| 2 | * JPEG-LS decoder | ||
| 3 | * Copyright (c) 2003 Michael Niedermayer | ||
| 4 | * Copyright (c) 2006 Konstantin Shishkov | ||
| 5 | * | ||
| 6 | * This file is part of FFmpeg. | ||
| 7 | * | ||
| 8 | * FFmpeg is free software; you can redistribute it and/or | ||
| 9 | * modify it under the terms of the GNU Lesser General Public | ||
| 10 | * License as published by the Free Software Foundation; either | ||
| 11 | * version 2.1 of the License, or (at your option) any later version. | ||
| 12 | * | ||
| 13 | * FFmpeg is distributed in the hope that it will be useful, | ||
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
| 16 | * Lesser General Public License for more details. | ||
| 17 | * | ||
| 18 | * You should have received a copy of the GNU Lesser General Public | ||
| 19 | * License along with FFmpeg; if not, write to the Free Software | ||
| 20 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | ||
| 21 | */ | ||
| 22 | |||
| 23 | /** | ||
| 24 | * @file | ||
| 25 | * JPEG-LS decoder. | ||
| 26 | */ | ||
| 27 | |||
| 28 | #include "libavutil/mem.h" | ||
| 29 | #include "avcodec.h" | ||
| 30 | #include "codec_internal.h" | ||
| 31 | #include "get_bits.h" | ||
| 32 | #include "golomb.h" | ||
| 33 | #include "mathops.h" | ||
| 34 | #include "mjpegdec.h" | ||
| 35 | #include "jpegls.h" | ||
| 36 | #include "jpeglsdec.h" | ||
| 37 | |||
| 38 | /* | ||
| 39 | * Uncomment this to significantly speed up decoding of broken JPEG-LS | ||
| 40 | * (or test broken JPEG-LS decoder) and slow down ordinary decoding a bit. | ||
| 41 | * | ||
| 42 | * There is no Golomb code with length >= 32 bits possible, so check and | ||
| 43 | * avoid situation of 32 zeros, FFmpeg Golomb decoder is painfully slow | ||
| 44 | * on this errors. | ||
| 45 | */ | ||
| 46 | //#define JLS_BROKEN | ||
| 47 | |||
| 48 | /** | ||
| 49 | * Decode LSE block with initialization parameters | ||
| 50 | */ | ||
| 51 | 16 | int ff_jpegls_decode_lse(MJpegDecodeContext *s) | |
| 52 | { | ||
| 53 | int id; | ||
| 54 | int tid, wt, maxtab, i, j; | ||
| 55 | |||
| 56 | 16 | int len = get_bits(&s->gb, 16); | |
| 57 | 16 | id = get_bits(&s->gb, 8); | |
| 58 | |||
| 59 |
1/5✗ Branch 0 not taken.
✓ Branch 1 taken 16 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
|
16 | switch (id) { |
| 60 | ✗ | case 1: | |
| 61 | ✗ | if (len < 13) | |
| 62 | ✗ | return AVERROR_INVALIDDATA; | |
| 63 | |||
| 64 | ✗ | s->maxval = get_bits(&s->gb, 16); | |
| 65 | ✗ | s->t1 = get_bits(&s->gb, 16); | |
| 66 | ✗ | s->t2 = get_bits(&s->gb, 16); | |
| 67 | ✗ | s->t3 = get_bits(&s->gb, 16); | |
| 68 | ✗ | s->reset = get_bits(&s->gb, 16); | |
| 69 | |||
| 70 | ✗ | if (s->avctx->debug & FF_DEBUG_PICT_INFO) { | |
| 71 | ✗ | av_log(s->avctx, AV_LOG_DEBUG, "Coding parameters maxval:%d T1:%d T2:%d T3:%d reset:%d\n", | |
| 72 | s->maxval, s->t1, s->t2, s->t3, s->reset); | ||
| 73 | } | ||
| 74 | |||
| 75 | // ff_jpegls_reset_coding_parameters(s, 0); | ||
| 76 | //FIXME quant table? | ||
| 77 | ✗ | break; | |
| 78 | 16 | case 2: | |
| 79 | 16 | s->palette_index = 0; | |
| 80 | 16 | case 3: | |
| 81 | 16 | tid= get_bits(&s->gb, 8); | |
| 82 | 16 | wt = get_bits(&s->gb, 8); | |
| 83 | |||
| 84 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 16 times.
|
16 | if (len < 5) |
| 85 | ✗ | return AVERROR_INVALIDDATA; | |
| 86 | |||
| 87 |
2/4✓ Branch 0 taken 16 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 16 times.
|
16 | if (wt < 1 || wt > MAX_COMPONENTS) { |
| 88 | ✗ | avpriv_request_sample(s->avctx, "wt %d", wt); | |
| 89 | ✗ | return AVERROR_PATCHWELCOME; | |
| 90 | } | ||
| 91 | |||
| 92 |
1/2✓ Branch 0 taken 16 times.
✗ Branch 1 not taken.
|
16 | if (!s->maxval) |
| 93 | 16 | maxtab = 255; | |
| 94 | ✗ | else if ((5 + wt*(s->maxval+1)) < 65535) | |
| 95 | ✗ | maxtab = s->maxval; | |
| 96 | else | ||
| 97 | ✗ | maxtab = 65530/wt - 1; | |
| 98 | |||
| 99 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 16 times.
|
16 | if (s->avctx->debug & FF_DEBUG_PICT_INFO) { |
| 100 | ✗ | av_log(s->avctx, AV_LOG_DEBUG, "LSE palette %d tid:%d wt:%d maxtab:%d\n", id, tid, wt, maxtab); | |
| 101 | } | ||
| 102 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 16 times.
|
16 | if (maxtab >= 256) { |
| 103 | ✗ | avpriv_request_sample(s->avctx, ">8bit palette"); | |
| 104 | ✗ | return AVERROR_PATCHWELCOME; | |
| 105 | } | ||
| 106 | 16 | maxtab = FFMIN(maxtab, (len - 5) / wt + s->palette_index); | |
| 107 | |||
| 108 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 16 times.
|
16 | if (s->palette_index > maxtab) |
| 109 | ✗ | return AVERROR_INVALIDDATA; | |
| 110 | |||
| 111 |
3/4✓ Branch 0 taken 8 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 8 times.
✗ Branch 3 not taken.
|
16 | if ((s->avctx->pix_fmt == AV_PIX_FMT_GRAY8 || s->avctx->pix_fmt == AV_PIX_FMT_PAL8) && |
| 112 |
3/4✓ Branch 0 taken 8 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 8 times.
✗ Branch 3 not taken.
|
16 | (s->picture_ptr->format == AV_PIX_FMT_GRAY8 || s->picture_ptr->format == AV_PIX_FMT_PAL8)) { |
| 113 | 16 | uint32_t *pal = (uint32_t *)s->picture_ptr->data[1]; | |
| 114 | 16 | int shift = 0; | |
| 115 | |||
| 116 |
2/4✓ Branch 0 taken 16 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 16 times.
✗ Branch 3 not taken.
|
16 | if (s->avctx->bits_per_raw_sample > 0 && s->avctx->bits_per_raw_sample < 8) { |
| 117 |
1/2✓ Branch 0 taken 16 times.
✗ Branch 1 not taken.
|
16 | maxtab = FFMIN(maxtab, (1<<s->avctx->bits_per_raw_sample)-1); |
| 118 | 16 | shift = 8 - s->avctx->bits_per_raw_sample; | |
| 119 | } | ||
| 120 | |||
| 121 | 16 | s->force_pal8++; | |
| 122 |
2/2✓ Branch 0 taken 8 times.
✓ Branch 1 taken 8 times.
|
16 | if (!pal) { |
| 123 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 8 times.
|
8 | if (s->force_pal8 > 1) |
| 124 | ✗ | return AVERROR_INVALIDDATA; | |
| 125 | 8 | return 1; | |
| 126 | } | ||
| 127 | |||
| 128 |
2/2✓ Branch 0 taken 344 times.
✓ Branch 1 taken 8 times.
|
352 | for (i=s->palette_index; i<=maxtab; i++) { |
| 129 | 344 | uint8_t k = i << shift; | |
| 130 |
1/2✓ Branch 0 taken 344 times.
✗ Branch 1 not taken.
|
344 | pal[k] = wt < 4 ? 0xFF000000 : 0; |
| 131 |
2/2✓ Branch 0 taken 1032 times.
✓ Branch 1 taken 344 times.
|
1376 | for (j=0; j<wt; j++) { |
| 132 | 1032 | pal[k] |= get_bits(&s->gb, 8) << (8*(wt-j-1)); | |
| 133 | } | ||
| 134 | } | ||
| 135 | 8 | s->palette_index = i; | |
| 136 | } | ||
| 137 | 8 | break; | |
| 138 | ✗ | case 4: | |
| 139 | ✗ | avpriv_request_sample(s->avctx, "oversize image"); | |
| 140 | ✗ | return AVERROR(ENOSYS); | |
| 141 | ✗ | default: | |
| 142 | ✗ | av_log(s->avctx, AV_LOG_ERROR, "invalid id %d\n", id); | |
| 143 | ✗ | return AVERROR_INVALIDDATA; | |
| 144 | } | ||
| 145 | ff_dlog(s->avctx, "ID=%i, T=%i,%i,%i\n", id, s->t1, s->t2, s->t3); | ||
| 146 | |||
| 147 | 8 | return 0; | |
| 148 | } | ||
| 149 | |||
| 150 | /** | ||
| 151 | * Get context-dependent Golomb code, decode it and update context | ||
| 152 | */ | ||
| 153 | 46507616 | static inline int ls_get_code_regular(GetBitContext *gb, JLSState *state, int Q) | |
| 154 | { | ||
| 155 | int k, ret; | ||
| 156 | |||
| 157 |
2/2✓ Branch 0 taken 120390394 times.
✓ Branch 1 taken 46507616 times.
|
166898010 | for (k = 0; ((unsigned)state->N[Q] << k) < state->A[Q]; k++) |
| 158 | ; | ||
| 159 | |||
| 160 | #ifdef JLS_BROKEN | ||
| 161 | if (!show_bits_long(gb, 32)) | ||
| 162 | return -1; | ||
| 163 | #endif | ||
| 164 | 46507616 | ret = get_ur_golomb_jpegls(gb, k, state->limit, state->qbpp); | |
| 165 | |||
| 166 | /* decode mapped error */ | ||
| 167 |
2/2✓ Branch 0 taken 23829574 times.
✓ Branch 1 taken 22678042 times.
|
46507616 | if (ret & 1) |
| 168 | 23829574 | ret = -(ret + 1 >> 1); | |
| 169 | else | ||
| 170 | 22678042 | ret >>= 1; | |
| 171 | |||
| 172 | /* for NEAR=0, k=0 and 2*B[Q] <= - N[Q] mapping is reversed */ | ||
| 173 |
5/6✓ Branch 0 taken 46507616 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 2699029 times.
✓ Branch 3 taken 43808587 times.
✓ Branch 4 taken 840496 times.
✓ Branch 5 taken 1858533 times.
|
46507616 | if (!state->near && !k && (2 * state->B[Q] <= -state->N[Q])) |
| 174 | 840496 | ret = -(ret + 1); | |
| 175 | |||
| 176 | 46507616 | ret = ff_jpegls_update_state_regular(state, Q, ret); | |
| 177 | |||
| 178 | 46507616 | return ret; | |
| 179 | } | ||
| 180 | |||
| 181 | /** | ||
| 182 | * Get Golomb code, decode it and update state for run termination | ||
| 183 | */ | ||
| 184 | 783661 | static inline int ls_get_code_runterm(GetBitContext *gb, JLSState *state, | |
| 185 | int RItype, int limit_add) | ||
| 186 | { | ||
| 187 | int k, ret, temp, map; | ||
| 188 | 783661 | int Q = 365 + RItype; | |
| 189 | |||
| 190 | 783661 | temp = state->A[Q]; | |
| 191 |
2/2✓ Branch 0 taken 509232 times.
✓ Branch 1 taken 274429 times.
|
783661 | if (RItype) |
| 192 | 509232 | temp += state->N[Q] >> 1; | |
| 193 | |||
| 194 |
2/2✓ Branch 0 taken 1884419 times.
✓ Branch 1 taken 783661 times.
|
2668080 | for (k = 0; ((unsigned)state->N[Q] << k) < temp; k++) |
| 195 | ; | ||
| 196 | |||
| 197 | #ifdef JLS_BROKEN | ||
| 198 | if (!show_bits_long(gb, 32)) | ||
| 199 | return -1; | ||
| 200 | #endif | ||
| 201 | 783661 | ret = get_ur_golomb_jpegls(gb, k, state->limit - limit_add - 1, | |
| 202 | state->qbpp); | ||
| 203 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 783661 times.
|
783661 | if (ret < 0) |
| 204 | ✗ | return -0x10000; | |
| 205 | |||
| 206 | /* decode mapped error */ | ||
| 207 | 783661 | map = 0; | |
| 208 |
8/8✓ Branch 0 taken 153938 times.
✓ Branch 1 taken 629723 times.
✓ Branch 2 taken 26894 times.
✓ Branch 3 taken 127044 times.
✓ Branch 4 taken 2304 times.
✓ Branch 5 taken 24590 times.
✓ Branch 6 taken 60548 times.
✓ Branch 7 taken 68800 times.
|
783661 | if (!k && (RItype || ret) && (2 * state->B[Q] < state->N[Q])) |
| 209 | 60548 | map = 1; | |
| 210 | 783661 | ret += RItype + map; | |
| 211 | |||
| 212 |
2/2✓ Branch 0 taken 351896 times.
✓ Branch 1 taken 431765 times.
|
783661 | if (ret & 1) { |
| 213 | 351896 | ret = map - (ret + 1 >> 1); | |
| 214 | 351896 | state->B[Q]++; | |
| 215 | } else { | ||
| 216 | 431765 | ret = ret >> 1; | |
| 217 | } | ||
| 218 | |||
| 219 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 783661 times.
|
783661 | if (FFABS(ret) > 0xFFFF) |
| 220 | ✗ | return -0x10000; | |
| 221 | /* update state */ | ||
| 222 | 783661 | state->A[Q] += FFABS(ret) - RItype; | |
| 223 | 783661 | ret *= state->twonear; | |
| 224 | 783661 | ff_jpegls_downscale_state(state, Q); | |
| 225 | |||
| 226 | 783661 | return ret; | |
| 227 | } | ||
| 228 | |||
| 229 | /** | ||
| 230 | * Decode one line of image | ||
| 231 | */ | ||
| 232 | 143946 | static inline int ls_decode_line(JLSState *state, MJpegDecodeContext *s, | |
| 233 | void *last, void *dst, int last2, int w, | ||
| 234 | int stride, int comp, int bits) | ||
| 235 | { | ||
| 236 | 143946 | int i, x = 0; | |
| 237 | int Ra, Rb, Rc, Rd; | ||
| 238 | int D0, D1, D2; | ||
| 239 | |||
| 240 |
2/2✓ Branch 0 taken 47299272 times.
✓ Branch 1 taken 135951 times.
|
47435223 | while (x < w) { |
| 241 | int err, pred; | ||
| 242 | |||
| 243 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 47299272 times.
|
47299272 | if (get_bits_left(&s->gb) <= 0) |
| 244 | ✗ | return AVERROR_INVALIDDATA; | |
| 245 | |||
| 246 | /* compute gradients */ | ||
| 247 |
4/6✓ Branch 0 taken 47155326 times.
✓ Branch 1 taken 143946 times.
✓ Branch 2 taken 47155326 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 143946 times.
✗ Branch 5 not taken.
|
47299272 | Ra = x ? R(dst, x - stride) : R(last, x); |
| 248 |
1/2✓ Branch 0 taken 47299272 times.
✗ Branch 1 not taken.
|
47299272 | Rb = R(last, x); |
| 249 |
3/4✓ Branch 0 taken 47155326 times.
✓ Branch 1 taken 143946 times.
✓ Branch 2 taken 47155326 times.
✗ Branch 3 not taken.
|
47299272 | Rc = x ? R(last, x - stride) : last2; |
| 250 |
4/6✓ Branch 0 taken 136999 times.
✓ Branch 1 taken 47162273 times.
✓ Branch 2 taken 136999 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 47162273 times.
✗ Branch 5 not taken.
|
47299272 | Rd = (x >= w - stride) ? R(last, x) : R(last, x + stride); |
| 251 | 47299272 | D0 = Rd - Rb; | |
| 252 | 47299272 | D1 = Rb - Rc; | |
| 253 | 47299272 | D2 = Rc - Ra; | |
| 254 | /* run mode */ | ||
| 255 |
2/2✓ Branch 0 taken 5800192 times.
✓ Branch 1 taken 41499080 times.
|
47299272 | if ((FFABS(D0) <= state->near) && |
| 256 |
2/2✓ Branch 0 taken 2188180 times.
✓ Branch 1 taken 3612012 times.
|
5800192 | (FFABS(D1) <= state->near) && |
| 257 |
2/2✓ Branch 0 taken 791656 times.
✓ Branch 1 taken 1396524 times.
|
2971841 | (FFABS(D2) <= state->near)) { |
| 258 | int r; | ||
| 259 | int RItype; | ||
| 260 | |||
| 261 | /* decode full runs while available */ | ||
| 262 |
2/2✓ Branch 1 taken 737915 times.
✓ Branch 2 taken 783661 times.
|
1521576 | while (get_bits1(&s->gb)) { |
| 263 | int r; | ||
| 264 | 737915 | r = 1 << ff_log2_run[state->run_index[comp]]; | |
| 265 |
2/2✓ Branch 0 taken 6338 times.
✓ Branch 1 taken 731577 times.
|
737915 | if (x + r * stride > w) |
| 266 | 6338 | r = (w - x) / stride; | |
| 267 |
2/2✓ Branch 0 taken 2755018 times.
✓ Branch 1 taken 737915 times.
|
3492933 | for (i = 0; i < r; i++) { |
| 268 |
1/2✓ Branch 0 taken 2755018 times.
✗ Branch 1 not taken.
|
2755018 | W(dst, x, Ra); |
| 269 | 2755018 | x += stride; | |
| 270 | } | ||
| 271 | /* if EOL reached, we stop decoding */ | ||
| 272 |
2/2✓ Branch 0 taken 6338 times.
✓ Branch 1 taken 731577 times.
|
737915 | if (r != 1 << ff_log2_run[state->run_index[comp]]) |
| 273 | 6338 | return 0; | |
| 274 |
1/2✓ Branch 0 taken 731577 times.
✗ Branch 1 not taken.
|
731577 | if (state->run_index[comp] < 31) |
| 275 | 731577 | state->run_index[comp]++; | |
| 276 |
2/2✓ Branch 0 taken 1657 times.
✓ Branch 1 taken 729920 times.
|
731577 | if (x + stride > w) |
| 277 | 1657 | return 0; | |
| 278 | } | ||
| 279 | /* decode aborted run */ | ||
| 280 | 783661 | r = ff_log2_run[state->run_index[comp]]; | |
| 281 |
2/2✓ Branch 0 taken 647235 times.
✓ Branch 1 taken 136426 times.
|
783661 | if (r) |
| 282 | 647235 | r = get_bits(&s->gb, r); | |
| 283 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 783661 times.
|
783661 | if (x + r * stride > w) { |
| 284 | ✗ | r = (w - x) / stride; | |
| 285 | } | ||
| 286 |
2/2✓ Branch 0 taken 1010453 times.
✓ Branch 1 taken 783661 times.
|
1794114 | for (i = 0; i < r; i++) { |
| 287 |
1/2✓ Branch 0 taken 1010453 times.
✗ Branch 1 not taken.
|
1010453 | W(dst, x, Ra); |
| 288 | 1010453 | x += stride; | |
| 289 | } | ||
| 290 | |||
| 291 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 783661 times.
|
783661 | if (x >= w) { |
| 292 | ✗ | av_log(NULL, AV_LOG_ERROR, "run overflow\n"); | |
| 293 | ✗ | av_assert0(x <= w); | |
| 294 | ✗ | return AVERROR_INVALIDDATA; | |
| 295 | } | ||
| 296 | |||
| 297 | /* decode run termination value */ | ||
| 298 |
1/2✓ Branch 0 taken 783661 times.
✗ Branch 1 not taken.
|
783661 | Rb = R(last, x); |
| 299 | 783661 | RItype = (FFABS(Ra - Rb) <= state->near) ? 1 : 0; | |
| 300 | 783661 | err = ls_get_code_runterm(&s->gb, state, RItype, | |
| 301 | 783661 | ff_log2_run[state->run_index[comp]]); | |
| 302 |
2/2✓ Branch 0 taken 729428 times.
✓ Branch 1 taken 54233 times.
|
783661 | if (state->run_index[comp]) |
| 303 | 729428 | state->run_index[comp]--; | |
| 304 | |||
| 305 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 783661 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
|
783661 | if (state->near && RItype) { |
| 306 | ✗ | pred = Ra + err; | |
| 307 | } else { | ||
| 308 |
2/2✓ Branch 0 taken 170007 times.
✓ Branch 1 taken 613654 times.
|
783661 | if (Rb < Ra) |
| 309 | 170007 | pred = Rb - err; | |
| 310 | else | ||
| 311 | 613654 | pred = Rb + err; | |
| 312 | } | ||
| 313 | } else { /* regular mode */ | ||
| 314 | int context, sign; | ||
| 315 | |||
| 316 | 46507616 | context = ff_jpegls_quantize(state, D0) * 81 + | |
| 317 | 46507616 | ff_jpegls_quantize(state, D1) * 9 + | |
| 318 | 46507616 | ff_jpegls_quantize(state, D2); | |
| 319 | 46507616 | pred = mid_pred(Ra, Ra + Rb - Rc, Rb); | |
| 320 | |||
| 321 |
2/2✓ Branch 0 taken 19034217 times.
✓ Branch 1 taken 27473399 times.
|
46507616 | if (context < 0) { |
| 322 | 19034217 | context = -context; | |
| 323 | 19034217 | sign = 1; | |
| 324 | } else { | ||
| 325 | 27473399 | sign = 0; | |
| 326 | } | ||
| 327 | |||
| 328 |
2/2✓ Branch 0 taken 19034217 times.
✓ Branch 1 taken 27473399 times.
|
46507616 | if (sign) { |
| 329 | 19034217 | pred = av_clip(pred - state->C[context], 0, state->maxval); | |
| 330 | 19034217 | err = -ls_get_code_regular(&s->gb, state, context); | |
| 331 | } else { | ||
| 332 | 27473399 | pred = av_clip(pred + state->C[context], 0, state->maxval); | |
| 333 | 27473399 | err = ls_get_code_regular(&s->gb, state, context); | |
| 334 | } | ||
| 335 | |||
| 336 | /* we have to do something more for near-lossless coding */ | ||
| 337 | 46507616 | pred += err; | |
| 338 | } | ||
| 339 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 47291277 times.
|
47291277 | if (state->near) { |
| 340 | ✗ | if (pred < -state->near) | |
| 341 | ✗ | pred += state->range * state->twonear; | |
| 342 | ✗ | else if (pred > state->maxval + state->near) | |
| 343 | ✗ | pred -= state->range * state->twonear; | |
| 344 | ✗ | pred = av_clip(pred, 0, state->maxval); | |
| 345 | } | ||
| 346 | |||
| 347 | 47291277 | pred &= state->maxval; | |
| 348 |
1/2✓ Branch 0 taken 47291277 times.
✗ Branch 1 not taken.
|
47291277 | W(dst, x, pred); |
| 349 | 47291277 | x += stride; | |
| 350 | } | ||
| 351 | |||
| 352 | 135951 | return 0; | |
| 353 | } | ||
| 354 | |||
| 355 | 213 | int ff_jpegls_decode_picture(MJpegDecodeContext *s, int near, | |
| 356 | int point_transform, int ilv) | ||
| 357 | { | ||
| 358 | 213 | int i, t = 0; | |
| 359 | uint8_t *zero, *last, *cur; | ||
| 360 | 213 | JLSState *state = s->jls_state; | |
| 361 | 213 | int off = 0, stride = 1, width, shift, ret = 0; | |
| 362 | 213 | int decoded_height = 0; | |
| 363 | |||
| 364 |
2/2✓ Branch 0 taken 17 times.
✓ Branch 1 taken 196 times.
|
213 | if (!state) { |
| 365 | 17 | state = av_malloc(sizeof(*state)); | |
| 366 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 17 times.
|
17 | if (!state) |
| 367 | ✗ | return AVERROR(ENOMEM); | |
| 368 | 17 | s->jls_state = state; | |
| 369 | } | ||
| 370 | 213 | zero = av_mallocz(s->picture_ptr->linesize[0]); | |
| 371 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 213 times.
|
213 | if (!zero) |
| 372 | ✗ | return AVERROR(ENOMEM); | |
| 373 | 213 | last = zero; | |
| 374 | 213 | cur = s->picture_ptr->data[0]; | |
| 375 | |||
| 376 | /* initialize JPEG-LS state from JPEG parameters */ | ||
| 377 | 213 | memset(state, 0, sizeof(*state)); | |
| 378 | 213 | state->near = near; | |
| 379 | 213 | state->bpp = (s->bits < 2) ? 2 : s->bits; | |
| 380 | 213 | state->maxval = s->maxval; | |
| 381 | 213 | state->T1 = s->t1; | |
| 382 | 213 | state->T2 = s->t2; | |
| 383 | 213 | state->T3 = s->t3; | |
| 384 | 213 | state->reset = s->reset; | |
| 385 | 213 | ff_jpegls_reset_coding_parameters(state, 0); | |
| 386 | |||
| 387 | /* Testing parameters here, we cannot test in LSE or SOF because | ||
| 388 | * these interdepend and are allowed in either order | ||
| 389 | */ | ||
| 390 |
1/2✓ Branch 0 taken 213 times.
✗ Branch 1 not taken.
|
213 | if (state->maxval >= (1<<state->bpp) || |
| 391 |
1/2✓ Branch 0 taken 213 times.
✗ Branch 1 not taken.
|
213 | state->T1 > state->T2 || |
| 392 |
1/2✓ Branch 0 taken 213 times.
✗ Branch 1 not taken.
|
213 | state->T2 > state->T3 || |
| 393 |
1/2✓ Branch 0 taken 213 times.
✗ Branch 1 not taken.
|
213 | state->T3 > state->maxval || |
| 394 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 213 times.
|
213 | state->reset > FFMAX(255, state->maxval)) { |
| 395 | ✗ | ret = AVERROR_INVALIDDATA; | |
| 396 | ✗ | goto end; | |
| 397 | } | ||
| 398 | |||
| 399 | 213 | ff_jpegls_init_state(state); | |
| 400 | |||
| 401 |
1/2✓ Branch 0 taken 213 times.
✗ Branch 1 not taken.
|
213 | if (s->bits <= 8) |
| 402 | 213 | shift = point_transform + (8 - s->bits); | |
| 403 | else | ||
| 404 | ✗ | shift = point_transform + (16 - s->bits); | |
| 405 | |||
| 406 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 213 times.
|
213 | if (shift >= 16) { |
| 407 | ✗ | ret = AVERROR_INVALIDDATA; | |
| 408 | ✗ | goto end; | |
| 409 | } | ||
| 410 | |||
| 411 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 213 times.
|
213 | if (s->avctx->debug & FF_DEBUG_PICT_INFO) { |
| 412 | ✗ | av_log(s->avctx, AV_LOG_DEBUG, | |
| 413 | "JPEG-LS params: %ix%i NEAR=%i MV=%i T(%i,%i,%i) " | ||
| 414 | "RESET=%i, LIMIT=%i, qbpp=%i, RANGE=%i\n", | ||
| 415 | s->width, s->height, state->near, state->maxval, | ||
| 416 | state->T1, state->T2, state->T3, | ||
| 417 | state->reset, state->limit, state->qbpp, state->range); | ||
| 418 | ✗ | av_log(s->avctx, AV_LOG_DEBUG, "JPEG params: ILV=%i Pt=%i BPP=%i, scan = %i\n", | |
| 419 | ilv, point_transform, s->bits, s->cur_scan); | ||
| 420 | } | ||
| 421 |
1/2✗ Branch 1 not taken.
✓ Branch 2 taken 213 times.
|
213 | if (get_bits_left(&s->gb) < s->height) { |
| 422 | ✗ | ret = AVERROR_INVALIDDATA; | |
| 423 | ✗ | goto end; | |
| 424 | } | ||
| 425 |
2/2✓ Branch 0 taken 8 times.
✓ Branch 1 taken 205 times.
|
213 | if (ilv == 0) { /* separate planes */ |
| 426 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 8 times.
|
8 | if (s->cur_scan > s->nb_components) { |
| 427 | ✗ | ret = AVERROR_INVALIDDATA; | |
| 428 | ✗ | goto end; | |
| 429 | } | ||
| 430 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 8 times.
|
8 | stride = (s->nb_components > 1) ? 3 : 1; |
| 431 | 8 | off = av_clip(s->cur_scan - 1, 0, stride - 1); | |
| 432 | 8 | width = s->width * stride; | |
| 433 | 8 | cur += off; | |
| 434 |
2/2✓ Branch 0 taken 5688 times.
✓ Branch 1 taken 8 times.
|
5696 | for (i = 0; i < s->height; i++) { |
| 435 | int ret; | ||
| 436 |
1/2✓ Branch 0 taken 5688 times.
✗ Branch 1 not taken.
|
5688 | if (s->bits <= 8) { |
| 437 | 5688 | ret = ls_decode_line(state, s, last, cur, t, width, stride, off, 8); | |
| 438 | 5688 | t = last[0]; | |
| 439 | } else { | ||
| 440 | ✗ | ret = ls_decode_line(state, s, last, cur, t, width, stride, off, 16); | |
| 441 | ✗ | t = *((uint16_t *)last); | |
| 442 | } | ||
| 443 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 5688 times.
|
5688 | if (ret < 0) |
| 444 | ✗ | break; | |
| 445 | 5688 | last = cur; | |
| 446 | 5688 | cur += s->picture_ptr->linesize[0]; | |
| 447 | |||
| 448 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 5688 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
|
5688 | if (s->restart_interval && !--s->restart_count) { |
| 449 | ✗ | align_get_bits(&s->gb); | |
| 450 | ✗ | skip_bits(&s->gb, 16); /* skip RSTn */ | |
| 451 | } | ||
| 452 | } | ||
| 453 | 8 | decoded_height = i; | |
| 454 |
1/2✓ Branch 0 taken 205 times.
✗ Branch 1 not taken.
|
205 | } else if (ilv == 1) { /* line interleaving */ |
| 455 | int j; | ||
| 456 | 205 | int Rc[3] = { 0, 0, 0 }; | |
| 457 |
1/2✓ Branch 0 taken 205 times.
✗ Branch 1 not taken.
|
205 | stride = (s->nb_components > 1) ? 3 : 1; |
| 458 | 205 | memset(cur, 0, s->picture_ptr->linesize[0]); | |
| 459 | 205 | width = s->width * stride; | |
| 460 |
2/2✓ Branch 0 taken 46086 times.
✓ Branch 1 taken 205 times.
|
46291 | for (i = 0; i < s->height; i++) { |
| 461 | int ret; | ||
| 462 |
2/2✓ Branch 0 taken 138258 times.
✓ Branch 1 taken 46086 times.
|
184344 | for (j = 0; j < stride; j++) { |
| 463 | 138258 | ret = ls_decode_line(state, s, last + j, cur + j, | |
| 464 | Rc[j], width, stride, j, 8); | ||
| 465 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 138258 times.
|
138258 | if (ret < 0) |
| 466 | ✗ | break; | |
| 467 | 138258 | Rc[j] = last[j]; | |
| 468 | |||
| 469 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 138258 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
|
138258 | if (s->restart_interval && !--s->restart_count) { |
| 470 | ✗ | align_get_bits(&s->gb); | |
| 471 | ✗ | skip_bits(&s->gb, 16); /* skip RSTn */ | |
| 472 | } | ||
| 473 | } | ||
| 474 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 46086 times.
|
46086 | if (ret < 0) |
| 475 | ✗ | break; | |
| 476 | 46086 | last = cur; | |
| 477 | 46086 | cur += s->picture_ptr->linesize[0]; | |
| 478 | } | ||
| 479 | 205 | decoded_height = i; | |
| 480 | ✗ | } else if (ilv == 2) { /* sample interleaving */ | |
| 481 | ✗ | avpriv_report_missing_feature(s->avctx, "Sample interleaved images"); | |
| 482 | ✗ | ret = AVERROR_PATCHWELCOME; | |
| 483 | ✗ | goto end; | |
| 484 | } else { /* unknown interleaving */ | ||
| 485 | ✗ | avpriv_report_missing_feature(s->avctx, "Unknown interleaved images"); | |
| 486 | ✗ | ret = AVERROR_PATCHWELCOME; | |
| 487 | ✗ | goto end; | |
| 488 | } | ||
| 489 | |||
| 490 |
1/4✗ Branch 0 not taken.
✓ Branch 1 taken 213 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
|
213 | if (s->xfrm && s->nb_components == 3) { |
| 491 | int x, w; | ||
| 492 | |||
| 493 | ✗ | w = s->width * s->nb_components; | |
| 494 | |||
| 495 | ✗ | if (s->bits <= 8) { | |
| 496 | ✗ | uint8_t *src = s->picture_ptr->data[0]; | |
| 497 | |||
| 498 | ✗ | for (i = 0; i < s->height; i++) { | |
| 499 | ✗ | switch(s->xfrm) { | |
| 500 | ✗ | case 1: | |
| 501 | ✗ | for (x = off; x + 2 < w; x += 3) { | |
| 502 | ✗ | src[x ] += src[x+1] + 128; | |
| 503 | ✗ | src[x+2] += src[x+1] + 128; | |
| 504 | } | ||
| 505 | ✗ | break; | |
| 506 | ✗ | case 2: | |
| 507 | ✗ | for (x = off; x + 2 < w; x += 3) { | |
| 508 | ✗ | src[x ] += src[x+1] + 128; | |
| 509 | ✗ | src[x+2] += ((src[x ] + src[x+1])>>1) + 128; | |
| 510 | } | ||
| 511 | ✗ | break; | |
| 512 | ✗ | case 3: | |
| 513 | ✗ | for (x = off; x + 2 < w; x += 3) { | |
| 514 | ✗ | int g = src[x+0] - ((src[x+2]+src[x+1])>>2) + 64; | |
| 515 | ✗ | src[x+0] = src[x+2] + g + 128; | |
| 516 | ✗ | src[x+2] = src[x+1] + g + 128; | |
| 517 | ✗ | src[x+1] = g; | |
| 518 | } | ||
| 519 | ✗ | break; | |
| 520 | ✗ | case 4: | |
| 521 | ✗ | for (x = off; x + 2 < w; x += 3) { | |
| 522 | ✗ | int r = src[x+0] - (( 359 * (src[x+2]-128) + 490) >> 8); | |
| 523 | ✗ | int g = src[x+0] - (( 88 * (src[x+1]-128) - 183 * (src[x+2]-128) + 30) >> 8); | |
| 524 | ✗ | int b = src[x+0] + ((454 * (src[x+1]-128) + 574) >> 8); | |
| 525 | ✗ | src[x+0] = av_clip_uint8(r); | |
| 526 | ✗ | src[x+1] = av_clip_uint8(g); | |
| 527 | ✗ | src[x+2] = av_clip_uint8(b); | |
| 528 | } | ||
| 529 | ✗ | break; | |
| 530 | } | ||
| 531 | ✗ | src += s->picture_ptr->linesize[0]; | |
| 532 | } | ||
| 533 | }else | ||
| 534 | ✗ | avpriv_report_missing_feature(s->avctx, "16bit xfrm"); | |
| 535 | } | ||
| 536 | |||
| 537 |
2/2✓ Branch 0 taken 205 times.
✓ Branch 1 taken 8 times.
|
213 | if (shift) { /* we need to do point transform or normalize samples */ |
| 538 | int x, w; | ||
| 539 | |||
| 540 | 8 | w = s->width * s->nb_components; | |
| 541 | |||
| 542 |
1/2✓ Branch 0 taken 8 times.
✗ Branch 1 not taken.
|
8 | if (s->bits <= 8) { |
| 543 | 8 | uint8_t *src = s->picture_ptr->data[0]; | |
| 544 | |||
| 545 |
2/2✓ Branch 0 taken 5688 times.
✓ Branch 1 taken 8 times.
|
5696 | for (i = 0; i < decoded_height; i++) { |
| 546 |
2/2✓ Branch 0 taken 4044168 times.
✓ Branch 1 taken 5688 times.
|
4049856 | for (x = off; x < w; x += stride) |
| 547 | 4044168 | src[x] <<= shift; | |
| 548 | 5688 | src += s->picture_ptr->linesize[0]; | |
| 549 | } | ||
| 550 | } else { | ||
| 551 | ✗ | uint16_t *src = (uint16_t *)s->picture_ptr->data[0]; | |
| 552 | |||
| 553 | ✗ | for (i = 0; i < decoded_height; i++) { | |
| 554 | ✗ | for (x = 0; x < w; x++) | |
| 555 | ✗ | src[x] <<= shift; | |
| 556 | ✗ | src += s->picture_ptr->linesize[0] / 2; | |
| 557 | } | ||
| 558 | } | ||
| 559 | } | ||
| 560 | |||
| 561 | 205 | end: | |
| 562 | 213 | av_free(zero); | |
| 563 | |||
| 564 | 213 | return ret; | |
| 565 | } | ||
| 566 | |||
| 567 | const FFCodec ff_jpegls_decoder = { | ||
| 568 | .p.name = "jpegls", | ||
| 569 | CODEC_LONG_NAME("JPEG-LS"), | ||
| 570 | .p.type = AVMEDIA_TYPE_VIDEO, | ||
| 571 | .p.id = AV_CODEC_ID_JPEGLS, | ||
| 572 | .priv_data_size = sizeof(MJpegDecodeContext), | ||
| 573 | .init = ff_mjpeg_decode_init, | ||
| 574 | .close = ff_mjpeg_decode_end, | ||
| 575 | FF_CODEC_DECODE_CB(ff_mjpeg_decode_frame), | ||
| 576 | .p.capabilities = AV_CODEC_CAP_DR1, | ||
| 577 | .caps_internal = FF_CODEC_CAP_INIT_CLEANUP, | ||
| 578 | }; | ||
| 579 |