| Index: third_party/libwebp/enc/vp8l.c
|
| diff --git a/third_party/libwebp/enc/vp8l.c b/third_party/libwebp/enc/vp8l.c
|
| index 15726318e253c22e70c127cc4bf5f805204605f2..891dd01bfb6cfe902d37c6b5c09e73b3eaf598c9 100644
|
| --- a/third_party/libwebp/enc/vp8l.c
|
| +++ b/third_party/libwebp/enc/vp8l.c
|
| @@ -106,14 +106,9 @@ static int AnalyzeEntropy(const uint32_t* argb,
|
| const uint32_t* last_line = NULL;
|
| uint32_t last_pix = argb[0]; // so we're sure that pix_diff == 0
|
|
|
| - VP8LHistogram* nonpredicted = NULL;
|
| - VP8LHistogram* predicted =
|
| - (VP8LHistogram*)malloc(2 * sizeof(*predicted));
|
| - if (predicted == NULL) return 0;
|
| - nonpredicted = predicted + 1;
|
| -
|
| - VP8LHistogramInit(predicted, 0);
|
| - VP8LHistogramInit(nonpredicted, 0);
|
| + VP8LHistogramSet* const histo_set = VP8LAllocateHistogramSet(2, 0);
|
| + if (histo_set == NULL) return 0;
|
| +
|
| for (y = 0; y < height; ++y) {
|
| for (x = 0; x < width; ++x) {
|
| const uint32_t pix = argb[x];
|
| @@ -126,21 +121,28 @@ static int AnalyzeEntropy(const uint32_t* argb,
|
| {
|
| const PixOrCopy pix_token = PixOrCopyCreateLiteral(pix);
|
| const PixOrCopy pix_diff_token = PixOrCopyCreateLiteral(pix_diff);
|
| - VP8LHistogramAddSinglePixOrCopy(nonpredicted, &pix_token);
|
| - VP8LHistogramAddSinglePixOrCopy(predicted, &pix_diff_token);
|
| + VP8LHistogramAddSinglePixOrCopy(histo_set->histograms[0], &pix_token);
|
| + VP8LHistogramAddSinglePixOrCopy(histo_set->histograms[1],
|
| + &pix_diff_token);
|
| }
|
| }
|
| last_line = argb;
|
| argb += argb_stride;
|
| }
|
| - *nonpredicted_bits = VP8LHistogramEstimateBitsBulk(nonpredicted);
|
| - *predicted_bits = VP8LHistogramEstimateBitsBulk(predicted);
|
| - free(predicted);
|
| + *nonpredicted_bits = VP8LHistogramEstimateBitsBulk(histo_set->histograms[0]);
|
| + *predicted_bits = VP8LHistogramEstimateBitsBulk(histo_set->histograms[1]);
|
| + VP8LFreeHistogramSet(histo_set);
|
| return 1;
|
| }
|
|
|
| -static int VP8LEncAnalyze(VP8LEncoder* const enc, WebPImageHint image_hint) {
|
| +static int AnalyzeAndInit(VP8LEncoder* const enc, WebPImageHint image_hint) {
|
| const WebPPicture* const pic = enc->pic_;
|
| + const int width = pic->width;
|
| + const int height = pic->height;
|
| + const int pix_cnt = width * height;
|
| + // we round the block size up, so we're guaranteed to have
|
| + // at max MAX_REFS_BLOCK_PER_IMAGE blocks used:
|
| + int refs_block_size = (pix_cnt - 1) / MAX_REFS_BLOCK_PER_IMAGE + 1;
|
| assert(pic != NULL && pic->argb != NULL);
|
|
|
| enc->use_palette_ =
|
| @@ -158,7 +160,7 @@ static int VP8LEncAnalyze(VP8LEncoder* const enc, WebPImageHint image_hint) {
|
| enc->use_cross_color_ = 1;
|
| } else {
|
| double non_pred_entropy, pred_entropy;
|
| - if (!AnalyzeEntropy(pic->argb, pic->width, pic->height, pic->argb_stride,
|
| + if (!AnalyzeEntropy(pic->argb, width, height, pic->argb_stride,
|
| &non_pred_entropy, &pred_entropy)) {
|
| return 0;
|
| }
|
| @@ -168,27 +170,38 @@ static int VP8LEncAnalyze(VP8LEncoder* const enc, WebPImageHint image_hint) {
|
| }
|
| }
|
| }
|
| + if (!VP8LHashChainInit(&enc->hash_chain_, pix_cnt)) return 0;
|
| +
|
| + // palette-friendly input typically uses less literals
|
| + // -> reduce block size a bit
|
| + if (enc->use_palette_) refs_block_size /= 2;
|
| + VP8LBackwardRefsInit(&enc->refs_[0], refs_block_size);
|
| + VP8LBackwardRefsInit(&enc->refs_[1], refs_block_size);
|
|
|
| return 1;
|
| }
|
|
|
| +// Returns false in case of memory error.
|
| static int GetHuffBitLengthsAndCodes(
|
| const VP8LHistogramSet* const histogram_image,
|
| HuffmanTreeCode* const huffman_codes) {
|
| int i, k;
|
| - int ok = 1;
|
| + int ok = 0;
|
| uint64_t total_length_size = 0;
|
| uint8_t* mem_buf = NULL;
|
| const int histogram_image_size = histogram_image->size;
|
| + int max_num_symbols = 0;
|
| + uint8_t* buf_rle = NULL;
|
| + HuffmanTree* huff_tree = NULL;
|
|
|
| // Iterate over all histograms and get the aggregate number of codes used.
|
| for (i = 0; i < histogram_image_size; ++i) {
|
| const VP8LHistogram* const histo = histogram_image->histograms[i];
|
| HuffmanTreeCode* const codes = &huffman_codes[5 * i];
|
| for (k = 0; k < 5; ++k) {
|
| - const int num_symbols = (k == 0) ? VP8LHistogramNumCodes(histo)
|
| - : (k == 4) ? NUM_DISTANCE_CODES
|
| - : 256;
|
| + const int num_symbols =
|
| + (k == 0) ? VP8LHistogramNumCodes(histo->palette_code_bits_) :
|
| + (k == 4) ? NUM_DISTANCE_CODES : 256;
|
| codes[k].num_symbols = num_symbols;
|
| total_length_size += num_symbols;
|
| }
|
| @@ -200,10 +213,8 @@ static int GetHuffBitLengthsAndCodes(
|
| uint8_t* lengths;
|
| mem_buf = (uint8_t*)WebPSafeCalloc(total_length_size,
|
| sizeof(*lengths) + sizeof(*codes));
|
| - if (mem_buf == NULL) {
|
| - ok = 0;
|
| - goto End;
|
| - }
|
| + if (mem_buf == NULL) goto End;
|
| +
|
| codes = (uint16_t*)mem_buf;
|
| lengths = (uint8_t*)&codes[total_length_size];
|
| for (i = 0; i < 5 * histogram_image_size; ++i) {
|
| @@ -212,24 +223,33 @@ static int GetHuffBitLengthsAndCodes(
|
| huffman_codes[i].code_lengths = lengths;
|
| codes += bit_length;
|
| lengths += bit_length;
|
| + if (max_num_symbols < bit_length) {
|
| + max_num_symbols = bit_length;
|
| + }
|
| }
|
| }
|
|
|
| + buf_rle = (uint8_t*)WebPSafeMalloc(1ULL, max_num_symbols);
|
| + huff_tree = (HuffmanTree*)WebPSafeMalloc(3ULL * max_num_symbols,
|
| + sizeof(*huff_tree));
|
| + if (buf_rle == NULL || huff_tree == NULL) goto End;
|
| +
|
| // Create Huffman trees.
|
| - for (i = 0; ok && (i < histogram_image_size); ++i) {
|
| + for (i = 0; i < histogram_image_size; ++i) {
|
| HuffmanTreeCode* const codes = &huffman_codes[5 * i];
|
| VP8LHistogram* const histo = histogram_image->histograms[i];
|
| - ok = ok && VP8LCreateHuffmanTree(histo->literal_, 15, codes + 0);
|
| - ok = ok && VP8LCreateHuffmanTree(histo->red_, 15, codes + 1);
|
| - ok = ok && VP8LCreateHuffmanTree(histo->blue_, 15, codes + 2);
|
| - ok = ok && VP8LCreateHuffmanTree(histo->alpha_, 15, codes + 3);
|
| - ok = ok && VP8LCreateHuffmanTree(histo->distance_, 15, codes + 4);
|
| + VP8LCreateHuffmanTree(histo->literal_, 15, buf_rle, huff_tree, codes + 0);
|
| + VP8LCreateHuffmanTree(histo->red_, 15, buf_rle, huff_tree, codes + 1);
|
| + VP8LCreateHuffmanTree(histo->blue_, 15, buf_rle, huff_tree, codes + 2);
|
| + VP8LCreateHuffmanTree(histo->alpha_, 15, buf_rle, huff_tree, codes + 3);
|
| + VP8LCreateHuffmanTree(histo->distance_, 15, buf_rle, huff_tree, codes + 4);
|
| }
|
| -
|
| + ok = 1;
|
| End:
|
| + WebPSafeFree(huff_tree);
|
| + WebPSafeFree(buf_rle);
|
| if (!ok) {
|
| - free(mem_buf);
|
| - // If one VP8LCreateHuffmanTree() above fails, we need to clean up behind.
|
| + WebPSafeFree(mem_buf);
|
| memset(huffman_codes, 0, 5 * histogram_image_size * sizeof(*huffman_codes));
|
| }
|
| return ok;
|
| @@ -296,18 +316,16 @@ static void StoreHuffmanTreeToBitMask(
|
| }
|
| }
|
|
|
| -static int StoreFullHuffmanCode(VP8LBitWriter* const bw,
|
| - const HuffmanTreeCode* const tree) {
|
| - int ok = 0;
|
| +// 'huff_tree' and 'tokens' are pre-alloacted buffers.
|
| +static void StoreFullHuffmanCode(VP8LBitWriter* const bw,
|
| + HuffmanTree* const huff_tree,
|
| + HuffmanTreeToken* const tokens,
|
| + const HuffmanTreeCode* const tree) {
|
| uint8_t code_length_bitdepth[CODE_LENGTH_CODES] = { 0 };
|
| uint16_t code_length_bitdepth_symbols[CODE_LENGTH_CODES] = { 0 };
|
| const int max_tokens = tree->num_symbols;
|
| int num_tokens;
|
| HuffmanTreeCode huffman_code;
|
| - HuffmanTreeToken* const tokens =
|
| - (HuffmanTreeToken*)WebPSafeMalloc((uint64_t)max_tokens, sizeof(*tokens));
|
| - if (tokens == NULL) return 0;
|
| -
|
| huffman_code.num_symbols = CODE_LENGTH_CODES;
|
| huffman_code.code_lengths = code_length_bitdepth;
|
| huffman_code.codes = code_length_bitdepth_symbols;
|
| @@ -315,15 +333,14 @@ static int StoreFullHuffmanCode(VP8LBitWriter* const bw,
|
| VP8LWriteBits(bw, 1, 0);
|
| num_tokens = VP8LCreateCompressedHuffmanTree(tree, tokens, max_tokens);
|
| {
|
| - int histogram[CODE_LENGTH_CODES] = { 0 };
|
| + uint32_t histogram[CODE_LENGTH_CODES] = { 0 };
|
| + uint8_t buf_rle[CODE_LENGTH_CODES] = { 0 };
|
| int i;
|
| for (i = 0; i < num_tokens; ++i) {
|
| ++histogram[tokens[i].code];
|
| }
|
|
|
| - if (!VP8LCreateHuffmanTree(histogram, 7, &huffman_code)) {
|
| - goto End;
|
| - }
|
| + VP8LCreateHuffmanTree(histogram, 7, buf_rle, huff_tree, &huffman_code);
|
| }
|
|
|
| StoreHuffmanTreeOfHuffmanTreeToBitMask(bw, code_length_bitdepth);
|
| @@ -360,14 +377,13 @@ static int StoreFullHuffmanCode(VP8LBitWriter* const bw,
|
| }
|
| StoreHuffmanTreeToBitMask(bw, tokens, length, &huffman_code);
|
| }
|
| - ok = 1;
|
| - End:
|
| - free(tokens);
|
| - return ok;
|
| }
|
|
|
| -static int StoreHuffmanCode(VP8LBitWriter* const bw,
|
| - const HuffmanTreeCode* const huffman_code) {
|
| +// 'huff_tree' and 'tokens' are pre-alloacted buffers.
|
| +static void StoreHuffmanCode(VP8LBitWriter* const bw,
|
| + HuffmanTree* const huff_tree,
|
| + HuffmanTreeToken* const tokens,
|
| + const HuffmanTreeCode* const huffman_code) {
|
| int i;
|
| int count = 0;
|
| int symbols[2] = { 0, 0 };
|
| @@ -385,7 +401,6 @@ static int StoreHuffmanCode(VP8LBitWriter* const bw,
|
| if (count == 0) { // emit minimal tree for empty cases
|
| // bits: small tree marker: 1, count-1: 0, large 8-bit code: 0, code: 0
|
| VP8LWriteBits(bw, 4, 0x01);
|
| - return 1;
|
| } else if (count <= 2 && symbols[0] < kMaxSymbol && symbols[1] < kMaxSymbol) {
|
| VP8LWriteBits(bw, 1, 1); // Small tree marker to encode 1 or 2 symbols.
|
| VP8LWriteBits(bw, 1, count - 1);
|
| @@ -399,9 +414,8 @@ static int StoreHuffmanCode(VP8LBitWriter* const bw,
|
| if (count == 2) {
|
| VP8LWriteBits(bw, 8, symbols[1]);
|
| }
|
| - return 1;
|
| } else {
|
| - return StoreFullHuffmanCode(bw, huffman_code);
|
| + StoreFullHuffmanCode(bw, huff_tree, tokens, huffman_code);
|
| }
|
| }
|
|
|
| @@ -413,18 +427,18 @@ static void WriteHuffmanCode(VP8LBitWriter* const bw,
|
| VP8LWriteBits(bw, depth, symbol);
|
| }
|
|
|
| -static void StoreImageToBitMask(
|
| +static WebPEncodingError StoreImageToBitMask(
|
| VP8LBitWriter* const bw, int width, int histo_bits,
|
| - const VP8LBackwardRefs* const refs,
|
| + VP8LBackwardRefs* const refs,
|
| const uint16_t* histogram_symbols,
|
| const HuffmanTreeCode* const huffman_codes) {
|
| // x and y trace the position in the image.
|
| int x = 0;
|
| int y = 0;
|
| const int histo_xsize = histo_bits ? VP8LSubSampleSize(width, histo_bits) : 1;
|
| - int i;
|
| - for (i = 0; i < refs->size; ++i) {
|
| - const PixOrCopy* const v = &refs->refs[i];
|
| + VP8LRefsCursor c = VP8LRefsCursorInit(refs);
|
| + while (VP8LRefsCursorOk(&c)) {
|
| + const PixOrCopy* const v = c.cur_pos;
|
| const int histogram_ix = histogram_symbols[histo_bits ?
|
| (y >> histo_bits) * histo_xsize +
|
| (x >> histo_bits) : 0];
|
| @@ -458,88 +472,128 @@ static void StoreImageToBitMask(
|
| x -= width;
|
| ++y;
|
| }
|
| + VP8LRefsCursorNext(&c);
|
| }
|
| + return bw->error_ ? VP8_ENC_ERROR_OUT_OF_MEMORY : VP8_ENC_OK;
|
| }
|
|
|
| // Special case of EncodeImageInternal() for cache-bits=0, histo_bits=31
|
| -static int EncodeImageNoHuffman(VP8LBitWriter* const bw,
|
| - const uint32_t* const argb,
|
| - int width, int height, int quality) {
|
| +static WebPEncodingError EncodeImageNoHuffman(VP8LBitWriter* const bw,
|
| + const uint32_t* const argb,
|
| + VP8LHashChain* const hash_chain,
|
| + VP8LBackwardRefs refs_array[2],
|
| + int width, int height,
|
| + int quality) {
|
| int i;
|
| - int ok = 0;
|
| - VP8LBackwardRefs refs;
|
| + int max_tokens = 0;
|
| + WebPEncodingError err = VP8_ENC_OK;
|
| + VP8LBackwardRefs* refs;
|
| + HuffmanTreeToken* tokens = NULL;
|
| HuffmanTreeCode huffman_codes[5] = { { 0, NULL, NULL } };
|
| const uint16_t histogram_symbols[1] = { 0 }; // only one tree, one symbol
|
| VP8LHistogramSet* const histogram_image = VP8LAllocateHistogramSet(1, 0);
|
| - if (histogram_image == NULL) return 0;
|
| + HuffmanTree* const huff_tree = (HuffmanTree*)WebPSafeMalloc(
|
| + 3ULL * CODE_LENGTH_CODES, sizeof(*huff_tree));
|
| + if (histogram_image == NULL || huff_tree == NULL) {
|
| + err = VP8_ENC_ERROR_OUT_OF_MEMORY;
|
| + goto Error;
|
| + }
|
|
|
| // Calculate backward references from ARGB image.
|
| - if (!VP8LGetBackwardReferences(width, height, argb, quality, 0, 1, &refs)) {
|
| + refs = VP8LGetBackwardReferences(width, height, argb, quality, 0, 1,
|
| + hash_chain, refs_array);
|
| + if (refs == NULL) {
|
| + err = VP8_ENC_ERROR_OUT_OF_MEMORY;
|
| goto Error;
|
| }
|
| // Build histogram image and symbols from backward references.
|
| - VP8LHistogramStoreRefs(&refs, histogram_image->histograms[0]);
|
| + VP8LHistogramStoreRefs(refs, histogram_image->histograms[0]);
|
|
|
| // Create Huffman bit lengths and codes for each histogram image.
|
| assert(histogram_image->size == 1);
|
| if (!GetHuffBitLengthsAndCodes(histogram_image, huffman_codes)) {
|
| + err = VP8_ENC_ERROR_OUT_OF_MEMORY;
|
| goto Error;
|
| }
|
|
|
| // No color cache, no Huffman image.
|
| VP8LWriteBits(bw, 1, 0);
|
|
|
| - // Store Huffman codes.
|
| + // Find maximum number of symbols for the huffman tree-set.
|
| for (i = 0; i < 5; ++i) {
|
| HuffmanTreeCode* const codes = &huffman_codes[i];
|
| - if (!StoreHuffmanCode(bw, codes)) {
|
| - goto Error;
|
| + if (max_tokens < codes->num_symbols) {
|
| + max_tokens = codes->num_symbols;
|
| }
|
| + }
|
| +
|
| + tokens = (HuffmanTreeToken*)WebPSafeMalloc(max_tokens, sizeof(*tokens));
|
| + if (tokens == NULL) {
|
| + err = VP8_ENC_ERROR_OUT_OF_MEMORY;
|
| + goto Error;
|
| + }
|
| +
|
| + // Store Huffman codes.
|
| + for (i = 0; i < 5; ++i) {
|
| + HuffmanTreeCode* const codes = &huffman_codes[i];
|
| + StoreHuffmanCode(bw, huff_tree, tokens, codes);
|
| ClearHuffmanTreeIfOnlyOneSymbol(codes);
|
| }
|
|
|
| // Store actual literals.
|
| - StoreImageToBitMask(bw, width, 0, &refs, histogram_symbols, huffman_codes);
|
| - ok = 1;
|
| + err = StoreImageToBitMask(bw, width, 0, refs, histogram_symbols,
|
| + huffman_codes);
|
|
|
| Error:
|
| - free(histogram_image);
|
| - VP8LClearBackwardRefs(&refs);
|
| - free(huffman_codes[0].codes);
|
| - return ok;
|
| + WebPSafeFree(tokens);
|
| + WebPSafeFree(huff_tree);
|
| + VP8LFreeHistogramSet(histogram_image);
|
| + WebPSafeFree(huffman_codes[0].codes);
|
| + return err;
|
| }
|
|
|
| -static int EncodeImageInternal(VP8LBitWriter* const bw,
|
| - const uint32_t* const argb,
|
| - int width, int height, int quality,
|
| - int cache_bits, int histogram_bits) {
|
| - int ok = 0;
|
| +static WebPEncodingError EncodeImageInternal(VP8LBitWriter* const bw,
|
| + const uint32_t* const argb,
|
| + VP8LHashChain* const hash_chain,
|
| + VP8LBackwardRefs refs_array[2],
|
| + int width, int height, int quality,
|
| + int cache_bits,
|
| + int histogram_bits) {
|
| + WebPEncodingError err = VP8_ENC_OK;
|
| const int use_2d_locality = 1;
|
| const int use_color_cache = (cache_bits > 0);
|
| const uint32_t histogram_image_xysize =
|
| VP8LSubSampleSize(width, histogram_bits) *
|
| VP8LSubSampleSize(height, histogram_bits);
|
| VP8LHistogramSet* histogram_image =
|
| - VP8LAllocateHistogramSet(histogram_image_xysize, 0);
|
| + VP8LAllocateHistogramSet(histogram_image_xysize, cache_bits);
|
| int histogram_image_size = 0;
|
| size_t bit_array_size = 0;
|
| + HuffmanTree* huff_tree = NULL;
|
| + HuffmanTreeToken* tokens = NULL;
|
| HuffmanTreeCode* huffman_codes = NULL;
|
| VP8LBackwardRefs refs;
|
| + VP8LBackwardRefs* best_refs;
|
| uint16_t* const histogram_symbols =
|
| - (uint16_t*)WebPSafeMalloc((uint64_t)histogram_image_xysize,
|
| + (uint16_t*)WebPSafeMalloc(histogram_image_xysize,
|
| sizeof(*histogram_symbols));
|
| assert(histogram_bits >= MIN_HUFFMAN_BITS);
|
| assert(histogram_bits <= MAX_HUFFMAN_BITS);
|
|
|
| + VP8LBackwardRefsInit(&refs, refs_array[0].block_size_);
|
| if (histogram_image == NULL || histogram_symbols == NULL) {
|
| - free(histogram_image);
|
| - free(histogram_symbols);
|
| + VP8LFreeHistogramSet(histogram_image);
|
| + WebPSafeFree(histogram_symbols);
|
| return 0;
|
| }
|
|
|
| + // 'best_refs' is the reference to the best backward refs and points to one
|
| + // of refs_array[0] or refs_array[1].
|
| // Calculate backward references from ARGB image.
|
| - if (!VP8LGetBackwardReferences(width, height, argb, quality, cache_bits,
|
| - use_2d_locality, &refs)) {
|
| + best_refs = VP8LGetBackwardReferences(width, height, argb, quality,
|
| + cache_bits, use_2d_locality,
|
| + hash_chain, refs_array);
|
| + if (best_refs == NULL || !VP8LBackwardRefsCopy(best_refs, &refs)) {
|
| goto Error;
|
| }
|
| // Build histogram image and symbols from backward references.
|
| @@ -559,7 +613,7 @@ static int EncodeImageInternal(VP8LBitWriter* const bw,
|
| goto Error;
|
| }
|
| // Free combined histograms.
|
| - free(histogram_image);
|
| + VP8LFreeHistogramSet(histogram_image);
|
| histogram_image = NULL;
|
|
|
| // Color Cache parameters.
|
| @@ -574,7 +628,7 @@ static int EncodeImageInternal(VP8LBitWriter* const bw,
|
| VP8LWriteBits(bw, 1, write_histogram_image);
|
| if (write_histogram_image) {
|
| uint32_t* const histogram_argb =
|
| - (uint32_t*)WebPSafeMalloc((uint64_t)histogram_image_xysize,
|
| + (uint32_t*)WebPSafeMalloc(histogram_image_xysize,
|
| sizeof(*histogram_argb));
|
| int max_index = 0;
|
| uint32_t i;
|
| @@ -589,40 +643,54 @@ static int EncodeImageInternal(VP8LBitWriter* const bw,
|
| histogram_image_size = max_index;
|
|
|
| VP8LWriteBits(bw, 3, histogram_bits - 2);
|
| - ok = EncodeImageNoHuffman(bw, histogram_argb,
|
| - VP8LSubSampleSize(width, histogram_bits),
|
| - VP8LSubSampleSize(height, histogram_bits),
|
| - quality);
|
| - free(histogram_argb);
|
| - if (!ok) goto Error;
|
| + err = EncodeImageNoHuffman(bw, histogram_argb, hash_chain, refs_array,
|
| + VP8LSubSampleSize(width, histogram_bits),
|
| + VP8LSubSampleSize(height, histogram_bits),
|
| + quality);
|
| + WebPSafeFree(histogram_argb);
|
| + if (err != VP8_ENC_OK) goto Error;
|
| }
|
| }
|
|
|
| // Store Huffman codes.
|
| {
|
| int i;
|
| + int max_tokens = 0;
|
| + huff_tree = (HuffmanTree*)WebPSafeMalloc(3ULL * CODE_LENGTH_CODES,
|
| + sizeof(*huff_tree));
|
| + if (huff_tree == NULL) goto Error;
|
| + // Find maximum number of symbols for the huffman tree-set.
|
| + for (i = 0; i < 5 * histogram_image_size; ++i) {
|
| + HuffmanTreeCode* const codes = &huffman_codes[i];
|
| + if (max_tokens < codes->num_symbols) {
|
| + max_tokens = codes->num_symbols;
|
| + }
|
| + }
|
| + tokens = (HuffmanTreeToken*)WebPSafeMalloc(max_tokens,
|
| + sizeof(*tokens));
|
| + if (tokens == NULL) goto Error;
|
| for (i = 0; i < 5 * histogram_image_size; ++i) {
|
| HuffmanTreeCode* const codes = &huffman_codes[i];
|
| - if (!StoreHuffmanCode(bw, codes)) goto Error;
|
| + StoreHuffmanCode(bw, huff_tree, tokens, codes);
|
| ClearHuffmanTreeIfOnlyOneSymbol(codes);
|
| }
|
| }
|
|
|
| // Store actual literals.
|
| - StoreImageToBitMask(bw, width, histogram_bits, &refs,
|
| - histogram_symbols, huffman_codes);
|
| - ok = 1;
|
| + err = StoreImageToBitMask(bw, width, histogram_bits, &refs,
|
| + histogram_symbols, huffman_codes);
|
|
|
| Error:
|
| - free(histogram_image);
|
| -
|
| - VP8LClearBackwardRefs(&refs);
|
| + WebPSafeFree(tokens);
|
| + WebPSafeFree(huff_tree);
|
| + VP8LFreeHistogramSet(histogram_image);
|
| + VP8LBackwardRefsClear(&refs);
|
| if (huffman_codes != NULL) {
|
| - free(huffman_codes->codes);
|
| - free(huffman_codes);
|
| + WebPSafeFree(huffman_codes->codes);
|
| + WebPSafeFree(huffman_codes);
|
| }
|
| - free(histogram_symbols);
|
| - return ok;
|
| + WebPSafeFree(histogram_symbols);
|
| + return err;
|
| }
|
|
|
| // -----------------------------------------------------------------------------
|
| @@ -630,17 +698,16 @@ static int EncodeImageInternal(VP8LBitWriter* const bw,
|
|
|
| // Check if it would be a good idea to subtract green from red and blue. We
|
| // only impact entropy in red/blue components, don't bother to look at others.
|
| -static int EvalAndApplySubtractGreen(VP8LEncoder* const enc,
|
| - int width, int height,
|
| - VP8LBitWriter* const bw) {
|
| +static WebPEncodingError EvalAndApplySubtractGreen(VP8LEncoder* const enc,
|
| + int width, int height,
|
| + VP8LBitWriter* const bw) {
|
| if (!enc->use_palette_) {
|
| int i;
|
| const uint32_t* const argb = enc->argb_;
|
| double bit_cost_before, bit_cost_after;
|
| - VP8LHistogram* const histo = (VP8LHistogram*)malloc(sizeof(*histo));
|
| - if (histo == NULL) return 0;
|
| -
|
| - VP8LHistogramInit(histo, 1);
|
| + // Allocate histogram with cache_bits = 1.
|
| + VP8LHistogram* const histo = VP8LAllocateHistogram(1);
|
| + if (histo == NULL) return VP8_ENC_ERROR_OUT_OF_MEMORY;
|
| for (i = 0; i < width * height; ++i) {
|
| const uint32_t c = argb[i];
|
| ++histo->red_[(c >> 16) & 0xff];
|
| @@ -656,7 +723,7 @@ static int EvalAndApplySubtractGreen(VP8LEncoder* const enc,
|
| ++histo->blue_[((c >> 0) - green) & 0xff];
|
| }
|
| bit_cost_after = VP8LHistogramEstimateBits(histo);
|
| - free(histo);
|
| + VP8LFreeHistogram(histo);
|
|
|
| // Check if subtracting green yields low entropy.
|
| enc->use_subtract_green_ = (bit_cost_after < bit_cost_before);
|
| @@ -666,12 +733,12 @@ static int EvalAndApplySubtractGreen(VP8LEncoder* const enc,
|
| VP8LSubtractGreenFromBlueAndRed(enc->argb_, width * height);
|
| }
|
| }
|
| - return 1;
|
| + return VP8_ENC_OK;
|
| }
|
|
|
| -static int ApplyPredictFilter(const VP8LEncoder* const enc,
|
| - int width, int height, int quality,
|
| - VP8LBitWriter* const bw) {
|
| +static WebPEncodingError ApplyPredictFilter(const VP8LEncoder* const enc,
|
| + int width, int height, int quality,
|
| + VP8LBitWriter* const bw) {
|
| const int pred_bits = enc->transform_bits_;
|
| const int transform_width = VP8LSubSampleSize(width, pred_bits);
|
| const int transform_height = VP8LSubSampleSize(height, pred_bits);
|
| @@ -682,32 +749,32 @@ static int ApplyPredictFilter(const VP8LEncoder* const enc,
|
| VP8LWriteBits(bw, 2, PREDICTOR_TRANSFORM);
|
| assert(pred_bits >= 2);
|
| VP8LWriteBits(bw, 3, pred_bits - 2);
|
| - if (!EncodeImageNoHuffman(bw, enc->transform_data_,
|
| - transform_width, transform_height, quality)) {
|
| - return 0;
|
| - }
|
| - return 1;
|
| + return EncodeImageNoHuffman(bw, enc->transform_data_,
|
| + (VP8LHashChain*)&enc->hash_chain_,
|
| + (VP8LBackwardRefs*)enc->refs_, // cast const away
|
| + transform_width, transform_height,
|
| + quality);
|
| }
|
|
|
| -static int ApplyCrossColorFilter(const VP8LEncoder* const enc,
|
| - int width, int height, int quality,
|
| - VP8LBitWriter* const bw) {
|
| +static WebPEncodingError ApplyCrossColorFilter(const VP8LEncoder* const enc,
|
| + int width, int height,
|
| + int quality,
|
| + VP8LBitWriter* const bw) {
|
| const int ccolor_transform_bits = enc->transform_bits_;
|
| const int transform_width = VP8LSubSampleSize(width, ccolor_transform_bits);
|
| const int transform_height = VP8LSubSampleSize(height, ccolor_transform_bits);
|
| - const int step = (quality < 25) ? 32 : (quality > 50) ? 8 : 16;
|
|
|
| - VP8LColorSpaceTransform(width, height, ccolor_transform_bits, step,
|
| + VP8LColorSpaceTransform(width, height, ccolor_transform_bits, quality,
|
| enc->argb_, enc->transform_data_);
|
| VP8LWriteBits(bw, 1, TRANSFORM_PRESENT);
|
| VP8LWriteBits(bw, 2, CROSS_COLOR_TRANSFORM);
|
| assert(ccolor_transform_bits >= 2);
|
| VP8LWriteBits(bw, 3, ccolor_transform_bits - 2);
|
| - if (!EncodeImageNoHuffman(bw, enc->transform_data_,
|
| - transform_width, transform_height, quality)) {
|
| - return 0;
|
| - }
|
| - return 1;
|
| + return EncodeImageNoHuffman(bw, enc->transform_data_,
|
| + (VP8LHashChain*)&enc->hash_chain_,
|
| + (VP8LBackwardRefs*)enc->refs_, // cast const away
|
| + transform_width, transform_height,
|
| + quality);
|
| }
|
|
|
| // -----------------------------------------------------------------------------
|
| @@ -785,11 +852,11 @@ static WebPEncodingError AllocateTransformBuffer(VP8LEncoder* const enc,
|
| const int tile_size = 1 << enc->transform_bits_;
|
| const uint64_t image_size = width * height;
|
| const uint64_t argb_scratch_size = tile_size * width + width;
|
| - const uint64_t transform_data_size =
|
| - (uint64_t)VP8LSubSampleSize(width, enc->transform_bits_) *
|
| - (uint64_t)VP8LSubSampleSize(height, enc->transform_bits_);
|
| + const int transform_data_size =
|
| + VP8LSubSampleSize(width, enc->transform_bits_) *
|
| + VP8LSubSampleSize(height, enc->transform_bits_);
|
| const uint64_t total_size =
|
| - image_size + argb_scratch_size + transform_data_size;
|
| + image_size + argb_scratch_size + (uint64_t)transform_data_size;
|
| uint32_t* mem = (uint32_t*)WebPSafeMalloc(total_size, sizeof(*mem));
|
| if (mem == NULL) {
|
| err = VP8_ENC_ERROR_OUT_OF_MEMORY;
|
| @@ -888,7 +955,7 @@ static WebPEncodingError EncodePalette(VP8LBitWriter* const bw,
|
| if (err != VP8_ENC_OK) goto Error;
|
| dst = enc->argb_;
|
|
|
| - row = (uint8_t*)WebPSafeMalloc((uint64_t)width, sizeof(*row));
|
| + row = (uint8_t*)WebPSafeMalloc(width, sizeof(*row));
|
| if (row == NULL) return VP8_ENC_ERROR_OUT_OF_MEMORY;
|
|
|
| ApplyPalette(src, dst, pic->argb_stride, enc->current_width_,
|
| @@ -902,42 +969,48 @@ static WebPEncodingError EncodePalette(VP8LBitWriter* const bw,
|
| for (i = palette_size - 1; i >= 1; --i) {
|
| palette[i] = VP8LSubPixels(palette[i], palette[i - 1]);
|
| }
|
| - if (!EncodeImageNoHuffman(bw, palette, palette_size, 1, quality)) {
|
| - err = VP8_ENC_ERROR_INVALID_CONFIGURATION;
|
| - goto Error;
|
| - }
|
| + err = EncodeImageNoHuffman(bw, palette, &enc->hash_chain_, enc->refs_,
|
| + palette_size, 1, quality);
|
|
|
| Error:
|
| - free(row);
|
| + WebPSafeFree(row);
|
| return err;
|
| }
|
|
|
| // -----------------------------------------------------------------------------
|
|
|
| static int GetHistoBits(int method, int use_palette, int width, int height) {
|
| - const uint64_t hist_size = sizeof(VP8LHistogram);
|
| + const int hist_size = VP8LGetHistogramSize(MAX_COLOR_CACHE_BITS);
|
| // Make tile size a function of encoding method (Range: 0 to 6).
|
| int histo_bits = (use_palette ? 9 : 7) - method;
|
| while (1) {
|
| - const uint64_t huff_image_size = VP8LSubSampleSize(width, histo_bits) *
|
| - VP8LSubSampleSize(height, histo_bits) *
|
| - hist_size;
|
| - if (huff_image_size <= MAX_HUFF_IMAGE_SIZE) break;
|
| + const int huff_image_size = VP8LSubSampleSize(width, histo_bits) *
|
| + VP8LSubSampleSize(height, histo_bits);
|
| + if ((uint64_t)huff_image_size * hist_size <= MAX_HUFF_IMAGE_SIZE) break;
|
| ++histo_bits;
|
| }
|
| return (histo_bits < MIN_HUFFMAN_BITS) ? MIN_HUFFMAN_BITS :
|
| (histo_bits > MAX_HUFFMAN_BITS) ? MAX_HUFFMAN_BITS : histo_bits;
|
| }
|
|
|
| +static int GetTransformBits(int method, int histo_bits) {
|
| + const int max_transform_bits = (method < 4) ? 6 : (method > 4) ? 4 : 5;
|
| + return (histo_bits > max_transform_bits) ? max_transform_bits : histo_bits;
|
| +}
|
| +
|
| +static int GetCacheBits(float quality) {
|
| + return (quality <= 25.f) ? 0 : 7;
|
| +}
|
| +
|
| static void FinishEncParams(VP8LEncoder* const enc) {
|
| const WebPConfig* const config = enc->config_;
|
| const WebPPicture* const pic = enc->pic_;
|
| const int method = config->method;
|
| const float quality = config->quality;
|
| const int use_palette = enc->use_palette_;
|
| - enc->transform_bits_ = (method < 4) ? 5 : (method > 4) ? 3 : 4;
|
| enc->histo_bits_ = GetHistoBits(method, use_palette, pic->width, pic->height);
|
| - enc->cache_bits_ = (quality <= 25.f) ? 0 : 7;
|
| + enc->transform_bits_ = GetTransformBits(method, enc->histo_bits_);
|
| + enc->cache_bits_ = GetCacheBits(quality);
|
| }
|
|
|
| // -----------------------------------------------------------------------------
|
| @@ -945,7 +1018,7 @@ static void FinishEncParams(VP8LEncoder* const enc) {
|
|
|
| static VP8LEncoder* VP8LEncoderNew(const WebPConfig* const config,
|
| const WebPPicture* const picture) {
|
| - VP8LEncoder* const enc = (VP8LEncoder*)calloc(1, sizeof(*enc));
|
| + VP8LEncoder* const enc = (VP8LEncoder*)WebPSafeCalloc(1ULL, sizeof(*enc));
|
| if (enc == NULL) {
|
| WebPEncodingSetError(picture, VP8_ENC_ERROR_OUT_OF_MEMORY);
|
| return NULL;
|
| @@ -959,8 +1032,13 @@ static VP8LEncoder* VP8LEncoderNew(const WebPConfig* const config,
|
| }
|
|
|
| static void VP8LEncoderDelete(VP8LEncoder* enc) {
|
| - free(enc->argb_);
|
| - free(enc);
|
| + if (enc != NULL) {
|
| + VP8LHashChainClear(&enc->hash_chain_);
|
| + VP8LBackwardRefsClear(&enc->refs_[0]);
|
| + VP8LBackwardRefsClear(&enc->refs_[1]);
|
| + WebPSafeFree(enc->argb_);
|
| + WebPSafeFree(enc);
|
| + }
|
| }
|
|
|
| // -----------------------------------------------------------------------------
|
| @@ -984,7 +1062,7 @@ WebPEncodingError VP8LEncodeStream(const WebPConfig* const config,
|
| // ---------------------------------------------------------------------------
|
| // Analyze image (entropy, num_palettes etc)
|
|
|
| - if (!VP8LEncAnalyze(enc, config->image_hint)) {
|
| + if (!AnalyzeAndInit(enc, config->image_hint)) {
|
| err = VP8_ENC_ERROR_OUT_OF_MEMORY;
|
| goto Error;
|
| }
|
| @@ -1014,23 +1092,17 @@ WebPEncodingError VP8LEncodeStream(const WebPConfig* const config,
|
| // ---------------------------------------------------------------------------
|
| // Apply transforms and write transform data.
|
|
|
| - if (!EvalAndApplySubtractGreen(enc, enc->current_width_, height, bw)) {
|
| - err = VP8_ENC_ERROR_OUT_OF_MEMORY;
|
| - goto Error;
|
| - }
|
| + err = EvalAndApplySubtractGreen(enc, enc->current_width_, height, bw);
|
| + if (err != VP8_ENC_OK) goto Error;
|
|
|
| if (enc->use_predict_) {
|
| - if (!ApplyPredictFilter(enc, enc->current_width_, height, quality, bw)) {
|
| - err = VP8_ENC_ERROR_INVALID_CONFIGURATION;
|
| - goto Error;
|
| - }
|
| + err = ApplyPredictFilter(enc, enc->current_width_, height, quality, bw);
|
| + if (err != VP8_ENC_OK) goto Error;
|
| }
|
|
|
| if (enc->use_cross_color_) {
|
| - if (!ApplyCrossColorFilter(enc, enc->current_width_, height, quality, bw)) {
|
| - err = VP8_ENC_ERROR_INVALID_CONFIGURATION;
|
| - goto Error;
|
| - }
|
| + err = ApplyCrossColorFilter(enc, enc->current_width_, height, quality, bw);
|
| + if (err != VP8_ENC_OK) goto Error;
|
| }
|
|
|
| VP8LWriteBits(bw, 1, !TRANSFORM_PRESENT); // No more transforms.
|
| @@ -1040,8 +1112,9 @@ WebPEncodingError VP8LEncodeStream(const WebPConfig* const config,
|
|
|
| if (enc->cache_bits_ > 0) {
|
| if (!VP8LCalculateEstimateForCacheSize(enc->argb_, enc->current_width_,
|
| - height, &enc->cache_bits_)) {
|
| - err = VP8_ENC_ERROR_INVALID_CONFIGURATION;
|
| + height, quality, &enc->hash_chain_,
|
| + &enc->refs_[0], &enc->cache_bits_)) {
|
| + err = VP8_ENC_ERROR_OUT_OF_MEMORY;
|
| goto Error;
|
| }
|
| }
|
| @@ -1049,11 +1122,10 @@ WebPEncodingError VP8LEncodeStream(const WebPConfig* const config,
|
| // ---------------------------------------------------------------------------
|
| // Encode and write the transformed image.
|
|
|
| - if (!EncodeImageInternal(bw, enc->argb_, enc->current_width_, height,
|
| - quality, enc->cache_bits_, enc->histo_bits_)) {
|
| - err = VP8_ENC_ERROR_OUT_OF_MEMORY;
|
| - goto Error;
|
| - }
|
| + err = EncodeImageInternal(bw, enc->argb_, &enc->hash_chain_, enc->refs_,
|
| + enc->current_width_, height, quality,
|
| + enc->cache_bits_, enc->histo_bits_);
|
| + if (err != VP8_ENC_OK) goto Error;
|
|
|
| if (picture->stats != NULL) {
|
| WebPAuxStats* const stats = picture->stats;
|
| @@ -1080,6 +1152,7 @@ int VP8LEncodeImage(const WebPConfig* const config,
|
| int has_alpha;
|
| size_t coded_size;
|
| int percent = 0;
|
| + int initial_size;
|
| WebPEncodingError err = VP8_ENC_OK;
|
| VP8LBitWriter bw;
|
|
|
| @@ -1093,7 +1166,11 @@ int VP8LEncodeImage(const WebPConfig* const config,
|
|
|
| width = picture->width;
|
| height = picture->height;
|
| - if (!VP8LBitWriterInit(&bw, (width * height) >> 1)) {
|
| + // Initialize BitWriter with size corresponding to 16 bpp to photo images and
|
| + // 8 bpp for graphical images.
|
| + initial_size = (config->image_hint == WEBP_HINT_GRAPH) ?
|
| + width * height : width * height * 2;
|
| + if (!VP8LBitWriterInit(&bw, initial_size)) {
|
| err = VP8_ENC_ERROR_OUT_OF_MEMORY;
|
| goto Error;
|
| }
|
| @@ -1165,4 +1242,3 @@ int VP8LEncodeImage(const WebPConfig* const config,
|
| }
|
|
|
| //------------------------------------------------------------------------------
|
| -
|
|
|