Home
last modified time | relevance | path

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

/third_party/node/deps/brotli/c/enc/
H A Dhash.h77 int* BROTLI_RESTRICT distance_cache, const int num_distances) { in PrepareDistanceCache()
79 int last_distance = distance_cache[0]; in PrepareDistanceCache()
80 distance_cache[4] = last_distance - 1; in PrepareDistanceCache()
81 distance_cache[5] = last_distance + 1; in PrepareDistanceCache()
82 distance_cache[6] = last_distance - 2; in PrepareDistanceCache()
83 distance_cache[7] = last_distance + 2; in PrepareDistanceCache()
84 distance_cache[8] = last_distance - 3; in PrepareDistanceCache()
85 distance_cache[9] = last_distance + 3; in PrepareDistanceCache()
87 int next_last_distance = distance_cache[1]; in PrepareDistanceCache()
88 distance_cache[1 in PrepareDistanceCache()
76 PrepareDistanceCache( int* BROTLI_RESTRICT distance_cache, const int num_distances) PrepareDistanceCache() argument
[all...]
H A Dhash_composite_inc.h104 HashComposite* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
105 FN_A(PrepareDistanceCache)(&self->ha, distance_cache); in PrepareDistanceCache()
106 FN_B(PrepareDistanceCache)(&self->hb, distance_cache); in PrepareDistanceCache()
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()
103 PrepareDistanceCache( HashComposite* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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 Dhash_rolling_inc.h145 int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
147 BROTLI_UNUSED(distance_cache); in PrepareDistanceCache()
154 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
207 BROTLI_UNUSED(distance_cache); in FindLongestMatch()
143 PrepareDistanceCache( HashRolling* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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 Dhash_forgetful_chain_inc.h175 int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
177 PrepareDistanceCache(distance_cache, NUM_LAST_DISTANCES_TO_CHECK); in PrepareDistanceCache()
195 const int* BROTLI_RESTRICT distance_cache, in FindLongestMatch()
215 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch()
173 PrepareDistanceCache( HashForgetfulChain* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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 Dhash_longest_match64_inc.h147 int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
148 PrepareDistanceCache(distance_cache, self->num_last_distances_to_check_); in PrepareDistanceCache()
166 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
182 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch()
145 PrepareDistanceCache( HashLongestMatch* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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 Dhash_longest_match_inc.h143 int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
144 PrepareDistanceCache(distance_cache, self->num_last_distances_to_check_); in PrepareDistanceCache()
162 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
178 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch()
141 PrepareDistanceCache( HashLongestMatch* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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 Dhash_longest_match_quickly_inc.h134 int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
136 BROTLI_UNUSED(distance_cache); in PrepareDistanceCache()
151 const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, in FindLongestMatch()
164 size_t cached_backward = (size_t)distance_cache[0]; in FindLongestMatch()
132 PrepareDistanceCache( HashLongestMatchQuickly* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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
H A Dbackward_references_hq.c261 int distance_cache[4]; member
396 pos, starting_dist_cache, nodes, posdata.distance_cache); in EvaluateNode()
450 (size_t)(posdata->distance_cache[idx] + kDistanceCacheOffset[j]); in UpdateNodes()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash.h77 int* BROTLI_RESTRICT distance_cache, const int num_distances) { in PrepareDistanceCache()
79 int last_distance = distance_cache[0]; in PrepareDistanceCache()
80 distance_cache[4] = last_distance - 1; in PrepareDistanceCache()
81 distance_cache[5] = last_distance + 1; in PrepareDistanceCache()
82 distance_cache[6] = last_distance - 2; in PrepareDistanceCache()
83 distance_cache[7] = last_distance + 2; in PrepareDistanceCache()
84 distance_cache[8] = last_distance - 3; in PrepareDistanceCache()
85 distance_cache[9] = last_distance + 3; in PrepareDistanceCache()
87 int next_last_distance = distance_cache[1]; in PrepareDistanceCache()
88 distance_cache[1 in PrepareDistanceCache()
76 PrepareDistanceCache( int* BROTLI_RESTRICT distance_cache, const int num_distances) PrepareDistanceCache() argument
[all...]
H A Dhash_composite_inc.h104 HashComposite* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
105 FN_A(PrepareDistanceCache)(&self->ha, distance_cache); in PrepareDistanceCache()
106 FN_B(PrepareDistanceCache)(&self->hb, distance_cache); in PrepareDistanceCache()
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()
103 PrepareDistanceCache( HashComposite* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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 Dhash_rolling_inc.h145 int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
147 BROTLI_UNUSED(distance_cache); in PrepareDistanceCache()
154 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
207 BROTLI_UNUSED(distance_cache); in FindLongestMatch()
143 PrepareDistanceCache( HashRolling* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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 Dhash_longest_match_inc.h143 int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
144 PrepareDistanceCache(distance_cache, self->num_last_distances_to_check_); in PrepareDistanceCache()
162 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
178 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch()
141 PrepareDistanceCache( HashLongestMatch* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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 Dhash_longest_match_quickly_inc.h134 int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
136 BROTLI_UNUSED(distance_cache); in PrepareDistanceCache()
151 const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, in FindLongestMatch()
164 size_t cached_backward = (size_t)distance_cache[0]; in FindLongestMatch()
132 PrepareDistanceCache( HashLongestMatchQuickly* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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
H A Dhash_forgetful_chain_inc.h175 int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
177 PrepareDistanceCache(distance_cache, NUM_LAST_DISTANCES_TO_CHECK); in PrepareDistanceCache()
195 const int* BROTLI_RESTRICT distance_cache, in FindLongestMatch()
215 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch()
173 PrepareDistanceCache( HashForgetfulChain* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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 Dhash_longest_match64_inc.h147 int* BROTLI_RESTRICT distance_cache) { in PrepareDistanceCache()
148 PrepareDistanceCache(distance_cache, self->num_last_distances_to_check_); in PrepareDistanceCache()
166 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FindLongestMatch()
182 const size_t backward = (size_t)distance_cache[i]; in FindLongestMatch()
145 PrepareDistanceCache( HashLongestMatch* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) PrepareDistanceCache() argument
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 Dbackward_references_hq.c261 int distance_cache[4]; member
396 pos, starting_dist_cache, nodes, posdata.distance_cache); in EvaluateNode()
450 (size_t)(posdata->distance_cache[idx] + kDistanceCacheOffset[j]); in UpdateNodes()

Completed in 15 milliseconds