Home
last modified time | relevance | path

Searched refs:input_size (Results 1 – 25 of 133) sorted by relevance

123456

/third_party/boost/boost/compute/algorithm/detail/
Dinplace_reduce.hpp37 size_t input_size = iterator_range_size(first, last); in inplace_reduce() local
38 if(input_size < 2){ in inplace_reduce()
46 size_t block_count = input_size / (block_size * values_per_thread); in inplace_reduce()
47 if(block_count * block_size * values_per_thread != input_size) in inplace_reduce()
100 while(input_size > 1){ in inplace_reduce()
102 kernel.set_arg(input_size_arg, static_cast<uint_>(input_size)); in inplace_reduce()
111 input_size = in inplace_reduce()
113 std::ceil(float(input_size) / (block_size * values_per_thread) in inplace_reduce()
117 block_count = input_size / (block_size * values_per_thread); in inplace_reduce()
118 if(block_count * block_size * values_per_thread != input_size) in inplace_reduce()
/third_party/skia/third_party/externals/brotli/research/
Dfind_opt_references.cc43 void ReadInput(FILE* fin, input_type* storage, size_t input_size) { in ReadInput() argument
51 assert(last_pos == input_size); in ReadInput()
208 int input_size = ftell(fin); in main() local
210 printf("The file size is %u bytes\n", input_size); in main()
212 input_type* storage = new input_type[input_size]; in main()
214 ReadInput(fin, storage, input_size); in main()
217 sarray_type* sarray = new sarray_type[input_size]; in main()
218 saisxx(storage, sarray, input_size); in main()
222 uint32_t* pos = new uint32_t[input_size]; in main()
224 lcp_type* lcp = new lcp_type[input_size]; in main()
[all …]
/third_party/uboot/u-boot-2020.01/drivers/net/
Dnetconsole.c18 static int input_size; /* char count in input buffer */ variable
45 if (input_size) in nc_handler()
148 if (input_size == sizeof(input_buffer)) in nc_input_packet()
150 if (len > sizeof(input_buffer) - input_size) in nc_input_packet()
151 len = sizeof(input_buffer) - input_size; in nc_input_packet()
153 end = input_offset + input_size; in nc_input_packet()
167 input_size += len; in nc_input_packet()
284 while (!input_size) in nc_stdio_getc()
293 input_size--; in nc_stdio_getc()
309 if (input_size) in nc_stdio_tstc()
[all …]
/third_party/jerryscript/jerry-core/ecma/builtin-objects/
Decma-builtin-global.c200 … lit_utf8_size_t input_size, /**< routine's first argument's in ecma_builtin_global_object_decode_uri_helper() argument
205 lit_utf8_byte_t *input_end_p = input_start_p + input_size; in ecma_builtin_global_object_decode_uri_helper()
421 … lit_utf8_size_t input_size, /**< routine's first argument's in ecma_builtin_global_object_encode_uri_helper() argument
431 const lit_utf8_byte_t *input_end_p = input_start_p + input_size; in ecma_builtin_global_object_encode_uri_helper()
588 lit_utf8_size_t input_size) /**< routine's first argument's in ecma_builtin_global_object_escape() argument
596 const lit_utf8_byte_t *input_end_p = input_start_p + input_size; in ecma_builtin_global_object_escape()
694 lit_utf8_size_t input_size) /**< routine's first argument's in ecma_builtin_global_object_unescape() argument
698 const lit_utf8_byte_t *input_end_p = input_start_p + input_size; in ecma_builtin_global_object_unescape()
847 lit_utf8_size_t input_size = ecma_string_get_size (str_p); in ecma_builtin_global_dispatch_routine() local
850 input_size + 1, in ecma_builtin_global_dispatch_routine()
[all …]
/third_party/boost/libs/hana/benchmark/find_if/
Dcompile.fusion.vector.erb.cpp5 <% if input_size > 10 %>
6 #define FUSION_MAX_VECTOR_SIZE <%= ((input_size + 9) / 10) * 10 %>
19 : mpl::integral_c<bool, N::type::value == <%= input_size %>>
25 <%= (1..input_size).map { |n| "mpl::integral_c<int, #{n}>{}" }.join(', ') %>
Dcompile.fusion.list.erb.cpp5 <% if input_size > 10 %>
6 #define FUSION_MAX_LIST_SIZE <%= ((input_size + 9) / 10) * 10 %>
19 : mpl::integral_c<bool, N::type::value == <%= input_size %>>
25 <%= (1..input_size).map { |n| "mpl::integral_c<int, #{n}>{}" }.join(', ') %>
/third_party/boost/boost/compute/algorithm/
Dcount_if.hpp43 size_t input_size = detail::iterator_range_size(first, last); in count_if() local
44 if(input_size == 0){ in count_if()
49 if(input_size < 1024){ in count_if()
57 if(input_size < 32){ in count_if()
/third_party/node/deps/brotli/c/enc/
Dhash_composite_inc.h59 size_t input_size, const uint8_t* BROTLI_RESTRICT data) { in FN()
63 FN_A(HashMemAllocInBytes)(self->params, one_shot, input_size); in FN()
68 FN_A(Prepare)(&self->ha, one_shot, input_size, data); in FN()
69 FN_B(Prepare)(&self->hb, one_shot, input_size, data); in FN()
74 size_t input_size) { in FN()
75 return FN_A(HashMemAllocInBytes)(params, one_shot, input_size) + in FN()
76 FN_B(HashMemAllocInBytes)(params, one_shot, input_size); in FN()
Dcompress_fragment_two_pass.c240 size_t block_size, size_t input_size, const uint8_t* base_ip, int* table, in CreateCommands() argument
261 input_size - kInputMarginBytes); in CreateCommands()
525 const uint8_t* input, size_t input_size, size_t num_literals) { in ShouldCompress() argument
526 double corpus_size = (double)input_size; in ShouldCompress()
533 for (i = 0; i < input_size; i += SAMPLE_RATE) { in ShouldCompress()
548 static void EmitUncompressedMetaBlock(const uint8_t* input, size_t input_size, in EmitUncompressedMetaBlock() argument
550 BrotliStoreMetaBlockHeader(input_size, 1, storage_ix, storage); in EmitUncompressedMetaBlock()
552 memcpy(&storage[*storage_ix >> 3], input, input_size); in EmitUncompressedMetaBlock()
553 *storage_ix += input_size << 3; in EmitUncompressedMetaBlock()
558 MemoryManager* m, const uint8_t* input, size_t input_size, in BrotliCompressFragmentTwoPassImpl() argument
[all …]
Dcompress_fragment.c74 const size_t input_size, in BuildAndStoreLiteralPrefixCode() argument
82 if (input_size < (1 << 15)) { in BuildAndStoreLiteralPrefixCode()
83 for (i = 0; i < input_size; ++i) { in BuildAndStoreLiteralPrefixCode()
86 histogram_total = input_size; in BuildAndStoreLiteralPrefixCode()
96 for (i = 0; i < input_size; i += kSampleRate) { in BuildAndStoreLiteralPrefixCode()
99 histogram_total = (input_size + kSampleRate - 1) / kSampleRate; in BuildAndStoreLiteralPrefixCode()
426 MemoryManager* m, const uint8_t* input, size_t input_size, in BrotliCompressFragmentFastImpl() argument
448 size_t block_size = BROTLI_MIN(size_t, input_size, kFirstBlockSize); in BrotliCompressFragmentFastImpl()
500 input_size - kInputMarginBytes); in BrotliCompressFragmentFastImpl()
576 input_size -= (size_t)(base - input); in BrotliCompressFragmentFastImpl()
[all …]
/third_party/skia/third_party/externals/brotli/c/enc/
Dhash_composite_inc.h59 size_t input_size, const uint8_t* BROTLI_RESTRICT data) { in FN()
63 FN_A(HashMemAllocInBytes)(self->params, one_shot, input_size); in FN()
68 FN_A(Prepare)(&self->ha, one_shot, input_size, data); in FN()
69 FN_B(Prepare)(&self->hb, one_shot, input_size, data); in FN()
74 size_t input_size) { in FN()
75 return FN_A(HashMemAllocInBytes)(params, one_shot, input_size) + in FN()
76 FN_B(HashMemAllocInBytes)(params, one_shot, input_size); in FN()
Dcompress_fragment_two_pass.c240 size_t block_size, size_t input_size, const uint8_t* base_ip, int* table, in CreateCommands() argument
261 input_size - kInputMarginBytes); in CreateCommands()
525 const uint8_t* input, size_t input_size, size_t num_literals) { in ShouldCompress() argument
526 double corpus_size = (double)input_size; in ShouldCompress()
533 for (i = 0; i < input_size; i += SAMPLE_RATE) { in ShouldCompress()
548 static void EmitUncompressedMetaBlock(const uint8_t* input, size_t input_size, in EmitUncompressedMetaBlock() argument
550 BrotliStoreMetaBlockHeader(input_size, 1, storage_ix, storage); in EmitUncompressedMetaBlock()
552 memcpy(&storage[*storage_ix >> 3], input, input_size); in EmitUncompressedMetaBlock()
553 *storage_ix += input_size << 3; in EmitUncompressedMetaBlock()
558 MemoryManager* m, const uint8_t* input, size_t input_size, in BrotliCompressFragmentTwoPassImpl() argument
[all …]
Dcompress_fragment.c74 const size_t input_size, in BuildAndStoreLiteralPrefixCode() argument
82 if (input_size < (1 << 15)) { in BuildAndStoreLiteralPrefixCode()
83 for (i = 0; i < input_size; ++i) { in BuildAndStoreLiteralPrefixCode()
86 histogram_total = input_size; in BuildAndStoreLiteralPrefixCode()
96 for (i = 0; i < input_size; i += kSampleRate) { in BuildAndStoreLiteralPrefixCode()
99 histogram_total = (input_size + kSampleRate - 1) / kSampleRate; in BuildAndStoreLiteralPrefixCode()
426 MemoryManager* m, const uint8_t* input, size_t input_size, in BrotliCompressFragmentFastImpl() argument
448 size_t block_size = BROTLI_MIN(size_t, input_size, kFirstBlockSize); in BrotliCompressFragmentFastImpl()
500 input_size - kInputMarginBytes); in BrotliCompressFragmentFastImpl()
576 input_size -= (size_t)(base - input); in BrotliCompressFragmentFastImpl()
[all …]
/third_party/boost/libs/hana/benchmark/transform/
Dcompile.fusion.list.erb.cpp5 <% if input_size > 10 %>
6 #define FUSION_MAX_LIST_SIZE <%= ((input_size + 9) / 10) * 10 %>
25 <%= (1..input_size).map { |n| "x<#{n}>{}" }.join(', ') %>
Dcompile.fusion.vector.erb.cpp5 <% if input_size > 10 %>
6 #define FUSION_MAX_VECTOR_SIZE <%= ((input_size + 9) / 10) * 10 %>
25 <%= (1..input_size).map { |n| "x<#{n}>{}" }.join(', ') %>
Dexecute.std.array.erb.cpp15 std::array<int, <%= input_size %>> values = {{ in main()
16 <%= input_size.times.map { 'std::rand()' }.join(', ') %> in main()
19 std::array<long long, <%= input_size %>> results{}; in main()
Dexecute.fusion.vector.erb.cpp5 <% if input_size > 10 %>
6 #define FUSION_MAX_VECTOR_SIZE <%= ((input_size + 9) / 10) * 10 %>
24 <%= input_size.times.map { 'std::rand()' }.join(', ') %>
Dexecute.fusion.list.erb.cpp5 <% if input_size > 10 %>
6 #define FUSION_MAX_LIST_SIZE <%= ((input_size + 9) / 10) * 10 %>
24 <%= input_size.times.map { 'std::rand()' }.join(', ') %>
/third_party/boost/libs/hana/benchmark/fold_left/
Dexecute.fusion.vector.erb.cpp6 <% if input_size > 10 %>
7 #define FUSION_MAX_VECTOR_SIZE <%= ((input_size + 9) / 10) * 10 %>
24 <%= input_size.times.map { 'std::rand()' }.join(', ') %>
Dexecute.fusion.list.erb.cpp6 <% if input_size > 10 %>
7 #define FUSION_MAX_LIST_SIZE <%= ((input_size + 9) / 10) * 10 %>
24 <%= input_size.times.map { 'std::rand()' }.join(', ') %>
Dcompile.fusion.vector.erb.cpp5 <% if input_size > 10 %>
6 #define FUSION_MAX_VECTOR_SIZE <%= ((input_size + 9) / 10) * 10 %>
26 <%= (1..input_size).map { |n| "x<#{n}>{}" }.join(', ') %>
Dcompile.fusion.list.erb.cpp5 <% if input_size > 10 %>
6 #define FUSION_MAX_LIST_SIZE <%= ((input_size + 9) / 10) * 10 %>
26 <%= (1..input_size).map { |n| "x<#{n}>{}" }.join(', ') %>
/third_party/ffmpeg/libavcodec/
Ddcadec.c150 int input_size = avpkt->size; in dcadec_decode_frame() local
154 if (input_size < MIN_PACKET_SIZE || input_size > MAX_PACKET_SIZE) { in dcadec_decode_frame()
162 av_fast_padded_malloc(&s->buffer, &s->buffer_size, input_size); in dcadec_decode_frame()
166 for (i = 0, ret = AVERROR_INVALIDDATA; i < input_size - MIN_PACKET_SIZE + 1 && ret < 0; i++) in dcadec_decode_frame()
167 … ret = avpriv_dca_convert_bitstream(input + i, input_size - i, s->buffer, s->buffer_size); in dcadec_decode_frame()
175 input_size = ret; in dcadec_decode_frame()
184 if ((ret = ff_dca_core_parse(&s->core, input, input_size)) < 0) in dcadec_decode_frame()
191 if (input_size - 4 > frame_size) { in dcadec_decode_frame()
193 input_size -= frame_size; in dcadec_decode_frame()
202 if ((ret = ff_dca_exss_parse(&s->exss, input, input_size)) < 0) { in dcadec_decode_frame()
/third_party/boost/libs/hana/benchmark/reverse/
Dnomove.fusion.vector.erb.cpp5 <% if input_size > 10 %>
6 #define FUSION_MAX_VECTOR_SIZE <%= ((input_size + 9) / 10) * 10 %>
26 <%= input_size.times.map { 's' }.join(', ') %>
Dmove.fusion.vector.erb.cpp5 <% if input_size > 10 %>
6 #define FUSION_MAX_VECTOR_SIZE <%= ((input_size + 9) / 10) * 10 %>
26 <%= input_size.times.map { 's' }.join(', ') %>

123456