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.

357 lines
12KB

  1. /*
  2. * Quicktime Animation (RLE) Video Encoder
  3. * Copyright (C) 2007 Clemens Fruhwirth
  4. * Copyright (C) 2007 Alexis Ballier
  5. *
  6. * This file is based on flashsvenc.c.
  7. *
  8. * This file is part of FFmpeg.
  9. *
  10. * FFmpeg is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU Lesser General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2.1 of the License, or (at your option) any later version.
  14. *
  15. * FFmpeg is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * Lesser General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU Lesser General Public
  21. * License along with FFmpeg; if not, write to the Free Software
  22. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  23. */
  24. #include "libavutil/imgutils.h"
  25. #include "avcodec.h"
  26. #include "bytestream.h"
  27. /** Maximum RLE code for bulk copy */
  28. #define MAX_RLE_BULK 127
  29. /** Maximum RLE code for repeat */
  30. #define MAX_RLE_REPEAT 128
  31. /** Maximum RLE code for skip */
  32. #define MAX_RLE_SKIP 254
  33. typedef struct QtrleEncContext {
  34. AVCodecContext *avctx;
  35. AVFrame frame;
  36. int pixel_size;
  37. AVPicture previous_frame;
  38. unsigned int max_buf_size;
  39. int logical_width;
  40. /**
  41. * This array will contain at ith position the value of the best RLE code
  42. * if the line started at pixel i
  43. * There can be 3 values :
  44. * skip (0) : skip as much as possible pixels because they are equal to the
  45. * previous frame ones
  46. * repeat (<-1) : repeat that pixel -rle_code times, still as much as
  47. * possible
  48. * copy (>0) : copy the raw next rle_code pixels */
  49. signed char *rlecode_table;
  50. /**
  51. * This array will contain the length of the best rle encoding of the line
  52. * starting at ith pixel */
  53. int *length_table;
  54. /**
  55. * Will contain at ith position the number of consecutive pixels equal to the previous
  56. * frame starting from pixel i */
  57. uint8_t* skip_table;
  58. } QtrleEncContext;
  59. static av_cold int qtrle_encode_init(AVCodecContext *avctx)
  60. {
  61. QtrleEncContext *s = avctx->priv_data;
  62. if (av_image_check_size(avctx->width, avctx->height, 0, avctx) < 0) {
  63. return -1;
  64. }
  65. s->avctx=avctx;
  66. s->logical_width=avctx->width;
  67. switch (avctx->pix_fmt) {
  68. case PIX_FMT_GRAY8:
  69. s->logical_width = avctx->width / 4;
  70. s->pixel_size = 4;
  71. break;
  72. case PIX_FMT_RGB555BE:
  73. s->pixel_size = 2;
  74. break;
  75. case PIX_FMT_RGB24:
  76. s->pixel_size = 3;
  77. break;
  78. case PIX_FMT_ARGB:
  79. s->pixel_size = 4;
  80. break;
  81. default:
  82. av_log(avctx, AV_LOG_ERROR, "Unsupported colorspace.\n");
  83. break;
  84. }
  85. avctx->bits_per_coded_sample = avctx->pix_fmt == PIX_FMT_GRAY8 ? 40 : s->pixel_size*8;
  86. s->rlecode_table = av_mallocz(s->logical_width);
  87. s->skip_table = av_mallocz(s->logical_width);
  88. s->length_table = av_mallocz((s->logical_width + 1)*sizeof(int));
  89. if (!s->skip_table || !s->length_table || !s->rlecode_table) {
  90. av_log(avctx, AV_LOG_ERROR, "Error allocating memory.\n");
  91. return -1;
  92. }
  93. if (avpicture_alloc(&s->previous_frame, avctx->pix_fmt, avctx->width, avctx->height) < 0) {
  94. av_log(avctx, AV_LOG_ERROR, "Error allocating picture\n");
  95. return -1;
  96. }
  97. s->max_buf_size = s->logical_width*s->avctx->height*s->pixel_size /* image base material */
  98. + 15 /* header + footer */
  99. + s->avctx->height*2 /* skip code+rle end */
  100. + s->logical_width/MAX_RLE_BULK + 1 /* rle codes */;
  101. avctx->coded_frame = &s->frame;
  102. return 0;
  103. }
  104. /**
  105. * Compute the best RLE sequence for a line
  106. */
  107. static void qtrle_encode_line(QtrleEncContext *s, AVFrame *p, int line, uint8_t **buf)
  108. {
  109. int width=s->logical_width;
  110. int i;
  111. signed char rlecode;
  112. /* We will use it to compute the best bulk copy sequence */
  113. unsigned int bulkcount;
  114. /* This will be the number of pixels equal to the preivous frame one's
  115. * starting from the ith pixel */
  116. unsigned int skipcount;
  117. /* This will be the number of consecutive equal pixels in the current
  118. * frame, starting from the ith one also */
  119. unsigned int av_uninit(repeatcount);
  120. /* The cost of the three different possibilities */
  121. int total_bulk_cost;
  122. int total_skip_cost;
  123. int total_repeat_cost;
  124. int temp_cost;
  125. int j;
  126. uint8_t *this_line = p-> data[0] + line*p-> linesize[0] +
  127. (width - 1)*s->pixel_size;
  128. uint8_t *prev_line = s->previous_frame.data[0] + line*s->previous_frame.linesize[0] +
  129. (width - 1)*s->pixel_size;
  130. s->length_table[width] = 0;
  131. skipcount = 0;
  132. for (i = width - 1; i >= 0; i--) {
  133. if (!s->frame.key_frame && !memcmp(this_line, prev_line, s->pixel_size))
  134. skipcount = FFMIN(skipcount + 1, MAX_RLE_SKIP);
  135. else
  136. skipcount = 0;
  137. total_skip_cost = s->length_table[i + skipcount] + 2;
  138. s->skip_table[i] = skipcount;
  139. if (i < width - 1 && !memcmp(this_line, this_line + s->pixel_size, s->pixel_size))
  140. repeatcount = FFMIN(repeatcount + 1, MAX_RLE_REPEAT);
  141. else
  142. repeatcount = 1;
  143. total_repeat_cost = s->length_table[i + repeatcount] + 1 + s->pixel_size;
  144. /* skip code is free for the first pixel, it costs one byte for repeat and bulk copy
  145. * so let's make it aware */
  146. if (i == 0) {
  147. total_skip_cost--;
  148. total_repeat_cost++;
  149. }
  150. if (repeatcount > 1 && (skipcount == 0 || total_repeat_cost < total_skip_cost)) {
  151. /* repeat is the best */
  152. s->length_table[i] = total_repeat_cost;
  153. s->rlecode_table[i] = -repeatcount;
  154. }
  155. else if (skipcount > 0) {
  156. /* skip is the best choice here */
  157. s->length_table[i] = total_skip_cost;
  158. s->rlecode_table[i] = 0;
  159. }
  160. else {
  161. /* We cannot do neither skip nor repeat
  162. * thus we search for the best bulk copy to do */
  163. int limit = FFMIN(width - i, MAX_RLE_BULK);
  164. temp_cost = 1 + s->pixel_size + !i;
  165. total_bulk_cost = INT_MAX;
  166. for (j = 1; j <= limit; j++) {
  167. if (s->length_table[i + j] + temp_cost < total_bulk_cost) {
  168. /* We have found a better bulk copy ... */
  169. total_bulk_cost = s->length_table[i + j] + temp_cost;
  170. bulkcount = j;
  171. }
  172. temp_cost += s->pixel_size;
  173. }
  174. s->length_table[i] = total_bulk_cost;
  175. s->rlecode_table[i] = bulkcount;
  176. }
  177. this_line -= s->pixel_size;
  178. prev_line -= s->pixel_size;
  179. }
  180. /* Good ! Now we have the best sequence for this line, let's ouput it */
  181. /* We do a special case for the first pixel so that we avoid testing it in
  182. * the whole loop */
  183. i=0;
  184. this_line = p-> data[0] + line*p->linesize[0];
  185. if (s->rlecode_table[0] == 0) {
  186. bytestream_put_byte(buf, s->skip_table[0] + 1);
  187. i += s->skip_table[0];
  188. }
  189. else bytestream_put_byte(buf, 1);
  190. while (i < width) {
  191. rlecode = s->rlecode_table[i];
  192. bytestream_put_byte(buf, rlecode);
  193. if (rlecode == 0) {
  194. /* Write a skip sequence */
  195. bytestream_put_byte(buf, s->skip_table[i] + 1);
  196. i += s->skip_table[i];
  197. }
  198. else if (rlecode > 0) {
  199. /* bulk copy */
  200. if (s->avctx->pix_fmt == PIX_FMT_GRAY8) {
  201. int j;
  202. // QT grayscale colorspace has 0=white and 255=black, we will
  203. // ignore the palette that is included in the AVFrame because
  204. // PIX_FMT_GRAY8 has defined color mapping
  205. for (j = 0; j < rlecode*s->pixel_size; ++j)
  206. bytestream_put_byte(buf, *(this_line + i*s->pixel_size + j) ^ 0xff);
  207. } else {
  208. bytestream_put_buffer(buf, this_line + i*s->pixel_size, rlecode*s->pixel_size);
  209. }
  210. i += rlecode;
  211. }
  212. else {
  213. /* repeat the bits */
  214. if (s->avctx->pix_fmt == PIX_FMT_GRAY8) {
  215. int j;
  216. // QT grayscale colorspace has 0=white and 255=black, ...
  217. for (j = 0; j < s->pixel_size; ++j)
  218. bytestream_put_byte(buf, *(this_line + i*s->pixel_size + j) ^ 0xff);
  219. } else {
  220. bytestream_put_buffer(buf, this_line + i*s->pixel_size, s->pixel_size);
  221. }
  222. i -= rlecode;
  223. }
  224. }
  225. bytestream_put_byte(buf, -1); // end RLE line
  226. }
  227. /** Encode frame including header */
  228. static int encode_frame(QtrleEncContext *s, AVFrame *p, uint8_t *buf)
  229. {
  230. int i;
  231. int start_line = 0;
  232. int end_line = s->avctx->height;
  233. uint8_t *orig_buf = buf;
  234. if (!s->frame.key_frame) {
  235. unsigned line_size = s->logical_width * s->pixel_size;
  236. for (start_line = 0; start_line < s->avctx->height; start_line++)
  237. if (memcmp(p->data[0] + start_line*p->linesize[0],
  238. s->previous_frame.data[0] + start_line*s->previous_frame.linesize[0],
  239. line_size))
  240. break;
  241. for (end_line=s->avctx->height; end_line > start_line; end_line--)
  242. if (memcmp(p->data[0] + (end_line - 1)*p->linesize[0],
  243. s->previous_frame.data[0] + (end_line - 1)*s->previous_frame.linesize[0],
  244. line_size))
  245. break;
  246. }
  247. bytestream_put_be32(&buf, 0); // CHUNK SIZE, patched later
  248. if ((start_line == 0 && end_line == s->avctx->height) || start_line == s->avctx->height)
  249. bytestream_put_be16(&buf, 0); // header
  250. else {
  251. bytestream_put_be16(&buf, 8); // header
  252. bytestream_put_be16(&buf, start_line); // starting line
  253. bytestream_put_be16(&buf, 0); // unknown
  254. bytestream_put_be16(&buf, end_line - start_line); // lines to update
  255. bytestream_put_be16(&buf, 0); // unknown
  256. }
  257. for (i = start_line; i < end_line; i++)
  258. qtrle_encode_line(s, p, i, &buf);
  259. bytestream_put_byte(&buf, 0); // zero skip code = frame finished
  260. AV_WB32(orig_buf, buf - orig_buf); // patch the chunk size
  261. return buf - orig_buf;
  262. }
  263. static int qtrle_encode_frame(AVCodecContext *avctx, uint8_t *buf, int buf_size, void *data)
  264. {
  265. QtrleEncContext * const s = avctx->priv_data;
  266. AVFrame *pict = data;
  267. AVFrame * const p = &s->frame;
  268. int chunksize;
  269. *p = *pict;
  270. if (buf_size < s->max_buf_size) {
  271. /* Upper bound check for compressed data */
  272. av_log(avctx, AV_LOG_ERROR, "buf_size %d < %d\n", buf_size, s->max_buf_size);
  273. return -1;
  274. }
  275. if (avctx->gop_size == 0 || (s->avctx->frame_number % avctx->gop_size) == 0) {
  276. /* I-Frame */
  277. p->pict_type = AV_PICTURE_TYPE_I;
  278. p->key_frame = 1;
  279. } else {
  280. /* P-Frame */
  281. p->pict_type = AV_PICTURE_TYPE_P;
  282. p->key_frame = 0;
  283. }
  284. chunksize = encode_frame(s, pict, buf);
  285. /* save the current frame */
  286. av_picture_copy(&s->previous_frame, (AVPicture *)p, avctx->pix_fmt, avctx->width, avctx->height);
  287. return chunksize;
  288. }
  289. static av_cold int qtrle_encode_end(AVCodecContext *avctx)
  290. {
  291. QtrleEncContext *s = avctx->priv_data;
  292. avpicture_free(&s->previous_frame);
  293. av_free(s->rlecode_table);
  294. av_free(s->length_table);
  295. av_free(s->skip_table);
  296. return 0;
  297. }
  298. AVCodec ff_qtrle_encoder = {
  299. .name = "qtrle",
  300. .type = AVMEDIA_TYPE_VIDEO,
  301. .id = CODEC_ID_QTRLE,
  302. .priv_data_size = sizeof(QtrleEncContext),
  303. .init = qtrle_encode_init,
  304. .encode = qtrle_encode_frame,
  305. .close = qtrle_encode_end,
  306. .pix_fmts = (const enum PixelFormat[]){PIX_FMT_RGB24, PIX_FMT_RGB555BE, PIX_FMT_ARGB, PIX_FMT_GRAY8, PIX_FMT_NONE},
  307. .long_name = NULL_IF_CONFIG_SMALL("QuickTime Animation (RLE) video"),
  308. };