HomeSort by relevance Sort by last modified time
    Searched refs:good_for_rle (Results 1 - 5 of 5) sorted by null

  /external/webp/src/utils/
huffman_encode_utils.c 31 static void OptimizeHuffmanForRle(int length, uint8_t* const good_for_rle,
48 // Mark any seq of 0's that is longer as 5 as a good_for_rle.
49 // Mark any seq of non-0's that is longer as 7 as a good_for_rle.
58 good_for_rle[i - k - 1] = 1;
76 if (i == length || good_for_rle[i] ||
77 (i != 0 && good_for_rle[i - 1]) ||
  /external/brotli/c/enc/
entropy_encode.c 243 uint8_t* good_for_rle) {
297 memset(good_for_rle, 0, length);
300 Mark any seq of 0's that is longer as 5 as a good_for_rle.
301 Mark any seq of non-0's that is longer as 7 as a good_for_rle. */
310 good_for_rle[i - k - 1] = 1;
328 if (i == length || good_for_rle[i] ||
329 (i != 0 && good_for_rle[i - 1]) ||
entropy_encode.h 61 good_for_rle is a buffer of at least length size */
63 size_t length, uint32_t* counts, uint8_t* good_for_rle);
metablock.c 504 uint8_t good_for_rle[BROTLI_NUM_COMMAND_SYMBOLS]; local
509 good_for_rle);
514 good_for_rle);
522 good_for_rle);
  /external/zopfli/src/zopfli/
deflate.c 384 int* good_for_rle; local
399 good_for_rle = (int*)malloc(length * sizeof(int));
400 for (i = 0; i < length; ++i) good_for_rle[i] = 0;
403 Mark any seq of 0's that is longer than 5 as a good_for_rle.
404 Mark any seq of non-0's that is longer than 7 as a good_for_rle.*/
411 good_for_rle[i - k - 1] = 1;
428 if (i == length || good_for_rle[i]
464 free(good_for_rle);

Completed in 190 milliseconds