HomeSort by: relevance | last modified time | path
    Searched refs:max_length (Results 1 - 20 of 20) sorted by relevancy

  /xsrc/external/mit/brotli/dist/c/enc/
static_dict.h 33 const uint8_t* data, size_t min_length, size_t max_length,
static_dict.c 43 DictWord w, const uint8_t* data, size_t max_length) {
44 if (w.len > max_length) {
79 size_t min_length, size_t max_length, uint32_t* matches) {
93 DictMatchLength(dictionary->words, data, id, l, max_length);
107 if (l + 2 < max_length &&
125 if (matchlen < l || l + 6 >= max_length) {
282 if (!IsMatch(dictionary->words, w, data, max_length)) {
288 if (l + 1 >= max_length) {
325 if (max_length >= 5 && (data[0] == ' ' || data[0] == '.')) {
338 if (!IsMatch(dictionary->words, w, &data[1], max_length - 1))
    [all...]
hash_to_binary_tree_inc.h 115 const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length,
120 BROTLI_MIN(size_t, max_length, MAX_TREE_COMP_LENGTH);
122 TO_BROTLI_BOOL(max_length >= MAX_TREE_COMP_LENGTH);
160 max_length - cur_len);
195 length of max_length and stores the position cur_ix in the hash table.
206 const size_t max_length, const size_t max_backward,
232 max_length);
239 if (best_len < max_length) {
241 ring_buffer_mask, max_length, max_backward, &best_len, matches);
249 &data[cur_ix_masked], minlen, max_length, &dict_matches[0]))
    [all...]
backward_references_inc.h 41 size_t max_length = pos_end - position; local
51 ringbuffer, ringbuffer_mask, dist_cache, position, max_length,
56 --max_length;
57 for (;; --max_length) {
61 BROTLI_MIN(size_t, sr.len - 1, max_length) : 0;
70 ringbuffer, ringbuffer_mask, dist_cache, position + 1, max_length, local
hash_longest_match_quickly_inc.h 140 up to the length of max_length and stores the position cur_ix in the
143 Does not look for matches longer than max_length.
152 const size_t cur_ix, const size_t max_length, const size_t max_backward,
171 &data[prev_ix], &data[cur_ix_masked], max_length);
206 max_length);
237 max_length);
253 self->common, &data[cur_ix_masked], max_length, dictionary_distance,
hash_forgetful_chain_inc.h 181 max_length and stores the position cur_ix in the hash table.
187 Does not look for matches longer than max_length.
196 const size_t cur_ix, const size_t max_length, const size_t max_backward,
226 max_length);
264 max_length);
284 self->common, &data[cur_ix_masked], max_length, dictionary_distance,
hash_longest_match64_inc.h 152 max_length and stores the position cur_ix in the hash table.
158 Does not look for matches longer than max_length.
167 const size_t max_length, const size_t max_backward,
200 max_length);
241 max_length);
262 self->common_, &data[cur_ix_masked], max_length, dictionary_distance,
hash_longest_match_inc.h 148 max_length and stores the position cur_ix in the hash table.
154 Does not look for matches longer than max_length.
163 const size_t max_length, const size_t max_backward,
196 max_length);
236 max_length);
257 self->common_, &data[cur_ix_masked], max_length, dictionary_distance,
hash_composite_inc.h 114 const size_t max_length, const size_t max_backward,
118 distance_cache, cur_ix, max_length, max_backward, dictionary_distance,
121 distance_cache, cur_ix, max_length, max_backward, dictionary_distance,
hash_rolling_inc.h 155 const size_t max_length, const size_t max_backward,
164 if (max_length < CHUNKLEN) return;
187 max_length);
hash.h 138 const uint8_t* data, size_t max_length, size_t max_backward,
145 if (len > max_length) {
177 HasherCommon* common, const uint8_t* data, size_t max_length,
192 max_length, max_backward, max_distance, out);
backward_references_hq.c 771 size_t max_length = num_bytes - i; local
781 ringbuffer, ringbuffer_mask, pos, max_length,
encode.c 1097 const size_t max_length = MaxMetablockSize(&s->params); local
1098 const size_t max_literals = max_length / 8;
1099 const size_t max_commands = max_length / 8;
1104 processed_bytes + InputBlockSize(s) <= max_length);
  /xsrc/external/mit/brotli/dist/c/dec/
huffman.c 185 int max_length = -1; local
193 while (symbol_lists[max_length] == 0xFFFF) max_length--;
194 max_length += BROTLI_HUFFMAN_MAX_CODE_LENGTH + 1;
203 if (table_bits > max_length) {
204 table_bits = max_length;
234 for (len = root_bits + 1, step = 2; len <= max_length; ++len) {
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/llvmpipe/
lp_test_arit.c 531 unsigned max_length = lp_native_vector_width / 32; local
533 for (length = 1; length <= max_length; length *= 2) {
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/llvmpipe/
lp_test_arit.c 508 unsigned max_length = lp_native_vector_width / 32; local
510 for (length = 1; length <= max_length; length *= 2) {
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/iris/
iris_state.c 5438 uint32_t max_length; member in struct:push_bos
5462 if (range->length > push_bos->max_length)
5463 push_bos->max_length = range->length;
5865 if (push_bos.max_length < 32) {
  /xsrc/external/mit/MesaLib/dist/src/gtest/src/
gtest.cc 5545 // max_length characters, only prints the first max_length characters
5547 static void PrintOnOneLine(const char* str, int max_length) {
5550 if (i >= max_length) {
  /xsrc/external/mit/MesaLib.old/dist/src/gtest/src/
gtest.cc 4844 // max_length characters, only prints the first max_length characters
4846 static void PrintOnOneLine(const char* str, int max_length) {
4849 if (i >= max_length) {
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/crocus/
crocus_state.c 5644 uint32_t max_length; member in struct:push_bos
5669 if (range->length > push_bos->max_length)
5670 push_bos->max_length = range->length;

Completed in 46 milliseconds