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.

1393 lines
40KB

  1. /*
  2. * MJPEG encoder and decoder
  3. * Copyright (c) 2000, 2001 Fabrice Bellard.
  4. *
  5. * This library is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU Lesser General Public
  7. * License as published by the Free Software Foundation; either
  8. * version 2 of the License, or (at your option) any later version.
  9. *
  10. * This library is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * Lesser General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Lesser General Public
  16. * License along with this library; if not, write to the Free Software
  17. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  18. *
  19. * Support for external huffman table, various fixes (AVID workaround),
  20. * aspecting and various markers support
  21. * by Alex Beregszaszi <alex@naxine.org>
  22. */
  23. //#define DEBUG
  24. #include "avcodec.h"
  25. #include "dsputil.h"
  26. #include "mpegvideo.h"
  27. #ifdef USE_FASTMEMCPY
  28. #include "fastmemcpy.h"
  29. #endif
  30. /* use two quantizer table (one for luminance and one for chrominance) */
  31. /* not yet working */
  32. #undef TWOMATRIXES
  33. typedef struct MJpegContext {
  34. UINT8 huff_size_dc_luminance[12];
  35. UINT16 huff_code_dc_luminance[12];
  36. UINT8 huff_size_dc_chrominance[12];
  37. UINT16 huff_code_dc_chrominance[12];
  38. UINT8 huff_size_ac_luminance[256];
  39. UINT16 huff_code_ac_luminance[256];
  40. UINT8 huff_size_ac_chrominance[256];
  41. UINT16 huff_code_ac_chrominance[256];
  42. } MJpegContext;
  43. /* JPEG marker codes */
  44. typedef enum {
  45. /* start of frame */
  46. SOF0 = 0xc0, /* baseline */
  47. SOF1 = 0xc1, /* extended sequential, huffman */
  48. SOF2 = 0xc2, /* progressive, huffman */
  49. SOF3 = 0xc3, /* lossless, huffman */
  50. SOF5 = 0xc5, /* differential sequential, huffman */
  51. SOF6 = 0xc6, /* differential progressive, huffman */
  52. SOF7 = 0xc7, /* differential lossless, huffman */
  53. JPG = 0xc8, /* reserved for JPEG extension */
  54. SOF9 = 0xc9, /* extended sequential, arithmetic */
  55. SOF10 = 0xca, /* progressive, arithmetic */
  56. SOF11 = 0xcb, /* lossless, arithmetic */
  57. SOF13 = 0xcd, /* differential sequential, arithmetic */
  58. SOF14 = 0xce, /* differential progressive, arithmetic */
  59. SOF15 = 0xcf, /* differential lossless, arithmetic */
  60. DHT = 0xc4, /* define huffman tables */
  61. DAC = 0xcc, /* define arithmetic-coding conditioning */
  62. /* restart with modulo 8 count "m" */
  63. RST0 = 0xd0,
  64. RST1 = 0xd1,
  65. RST2 = 0xd2,
  66. RST3 = 0xd3,
  67. RST4 = 0xd4,
  68. RST5 = 0xd5,
  69. RST6 = 0xd6,
  70. RST7 = 0xd7,
  71. SOI = 0xd8, /* start of image */
  72. EOI = 0xd9, /* end of image */
  73. SOS = 0xda, /* start of scan */
  74. DQT = 0xdb, /* define quantization tables */
  75. DNL = 0xdc, /* define number of lines */
  76. DRI = 0xdd, /* define restart interval */
  77. DHP = 0xde, /* define hierarchical progression */
  78. EXP = 0xdf, /* expand reference components */
  79. APP0 = 0xe0,
  80. APP1 = 0xe1,
  81. APP2 = 0xe2,
  82. APP3 = 0xe3,
  83. APP4 = 0xe4,
  84. APP5 = 0xe5,
  85. APP6 = 0xe6,
  86. APP7 = 0xe7,
  87. APP8 = 0xe8,
  88. APP9 = 0xe9,
  89. APP10 = 0xea,
  90. APP11 = 0xeb,
  91. APP12 = 0xec,
  92. APP13 = 0xed,
  93. APP14 = 0xee,
  94. APP15 = 0xef,
  95. JPG0 = 0xf0,
  96. JPG1 = 0xf1,
  97. JPG2 = 0xf2,
  98. JPG3 = 0xf3,
  99. JPG4 = 0xf4,
  100. JPG5 = 0xf5,
  101. JPG6 = 0xf6,
  102. JPG7 = 0xf7,
  103. JPG8 = 0xf8,
  104. JPG9 = 0xf9,
  105. JPG10 = 0xfa,
  106. JPG11 = 0xfb,
  107. JPG12 = 0xfc,
  108. JPG13 = 0xfd,
  109. COM = 0xfe, /* comment */
  110. TEM = 0x01, /* temporary private use for arithmetic coding */
  111. /* 0x02 -> 0xbf reserved */
  112. } JPEG_MARKER;
  113. #if 0
  114. /* These are the sample quantization tables given in JPEG spec section K.1.
  115. * The spec says that the values given produce "good" quality, and
  116. * when divided by 2, "very good" quality.
  117. */
  118. static const unsigned char std_luminance_quant_tbl[64] = {
  119. 16, 11, 10, 16, 24, 40, 51, 61,
  120. 12, 12, 14, 19, 26, 58, 60, 55,
  121. 14, 13, 16, 24, 40, 57, 69, 56,
  122. 14, 17, 22, 29, 51, 87, 80, 62,
  123. 18, 22, 37, 56, 68, 109, 103, 77,
  124. 24, 35, 55, 64, 81, 104, 113, 92,
  125. 49, 64, 78, 87, 103, 121, 120, 101,
  126. 72, 92, 95, 98, 112, 100, 103, 99
  127. };
  128. static const unsigned char std_chrominance_quant_tbl[64] = {
  129. 17, 18, 24, 47, 99, 99, 99, 99,
  130. 18, 21, 26, 66, 99, 99, 99, 99,
  131. 24, 26, 56, 99, 99, 99, 99, 99,
  132. 47, 66, 99, 99, 99, 99, 99, 99,
  133. 99, 99, 99, 99, 99, 99, 99, 99,
  134. 99, 99, 99, 99, 99, 99, 99, 99,
  135. 99, 99, 99, 99, 99, 99, 99, 99,
  136. 99, 99, 99, 99, 99, 99, 99, 99
  137. };
  138. #endif
  139. /* Set up the standard Huffman tables (cf. JPEG standard section K.3) */
  140. /* IMPORTANT: these are only valid for 8-bit data precision! */
  141. static const UINT8 bits_dc_luminance[17] =
  142. { /* 0-base */ 0, 0, 1, 5, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0 };
  143. static const UINT8 val_dc_luminance[] =
  144. { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 };
  145. static const UINT8 bits_dc_chrominance[17] =
  146. { /* 0-base */ 0, 0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0 };
  147. static const UINT8 val_dc_chrominance[] =
  148. { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 };
  149. static const UINT8 bits_ac_luminance[17] =
  150. { /* 0-base */ 0, 0, 2, 1, 3, 3, 2, 4, 3, 5, 5, 4, 4, 0, 0, 1, 0x7d };
  151. static const UINT8 val_ac_luminance[] =
  152. { 0x01, 0x02, 0x03, 0x00, 0x04, 0x11, 0x05, 0x12,
  153. 0x21, 0x31, 0x41, 0x06, 0x13, 0x51, 0x61, 0x07,
  154. 0x22, 0x71, 0x14, 0x32, 0x81, 0x91, 0xa1, 0x08,
  155. 0x23, 0x42, 0xb1, 0xc1, 0x15, 0x52, 0xd1, 0xf0,
  156. 0x24, 0x33, 0x62, 0x72, 0x82, 0x09, 0x0a, 0x16,
  157. 0x17, 0x18, 0x19, 0x1a, 0x25, 0x26, 0x27, 0x28,
  158. 0x29, 0x2a, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39,
  159. 0x3a, 0x43, 0x44, 0x45, 0x46, 0x47, 0x48, 0x49,
  160. 0x4a, 0x53, 0x54, 0x55, 0x56, 0x57, 0x58, 0x59,
  161. 0x5a, 0x63, 0x64, 0x65, 0x66, 0x67, 0x68, 0x69,
  162. 0x6a, 0x73, 0x74, 0x75, 0x76, 0x77, 0x78, 0x79,
  163. 0x7a, 0x83, 0x84, 0x85, 0x86, 0x87, 0x88, 0x89,
  164. 0x8a, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97, 0x98,
  165. 0x99, 0x9a, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6, 0xa7,
  166. 0xa8, 0xa9, 0xaa, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6,
  167. 0xb7, 0xb8, 0xb9, 0xba, 0xc2, 0xc3, 0xc4, 0xc5,
  168. 0xc6, 0xc7, 0xc8, 0xc9, 0xca, 0xd2, 0xd3, 0xd4,
  169. 0xd5, 0xd6, 0xd7, 0xd8, 0xd9, 0xda, 0xe1, 0xe2,
  170. 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, 0xe8, 0xe9, 0xea,
  171. 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8,
  172. 0xf9, 0xfa
  173. };
  174. static const UINT8 bits_ac_chrominance[17] =
  175. { /* 0-base */ 0, 0, 2, 1, 2, 4, 4, 3, 4, 7, 5, 4, 4, 0, 1, 2, 0x77 };
  176. static const UINT8 val_ac_chrominance[] =
  177. { 0x00, 0x01, 0x02, 0x03, 0x11, 0x04, 0x05, 0x21,
  178. 0x31, 0x06, 0x12, 0x41, 0x51, 0x07, 0x61, 0x71,
  179. 0x13, 0x22, 0x32, 0x81, 0x08, 0x14, 0x42, 0x91,
  180. 0xa1, 0xb1, 0xc1, 0x09, 0x23, 0x33, 0x52, 0xf0,
  181. 0x15, 0x62, 0x72, 0xd1, 0x0a, 0x16, 0x24, 0x34,
  182. 0xe1, 0x25, 0xf1, 0x17, 0x18, 0x19, 0x1a, 0x26,
  183. 0x27, 0x28, 0x29, 0x2a, 0x35, 0x36, 0x37, 0x38,
  184. 0x39, 0x3a, 0x43, 0x44, 0x45, 0x46, 0x47, 0x48,
  185. 0x49, 0x4a, 0x53, 0x54, 0x55, 0x56, 0x57, 0x58,
  186. 0x59, 0x5a, 0x63, 0x64, 0x65, 0x66, 0x67, 0x68,
  187. 0x69, 0x6a, 0x73, 0x74, 0x75, 0x76, 0x77, 0x78,
  188. 0x79, 0x7a, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87,
  189. 0x88, 0x89, 0x8a, 0x92, 0x93, 0x94, 0x95, 0x96,
  190. 0x97, 0x98, 0x99, 0x9a, 0xa2, 0xa3, 0xa4, 0xa5,
  191. 0xa6, 0xa7, 0xa8, 0xa9, 0xaa, 0xb2, 0xb3, 0xb4,
  192. 0xb5, 0xb6, 0xb7, 0xb8, 0xb9, 0xba, 0xc2, 0xc3,
  193. 0xc4, 0xc5, 0xc6, 0xc7, 0xc8, 0xc9, 0xca, 0xd2,
  194. 0xd3, 0xd4, 0xd5, 0xd6, 0xd7, 0xd8, 0xd9, 0xda,
  195. 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, 0xe8, 0xe9,
  196. 0xea, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8,
  197. 0xf9, 0xfa
  198. };
  199. /* isn't this function nicer than the one in the libjpeg ? */
  200. static void build_huffman_codes(UINT8 *huff_size, UINT16 *huff_code,
  201. const UINT8 *bits_table, const UINT8 *val_table)
  202. {
  203. int i, j, k,nb, code, sym;
  204. code = 0;
  205. k = 0;
  206. for(i=1;i<=16;i++) {
  207. nb = bits_table[i];
  208. for(j=0;j<nb;j++) {
  209. sym = val_table[k++];
  210. huff_size[sym] = i;
  211. huff_code[sym] = code;
  212. code++;
  213. }
  214. code <<= 1;
  215. }
  216. }
  217. int mjpeg_init(MpegEncContext *s)
  218. {
  219. MJpegContext *m;
  220. m = av_malloc(sizeof(MJpegContext));
  221. if (!m)
  222. return -1;
  223. s->min_qcoeff=-1023;
  224. s->max_qcoeff= 1023;
  225. s->intra_quant_bias= 1<<(QUANT_BIAS_SHIFT-1); //(a + x/2)/x
  226. /* build all the huffman tables */
  227. build_huffman_codes(m->huff_size_dc_luminance,
  228. m->huff_code_dc_luminance,
  229. bits_dc_luminance,
  230. val_dc_luminance);
  231. build_huffman_codes(m->huff_size_dc_chrominance,
  232. m->huff_code_dc_chrominance,
  233. bits_dc_chrominance,
  234. val_dc_chrominance);
  235. build_huffman_codes(m->huff_size_ac_luminance,
  236. m->huff_code_ac_luminance,
  237. bits_ac_luminance,
  238. val_ac_luminance);
  239. build_huffman_codes(m->huff_size_ac_chrominance,
  240. m->huff_code_ac_chrominance,
  241. bits_ac_chrominance,
  242. val_ac_chrominance);
  243. s->mjpeg_ctx = m;
  244. return 0;
  245. }
  246. void mjpeg_close(MpegEncContext *s)
  247. {
  248. av_free(s->mjpeg_ctx);
  249. }
  250. static inline void put_marker(PutBitContext *p, int code)
  251. {
  252. put_bits(p, 8, 0xff);
  253. put_bits(p, 8, code);
  254. }
  255. /* table_class: 0 = DC coef, 1 = AC coefs */
  256. static int put_huffman_table(MpegEncContext *s, int table_class, int table_id,
  257. const UINT8 *bits_table, const UINT8 *value_table)
  258. {
  259. PutBitContext *p = &s->pb;
  260. int n, i;
  261. put_bits(p, 4, table_class);
  262. put_bits(p, 4, table_id);
  263. n = 0;
  264. for(i=1;i<=16;i++) {
  265. n += bits_table[i];
  266. put_bits(p, 8, bits_table[i]);
  267. }
  268. for(i=0;i<n;i++)
  269. put_bits(p, 8, value_table[i]);
  270. return n + 17;
  271. }
  272. static void jpeg_table_header(MpegEncContext *s)
  273. {
  274. PutBitContext *p = &s->pb;
  275. int i, j, size;
  276. UINT8 *ptr;
  277. /* quant matrixes */
  278. put_marker(p, DQT);
  279. #ifdef TWOMATRIXES
  280. put_bits(p, 16, 2 + 2 * (1 + 64));
  281. #else
  282. put_bits(p, 16, 2 + 1 * (1 + 64));
  283. #endif
  284. put_bits(p, 4, 0); /* 8 bit precision */
  285. put_bits(p, 4, 0); /* table 0 */
  286. for(i=0;i<64;i++) {
  287. j = zigzag_direct[i];
  288. put_bits(p, 8, s->intra_matrix[j]);
  289. }
  290. #ifdef TWOMATRIXES
  291. put_bits(p, 4, 0); /* 8 bit precision */
  292. put_bits(p, 4, 1); /* table 1 */
  293. for(i=0;i<64;i++) {
  294. j = zigzag_direct[i];
  295. put_bits(p, 8, s->chroma_intra_matrix[j]);
  296. }
  297. #endif
  298. /* huffman table */
  299. put_marker(p, DHT);
  300. flush_put_bits(p);
  301. ptr = pbBufPtr(p);
  302. put_bits(p, 16, 0); /* patched later */
  303. size = 2;
  304. size += put_huffman_table(s, 0, 0, bits_dc_luminance, val_dc_luminance);
  305. size += put_huffman_table(s, 0, 1, bits_dc_chrominance, val_dc_chrominance);
  306. size += put_huffman_table(s, 1, 0, bits_ac_luminance, val_ac_luminance);
  307. size += put_huffman_table(s, 1, 1, bits_ac_chrominance, val_ac_chrominance);
  308. ptr[0] = size >> 8;
  309. ptr[1] = size;
  310. }
  311. static void jpeg_put_comments(MpegEncContext *s)
  312. {
  313. PutBitContext *p = &s->pb;
  314. int size;
  315. UINT8 *ptr;
  316. if (s->aspect_ratio_info)
  317. {
  318. /* JFIF header */
  319. put_marker(p, APP0);
  320. put_bits(p, 16, 16);
  321. put_string(p, "JFIF"); /* this puts the trailing zero-byte too */
  322. put_bits(p, 16, 0x0201); /* v 1.02 */
  323. put_bits(p, 8, 0); /* units type: 0 - aspect ratio */
  324. switch(s->aspect_ratio_info)
  325. {
  326. case FF_ASPECT_4_3_625:
  327. case FF_ASPECT_4_3_525:
  328. put_bits(p, 16, 4);
  329. put_bits(p, 16, 3);
  330. break;
  331. case FF_ASPECT_16_9_625:
  332. case FF_ASPECT_16_9_525:
  333. put_bits(p, 16, 16);
  334. put_bits(p, 16, 9);
  335. break;
  336. case FF_ASPECT_EXTENDED:
  337. put_bits(p, 16, s->aspected_width);
  338. put_bits(p, 16, s->aspected_height);
  339. break;
  340. case FF_ASPECT_SQUARE:
  341. default:
  342. put_bits(p, 16, 1); /* aspect: 1:1 */
  343. put_bits(p, 16, 1);
  344. break;
  345. }
  346. put_bits(p, 8, 0); /* thumbnail width */
  347. put_bits(p, 8, 0); /* thumbnail height */
  348. }
  349. /* comment */
  350. put_marker(p, COM);
  351. flush_put_bits(p);
  352. ptr = pbBufPtr(p);
  353. put_bits(p, 16, 0); /* patched later */
  354. #define MJPEG_VERSION "FFmpeg" LIBAVCODEC_VERSION "b" LIBAVCODEC_BUILD_STR
  355. put_string(p, MJPEG_VERSION);
  356. size = strlen(MJPEG_VERSION)+3;
  357. #undef MJPEG_VERSION
  358. ptr[0] = size >> 8;
  359. ptr[1] = size;
  360. }
  361. void mjpeg_picture_header(MpegEncContext *s)
  362. {
  363. put_marker(&s->pb, SOI);
  364. if (!s->mjpeg_data_only_frames)
  365. {
  366. jpeg_put_comments(s);
  367. if (s->mjpeg_write_tables) jpeg_table_header(s);
  368. put_marker(&s->pb, SOF0);
  369. put_bits(&s->pb, 16, 17);
  370. put_bits(&s->pb, 8, 8); /* 8 bits/component */
  371. put_bits(&s->pb, 16, s->height);
  372. put_bits(&s->pb, 16, s->width);
  373. put_bits(&s->pb, 8, 3); /* 3 components */
  374. /* Y component */
  375. put_bits(&s->pb, 8, 1); /* component number */
  376. put_bits(&s->pb, 4, s->mjpeg_hsample[0]); /* H factor */
  377. put_bits(&s->pb, 4, s->mjpeg_vsample[0]); /* V factor */
  378. put_bits(&s->pb, 8, 0); /* select matrix */
  379. /* Cb component */
  380. put_bits(&s->pb, 8, 2); /* component number */
  381. put_bits(&s->pb, 4, s->mjpeg_hsample[1]); /* H factor */
  382. put_bits(&s->pb, 4, s->mjpeg_vsample[1]); /* V factor */
  383. #ifdef TWOMATRIXES
  384. put_bits(&s->pb, 8, 1); /* select matrix */
  385. #else
  386. put_bits(&s->pb, 8, 0); /* select matrix */
  387. #endif
  388. /* Cr component */
  389. put_bits(&s->pb, 8, 3); /* component number */
  390. put_bits(&s->pb, 4, s->mjpeg_hsample[2]); /* H factor */
  391. put_bits(&s->pb, 4, s->mjpeg_vsample[2]); /* V factor */
  392. #ifdef TWOMATRIXES
  393. put_bits(&s->pb, 8, 1); /* select matrix */
  394. #else
  395. put_bits(&s->pb, 8, 0); /* select matrix */
  396. #endif
  397. }
  398. /* scan header */
  399. put_marker(&s->pb, SOS);
  400. put_bits(&s->pb, 16, 12); /* length */
  401. put_bits(&s->pb, 8, 3); /* 3 components */
  402. /* Y component */
  403. put_bits(&s->pb, 8, 1); /* index */
  404. put_bits(&s->pb, 4, 0); /* DC huffman table index */
  405. put_bits(&s->pb, 4, 0); /* AC huffman table index */
  406. /* Cb component */
  407. put_bits(&s->pb, 8, 2); /* index */
  408. put_bits(&s->pb, 4, 1); /* DC huffman table index */
  409. put_bits(&s->pb, 4, 1); /* AC huffman table index */
  410. /* Cr component */
  411. put_bits(&s->pb, 8, 3); /* index */
  412. put_bits(&s->pb, 4, 1); /* DC huffman table index */
  413. put_bits(&s->pb, 4, 1); /* AC huffman table index */
  414. put_bits(&s->pb, 8, 0); /* Ss (not used) */
  415. put_bits(&s->pb, 8, 63); /* Se (not used) */
  416. put_bits(&s->pb, 8, 0); /* Ah/Al (not used) */
  417. }
  418. void mjpeg_picture_trailer(MpegEncContext *s)
  419. {
  420. jflush_put_bits(&s->pb);
  421. put_marker(&s->pb, EOI);
  422. }
  423. static inline void mjpeg_encode_dc(MpegEncContext *s, int val,
  424. UINT8 *huff_size, UINT16 *huff_code)
  425. {
  426. int mant, nbits;
  427. if (val == 0) {
  428. jput_bits(&s->pb, huff_size[0], huff_code[0]);
  429. } else {
  430. mant = val;
  431. if (val < 0) {
  432. val = -val;
  433. mant--;
  434. }
  435. /* compute the log (XXX: optimize) */
  436. nbits = 0;
  437. while (val != 0) {
  438. val = val >> 1;
  439. nbits++;
  440. }
  441. jput_bits(&s->pb, huff_size[nbits], huff_code[nbits]);
  442. jput_bits(&s->pb, nbits, mant & ((1 << nbits) - 1));
  443. }
  444. }
  445. static void encode_block(MpegEncContext *s, DCTELEM *block, int n)
  446. {
  447. int mant, nbits, code, i, j;
  448. int component, dc, run, last_index, val;
  449. MJpegContext *m = s->mjpeg_ctx;
  450. UINT8 *huff_size_ac;
  451. UINT16 *huff_code_ac;
  452. /* DC coef */
  453. component = (n <= 3 ? 0 : n - 4 + 1);
  454. dc = block[0]; /* overflow is impossible */
  455. val = dc - s->last_dc[component];
  456. if (n < 4) {
  457. mjpeg_encode_dc(s, val, m->huff_size_dc_luminance, m->huff_code_dc_luminance);
  458. huff_size_ac = m->huff_size_ac_luminance;
  459. huff_code_ac = m->huff_code_ac_luminance;
  460. } else {
  461. mjpeg_encode_dc(s, val, m->huff_size_dc_chrominance, m->huff_code_dc_chrominance);
  462. huff_size_ac = m->huff_size_ac_chrominance;
  463. huff_code_ac = m->huff_code_ac_chrominance;
  464. }
  465. s->last_dc[component] = dc;
  466. /* AC coefs */
  467. run = 0;
  468. last_index = s->block_last_index[n];
  469. for(i=1;i<=last_index;i++) {
  470. j = zigzag_direct[i];
  471. val = block[j];
  472. if (val == 0) {
  473. run++;
  474. } else {
  475. while (run >= 16) {
  476. jput_bits(&s->pb, huff_size_ac[0xf0], huff_code_ac[0xf0]);
  477. run -= 16;
  478. }
  479. mant = val;
  480. if (val < 0) {
  481. val = -val;
  482. mant--;
  483. }
  484. /* compute the log (XXX: optimize) */
  485. nbits = 0;
  486. while (val != 0) {
  487. val = val >> 1;
  488. nbits++;
  489. }
  490. code = (run << 4) | nbits;
  491. jput_bits(&s->pb, huff_size_ac[code], huff_code_ac[code]);
  492. jput_bits(&s->pb, nbits, mant & ((1 << nbits) - 1));
  493. run = 0;
  494. }
  495. }
  496. /* output EOB only if not already 64 values */
  497. if (last_index < 63 || run != 0)
  498. jput_bits(&s->pb, huff_size_ac[0], huff_code_ac[0]);
  499. }
  500. void mjpeg_encode_mb(MpegEncContext *s,
  501. DCTELEM block[6][64])
  502. {
  503. int i;
  504. for(i=0;i<6;i++) {
  505. encode_block(s, block[i], i);
  506. }
  507. }
  508. /******************************************/
  509. /* decoding */
  510. /* compressed picture size */
  511. #define PICTURE_BUFFER_SIZE 100000
  512. #define MAX_COMPONENTS 4
  513. typedef struct MJpegDecodeContext {
  514. AVCodecContext *avctx;
  515. GetBitContext gb;
  516. UINT32 header_state;
  517. int start_code; /* current start code */
  518. UINT8 *buf_ptr;
  519. int buffer_size;
  520. int mpeg_enc_ctx_allocated; /* true if decoding context allocated */
  521. INT16 quant_matrixes[4][64];
  522. VLC vlcs[2][4];
  523. int org_width, org_height; /* size given at codec init */
  524. int first_picture; /* true if decoding first picture */
  525. int interlaced; /* true if interlaced */
  526. int bottom_field; /* true if bottom field */
  527. int width, height;
  528. int nb_components;
  529. int component_id[MAX_COMPONENTS];
  530. int h_count[MAX_COMPONENTS]; /* horizontal and vertical count for each component */
  531. int v_count[MAX_COMPONENTS];
  532. int h_max, v_max; /* maximum h and v counts */
  533. int quant_index[4]; /* quant table index for each component */
  534. int last_dc[MAX_COMPONENTS]; /* last DEQUANTIZED dc (XXX: am I right to do that ?) */
  535. UINT8 *current_picture[MAX_COMPONENTS]; /* picture structure */
  536. int linesize[MAX_COMPONENTS];
  537. DCTELEM block[64] __align8;
  538. UINT8 buffer[PICTURE_BUFFER_SIZE];
  539. int buggy_avid;
  540. int restart_interval;
  541. int restart_count;
  542. int interleaved_rows;
  543. } MJpegDecodeContext;
  544. #define SKIP_REMAINING(gb, len) { \
  545. dprintf("reamining %d bytes in marker\n", len); \
  546. if (len) while (--len) \
  547. skip_bits(gb, 8); \
  548. }
  549. static int mjpeg_decode_dht(MJpegDecodeContext *s, UINT8 *buf, int buf_size);
  550. static void build_vlc(VLC *vlc, const UINT8 *bits_table, const UINT8 *val_table,
  551. int nb_codes)
  552. {
  553. UINT8 huff_size[256];
  554. UINT16 huff_code[256];
  555. memset(huff_size, 0, sizeof(huff_size));
  556. build_huffman_codes(huff_size, huff_code, bits_table, val_table);
  557. init_vlc(vlc, 9, nb_codes, huff_size, 1, 1, huff_code, 2, 2);
  558. }
  559. static int mjpeg_decode_init(AVCodecContext *avctx)
  560. {
  561. MJpegDecodeContext *s = avctx->priv_data;
  562. s->avctx = avctx;
  563. s->header_state = 0;
  564. s->mpeg_enc_ctx_allocated = 0;
  565. s->buffer_size = PICTURE_BUFFER_SIZE - 1; /* minus 1 to take into
  566. account FF 00 case */
  567. s->start_code = -1;
  568. s->buf_ptr = s->buffer;
  569. s->first_picture = 1;
  570. s->org_width = avctx->width;
  571. s->org_height = avctx->height;
  572. build_vlc(&s->vlcs[0][0], bits_dc_luminance, val_dc_luminance, 12);
  573. build_vlc(&s->vlcs[0][1], bits_dc_chrominance, val_dc_chrominance, 12);
  574. build_vlc(&s->vlcs[1][0], bits_ac_luminance, val_ac_luminance, 251);
  575. build_vlc(&s->vlcs[1][1], bits_ac_chrominance, val_ac_chrominance, 251);
  576. if (avctx->flags & CODEC_FLAG_EXTERN_HUFF)
  577. {
  578. printf("mjpeg: using external huffman table\n");
  579. mjpeg_decode_dht(s, avctx->extradata, avctx->extradata_size);
  580. /* should check for error - but dunno */
  581. }
  582. return 0;
  583. }
  584. /* quantize tables */
  585. static int mjpeg_decode_dqt(MJpegDecodeContext *s,
  586. UINT8 *buf, int buf_size)
  587. {
  588. int len, index, i, j;
  589. init_get_bits(&s->gb, buf, buf_size);
  590. len = get_bits(&s->gb, 16) - 2;
  591. while (len >= 65) {
  592. /* only 8 bit precision handled */
  593. if (get_bits(&s->gb, 4) != 0)
  594. {
  595. dprintf("dqt: 16bit precision\n");
  596. return -1;
  597. }
  598. index = get_bits(&s->gb, 4);
  599. if (index >= 4)
  600. return -1;
  601. dprintf("index=%d\n", index);
  602. /* read quant table */
  603. for(i=0;i<64;i++) {
  604. j = zigzag_direct[i];
  605. s->quant_matrixes[index][j] = get_bits(&s->gb, 8);
  606. }
  607. len -= 65;
  608. }
  609. SKIP_REMAINING(&s->gb, len);
  610. return 0;
  611. }
  612. /* decode huffman tables and build VLC decoders */
  613. static int mjpeg_decode_dht(MJpegDecodeContext *s,
  614. UINT8 *buf, int buf_size)
  615. {
  616. int len, index, i, class, n, v, code_max;
  617. UINT8 bits_table[17];
  618. UINT8 val_table[256];
  619. init_get_bits(&s->gb, buf, buf_size);
  620. len = get_bits(&s->gb, 16);
  621. len -= 2;
  622. while (len > 0) {
  623. if (len < 17)
  624. return -1;
  625. class = get_bits(&s->gb, 4);
  626. if (class >= 2)
  627. return -1;
  628. index = get_bits(&s->gb, 4);
  629. if (index >= 4)
  630. return -1;
  631. n = 0;
  632. for(i=1;i<=16;i++) {
  633. bits_table[i] = get_bits(&s->gb, 8);
  634. n += bits_table[i];
  635. }
  636. len -= 17;
  637. if (len < n || n > 256)
  638. return -1;
  639. code_max = 0;
  640. for(i=0;i<n;i++) {
  641. v = get_bits(&s->gb, 8);
  642. if (v > code_max)
  643. code_max = v;
  644. val_table[i] = v;
  645. }
  646. len -= n;
  647. /* build VLC and flush previous vlc if present */
  648. free_vlc(&s->vlcs[class][index]);
  649. dprintf("class=%d index=%d nb_codes=%d\n",
  650. class, index, code_max + 1);
  651. build_vlc(&s->vlcs[class][index], bits_table, val_table, code_max + 1);
  652. }
  653. return 0;
  654. }
  655. static int mjpeg_decode_sof0(MJpegDecodeContext *s,
  656. UINT8 *buf, int buf_size)
  657. {
  658. int len, nb_components, i, width, height;
  659. init_get_bits(&s->gb, buf, buf_size);
  660. /* XXX: verify len field validity */
  661. len = get_bits(&s->gb, 16);
  662. /* only 8 bits/component accepted */
  663. if (get_bits(&s->gb, 8) != 8)
  664. return -1;
  665. height = get_bits(&s->gb, 16);
  666. width = get_bits(&s->gb, 16);
  667. dprintf("sof0: picture: %dx%d\n", width, height);
  668. nb_components = get_bits(&s->gb, 8);
  669. if (nb_components <= 0 ||
  670. nb_components > MAX_COMPONENTS)
  671. return -1;
  672. s->nb_components = nb_components;
  673. s->h_max = 1;
  674. s->v_max = 1;
  675. for(i=0;i<nb_components;i++) {
  676. /* component id */
  677. s->component_id[i] = get_bits(&s->gb, 8) - 1;
  678. s->h_count[i] = get_bits(&s->gb, 4);
  679. s->v_count[i] = get_bits(&s->gb, 4);
  680. /* compute hmax and vmax (only used in interleaved case) */
  681. if (s->h_count[i] > s->h_max)
  682. s->h_max = s->h_count[i];
  683. if (s->v_count[i] > s->v_max)
  684. s->v_max = s->v_count[i];
  685. s->quant_index[i] = get_bits(&s->gb, 8);
  686. if (s->quant_index[i] >= 4)
  687. return -1;
  688. dprintf("component %d %d:%d id: %d quant:%d\n", i, s->h_count[i],
  689. s->v_count[i], s->component_id[i], s->quant_index[i]);
  690. }
  691. /* if different size, realloc/alloc picture */
  692. /* XXX: also check h_count and v_count */
  693. if (width != s->width || height != s->height) {
  694. for(i=0;i<MAX_COMPONENTS;i++)
  695. av_freep(&s->current_picture[i]);
  696. s->width = width;
  697. s->height = height;
  698. /* test interlaced mode */
  699. if (s->first_picture &&
  700. s->org_height != 0 &&
  701. s->height < ((s->org_height * 3) / 4)) {
  702. s->interlaced = 1;
  703. s->bottom_field = 0;
  704. }
  705. for(i=0;i<nb_components;i++) {
  706. int w, h;
  707. w = (s->width + 8 * s->h_max - 1) / (8 * s->h_max);
  708. h = (s->height + 8 * s->v_max - 1) / (8 * s->v_max);
  709. w = w * 8 * s->h_count[i];
  710. h = h * 8 * s->v_count[i];
  711. if (s->interlaced)
  712. w *= 2;
  713. s->linesize[i] = w;
  714. /* memory test is done in mjpeg_decode_sos() */
  715. s->current_picture[i] = av_mallocz(w * h);
  716. }
  717. s->first_picture = 0;
  718. }
  719. if (len != (8+(3*nb_components)))
  720. {
  721. dprintf("decode_sof0: error, len(%d) mismatch\n", len);
  722. }
  723. return 0;
  724. }
  725. static inline int mjpeg_decode_dc(MJpegDecodeContext *s, int dc_index)
  726. {
  727. int code, diff;
  728. code = get_vlc(&s->gb, &s->vlcs[0][dc_index]);
  729. if (code < 0)
  730. {
  731. dprintf("mjpeg_decode_dc: bad vlc: %d:%d (%p)\n", 0, dc_index,
  732. &s->vlcs[0][dc_index]);
  733. return 0xffff;
  734. }
  735. if (code == 0) {
  736. diff = 0;
  737. } else {
  738. diff = get_bits(&s->gb, code);
  739. if ((diff & (1 << (code - 1))) == 0)
  740. diff = (-1 << code) | (diff + 1);
  741. }
  742. return diff;
  743. }
  744. /* decode block and dequantize */
  745. static int decode_block(MJpegDecodeContext *s, DCTELEM *block,
  746. int component, int dc_index, int ac_index, int quant_index)
  747. {
  748. int nbits, code, i, j, level;
  749. int run, val;
  750. VLC *ac_vlc;
  751. INT16 *quant_matrix;
  752. /* DC coef */
  753. val = mjpeg_decode_dc(s, dc_index);
  754. if (val == 0xffff) {
  755. dprintf("error dc\n");
  756. return -1;
  757. }
  758. quant_matrix = s->quant_matrixes[quant_index];
  759. val = val * quant_matrix[0] + s->last_dc[component];
  760. s->last_dc[component] = val;
  761. block[0] = val;
  762. /* AC coefs */
  763. ac_vlc = &s->vlcs[1][ac_index];
  764. i = 1;
  765. for(;;) {
  766. code = get_vlc(&s->gb, ac_vlc);
  767. if (code < 0) {
  768. dprintf("error ac\n");
  769. return -1;
  770. }
  771. /* EOB */
  772. if (code == 0)
  773. break;
  774. if (code == 0xf0) {
  775. i += 16;
  776. } else {
  777. run = code >> 4;
  778. nbits = code & 0xf;
  779. level = get_bits(&s->gb, nbits);
  780. if ((level & (1 << (nbits - 1))) == 0)
  781. level = (-1 << nbits) | (level + 1);
  782. i += run;
  783. if (i >= 64) {
  784. dprintf("error count: %d\n", i);
  785. return -1;
  786. }
  787. j = zigzag_direct[i];
  788. block[j] = level * quant_matrix[j];
  789. i++;
  790. if (i >= 64)
  791. break;
  792. }
  793. }
  794. return 0;
  795. }
  796. static int mjpeg_decode_sos(MJpegDecodeContext *s,
  797. UINT8 *buf, int buf_size)
  798. {
  799. int len, nb_components, i, j, n, h, v, ret;
  800. int mb_width, mb_height, mb_x, mb_y, vmax, hmax, index, id;
  801. int comp_index[4];
  802. int dc_index[4];
  803. int ac_index[4];
  804. int nb_blocks[4];
  805. int h_count[4];
  806. int v_count[4];
  807. init_get_bits(&s->gb, buf, buf_size);
  808. /* XXX: verify len field validity */
  809. len = get_bits(&s->gb, 16);
  810. nb_components = get_bits(&s->gb, 8);
  811. /* XXX: only interleaved scan accepted */
  812. if (nb_components != 3)
  813. {
  814. dprintf("decode_sos: components(%d) mismatch\n", nb_components);
  815. return -1;
  816. }
  817. vmax = 0;
  818. hmax = 0;
  819. for(i=0;i<nb_components;i++) {
  820. id = get_bits(&s->gb, 8) - 1;
  821. dprintf("component: %d\n", id);
  822. /* find component index */
  823. for(index=0;index<s->nb_components;index++)
  824. if (id == s->component_id[index])
  825. break;
  826. if (index == s->nb_components)
  827. {
  828. dprintf("decode_sos: index(%d) out of components\n", index);
  829. return -1;
  830. }
  831. comp_index[i] = index;
  832. nb_blocks[i] = s->h_count[index] * s->v_count[index];
  833. h_count[i] = s->h_count[index];
  834. v_count[i] = s->v_count[index];
  835. dc_index[i] = get_bits(&s->gb, 4);
  836. ac_index[i] = get_bits(&s->gb, 4);
  837. if (dc_index[i] < 0 || ac_index[i] < 0 ||
  838. dc_index[i] >= 4 || ac_index[i] >= 4)
  839. goto out_of_range;
  840. switch(s->start_code)
  841. {
  842. case SOF0:
  843. if (dc_index[i] > 1 || ac_index[i] > 1)
  844. goto out_of_range;
  845. break;
  846. case SOF1:
  847. case SOF2:
  848. if (dc_index[i] > 3 || ac_index[i] > 3)
  849. goto out_of_range;
  850. break;
  851. case SOF3:
  852. if (dc_index[i] > 3 || ac_index[i] != 0)
  853. goto out_of_range;
  854. break;
  855. }
  856. }
  857. skip_bits(&s->gb, 8); /* Ss */
  858. skip_bits(&s->gb, 8); /* Se */
  859. skip_bits(&s->gb, 8); /* Ah and Al (each are 4 bits) */
  860. for(i=0;i<nb_components;i++)
  861. s->last_dc[i] = 1024;
  862. if (nb_components > 1) {
  863. /* interleaved stream */
  864. mb_width = (s->width + s->h_max * 8 - 1) / (s->h_max * 8);
  865. mb_height = (s->height + s->v_max * 8 - 1) / (s->v_max * 8);
  866. } else {
  867. h = s->h_max / s->h_count[comp_index[0]];
  868. v = s->v_max / s->v_count[comp_index[0]];
  869. mb_width = (s->width + h * 8 - 1) / (h * 8);
  870. mb_height = (s->height + v * 8 - 1) / (v * 8);
  871. nb_blocks[0] = 1;
  872. h_count[0] = 1;
  873. v_count[0] = 1;
  874. }
  875. for(mb_y = 0; mb_y < mb_height; mb_y++) {
  876. for(mb_x = 0; mb_x < mb_width; mb_x++) {
  877. for(i=0;i<nb_components;i++) {
  878. UINT8 *ptr;
  879. int x, y, c;
  880. n = nb_blocks[i];
  881. c = comp_index[i];
  882. h = h_count[i];
  883. v = v_count[i];
  884. x = 0;
  885. y = 0;
  886. if (s->restart_interval && !s->restart_count)
  887. s->restart_count = s->restart_interval;
  888. for(j=0;j<n;j++) {
  889. memset(s->block, 0, sizeof(s->block));
  890. if (decode_block(s, s->block, i,
  891. dc_index[i], ac_index[i],
  892. s->quant_index[c]) < 0) {
  893. dprintf("error y=%d x=%d\n", mb_y, mb_x);
  894. ret = -1;
  895. goto the_end;
  896. }
  897. // dprintf("mb: %d %d processed\n", mb_y, mb_x);
  898. ptr = s->current_picture[c] +
  899. (s->linesize[c] * (v * mb_y + y) * 8) +
  900. (h * mb_x + x) * 8;
  901. if (s->interlaced && s->bottom_field)
  902. ptr += s->linesize[c] >> 1;
  903. ff_idct_put(ptr, s->linesize[c], s->block);
  904. if (++x == h) {
  905. x = 0;
  906. y++;
  907. }
  908. }
  909. }
  910. if (s->restart_interval && !--s->restart_count) {
  911. align_get_bits(&s->gb);
  912. skip_bits(&s->gb, 16); /* skip RSTn */
  913. for (j=0; j<nb_components; j++) /* reset dc */
  914. s->last_dc[j] = 1024;
  915. }
  916. }
  917. }
  918. ret = 0;
  919. the_end:
  920. emms_c();
  921. return ret;
  922. out_of_range:
  923. dprintf("decode_sos: ac/dc index out of range\n");
  924. return -1;
  925. }
  926. static int mjpeg_decode_dri(MJpegDecodeContext *s,
  927. UINT8 *buf, int buf_size)
  928. {
  929. init_get_bits(&s->gb, buf, buf_size);
  930. if (get_bits(&s->gb, 16) != 4)
  931. return -1;
  932. s->restart_interval = get_bits(&s->gb, 16);
  933. dprintf("restart interval: %d\n", s->restart_interval);
  934. return 0;
  935. }
  936. #define FOURCC(a,b,c,d) ((a << 24) | (b << 16) | (c << 8) | d)
  937. static int mjpeg_decode_app(MJpegDecodeContext *s,
  938. UINT8 *buf, int buf_size, int start_code)
  939. {
  940. int len, id;
  941. init_get_bits(&s->gb, buf, buf_size);
  942. /* XXX: verify len field validity */
  943. len = get_bits(&s->gb, 16);
  944. if (len < 5)
  945. return -1;
  946. id = (get_bits(&s->gb, 16) << 16) | get_bits(&s->gb, 16);
  947. len -= 6;
  948. /* buggy AVID, it puts EOI only at every 10th frame */
  949. /* also this fourcc is used by non-avid files too, it means
  950. interleaving, but it's always present in AVID files */
  951. if (id == FOURCC('A','V','I','1'))
  952. {
  953. /* structure:
  954. 4bytes AVI1
  955. 1bytes polarity
  956. 1bytes always zero
  957. 4bytes field_size
  958. 4bytes field_size_less_padding
  959. */
  960. s->buggy_avid = 1;
  961. if (s->first_picture)
  962. printf("mjpeg: workarounding buggy AVID\n");
  963. s->interleaved_rows = get_bits(&s->gb, 8);
  964. #if 0
  965. skip_bits(&s->gb, 8);
  966. skip_bits(&s->gb, 32);
  967. skip_bits(&s->gb, 32);
  968. len -= 10;
  969. #endif
  970. if (s->interleaved_rows)
  971. printf("mjpeg: interleaved rows: %d\n", s->interleaved_rows);
  972. goto out;
  973. }
  974. len -= 2;
  975. if (id == FOURCC('J','F','I','F'))
  976. {
  977. skip_bits(&s->gb, 8); /* the trailing zero-byte */
  978. printf("mjpeg: JFIF header found (version: %x.%x)\n",
  979. get_bits(&s->gb, 8), get_bits(&s->gb, 8));
  980. if (get_bits(&s->gb, 8) == 0)
  981. {
  982. s->avctx->aspect_ratio_info = FF_ASPECT_EXTENDED;
  983. s->avctx->aspected_width = get_bits(&s->gb, 16);
  984. s->avctx->aspected_height = get_bits(&s->gb, 16);
  985. }
  986. else
  987. {
  988. skip_bits(&s->gb, 16);
  989. skip_bits(&s->gb, 16);
  990. }
  991. skip_bits(&s->gb, 8);
  992. skip_bits(&s->gb, 8);
  993. goto out;
  994. }
  995. /* Apple MJPEG-A */
  996. if ((start_code == APP1) && (len > (0x28 - 8)))
  997. {
  998. id = (get_bits(&s->gb, 16) << 16) | get_bits(&s->gb, 16);
  999. len -= 4;
  1000. if (id == FOURCC('m','j','p','g')) /* Apple MJPEG-A */
  1001. {
  1002. #if 0
  1003. skip_bits(&s->gb, 32); /* field size */
  1004. skip_bits(&s->gb, 32); /* pad field size */
  1005. skip_bits(&s->gb, 32); /* next off */
  1006. skip_bits(&s->gb, 32); /* quant off */
  1007. skip_bits(&s->gb, 32); /* huff off */
  1008. skip_bits(&s->gb, 32); /* image off */
  1009. skip_bits(&s->gb, 32); /* scan off */
  1010. skip_bits(&s->gb, 32); /* data off */
  1011. #endif
  1012. if (s->first_picture)
  1013. printf("mjpeg: Apple MJPEG-A header found\n");
  1014. }
  1015. }
  1016. out:
  1017. /* should check for further values.. */
  1018. SKIP_REMAINING(&s->gb, len);
  1019. return 0;
  1020. }
  1021. #undef FOURCC
  1022. static int mjpeg_decode_com(MJpegDecodeContext *s,
  1023. UINT8 *buf, int buf_size)
  1024. {
  1025. int len, i;
  1026. UINT8 *cbuf;
  1027. init_get_bits(&s->gb, buf, buf_size);
  1028. /* XXX: verify len field validity */
  1029. len = get_bits(&s->gb, 16)-2;
  1030. cbuf = av_malloc(len+1);
  1031. for (i = 0; i < len; i++)
  1032. cbuf[i] = get_bits(&s->gb, 8);
  1033. if (cbuf[i-1] == '\n')
  1034. cbuf[i-1] = 0;
  1035. else
  1036. cbuf[i] = 0;
  1037. printf("mjpeg comment: '%s'\n", cbuf);
  1038. /* buggy avid, it puts EOI only at every 10th frame */
  1039. if (!strcmp(cbuf, "AVID"))
  1040. {
  1041. s->buggy_avid = 1;
  1042. if (s->first_picture)
  1043. printf("mjpeg: workarounding buggy AVID\n");
  1044. }
  1045. av_free(cbuf);
  1046. return 0;
  1047. }
  1048. /* return the 8 bit start code value and update the search
  1049. state. Return -1 if no start code found */
  1050. static int find_marker(UINT8 **pbuf_ptr, UINT8 *buf_end,
  1051. UINT32 *header_state)
  1052. {
  1053. UINT8 *buf_ptr;
  1054. unsigned int state, v;
  1055. int val;
  1056. state = *header_state;
  1057. buf_ptr = *pbuf_ptr;
  1058. retry:
  1059. if (state) {
  1060. /* get marker */
  1061. found:
  1062. if (buf_ptr < buf_end) {
  1063. val = *buf_ptr++;
  1064. state = 0;
  1065. if ((val >= RST0) && (val <= RST7))
  1066. goto retry;
  1067. } else {
  1068. val = -1;
  1069. }
  1070. } else {
  1071. while (buf_ptr < buf_end) {
  1072. v = *buf_ptr++;
  1073. if (v == 0xff) {
  1074. state = 1;
  1075. goto found;
  1076. }
  1077. }
  1078. val = -1;
  1079. }
  1080. *pbuf_ptr = buf_ptr;
  1081. *header_state = state;
  1082. return val;
  1083. }
  1084. static int mjpeg_decode_frame(AVCodecContext *avctx,
  1085. void *data, int *data_size,
  1086. UINT8 *buf, int buf_size)
  1087. {
  1088. MJpegDecodeContext *s = avctx->priv_data;
  1089. UINT8 *buf_end, *buf_ptr, *buf_start;
  1090. int len, code, input_size, i;
  1091. AVPicture *picture = data;
  1092. unsigned int start_code;
  1093. *data_size = 0;
  1094. /* no supplementary picture */
  1095. if (buf_size == 0)
  1096. return 0;
  1097. buf_ptr = buf;
  1098. buf_end = buf + buf_size;
  1099. while (buf_ptr < buf_end) {
  1100. buf_start = buf_ptr;
  1101. /* find start next marker */
  1102. code = find_marker(&buf_ptr, buf_end, &s->header_state);
  1103. /* copy to buffer */
  1104. len = buf_ptr - buf_start;
  1105. if (len + (s->buf_ptr - s->buffer) > s->buffer_size) {
  1106. /* data too big : flush */
  1107. s->buf_ptr = s->buffer;
  1108. if (code > 0)
  1109. s->start_code = code;
  1110. } else {
  1111. memcpy(s->buf_ptr, buf_start, len);
  1112. s->buf_ptr += len;
  1113. if (code < 0) {
  1114. /* nothing to do: wait next marker */
  1115. } else if (code == 0 || code == 0xff) {
  1116. /* if we got FF 00, we copy FF to the stream to unescape FF 00 */
  1117. /* valid marker code is between 00 and ff - alex */
  1118. s->buf_ptr--;
  1119. } else {
  1120. /* prepare data for next start code */
  1121. input_size = s->buf_ptr - s->buffer;
  1122. start_code = s->start_code;
  1123. s->buf_ptr = s->buffer;
  1124. s->start_code = code;
  1125. dprintf("marker=%x\n", start_code);
  1126. switch(start_code) {
  1127. case SOI:
  1128. s->restart_interval = 0;
  1129. /* nothing to do on SOI */
  1130. break;
  1131. case DQT:
  1132. mjpeg_decode_dqt(s, s->buffer, input_size);
  1133. break;
  1134. case DHT:
  1135. mjpeg_decode_dht(s, s->buffer, input_size);
  1136. break;
  1137. case SOF0:
  1138. mjpeg_decode_sof0(s, s->buffer, input_size);
  1139. break;
  1140. case SOS:
  1141. mjpeg_decode_sos(s, s->buffer, input_size);
  1142. if (s->start_code == EOI || s->buggy_avid || s->restart_interval) {
  1143. int l;
  1144. if (s->interlaced) {
  1145. s->bottom_field ^= 1;
  1146. /* if not bottom field, do not output image yet */
  1147. if (s->bottom_field)
  1148. goto not_the_end;
  1149. }
  1150. for(i=0;i<3;i++) {
  1151. picture->data[i] = s->current_picture[i];
  1152. l = s->linesize[i];
  1153. if (s->interlaced)
  1154. l >>= 1;
  1155. picture->linesize[i] = l;
  1156. }
  1157. *data_size = sizeof(AVPicture);
  1158. avctx->height = s->height;
  1159. if (s->interlaced)
  1160. avctx->height *= 2;
  1161. avctx->width = s->width;
  1162. /* XXX: not complete test ! */
  1163. switch((s->h_count[0] << 4) | s->v_count[0]) {
  1164. case 0x11:
  1165. avctx->pix_fmt = PIX_FMT_YUV444P;
  1166. break;
  1167. case 0x21:
  1168. avctx->pix_fmt = PIX_FMT_YUV422P;
  1169. break;
  1170. default:
  1171. case 0x22:
  1172. avctx->pix_fmt = PIX_FMT_YUV420P;
  1173. break;
  1174. }
  1175. /* dummy quality */
  1176. /* XXX: infer it with matrix */
  1177. avctx->quality = 3;
  1178. goto the_end;
  1179. }
  1180. break;
  1181. case DRI:
  1182. mjpeg_decode_dri(s, s->buffer, input_size);
  1183. break;
  1184. case SOF1:
  1185. case SOF2:
  1186. case SOF3:
  1187. case SOF5:
  1188. case SOF6:
  1189. case SOF7:
  1190. case SOF9:
  1191. case SOF10:
  1192. case SOF11:
  1193. case SOF13:
  1194. case SOF14:
  1195. case SOF15:
  1196. case JPG:
  1197. printf("mjpeg: unsupported coding type (%x)\n", start_code);
  1198. return -1;
  1199. }
  1200. #if 1
  1201. if (start_code >= 0xd0 && start_code <= 0xd7) {
  1202. dprintf("restart marker: %d\n", start_code&0x0f);
  1203. } else if (s->first_picture) {
  1204. /* APP fields */
  1205. if (start_code >= 0xe0 && start_code <= 0xef)
  1206. mjpeg_decode_app(s, s->buffer, input_size, start_code);
  1207. /* Comment */
  1208. else if (start_code == COM)
  1209. mjpeg_decode_com(s, s->buffer, input_size);
  1210. }
  1211. #endif
  1212. }
  1213. }
  1214. not_the_end:
  1215. ;
  1216. }
  1217. the_end:
  1218. return buf_ptr - buf;
  1219. }
  1220. static int mjpeg_decode_end(AVCodecContext *avctx)
  1221. {
  1222. MJpegDecodeContext *s = avctx->priv_data;
  1223. int i, j;
  1224. for(i=0;i<MAX_COMPONENTS;i++)
  1225. av_free(s->current_picture[i]);
  1226. for(i=0;i<2;i++) {
  1227. for(j=0;j<4;j++)
  1228. free_vlc(&s->vlcs[i][j]);
  1229. }
  1230. return 0;
  1231. }
  1232. AVCodec mjpeg_decoder = {
  1233. "mjpeg",
  1234. CODEC_TYPE_VIDEO,
  1235. CODEC_ID_MJPEG,
  1236. sizeof(MJpegDecodeContext),
  1237. mjpeg_decode_init,
  1238. NULL,
  1239. mjpeg_decode_end,
  1240. mjpeg_decode_frame,
  1241. 0,
  1242. NULL
  1243. };