Home
last modified time | relevance | path

Searched refs:value_count (Results 1 – 25 of 49) sorted by relevance

12

/third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/gpu/cuda_impl/
Dlinspace.cu21 __global__ void LinSpaceKernel(const T *start, const T *stop, const size_t value_count, T *output) { in LinSpaceKernel() argument
22 T add_value = ((*stop - *start) / (value_count - 1)); in LinSpaceKernel()
23 …for (size_t i = blockIdx.x * blockDim.x + threadIdx.x; i < value_count; i += gridDim.x * blockDim.… in LinSpaceKernel()
28 void calLinSpace(const T *start, const T *stop, const size_t value_count, T *output, cudaStream_t c… in calLinSpace() argument
29 …LinSpaceKernel<<<GET_BLOCKS(value_count), GET_THREADS, 0, cuda_stream>>>(start, stop, value_count,… in calLinSpace()
31 template void calLinSpace<float>(const float *start, const float *stop, const size_t value_count, f…
Dlinspace.cuh22 void calLinSpace(const T *start, const T *stop, const size_t value_count, T *output, cudaStream_t c…
/third_party/protobuf/src/google/protobuf/compiler/cpp/
Dcpp_enum.cc53 for (int i = 0; i < descriptor->value_count(); i++) { in ShouldGenerateArraySize()
65 for (int i = 0; i < descriptor->value_count(); ++i) { in CountUniqueValues()
100 for (int i = 0; i < descriptor_->value_count(); i++) { in GenerateDefinition()
125 if (descriptor_->value_count() > 0) format(",\n"); in GenerateDefinition()
216 for (int j = 0; j < descriptor_->value_count(); j++) { in GenerateSymbolImports()
286 for (int j = 0; j < descriptor_->value_count(); j++) { in GenerateMethods()
320 for (int i = 0; i < descriptor_->value_count(); i++) { in GenerateMethods()
401 descriptor_->value_count()); in GenerateMethods()
413 for (int i = 0; i < descriptor_->value_count(); i++) { in GenerateMethods()
/third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/gpu/math/
Dlinspace.h64 auto value_count = AnfAlgo::GetOutputRealDeviceShapeIfExist(kernel_node, 0); in Init() local
65 …l_input_ = CHECK_NULL_INPUT(input_1) || CHECK_NULL_INPUT(input_2) || CHECK_NULL_INPUT(value_count); in Init()
79 if (value_count.size() != 1) { in Init()
80 …R) << "For LinShape, output shape incorrect rank. Expect Rank: 1, got Rank: " << value_count.size() in Init()
84 value_count_ = value_count[0]; in Init()
/third_party/protobuf/src/google/protobuf/compiler/java/
Djava_enum.cc58 for (int i = 0; i < descriptor_->value_count(); i++) { in EnumGenerator()
139 for (int i = 0; i < descriptor_->value_count(); i++) { in Generate()
312 for (int i = 0; i < descriptor_->value_count(); i++) { in Generate()
376 if (canonical_values_.size() != descriptor_->value_count()) { in CanUseEnumValues()
379 for (int i = 0; i < descriptor_->value_count(); i++) { in CanUseEnumValues()
Djava_enum_lite.cc59 for (int i = 0; i < descriptor_->value_count(); i++) { in EnumLiteGenerator()
121 for (int i = 0; i < descriptor_->value_count(); i++) { in Generate()
/third_party/python/Python/
Dast_unparse.c124 Py_ssize_t i, value_count; in append_ast_boolop() local
132 value_count = asdl_seq_LEN(values); in append_ast_boolop()
134 for (i = 0; i < value_count; ++i) { in append_ast_boolop()
311 Py_ssize_t i, value_count; in append_ast_dict() local
315 value_count = asdl_seq_LEN(e->v.Dict.values); in append_ast_dict()
317 for (i = 0; i < value_count; i++) { in append_ast_dict()
622 Py_ssize_t i, value_count; in build_fstring_body() local
628 value_count = asdl_seq_LEN(values); in build_fstring_body()
629 for (i = 0; i < value_count; ++i) { in build_fstring_body()
/third_party/glib/gio/
Dgwin32registrykey.c263 new_iter->value_count = iter->value_count; in G_DEFINE_BOXED_TYPE()
1069 DWORD value_count; in g_win32_registry_value_iter_init() local
1079 &value_count, &max_value_len, in g_win32_registry_value_iter_init()
1092 iter->value_count = value_count; in g_win32_registry_value_iter_init()
1156 return iter->value_count; in g_win32_registry_value_iter_n_values()
1295 if G_UNLIKELY (iter->counter >= iter->value_count) in g_win32_registry_value_iter_next()
1306 if (iter->counter >= iter->value_count) in g_win32_registry_value_iter_next()
1329 iter->value_count = 0; in g_win32_registry_value_iter_next()
1371 if G_UNLIKELY (iter->counter >= iter->value_count) in g_win32_registry_value_iter_get_value_type()
1410 if G_UNLIKELY (iter->counter >= iter->value_count) in g_win32_registry_value_iter_get_name_w()
[all …]
/third_party/mesa3d/src/gallium/auxiliary/gallivm/
Dlp_bld_nir.h275 unsigned value_count) in lp_nir_array_build_gather_values() argument
277 LLVMTypeRef arr_type = LLVMArrayType(LLVMTypeOf(values[0]), value_count); in lp_nir_array_build_gather_values()
281 for (i = 0; i < value_count; i++) { in lp_nir_array_build_gather_values()
Dlp_bld_gather.h67 unsigned value_count);
Dlp_bld_gather.c589 unsigned value_count) in lp_build_gather_values() argument
591 LLVMTypeRef vec_type = LLVMVectorType(LLVMTypeOf(values[0]), value_count); in lp_build_gather_values()
596 for (i = 0; i < value_count; i++) { in lp_build_gather_values()
/third_party/mindspore/mindspore/nn/layer/
Dembedding.py596value_count = self.count_op(self.abs(self.reshape(input_values, (-1,))), field_ids, num_segments)
597 value_zeros = self.cast(self.max_no_equal(value_count, 0.0), mstype.float32)
602 value_count = self.count_op(self.abs(input_values), field_ids, num_segments)
603 value_count = self.expand(value_count, -1)
604 merged_vectors = self.div_no_nan(merged_vectors, value_count)
/third_party/gstreamer/gstplugins_bad/gst-libs/gst/codecparsers/
Dgstjpegparser.c422 guint32 value_count; in gst_jpeg_segment_parse_huffman_table() local
447 value_count = 0; in gst_jpeg_segment_parse_huffman_table()
449 value_count += huf_table->huf_bits[i]; in gst_jpeg_segment_parse_huffman_table()
450 READ_BYTES (&br, huf_table->huf_values, value_count); in gst_jpeg_segment_parse_huffman_table()
/third_party/protobuf/src/google/protobuf/compiler/csharp/
Dcsharp_enum.cc66 for (int i = 0; i < descriptor_->value_count(); i++) { in Generate()
/third_party/abseil-cpp/absl/random/internal/
Dnanobenchmark.cc363 for (const auto& value_count : unique) { in CountingSort() local
364 std::fill(p, p + value_count.second, value_count.first); in CountingSort()
365 p += value_count.second; in CountingSort()
/third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/
Dnanobenchmark.cc363 for (const auto& value_count : unique) { in CountingSort() local
364 std::fill(p, p + value_count.second, value_count.first); in CountingSort()
365 p += value_count.second; in CountingSort()
/third_party/mindspore/mindspore/ccsrc/debug/debugger/
Dtensor_summary.cc191 unsigned int value_count = zero_count_ + neg_zero_count_ + pos_zero_count_; in TensorStatistics() local
192 avg_ = sum_elements / value_count; in TensorStatistics()
/third_party/protobuf/src/google/protobuf/compiler/objectivec/
Dobjectivec_enum.cc59 for (int i = 0; i < descriptor_->value_count(); i++) { in EnumGenerator()
/third_party/libpng/contrib/tools/
Dpngcp.c284 png_byte value_count; /* length of the list of values: */ member
816 return entry+1U >= options[opt].value_count /* missing range_hi */ || in opt_list_end()
821 return entry+1U >= options[opt].value_count /* missing 'all' */ || in opt_list_end()
840 entry = options[opt].value_count; in push_opt()
860 assert(entry+1 < options[opt].value_count && in push_opt()
923 assert(entry+1U < options[opt].value_count); in next_opt()
1339 for (j=1U; j<=options[opt].value_count; ++j) in find_val()
/third_party/skia/third_party/externals/libpng/contrib/tools/
Dpngcp.c284 png_byte value_count; /* length of the list of values: */ member
816 return entry+1U >= options[opt].value_count /* missing range_hi */ || in opt_list_end()
821 return entry+1U >= options[opt].value_count /* missing 'all' */ || in opt_list_end()
840 entry = options[opt].value_count; in push_opt()
860 assert(entry+1 < options[opt].value_count && in push_opt()
923 assert(entry+1U < options[opt].value_count); in next_opt()
1339 for (j=1U; j<=options[opt].value_count; ++j) in find_val()
/third_party/flutter/skia/third_party/externals/libpng/contrib/tools/
Dpngcp.c284 png_byte value_count; /* length of the list of values: */ member
816 return entry+1U >= options[opt].value_count /* missing range_hi */ || in opt_list_end()
821 return entry+1U >= options[opt].value_count /* missing 'all' */ || in opt_list_end()
840 entry = options[opt].value_count; in push_opt()
860 assert(entry+1 < options[opt].value_count && in push_opt()
923 assert(entry+1U < options[opt].value_count); in next_opt()
1339 for (j=1U; j<=options[opt].value_count; ++j) in find_val()
/third_party/flutter/skia/third_party/skcms/
Dskcms.cc352 uint8_t value_count [4]; member
364 uint32_t value_count = read_big_u32(curvTag->value_count); in read_curve_curv() local
365 if (size < SAFE_FIXED_SIZE(curv_Layout) + value_count * SAFE_SIZEOF(uint16_t)) { in read_curve_curv()
370 *curve_size = SAFE_FIXED_SIZE(curv_Layout) + value_count * SAFE_SIZEOF(uint16_t); in read_curve_curv()
373 if (value_count < 2) { in read_curve_curv()
381 if (value_count == 0) { in read_curve_curv()
391 curve->table_entries = value_count; in read_curve_curv()
/third_party/mesa3d/src/amd/llvm/
Dac_llvm_build.h192 unsigned value_count, unsigned component);
195 unsigned value_count, unsigned value_stride, bool load,
198 unsigned value_count);
/third_party/protobuf/ruby/ext/google/protobuf_c/
Dstorage.c550 layout->value_count = 0; in create_layout()
582 layout->value_count = layout->repeated_count + layout->map_count; in create_layout()
596 layout->value_count++; in create_layout()
1020 for (i = 0; i < layout->value_count; i++) { in layout_mark()
/third_party/skia/third_party/skcms/
Dskcms.cc515 uint8_t value_count [4]; member
527 uint32_t value_count = read_big_u32(curvTag->value_count); in read_curve_curv() local
528 if (size < SAFE_FIXED_SIZE(curv_Layout) + value_count * SAFE_SIZEOF(uint16_t)) { in read_curve_curv()
533 *curve_size = SAFE_FIXED_SIZE(curv_Layout) + value_count * SAFE_SIZEOF(uint16_t); in read_curve_curv()
536 if (value_count < 2) { in read_curve_curv()
544 if (value_count == 0) { in read_curve_curv()
554 curve->table_entries = value_count; in read_curve_curv()

12