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.

1545 lines
50KB

  1. /*
  2. * WebP (.webp) image decoder
  3. * Copyright (c) 2013 Aneesh Dogra <aneesh@sugarlabs.org>
  4. * Copyright (c) 2013 Justin Ruggles <justin.ruggles@gmail.com>
  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. * @file
  24. * WebP image decoder
  25. *
  26. * @author Aneesh Dogra <aneesh@sugarlabs.org>
  27. * Container and Lossy decoding
  28. *
  29. * @author Justin Ruggles <justin.ruggles@gmail.com>
  30. * Lossless decoder
  31. * Compressed alpha for lossy
  32. *
  33. * @author James Almer <jamrial@gmail.com>
  34. * Exif metadata
  35. *
  36. * Unimplemented:
  37. * - Animation
  38. * - ICC profile
  39. * - XMP metadata
  40. */
  41. #define BITSTREAM_READER_LE
  42. #include "libavutil/imgutils.h"
  43. #include "avcodec.h"
  44. #include "bytestream.h"
  45. #include "exif.h"
  46. #include "internal.h"
  47. #include "get_bits.h"
  48. #include "thread.h"
  49. #include "vp8.h"
  50. #define VP8X_FLAG_ANIMATION 0x02
  51. #define VP8X_FLAG_XMP_METADATA 0x04
  52. #define VP8X_FLAG_EXIF_METADATA 0x08
  53. #define VP8X_FLAG_ALPHA 0x10
  54. #define VP8X_FLAG_ICC 0x20
  55. #define MAX_PALETTE_SIZE 256
  56. #define MAX_CACHE_BITS 11
  57. #define NUM_CODE_LENGTH_CODES 19
  58. #define HUFFMAN_CODES_PER_META_CODE 5
  59. #define NUM_LITERAL_CODES 256
  60. #define NUM_LENGTH_CODES 24
  61. #define NUM_DISTANCE_CODES 40
  62. #define NUM_SHORT_DISTANCES 120
  63. #define MAX_HUFFMAN_CODE_LENGTH 15
  64. static const uint16_t alphabet_sizes[HUFFMAN_CODES_PER_META_CODE] = {
  65. NUM_LITERAL_CODES + NUM_LENGTH_CODES,
  66. NUM_LITERAL_CODES, NUM_LITERAL_CODES, NUM_LITERAL_CODES,
  67. NUM_DISTANCE_CODES
  68. };
  69. static const uint8_t code_length_code_order[NUM_CODE_LENGTH_CODES] = {
  70. 17, 18, 0, 1, 2, 3, 4, 5, 16, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
  71. };
  72. static const int8_t lz77_distance_offsets[NUM_SHORT_DISTANCES][2] = {
  73. { 0, 1 }, { 1, 0 }, { 1, 1 }, { -1, 1 }, { 0, 2 }, { 2, 0 }, { 1, 2 }, { -1, 2 },
  74. { 2, 1 }, { -2, 1 }, { 2, 2 }, { -2, 2 }, { 0, 3 }, { 3, 0 }, { 1, 3 }, { -1, 3 },
  75. { 3, 1 }, { -3, 1 }, { 2, 3 }, { -2, 3 }, { 3, 2 }, { -3, 2 }, { 0, 4 }, { 4, 0 },
  76. { 1, 4 }, { -1, 4 }, { 4, 1 }, { -4, 1 }, { 3, 3 }, { -3, 3 }, { 2, 4 }, { -2, 4 },
  77. { 4, 2 }, { -4, 2 }, { 0, 5 }, { 3, 4 }, { -3, 4 }, { 4, 3 }, { -4, 3 }, { 5, 0 },
  78. { 1, 5 }, { -1, 5 }, { 5, 1 }, { -5, 1 }, { 2, 5 }, { -2, 5 }, { 5, 2 }, { -5, 2 },
  79. { 4, 4 }, { -4, 4 }, { 3, 5 }, { -3, 5 }, { 5, 3 }, { -5, 3 }, { 0, 6 }, { 6, 0 },
  80. { 1, 6 }, { -1, 6 }, { 6, 1 }, { -6, 1 }, { 2, 6 }, { -2, 6 }, { 6, 2 }, { -6, 2 },
  81. { 4, 5 }, { -4, 5 }, { 5, 4 }, { -5, 4 }, { 3, 6 }, { -3, 6 }, { 6, 3 }, { -6, 3 },
  82. { 0, 7 }, { 7, 0 }, { 1, 7 }, { -1, 7 }, { 5, 5 }, { -5, 5 }, { 7, 1 }, { -7, 1 },
  83. { 4, 6 }, { -4, 6 }, { 6, 4 }, { -6, 4 }, { 2, 7 }, { -2, 7 }, { 7, 2 }, { -7, 2 },
  84. { 3, 7 }, { -3, 7 }, { 7, 3 }, { -7, 3 }, { 5, 6 }, { -5, 6 }, { 6, 5 }, { -6, 5 },
  85. { 8, 0 }, { 4, 7 }, { -4, 7 }, { 7, 4 }, { -7, 4 }, { 8, 1 }, { 8, 2 }, { 6, 6 },
  86. { -6, 6 }, { 8, 3 }, { 5, 7 }, { -5, 7 }, { 7, 5 }, { -7, 5 }, { 8, 4 }, { 6, 7 },
  87. { -6, 7 }, { 7, 6 }, { -7, 6 }, { 8, 5 }, { 7, 7 }, { -7, 7 }, { 8, 6 }, { 8, 7 }
  88. };
  89. enum AlphaCompression {
  90. ALPHA_COMPRESSION_NONE,
  91. ALPHA_COMPRESSION_VP8L,
  92. };
  93. enum AlphaFilter {
  94. ALPHA_FILTER_NONE,
  95. ALPHA_FILTER_HORIZONTAL,
  96. ALPHA_FILTER_VERTICAL,
  97. ALPHA_FILTER_GRADIENT,
  98. };
  99. enum TransformType {
  100. PREDICTOR_TRANSFORM = 0,
  101. COLOR_TRANSFORM = 1,
  102. SUBTRACT_GREEN = 2,
  103. COLOR_INDEXING_TRANSFORM = 3,
  104. };
  105. enum PredictionMode {
  106. PRED_MODE_BLACK,
  107. PRED_MODE_L,
  108. PRED_MODE_T,
  109. PRED_MODE_TR,
  110. PRED_MODE_TL,
  111. PRED_MODE_AVG_T_AVG_L_TR,
  112. PRED_MODE_AVG_L_TL,
  113. PRED_MODE_AVG_L_T,
  114. PRED_MODE_AVG_TL_T,
  115. PRED_MODE_AVG_T_TR,
  116. PRED_MODE_AVG_AVG_L_TL_AVG_T_TR,
  117. PRED_MODE_SELECT,
  118. PRED_MODE_ADD_SUBTRACT_FULL,
  119. PRED_MODE_ADD_SUBTRACT_HALF,
  120. };
  121. enum HuffmanIndex {
  122. HUFF_IDX_GREEN = 0,
  123. HUFF_IDX_RED = 1,
  124. HUFF_IDX_BLUE = 2,
  125. HUFF_IDX_ALPHA = 3,
  126. HUFF_IDX_DIST = 4
  127. };
  128. /* The structure of WebP lossless is an optional series of transformation data,
  129. * followed by the primary image. The primary image also optionally contains
  130. * an entropy group mapping if there are multiple entropy groups. There is a
  131. * basic image type called an "entropy coded image" that is used for all of
  132. * these. The type of each entropy coded image is referred to by the
  133. * specification as its role. */
  134. enum ImageRole {
  135. /* Primary Image: Stores the actual pixels of the image. */
  136. IMAGE_ROLE_ARGB,
  137. /* Entropy Image: Defines which Huffman group to use for different areas of
  138. * the primary image. */
  139. IMAGE_ROLE_ENTROPY,
  140. /* Predictors: Defines which predictor type to use for different areas of
  141. * the primary image. */
  142. IMAGE_ROLE_PREDICTOR,
  143. /* Color Transform Data: Defines the color transformation for different
  144. * areas of the primary image. */
  145. IMAGE_ROLE_COLOR_TRANSFORM,
  146. /* Color Index: Stored as an image of height == 1. */
  147. IMAGE_ROLE_COLOR_INDEXING,
  148. IMAGE_ROLE_NB,
  149. };
  150. typedef struct HuffReader {
  151. VLC vlc; /* Huffman decoder context */
  152. int simple; /* whether to use simple mode */
  153. int nb_symbols; /* number of coded symbols */
  154. uint16_t simple_symbols[2]; /* symbols for simple mode */
  155. } HuffReader;
  156. typedef struct ImageContext {
  157. enum ImageRole role; /* role of this image */
  158. AVFrame *frame; /* AVFrame for data */
  159. int color_cache_bits; /* color cache size, log2 */
  160. uint32_t *color_cache; /* color cache data */
  161. int nb_huffman_groups; /* number of huffman groups */
  162. HuffReader *huffman_groups; /* reader for each huffman group */
  163. int size_reduction; /* relative size compared to primary image, log2 */
  164. int is_alpha_primary;
  165. } ImageContext;
  166. typedef struct WebPContext {
  167. VP8Context v; /* VP8 Context used for lossy decoding */
  168. GetBitContext gb; /* bitstream reader for main image chunk */
  169. AVFrame *alpha_frame; /* AVFrame for alpha data decompressed from VP8L */
  170. AVCodecContext *avctx; /* parent AVCodecContext */
  171. int initialized; /* set once the VP8 context is initialized */
  172. int has_alpha; /* has a separate alpha chunk */
  173. enum AlphaCompression alpha_compression; /* compression type for alpha chunk */
  174. enum AlphaFilter alpha_filter; /* filtering method for alpha chunk */
  175. uint8_t *alpha_data; /* alpha chunk data */
  176. int alpha_data_size; /* alpha chunk data size */
  177. int has_exif; /* set after an EXIF chunk has been processed */
  178. AVDictionary *exif_metadata; /* EXIF chunk data */
  179. int width; /* image width */
  180. int height; /* image height */
  181. int lossless; /* indicates lossless or lossy */
  182. int nb_transforms; /* number of transforms */
  183. enum TransformType transforms[4]; /* transformations used in the image, in order */
  184. int reduced_width; /* reduced width for index image, if applicable */
  185. int nb_huffman_groups; /* number of huffman groups in the primary image */
  186. ImageContext image[IMAGE_ROLE_NB]; /* image context for each role */
  187. } WebPContext;
  188. #define GET_PIXEL(frame, x, y) \
  189. ((frame)->data[0] + (y) * frame->linesize[0] + 4 * (x))
  190. #define GET_PIXEL_COMP(frame, x, y, c) \
  191. (*((frame)->data[0] + (y) * frame->linesize[0] + 4 * (x) + c))
  192. static void image_ctx_free(ImageContext *img)
  193. {
  194. int i, j;
  195. av_free(img->color_cache);
  196. if (img->role != IMAGE_ROLE_ARGB && !img->is_alpha_primary)
  197. av_frame_free(&img->frame);
  198. if (img->huffman_groups) {
  199. for (i = 0; i < img->nb_huffman_groups; i++) {
  200. for (j = 0; j < HUFFMAN_CODES_PER_META_CODE; j++)
  201. ff_free_vlc(&img->huffman_groups[i * HUFFMAN_CODES_PER_META_CODE + j].vlc);
  202. }
  203. av_free(img->huffman_groups);
  204. }
  205. memset(img, 0, sizeof(*img));
  206. }
  207. /* Differs from get_vlc2() in the following ways:
  208. * - codes are bit-reversed
  209. * - assumes 8-bit table to make reversal simpler
  210. * - assumes max depth of 2 since the max code length for WebP is 15
  211. */
  212. static av_always_inline int webp_get_vlc(GetBitContext *gb, VLC_TYPE (*table)[2])
  213. {
  214. int n, nb_bits;
  215. unsigned int index;
  216. int code;
  217. OPEN_READER(re, gb);
  218. UPDATE_CACHE(re, gb);
  219. index = SHOW_UBITS(re, gb, 8);
  220. index = ff_reverse[index];
  221. code = table[index][0];
  222. n = table[index][1];
  223. if (n < 0) {
  224. LAST_SKIP_BITS(re, gb, 8);
  225. UPDATE_CACHE(re, gb);
  226. nb_bits = -n;
  227. index = SHOW_UBITS(re, gb, nb_bits);
  228. index = (ff_reverse[index] >> (8 - nb_bits)) + code;
  229. code = table[index][0];
  230. n = table[index][1];
  231. }
  232. SKIP_BITS(re, gb, n);
  233. CLOSE_READER(re, gb);
  234. return code;
  235. }
  236. static int huff_reader_get_symbol(HuffReader *r, GetBitContext *gb)
  237. {
  238. if (r->simple) {
  239. if (r->nb_symbols == 1)
  240. return r->simple_symbols[0];
  241. else
  242. return r->simple_symbols[get_bits1(gb)];
  243. } else
  244. return webp_get_vlc(gb, r->vlc.table);
  245. }
  246. static int huff_reader_build_canonical(HuffReader *r, int *code_lengths,
  247. int alphabet_size)
  248. {
  249. int len = 0, sym, code = 0, ret;
  250. int max_code_length = 0;
  251. uint16_t *codes;
  252. /* special-case 1 symbol since the vlc reader cannot handle it */
  253. for (sym = 0; sym < alphabet_size; sym++) {
  254. if (code_lengths[sym] > 0) {
  255. len++;
  256. code = sym;
  257. if (len > 1)
  258. break;
  259. }
  260. }
  261. if (len == 1) {
  262. r->nb_symbols = 1;
  263. r->simple_symbols[0] = code;
  264. r->simple = 1;
  265. return 0;
  266. }
  267. for (sym = 0; sym < alphabet_size; sym++)
  268. max_code_length = FFMAX(max_code_length, code_lengths[sym]);
  269. if (max_code_length == 0 || max_code_length > MAX_HUFFMAN_CODE_LENGTH)
  270. return AVERROR(EINVAL);
  271. codes = av_malloc_array(alphabet_size, sizeof(*codes));
  272. if (!codes)
  273. return AVERROR(ENOMEM);
  274. code = 0;
  275. r->nb_symbols = 0;
  276. for (len = 1; len <= max_code_length; len++) {
  277. for (sym = 0; sym < alphabet_size; sym++) {
  278. if (code_lengths[sym] != len)
  279. continue;
  280. codes[sym] = code++;
  281. r->nb_symbols++;
  282. }
  283. code <<= 1;
  284. }
  285. if (!r->nb_symbols) {
  286. av_free(codes);
  287. return AVERROR_INVALIDDATA;
  288. }
  289. ret = init_vlc(&r->vlc, 8, alphabet_size,
  290. code_lengths, sizeof(*code_lengths), sizeof(*code_lengths),
  291. codes, sizeof(*codes), sizeof(*codes), 0);
  292. if (ret < 0) {
  293. av_free(codes);
  294. return ret;
  295. }
  296. r->simple = 0;
  297. av_free(codes);
  298. return 0;
  299. }
  300. static void read_huffman_code_simple(WebPContext *s, HuffReader *hc)
  301. {
  302. hc->nb_symbols = get_bits1(&s->gb) + 1;
  303. if (get_bits1(&s->gb))
  304. hc->simple_symbols[0] = get_bits(&s->gb, 8);
  305. else
  306. hc->simple_symbols[0] = get_bits1(&s->gb);
  307. if (hc->nb_symbols == 2)
  308. hc->simple_symbols[1] = get_bits(&s->gb, 8);
  309. hc->simple = 1;
  310. }
  311. static int read_huffman_code_normal(WebPContext *s, HuffReader *hc,
  312. int alphabet_size)
  313. {
  314. HuffReader code_len_hc = { { 0 }, 0, 0, { 0 } };
  315. int *code_lengths = NULL;
  316. int code_length_code_lengths[NUM_CODE_LENGTH_CODES] = { 0 };
  317. int i, symbol, max_symbol, prev_code_len, ret;
  318. int num_codes = 4 + get_bits(&s->gb, 4);
  319. if (num_codes > NUM_CODE_LENGTH_CODES)
  320. return AVERROR_INVALIDDATA;
  321. for (i = 0; i < num_codes; i++)
  322. code_length_code_lengths[code_length_code_order[i]] = get_bits(&s->gb, 3);
  323. ret = huff_reader_build_canonical(&code_len_hc, code_length_code_lengths,
  324. NUM_CODE_LENGTH_CODES);
  325. if (ret < 0)
  326. goto finish;
  327. code_lengths = av_mallocz_array(alphabet_size, sizeof(*code_lengths));
  328. if (!code_lengths) {
  329. ret = AVERROR(ENOMEM);
  330. goto finish;
  331. }
  332. if (get_bits1(&s->gb)) {
  333. int bits = 2 + 2 * get_bits(&s->gb, 3);
  334. max_symbol = 2 + get_bits(&s->gb, bits);
  335. if (max_symbol > alphabet_size) {
  336. av_log(s->avctx, AV_LOG_ERROR, "max symbol %d > alphabet size %d\n",
  337. max_symbol, alphabet_size);
  338. ret = AVERROR_INVALIDDATA;
  339. goto finish;
  340. }
  341. } else {
  342. max_symbol = alphabet_size;
  343. }
  344. prev_code_len = 8;
  345. symbol = 0;
  346. while (symbol < alphabet_size) {
  347. int code_len;
  348. if (!max_symbol--)
  349. break;
  350. code_len = huff_reader_get_symbol(&code_len_hc, &s->gb);
  351. if (code_len < 16) {
  352. /* Code length code [0..15] indicates literal code lengths. */
  353. code_lengths[symbol++] = code_len;
  354. if (code_len)
  355. prev_code_len = code_len;
  356. } else {
  357. int repeat = 0, length = 0;
  358. switch (code_len) {
  359. case 16:
  360. /* Code 16 repeats the previous non-zero value [3..6] times,
  361. * i.e., 3 + ReadBits(2) times. If code 16 is used before a
  362. * non-zero value has been emitted, a value of 8 is repeated. */
  363. repeat = 3 + get_bits(&s->gb, 2);
  364. length = prev_code_len;
  365. break;
  366. case 17:
  367. /* Code 17 emits a streak of zeros [3..10], i.e.,
  368. * 3 + ReadBits(3) times. */
  369. repeat = 3 + get_bits(&s->gb, 3);
  370. break;
  371. case 18:
  372. /* Code 18 emits a streak of zeros of length [11..138], i.e.,
  373. * 11 + ReadBits(7) times. */
  374. repeat = 11 + get_bits(&s->gb, 7);
  375. break;
  376. }
  377. if (symbol + repeat > alphabet_size) {
  378. av_log(s->avctx, AV_LOG_ERROR,
  379. "invalid symbol %d + repeat %d > alphabet size %d\n",
  380. symbol, repeat, alphabet_size);
  381. ret = AVERROR_INVALIDDATA;
  382. goto finish;
  383. }
  384. while (repeat-- > 0)
  385. code_lengths[symbol++] = length;
  386. }
  387. }
  388. ret = huff_reader_build_canonical(hc, code_lengths, alphabet_size);
  389. finish:
  390. ff_free_vlc(&code_len_hc.vlc);
  391. av_free(code_lengths);
  392. return ret;
  393. }
  394. static int decode_entropy_coded_image(WebPContext *s, enum ImageRole role,
  395. int w, int h);
  396. #define PARSE_BLOCK_SIZE(w, h) do { \
  397. block_bits = get_bits(&s->gb, 3) + 2; \
  398. blocks_w = FFALIGN((w), 1 << block_bits) >> block_bits; \
  399. blocks_h = FFALIGN((h), 1 << block_bits) >> block_bits; \
  400. } while (0)
  401. static int decode_entropy_image(WebPContext *s)
  402. {
  403. ImageContext *img;
  404. int ret, block_bits, width, blocks_w, blocks_h, x, y, max;
  405. width = s->width;
  406. if (s->reduced_width > 0)
  407. width = s->reduced_width;
  408. PARSE_BLOCK_SIZE(width, s->height);
  409. ret = decode_entropy_coded_image(s, IMAGE_ROLE_ENTROPY, blocks_w, blocks_h);
  410. if (ret < 0)
  411. return ret;
  412. img = &s->image[IMAGE_ROLE_ENTROPY];
  413. img->size_reduction = block_bits;
  414. /* the number of huffman groups is determined by the maximum group number
  415. * coded in the entropy image */
  416. max = 0;
  417. for (y = 0; y < img->frame->height; y++) {
  418. for (x = 0; x < img->frame->width; x++) {
  419. int p0 = GET_PIXEL_COMP(img->frame, x, y, 1);
  420. int p1 = GET_PIXEL_COMP(img->frame, x, y, 2);
  421. int p = p0 << 8 | p1;
  422. max = FFMAX(max, p);
  423. }
  424. }
  425. s->nb_huffman_groups = max + 1;
  426. return 0;
  427. }
  428. static int parse_transform_predictor(WebPContext *s)
  429. {
  430. int block_bits, blocks_w, blocks_h, ret;
  431. PARSE_BLOCK_SIZE(s->width, s->height);
  432. ret = decode_entropy_coded_image(s, IMAGE_ROLE_PREDICTOR, blocks_w,
  433. blocks_h);
  434. if (ret < 0)
  435. return ret;
  436. s->image[IMAGE_ROLE_PREDICTOR].size_reduction = block_bits;
  437. return 0;
  438. }
  439. static int parse_transform_color(WebPContext *s)
  440. {
  441. int block_bits, blocks_w, blocks_h, ret;
  442. PARSE_BLOCK_SIZE(s->width, s->height);
  443. ret = decode_entropy_coded_image(s, IMAGE_ROLE_COLOR_TRANSFORM, blocks_w,
  444. blocks_h);
  445. if (ret < 0)
  446. return ret;
  447. s->image[IMAGE_ROLE_COLOR_TRANSFORM].size_reduction = block_bits;
  448. return 0;
  449. }
  450. static int parse_transform_color_indexing(WebPContext *s)
  451. {
  452. ImageContext *img;
  453. int width_bits, index_size, ret, x;
  454. uint8_t *ct;
  455. index_size = get_bits(&s->gb, 8) + 1;
  456. if (index_size <= 2)
  457. width_bits = 3;
  458. else if (index_size <= 4)
  459. width_bits = 2;
  460. else if (index_size <= 16)
  461. width_bits = 1;
  462. else
  463. width_bits = 0;
  464. ret = decode_entropy_coded_image(s, IMAGE_ROLE_COLOR_INDEXING,
  465. index_size, 1);
  466. if (ret < 0)
  467. return ret;
  468. img = &s->image[IMAGE_ROLE_COLOR_INDEXING];
  469. img->size_reduction = width_bits;
  470. if (width_bits > 0)
  471. s->reduced_width = (s->width + ((1 << width_bits) - 1)) >> width_bits;
  472. /* color index values are delta-coded */
  473. ct = img->frame->data[0] + 4;
  474. for (x = 4; x < img->frame->width * 4; x++, ct++)
  475. ct[0] += ct[-4];
  476. return 0;
  477. }
  478. static HuffReader *get_huffman_group(WebPContext *s, ImageContext *img,
  479. int x, int y)
  480. {
  481. ImageContext *gimg = &s->image[IMAGE_ROLE_ENTROPY];
  482. int group = 0;
  483. if (gimg->size_reduction > 0) {
  484. int group_x = x >> gimg->size_reduction;
  485. int group_y = y >> gimg->size_reduction;
  486. int g0 = GET_PIXEL_COMP(gimg->frame, group_x, group_y, 1);
  487. int g1 = GET_PIXEL_COMP(gimg->frame, group_x, group_y, 2);
  488. group = g0 << 8 | g1;
  489. }
  490. return &img->huffman_groups[group * HUFFMAN_CODES_PER_META_CODE];
  491. }
  492. static av_always_inline void color_cache_put(ImageContext *img, uint32_t c)
  493. {
  494. uint32_t cache_idx = (0x1E35A7BD * c) >> (32 - img->color_cache_bits);
  495. img->color_cache[cache_idx] = c;
  496. }
  497. static int decode_entropy_coded_image(WebPContext *s, enum ImageRole role,
  498. int w, int h)
  499. {
  500. ImageContext *img;
  501. HuffReader *hg;
  502. int i, j, ret, x, y, width;
  503. img = &s->image[role];
  504. img->role = role;
  505. if (!img->frame) {
  506. img->frame = av_frame_alloc();
  507. if (!img->frame)
  508. return AVERROR(ENOMEM);
  509. }
  510. img->frame->format = AV_PIX_FMT_ARGB;
  511. img->frame->width = w;
  512. img->frame->height = h;
  513. if (role == IMAGE_ROLE_ARGB && !img->is_alpha_primary) {
  514. ThreadFrame pt = { .f = img->frame };
  515. ret = ff_thread_get_buffer(s->avctx, &pt, 0);
  516. } else
  517. ret = av_frame_get_buffer(img->frame, 1);
  518. if (ret < 0)
  519. return ret;
  520. if (get_bits1(&s->gb)) {
  521. img->color_cache_bits = get_bits(&s->gb, 4);
  522. if (img->color_cache_bits < 1 || img->color_cache_bits > 11) {
  523. av_log(s->avctx, AV_LOG_ERROR, "invalid color cache bits: %d\n",
  524. img->color_cache_bits);
  525. return AVERROR_INVALIDDATA;
  526. }
  527. img->color_cache = av_mallocz_array(1 << img->color_cache_bits,
  528. sizeof(*img->color_cache));
  529. if (!img->color_cache)
  530. return AVERROR(ENOMEM);
  531. } else {
  532. img->color_cache_bits = 0;
  533. }
  534. img->nb_huffman_groups = 1;
  535. if (role == IMAGE_ROLE_ARGB && get_bits1(&s->gb)) {
  536. ret = decode_entropy_image(s);
  537. if (ret < 0)
  538. return ret;
  539. img->nb_huffman_groups = s->nb_huffman_groups;
  540. }
  541. img->huffman_groups = av_mallocz_array(img->nb_huffman_groups *
  542. HUFFMAN_CODES_PER_META_CODE,
  543. sizeof(*img->huffman_groups));
  544. if (!img->huffman_groups)
  545. return AVERROR(ENOMEM);
  546. for (i = 0; i < img->nb_huffman_groups; i++) {
  547. hg = &img->huffman_groups[i * HUFFMAN_CODES_PER_META_CODE];
  548. for (j = 0; j < HUFFMAN_CODES_PER_META_CODE; j++) {
  549. int alphabet_size = alphabet_sizes[j];
  550. if (!j && img->color_cache_bits > 0)
  551. alphabet_size += 1 << img->color_cache_bits;
  552. if (get_bits1(&s->gb)) {
  553. read_huffman_code_simple(s, &hg[j]);
  554. } else {
  555. ret = read_huffman_code_normal(s, &hg[j], alphabet_size);
  556. if (ret < 0)
  557. return ret;
  558. }
  559. }
  560. }
  561. width = img->frame->width;
  562. if (role == IMAGE_ROLE_ARGB && s->reduced_width > 0)
  563. width = s->reduced_width;
  564. x = 0; y = 0;
  565. while (y < img->frame->height) {
  566. int v;
  567. hg = get_huffman_group(s, img, x, y);
  568. v = huff_reader_get_symbol(&hg[HUFF_IDX_GREEN], &s->gb);
  569. if (v < NUM_LITERAL_CODES) {
  570. /* literal pixel values */
  571. uint8_t *p = GET_PIXEL(img->frame, x, y);
  572. p[2] = v;
  573. p[1] = huff_reader_get_symbol(&hg[HUFF_IDX_RED], &s->gb);
  574. p[3] = huff_reader_get_symbol(&hg[HUFF_IDX_BLUE], &s->gb);
  575. p[0] = huff_reader_get_symbol(&hg[HUFF_IDX_ALPHA], &s->gb);
  576. if (img->color_cache_bits)
  577. color_cache_put(img, AV_RB32(p));
  578. x++;
  579. if (x == width) {
  580. x = 0;
  581. y++;
  582. }
  583. } else if (v < NUM_LITERAL_CODES + NUM_LENGTH_CODES) {
  584. /* LZ77 backwards mapping */
  585. int prefix_code, length, distance, ref_x, ref_y;
  586. /* parse length and distance */
  587. prefix_code = v - NUM_LITERAL_CODES;
  588. if (prefix_code < 4) {
  589. length = prefix_code + 1;
  590. } else {
  591. int extra_bits = (prefix_code - 2) >> 1;
  592. int offset = 2 + (prefix_code & 1) << extra_bits;
  593. length = offset + get_bits(&s->gb, extra_bits) + 1;
  594. }
  595. prefix_code = huff_reader_get_symbol(&hg[HUFF_IDX_DIST], &s->gb);
  596. if (prefix_code > 39) {
  597. av_log(s->avctx, AV_LOG_ERROR,
  598. "distance prefix code too large: %d\n", prefix_code);
  599. return AVERROR_INVALIDDATA;
  600. }
  601. if (prefix_code < 4) {
  602. distance = prefix_code + 1;
  603. } else {
  604. int extra_bits = prefix_code - 2 >> 1;
  605. int offset = 2 + (prefix_code & 1) << extra_bits;
  606. distance = offset + get_bits(&s->gb, extra_bits) + 1;
  607. }
  608. /* find reference location */
  609. if (distance <= NUM_SHORT_DISTANCES) {
  610. int xi = lz77_distance_offsets[distance - 1][0];
  611. int yi = lz77_distance_offsets[distance - 1][1];
  612. distance = FFMAX(1, xi + yi * width);
  613. } else {
  614. distance -= NUM_SHORT_DISTANCES;
  615. }
  616. ref_x = x;
  617. ref_y = y;
  618. if (distance <= x) {
  619. ref_x -= distance;
  620. distance = 0;
  621. } else {
  622. ref_x = 0;
  623. distance -= x;
  624. }
  625. while (distance >= width) {
  626. ref_y--;
  627. distance -= width;
  628. }
  629. if (distance > 0) {
  630. ref_x = width - distance;
  631. ref_y--;
  632. }
  633. ref_x = FFMAX(0, ref_x);
  634. ref_y = FFMAX(0, ref_y);
  635. /* copy pixels
  636. * source and dest regions can overlap and wrap lines, so just
  637. * copy per-pixel */
  638. for (i = 0; i < length; i++) {
  639. uint8_t *p_ref = GET_PIXEL(img->frame, ref_x, ref_y);
  640. uint8_t *p = GET_PIXEL(img->frame, x, y);
  641. AV_COPY32(p, p_ref);
  642. if (img->color_cache_bits)
  643. color_cache_put(img, AV_RB32(p));
  644. x++;
  645. ref_x++;
  646. if (x == width) {
  647. x = 0;
  648. y++;
  649. }
  650. if (ref_x == width) {
  651. ref_x = 0;
  652. ref_y++;
  653. }
  654. if (y == img->frame->height || ref_y == img->frame->height)
  655. break;
  656. }
  657. } else {
  658. /* read from color cache */
  659. uint8_t *p = GET_PIXEL(img->frame, x, y);
  660. int cache_idx = v - (NUM_LITERAL_CODES + NUM_LENGTH_CODES);
  661. if (!img->color_cache_bits) {
  662. av_log(s->avctx, AV_LOG_ERROR, "color cache not found\n");
  663. return AVERROR_INVALIDDATA;
  664. }
  665. if (cache_idx >= 1 << img->color_cache_bits) {
  666. av_log(s->avctx, AV_LOG_ERROR,
  667. "color cache index out-of-bounds\n");
  668. return AVERROR_INVALIDDATA;
  669. }
  670. AV_WB32(p, img->color_cache[cache_idx]);
  671. x++;
  672. if (x == width) {
  673. x = 0;
  674. y++;
  675. }
  676. }
  677. }
  678. return 0;
  679. }
  680. /* PRED_MODE_BLACK */
  681. static void inv_predict_0(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  682. const uint8_t *p_t, const uint8_t *p_tr)
  683. {
  684. AV_WB32(p, 0xFF000000);
  685. }
  686. /* PRED_MODE_L */
  687. static void inv_predict_1(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  688. const uint8_t *p_t, const uint8_t *p_tr)
  689. {
  690. AV_COPY32(p, p_l);
  691. }
  692. /* PRED_MODE_T */
  693. static void inv_predict_2(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  694. const uint8_t *p_t, const uint8_t *p_tr)
  695. {
  696. AV_COPY32(p, p_t);
  697. }
  698. /* PRED_MODE_TR */
  699. static void inv_predict_3(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  700. const uint8_t *p_t, const uint8_t *p_tr)
  701. {
  702. AV_COPY32(p, p_tr);
  703. }
  704. /* PRED_MODE_TL */
  705. static void inv_predict_4(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  706. const uint8_t *p_t, const uint8_t *p_tr)
  707. {
  708. AV_COPY32(p, p_tl);
  709. }
  710. /* PRED_MODE_AVG_T_AVG_L_TR */
  711. static void inv_predict_5(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  712. const uint8_t *p_t, const uint8_t *p_tr)
  713. {
  714. p[0] = p_t[0] + (p_l[0] + p_tr[0] >> 1) >> 1;
  715. p[1] = p_t[1] + (p_l[1] + p_tr[1] >> 1) >> 1;
  716. p[2] = p_t[2] + (p_l[2] + p_tr[2] >> 1) >> 1;
  717. p[3] = p_t[3] + (p_l[3] + p_tr[3] >> 1) >> 1;
  718. }
  719. /* PRED_MODE_AVG_L_TL */
  720. static void inv_predict_6(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  721. const uint8_t *p_t, const uint8_t *p_tr)
  722. {
  723. p[0] = p_l[0] + p_tl[0] >> 1;
  724. p[1] = p_l[1] + p_tl[1] >> 1;
  725. p[2] = p_l[2] + p_tl[2] >> 1;
  726. p[3] = p_l[3] + p_tl[3] >> 1;
  727. }
  728. /* PRED_MODE_AVG_L_T */
  729. static void inv_predict_7(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  730. const uint8_t *p_t, const uint8_t *p_tr)
  731. {
  732. p[0] = p_l[0] + p_t[0] >> 1;
  733. p[1] = p_l[1] + p_t[1] >> 1;
  734. p[2] = p_l[2] + p_t[2] >> 1;
  735. p[3] = p_l[3] + p_t[3] >> 1;
  736. }
  737. /* PRED_MODE_AVG_TL_T */
  738. static void inv_predict_8(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  739. const uint8_t *p_t, const uint8_t *p_tr)
  740. {
  741. p[0] = p_tl[0] + p_t[0] >> 1;
  742. p[1] = p_tl[1] + p_t[1] >> 1;
  743. p[2] = p_tl[2] + p_t[2] >> 1;
  744. p[3] = p_tl[3] + p_t[3] >> 1;
  745. }
  746. /* PRED_MODE_AVG_T_TR */
  747. static void inv_predict_9(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  748. const uint8_t *p_t, const uint8_t *p_tr)
  749. {
  750. p[0] = p_t[0] + p_tr[0] >> 1;
  751. p[1] = p_t[1] + p_tr[1] >> 1;
  752. p[2] = p_t[2] + p_tr[2] >> 1;
  753. p[3] = p_t[3] + p_tr[3] >> 1;
  754. }
  755. /* PRED_MODE_AVG_AVG_L_TL_AVG_T_TR */
  756. static void inv_predict_10(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  757. const uint8_t *p_t, const uint8_t *p_tr)
  758. {
  759. p[0] = (p_l[0] + p_tl[0] >> 1) + (p_t[0] + p_tr[0] >> 1) >> 1;
  760. p[1] = (p_l[1] + p_tl[1] >> 1) + (p_t[1] + p_tr[1] >> 1) >> 1;
  761. p[2] = (p_l[2] + p_tl[2] >> 1) + (p_t[2] + p_tr[2] >> 1) >> 1;
  762. p[3] = (p_l[3] + p_tl[3] >> 1) + (p_t[3] + p_tr[3] >> 1) >> 1;
  763. }
  764. /* PRED_MODE_SELECT */
  765. static void inv_predict_11(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  766. const uint8_t *p_t, const uint8_t *p_tr)
  767. {
  768. int diff = (FFABS(p_l[0] - p_tl[0]) - FFABS(p_t[0] - p_tl[0])) +
  769. (FFABS(p_l[1] - p_tl[1]) - FFABS(p_t[1] - p_tl[1])) +
  770. (FFABS(p_l[2] - p_tl[2]) - FFABS(p_t[2] - p_tl[2])) +
  771. (FFABS(p_l[3] - p_tl[3]) - FFABS(p_t[3] - p_tl[3]));
  772. if (diff <= 0)
  773. AV_COPY32(p, p_t);
  774. else
  775. AV_COPY32(p, p_l);
  776. }
  777. /* PRED_MODE_ADD_SUBTRACT_FULL */
  778. static void inv_predict_12(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  779. const uint8_t *p_t, const uint8_t *p_tr)
  780. {
  781. p[0] = av_clip_uint8(p_l[0] + p_t[0] - p_tl[0]);
  782. p[1] = av_clip_uint8(p_l[1] + p_t[1] - p_tl[1]);
  783. p[2] = av_clip_uint8(p_l[2] + p_t[2] - p_tl[2]);
  784. p[3] = av_clip_uint8(p_l[3] + p_t[3] - p_tl[3]);
  785. }
  786. static av_always_inline uint8_t clamp_add_subtract_half(int a, int b, int c)
  787. {
  788. int d = a + b >> 1;
  789. return av_clip_uint8(d + (d - c) / 2);
  790. }
  791. /* PRED_MODE_ADD_SUBTRACT_HALF */
  792. static void inv_predict_13(uint8_t *p, const uint8_t *p_l, const uint8_t *p_tl,
  793. const uint8_t *p_t, const uint8_t *p_tr)
  794. {
  795. p[0] = clamp_add_subtract_half(p_l[0], p_t[0], p_tl[0]);
  796. p[1] = clamp_add_subtract_half(p_l[1], p_t[1], p_tl[1]);
  797. p[2] = clamp_add_subtract_half(p_l[2], p_t[2], p_tl[2]);
  798. p[3] = clamp_add_subtract_half(p_l[3], p_t[3], p_tl[3]);
  799. }
  800. typedef void (*inv_predict_func)(uint8_t *p, const uint8_t *p_l,
  801. const uint8_t *p_tl, const uint8_t *p_t,
  802. const uint8_t *p_tr);
  803. static const inv_predict_func inverse_predict[14] = {
  804. inv_predict_0, inv_predict_1, inv_predict_2, inv_predict_3,
  805. inv_predict_4, inv_predict_5, inv_predict_6, inv_predict_7,
  806. inv_predict_8, inv_predict_9, inv_predict_10, inv_predict_11,
  807. inv_predict_12, inv_predict_13,
  808. };
  809. static void inverse_prediction(AVFrame *frame, enum PredictionMode m, int x, int y)
  810. {
  811. uint8_t *dec, *p_l, *p_tl, *p_t, *p_tr;
  812. uint8_t p[4];
  813. dec = GET_PIXEL(frame, x, y);
  814. p_l = GET_PIXEL(frame, x - 1, y);
  815. p_tl = GET_PIXEL(frame, x - 1, y - 1);
  816. p_t = GET_PIXEL(frame, x, y - 1);
  817. if (x == frame->width - 1)
  818. p_tr = GET_PIXEL(frame, 0, y);
  819. else
  820. p_tr = GET_PIXEL(frame, x + 1, y - 1);
  821. inverse_predict[m](p, p_l, p_tl, p_t, p_tr);
  822. dec[0] += p[0];
  823. dec[1] += p[1];
  824. dec[2] += p[2];
  825. dec[3] += p[3];
  826. }
  827. static int apply_predictor_transform(WebPContext *s)
  828. {
  829. ImageContext *img = &s->image[IMAGE_ROLE_ARGB];
  830. ImageContext *pimg = &s->image[IMAGE_ROLE_PREDICTOR];
  831. int x, y;
  832. for (y = 0; y < img->frame->height; y++) {
  833. for (x = 0; x < img->frame->width; x++) {
  834. int tx = x >> pimg->size_reduction;
  835. int ty = y >> pimg->size_reduction;
  836. enum PredictionMode m = GET_PIXEL_COMP(pimg->frame, tx, ty, 2);
  837. if (x == 0) {
  838. if (y == 0)
  839. m = PRED_MODE_BLACK;
  840. else
  841. m = PRED_MODE_T;
  842. } else if (y == 0)
  843. m = PRED_MODE_L;
  844. if (m > 13) {
  845. av_log(s->avctx, AV_LOG_ERROR,
  846. "invalid predictor mode: %d\n", m);
  847. return AVERROR_INVALIDDATA;
  848. }
  849. inverse_prediction(img->frame, m, x, y);
  850. }
  851. }
  852. return 0;
  853. }
  854. static av_always_inline uint8_t color_transform_delta(uint8_t color_pred,
  855. uint8_t color)
  856. {
  857. return (int)ff_u8_to_s8(color_pred) * ff_u8_to_s8(color) >> 5;
  858. }
  859. static int apply_color_transform(WebPContext *s)
  860. {
  861. ImageContext *img, *cimg;
  862. int x, y, cx, cy;
  863. uint8_t *p, *cp;
  864. img = &s->image[IMAGE_ROLE_ARGB];
  865. cimg = &s->image[IMAGE_ROLE_COLOR_TRANSFORM];
  866. for (y = 0; y < img->frame->height; y++) {
  867. for (x = 0; x < img->frame->width; x++) {
  868. cx = x >> cimg->size_reduction;
  869. cy = y >> cimg->size_reduction;
  870. cp = GET_PIXEL(cimg->frame, cx, cy);
  871. p = GET_PIXEL(img->frame, x, y);
  872. p[1] += color_transform_delta(cp[3], p[2]);
  873. p[3] += color_transform_delta(cp[2], p[2]) +
  874. color_transform_delta(cp[1], p[1]);
  875. }
  876. }
  877. return 0;
  878. }
  879. static int apply_subtract_green_transform(WebPContext *s)
  880. {
  881. int x, y;
  882. ImageContext *img = &s->image[IMAGE_ROLE_ARGB];
  883. for (y = 0; y < img->frame->height; y++) {
  884. for (x = 0; x < img->frame->width; x++) {
  885. uint8_t *p = GET_PIXEL(img->frame, x, y);
  886. p[1] += p[2];
  887. p[3] += p[2];
  888. }
  889. }
  890. return 0;
  891. }
  892. static int apply_color_indexing_transform(WebPContext *s)
  893. {
  894. ImageContext *img;
  895. ImageContext *pal;
  896. int i, x, y;
  897. uint8_t *p;
  898. img = &s->image[IMAGE_ROLE_ARGB];
  899. pal = &s->image[IMAGE_ROLE_COLOR_INDEXING];
  900. if (pal->size_reduction > 0) {
  901. GetBitContext gb_g;
  902. uint8_t *line;
  903. int pixel_bits = 8 >> pal->size_reduction;
  904. line = av_malloc(img->frame->linesize[0]);
  905. if (!line)
  906. return AVERROR(ENOMEM);
  907. for (y = 0; y < img->frame->height; y++) {
  908. p = GET_PIXEL(img->frame, 0, y);
  909. memcpy(line, p, img->frame->linesize[0]);
  910. init_get_bits(&gb_g, line, img->frame->linesize[0] * 8);
  911. skip_bits(&gb_g, 16);
  912. i = 0;
  913. for (x = 0; x < img->frame->width; x++) {
  914. p = GET_PIXEL(img->frame, x, y);
  915. p[2] = get_bits(&gb_g, pixel_bits);
  916. i++;
  917. if (i == 1 << pal->size_reduction) {
  918. skip_bits(&gb_g, 24);
  919. i = 0;
  920. }
  921. }
  922. }
  923. av_free(line);
  924. }
  925. // switch to local palette if it's worth initializing it
  926. if (img->frame->height * img->frame->width > 300) {
  927. uint8_t palette[256 * 4];
  928. const int size = pal->frame->width * 4;
  929. av_assert0(size <= 1024U);
  930. memcpy(palette, GET_PIXEL(pal->frame, 0, 0), size); // copy palette
  931. // set extra entries to transparent black
  932. memset(palette + size, 0, 256 * 4 - size);
  933. for (y = 0; y < img->frame->height; y++) {
  934. for (x = 0; x < img->frame->width; x++) {
  935. p = GET_PIXEL(img->frame, x, y);
  936. i = p[2];
  937. AV_COPY32(p, &palette[i * 4]);
  938. }
  939. }
  940. } else {
  941. for (y = 0; y < img->frame->height; y++) {
  942. for (x = 0; x < img->frame->width; x++) {
  943. p = GET_PIXEL(img->frame, x, y);
  944. i = p[2];
  945. if (i >= pal->frame->width) {
  946. AV_WB32(p, 0x00000000);
  947. } else {
  948. const uint8_t *pi = GET_PIXEL(pal->frame, i, 0);
  949. AV_COPY32(p, pi);
  950. }
  951. }
  952. }
  953. }
  954. return 0;
  955. }
  956. static int vp8_lossless_decode_frame(AVCodecContext *avctx, AVFrame *p,
  957. int *got_frame, uint8_t *data_start,
  958. unsigned int data_size, int is_alpha_chunk)
  959. {
  960. WebPContext *s = avctx->priv_data;
  961. int w, h, ret, i, used;
  962. if (!is_alpha_chunk) {
  963. s->lossless = 1;
  964. avctx->pix_fmt = AV_PIX_FMT_ARGB;
  965. }
  966. ret = init_get_bits8(&s->gb, data_start, data_size);
  967. if (ret < 0)
  968. return ret;
  969. if (!is_alpha_chunk) {
  970. if (get_bits(&s->gb, 8) != 0x2F) {
  971. av_log(avctx, AV_LOG_ERROR, "Invalid WebP Lossless signature\n");
  972. return AVERROR_INVALIDDATA;
  973. }
  974. w = get_bits(&s->gb, 14) + 1;
  975. h = get_bits(&s->gb, 14) + 1;
  976. if (s->width && s->width != w) {
  977. av_log(avctx, AV_LOG_WARNING, "Width mismatch. %d != %d\n",
  978. s->width, w);
  979. }
  980. s->width = w;
  981. if (s->height && s->height != h) {
  982. av_log(avctx, AV_LOG_WARNING, "Height mismatch. %d != %d\n",
  983. s->width, w);
  984. }
  985. s->height = h;
  986. ret = ff_set_dimensions(avctx, s->width, s->height);
  987. if (ret < 0)
  988. return ret;
  989. s->has_alpha = get_bits1(&s->gb);
  990. if (get_bits(&s->gb, 3) != 0x0) {
  991. av_log(avctx, AV_LOG_ERROR, "Invalid WebP Lossless version\n");
  992. return AVERROR_INVALIDDATA;
  993. }
  994. } else {
  995. if (!s->width || !s->height)
  996. return AVERROR_BUG;
  997. w = s->width;
  998. h = s->height;
  999. }
  1000. /* parse transformations */
  1001. s->nb_transforms = 0;
  1002. s->reduced_width = 0;
  1003. used = 0;
  1004. while (get_bits1(&s->gb)) {
  1005. enum TransformType transform = get_bits(&s->gb, 2);
  1006. if (used & (1 << transform)) {
  1007. av_log(avctx, AV_LOG_ERROR, "Transform %d used more than once\n",
  1008. transform);
  1009. ret = AVERROR_INVALIDDATA;
  1010. goto free_and_return;
  1011. }
  1012. used |= (1 << transform);
  1013. s->transforms[s->nb_transforms++] = transform;
  1014. switch (transform) {
  1015. case PREDICTOR_TRANSFORM:
  1016. ret = parse_transform_predictor(s);
  1017. break;
  1018. case COLOR_TRANSFORM:
  1019. ret = parse_transform_color(s);
  1020. break;
  1021. case COLOR_INDEXING_TRANSFORM:
  1022. ret = parse_transform_color_indexing(s);
  1023. break;
  1024. }
  1025. if (ret < 0)
  1026. goto free_and_return;
  1027. }
  1028. /* decode primary image */
  1029. s->image[IMAGE_ROLE_ARGB].frame = p;
  1030. if (is_alpha_chunk)
  1031. s->image[IMAGE_ROLE_ARGB].is_alpha_primary = 1;
  1032. ret = decode_entropy_coded_image(s, IMAGE_ROLE_ARGB, w, h);
  1033. if (ret < 0)
  1034. goto free_and_return;
  1035. /* apply transformations */
  1036. for (i = s->nb_transforms - 1; i >= 0; i--) {
  1037. switch (s->transforms[i]) {
  1038. case PREDICTOR_TRANSFORM:
  1039. ret = apply_predictor_transform(s);
  1040. break;
  1041. case COLOR_TRANSFORM:
  1042. ret = apply_color_transform(s);
  1043. break;
  1044. case SUBTRACT_GREEN:
  1045. ret = apply_subtract_green_transform(s);
  1046. break;
  1047. case COLOR_INDEXING_TRANSFORM:
  1048. ret = apply_color_indexing_transform(s);
  1049. break;
  1050. }
  1051. if (ret < 0)
  1052. goto free_and_return;
  1053. }
  1054. *got_frame = 1;
  1055. p->pict_type = AV_PICTURE_TYPE_I;
  1056. p->key_frame = 1;
  1057. ret = data_size;
  1058. free_and_return:
  1059. for (i = 0; i < IMAGE_ROLE_NB; i++)
  1060. image_ctx_free(&s->image[i]);
  1061. return ret;
  1062. }
  1063. static void alpha_inverse_prediction(AVFrame *frame, enum AlphaFilter m)
  1064. {
  1065. int x, y, ls;
  1066. uint8_t *dec;
  1067. ls = frame->linesize[3];
  1068. /* filter first row using horizontal filter */
  1069. dec = frame->data[3] + 1;
  1070. for (x = 1; x < frame->width; x++, dec++)
  1071. *dec += *(dec - 1);
  1072. /* filter first column using vertical filter */
  1073. dec = frame->data[3] + ls;
  1074. for (y = 1; y < frame->height; y++, dec += ls)
  1075. *dec += *(dec - ls);
  1076. /* filter the rest using the specified filter */
  1077. switch (m) {
  1078. case ALPHA_FILTER_HORIZONTAL:
  1079. for (y = 1; y < frame->height; y++) {
  1080. dec = frame->data[3] + y * ls + 1;
  1081. for (x = 1; x < frame->width; x++, dec++)
  1082. *dec += *(dec - 1);
  1083. }
  1084. break;
  1085. case ALPHA_FILTER_VERTICAL:
  1086. for (y = 1; y < frame->height; y++) {
  1087. dec = frame->data[3] + y * ls + 1;
  1088. for (x = 1; x < frame->width; x++, dec++)
  1089. *dec += *(dec - ls);
  1090. }
  1091. break;
  1092. case ALPHA_FILTER_GRADIENT:
  1093. for (y = 1; y < frame->height; y++) {
  1094. dec = frame->data[3] + y * ls + 1;
  1095. for (x = 1; x < frame->width; x++, dec++)
  1096. dec[0] += av_clip_uint8(*(dec - 1) + *(dec - ls) - *(dec - ls - 1));
  1097. }
  1098. break;
  1099. }
  1100. }
  1101. static int vp8_lossy_decode_alpha(AVCodecContext *avctx, AVFrame *p,
  1102. uint8_t *data_start,
  1103. unsigned int data_size)
  1104. {
  1105. WebPContext *s = avctx->priv_data;
  1106. int x, y, ret;
  1107. if (s->alpha_compression == ALPHA_COMPRESSION_NONE) {
  1108. GetByteContext gb;
  1109. bytestream2_init(&gb, data_start, data_size);
  1110. for (y = 0; y < s->height; y++)
  1111. bytestream2_get_buffer(&gb, p->data[3] + p->linesize[3] * y,
  1112. s->width);
  1113. } else if (s->alpha_compression == ALPHA_COMPRESSION_VP8L) {
  1114. uint8_t *ap, *pp;
  1115. int alpha_got_frame = 0;
  1116. s->alpha_frame = av_frame_alloc();
  1117. if (!s->alpha_frame)
  1118. return AVERROR(ENOMEM);
  1119. ret = vp8_lossless_decode_frame(avctx, s->alpha_frame, &alpha_got_frame,
  1120. data_start, data_size, 1);
  1121. if (ret < 0) {
  1122. av_frame_free(&s->alpha_frame);
  1123. return ret;
  1124. }
  1125. if (!alpha_got_frame) {
  1126. av_frame_free(&s->alpha_frame);
  1127. return AVERROR_INVALIDDATA;
  1128. }
  1129. /* copy green component of alpha image to alpha plane of primary image */
  1130. for (y = 0; y < s->height; y++) {
  1131. ap = GET_PIXEL(s->alpha_frame, 0, y) + 2;
  1132. pp = p->data[3] + p->linesize[3] * y;
  1133. for (x = 0; x < s->width; x++) {
  1134. *pp = *ap;
  1135. pp++;
  1136. ap += 4;
  1137. }
  1138. }
  1139. av_frame_free(&s->alpha_frame);
  1140. }
  1141. /* apply alpha filtering */
  1142. if (s->alpha_filter)
  1143. alpha_inverse_prediction(p, s->alpha_filter);
  1144. return 0;
  1145. }
  1146. static int vp8_lossy_decode_frame(AVCodecContext *avctx, AVFrame *p,
  1147. int *got_frame, uint8_t *data_start,
  1148. unsigned int data_size)
  1149. {
  1150. WebPContext *s = avctx->priv_data;
  1151. AVPacket pkt;
  1152. int ret;
  1153. if (!s->initialized) {
  1154. ff_vp8_decode_init(avctx);
  1155. s->initialized = 1;
  1156. if (s->has_alpha)
  1157. avctx->pix_fmt = AV_PIX_FMT_YUVA420P;
  1158. }
  1159. s->lossless = 0;
  1160. if (data_size > INT_MAX) {
  1161. av_log(avctx, AV_LOG_ERROR, "unsupported chunk size\n");
  1162. return AVERROR_PATCHWELCOME;
  1163. }
  1164. av_init_packet(&pkt);
  1165. pkt.data = data_start;
  1166. pkt.size = data_size;
  1167. ret = ff_vp8_decode_frame(avctx, p, got_frame, &pkt);
  1168. if (s->has_alpha) {
  1169. ret = vp8_lossy_decode_alpha(avctx, p, s->alpha_data,
  1170. s->alpha_data_size);
  1171. if (ret < 0)
  1172. return ret;
  1173. }
  1174. return ret;
  1175. }
  1176. static int webp_decode_frame(AVCodecContext *avctx, void *data, int *got_frame,
  1177. AVPacket *avpkt)
  1178. {
  1179. AVFrame * const p = data;
  1180. WebPContext *s = avctx->priv_data;
  1181. GetByteContext gb;
  1182. int ret;
  1183. uint32_t chunk_type, chunk_size;
  1184. int vp8x_flags = 0;
  1185. s->avctx = avctx;
  1186. s->width = 0;
  1187. s->height = 0;
  1188. *got_frame = 0;
  1189. s->has_alpha = 0;
  1190. s->has_exif = 0;
  1191. bytestream2_init(&gb, avpkt->data, avpkt->size);
  1192. if (bytestream2_get_bytes_left(&gb) < 12)
  1193. return AVERROR_INVALIDDATA;
  1194. if (bytestream2_get_le32(&gb) != MKTAG('R', 'I', 'F', 'F')) {
  1195. av_log(avctx, AV_LOG_ERROR, "missing RIFF tag\n");
  1196. return AVERROR_INVALIDDATA;
  1197. }
  1198. chunk_size = bytestream2_get_le32(&gb);
  1199. if (bytestream2_get_bytes_left(&gb) < chunk_size)
  1200. return AVERROR_INVALIDDATA;
  1201. if (bytestream2_get_le32(&gb) != MKTAG('W', 'E', 'B', 'P')) {
  1202. av_log(avctx, AV_LOG_ERROR, "missing WEBP tag\n");
  1203. return AVERROR_INVALIDDATA;
  1204. }
  1205. av_dict_free(&s->exif_metadata);
  1206. while (bytestream2_get_bytes_left(&gb) > 8) {
  1207. char chunk_str[5] = { 0 };
  1208. chunk_type = bytestream2_get_le32(&gb);
  1209. chunk_size = bytestream2_get_le32(&gb);
  1210. if (chunk_size == UINT32_MAX)
  1211. return AVERROR_INVALIDDATA;
  1212. chunk_size += chunk_size & 1;
  1213. if (bytestream2_get_bytes_left(&gb) < chunk_size)
  1214. return AVERROR_INVALIDDATA;
  1215. switch (chunk_type) {
  1216. case MKTAG('V', 'P', '8', ' '):
  1217. if (!*got_frame) {
  1218. ret = vp8_lossy_decode_frame(avctx, p, got_frame,
  1219. avpkt->data + bytestream2_tell(&gb),
  1220. chunk_size);
  1221. if (ret < 0)
  1222. return ret;
  1223. }
  1224. bytestream2_skip(&gb, chunk_size);
  1225. break;
  1226. case MKTAG('V', 'P', '8', 'L'):
  1227. if (!*got_frame) {
  1228. ret = vp8_lossless_decode_frame(avctx, p, got_frame,
  1229. avpkt->data + bytestream2_tell(&gb),
  1230. chunk_size, 0);
  1231. if (ret < 0)
  1232. return ret;
  1233. avctx->properties |= FF_CODEC_PROPERTY_LOSSLESS;
  1234. }
  1235. bytestream2_skip(&gb, chunk_size);
  1236. break;
  1237. case MKTAG('V', 'P', '8', 'X'):
  1238. vp8x_flags = bytestream2_get_byte(&gb);
  1239. bytestream2_skip(&gb, 3);
  1240. s->width = bytestream2_get_le24(&gb) + 1;
  1241. s->height = bytestream2_get_le24(&gb) + 1;
  1242. ret = av_image_check_size(s->width, s->height, 0, avctx);
  1243. if (ret < 0)
  1244. return ret;
  1245. break;
  1246. case MKTAG('A', 'L', 'P', 'H'): {
  1247. int alpha_header, filter_m, compression;
  1248. if (!(vp8x_flags & VP8X_FLAG_ALPHA)) {
  1249. av_log(avctx, AV_LOG_WARNING,
  1250. "ALPHA chunk present, but alpha bit not set in the "
  1251. "VP8X header\n");
  1252. }
  1253. if (chunk_size == 0) {
  1254. av_log(avctx, AV_LOG_ERROR, "invalid ALPHA chunk size\n");
  1255. return AVERROR_INVALIDDATA;
  1256. }
  1257. alpha_header = bytestream2_get_byte(&gb);
  1258. s->alpha_data = avpkt->data + bytestream2_tell(&gb);
  1259. s->alpha_data_size = chunk_size - 1;
  1260. bytestream2_skip(&gb, s->alpha_data_size);
  1261. filter_m = (alpha_header >> 2) & 0x03;
  1262. compression = alpha_header & 0x03;
  1263. if (compression > ALPHA_COMPRESSION_VP8L) {
  1264. av_log(avctx, AV_LOG_VERBOSE,
  1265. "skipping unsupported ALPHA chunk\n");
  1266. } else {
  1267. s->has_alpha = 1;
  1268. s->alpha_compression = compression;
  1269. s->alpha_filter = filter_m;
  1270. }
  1271. break;
  1272. }
  1273. case MKTAG('E', 'X', 'I', 'F'): {
  1274. int le, ifd_offset, exif_offset = bytestream2_tell(&gb);
  1275. GetByteContext exif_gb;
  1276. if (s->has_exif) {
  1277. av_log(avctx, AV_LOG_VERBOSE, "Ignoring extra EXIF chunk\n");
  1278. goto exif_end;
  1279. }
  1280. if (!(vp8x_flags & VP8X_FLAG_EXIF_METADATA))
  1281. av_log(avctx, AV_LOG_WARNING,
  1282. "EXIF chunk present, but Exif bit not set in the "
  1283. "VP8X header\n");
  1284. s->has_exif = 1;
  1285. bytestream2_init(&exif_gb, avpkt->data + exif_offset,
  1286. avpkt->size - exif_offset);
  1287. if (ff_tdecode_header(&exif_gb, &le, &ifd_offset) < 0) {
  1288. av_log(avctx, AV_LOG_ERROR, "invalid TIFF header "
  1289. "in Exif data\n");
  1290. goto exif_end;
  1291. }
  1292. bytestream2_seek(&exif_gb, ifd_offset, SEEK_SET);
  1293. if (avpriv_exif_decode_ifd(avctx, &exif_gb, le, 0, &s->exif_metadata) < 0) {
  1294. av_log(avctx, AV_LOG_ERROR, "error decoding Exif data\n");
  1295. goto exif_end;
  1296. }
  1297. av_dict_copy(avpriv_frame_get_metadatap(data), s->exif_metadata, 0);
  1298. exif_end:
  1299. av_dict_free(&s->exif_metadata);
  1300. bytestream2_skip(&gb, chunk_size);
  1301. break;
  1302. }
  1303. case MKTAG('I', 'C', 'C', 'P'):
  1304. case MKTAG('A', 'N', 'I', 'M'):
  1305. case MKTAG('A', 'N', 'M', 'F'):
  1306. case MKTAG('X', 'M', 'P', ' '):
  1307. AV_WL32(chunk_str, chunk_type);
  1308. av_log(avctx, AV_LOG_VERBOSE, "skipping unsupported chunk: %s\n",
  1309. chunk_str);
  1310. bytestream2_skip(&gb, chunk_size);
  1311. break;
  1312. default:
  1313. AV_WL32(chunk_str, chunk_type);
  1314. av_log(avctx, AV_LOG_VERBOSE, "skipping unknown chunk: %s\n",
  1315. chunk_str);
  1316. bytestream2_skip(&gb, chunk_size);
  1317. break;
  1318. }
  1319. }
  1320. if (!*got_frame) {
  1321. av_log(avctx, AV_LOG_ERROR, "image data not found\n");
  1322. return AVERROR_INVALIDDATA;
  1323. }
  1324. return avpkt->size;
  1325. }
  1326. static av_cold int webp_decode_close(AVCodecContext *avctx)
  1327. {
  1328. WebPContext *s = avctx->priv_data;
  1329. if (s->initialized)
  1330. return ff_vp8_decode_free(avctx);
  1331. return 0;
  1332. }
  1333. AVCodec ff_webp_decoder = {
  1334. .name = "webp",
  1335. .long_name = NULL_IF_CONFIG_SMALL("WebP image"),
  1336. .type = AVMEDIA_TYPE_VIDEO,
  1337. .id = AV_CODEC_ID_WEBP,
  1338. .priv_data_size = sizeof(WebPContext),
  1339. .decode = webp_decode_frame,
  1340. .close = webp_decode_close,
  1341. .capabilities = AV_CODEC_CAP_DR1 | AV_CODEC_CAP_FRAME_THREADS,
  1342. };