Searched refs:MAX_TREE_COMP_LENGTH (Results 1 – 4 of 4) sorted by relevance
| /third_party/node/deps/brotli/c/enc/ |
| D | hash_to_binary_tree_inc.h | 24 return MAX_TREE_COMP_LENGTH; in FN()
120 BROTLI_MIN(size_t, max_length, MAX_TREE_COMP_LENGTH); in FN()
122 TO_BROTLI_BOOL(max_length >= MAX_TREE_COMP_LENGTH); in FN()
156 BROTLI_DCHECK(cur_len <= MAX_TREE_COMP_LENGTH); in FN()
275 FN(StoreAndFindMatches)(self, data, ix, mask, MAX_TREE_COMP_LENGTH, in FN()
302 position >= MAX_TREE_COMP_LENGTH) { in FN()
306 const size_t i_start = position - MAX_TREE_COMP_LENGTH + 1; in FN()
322 MAX_TREE_COMP_LENGTH, max_backward, NULL, NULL); in FN()
|
| D | hash.h | 234 #define MAX_TREE_COMP_LENGTH 128 macro
237 #undef MAX_TREE_COMP_LENGTH
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| D | hash_to_binary_tree_inc.h | 24 return MAX_TREE_COMP_LENGTH; in FN()
120 BROTLI_MIN(size_t, max_length, MAX_TREE_COMP_LENGTH); in FN()
122 TO_BROTLI_BOOL(max_length >= MAX_TREE_COMP_LENGTH); in FN()
156 BROTLI_DCHECK(cur_len <= MAX_TREE_COMP_LENGTH); in FN()
275 FN(StoreAndFindMatches)(self, data, ix, mask, MAX_TREE_COMP_LENGTH, in FN()
302 position >= MAX_TREE_COMP_LENGTH) { in FN()
306 const size_t i_start = position - MAX_TREE_COMP_LENGTH + 1; in FN()
322 MAX_TREE_COMP_LENGTH, max_backward, NULL, NULL); in FN()
|
| D | hash.h | 234 #define MAX_TREE_COMP_LENGTH 128 macro
237 #undef MAX_TREE_COMP_LENGTH
|