Virtualization
/
brotli
mirror of https://github.com/google/brotli
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

(compress_fragment_two_pass)

This commit is contained in:
Eugene Kliuchnikov 2016-10-18 16:56:39 +02:00
parent 69982c25f1
commit f5ba0b6c17
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
enc/compress_fragment_two_pass.c
View File

@ -252,7 +252,7 @@ static BROTLI_INLINE void CreateCommands(const uint8_t* input,
const size_t kInputMarginBytes = BROTLI_WINDOW_GAP; const size_t kInputMarginBytes = BROTLI_WINDOW_GAP;
const size_t kMinMatchLen = 6; const size_t kMinMatchLen = 6;
if (PREDICT_TRUE(block_size >= kInputMarginBytes)) { if (BROTLI_PREDICT_TRUE(block_size >= kInputMarginBytes)) {
/* For the last block, we need to keep a 16 bytes margin so that we can be /* For the last block, we need to keep a 16 bytes margin so that we can be
sure that all distances are at most window size - 16. sure that all distances are at most window size - 16.
For all other blocks, we only need to keep a margin of 5 bytes so that For all other blocks, we only need to keep a margin of 5 bytes so that
@ -291,13 +291,13 @@ trawl:
ip = next_ip; ip = next_ip;
assert(hash == Hash(ip, shift)); assert(hash == Hash(ip, shift));
next_ip = ip + bytes_between_hash_lookups; next_ip = ip + bytes_between_hash_lookups;
if (PREDICT_FALSE(next_ip > ip_limit)) { if (BROTLI_PREDICT_FALSE(next_ip > ip_limit)) {
goto emit_remainder; goto emit_remainder;
} }
next_hash = Hash(next_ip, shift); next_hash = Hash(next_ip, shift);
candidate = ip - last_distance; candidate = ip - last_distance;
if (IsMatch(ip, candidate)) { if (IsMatch(ip, candidate)) {
if (PREDICT_TRUE(candidate < ip)) { if (BROTLI_PREDICT_TRUE(candidate < ip)) {
table[hash] = (int)(ip - base_ip); table[hash] = (int)(ip - base_ip);
break; break;
} }
@ -307,7 +307,7 @@ trawl:
assert(candidate < ip); assert(candidate < ip);
table[hash] = (int)(ip - base_ip); table[hash] = (int)(ip - base_ip);
} while (PREDICT_TRUE(!IsMatch(ip, candidate))); } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate)));
/* Check copy distance. If candidate is not feasible, continue search. /* Check copy distance. If candidate is not feasible, continue search.
Checking is done outside of hot loop to reduce overhead. */ Checking is done outside of hot loop to reduce overhead. */
@ -341,7 +341,7 @@ trawl:
EmitCopyLenLastDistance(matched, commands); EmitCopyLenLastDistance(matched, commands);
next_emit = ip; next_emit = ip;
if (PREDICT_FALSE(ip >= ip_limit)) { if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {
goto emit_remainder; goto emit_remainder;
} }
{ {
@ -381,7 +381,7 @@ trawl:
EmitDistance((uint32_t)last_distance, commands); EmitDistance((uint32_t)last_distance, commands);
next_emit = ip; next_emit = ip;
if (PREDICT_FALSE(ip >= ip_limit)) { if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {
goto emit_remainder; goto emit_remainder;
} }
{ {