Home
last modified time | relevance | path

Searched refs:block_bits_ (Results 1 - 4 of 4) sorted by relevance

/third_party/node/deps/brotli/c/enc/
H A Dhash_longest_match64_inc.h45 int block_bits_; member
69 self->block_bits_ = common->params.block_bits; in Initialize()
117 const size_t offset = minor_ix + (key << self->block_bits_); in Store()
222 uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_]; in FindLongestMatch()
H A Dhash_longest_match_inc.h42 int block_bits_; member
73 self->block_bits_ = common->params.block_bits; in Initialize()
113 const size_t offset = minor_ix + (key << self->block_bits_); in Store()
218 uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_]; in FindLongestMatch()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_longest_match_inc.h42 int block_bits_; member
73 self->block_bits_ = common->params.block_bits; in Initialize()
113 const size_t offset = minor_ix + (key << self->block_bits_); in Store()
218 uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_]; in FindLongestMatch()
H A Dhash_longest_match64_inc.h45 int block_bits_; member
69 self->block_bits_ = common->params.block_bits; in Initialize()
117 const size_t offset = minor_ix + (key << self->block_bits_); in Store()
222 uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_]; in FindLongestMatch()

Completed in 4 milliseconds