| /xsrc/external/mit/brotli/dist/c/enc/ |
| H A D | compress_fragment_two_pass.h | 31 REQUIRES: "input_size" is greater than zero, or "is_last" is 1. 32 REQUIRES: "input_size" is less or equal to maximal metablock size (1 << 24). 37 OUTPUT: maximal copy distance <= |input_size| 41 size_t input_size,
|
| H A D | compress_fragment.h | 39 REQUIRES: "input_size" is greater than zero, or "is_last" is 1. 40 REQUIRES: "input_size" is less or equal to maximal metablock size (1 << 24). 43 OUTPUT: maximal copy distance <= |input_size| 47 size_t input_size,
|
| H A D | hash_composite_inc.h | 52 remembered here) because we don't get the one_shot and input_size params 59 size_t input_size, const uint8_t* BROTLI_RESTRICT data) { 63 FN_A(HashMemAllocInBytes)(self->params, one_shot, input_size); 68 FN_A(Prepare)(&self->ha, one_shot, input_size, data); 69 FN_B(Prepare)(&self->hb, one_shot, input_size, data); 74 size_t input_size) { 75 return FN_A(HashMemAllocInBytes)(params, one_shot, input_size) + 76 FN_B(HashMemAllocInBytes)(params, one_shot, input_size);
|
| H A D | compress_fragment.c | 74 const size_t input_size, 82 if (input_size < (1 << 15)) { 83 for (i = 0; i < input_size; ++i) { 86 histogram_total = input_size; 96 for (i = 0; i < input_size; i += kSampleRate) { 99 histogram_total = (input_size + kSampleRate - 1) / kSampleRate; 426 MemoryManager* m, const uint8_t* input, size_t input_size, 448 size_t block_size = BROTLI_MIN(size_t, input_size, kFirstBlockSize); 500 input_size - kInputMarginBytes); 576 input_size 72 BuildAndStoreLiteralPrefixCode(MemoryManager * m,const uint8_t * input,const size_t input_size,uint8_t depths[256],uint16_t bits[256],size_t * storage_ix,uint8_t * storage) argument 425 BrotliCompressFragmentFastImpl(MemoryManager * m,const uint8_t * input,size_t input_size,BROTLI_BOOL is_last,int * table,size_t table_bits,uint8_t cmd_depth[128],uint16_t cmd_bits[128],size_t * cmd_code_numbits,uint8_t * cmd_code,size_t * storage_ix,uint8_t * storage) argument [all...] |
| H A D | compress_fragment_two_pass.c | 240 size_t block_size, size_t input_size, const uint8_t* base_ip, int* table, 261 input_size - kInputMarginBytes); 525 const uint8_t* input, size_t input_size, size_t num_literals) { 526 double corpus_size = (double)input_size; 533 for (i = 0; i < input_size; i += SAMPLE_RATE) { 548 static void EmitUncompressedMetaBlock(const uint8_t* input, size_t input_size, argument 550 BrotliStoreMetaBlockHeader(input_size, 1, storage_ix, storage); 552 memcpy(&storage[*storage_ix >> 3], input, input_size); 553 *storage_ix += input_size << 3; 558 MemoryManager* m, const uint8_t* input, size_t input_size, 239 CreateCommands(const uint8_t * input,size_t block_size,size_t input_size,const uint8_t * base_ip,int * table,size_t table_bits,size_t min_match,uint8_t ** literals,uint32_t ** commands) argument 524 ShouldCompress(const uint8_t * input,size_t input_size,size_t num_literals) argument 557 BrotliCompressFragmentTwoPassImpl(MemoryManager * m,const uint8_t * input,size_t input_size,BROTLI_BOOL is_last,uint32_t * command_buf,uint8_t * literal_buf,int * table,size_t table_bits,size_t min_match,size_t * storage_ix,uint8_t * storage) argument [all...] |
| H A D | hash.h | 407 BROTLI_BOOL one_shot, const size_t input_size) { 411 return HashMemAllocInBytesH ## N(params, one_shot, input_size); 422 size_t input_size, BROTLI_BOOL is_last) { 427 alloc_size = HasherSize(params, one_shot, input_size); 451 one_shot, input_size, data); \ 467 BrotliEncoderParams* params, size_t position, size_t input_size, 469 HasherSetup(m, hasher, params, data, position, input_size, is_last); 476 input_size, position, data, mask); \ 406 HasherSize(const BrotliEncoderParams * params,BROTLI_BOOL one_shot,const size_t input_size) argument 420 HasherSetup(MemoryManager * m,Hasher * hasher,BrotliEncoderParams * params,const uint8_t * data,size_t position,size_t input_size,BROTLI_BOOL is_last) argument 465 InitOrStitchToPreviousBlock(MemoryManager * m,Hasher * hasher,const uint8_t * data,size_t mask,BrotliEncoderParams * params,size_t position,size_t input_size,BROTLI_BOOL is_last) argument
|
| H A D | hash_rolling_inc.h | 79 size_t input_size, const uint8_t* BROTLI_RESTRICT data) { 82 if (input_size < CHUNKLEN) return; 93 size_t input_size) { 97 BROTLI_UNUSED(input_size);
|
| H A D | hash_forgetful_chain_inc.h | 94 size_t input_size, const uint8_t* BROTLI_RESTRICT data) { 100 if (one_shot && input_size <= partial_prepare_threshold) { 102 for (i = 0; i < input_size; ++i) { 121 size_t input_size) { 124 BROTLI_UNUSED(input_size);
|
| H A D | hash_longest_match64_inc.h | 80 size_t input_size, const uint8_t* BROTLI_RESTRICT data) { 84 if (one_shot && input_size <= partial_prepare_threshold) { 86 for (i = 0; i < input_size; ++i) { 98 size_t input_size) { 102 BROTLI_UNUSED(input_size);
|
| H A D | hash_longest_match_inc.h | 80 size_t input_size, const uint8_t* BROTLI_RESTRICT data) { 84 if (one_shot && input_size <= partial_prepare_threshold) { 86 for (i = 0; i < input_size; ++i) { 97 size_t input_size) { 101 BROTLI_UNUSED(input_size);
|
| H A D | hash_longest_match_quickly_inc.h | 57 size_t input_size, const uint8_t* BROTLI_RESTRICT data) { 61 if (one_shot && input_size <= partial_prepare_threshold) { 63 for (i = 0; i < input_size; ++i) { 85 size_t input_size) { 88 BROTLI_UNUSED(input_size);
|
| H A D | hash_to_binary_tree_inc.h | 69 size_t input_size, const uint8_t* BROTLI_RESTRICT data) { 75 BROTLI_UNUSED(input_size); 83 size_t input_size) { 85 if (one_shot && input_size < num_nodes) { 86 num_nodes = input_size;
|
| H A D | encode.c | 221 static size_t HashTableSize(size_t max_table_size, size_t input_size) { argument 223 while (htsize < max_table_size && htsize < input_size) { 230 size_t input_size, size_t* table_size) { 237 size_t htsize = HashTableSize(max_table_size, input_size); 851 const size_t input_size, 855 RingBufferWrite(m, input_buffer, input_size, ringbuffer_); 857 s->input_pos_ += input_size; 1205 int lgwin, size_t input_size, const uint8_t* input_buffer, 1220 input_size, BROTLI_MAX_BACKWARD_LIMIT(lgwin) + BROTLI_WINDOW_GAP); 1249 BROTLI_DCHECK(input_size < 229 GetHashTable(BrotliEncoderState * s,int quality,size_t input_size,size_t * table_size) argument 850 CopyInputToRingBuffer(BrotliEncoderState * s,const size_t input_size,const uint8_t * input_buffer) argument 1204 BrotliCompressBufferQuality10(int lgwin,size_t input_size,const uint8_t * input_buffer,size_t * encoded_size,uint8_t * encoded_buffer) argument 1426 BrotliEncoderMaxCompressedSize(size_t input_size) argument 1439 MakeUncompressedStream(const uint8_t * input,size_t input_size,uint8_t * output) argument 1471 BrotliEncoderCompress(int quality,int lgwin,BrotliEncoderMode mode,size_t input_size,const uint8_t * input_buffer,size_t * encoded_size,uint8_t * encoded_buffer) argument [all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r600/ |
| H A D | evergreen_compute_internal.h | 48 unsigned input_size; member in struct:r600_pipe_compute
|
| H A D | evergreen_compute.c | 422 shader->input_size = cso->req_input_mem; 515 unsigned input_size; local in function:evergreen_compute_upload_input 525 if (shader->input_size == 0) { 528 input_size = shader->input_size + 36; 533 PIPE_USAGE_IMMUTABLE, input_size); 536 u_box_1d(0, input_size, &box); 557 memcpy(kernel_parameters_start, info->input, shader->input_size); 559 for (i = 0; i < (input_size / 4); i++) { 571 evergreen_cs_set_constant_buffer(rctx, 0, 0, input_size, [all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/radeonsi/ |
| H A D | si_compute.h | 37 unsigned input_size; member in struct:si_compute
|
| H A D | si_compute.c | 244 program->input_size = cso->req_input_mem; 698 u_upload_alloc(sctx->b.const_uploader, 0, program->input_size, 708 memcpy(kernel_args, info->input, program->input_size); 710 for (unsigned i = 0; i < program->input_size / 4; i++) {
|
| /xsrc/external/mit/brotli/dist/c/include/brotli/ |
| H A D | encode.h | 273 * Calculates the output size bound for the given @p input_size. 279 * @param input_size size of projected input 282 BROTLI_ENC_API size_t BrotliEncoderMaxCompressedSize(size_t input_size); 290 * @note If ::BrotliEncoderMaxCompressedSize(@p input_size) returns non-zero 301 * @param input_size size of @p input_buffer 302 * @param input_buffer input data buffer with at least @p input_size 313 int quality, int lgwin, BrotliEncoderMode mode, size_t input_size, 314 const uint8_t input_buffer[BROTLI_ARRAY_PARAM(input_size)],
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/radeonsi/ |
| H A D | si_compute.h | 51 unsigned input_size; member in struct:si_compute
|
| H A D | si_compute.c | 211 program->input_size = cso->req_input_mem; 669 kernel_args_size = program->input_size + num_work_size_bytes; 691 program->input_size); 932 if ((program->input_size ||
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/ |
| H A D | evergreen_compute_internal.h | 85 unsigned input_size; member in struct:r600_pipe_compute
|
| H A D | evergreen_compute.c | 440 shader->input_size = cso->req_input_mem; 536 unsigned input_size; local in function:evergreen_compute_upload_input 546 if (shader->input_size == 0) { 549 input_size = shader->input_size + 36; 554 PIPE_USAGE_IMMUTABLE, input_size); 557 u_box_1d(0, input_size, &box); 578 memcpy(kernel_parameters_start, info->input, shader->input_size); 580 for (i = 0; i < (input_size / 4); i++) { 592 evergreen_cs_set_constant_buffer(rctx, 0, 0, input_size, [all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/ |
| H A D | nir_opcodes.py | 156 def unop_horiz(name, output_size, output_type, input_size, input_type, 158 opcode(name, output_size, output_type, [input_size], [input_type],
|
| /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/ |
| H A D | ir3_shader.h | 575 uint32_t input_size; member in struct:ir3_shader_variant
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| H A D | nir_opcodes.py | 168 def unop_horiz(name, output_size, output_type, input_size, input_type, 170 opcode(name, output_size, output_type, [input_size], [input_type],
|