Home
last modified time | relevance | path

Searched refs:HashTypeLength (Results 1 - 16 of 16) sorted by relevance

/third_party/node/deps/brotli/c/enc/
H A Dhash_composite_inc.h18 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { in HashTypeLength() function
19 size_t a = FN_A(HashTypeLength)(); in HashTypeLength()
20 size_t b = FN_B(HashTypeLength)(); in HashTypeLength()
H A Dbackward_references_inc.h40 while (position + FN(HashTypeLength)() < pos_end) { in CreateBackwardReferences()
80 position + FN(HashTypeLength)() < pos_end) { in CreateBackwardReferences()
H A Dhash_to_binary_tree_inc.h22 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength() function
301 if (num_bytes >= FN(HashTypeLength)() - 1 && in StitchToPreviousBlock()
H A Dhash_forgetful_chain_inc.h27 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength() function
163 if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) { in StitchToPreviousBlock()
H A Dhash_longest_match64_inc.h19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; } in HashTypeLength() function
135 if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) { in StitchToPreviousBlock()
H A Dhash_longest_match_inc.h19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength() function
131 if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) { in StitchToPreviousBlock()
H A Dhash_longest_match_quickly_inc.h19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; } in HashTypeLength() function
122 if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) { in StitchToPreviousBlock()
H A Dhash_rolling_inc.h23 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength() function
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_composite_inc.h18 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { in HashTypeLength() function
19 size_t a = FN_A(HashTypeLength)(); in HashTypeLength()
20 size_t b = FN_B(HashTypeLength)(); in HashTypeLength()
H A Dbackward_references_inc.h40 while (position + FN(HashTypeLength)() < pos_end) { in CreateBackwardReferences()
80 position + FN(HashTypeLength)() < pos_end) { in CreateBackwardReferences()
H A Dhash_to_binary_tree_inc.h22 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength() function
301 if (num_bytes >= FN(HashTypeLength)() - 1 && in StitchToPreviousBlock()
H A Dhash_longest_match_inc.h19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength() function
131 if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) { in StitchToPreviousBlock()
H A Dhash_longest_match_quickly_inc.h19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; } in HashTypeLength() function
122 if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) { in StitchToPreviousBlock()
H A Dhash_forgetful_chain_inc.h27 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength() function
163 if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) { in StitchToPreviousBlock()
H A Dhash_longest_match64_inc.h19 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; } in HashTypeLength() function
135 if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) { in StitchToPreviousBlock()
H A Dhash_rolling_inc.h23 static BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; } in HashTypeLength() function

Completed in 9 milliseconds