mirror
/
brotli
mirror of https://github.com/andybalholm/brotli.git
1
0
Fork 1
Code Issues Packages Projects Releases Wiki Activity

Lift structs to higher scope 

Small performance improvement (27%) by re-using search result
structs. Likely the original C version relied on stack allocation here.
This commit is contained in:
Shane Hansen 2019-03-29 15:12:32 -07:00
parent 36f6c9721d
commit 94370e0b46
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
backward_references.go
View File

@ -57,11 +57,12 @@ func createBackwardReferences(num_bytes uint, position uint, ringbuffer []byte,
/* Minimum score to accept a backward reference. */ /* Minimum score to accept a backward reference. */
hasher.PrepareDistanceCache(dist_cache) hasher.PrepareDistanceCache(dist_cache)
var sr2 hasherSearchResult
var sr hasherSearchResult
for position+hasher.HashTypeLength() < pos_end { for position+hasher.HashTypeLength() < pos_end {
var max_length uint = pos_end - position var max_length uint = pos_end - position
var max_distance uint = brotli_min_size_t(position, max_backward_limit) var max_distance uint = brotli_min_size_t(position, max_backward_limit)
var sr hasherSearchResult
sr.len = 0 sr.len = 0
sr.len_code_delta = 0 sr.len_code_delta = 0
sr.distance = 0 sr.distance = 0
@ -73,7 +74,6 @@ func createBackwardReferences(num_bytes uint, position uint, ringbuffer []byte,
max_length-- max_length--
for ; ; max_length-- { for ; ; max_length-- {
var cost_diff_lazy uint = 175 var cost_diff_lazy uint = 175
var sr2 hasherSearchResult
if params.quality < minQualityForExtensiveReferenceSearch { if params.quality < minQualityForExtensiveReferenceSearch {
sr2.len = brotli_min_size_t(sr.len-1, max_length) sr2.len = brotli_min_size_t(sr.len-1, max_length)
} else { } else {