Home
last modified time | relevance | path

Searched refs:BUCKET_SIZE (Results 1 – 6 of 6) sorted by relevance

/third_party/node/deps/brotli/c/enc/
Dhash_forgetful_chain_inc.h23 #define BUCKET_SIZE (1 << BUCKET_BITS) macro
72 return (uint16_t*)(&FN(Addr)(extra)[BUCKET_SIZE]); in FN()
76 return (uint8_t*)(&FN(Head)(extra)[BUCKET_SIZE]); in FN()
99 size_t partial_prepare_threshold = BUCKET_SIZE >> 6; in FN()
112 memset(addr, 0xCC, sizeof(uint32_t) * BUCKET_SIZE); in FN()
113 memset(head, 0, sizeof(uint16_t) * BUCKET_SIZE); in FN()
125 return sizeof(uint32_t) * BUCKET_SIZE + sizeof(uint16_t) * BUCKET_SIZE + in FN()
290 #undef BUCKET_SIZE
Dhash_longest_match_quickly_inc.h14 #define BUCKET_SIZE (1 << BUCKET_BITS) macro
15 #define BUCKET_MASK (BUCKET_SIZE - 1)
60 size_t partial_prepare_threshold = BUCKET_SIZE >> 5; in FN()
79 memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE); in FN()
89 return sizeof(uint32_t) * BUCKET_SIZE; in FN()
264 #undef BUCKET_SIZE
Dhash_to_binary_tree_inc.h20 #define BUCKET_SIZE (1 << BUCKET_BITS) macro
61 self->forest_ = &self->buckets_[BUCKET_SIZE]; in FN()
76 for (i = 0; i < BUCKET_SIZE; i++) { in FN()
88 return sizeof(uint32_t) * BUCKET_SIZE + 2 * sizeof(uint32_t) * num_nodes; in FN()
327 #undef BUCKET_SIZE
/third_party/skia/third_party/externals/brotli/c/enc/
Dhash_forgetful_chain_inc.h23 #define BUCKET_SIZE (1 << BUCKET_BITS) macro
72 return (uint16_t*)(&FN(Addr)(extra)[BUCKET_SIZE]); in FN()
76 return (uint8_t*)(&FN(Head)(extra)[BUCKET_SIZE]); in FN()
99 size_t partial_prepare_threshold = BUCKET_SIZE >> 6; in FN()
112 memset(addr, 0xCC, sizeof(uint32_t) * BUCKET_SIZE); in FN()
113 memset(head, 0, sizeof(uint16_t) * BUCKET_SIZE); in FN()
125 return sizeof(uint32_t) * BUCKET_SIZE + sizeof(uint16_t) * BUCKET_SIZE + in FN()
290 #undef BUCKET_SIZE
Dhash_longest_match_quickly_inc.h14 #define BUCKET_SIZE (1 << BUCKET_BITS) macro
15 #define BUCKET_MASK (BUCKET_SIZE - 1)
60 size_t partial_prepare_threshold = BUCKET_SIZE >> 5; in FN()
79 memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE); in FN()
89 return sizeof(uint32_t) * BUCKET_SIZE; in FN()
264 #undef BUCKET_SIZE
Dhash_to_binary_tree_inc.h20 #define BUCKET_SIZE (1 << BUCKET_BITS) macro
61 self->forest_ = &self->buckets_[BUCKET_SIZE]; in FN()
76 for (i = 0; i < BUCKET_SIZE; i++) { in FN()
88 return sizeof(uint32_t) * BUCKET_SIZE + 2 * sizeof(uint32_t) * num_nodes; in FN()
327 #undef BUCKET_SIZE