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.

861 lines
25KB

  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. #include "golomb.h"
  23. /**
  24. * @file jpeg_ls.c
  25. * JPEG-LS encoder and decoder.
  26. */
  27. typedef struct JpeglsContext{
  28. AVCodecContext *avctx;
  29. AVFrame picture;
  30. }JpeglsContext;
  31. typedef struct JLSState{
  32. int T1, T2, T3;
  33. int A[367], B[367], C[365], N[367];
  34. int limit, reset, bpp, qbpp, maxval, range;
  35. int near, twonear;
  36. int run_index[3];
  37. }JLSState;
  38. static const uint8_t log2_run[32]={
  39. 0, 0, 0, 0, 1, 1, 1, 1,
  40. 2, 2, 2, 2, 3, 3, 3, 3,
  41. 4, 4, 5, 5, 6, 6, 7, 7,
  42. 8, 9,10,11,12,13,14,15
  43. };
  44. /*
  45. * Uncomment this to significantly speed up decoding of broken JPEG-LS
  46. * (or test broken JPEG-LS decoder) and slow down ordinary decoding a bit.
  47. *
  48. * There is no Golomb code with length >= 32 bits possible, so check and
  49. * avoid situation of 32 zeros, FFmpeg Golomb decoder is painfully slow
  50. * on this errors.
  51. */
  52. //#define JLS_BROKEN
  53. /********** Functions for both encoder and decoder **********/
  54. /**
  55. * Calculate initial JPEG-LS parameters
  56. */
  57. static void ls_init_state(JLSState *state){
  58. int i;
  59. state->twonear = state->near * 2 + 1;
  60. state->range = ((state->maxval + state->twonear - 1) / state->twonear) + 1;
  61. // QBPP = ceil(log2(RANGE))
  62. for(state->qbpp = 0; (1 << state->qbpp) < state->range; state->qbpp++);
  63. if(state->bpp < 8)
  64. state->limit = 16 + 2 * state->bpp - state->qbpp;
  65. else
  66. state->limit = (4 * state->bpp) - state->qbpp;
  67. for(i = 0; i < 367; i++) {
  68. state->A[i] = FFMAX((state->range + 32) >> 6, 2);
  69. state->N[i] = 1;
  70. }
  71. }
  72. /**
  73. * Calculate quantized gradient value, used for context determination
  74. */
  75. static inline int quantize(JLSState *s, int v){ //FIXME optimize
  76. if(v==0) return 0;
  77. if(v < 0){
  78. if(v <= -s->T3) return -4;
  79. if(v <= -s->T2) return -3;
  80. if(v <= -s->T1) return -2;
  81. if(v < -s->near) return -1;
  82. return 0;
  83. }else{
  84. if(v <= s->near) return 0;
  85. if(v < s->T1) return 1;
  86. if(v < s->T2) return 2;
  87. if(v < s->T3) return 3;
  88. return 4;
  89. }
  90. }
  91. /**
  92. * Custom value clipping function used in T1, T2, T3 calculation
  93. */
  94. static inline int iso_clip(int v, int vmin, int vmax){
  95. if(v > vmax || v < vmin) return vmin;
  96. else return v;
  97. }
  98. /**
  99. * Calculate JPEG-LS codec values
  100. */
  101. static void reset_ls_coding_parameters(JLSState *s, int reset_all){
  102. const int basic_t1= 3;
  103. const int basic_t2= 7;
  104. const int basic_t3= 21;
  105. int factor;
  106. if(s->maxval==0 || reset_all) s->maxval= (1 << s->bpp) - 1;
  107. if(s->maxval >=128){
  108. factor= (FFMIN(s->maxval, 4095) + 128)>>8;
  109. if(s->T1==0 || reset_all)
  110. s->T1= iso_clip(factor*(basic_t1-2) + 2 + 3*s->near, s->near+1, s->maxval);
  111. if(s->T2==0 || reset_all)
  112. s->T2= iso_clip(factor*(basic_t2-3) + 3 + 5*s->near, s->T1, s->maxval);
  113. if(s->T3==0 || reset_all)
  114. s->T3= iso_clip(factor*(basic_t3-4) + 4 + 7*s->near, s->T2, s->maxval);
  115. }else{
  116. factor= 256 / (s->maxval + 1);
  117. if(s->T1==0 || reset_all)
  118. s->T1= iso_clip(FFMAX(2, basic_t1/factor + 3*s->near), s->near+1, s->maxval);
  119. if(s->T2==0 || reset_all)
  120. s->T2= iso_clip(FFMAX(3, basic_t2/factor + 5*s->near), s->T1, s->maxval);
  121. if(s->T3==0 || reset_all)
  122. s->T3= iso_clip(FFMAX(4, basic_t3/factor + 6*s->near), s->T2, s->maxval);
  123. }
  124. if(s->reset==0 || reset_all) s->reset= 64;
  125. // av_log(NULL, AV_LOG_DEBUG, "[JPEG-LS RESET] T=%i,%i,%i\n", s->T1, s->T2, s->T3);
  126. }
  127. /********** Decoder-specific functions **********/
  128. /**
  129. * Decode LSE block with initialization parameters
  130. */
  131. static int decode_lse(MJpegDecodeContext *s)
  132. {
  133. int len, id;
  134. /* XXX: verify len field validity */
  135. len = get_bits(&s->gb, 16);
  136. id = get_bits(&s->gb, 8);
  137. switch(id){
  138. case 1:
  139. s->maxval= get_bits(&s->gb, 16);
  140. s->t1= get_bits(&s->gb, 16);
  141. s->t2= get_bits(&s->gb, 16);
  142. s->t3= get_bits(&s->gb, 16);
  143. s->reset= get_bits(&s->gb, 16);
  144. // reset_ls_coding_parameters(s, 0);
  145. //FIXME quant table?
  146. break;
  147. case 2:
  148. case 3:
  149. av_log(s->avctx, AV_LOG_ERROR, "palette not supported\n");
  150. return -1;
  151. case 4:
  152. av_log(s->avctx, AV_LOG_ERROR, "oversize image not supported\n");
  153. return -1;
  154. default:
  155. av_log(s->avctx, AV_LOG_ERROR, "invalid id %d\n", id);
  156. return -1;
  157. }
  158. // av_log(s->avctx, AV_LOG_DEBUG, "ID=%i, T=%i,%i,%i\n", id, s->t1, s->t2, s->t3);
  159. return 0;
  160. }
  161. static void inline downscale_state(JLSState *state, int Q){
  162. if(state->N[Q] == state->reset){
  163. state->A[Q] >>=1;
  164. state->B[Q] >>=1;
  165. state->N[Q] >>=1;
  166. }
  167. state->N[Q]++;
  168. }
  169. static inline int update_state_regular(JLSState *state, int Q, int err){
  170. state->A[Q] += FFABS(err);
  171. err *= state->twonear;
  172. state->B[Q] += err;
  173. downscale_state(state, Q);
  174. if(state->B[Q] <= -state->N[Q]) {
  175. state->B[Q]= FFMAX(state->B[Q] + state->N[Q], 1-state->N[Q]);
  176. if(state->C[Q] > -128)
  177. state->C[Q]--;
  178. }else if(state->B[Q] > 0){
  179. state->B[Q]= FFMIN(state->B[Q] - state->N[Q], 0);
  180. if(state->C[Q] < 127)
  181. state->C[Q]++;
  182. }
  183. return err;
  184. }
  185. /**
  186. * Get context-dependent Golomb code, decode it and update context
  187. */
  188. static inline int ls_get_code_regular(GetBitContext *gb, JLSState *state, int Q){
  189. int k, ret;
  190. for(k = 0; (state->N[Q] << k) < state->A[Q]; k++);
  191. #ifdef JLS_BROKEN
  192. if(!show_bits_long(gb, 32))return -1;
  193. #endif
  194. ret = get_ur_golomb_jpegls(gb, k, state->limit, state->qbpp);
  195. /* decode mapped error */
  196. if(ret & 1)
  197. ret = -((ret + 1) >> 1);
  198. else
  199. ret >>= 1;
  200. /* for NEAR=0, k=0 and 2*B[Q] <= - N[Q] mapping is reversed */
  201. if(!state->near && !k && (2 * state->B[Q] <= -state->N[Q]))
  202. ret = -(ret + 1);
  203. ret= update_state_regular(state, Q, ret);
  204. return ret;
  205. }
  206. /**
  207. * Get Golomb code, decode it and update state for run termination
  208. */
  209. static inline int ls_get_code_runterm(GetBitContext *gb, JLSState *state, int RItype, int limit_add){
  210. int k, ret, temp, map;
  211. int Q = 365 + RItype;
  212. temp= state->A[Q];
  213. if(RItype)
  214. temp += state->N[Q] >> 1;
  215. for(k = 0; (state->N[Q] << k) < temp; k++);
  216. #ifdef JLS_BROKEN
  217. if(!show_bits_long(gb, 32))return -1;
  218. #endif
  219. ret = get_ur_golomb_jpegls(gb, k, state->limit - limit_add - 1, state->qbpp);
  220. /* decode mapped error */
  221. map = 0;
  222. if(!k && (RItype || ret) && (2 * state->B[Q] < state->N[Q]))
  223. map = 1;
  224. ret += RItype + map;
  225. if(ret & 1){
  226. ret = map - ((ret + 1) >> 1);
  227. state->B[Q]++;
  228. } else {
  229. ret = ret >> 1;
  230. }
  231. /* update state */
  232. state->A[Q] += FFABS(ret) - RItype;
  233. ret *= state->twonear;
  234. downscale_state(state, Q);
  235. return ret;
  236. }
  237. #define R(a, i ) (bits == 8 ? ((uint8_t*)(a))[i] : ((uint16_t*)(a))[i] )
  238. #define W(a, i, v) (bits == 8 ? (((uint8_t*)(a))[i]=v) : (((uint16_t*)(a))[i]=v))
  239. /**
  240. * Decode one line of image
  241. */
  242. static inline void ls_decode_line(JLSState *state, MJpegDecodeContext *s, void *last, void *dst, int last2, int w, int stride, int comp, int bits){
  243. int i, x = 0;
  244. int Ra, Rb, Rc, Rd;
  245. int D0, D1, D2;
  246. while(x < w) {
  247. int err, pred;
  248. /* compute gradients */
  249. Ra = x ? R(dst, x - stride) : R(last, x);
  250. Rb = R(last, x);
  251. Rc = x ? R(last, x - stride) : last2;
  252. Rd = (x >= w - stride) ? R(last, x) : R(last, x + stride);
  253. D0 = Rd - Rb;
  254. D1 = Rb - Rc;
  255. D2 = Rc - Ra;
  256. /* run mode */
  257. if((FFABS(D0) <= state->near) && (FFABS(D1) <= state->near) && (FFABS(D2) <= state->near)) {
  258. int r;
  259. int RItype;
  260. /* decode full runs while available */
  261. while(get_bits1(&s->gb)) {
  262. int r;
  263. r = 1 << log2_run[state->run_index[comp]];
  264. if(x + r * stride > w) {
  265. r = (w - x) / stride;
  266. }
  267. for(i = 0; i < r; i++) {
  268. W(dst, x, Ra);
  269. x += stride;
  270. }
  271. /* if EOL reached, we stop decoding */
  272. if(r != (1 << log2_run[state->run_index[comp]]))
  273. return;
  274. if(state->run_index[comp] < 31)
  275. state->run_index[comp]++;
  276. if(x + stride > w)
  277. return;
  278. }
  279. /* decode aborted run */
  280. r = log2_run[state->run_index[comp]];
  281. if(r)
  282. r = get_bits_long(&s->gb, r);
  283. for(i = 0; i < r; i++) {
  284. W(dst, x, Ra);
  285. x += stride;
  286. }
  287. /* decode run termination value */
  288. Rb = R(last, x);
  289. RItype = (FFABS(Ra - Rb) <= state->near) ? 1 : 0;
  290. err = ls_get_code_runterm(&s->gb, state, RItype, log2_run[state->run_index[comp]]);
  291. if(state->run_index[comp])
  292. state->run_index[comp]--;
  293. if(state->near && RItype){
  294. pred = Ra + err;
  295. } else {
  296. if(Rb < Ra)
  297. pred = Rb - err;
  298. else
  299. pred = Rb + err;
  300. }
  301. } else { /* regular mode */
  302. int context, sign;
  303. context = quantize(state, D0) * 81 + quantize(state, D1) * 9 + quantize(state, D2);
  304. pred = mid_pred(Ra, Ra + Rb - Rc, Rb);
  305. if(context < 0){
  306. context = -context;
  307. sign = 1;
  308. }else{
  309. sign = 0;
  310. }
  311. if(sign){
  312. pred = av_clip(pred - state->C[context], 0, state->maxval);
  313. err = -ls_get_code_regular(&s->gb, state, context);
  314. } else {
  315. pred = av_clip(pred + state->C[context], 0, state->maxval);
  316. err = ls_get_code_regular(&s->gb, state, context);
  317. }
  318. /* we have to do something more for near-lossless coding */
  319. pred += err;
  320. }
  321. if(state->near){
  322. if(pred < -state->near)
  323. pred += state->range * state->twonear;
  324. else if(pred > state->maxval + state->near)
  325. pred -= state->range * state->twonear;
  326. pred = av_clip(pred, 0, state->maxval);
  327. }
  328. pred &= state->maxval;
  329. W(dst, x, pred);
  330. x += stride;
  331. }
  332. }
  333. static int ls_decode_picture(MJpegDecodeContext *s, int near, int point_transform, int ilv){
  334. int i, t = 0;
  335. uint8_t *zero, *last, *cur;
  336. JLSState *state;
  337. int off = 0, stride = 1, width, shift;
  338. zero = av_mallocz(s->picture.linesize[0]);
  339. last = zero;
  340. cur = s->picture.data[0];
  341. state = av_mallocz(sizeof(JLSState));
  342. /* initialize JPEG-LS state from JPEG parameters */
  343. state->near = near;
  344. state->bpp = (s->bits < 2) ? 2 : s->bits;
  345. state->maxval = s->maxval;
  346. state->T1 = s->t1;
  347. state->T2 = s->t2;
  348. state->T3 = s->t3;
  349. state->reset = s->reset;
  350. reset_ls_coding_parameters(state, 0);
  351. ls_init_state(state);
  352. if(s->bits <= 8)
  353. shift = point_transform + (8 - s->bits);
  354. else
  355. shift = point_transform + (16 - s->bits);
  356. // 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);
  357. // 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);
  358. if(ilv == 0) { /* separate planes */
  359. off = s->cur_scan - 1;
  360. stride = (s->nb_components > 1) ? 3 : 1;
  361. width = s->width * stride;
  362. cur += off;
  363. for(i = 0; i < s->height; i++) {
  364. if(s->bits <= 8){
  365. ls_decode_line(state, s, last, cur, t, width, stride, off, 8);
  366. t = last[0];
  367. }else{
  368. ls_decode_line(state, s, last, cur, t, width, stride, off, 16);
  369. t = *((uint16_t*)last);
  370. }
  371. last = cur;
  372. cur += s->picture.linesize[0];
  373. if (s->restart_interval && !--s->restart_count) {
  374. align_get_bits(&s->gb);
  375. skip_bits(&s->gb, 16); /* skip RSTn */
  376. }
  377. }
  378. } else if(ilv == 1) { /* line interleaving */
  379. int j;
  380. int Rc[3] = {0, 0, 0};
  381. memset(cur, 0, s->picture.linesize[0]);
  382. width = s->width * 3;
  383. for(i = 0; i < s->height; i++) {
  384. for(j = 0; j < 3; j++) {
  385. ls_decode_line(state, s, last + j, cur + j, Rc[j], width, 3, j, 8);
  386. Rc[j] = last[j];
  387. if (s->restart_interval && !--s->restart_count) {
  388. align_get_bits(&s->gb);
  389. skip_bits(&s->gb, 16); /* skip RSTn */
  390. }
  391. }
  392. last = cur;
  393. cur += s->picture.linesize[0];
  394. }
  395. } else if(ilv == 2) { /* sample interleaving */
  396. av_log(s->avctx, AV_LOG_ERROR, "Sample interleaved images are not supported.\n");
  397. av_free(state);
  398. av_free(zero);
  399. return -1;
  400. }
  401. if(shift){ /* we need to do point transform or normalize samples */
  402. int x, w;
  403. w = s->width * s->nb_components;
  404. if(s->bits <= 8){
  405. uint8_t *src = s->picture.data[0];
  406. for(i = 0; i < s->height; i++){
  407. for(x = off; x < w; x+= stride){
  408. src[x] <<= shift;
  409. }
  410. src += s->picture.linesize[0];
  411. }
  412. }else{
  413. uint16_t *src = (uint16_t*) s->picture.data[0];
  414. for(i = 0; i < s->height; i++){
  415. for(x = 0; x < w; x++){
  416. src[x] <<= shift;
  417. }
  418. src += s->picture.linesize[0]/2;
  419. }
  420. }
  421. }
  422. av_free(state);
  423. av_free(zero);
  424. return 0;
  425. }
  426. #if defined(CONFIG_ENCODERS) && defined(CONFIG_JPEGLS_ENCODER)
  427. /********** Encoder-specific functions **********/
  428. /**
  429. * Encode error from regular symbol
  430. */
  431. static inline void ls_encode_regular(JLSState *state, PutBitContext *pb, int Q, int err){
  432. int k;
  433. int val;
  434. int map;
  435. for(k = 0; (state->N[Q] << k) < state->A[Q]; k++);
  436. map = !state->near && !k && (2 * state->B[Q] <= -state->N[Q]);
  437. if(err < 0)
  438. err += state->range;
  439. if(err >= ((state->range + 1) >> 1)) {
  440. err -= state->range;
  441. val = 2 * FFABS(err) - 1 - map;
  442. } else
  443. val = 2 * err + map;
  444. set_ur_golomb_jpegls(pb, val, k, state->limit, state->qbpp);
  445. update_state_regular(state, Q, err);
  446. }
  447. /**
  448. * Encode error from run termination
  449. */
  450. static inline void ls_encode_runterm(JLSState *state, PutBitContext *pb, int RItype, int err, int limit_add){
  451. int k;
  452. int val, map;
  453. int Q = 365 + RItype;
  454. int temp;
  455. temp = state->A[Q];
  456. if(RItype)
  457. temp += state->N[Q] >> 1;
  458. for(k = 0; (state->N[Q] << k) < temp; k++);
  459. map = 0;
  460. if(!k && err && (2 * state->B[Q] < state->N[Q]))
  461. map = 1;
  462. if(err < 0)
  463. val = - (2 * err) - 1 - RItype + map;
  464. else
  465. val = 2 * err - RItype - map;
  466. set_ur_golomb_jpegls(pb, val, k, state->limit - limit_add - 1, state->qbpp);
  467. if(err < 0)
  468. state->B[Q]++;
  469. state->A[Q] += (val + 1 - RItype) >> 1;
  470. downscale_state(state, Q);
  471. }
  472. /**
  473. * Encode run value as specified by JPEG-LS standard
  474. */
  475. static inline void ls_encode_run(JLSState *state, PutBitContext *pb, int run, int comp, int trail){
  476. while(run >= (1 << log2_run[state->run_index[comp]])){
  477. put_bits(pb, 1, 1);
  478. run -= 1 << log2_run[state->run_index[comp]];
  479. if(state->run_index[comp] < 31)
  480. state->run_index[comp]++;
  481. }
  482. /* if hit EOL, encode another full run, else encode aborted run */
  483. if(!trail && run) {
  484. put_bits(pb, 1, 1);
  485. }else if(trail){
  486. put_bits(pb, 1, 0);
  487. if(log2_run[state->run_index[comp]])
  488. put_bits(pb, log2_run[state->run_index[comp]], run);
  489. }
  490. }
  491. /**
  492. * Encode one line of image
  493. */
  494. static inline void ls_encode_line(JLSState *state, PutBitContext *pb, void *last, void *cur, int last2, int w, int stride, int comp, int bits){
  495. int x = 0;
  496. int Ra, Rb, Rc, Rd;
  497. int D0, D1, D2;
  498. while(x < w) {
  499. int err, pred, sign;
  500. /* compute gradients */
  501. Ra = x ? R(cur, x - stride) : R(last, x);
  502. Rb = R(last, x);
  503. Rc = x ? R(last, x - stride) : last2;
  504. Rd = (x >= w - stride) ? R(last, x) : R(last, x + stride);
  505. D0 = Rd - Rb;
  506. D1 = Rb - Rc;
  507. D2 = Rc - Ra;
  508. /* run mode */
  509. if((FFABS(D0) <= state->near) && (FFABS(D1) <= state->near) && (FFABS(D2) <= state->near)) {
  510. int RUNval, RItype, run;
  511. run = 0;
  512. RUNval = Ra;
  513. while(x < w && (FFABS(R(cur, x) - RUNval) <= state->near)){
  514. run++;
  515. W(cur, x, Ra);
  516. x += stride;
  517. }
  518. ls_encode_run(state, pb, run, comp, x < w);
  519. if(x >= w)
  520. return;
  521. Rb = R(last, x);
  522. RItype = (FFABS(Ra - Rb) <= state->near);
  523. pred = RItype ? Ra : Rb;
  524. err = R(cur, x) - pred;
  525. if(!RItype && Ra > Rb)
  526. err = -err;
  527. if(state->near){
  528. if(err > 0)
  529. err = (state->near + err) / state->twonear;
  530. else
  531. err = -(state->near - err) / state->twonear;
  532. if(RItype || (Rb >= Ra))
  533. Ra = av_clip(pred + err * state->twonear, 0, state->maxval);
  534. else
  535. Ra = av_clip(pred - err * state->twonear, 0, state->maxval);
  536. W(cur, x, Ra);
  537. }
  538. if(err < 0)
  539. err += state->range;
  540. if(err >= ((state->range + 1) >> 1))
  541. err -= state->range;
  542. ls_encode_runterm(state, pb, RItype, err, log2_run[state->run_index[comp]]);
  543. if(state->run_index[comp] > 0)
  544. state->run_index[comp]--;
  545. } else { /* regular mode */
  546. int context;
  547. context = quantize(state, D0) * 81 + quantize(state, D1) * 9 + quantize(state, D2);
  548. pred = mid_pred(Ra, Ra + Rb - Rc, Rb);
  549. if(context < 0){
  550. context = -context;
  551. sign = 1;
  552. pred = av_clip(pred - state->C[context], 0, state->maxval);
  553. err = pred - R(cur, x);
  554. }else{
  555. sign = 0;
  556. pred = av_clip(pred + state->C[context], 0, state->maxval);
  557. err = R(cur, x) - pred;
  558. }
  559. if(state->near){
  560. if(err > 0)
  561. err = (state->near + err) / state->twonear;
  562. else
  563. err = -(state->near - err) / state->twonear;
  564. if(!sign)
  565. Ra = av_clip(pred + err * state->twonear, 0, state->maxval);
  566. else
  567. Ra = av_clip(pred - err * state->twonear, 0, state->maxval);
  568. W(cur, x, Ra);
  569. }
  570. ls_encode_regular(state, pb, context, err);
  571. }
  572. x += stride;
  573. }
  574. }
  575. static void ls_store_lse(JLSState *state, PutBitContext *pb){
  576. /* Test if we have default params and don't need to store LSE */
  577. JLSState state2;
  578. memset(&state2, 0, sizeof(JLSState));
  579. state2.bpp = state->bpp;
  580. state2.near = state->near;
  581. reset_ls_coding_parameters(&state2, 1);
  582. if(state->T1 == state2.T1 && state->T2 == state2.T2 && state->T3 == state2.T3 && state->reset == state2.reset)
  583. return;
  584. /* store LSE type 1 */
  585. put_marker(pb, LSE);
  586. put_bits(pb, 16, 13);
  587. put_bits(pb, 8, 1);
  588. put_bits(pb, 16, state->maxval);
  589. put_bits(pb, 16, state->T1);
  590. put_bits(pb, 16, state->T2);
  591. put_bits(pb, 16, state->T3);
  592. put_bits(pb, 16, state->reset);
  593. }
  594. static int encode_picture_ls(AVCodecContext *avctx, unsigned char *buf, int buf_size, void *data){
  595. JpeglsContext * const s = avctx->priv_data;
  596. AVFrame *pict = data;
  597. AVFrame * const p= (AVFrame*)&s->picture;
  598. const int near = avctx->prediction_method;
  599. PutBitContext pb, pb2;
  600. GetBitContext gb;
  601. uint8_t *buf2, *zero, *cur, *last;
  602. JLSState *state;
  603. int i, size;
  604. int comps;
  605. buf2 = av_malloc(buf_size);
  606. init_put_bits(&pb, buf, buf_size);
  607. init_put_bits(&pb2, buf2, buf_size);
  608. *p = *pict;
  609. p->pict_type= FF_I_TYPE;
  610. p->key_frame= 1;
  611. if(avctx->pix_fmt == PIX_FMT_GRAY8 || avctx->pix_fmt == PIX_FMT_GRAY16)
  612. comps = 1;
  613. else
  614. comps = 3;
  615. /* write our own JPEG header, can't use mjpeg_picture_header */
  616. put_marker(&pb, SOI);
  617. put_marker(&pb, SOF48);
  618. put_bits(&pb, 16, 8 + comps * 3); // header size depends on components
  619. put_bits(&pb, 8, (avctx->pix_fmt == PIX_FMT_GRAY16) ? 16 : 8); // bpp
  620. put_bits(&pb, 16, avctx->height);
  621. put_bits(&pb, 16, avctx->width);
  622. put_bits(&pb, 8, comps); // components
  623. for(i = 1; i <= comps; i++) {
  624. put_bits(&pb, 8, i); // component ID
  625. put_bits(&pb, 8, 0x11); // subsampling: none
  626. put_bits(&pb, 8, 0); // Tiq, used by JPEG-LS ext
  627. }
  628. put_marker(&pb, SOS);
  629. put_bits(&pb, 16, 6 + comps * 2);
  630. put_bits(&pb, 8, comps);
  631. for(i = 1; i <= comps; i++) {
  632. put_bits(&pb, 8, i); // component ID
  633. put_bits(&pb, 8, 0); // mapping index: none
  634. }
  635. put_bits(&pb, 8, near);
  636. put_bits(&pb, 8, (comps > 1) ? 1 : 0); // interleaving: 0 - plane, 1 - line
  637. put_bits(&pb, 8, 0); // point transform: none
  638. state = av_mallocz(sizeof(JLSState));
  639. /* initialize JPEG-LS state from JPEG parameters */
  640. state->near = near;
  641. state->bpp = (avctx->pix_fmt == PIX_FMT_GRAY16) ? 16 : 8;
  642. reset_ls_coding_parameters(state, 0);
  643. ls_init_state(state);
  644. ls_store_lse(state, &pb);
  645. zero = av_mallocz(p->linesize[0]);
  646. last = zero;
  647. cur = p->data[0];
  648. if(avctx->pix_fmt == PIX_FMT_GRAY8){
  649. int t = 0;
  650. for(i = 0; i < avctx->height; i++) {
  651. ls_encode_line(state, &pb2, last, cur, t, avctx->width, 1, 0, 8);
  652. t = last[0];
  653. last = cur;
  654. cur += p->linesize[0];
  655. }
  656. }else if(avctx->pix_fmt == PIX_FMT_GRAY16){
  657. int t = 0;
  658. for(i = 0; i < avctx->height; i++) {
  659. ls_encode_line(state, &pb2, last, cur, t, avctx->width, 1, 0, 16);
  660. t = *((uint16_t*)last);
  661. last = cur;
  662. cur += p->linesize[0];
  663. }
  664. }else if(avctx->pix_fmt == PIX_FMT_RGB24){
  665. int j, width;
  666. int Rc[3] = {0, 0, 0};
  667. width = avctx->width * 3;
  668. for(i = 0; i < avctx->height; i++) {
  669. for(j = 0; j < 3; j++) {
  670. ls_encode_line(state, &pb2, last + j, cur + j, Rc[j], width, 3, j, 8);
  671. Rc[j] = last[j];
  672. }
  673. last = cur;
  674. cur += s->picture.linesize[0];
  675. }
  676. }else if(avctx->pix_fmt == PIX_FMT_BGR24){
  677. int j, width;
  678. int Rc[3] = {0, 0, 0};
  679. width = avctx->width * 3;
  680. for(i = 0; i < avctx->height; i++) {
  681. for(j = 2; j >= 0; j--) {
  682. ls_encode_line(state, &pb2, last + j, cur + j, Rc[j], width, 3, j, 8);
  683. Rc[j] = last[j];
  684. }
  685. last = cur;
  686. cur += s->picture.linesize[0];
  687. }
  688. }
  689. av_free(zero);
  690. av_free(state);
  691. // the specification says that after doing 0xff escaping unused bits in the
  692. // last byte must be set to 0, so just append 7 "optional" zero-bits to
  693. // avoid special-casing.
  694. put_bits(&pb2, 7, 0);
  695. size = put_bits_count(&pb2);
  696. flush_put_bits(&pb2);
  697. /* do escape coding */
  698. init_get_bits(&gb, buf2, size);
  699. size -= 7;
  700. while(get_bits_count(&gb) < size){
  701. int v;
  702. v = get_bits(&gb, 8);
  703. put_bits(&pb, 8, v);
  704. if(v == 0xFF){
  705. v = get_bits(&gb, 7);
  706. put_bits(&pb, 8, v);
  707. }
  708. }
  709. align_put_bits(&pb);
  710. av_free(buf2);
  711. /* End of image */
  712. put_marker(&pb, EOI);
  713. flush_put_bits(&pb);
  714. emms_c();
  715. return put_bits_count(&pb) >> 3;
  716. }
  717. static int encode_init_ls(AVCodecContext *ctx) {
  718. JpeglsContext *c = (JpeglsContext*)ctx->priv_data;
  719. c->avctx = ctx;
  720. ctx->coded_frame = &c->picture;
  721. 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){
  722. av_log(ctx, AV_LOG_ERROR, "Only grayscale and RGB24/BGR24 images are supported\n");
  723. return -1;
  724. }
  725. return 0;
  726. }
  727. AVCodec jpegls_encoder = { //FIXME avoid MPV_* lossless jpeg shouldnt need them
  728. "jpegls",
  729. CODEC_TYPE_VIDEO,
  730. CODEC_ID_JPEGLS,
  731. sizeof(JpeglsContext),
  732. encode_init_ls,
  733. encode_picture_ls,
  734. NULL,
  735. .pix_fmts= (enum PixelFormat[]){PIX_FMT_BGR24, PIX_FMT_RGB24, PIX_FMT_GRAY8, PIX_FMT_GRAY16, -1},
  736. };
  737. #endif