Home
last modified time | relevance | path

Searched refs:BROTLI_PREDICT_TRUE (Results 1 – 7 of 7) sorted by relevance

/external/brotli/c/enc/
Dfind_match_length.h26 while (BROTLI_PREDICT_TRUE(--limit2)) { in FindMatchLengthWithLimit()
41 if (BROTLI_PREDICT_TRUE(s1[matched] == *s2)) { in FindMatchLengthWithLimit()
Dcompress_fragment.c494 if (BROTLI_PREDICT_TRUE(block_size >= kInputMarginBytes)) { in BrotliCompressFragmentFastImpl()
538 if (BROTLI_PREDICT_TRUE(candidate < ip)) { in BrotliCompressFragmentFastImpl()
548 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate))); in BrotliCompressFragmentFastImpl()
569 if (BROTLI_PREDICT_TRUE(insert < 6210)) { in BrotliCompressFragmentFastImpl()
683 if (BROTLI_PREDICT_TRUE(insert < 6210)) { in BrotliCompressFragmentFastImpl()
Dringbuffer.h137 if (BROTLI_PREDICT_TRUE(masked_pos + n <= rb->size_)) { in RingBufferWrite()
Dcompress_fragment_two_pass.c255 if (BROTLI_PREDICT_TRUE(block_size >= kInputMarginBytes)) { in CreateCommands()
300 if (BROTLI_PREDICT_TRUE(candidate < ip)) { in CreateCommands()
310 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate, min_match))); in CreateCommands()
Dbrotli_bit_stream.c445 if (BROTLI_PREDICT_TRUE(histogram[l] >= count_limit)) { in BrotliBuildAndStoreHuffmanTreeFast()
/external/brotli/c/common/
Dplatform.h82 #define BROTLI_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1)) macro
86 #define BROTLI_PREDICT_TRUE(x) (x) macro
/external/brotli/c/dec/
Ddecode.c418 if (BROTLI_PREDICT_TRUE(BrotliSafeGetBits(br, 15, &val))) { in SafeReadSymbol()