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

  /external/chromium_org/third_party/brotli/src/brotli/enc/
entropy_encode.cc 249 uint8_t* good_for_rle; local
292 good_for_rle = (uint8_t*)calloc(length, 1);
293 if (good_for_rle == NULL) {
298 // Mark any seq of 0's that is longer as 5 as a good_for_rle.
299 // Mark any seq of non-0's that is longer as 7 as a good_for_rle.
308 good_for_rle[i - k - 1] = 1;
327 if (i == length || good_for_rle[i] ||
328 (i != 0 && good_for_rle[i - 1]) ||
370 free(good_for_rle);
  /external/chromium_org/third_party/libwebp/utils/
huffman_encode.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/webp/src/utils/
huffman_encode.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/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 119 milliseconds