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/
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]); in Head()
76 return (uint8_t*)(&FN(Head)(extra)[BUCKET_SIZE]); in TinyHash()
99 size_t partial_prepare_threshold = BUCKET_SIZE >> 6; in Prepare()
112 memset(addr, 0xCC, sizeof(uint32_t) * BUCKET_SIZE); in Prepare()
113 memset(head, 0, sizeof(uint16_t) * BUCKET_SIZE); in Prepare()
125 return sizeof(uint32_t) * BUCKET_SIZE + sizeof(uint16_t) * BUCKET_SIZE in HashMemAllocInBytes()
290 #undef BUCKET_SIZE global() macro
[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; in Prepare()
79 memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE); in Prepare()
89 return sizeof(uint32_t) * BUCKET_SIZE; in HashMemAllocInBytes()
264 #undef BUCKET_SIZE macro
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]; in Initialize()
76 for (i = 0; i < BUCKET_SIZE; i++) { in Prepare()
88 return sizeof(uint32_t) * BUCKET_SIZE + 2 * sizeof(uint32_t) * num_nodes; in HashMemAllocInBytes()
327 #undef BUCKET_SIZE macro
/third_party/skia/third_party/externals/brotli/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]); in Head()
76 return (uint8_t*)(&FN(Head)(extra)[BUCKET_SIZE]); in TinyHash()
99 size_t partial_prepare_threshold = BUCKET_SIZE >> 6; in Prepare()
112 memset(addr, 0xCC, sizeof(uint32_t) * BUCKET_SIZE); in Prepare()
113 memset(head, 0, sizeof(uint16_t) * BUCKET_SIZE); in Prepare()
125 return sizeof(uint32_t) * BUCKET_SIZE + sizeof(uint16_t) * BUCKET_SIZE in HashMemAllocInBytes()
290 #undef BUCKET_SIZE global() macro
[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; in Prepare()
79 memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE); in Prepare()
89 return sizeof(uint32_t) * BUCKET_SIZE; in HashMemAllocInBytes()
264 #undef BUCKET_SIZE macro
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]; in Initialize()
76 for (i = 0; i < BUCKET_SIZE; i++) { in Prepare()
88 return sizeof(uint32_t) * BUCKET_SIZE + 2 * sizeof(uint32_t) * num_nodes; in HashMemAllocInBytes()
327 #undef BUCKET_SIZE macro

Completed in 7 milliseconds