falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
7149 Commits
32 Branches
283MB
Tree: 4884b9e50d
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '4884b9e50d'
${ noResults }
FFmpeg/libavcodec/jpeg_ls.c

1109 lines
33KB
Raw Blame History 

  1. /*

  2.  * JPEG-LS encoder and 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. #include "golomb.h"

  24. 

  25. /**

  26.  * @file jpeg_ls.c

  27.  * JPEG-LS encoder and decoder.

  28.  */

  29. 

  30. typedef struct JpeglsContext{

  31.     AVCodecContext *avctx;

  32.     AVFrame picture;

  33. }JpeglsContext;

  34. 

  35. typedef struct JLSState{

  36.     int T1, T2, T3;

  37.     int A[367], B[367], C[365], N[367];

  38.     int limit, reset, bpp, qbpp, maxval, range;

  39.     int near, twonear;

  40.     int run_index[3];

  41. }JLSState;

  42. 

  43. static const uint8_t log2_run[32]={

  44.  0, 0, 0, 0, 1, 1, 1, 1,

  45.  2, 2, 2, 2, 3, 3, 3, 3,

  46.  4, 4, 5, 5, 6, 6, 7, 7,

  47.  8, 9,10,11,12,13,14,15

  48. };

  49. 

  50. /*

  51. * Uncomment this to significantly speed up decoding of broken JPEG-LS

  52. * (or test broken JPEG-LS decoder) and slow down ordinary decoding a bit.

  53. *

  54. * There is no Golomb code with length >= 32 bits possible, so check and

  55. * avoid situation of 32 zeros, FFmpeg Golomb decoder is painfully slow

  56. * on this errors.

  57. */

  58. //#define JLS_BROKEN

  59. 

  60. /********** Functions for both encoder and decoder **********/

  61. 

  62. /**

  63.  * Calculate initial JPEG-LS parameters

  64.  */

  65. static void ls_init_state(JLSState *state){

  66.     int i;

  67. 

  68.     state->twonear = state->near * 2 + 1;

  69.     state->range = ((state->maxval + state->twonear - 1) / state->twonear) + 1;

  70. 

  71.     // QBPP = ceil(log2(RANGE))

  72.     for(state->qbpp = 0; (1 << state->qbpp) < state->range; state->qbpp++);

  73. 

  74.     if(state->bpp < 8)

  75.         state->limit = 16 + 2 * state->bpp - state->qbpp;

  76.     else

  77.         state->limit = (4 * state->bpp) - state->qbpp;

  78. 

  79.     for(i = 0; i < 367; i++) {

  80.         state->A[i] = (state->range + 32) >> 6;

  81.         if(state->A[i] < 2)

  82.             state->A[i] = 2;

  83.         state->N[i] = 1;

  84.     }

  85. 

  86. }

  87. 

  88. /**

  89.  * Calculate quantized gradient value, used for context determination

  90.  */

  91. static inline int quantize(JLSState *s, int v){ //FIXME optimize

  92.     if(v==0) return 0;

  93.     if(v < 0){

  94.         if(v <= -s->T3) return -4;

  95.         if(v <= -s->T2) return -3;

  96.         if(v <= -s->T1) return -2;

  97.         if(v <  -s->near) return -1;

  98.         return 0;

  99.     }else{

  100.         if(v <= s->near) return 0;

  101.         if(v <  s->T1) return 1;

  102.         if(v <  s->T2) return 2;

  103.         if(v <  s->T3) return 3;

  104.         return 4;

  105.     }

  106. }

  107. 

  108. /**

  109.  * Custom value clipping function used in T1, T2, T3 calculation

  110.  */

  111. static inline int iso_clip(int v, int vmin, int vmax){

  112.     if(v > vmax || v < vmin) return vmin;

  113.     else                     return v;

  114. }

  115. 

  116. /**

  117.  * Calculate JPEG-LS codec values

  118.  */

  119. static void reset_ls_coding_parameters(JLSState *s, int reset_all){

  120.     const int basic_t1= 3;

  121.     const int basic_t2= 7;

  122.     const int basic_t3= 21;

  123.     int factor;

  124. 

  125.     if(s->maxval==0 || reset_all) s->maxval= (1 << s->bpp) - 1;

  126. 

  127.     if(s->maxval >=128){

  128.         factor= (FFMIN(s->maxval, 4095) + 128)>>8;

  129. 

  130.         if(s->T1==0     || reset_all)

  131.             s->T1= iso_clip(factor*(basic_t1-2) + 2 + 3*s->near, s->near+1, s->maxval);

  132.         if(s->T2==0     || reset_all)

  133.             s->T2= iso_clip(factor*(basic_t2-3) + 3 + 5*s->near, s->T1, s->maxval);

  134.         if(s->T3==0     || reset_all)

  135.             s->T3= iso_clip(factor*(basic_t3-4) + 4 + 7*s->near, s->T2, s->maxval);

  136.     }else{

  137.         factor= 256 / (s->maxval + 1);

  138. 

  139.         if(s->T1==0     || reset_all)

  140.             s->T1= iso_clip(FFMAX(2, basic_t1/factor + 3*s->near), s->near+1, s->maxval);

  141.         if(s->T2==0     || reset_all)

  142.             s->T2= iso_clip(FFMAX(3, basic_t2/factor + 5*s->near), s->T1, s->maxval);

  143.         if(s->T3==0     || reset_all)

  144.             s->T3= iso_clip(FFMAX(4, basic_t3/factor + 6*s->near), s->T2, s->maxval);

  145.     }

  146. 

  147.     if(s->reset==0  || reset_all) s->reset= 64;

  148. //    av_log(NULL, AV_LOG_DEBUG, "[JPEG-LS RESET] T=%i,%i,%i\n", s->T1, s->T2, s->T3);

  149. }

  150. 

  151. 

  152. /********** Decoder-specific functions **********/

  153. 

  154. /**

  155.  * Decode LSE block with initialization parameters

  156.  */

  157. static int decode_lse(MJpegDecodeContext *s)

  158. {

  159.     int len, id;

  160. 

  161.     /* XXX: verify len field validity */

  162.     len = get_bits(&s->gb, 16);

  163.     id = get_bits(&s->gb, 8);

  164. 

  165.     switch(id){

  166.     case 1:

  167.         s->maxval= get_bits(&s->gb, 16);

  168.         s->t1= get_bits(&s->gb, 16);

  169.         s->t2= get_bits(&s->gb, 16);

  170.         s->t3= get_bits(&s->gb, 16);

  171.         s->reset= get_bits(&s->gb, 16);

  172. 

  173. //        reset_ls_coding_parameters(s, 0);

  174.         //FIXME quant table?

  175.         break;

  176.     case 2:

  177.     case 3:

  178.         av_log(s->avctx, AV_LOG_ERROR, "palette not supported\n");

  179.         return -1;

  180.     case 4:

  181.         av_log(s->avctx, AV_LOG_ERROR, "oversize image not supported\n");

  182.         return -1;

  183.     default:

  184.         av_log(s->avctx, AV_LOG_ERROR, "invalid id %d\n", id);

  185.         return -1;

  186.     }

  187. //    av_log(s->avctx, AV_LOG_DEBUG, "ID=%i, T=%i,%i,%i\n", id, s->t1, s->t2, s->t3);

  188. 

  189.     return 0;

  190. }

  191. 

  192. 

  193. /**

  194.  * Get context-dependent Golomb code, decode it and update context

  195.  */

  196. static inline int ls_get_code_regular(GetBitContext *gb, JLSState *state, int Q){

  197.     int k, ret;

  198. 

  199.     for(k = 0; (state->N[Q] << k) < state->A[Q]; k++);

  200. 

  201. #ifdef JLS_BROKEN

  202.     if(!show_bits_long(gb, 32))return -1;

  203. #endif

  204.     ret = get_ur_golomb_jpegls(gb, k, state->limit, state->qbpp);

  205. 

  206.     /* decode mapped error */

  207.     if(ret & 1)

  208.         ret = -((ret + 1) >> 1);

  209.     else

  210.         ret >>= 1;

  211. 

  212.     /* for NEAR=0, k=0 and 2*B[Q] <= - N[Q] mapping is reversed */

  213.     if(!state->near && !k && (2 * state->B[Q] <= -state->N[Q]))

  214.         ret = -(ret + 1);

  215. 

  216.     state->A[Q] += FFABS(ret);

  217.     ret *= state->twonear;

  218.     state->B[Q] += ret;

  219. 

  220.     if(state->N[Q] == state->reset) {

  221.         state->A[Q] >>= 1;

  222.         state->B[Q] >>= 1;

  223.         state->N[Q] >>= 1;

  224.     }

  225.     state->N[Q]++;

  226. 

  227.     if(state->B[Q] <= -state->N[Q]) {

  228.         state->B[Q] += state->N[Q];

  229.         if(state->C[Q] > -128)

  230.             state->C[Q]--;

  231.         if(state->B[Q] <= -state->N[Q])

  232.             state->B[Q] = -state->N[Q] + 1;

  233.     }else if(state->B[Q] > 0){

  234.         state->B[Q] -= state->N[Q];

  235.         if(state->C[Q] < 127)

  236.             state->C[Q]++;

  237.         if(state->B[Q] > 0)

  238.             state->B[Q] = 0;

  239.     }

  240. 

  241.     return ret;

  242. }

  243. 

  244. /**

  245.  * Get Golomb code, decode it and update state for run termination

  246.  */

  247. static inline int ls_get_code_runterm(GetBitContext *gb, JLSState *state, int RItype, int limit_add){

  248.     int k, ret, temp, map;

  249.     int Q = 365 + RItype;

  250. 

  251.     if(!RItype)

  252.         temp = state->A[Q];

  253.     else

  254.         temp = state->A[Q] + (state->N[Q] >> 1);

  255. 

  256.     for(k = 0; (state->N[Q] << k) < temp; k++);

  257. 

  258. #ifdef JLS_BROKEN

  259.     if(!show_bits_long(gb, 32))return -1;

  260. #endif

  261.     ret = get_ur_golomb_jpegls(gb, k, state->limit - limit_add - 1, state->qbpp);

  262. 

  263.     /* decode mapped error */

  264.     map = 0;

  265.     if(!k && (RItype || ret) && (2 * state->B[Q] < state->N[Q]))

  266.         map = 1;

  267.     ret += RItype + map;

  268. 

  269.     if(ret & 1){

  270.         ret = map - ((ret + 1) >> 1);

  271.         state->B[Q]++;

  272.     } else {

  273.         ret = ret >> 1;

  274.     }

  275. 

  276.     /* update state */

  277.     state->A[Q] += FFABS(ret) - RItype;

  278.     ret *= state->twonear;

  279.     if(state->N[Q] == state->reset){

  280.         state->A[Q] >>=1;

  281.         state->B[Q] >>=1;

  282.         state->N[Q] >>=1;

  283.     }

  284.     state->N[Q]++;

  285. 

  286.     return ret;

  287. }

  288. 

  289. /**

  290.  * Decode one line of image

  291.  */

  292. static inline void ls_decode_line(JLSState *state, MJpegDecodeContext *s, uint8_t *last, uint8_t *dst, int last2, int w, int stride, int comp){

  293.     int i, x = 0;

  294.     int Ra, Rb, Rc, Rd;

  295.     int D0, D1, D2;

  296. 

  297.     while(x < w) {

  298.         int err, pred;

  299. 

  300.         /* compute gradients */

  301.         Ra = x ? dst[x - stride] : last[x];

  302.         Rb = last[x];

  303.         Rc = x ? last[x - stride] : last2;

  304.         Rd = (x >= w - stride) ? last[x] : last[x + stride];

  305.         D0 = Rd - Rb;

  306.         D1 = Rb - Rc;

  307.         D2 = Rc - Ra;

  308.         /* run mode */

  309.         if((FFABS(D0) <= state->near) && (FFABS(D1) <= state->near) && (FFABS(D2) <= state->near)) {

  310.             int r;

  311.             int RItype;

  312. 

  313.             /* decode full runs while available */

  314.             while(get_bits1(&s->gb)) {

  315.                 int r;

  316.                 r = 1 << log2_run[state->run_index[comp]];

  317.                 if(x + r * stride > w) {

  318.                     r = (w - x) / stride;

  319.                 }

  320.                 for(i = 0; i < r; i++) {

  321.                     dst[x] = Ra;

  322.                     x += stride;

  323.                 }

  324.                 /* if EOL reached, we stop decoding */

  325.                 if(r != (1 << log2_run[state->run_index[comp]]))

  326.                     return;

  327.                 if(state->run_index[comp] < 31)

  328.                     state->run_index[comp]++;

  329.                 if(x + stride > w)

  330.                     return;

  331.             }

  332.             /* decode aborted run */

  333.             r = log2_run[state->run_index[comp]];

  334.             if(r)

  335.                 r = get_bits_long(&s->gb, r);

  336.             for(i = 0; i < r; i++) {

  337.                 dst[x] = Ra;

  338.                 x += stride;

  339.             }

  340. 

  341.             /* decode run termination value */

  342.             Rb = last[x];

  343.             RItype = (FFABS(Ra - Rb) <= state->near) ? 1 : 0;

  344.             err = ls_get_code_runterm(&s->gb, state, RItype, log2_run[state->run_index[comp]]);

  345.             if(state->run_index[comp])

  346.                 state->run_index[comp]--;

  347. 

  348.             if(state->near && RItype){

  349.                 pred = Ra + err;

  350.             } else {

  351.                 if(Rb < Ra)

  352.                     pred = Rb - err;

  353.                 else

  354.                     pred = Rb + err;

  355.             }

  356. 

  357.             if(state->near){

  358.                 if(pred < -state->near)

  359.                     pred += state->range * state->twonear;

  360.                 else if(pred > state->maxval + state->near)

  361.                     pred -= state->range * state->twonear;

  362.                 pred = clip(pred, 0, state->maxval);

  363.             }

  364. 

  365.             dst[x] = pred;

  366.             x += stride;

  367.         } else { /* regular mode */

  368.             int context, sign;

  369. 

  370.             context = quantize(state, D0) * 81 + quantize(state, D1) * 9 + quantize(state, D2);

  371.             pred = mid_pred(Ra, Ra + Rb - Rc, Rb);

  372. 

  373.             if(context < 0){

  374.                 context = -context;

  375.                 sign = 1;

  376.             }else{

  377.                 sign = 0;

  378.             }

  379. 

  380.             if(sign){

  381.                 pred = clip(pred - state->C[context], 0, state->maxval);

  382.                 err = -ls_get_code_regular(&s->gb, state, context);

  383.             } else {

  384.                 pred = clip(pred + state->C[context], 0, state->maxval);

  385.                 err = ls_get_code_regular(&s->gb, state, context);

  386.             }

  387. 

  388.             /* we have to do something more for near-lossless coding */

  389.             pred += err;

  390.             if(state->near) {

  391.                 if(pred < -state->near)

  392.                     pred += state->range * state->twonear;

  393.                 else if(pred > state->maxval + state->near)

  394.                     pred -= state->range * state->twonear;

  395.                 pred = clip(pred, 0, state->maxval);

  396.             }

  397. 

  398.             dst[x] = pred;

  399.             x += stride;

  400.         }

  401.     }

  402. }

  403. 

  404. /**

  405.  * Decode one line of image - 16bpp version

  406.  */

  407. static inline void ls_decode_line_16bpp(JLSState *state, MJpegDecodeContext *s, uint16_t *last, uint16_t *dst, int last2, int w, int stride, int comp){

  408.     int i, x = 0;

  409.     int Ra, Rb, Rc, Rd;

  410.     int D0, D1, D2;

  411. 

  412.     while(x < w) {

  413.         int err, pred;

  414. 

  415.         /* compute gradients */

  416.         Ra = x ? dst[x - stride] : last[x];

  417.         Rb = last[x];

  418.         Rc = x ? last[x - stride] : last2;

  419.         Rd = (x >= w - stride) ? last[x] : last[x + stride];

  420.         D0 = Rd - Rb;

  421.         D1 = Rb - Rc;

  422.         D2 = Rc - Ra;

  423.         /* run mode */

  424.         if((FFABS(D0) <= state->near) && (FFABS(D1) <= state->near) && (FFABS(D2) <= state->near)) {

  425.             int r;

  426.             int RItype;

  427. 

  428.             /* decode full runs while available */

  429.             while(get_bits1(&s->gb)) {

  430.                 int r;

  431.                 r = 1 << log2_run[state->run_index[comp]];

  432.                 if(x + r * stride > w) {

  433.                     r = (w - x) / stride;

  434.                 }

  435.                 for(i = 0; i < r; i++) {

  436.                     dst[x] = Ra;

  437.                     x += stride;

  438.                 }

  439.                 /* if EOL reached, we stop decoding */

  440.                 if(r != (1 << log2_run[state->run_index[comp]]))

  441.                     return;

  442.                 if(state->run_index[comp] < 31)

  443.                     state->run_index[comp]++;

  444.                 if(x + stride > w)

  445.                     return;

  446.             }

  447.             /* decode aborted run */

  448.             r = log2_run[state->run_index[comp]];

  449.             if(r)

  450.                 r = get_bits_long(&s->gb, r);

  451.             for(i = 0; i < r; i++) {

  452.                 dst[x] = Ra;

  453.                 x += stride;

  454.             }

  455. 

  456.             /* decode run termination value */

  457.             Rb = last[x];

  458.             RItype = (FFABS(Ra - Rb) <= state->near) ? 1 : 0;

  459.             err = ls_get_code_runterm(&s->gb, state, RItype, log2_run[state->run_index[comp]]);

  460.             if(state->run_index[comp])

  461.                 state->run_index[comp]--;

  462. 

  463.             if(state->near && RItype){

  464.                 pred = Ra + err;

  465.             } else {

  466.                 if(Rb < Ra)

  467.                     pred = Rb - err;

  468.                 else

  469.                     pred = Rb + err;

  470.             }

  471. 

  472.             if(state->near){

  473.                 if(pred < -state->near)

  474.                     pred += state->range * state->twonear;

  475.                 else if(pred > state->maxval + state->near)

  476.                     pred -= state->range * state->twonear;

  477.                 pred = clip(pred, 0, state->maxval);

  478.             }

  479. 

  480.             dst[x] = pred;

  481.             x += stride;

  482.         } else { /* regular mode */

  483.             int context, sign;

  484. 

  485.             context = quantize(state, D0) * 81 + quantize(state, D1) * 9 + quantize(state, D2);

  486.             pred = mid_pred(Ra, Ra + Rb - Rc, Rb);

  487. 

  488.             if(context < 0){

  489.                 context = -context;

  490.                 sign = 1;

  491.             }else{

  492.                 sign = 0;

  493.             }

  494. 

  495.             if(sign){

  496.                 pred = clip(pred - state->C[context], 0, state->maxval);

  497.                 err = -ls_get_code_regular(&s->gb, state, context);

  498.             } else {

  499.                 pred = clip(pred + state->C[context], 0, state->maxval);

  500.                 err = ls_get_code_regular(&s->gb, state, context);

  501.             }

  502. 

  503.             /* we have to do something more for near-lossless coding */

  504.             pred += err;

  505.             if(state->near) {

  506.                 if(pred < -state->near)

  507.                     pred += state->range * state->twonear;

  508.                 else if(pred > state->maxval + state->near)

  509.                     pred -= state->range * state->twonear;

  510.                 pred = clip(pred, 0, state->maxval);

  511.             }

  512. 

  513.             dst[x] = pred;

  514.             x += stride;

  515.         }

  516.     }

  517. }

  518. 

  519. static int ls_decode_picture(MJpegDecodeContext *s, int near, int point_transform, int ilv){

  520.     int i, t = 0;

  521.     uint8_t *zero, *last, *cur;

  522.     JLSState *state;

  523.     int off = 0, stride = 1, width, shift;

  524. 

  525.     zero = av_mallocz(s->picture.linesize[0]);

  526.     last = zero;

  527.     cur = s->picture.data[0];

  528. 

  529.     state = av_mallocz(sizeof(JLSState));

  530.     /* initialize JPEG-LS state from JPEG parameters */

  531.     state->near = near;

  532.     state->bpp = (s->bits < 2) ? 2 : s->bits;

  533.     state->maxval = s->maxval;

  534.     state->T1 = s->t1;

  535.     state->T2 = s->t2;

  536.     state->T3 = s->t3;

  537.     state->reset = s->reset;

  538.     reset_ls_coding_parameters(state, 0);

  539.     ls_init_state(state);

  540. 

  541.     if(s->bits <= 8)

  542.         shift = point_transform + (8 - s->bits);

  543.     else

  544.         shift = point_transform + (16 - s->bits);

  545. 

  546. //    av_log(s->avctx, AV_LOG_DEBUG, "JPEG-LS params: %ix%i NEAR=%i MV=%i T(%i,%i,%i) RESET=%i, LIMIT=%i, qbpp=%i, RANGE=%i\n",s->width,s->height,state->near,state->maxval,state->T1,state->T2,state->T3,state->reset,state->limit,state->qbpp, state->range);

  547. //    av_log(s->avctx, AV_LOG_DEBUG, "JPEG params: ILV=%i Pt=%i BPP=%i, scan = %i\n", ilv, point_transform, s->bits, s->cur_scan);

  548.     if(ilv == 0) { /* separate planes */

  549.         off = s->cur_scan - 1;

  550.         stride = (s->nb_components > 1) ? 3 : 1;

  551.         width = s->width * stride;

  552.         cur += off;

  553.         for(i = 0; i < s->height; i++) {

  554.             if(s->bits <= 8){

  555.                 ls_decode_line(state, s, last, cur, t, width, stride, off);

  556.                 t = last[0];

  557.             }else{

  558.                 ls_decode_line_16bpp(state, s, last, cur, t, width, stride, off);

  559.                 t = *((uint16_t*)last);

  560.             }

  561.             last = cur;

  562.             cur += s->picture.linesize[0];

  563. 

  564.             if (s->restart_interval && !--s->restart_count) {

  565.                 align_get_bits(&s->gb);

  566.                 skip_bits(&s->gb, 16); /* skip RSTn */

  567.             }

  568.         }

  569.     } else if(ilv == 1) { /* line interleaving */

  570.         int j;

  571.         int Rc[3] = {0, 0, 0};

  572.         memset(cur, 0, s->picture.linesize[0]);

  573.         width = s->width * 3;

  574.         for(i = 0; i < s->height; i++) {

  575.             for(j = 0; j < 3; j++) {

  576.                 ls_decode_line(state, s, last + j, cur + j, Rc[j], width, 3, j);

  577.                 Rc[j] = last[j];

  578. 

  579.                 if (s->restart_interval && !--s->restart_count) {

  580.                     align_get_bits(&s->gb);

  581.                     skip_bits(&s->gb, 16); /* skip RSTn */

  582.                 }

  583.             }

  584.             last = cur;

  585.             cur += s->picture.linesize[0];

  586.         }

  587.     } else if(ilv == 2) { /* sample interleaving */

  588.         av_log(s->avctx, AV_LOG_ERROR, "Sample interleaved images are not supported.\n");

  589.         av_free(state);

  590.         av_free(zero);

  591.         return -1;

  592.     }

  593. 

  594.     if(shift){ /* we need to do point transform or normalize samples */

  595.         int x, w;

  596. 

  597.         w = s->width * s->nb_components;

  598. 

  599.         if(s->bits <= 8){

  600.             uint8_t *src = s->picture.data[0];

  601. 

  602.             for(i = 0; i < s->height; i++){

  603.                 for(x = off; x < w; x+= stride){

  604.                     src[x] <<= shift;

  605.                 }

  606.                 src += s->picture.linesize[0];

  607.             }

  608.         }else{

  609.             uint16_t *src = s->picture.data[0];

  610. 

  611.             for(i = 0; i < s->height; i++){

  612.                 for(x = 0; x < w; x++){

  613.                     src[x] <<= shift;

  614.                 }

  615.                 src += s->picture.linesize[0]/2;

  616.             }

  617.         }

  618.     }

  619.     av_free(state);

  620.     av_free(zero);

  621. 

  622.     return 0;

  623. }

  624. 

  625. #if defined(CONFIG_ENCODERS) && defined(CONFIG_JPEGLS_ENCODER)

  626. /********** Encoder-specific functions **********/

  627. 

  628. /**

  629.  * Encode error from regular symbol

  630.  */

  631. static inline void ls_encode_regular(JLSState *state, PutBitContext *pb, int Q, int err){

  632.     int k;

  633.     int val;

  634.     int map;

  635. 

  636.     for(k = 0; (state->N[Q] << k) < state->A[Q]; k++);

  637. 

  638.     map = !state->near && !k && (2 * state->B[Q] <= -state->N[Q]);

  639. 

  640.     if(err < 0)

  641.         err += state->range;

  642.     if(err >= ((state->range + 1) >> 1)) {

  643.         err -= state->range;

  644.         val = 2 * FFABS(err) - 1 - map;

  645.     } else

  646.         val = 2 * err + map;

  647. 

  648.     set_ur_golomb_jpegls(pb, val, k, state->limit, state->qbpp);

  649. 

  650.     state->A[Q] += FFABS(err);

  651.     state->B[Q] += err * state->twonear;

  652. 

  653.     if(state->N[Q] == state->reset) {

  654.         state->A[Q] >>= 1;

  655.         state->B[Q] >>= 1;

  656.         state->N[Q] >>= 1;

  657.     }

  658.     state->N[Q]++;

  659. 

  660.     if(state->B[Q] <= -state->N[Q]) {

  661.         state->B[Q] += state->N[Q];

  662.         if(state->C[Q] > -128)

  663.             state->C[Q]--;

  664.         if(state->B[Q] <= -state->N[Q])

  665.             state->B[Q] = -state->N[Q] + 1;

  666.     }else if(state->B[Q] > 0){

  667.         state->B[Q] -= state->N[Q];

  668.         if(state->C[Q] < 127)

  669.             state->C[Q]++;

  670.         if(state->B[Q] > 0)

  671.             state->B[Q] = 0;

  672.     }

  673. }

  674. 

  675. /**

  676.  * Encode error from run termination

  677.  */

  678. static inline void ls_encode_runterm(JLSState *state, PutBitContext *pb, int RItype, int err, int limit_add){

  679.     int k;

  680.     int val, map;

  681.     int Q = 365 + RItype;

  682.     int temp;

  683. 

  684.     temp = state->A[Q];

  685.     if(RItype)

  686.         temp += state->N[Q] >> 1;

  687.     for(k = 0; (state->N[Q] << k) < temp; k++);

  688.     map = 0;

  689.     if(!k && err && (2 * state->B[Q] < state->N[Q]))

  690.         map = 1;

  691. 

  692.     if(err < 0)

  693.         val = - (2 * err) - 1 - RItype + map;

  694.     else

  695.         val = 2 * err - RItype - map;

  696.     set_ur_golomb_jpegls(pb, val, k, state->limit - limit_add - 1, state->qbpp);

  697. 

  698.     if(err < 0)

  699.         state->B[Q]++;

  700.     state->A[Q] += (val + 1 - RItype) >> 1;

  701. 

  702.     if(state->N[Q] == state->reset) {

  703.         state->A[Q] >>= 1;

  704.         state->B[Q] >>= 1;

  705.         state->N[Q] >>= 1;

  706.     }

  707.     state->N[Q]++;

  708. }

  709. 

  710. /**

  711.  * Encode run value as specified by JPEG-LS standard

  712.  */

  713. static inline void ls_encode_run(JLSState *state, PutBitContext *pb, int run, int comp, int trail){

  714.     while(run >= (1 << log2_run[state->run_index[comp]])){

  715.         put_bits(pb, 1, 1);

  716.         run -= 1 << log2_run[state->run_index[comp]];

  717.         if(state->run_index[comp] < 31)

  718.             state->run_index[comp]++;

  719.     }

  720.     /* if hit EOL, encode another full run, else encode aborted run */

  721.     if(!trail && run) {

  722.         put_bits(pb, 1, 1);

  723.     }else if(trail){

  724.         put_bits(pb, 1, 0);

  725.         if(log2_run[state->run_index[comp]])

  726.             put_bits(pb, log2_run[state->run_index[comp]], run);

  727.     }

  728. }

  729. 

  730. /**

  731.  * Encode one line of image

  732.  */

  733. static inline void ls_encode_line(JLSState *state, PutBitContext *pb, uint8_t *last, uint8_t *cur, int last2, int w, int stride, int comp){

  734.     int x = 0;

  735.     int Ra, Rb, Rc, Rd;

  736.     int D0, D1, D2;

  737. 

  738.     while(x < w) {

  739.         int err, pred, sign;

  740. 

  741.         /* compute gradients */

  742.         Ra = x ? cur[x - stride] : last[x];

  743.         Rb = last[x];

  744.         Rc = x ? last[x - stride] : last2;

  745.         Rd = (x >= w - stride) ? last[x] : last[x + stride];

  746.         D0 = Rd - Rb;

  747.         D1 = Rb - Rc;

  748.         D2 = Rc - Ra;

  749. 

  750.         /* run mode */

  751.         if((FFABS(D0) <= state->near) && (FFABS(D1) <= state->near) && (FFABS(D2) <= state->near)) {

  752.             int RUNval, RItype, run;

  753. 

  754.             run = 0;

  755.             RUNval = Ra;

  756.             while(x < w && (FFABS(cur[x] - RUNval) <= state->near)){

  757.                 run++;

  758.                 cur[x] = Ra;

  759.                 x += stride;

  760.             }

  761.             ls_encode_run(state, pb, run, comp, x < w);

  762.             if(x >= w)

  763.                 return;

  764.             Rb = last[x];

  765.             RItype = (FFABS(Ra - Rb) <= state->near);

  766.             pred = RItype ? Ra : Rb;

  767.             err = cur[x] - pred;

  768. 

  769.             if(!RItype && Ra > Rb)

  770.                 err = -err;

  771. 

  772.             if(state->near){

  773.                 if(err > 0)

  774.                     err = (state->near + err) / state->twonear;

  775.                 else

  776.                     err = -(state->near - err) / state->twonear;

  777. 

  778.                 if(RItype || (Rb >= Ra))

  779.                     Ra = clip(pred + err * state->twonear, 0, state->maxval);

  780.                 else

  781.                     Ra = clip(pred - err * state->twonear, 0, state->maxval);

  782.                 cur[x] = Ra;

  783.             }

  784.             if(err < 0)

  785.                 err += state->range;

  786.             if(err >= ((state->range + 1) >> 1))

  787.                 err -= state->range;

  788. 

  789.             ls_encode_runterm(state, pb, RItype, err, log2_run[state->run_index[comp]]);

  790. 

  791.             if(state->run_index[comp] > 0)

  792.                 state->run_index[comp]--;

  793.             x += stride;

  794.         } else { /* regular mode */

  795.             int context;

  796. 

  797.             context = quantize(state, D0) * 81 + quantize(state, D1) * 9 + quantize(state, D2);

  798.             pred = mid_pred(Ra, Ra + Rb - Rc, Rb);

  799. 

  800.             if(context < 0){

  801.                 context = -context;

  802.                 sign = 1;

  803.                 pred = clip(pred - state->C[context], 0, state->maxval);

  804.                 err = pred - cur[x];

  805.             }else{

  806.                 sign = 0;

  807.                 pred = clip(pred + state->C[context], 0, state->maxval);

  808.                 err = cur[x] - pred;

  809.             }

  810. 

  811.             if(state->near){

  812.                 if(err > 0)

  813.                     err = (state->near + err) / state->twonear;

  814.                 else

  815.                     err = -(state->near - err) / state->twonear;

  816.                 if(!sign)

  817.                     Ra = clip(pred + err * state->twonear, 0, state->maxval);

  818.                 else

  819.                     Ra = clip(pred - err * state->twonear, 0, state->maxval);

  820.                 cur[x] = Ra;

  821.             }

  822. 

  823.             ls_encode_regular(state, pb, context, err);

  824.             x += stride;

  825.         }

  826.     }

  827. }

  828. 

  829. /**

  830.  * Encode one line of image with 16 bpp sample size

  831.  */

  832. static inline void ls_encode_line_16bpp(JLSState *state, PutBitContext *pb, uint16_t *last, uint16_t *cur, int last2, int w, int stride, int comp){

  833.     int x = 0;

  834.     int Ra, Rb, Rc, Rd;

  835.     int D0, D1, D2;

  836. 

  837.     while(x < w) {

  838.         int err, pred, sign;

  839. 

  840.         /* compute gradients */

  841.         Ra = x ? cur[x - stride] : last[x];

  842.         Rb = last[x];

  843.         Rc = x ? last[x - stride] : last2;

  844.         Rd = (x >= w - stride) ? last[x] : last[x + stride];

  845.         D0 = Rd - Rb;

  846.         D1 = Rb - Rc;

  847.         D2 = Rc - Ra;

  848. 

  849.         /* run mode */

  850.         if((FFABS(D0) <= state->near) && (FFABS(D1) <= state->near) && (FFABS(D2) <= state->near)) {

  851.             int RUNval, RItype, run;

  852. 

  853.             run = 0;

  854.             RUNval = Ra;

  855.             while(x < w && (FFABS(cur[x] - RUNval) <= state->near)){

  856.                 run++;

  857.                 cur[x] = Ra;

  858.                 x += stride;

  859.             }

  860.             ls_encode_run(state, pb, run, comp, x < w);

  861.             if(x >= w)

  862.                 return;

  863.             Rb = last[x];

  864.             RItype = (FFABS(Ra - Rb) <= state->near);

  865.             pred = RItype ? Ra : Rb;

  866.             err = cur[x] - pred;

  867. 

  868.             if(!RItype && Ra > Rb)

  869.                 err = -err;

  870. 

  871.             if(state->near){

  872.                 if(err > 0)

  873.                     err = (state->near + err) / state->twonear;

  874.                 else

  875.                     err = -(state->near - err) / state->twonear;

  876. 

  877.                 if(RItype || (Rb >= Ra))

  878.                     Ra = clip(pred + err * state->twonear, 0, state->maxval);

  879.                 else

  880.                     Ra = clip(pred - err * state->twonear, 0, state->maxval);

  881.                 cur[x] = Ra;

  882.             }

  883.             if(err < 0)

  884.                 err += state->range;

  885.             if(err >= ((state->range + 1) >> 1))

  886.                 err -= state->range;

  887. 

  888.             ls_encode_runterm(state, pb, RItype, err, log2_run[state->run_index[comp]]);

  889. 

  890.             if(state->run_index[comp] > 0)

  891.                 state->run_index[comp]--;

  892.             x += stride;

  893.         } else { /* regular mode */

  894.             int context;

  895. 

  896.             context = quantize(state, D0) * 81 + quantize(state, D1) * 9 + quantize(state, D2);

  897.             pred = mid_pred(Ra, Ra + Rb - Rc, Rb);

  898. 

  899.             if(context < 0){

  900.                 context = -context;

  901.                 sign = 1;

  902.                 pred = clip(pred - state->C[context], 0, state->maxval);

  903.                 err = pred - cur[x];

  904.             }else{

  905.                 sign = 0;

  906.                 pred = clip(pred + state->C[context], 0, state->maxval);

  907.                 err = cur[x] - pred;

  908.             }

  909. 

  910.             if(state->near){

  911.                 if(err > 0)

  912.                     err = (state->near + err) / state->twonear;

  913.                 else

  914.                     err = -(state->near - err) / state->twonear;

  915.                 if(!sign)

  916.                     Ra = clip(pred + err * state->twonear, 0, state->maxval);

  917.                 else

  918.                     Ra = clip(pred - err * state->twonear, 0, state->maxval);

  919.                 cur[x] = Ra;

  920.             }

  921. 

  922.             ls_encode_regular(state, pb, context, err);

  923.             x += stride;

  924.         }

  925.     }

  926. }

  927. 

  928. static void ls_store_lse(JLSState *state, PutBitContext *pb){

  929.     /* Test if we have default params and don't need to store LSE */

  930.     JLSState state2;

  931.     memset(&state2, 0, sizeof(JLSState));

  932.     state2.bpp = state->bpp;

  933.     state2.near = state->near;

  934.     reset_ls_coding_parameters(&state2, 1);

  935.     if(state->T1 == state2.T1 && state->T2 == state2.T2 && state->T3 == state2.T3 && state->reset == state2.reset)

  936.         return;

  937.     /* store LSE type 1 */

  938.     put_marker(pb, LSE);

  939.     put_bits(pb, 16, 13);

  940.     put_bits(pb, 8,   1);

  941.     put_bits(pb, 16, state->maxval);

  942.     put_bits(pb, 16, state->T1);

  943.     put_bits(pb, 16, state->T2);

  944.     put_bits(pb, 16, state->T3);

  945.     put_bits(pb, 16, state->reset);

  946. }

  947. 

  948. static int encode_picture_ls(AVCodecContext *avctx, unsigned char *buf, int buf_size, void *data){

  949.     JpeglsContext * const s = avctx->priv_data;

  950.     AVFrame *pict = data;

  951.     AVFrame * const p= (AVFrame*)&s->picture;

  952.     const int near = avctx->prediction_method;

  953.     PutBitContext pb, pb2;

  954.     GetBitContext gb;

  955.     uint8_t *buf2, *zero, *cur, *last;

  956.     JLSState *state;

  957.     int i, size;

  958.     int comps;

  959. 

  960.     buf2 = av_malloc(buf_size);

  961. 

  962.     init_put_bits(&pb, buf, buf_size);

  963.     init_put_bits(&pb2, buf2, buf_size);

  964. 

  965.     *p = *pict;

  966.     p->pict_type= FF_I_TYPE;

  967.     p->key_frame= 1;

  968. 

  969.     if(avctx->pix_fmt == PIX_FMT_GRAY8 || avctx->pix_fmt == PIX_FMT_GRAY16)

  970.         comps = 1;

  971.     else

  972.         comps = 3;

  973. 

  974.     /* write our own JPEG header, can't use mjpeg_picture_header */

  975.     put_marker(&pb, SOI);

  976.     put_marker(&pb, SOF48);

  977.     put_bits(&pb, 16, 8 + comps * 3); // header size depends on components

  978.     put_bits(&pb,  8, (avctx->pix_fmt == PIX_FMT_GRAY16) ? 16 : 8); // bpp

  979.     put_bits(&pb, 16, avctx->height);

  980.     put_bits(&pb, 16, avctx->width);

  981.     put_bits(&pb,  8, comps);         // components

  982.     for(i = 1; i <= comps; i++) {

  983.         put_bits(&pb,  8, i);    // component ID

  984.         put_bits(&pb,  8, 0x11); // subsampling: none

  985.         put_bits(&pb,  8, 0);    // Tiq, used by JPEG-LS ext

  986.     }

  987. 

  988.     put_marker(&pb, SOS);

  989.     put_bits(&pb, 16, 6 + comps * 2);

  990.     put_bits(&pb,  8, comps);

  991.     for(i = 1; i <= comps; i++) {

  992.         put_bits(&pb,  8, i);  // component ID

  993.         put_bits(&pb,  8, 0);  // mapping index: none

  994.     }

  995.     put_bits(&pb,  8, near);

  996.     put_bits(&pb,  8, (comps > 1) ? 1 : 0); // interleaving: 0 - plane, 1 - line

  997.     put_bits(&pb,  8, 0); // point transform: none

  998. 

  999.     state = av_mallocz(sizeof(JLSState));

  1000.     /* initialize JPEG-LS state from JPEG parameters */

  1001.     state->near = near;

  1002.     state->bpp = (avctx->pix_fmt == PIX_FMT_GRAY16) ? 16 : 8;

  1003.     reset_ls_coding_parameters(state, 0);

  1004.     ls_init_state(state);

  1005. 

  1006.     ls_store_lse(state, &pb);

  1007. 

  1008.     zero = av_mallocz(p->linesize[0]);

  1009.     last = zero;

  1010.     cur = p->data[0];

  1011.     if(avctx->pix_fmt == PIX_FMT_GRAY8){

  1012.         int t = 0;

  1013. 

  1014.         for(i = 0; i < avctx->height; i++) {

  1015.             ls_encode_line(state, &pb2, last, cur, t, avctx->width, 1, 0);

  1016.             t = last[0];

  1017.             last = cur;

  1018.             cur += p->linesize[0];

  1019.         }

  1020.     }else if(avctx->pix_fmt == PIX_FMT_GRAY16){

  1021.         int t = 0;

  1022. 

  1023.         for(i = 0; i < avctx->height; i++) {

  1024.             ls_encode_line_16bpp(state, &pb2, last, cur, t, avctx->width, 1, 0);

  1025.             t = *((uint16_t*)last);

  1026.             last = cur;

  1027.             cur += p->linesize[0];

  1028.         }

  1029.     }else if(avctx->pix_fmt == PIX_FMT_RGB24){

  1030.         int j, width;

  1031.         int Rc[3] = {0, 0, 0};

  1032. 

  1033.         width = avctx->width * 3;

  1034.         for(i = 0; i < avctx->height; i++) {

  1035.             for(j = 0; j < 3; j++) {

  1036.                 ls_encode_line(state, &pb2, last + j, cur + j, Rc[j], width, 3, j);

  1037.                 Rc[j] = last[j];

  1038.             }

  1039.             last = cur;

  1040.             cur += s->picture.linesize[0];

  1041.         }

  1042.     }else if(avctx->pix_fmt == PIX_FMT_BGR24){

  1043.         int j, width;

  1044.         int Rc[3] = {0, 0, 0};

  1045. 

  1046.         width = avctx->width * 3;

  1047.         for(i = 0; i < avctx->height; i++) {

  1048.             for(j = 2; j >= 0; j--) {

  1049.                 ls_encode_line(state, &pb2, last + j, cur + j, Rc[j], width, 3, j);

  1050.                 Rc[j] = last[j];

  1051.             }

  1052.             last = cur;

  1053.             cur += s->picture.linesize[0];

  1054.         }

  1055.     }

  1056. 

  1057.     av_free(zero);

  1058.     av_free(state);

  1059. 

  1060.     flush_put_bits(&pb2);

  1061.     /* do escape coding */

  1062.     size = put_bits_count(&pb2) >> 3;

  1063.     init_get_bits(&gb, buf2, size);

  1064.     while(get_bits_count(&gb) < size * 8){

  1065.         int v;

  1066.         v = get_bits(&gb, 8);

  1067.         put_bits(&pb, 8, v);

  1068.         if(v == 0xFF){

  1069.             v = get_bits(&gb, 7);

  1070.             put_bits(&pb, 8, v);

  1071.         }

  1072.     }

  1073.     align_put_bits(&pb);

  1074.     av_free(buf2);

  1075. 

  1076.     /* End of image */

  1077.     put_marker(&pb, EOI);

  1078.     flush_put_bits(&pb);

  1079. 

  1080.     emms_c();

  1081. 

  1082.     return put_bits_count(&pb) >> 3;

  1083. }

  1084. 

  1085. static int encode_init_ls(AVCodecContext *ctx) {

  1086.     JpeglsContext *c = (JpeglsContext*)ctx->priv_data;

  1087. 

  1088.     c->avctx = ctx;

  1089.     ctx->coded_frame = &c->picture;

  1090. 

  1091.     if(ctx->pix_fmt != PIX_FMT_GRAY8 && ctx->pix_fmt != PIX_FMT_GRAY16 && ctx->pix_fmt != PIX_FMT_RGB24 && ctx->pix_fmt != PIX_FMT_BGR24){

  1092.         av_log(ctx, AV_LOG_ERROR, "Only grayscale and RGB24/BGR24 images are supported\n");

  1093.         return -1;

  1094.     }

  1095.     return 0;

  1096. }

  1097. 

  1098. AVCodec jpegls_encoder = { //FIXME avoid MPV_* lossless jpeg shouldnt need them

  1099.     "jpegls",

  1100.     CODEC_TYPE_VIDEO,

  1101.     CODEC_ID_JPEGLS,

  1102.     sizeof(JpeglsContext),

  1103.     encode_init_ls,

  1104.     encode_picture_ls,

  1105.     NULL,

  1106.     .pix_fmts= (enum PixelFormat[]){PIX_FMT_BGR24, PIX_FMT_RGB24, PIX_FMT_GRAY8, PIX_FMT_GRAY16, -1},

  1107. };

  1108. #endif