/third_party/python/Include/internal/ |
H A D | pycore_blocks_output_buffer.h | 49 Py_ssize_t max_length; member 96 max_length: Max length of the buffer, -1 for unlimited length. 103 const Py_ssize_t max_length, in _BlocksOutputBuffer_InitAndGrow() 113 if (0 <= max_length && max_length < BUFFER_BLOCK_SIZE[0]) { in _BlocksOutputBuffer_InitAndGrow() 114 block_size = max_length; in _BlocksOutputBuffer_InitAndGrow() 135 buffer->max_length = max_length; in _BlocksOutputBuffer_InitAndGrow() 176 buffer->max_length = -1; in _BlocksOutputBuffer_InitWithSize() 210 // check max_length in _BlocksOutputBuffer_Grow() 102 _BlocksOutputBuffer_InitAndGrow(_BlocksOutputBuffer *buffer, const Py_ssize_t max_length, void **next_out) _BlocksOutputBuffer_InitAndGrow() argument [all...] |
/third_party/node/deps/brotli/c/enc/ |
H A D | static_dict.c | 43 DictWord w, const uint8_t* data, size_t max_length) { in IsMatch() 44 if (w.len > max_length) { in IsMatch() 79 size_t min_length, size_t max_length, uint32_t* matches) { in BrotliFindAllStaticDictionaryMatches() 93 DictMatchLength(dictionary->words, data, id, l, max_length); in BrotliFindAllStaticDictionaryMatches() 107 if (l + 2 < max_length && in BrotliFindAllStaticDictionaryMatches() 125 if (matchlen < l || l + 6 >= max_length) { in BrotliFindAllStaticDictionaryMatches() 282 if (!IsMatch(dictionary->words, w, data, max_length)) { in BrotliFindAllStaticDictionaryMatches() 288 if (l + 1 >= max_length) { in BrotliFindAllStaticDictionaryMatches() 325 if (max_length >= 5 && (data[0] == ' ' || data[0] == '.')) { in BrotliFindAllStaticDictionaryMatches() 338 if (!IsMatch(dictionary->words, w, &data[1], max_length in BrotliFindAllStaticDictionaryMatches() 42 IsMatch(const BrotliDictionary* dictionary, DictWord w, const uint8_t* data, size_t max_length) IsMatch() argument 77 BrotliFindAllStaticDictionaryMatches( const BrotliEncoderDictionary* dictionary, const uint8_t* data, size_t min_length, size_t max_length, uint32_t* matches) BrotliFindAllStaticDictionaryMatches() argument [all...] |
H A D | hash_to_binary_tree_inc.h | 115 const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, in StoreAndFindMatches() 120 BROTLI_MIN(size_t, max_length, MAX_TREE_COMP_LENGTH); in StoreAndFindMatches() 122 TO_BROTLI_BOOL(max_length >= MAX_TREE_COMP_LENGTH); in StoreAndFindMatches() 160 max_length - cur_len); in StoreAndFindMatches() 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, in FindAllMatches() 232 max_length); in FindAllMatches() 239 if (best_len < max_length) { in FindAllMatches() 241 ring_buffer_mask, max_length, max_backward, &best_len, matches); in FindAllMatches() 249 &data[cur_ix_masked], minlen, max_length, 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 | backward_references_inc.h | 41 size_t max_length = pos_end - position; in CreateBackwardReferences() local 51 ringbuffer, ringbuffer_mask, dist_cache, position, max_length, in CreateBackwardReferences() 56 --max_length; in CreateBackwardReferences() 57 for (;; --max_length) { in CreateBackwardReferences() 61 BROTLI_MIN(size_t, sr.len - 1, max_length) : 0; in CreateBackwardReferences() 70 ringbuffer, ringbuffer_mask, dist_cache, position + 1, max_length, in CreateBackwardReferences() local
|
H A D | 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, in FindLongestMatch() 171 &data[prev_ix], &data[cur_ix_masked], max_length); in FindLongestMatch() 206 max_length); in FindLongestMatch() 237 max_length); in FindLongestMatch() 253 self->common, &data[cur_ix_masked], max_length, dictionary_distance, 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
|
H A D | hash_composite_inc.h | 114 const size_t max_length, const size_t max_backward, 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 | 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, in FindLongestMatch() 226 max_length); in FindLongestMatch() 264 max_length); in FindLongestMatch() 284 self->common, &data[cur_ix_masked], max_length, dictionary_distance, 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 | 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, in FindLongestMatch() 200 max_length); in FindLongestMatch() 241 max_length); in FindLongestMatch() 262 self->common_, &data[cur_ix_masked], max_length, dictionary_distance, 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
|
/third_party/skia/third_party/externals/brotli/c/enc/ |
H A D | static_dict.c | 43 DictWord w, const uint8_t* data, size_t max_length) { in IsMatch() 44 if (w.len > max_length) { in IsMatch() 79 size_t min_length, size_t max_length, uint32_t* matches) { in BrotliFindAllStaticDictionaryMatches() 93 DictMatchLength(dictionary->words, data, id, l, max_length); in BrotliFindAllStaticDictionaryMatches() 107 if (l + 2 < max_length && in BrotliFindAllStaticDictionaryMatches() 125 if (matchlen < l || l + 6 >= max_length) { in BrotliFindAllStaticDictionaryMatches() 282 if (!IsMatch(dictionary->words, w, data, max_length)) { in BrotliFindAllStaticDictionaryMatches() 288 if (l + 1 >= max_length) { in BrotliFindAllStaticDictionaryMatches() 325 if (max_length >= 5 && (data[0] == ' ' || data[0] == '.')) { in BrotliFindAllStaticDictionaryMatches() 338 if (!IsMatch(dictionary->words, w, &data[1], max_length in BrotliFindAllStaticDictionaryMatches() 42 IsMatch(const BrotliDictionary* dictionary, DictWord w, const uint8_t* data, size_t max_length) IsMatch() argument 77 BrotliFindAllStaticDictionaryMatches( const BrotliEncoderDictionary* dictionary, const uint8_t* data, size_t min_length, size_t max_length, uint32_t* matches) BrotliFindAllStaticDictionaryMatches() argument [all...] |
H A D | hash_to_binary_tree_inc.h | 115 const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, in StoreAndFindMatches() 120 BROTLI_MIN(size_t, max_length, MAX_TREE_COMP_LENGTH); in StoreAndFindMatches() 122 TO_BROTLI_BOOL(max_length >= MAX_TREE_COMP_LENGTH); in StoreAndFindMatches() 160 max_length - cur_len); in StoreAndFindMatches() 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, in FindAllMatches() 232 max_length); in FindAllMatches() 239 if (best_len < max_length) { in FindAllMatches() 241 ring_buffer_mask, max_length, max_backward, &best_len, matches); in FindAllMatches() 249 &data[cur_ix_masked], minlen, max_length, 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 | backward_references_inc.h | 41 size_t max_length = pos_end - position; in CreateBackwardReferences() local 51 ringbuffer, ringbuffer_mask, dist_cache, position, max_length, in CreateBackwardReferences() 56 --max_length; in CreateBackwardReferences() 57 for (;; --max_length) { in CreateBackwardReferences() 61 BROTLI_MIN(size_t, sr.len - 1, max_length) : 0; in CreateBackwardReferences() 70 ringbuffer, ringbuffer_mask, dist_cache, position + 1, max_length, in CreateBackwardReferences() local
|
H A D | 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, in FindLongestMatch() 171 &data[prev_ix], &data[cur_ix_masked], max_length); in FindLongestMatch() 206 max_length); in FindLongestMatch() 237 max_length); in FindLongestMatch() 253 self->common, &data[cur_ix_masked], max_length, dictionary_distance, 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
|
H A D | hash_composite_inc.h | 114 const size_t max_length, const size_t max_backward, 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
|
/third_party/eudev/src/shared/ |
H A D | process-util.c | 52 int get_process_cmdline(pid_t pid, size_t max_length, bool comm_fallback, char **line) { in get_process_cmdline() argument 67 if (max_length == 0) { in get_process_cmdline() 87 r = new(char, max_length); in get_process_cmdline() 92 left = max_length; in get_process_cmdline()
|
/third_party/python/Modules/clinic/ |
H A D | _bz2module.c.h | 69 "decompress($self, /, data, max_length=-1)\n" 74 "If *max_length* is nonnegative, returns at most *max_length* bytes of\n" 80 "was less than *max_length* bytes, or because *max_length* was negative),\n" 92 Py_ssize_t max_length); 98 static const char * const _keywords[] = {"data", "max_length", NULL}; in _bz2_BZ2Decompressor_decompress() 103 Py_ssize_t max_length = -1; in _bz2_BZ2Decompressor_decompress() local 129 max_length = ival; in _bz2_BZ2Decompressor_decompress() 132 return_value = _bz2_BZ2Decompressor_decompress_impl(self, &data, max_length); in _bz2_BZ2Decompressor_decompress() [all...] |
H A D | _lzmamodule.c.h | 69 "decompress($self, /, data, max_length=-1)\n" 74 "If *max_length* is nonnegative, returns at most *max_length* bytes of\n" 80 "was less than *max_length* bytes, or because *max_length* was negative),\n" 92 Py_ssize_t max_length); 98 static const char * const _keywords[] = {"data", "max_length", NULL}; in _lzma_LZMADecompressor_decompress() 103 Py_ssize_t max_length = -1; in _lzma_LZMADecompressor_decompress() local 129 max_length = ival; in _lzma_LZMADecompressor_decompress() 132 return_value = _lzma_LZMADecompressor_decompress_impl(self, &data, max_length); in _lzma_LZMADecompressor_decompress() [all...] |
/third_party/ltp/testcases/kernel/device-drivers/v4l/user_space/ |
H A D | v4l2_validator.c | 86 int valid_string(char *str, unsigned int max_length) in valid_string() argument 92 while (i < max_length && str[i] != 0) { in valid_string() 104 if (i == max_length) { in valid_string()
|
/third_party/ffmpeg/libavcodec/ |
H A D | mjpegenc_huffman.c | 75 * @param max_length max length of an encoding 77 void ff_mjpegenc_huffman_compute_bits(PTable *prob_table, HuffTable *distincts, int size, int max_length) in ff_mjpegenc_huffman_compute_bits() argument 87 av_assert0(max_length > 0); in ff_mjpegenc_huffman_compute_bits() 95 for (times = 0; times <= max_length; times++) { in ff_mjpegenc_huffman_compute_bits() 102 if (times < max_length) { in ff_mjpegenc_huffman_compute_bits()
|
/third_party/python/Modules/ |
H A D | _bz2module.c | 21 OutputBuffer_InitAndGrow(_BlocksOutputBuffer *buffer, Py_ssize_t max_length, in OutputBuffer_InitAndGrow() argument 27 buffer, max_length, (void**) next_out); in OutputBuffer_InitAndGrow() 432 buffer is allocated dynamically and returned. At most max_length bytes are 436 decompress_buf(BZ2Decompressor *d, Py_ssize_t max_length) in decompress_buf() argument 439 compare against max_length and PyBytes_GET_SIZE we declare it as in decompress_buf() 445 if (OutputBuffer_InitAndGrow(&buffer, max_length, &bzs->next_out, &bzs->avail_out) < 0) { in decompress_buf() 472 if (OutputBuffer_GetDataSize(&buffer, bzs->avail_out) == max_length) { in decompress_buf() 493 decompress(BZ2Decompressor *d, char *data, size_t len, Py_ssize_t max_length) in decompress() argument 544 result = decompress_buf(d, max_length); in decompress() 606 max_length 625 _bz2_BZ2Decompressor_decompress_impl(BZ2Decompressor *self, Py_buffer *data, Py_ssize_t max_length) _bz2_BZ2Decompressor_decompress_impl() argument [all...] |
/third_party/PyYAML/lib/yaml/ |
H A D | error.py | 14 def get_snippet(self, indent=4, max_length=75): 21 if self.pointer-start > max_length/2-1: 29 if end-self.pointer > max_length/2-1:
|
/third_party/node/deps/brotli/c/dec/ |
H A D | huffman.c | 185 int max_length = -1; in BrotliBuildHuffmanTable() local 193 while (symbol_lists[max_length] == 0xFFFF) max_length--; in BrotliBuildHuffmanTable() 194 max_length += BROTLI_HUFFMAN_MAX_CODE_LENGTH + 1; in BrotliBuildHuffmanTable() 203 if (table_bits > max_length) { in BrotliBuildHuffmanTable() 204 table_bits = max_length; in BrotliBuildHuffmanTable() 234 for (len = root_bits + 1, step = 2; len <= max_length; ++len) { in BrotliBuildHuffmanTable()
|
/third_party/node/deps/v8/src/builtins/ |
H A D | builtins-arraybuffer.cc | 42 Handle<Object> max_length, InitializedFlag initialized) { in ConstructBuffer() 46 ResizableFlag resizable = max_length.is_null() ? ResizableFlag::kNotResizable in ConstructBuffer() 73 if (!TryNumberToSize(*max_length, &max_byte_length)) { in ConstructBuffer() 133 Handle<Object> max_length; in BUILTIN() local 136 isolate, max_length, in BUILTIN() 140 if (!max_length->IsUndefined(isolate)) { in BUILTIN() 142 isolate, number_max_length, Object::ToInteger(isolate, max_length)); in BUILTIN() 40 ConstructBuffer(Isolate* isolate, Handle<JSFunction> target, Handle<JSReceiver> new_target, Handle<Object> length, Handle<Object> max_length, InitializedFlag initialized) ConstructBuffer() argument
|
/third_party/skia/third_party/externals/brotli/c/dec/ |
H A D | huffman.c | 185 int max_length = -1; in BrotliBuildHuffmanTable() local 193 while (symbol_lists[max_length] == 0xFFFF) max_length--; in BrotliBuildHuffmanTable() 194 max_length += BROTLI_HUFFMAN_MAX_CODE_LENGTH + 1; in BrotliBuildHuffmanTable() 203 if (table_bits > max_length) { in BrotliBuildHuffmanTable() 204 table_bits = max_length; in BrotliBuildHuffmanTable() 234 for (len = root_bits + 1, step = 2; len <= max_length; ++len) { in BrotliBuildHuffmanTable()
|
/third_party/node/deps/v8/include/ |
H A D | v8-fast-api-calls.h | 874 * a given max_length. A CTypeInfo is passed as an argument, 878 * If the array length is larger than max_length or the array is of 889 uint32_t max_length); 896 Local<Array> src, int32_t* dst, uint32_t max_length) { in TryCopyAndConvertArrayToCppBuffer() 905 Local<Array> src, double* dst, uint32_t max_length) { in TryCopyAndConvertArrayToCppBuffer() 911 Local<Array> src, T* dst, uint32_t max_length); 917 uint32_t max_length); 923 uint32_t max_length); 929 uint32_t max_length); 935 uint32_t max_length); 895 TryCopyAndConvertArrayToCppBuffer( Local<Array> src, int32_t* dst, uint32_t max_length) TryCopyAndConvertArrayToCppBuffer() argument 904 TryCopyAndConvertArrayToCppBuffer( Local<Array> src, double* dst, uint32_t max_length) TryCopyAndConvertArrayToCppBuffer() argument [all...] |
/third_party/node/deps/v8/src/api/ |
H A D | api-inl.h | 268 uint32_t max_length) { in CopyAndConvertArrayToCppBuffer() 276 if (length > max_length) { in CopyAndConvertArrayToCppBuffer() 305 uint32_t max_length) { in TryCopyAndConvertArrayToCppBuffer() 307 max_length); in TryCopyAndConvertArrayToCppBuffer() 313 uint32_t max_length) { in TryToCopyAndConvertArrayToCppBuffer() 314 return CopyAndConvertArrayToCppBuffer<type_info_id, T>(src, dst, max_length); in TryToCopyAndConvertArrayToCppBuffer() 267 CopyAndConvertArrayToCppBuffer(Local<Array> src, T* dst, uint32_t max_length) CopyAndConvertArrayToCppBuffer() argument 303 TryCopyAndConvertArrayToCppBuffer(Local<Array> src, T* dst, uint32_t max_length) TryCopyAndConvertArrayToCppBuffer() argument 311 TryToCopyAndConvertArrayToCppBuffer(Local<Array> src, T* dst, uint32_t max_length) TryToCopyAndConvertArrayToCppBuffer() argument
|