Home
last modified time | relevance | path

Searched refs:max_distance (Results 1 - 25 of 48) sorted by relevance

12

/third_party/node/deps/brotli/c/common/
H A Dconstants.h107 uint32_t max_distance; member
128 uint32_t max_distance, uint32_t npostfix, uint32_t ndirect) { in BrotliCalculateDistanceCodeLimit()
133 if (max_distance <= ndirect) { in BrotliCalculateDistanceCodeLimit()
135 result.max_alphabet_size = max_distance + BROTLI_NUM_DISTANCE_SHORT_CODES; in BrotliCalculateDistanceCodeLimit()
136 result.max_distance = max_distance; in BrotliCalculateDistanceCodeLimit()
140 uint32_t forbidden_distance = max_distance + 1; in BrotliCalculateDistanceCodeLimit()
167 result.max_distance = ndirect; in BrotliCalculateDistanceCodeLimit()
184 result.max_distance = ((start + extra) << npostfix) + postfix + ndirect + 1; in BrotliCalculateDistanceCodeLimit()
127 BrotliCalculateDistanceCodeLimit( uint32_t max_distance, uint32_t npostfix, uint32_t ndirect) BrotliCalculateDistanceCodeLimit() argument
/third_party/skia/third_party/externals/brotli/c/common/
H A Dconstants.h107 uint32_t max_distance; member
128 uint32_t max_distance, uint32_t npostfix, uint32_t ndirect) { in BrotliCalculateDistanceCodeLimit()
133 if (max_distance <= ndirect) { in BrotliCalculateDistanceCodeLimit()
135 result.max_alphabet_size = max_distance + BROTLI_NUM_DISTANCE_SHORT_CODES; in BrotliCalculateDistanceCodeLimit()
136 result.max_distance = max_distance; in BrotliCalculateDistanceCodeLimit()
140 uint32_t forbidden_distance = max_distance + 1; in BrotliCalculateDistanceCodeLimit()
167 result.max_distance = ndirect; in BrotliCalculateDistanceCodeLimit()
184 result.max_distance = ((start + extra) << npostfix) + postfix + ndirect + 1; in BrotliCalculateDistanceCodeLimit()
127 BrotliCalculateDistanceCodeLimit( uint32_t max_distance, uint32_t npostfix, uint32_t ndirect) BrotliCalculateDistanceCodeLimit() argument
/third_party/ninja/src/
H A Dedit_distance_test.cc27 for (int max_distance = 1; max_distance < 7; ++max_distance) { in TEST()
28 EXPECT_EQ(max_distance + 1, in TEST()
30 allow_replacements, max_distance)); in TEST()
/third_party/node/deps/brotli/c/enc/
H A Dbackward_references_inc.h42 size_t max_distance = BROTLI_MIN(size_t, position, max_backward_limit); in CreateBackwardReferences() local
52 max_distance, dictionary_start + gap, params->dist.max_distance, &sr); in CreateBackwardReferences()
65 max_distance = BROTLI_MIN(size_t, position + 1, max_backward_limit); in CreateBackwardReferences()
71 max_distance, dictionary_start + gap, params->dist.max_distance, in CreateBackwardReferences() local
H A Dhash_composite_inc.h115 const size_t dictionary_distance, const size_t max_distance, in FindLongestMatch()
119 max_distance, out); in FindLongestMatch()
122 max_distance, out); 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 Dbackward_references.c26 size_t max_distance, in ComputeDistanceCode()
28 if (distance <= max_distance) { in ComputeDistanceCode()
25 ComputeDistanceCode(size_t distance, size_t max_distance, const int* dist_cache) ComputeDistanceCode() argument
H A Dmetablock.c33 uint32_t max_distance; in BrotliInitDistanceParams() local
41 max_distance = ndirect + (1U << (BROTLI_MAX_DISTANCE_BITS + npostfix + 2)) - in BrotliInitDistanceParams()
50 max_distance = limit.max_distance; in BrotliInitDistanceParams()
55 dist_params->max_distance = max_distance; in BrotliInitDistanceParams()
108 if (distance > new_params->max_distance) { in ComputeDistanceCost()
H A Dhash.h139 size_t max_distance, HasherSearchResult* out) { in TestStaticDictionaryItem()
161 if (backward > max_distance) { in TestStaticDictionaryItem()
178 size_t max_backward, size_t max_distance, in SearchInStaticDictionary()
192 max_length, max_backward, max_distance, out); in SearchInStaticDictionary()
136 TestStaticDictionaryItem( const BrotliEncoderDictionary* dictionary, size_t len, size_t word_idx, const uint8_t* data, size_t max_length, size_t max_backward, size_t max_distance, HasherSearchResult* out) TestStaticDictionaryItem() argument
175 SearchInStaticDictionary( const BrotliEncoderDictionary* dictionary, HasherCommon* common, const uint8_t* data, size_t max_length, size_t max_backward, size_t max_distance, HasherSearchResult* out, BROTLI_BOOL shallow) SearchInStaticDictionary() argument
H A Dparams.h28 size_t max_distance; member
H A Dhash_rolling_inc.h156 const size_t dictionary_distance, const size_t max_distance, in FindLongestMatch()
209 BROTLI_UNUSED(max_distance); 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 Dhash_forgetful_chain_inc.h197 const size_t dictionary_distance, const size_t max_distance, in FindLongestMatch()
285 max_distance, out, BROTLI_FALSE); 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 Dhash_longest_match64_inc.h168 const size_t dictionary_distance, const size_t max_distance, in FindLongestMatch()
263 max_distance, out, BROTLI_FALSE); 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 Dhash_longest_match_inc.h164 const size_t dictionary_distance, const size_t max_distance, in FindLongestMatch()
258 max_distance, out, BROTLI_FALSE); 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 Dhash_longest_match_quickly_inc.h153 const size_t dictionary_distance, const size_t max_distance, in FindLongestMatch()
254 max_distance, out, BROTLI_TRUE); 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
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dbackward_references_inc.h42 size_t max_distance = BROTLI_MIN(size_t, position, max_backward_limit); in CreateBackwardReferences() local
52 max_distance, dictionary_start + gap, params->dist.max_distance, &sr); in CreateBackwardReferences()
65 max_distance = BROTLI_MIN(size_t, position + 1, max_backward_limit); in CreateBackwardReferences()
71 max_distance, dictionary_start + gap, params->dist.max_distance, in CreateBackwardReferences() local
H A Dhash_composite_inc.h115 const size_t dictionary_distance, const size_t max_distance, in FindLongestMatch()
119 max_distance, out); in FindLongestMatch()
122 max_distance, out); 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 Dbackward_references.c26 size_t max_distance, in ComputeDistanceCode()
28 if (distance <= max_distance) { in ComputeDistanceCode()
25 ComputeDistanceCode(size_t distance, size_t max_distance, const int* dist_cache) ComputeDistanceCode() argument
H A Dmetablock.c33 uint32_t max_distance; in BrotliInitDistanceParams() local
41 max_distance = ndirect + (1U << (BROTLI_MAX_DISTANCE_BITS + npostfix + 2)) - in BrotliInitDistanceParams()
50 max_distance = limit.max_distance; in BrotliInitDistanceParams()
55 dist_params->max_distance = max_distance; in BrotliInitDistanceParams()
108 if (distance > new_params->max_distance) { in ComputeDistanceCost()
H A Dhash.h139 size_t max_distance, HasherSearchResult* out) { in TestStaticDictionaryItem()
161 if (backward > max_distance) { in TestStaticDictionaryItem()
178 size_t max_backward, size_t max_distance, in SearchInStaticDictionary()
192 max_length, max_backward, max_distance, out); in SearchInStaticDictionary()
136 TestStaticDictionaryItem( const BrotliEncoderDictionary* dictionary, size_t len, size_t word_idx, const uint8_t* data, size_t max_length, size_t max_backward, size_t max_distance, HasherSearchResult* out) TestStaticDictionaryItem() argument
175 SearchInStaticDictionary( const BrotliEncoderDictionary* dictionary, HasherCommon* common, const uint8_t* data, size_t max_length, size_t max_backward, size_t max_distance, HasherSearchResult* out, BROTLI_BOOL shallow) SearchInStaticDictionary() argument
H A Dparams.h28 size_t max_distance; member
H A Dhash_rolling_inc.h156 const size_t dictionary_distance, const size_t max_distance, in FindLongestMatch()
209 BROTLI_UNUSED(max_distance); 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
/third_party/python/Python/
H A Dsuggestions.c159 Py_ssize_t max_distance = (name_size + item_size + 3) * MOVE_COST / 6; in calculate_suggestions() local
161 max_distance = Py_MIN(max_distance, suggestion_distance - 1); in calculate_suggestions()
164 item_str, item_size, max_distance); in calculate_suggestions()
165 if (current_distance > max_distance) { in calculate_suggestions()
/third_party/mesa3d/src/compiler/nir/
H A Dnir_group_loads.c285 nir_instr *current, unsigned max_distance) in handle_load_range()
288 (!current || current->index > (*first)->index + max_distance)) { in handle_load_range()
370 unsigned max_distance) in process_block()
457 handle_load_range(&first_load, &last_load, current, max_distance); in process_block()
465 /* max_distance is the maximum distance between the first and last instruction
470 unsigned max_distance) in nir_group_loads()
475 process_block(block, grouping, max_distance); in nir_group_loads()
284 handle_load_range(nir_instr **first, nir_instr **last, nir_instr *current, unsigned max_distance) handle_load_range() argument
369 process_block(nir_block *block, nir_load_grouping grouping, unsigned max_distance) process_block() argument
469 nir_group_loads(nir_shader *shader, nir_load_grouping grouping, unsigned max_distance) nir_group_loads() argument
/third_party/node/deps/v8/tools/
H A Dwindbg.js397 function find_object_near(aligned_addr, max_distance, step_op) {
401 find_object_near(aligned_addr, max_distance, x => x - step);
403 find_object_near(aligned_addr, max_distance, x => x + step);
412 while (maybe_map_addr && iters < max_distance) {
422 function find_object_prev(addr, max_distance) {
427 return find_object_near(aligned_addr, max_distance, x => x - ptr_size);
430 function find_object_next(addr, max_distance) {
435 return find_object_near(aligned_addr, max_distance, x => x + ptr_size);
/third_party/rust/crates/strsim-rs/src/
H A Dlib.rs337 let max_distance = a_len + b_len; in generic_damerau_levenshtein()
338 distances[0] = max_distance; in generic_damerau_levenshtein()
341 distances[flat_index(i + 1, 0, width)] = max_distance; in generic_damerau_levenshtein()
346 distances[flat_index(0, j + 1, width)] = max_distance; in generic_damerau_levenshtein()

Completed in 21 milliseconds

12