| /third_party/node/deps/brotli/c/enc/ |
| H A D | hash_to_binary_tree_inc.h | 112 This function must be called with increasing cur_ix positions. */
115 const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, in StoreAndFindMatches()
118 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in StoreAndFindMatches()
129 size_t node_left = FN(LeftChildIndex)(self, cur_ix); in StoreAndFindMatches()
132 size_t node_right = FN(RightChildIndex)(self, cur_ix); in StoreAndFindMatches()
141 buckets[key] = (uint32_t)cur_ix; in StoreAndFindMatches()
144 const size_t backward = cur_ix - prev_ix; in StoreAndFindMatches()
194 /* Finds all backward matches of &data[cur_ix & ring_buffer_mask] up to the
195 length of max_length and stores the position cur_ix in the hash table.
205 const size_t ring_buffer_mask, const size_t cur_ix, in FindAllMatches()
113 StoreAndFindMatches( HashToBinaryTree* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data, const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, BackwardMatch* BROTLI_RESTRICT matches) StoreAndFindMatches() argument
201 FindAllMatches( HashToBinaryTree* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const BrotliEncoderParams* params, BackwardMatch* matches) FindAllMatches() argument
[all...] |
| H A D | hash_longest_match_quickly_inc.h | 139 /* Find a longest backward match of &data[cur_ix & ring_buffer_mask]
140 up to the length of max_length and stores the position cur_ix in the
152 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FindLongestMatch()
157 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch()
165 size_t prev_ix = cur_ix - cached_backward; in FindLongestMatch()
167 if (prev_ix < cur_ix) { in FindLongestMatch()
179 buckets[key] = (uint32_t)cur_ix; in FindLongestMatch()
195 buckets[key] = (uint32_t)cur_ix; in FindLongestMatch()
196 backward = cur_ix - prev_ix; in FindLongestMatch()
222 key_out = keys[(cur_ix in FindLongestMatch()
147 FindLongestMatch( HashLongestMatchQuickly* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
[all...] |
| H A D | hash_rolling_inc.h | 154 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
158 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch()
161 if ((cur_ix & (JUMP - 1)) != 0) return; in FindLongestMatch()
166 for (pos = self->next_ix; pos <= cur_ix; pos += JUMP) { in FindLongestMatch()
179 if (pos == cur_ix && found_ix != FN(kInvalidPos)) { in FindLongestMatch()
181 if cur_ix is above 4GB, despite using 32-bit values in the table. */ in FindLongestMatch()
182 size_t backward = (uint32_t)(cur_ix - found_ix); in FindLongestMatch()
202 self->next_ix = cur_ix + JUMP; in FindLongestMatch()
150 FindLongestMatch( HashRolling* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
|
| H A D | hash_forgetful_chain_inc.h | 180 /* Find a longest backward match of &data[cur_ix] up to the length of
181 max_length and stores the position cur_ix in the hash table.
196 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FindLongestMatch()
203 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch()
216 size_t prev_ix = (cur_ix - backward); in FindLongestMatch()
219 if (prev_ix >= cur_ix || backward > max_backward) { in FindLongestMatch()
246 size_t delta = cur_ix - addr[key]; in FindLongestMatch()
253 prev_ix = (cur_ix - backward) & ring_buffer_mask; in FindLongestMatch()
280 FN(Store)(self, data, ring_buffer_mask, cur_ix); in FindLongestMatch()
191 FindLongestMatch( HashForgetfulChain* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
|
| H A D | hash_longest_match64_inc.h | 151 /* Find a longest backward match of &data[cur_ix] up to the length of
152 max_length and stores the position cur_ix in the hash table.
166 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
172 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch()
183 size_t prev_ix = (size_t)(cur_ix - backward); in FindLongestMatch()
184 if (prev_ix >= cur_ix) { in FindLongestMatch()
228 const size_t backward = cur_ix - prev_ix; in FindLongestMatch()
257 bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix; in FindLongestMatch()
162 FindLongestMatch( HashLongestMatch* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
|
| H A D | hash_longest_match_inc.h | 147 /* Find a longest backward match of &data[cur_ix] up to the length of
148 max_length and stores the position cur_ix in the hash table.
162 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
168 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch()
179 size_t prev_ix = (size_t)(cur_ix - backward); in FindLongestMatch()
180 if (prev_ix >= cur_ix) { in FindLongestMatch()
223 const size_t backward = cur_ix - prev_ix; in FindLongestMatch()
252 bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix; in FindLongestMatch()
158 FindLongestMatch( HashLongestMatch* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
|
| H A D | hash_composite_inc.h | 113 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
118 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FindLongestMatch()
121 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FindLongestMatch()
109 FindLongestMatch( HashComposite* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
|
| H A D | backward_references_hq.c | 410 const size_t cur_ix = block_start + pos; in UpdateNodes() local
411 const size_t cur_ix_masked = cur_ix & ringbuffer_mask; in UpdateNodes()
412 const size_t max_distance = BROTLI_MIN(size_t, cur_ix, max_backward_limit); in UpdateNodes()
414 cur_ix + stream_offset, max_backward_limit); in UpdateNodes()
451 size_t prev_ix = cur_ix - backward; in UpdateNodes()
463 if (prev_ix >= cur_ix) { in UpdateNodes()
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| H A D | hash_to_binary_tree_inc.h | 112 This function must be called with increasing cur_ix positions. */
115 const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, in StoreAndFindMatches()
118 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in StoreAndFindMatches()
129 size_t node_left = FN(LeftChildIndex)(self, cur_ix); in StoreAndFindMatches()
132 size_t node_right = FN(RightChildIndex)(self, cur_ix); in StoreAndFindMatches()
141 buckets[key] = (uint32_t)cur_ix; in StoreAndFindMatches()
144 const size_t backward = cur_ix - prev_ix; in StoreAndFindMatches()
194 /* Finds all backward matches of &data[cur_ix & ring_buffer_mask] up to the
195 length of max_length and stores the position cur_ix in the hash table.
205 const size_t ring_buffer_mask, const size_t cur_ix, in FindAllMatches()
113 StoreAndFindMatches( HashToBinaryTree* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data, const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, BackwardMatch* BROTLI_RESTRICT matches) StoreAndFindMatches() argument
201 FindAllMatches( HashToBinaryTree* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const BrotliEncoderParams* params, BackwardMatch* matches) FindAllMatches() argument
[all...] |
| H A D | hash_longest_match_quickly_inc.h | 139 /* Find a longest backward match of &data[cur_ix & ring_buffer_mask]
140 up to the length of max_length and stores the position cur_ix in the
152 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FindLongestMatch()
157 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch()
165 size_t prev_ix = cur_ix - cached_backward; in FindLongestMatch()
167 if (prev_ix < cur_ix) { in FindLongestMatch()
179 buckets[key] = (uint32_t)cur_ix; in FindLongestMatch()
195 buckets[key] = (uint32_t)cur_ix; in FindLongestMatch()
196 backward = cur_ix - prev_ix; in FindLongestMatch()
222 key_out = keys[(cur_ix in FindLongestMatch()
147 FindLongestMatch( HashLongestMatchQuickly* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
[all...] |
| H A D | hash_rolling_inc.h | 154 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
158 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch()
161 if ((cur_ix & (JUMP - 1)) != 0) return; in FindLongestMatch()
166 for (pos = self->next_ix; pos <= cur_ix; pos += JUMP) { in FindLongestMatch()
179 if (pos == cur_ix && found_ix != FN(kInvalidPos)) { in FindLongestMatch()
181 if cur_ix is above 4GB, despite using 32-bit values in the table. */ in FindLongestMatch()
182 size_t backward = (uint32_t)(cur_ix - found_ix); in FindLongestMatch()
202 self->next_ix = cur_ix + JUMP; in FindLongestMatch()
150 FindLongestMatch( HashRolling* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
|
| H A D | hash_forgetful_chain_inc.h | 180 /* Find a longest backward match of &data[cur_ix] up to the length of
181 max_length and stores the position cur_ix in the hash table.
196 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FindLongestMatch()
203 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch()
216 size_t prev_ix = (cur_ix - backward); in FindLongestMatch()
219 if (prev_ix >= cur_ix || backward > max_backward) { in FindLongestMatch()
246 size_t delta = cur_ix - addr[key]; in FindLongestMatch()
253 prev_ix = (cur_ix - backward) & ring_buffer_mask; in FindLongestMatch()
280 FN(Store)(self, data, ring_buffer_mask, cur_ix); in FindLongestMatch()
191 FindLongestMatch( HashForgetfulChain* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
|
| H A D | hash_longest_match_inc.h | 147 /* Find a longest backward match of &data[cur_ix] up to the length of
148 max_length and stores the position cur_ix in the hash table.
162 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
168 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch()
179 size_t prev_ix = (size_t)(cur_ix - backward); in FindLongestMatch()
180 if (prev_ix >= cur_ix) { in FindLongestMatch()
223 const size_t backward = cur_ix - prev_ix; in FindLongestMatch()
252 bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix; in FindLongestMatch()
158 FindLongestMatch( HashLongestMatch* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
|
| H A D | hash_longest_match64_inc.h | 151 /* Find a longest backward match of &data[cur_ix] up to the length of
152 max_length and stores the position cur_ix in the hash table.
166 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
172 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch()
183 size_t prev_ix = (size_t)(cur_ix - backward); in FindLongestMatch()
184 if (prev_ix >= cur_ix) { in FindLongestMatch()
228 const size_t backward = cur_ix - prev_ix; in FindLongestMatch()
257 bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix; in FindLongestMatch()
162 FindLongestMatch( HashLongestMatch* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
|
| H A D | hash_composite_inc.h | 113 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
118 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FindLongestMatch()
121 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FindLongestMatch()
109 FindLongestMatch( HashComposite* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
|
| H A D | backward_references_hq.c | 410 const size_t cur_ix = block_start + pos; in UpdateNodes() local
411 const size_t cur_ix_masked = cur_ix & ringbuffer_mask; in UpdateNodes()
412 const size_t max_distance = BROTLI_MIN(size_t, cur_ix, max_backward_limit); in UpdateNodes()
414 cur_ix + stream_offset, max_backward_limit); in UpdateNodes()
451 size_t prev_ix = cur_ix - backward; in UpdateNodes()
463 if (prev_ix >= cur_ix) { in UpdateNodes()
|