Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:good_for_rle (Results 1 - 3 of 3) sorted by null

/external/opencv3/3rdparty/libwebp/utils/
huffman_encode.c	32 uint8_t* good_for_rle; local 46 good_for_rle = (uint8_t*)calloc(length, 1); 47 if (good_for_rle == NULL) { 52 // Mark any seq of 0's that is longer as 5 as a good_for_rle. 53 // Mark any seq of non-0's that is longer as 7 as a good_for_rle. 62 good_for_rle[i - k - 1] = 1; 80 if (i == length || good_for_rle[i] || 81 (i != 0 && good_for_rle[i - 1]) || 122 free(good_for_rle);
/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 1174 milliseconds