Searched refs:BUCKET_SIZE (Results 1 - 3 of 3) sorted by relevance

/xsrc/external/mit/brotli/dist/c/enc/
H A Dhash_forgetful_chain_inc.h23 #define BUCKET_SIZE (1 << BUCKET_BITS) macro
57 /* uint32_t addr[BUCKET_SIZE]; */
59 /* uint16_t head[BUCKET_SIZE]; */
72 return (uint16_t*)(&FN(Addr)(extra)[BUCKET_SIZE]);
76 return (uint8_t*)(&FN(Head)(extra)[BUCKET_SIZE]);
99 size_t partial_prepare_threshold = BUCKET_SIZE >> 6;
112 memset(addr, 0xCC, sizeof(uint32_t) * BUCKET_SIZE);
113 memset(head, 0, sizeof(uint16_t) * BUCKET_SIZE);
125 return sizeof(uint32_t) * BUCKET_SIZE + sizeof(uint16_t) * BUCKET_SIZE
[all...]
H A Dhash_longest_match_quickly_inc.h14 #define BUCKET_SIZE (1 << BUCKET_BITS) macro
15 #define BUCKET_MASK (BUCKET_SIZE - 1)
36 This is a hash map of fixed size (BUCKET_SIZE). */
43 uint32_t* buckets_; /* uint32_t[BUCKET_SIZE]; */
60 size_t partial_prepare_threshold = BUCKET_SIZE >> 5;
79 memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE);
89 return sizeof(uint32_t) * BUCKET_SIZE;
264 #undef BUCKET_SIZE
H A Dhash_to_binary_tree_inc.h20 #define BUCKET_SIZE (1 << BUCKET_BITS) macro
41 uint32_t* buckets_; /* uint32_t[BUCKET_SIZE]; */
61 self->forest_ = &self->buckets_[BUCKET_SIZE];
76 for (i = 0; i < BUCKET_SIZE; i++) {
88 return sizeof(uint32_t) * BUCKET_SIZE + 2 * sizeof(uint32_t) * num_nodes;
327 #undef BUCKET_SIZE

Completed in 4 milliseconds