Home
last modified time | relevance | path

Searched refs:BUCKET_SWEEP (Results 1 – 2 of 2) sorted by relevance

/external/brotli/enc/
Dhash_longest_match_quickly_inc.h38 uint32_t buckets_[BUCKET_SIZE + BUCKET_SWEEP];
60 memset(&self->buckets_[key], 0, BUCKET_SWEEP * sizeof(self->buckets_[0])); in FN()
87 const uint32_t off = (ix >> 3) % BUCKET_SWEEP; in FN()
157 if (BUCKET_SWEEP == 1) { in FN()
166 if (BUCKET_SWEEP == 1) { in FN()
193 for (i = 0; i < BUCKET_SWEEP; ++i, prev_ix = *bucket++) { in FN()
225 self->buckets_[key + ((cur_ix >> 3) % BUCKET_SWEEP)] = (uint32_t)cur_ix; in FN()
Dhash.h263 #define BUCKET_SWEEP 1 macro
267 #undef BUCKET_SWEEP
272 #define BUCKET_SWEEP 2 macro
276 #undef BUCKET_SWEEP
282 #define BUCKET_SWEEP 4 macro
287 #undef BUCKET_SWEEP
331 #define BUCKET_SWEEP 4 macro
337 #undef BUCKET_SWEEP