| /dports/misc/tvm/incubator-tvm-0.6.1/include/tvm/runtime/ |
| H A D | ndarray.h | 438 int64_t num_elems = 1;
440 num_elems *= tensor->shape[i];
442 int64_t data_byte_size = type_bytes * num_elems;
457 dmlc::ByteSwap(dmlc::BeginPtr(bytes), type_bytes, num_elems);
493 int64_t num_elems = 1;
496 num_elems *= ret->shape[i];
501 CHECK(data_byte_size == num_elems * elem_bytes)
506 dmlc::ByteSwap(ret->data, elem_bytes, num_elems);
|
| /dports/misc/py-tvm/incubator-tvm-0.6.1/include/tvm/runtime/ |
| H A D | ndarray.h | 438 int64_t num_elems = 1;
440 num_elems *= tensor->shape[i];
442 int64_t data_byte_size = type_bytes * num_elems;
457 dmlc::ByteSwap(dmlc::BeginPtr(bytes), type_bytes, num_elems);
493 int64_t num_elems = 1;
496 num_elems *= ret->shape[i];
501 CHECK(data_byte_size == num_elems * elem_bytes)
506 dmlc::ByteSwap(ret->data, elem_bytes, num_elems);
|
| /dports/games/freecell-solver/freecell-solver-6.2.0/ |
| H A D | fcs_hash.h | 80 size_t num_elems; member
116 hash->num_elems = 0; in fc_solve_hash_init()
141 hash->num_elems = 0; in fc_solve_hash_recycle()
171 --(hash->num_elems); in fc_solve_hash_foreach()
|
| /dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/ |
| H A D | elem_eval_test.cpp | 412 const size_t num_elems = sizeof(conn)/sizeof(int)/3; in create_mesh() local
414 EntityHandle verts[num_vtx], faces[num_elems]; in create_mesh()
420 for (size_t i=0; i< num_elems; ++i) in create_mesh()
446 const size_t num_elems = sizeof(conn)/sizeof(int)/4; in create_mesh() local
448 EntityHandle verts[num_vtx], faces[num_elems]; in create_mesh()
454 for (size_t i=0; i< num_elems; ++i) in create_mesh()
478 const size_t num_elems = sizeof(conn)/sizeof(int)/4; in create_mesh() local
480 EntityHandle verts[num_vtx], cells[num_elems]; in create_mesh()
486 for (size_t i=0; i< num_elems; ++i) in create_mesh()
523 EntityHandle verts[num_vtx], cells[num_elems]; in create_mesh()
[all …]
|
| /dports/multimedia/lives/lives-3.2.0/libweed/ |
| H A D | weed-utils.c | 248 weed_size_t num_elems = weed_leaf_num_elements(plant, key); in weed_get_values() local
250 if (num_elems * dsize > 0) { in weed_get_values()
251 if ((*retval = (char *)(*_calloc_func)(num_elems, dsize)) == NULL) { in weed_get_values()
256 for (int i = 0; i < num_elems; i++) { in weed_get_values()
263 if (elems) *elems = (int)num_elems; in weed_get_values()
313 weed_size_t num_elems; in __weed_get_string_array__() local
323 if ((num_elems = weed_leaf_num_elements(plant, key)) == 0) return NULL; in __weed_get_string_array__()
325 if ((retvals = (char **)(*_malloc_func)(num_elems * sizeof(char *))) == NULL) { in __weed_get_string_array__()
330 for (int i = 0; i < num_elems; i++) { in __weed_get_string_array__()
345 if (count) *count = num_elems; in __weed_get_string_array__()
[all …]
|
| /dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/Mesh/ |
| H A D | ArrayMesh.hpp | 273 size_t num_elems,
301 size_t num_elems,
307 size_t num_elems,
314 size_t num_elems,
320 size_t num_elems,
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/tools/testing/selftests/bpf/prog_tests/ |
| H A D | sockmap_basic.c | 204 __u32 i, num_sockets, num_elems; in test_sockmap_copy() local
217 num_elems = bpf_map__max_entries(src); in test_sockmap_copy()
218 num_sockets = num_elems - 1; in test_sockmap_copy()
221 num_elems = bpf_map__max_entries(src) - 1; in test_sockmap_copy()
222 num_sockets = num_elems; in test_sockmap_copy()
262 if (CHECK(skel->bss->elems != num_elems, "elems", "got %u expected %u\n", in test_sockmap_copy()
263 skel->bss->elems, num_elems)) in test_sockmap_copy()
|
| /dports/multimedia/libv4l/linux-5.13-rc2/tools/testing/selftests/bpf/prog_tests/ |
| H A D | sockmap_basic.c | 204 __u32 i, num_sockets, num_elems; in test_sockmap_copy() local
217 num_elems = bpf_map__max_entries(src); in test_sockmap_copy()
218 num_sockets = num_elems - 1; in test_sockmap_copy()
221 num_elems = bpf_map__max_entries(src) - 1; in test_sockmap_copy()
222 num_sockets = num_elems; in test_sockmap_copy()
262 if (CHECK(skel->bss->elems != num_elems, "elems", "got %u expected %u\n", in test_sockmap_copy()
263 skel->bss->elems, num_elems)) in test_sockmap_copy()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/tools/testing/selftests/bpf/prog_tests/ |
| H A D | sockmap_basic.c | 204 __u32 i, num_sockets, num_elems; in test_sockmap_copy() local
217 num_elems = bpf_map__max_entries(src); in test_sockmap_copy()
218 num_sockets = num_elems - 1; in test_sockmap_copy()
221 num_elems = bpf_map__max_entries(src) - 1; in test_sockmap_copy()
222 num_sockets = num_elems; in test_sockmap_copy()
262 if (CHECK(skel->bss->elems != num_elems, "elems", "got %u expected %u\n", in test_sockmap_copy()
263 skel->bss->elems, num_elems)) in test_sockmap_copy()
|
| /dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/include/tvm/runtime/ |
| H A D | ndarray.h | 411 int64_t num_elems = 1; in SaveDLTensor() local
413 num_elems *= tensor->shape[i]; in SaveDLTensor()
415 int64_t data_byte_size = type_bytes * num_elems; in SaveDLTensor()
429 dmlc::ByteSwap(dmlc::BeginPtr(bytes), type_bytes, num_elems); in SaveDLTensor()
455 int64_t num_elems = 1; in Load() local
458 num_elems *= ret->shape[i]; in Load()
462 CHECK(data_byte_size == num_elems * elem_bytes) << "Invalid DLTensor file format"; in Load()
469 dmlc::ByteSwap(ret->data, elem_bytes, num_elems); in Load()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/native_client/tests/toolchain/ |
| H A D | llvm_math_intrinsics.cc | 113 size_t num_elems = sizeof(vec) / sizeof(vec[0]); in sprint_v4f32() local
114 for (int i = 0; i < num_elems; ++i) { in sprint_v4f32()
255 int num_elems = sizeof(test_vec) / sizeof(test_vec[0]); in main() local
256 for (int i = 0; i + (num_elems - 1) < ARRAY_SIZE_UNSAFE(f32); i += 2) { in main()
257 for (int j = 0; j < num_elems; ++j) { in main()
269 for (int j = 0; j < num_elems; ++j) { in main()
|
| /dports/math/libmesh/libmesh-1.6.2/contrib/exodusii/5.22b/exodus/cbind/test/ |
| H A D | rd_wt_mesh.c | 102 int *num_elems, int **elem_map,
429 int *num_elems, int **elem_map, in read_exo_mesh() argument
475 num_nodes, num_elems, &num_elem_blk, in read_exo_mesh()
488 *elem_map = malloc(sizeof(int) * (*num_elems)); in read_exo_mesh()
553 raw_data_vol += sizeof(int)*(*num_elems); in read_exo_mesh()
654 raw_data_vol += sizeof(realtyp) * (*num_elems); in read_exo_mesh()
756 int num_elems, int *elem_map, in write_exo_mesh() argument
838 num_nodes, num_elems, num_elem_blk, in write_exo_mesh()
857 num_elem_per_block[0] = num_elems; in write_exo_mesh()
924 raw_data_vol += sizeof(int)*num_elems; in write_exo_mesh()
[all …]
|
| /dports/benchmarks/pathload/pathload_1.3.2/ |
| H A D | pathload_snd_func.c | 237 void order_dbl(double unord_arr[], double ord_arr[],int start, int num_elems) in order_dbl() argument
241 for (i=start,k=0;i<start+num_elems;i++,k++) ord_arr[k]=unord_arr[i]; in order_dbl()
242 for (i=1;i<num_elems;i++) { in order_dbl()
257 void order_float(float unord_arr[], float ord_arr[],int start, int num_elems) in order_float() argument
261 for (i=start,k=0;i<start+num_elems;i++,k++) ord_arr[k]=unord_arr[i]; in order_float()
262 for (i=1;i<num_elems;i++) { in order_float()
443 void order_int(int unord_arr[], int ord_arr[], int num_elems) in order_int() argument
447 for (i=0;i<num_elems;i++) ord_arr[i]=unord_arr[i]; in order_int()
448 for (i=1;i<num_elems;i++) { in order_int()
|
| /dports/biology/phyml/phyml-3.3.20200621/src/ |
| H A D | beagle_utils.c | 13 double* int_to_double(const int* src, int num_elems) in int_to_double() argument
15 …double* dest = (double*)malloc(num_elems*sizeof(double)); if (NULL==dest) Warn_And_Exit("\n. Could… in int_to_double()
17 for(i=0; i<num_elems;++i) in int_to_double()
22 double* short_to_double(const short* src, int num_elems) in short_to_double() argument
24 …double* dest = (double*)malloc(num_elems*sizeof(double)); if (NULL==dest) Warn_And_Exit("\n. Could… in short_to_double()
26 for(i=0; i<num_elems;++i) in short_to_double()
31 double* float_to_double(const phydbl* src, int num_elems) in float_to_double() argument
33 …double* dest = (double*)malloc(num_elems*sizeof(double)); if (NULL==dest) Warn_And_Exit("\n. Could… in float_to_double()
35 for(i=0; i<num_elems;++i) in float_to_double()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/boringssl/src/crypto/test/ |
| H A D | malloc.cc | 57 extern void *__libc_calloc(size_t num_elems, size_t size);
123 void *calloc(size_t num_elems, size_t size) { in calloc() argument
129 return __libc_calloc(num_elems, size); in calloc()
|
| /dports/lang/mono/mono-5.10.1.57/external/boringssl/crypto/test/ |
| H A D | malloc.cc | 63 extern void *__libc_calloc(size_t num_elems, size_t size);
130 void *calloc(size_t num_elems, size_t size) { in calloc() argument
136 return __libc_calloc(num_elems, size); in calloc()
|
| /dports/net/quiche/quiche-0.9.0/deps/boringssl/src/crypto/test/ |
| H A D | malloc.cc | 57 extern void *__libc_calloc(size_t num_elems, size_t size);
123 void *calloc(size_t num_elems, size_t size) { in calloc() argument
129 return __libc_calloc(num_elems, size); in calloc()
|
| /dports/net/quiche/quiche-0.9.0/cargo-crates/boring-sys-1.1.1/deps/boringssl/src/crypto/test/ |
| H A D | malloc.cc | 57 extern void *__libc_calloc(size_t num_elems, size_t size);
123 void *calloc(size_t num_elems, size_t size) { in calloc() argument
129 return __libc_calloc(num_elems, size); in calloc()
|
| /dports/security/boringssl/boringssl-6a71840/crypto/test/ |
| H A D | malloc.cc | 57 extern void *__libc_calloc(size_t num_elems, size_t size);
123 void *calloc(size_t num_elems, size_t size) { in calloc() argument
129 return __libc_calloc(num_elems, size); in calloc()
|
| /dports/devel/py-grpcio/grpcio-1.43.0/third_party/boringssl-with-bazel/src/crypto/test/ |
| H A D | malloc.cc | 57 extern void *__libc_calloc(size_t num_elems, size_t size);
123 void *calloc(size_t num_elems, size_t size) { in calloc() argument
129 return __libc_calloc(num_elems, size); in calloc()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/math/statistics/ |
| H A D | univariate_statistics.hpp | 339 size_t num_elems = std::distance(first, last); in median() local
340 BOOST_ASSERT_MSG(num_elems > 0, "The median of a zero length vector is undefined."); in median()
341 if (num_elems & 1) in median()
343 auto middle = first + (num_elems - 1)/2; in median()
349 auto middle = first + num_elems/2 - 1; in median()
441 size_t num_elems = std::distance(first, last); in median_absolute_deviation() local
442 BOOST_ASSERT_MSG(num_elems > 0, "The median of a zero-length vector is undefined."); in median_absolute_deviation()
444 if (num_elems & 1) in median_absolute_deviation()
446 auto middle = first + (num_elems - 1)/2; in median_absolute_deviation()
452 auto middle = first + num_elems/2 - 1; in median_absolute_deviation()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/math/statistics/ |
| H A D | univariate_statistics.hpp | 339 size_t num_elems = std::distance(first, last); in median() local
340 BOOST_ASSERT_MSG(num_elems > 0, "The median of a zero length vector is undefined."); in median()
341 if (num_elems & 1) in median()
343 auto middle = first + (num_elems - 1)/2; in median()
349 auto middle = first + num_elems/2 - 1; in median()
441 size_t num_elems = std::distance(first, last); in median_absolute_deviation() local
442 BOOST_ASSERT_MSG(num_elems > 0, "The median of a zero-length vector is undefined."); in median_absolute_deviation()
444 if (num_elems & 1) in median_absolute_deviation()
446 auto middle = first + (num_elems - 1)/2; in median_absolute_deviation()
452 auto middle = first + num_elems/2 - 1; in median_absolute_deviation()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/math/statistics/ |
| H A D | univariate_statistics.hpp | 339 size_t num_elems = std::distance(first, last); in median() local
340 BOOST_ASSERT_MSG(num_elems > 0, "The median of a zero length vector is undefined."); in median()
341 if (num_elems & 1) in median()
343 auto middle = first + (num_elems - 1)/2; in median()
349 auto middle = first + num_elems/2 - 1; in median()
441 size_t num_elems = std::distance(first, last); in median_absolute_deviation() local
442 BOOST_ASSERT_MSG(num_elems > 0, "The median of a zero-length vector is undefined."); in median_absolute_deviation()
444 if (num_elems & 1) in median_absolute_deviation()
446 auto middle = first + (num_elems - 1)/2; in median_absolute_deviation()
452 auto middle = first + num_elems/2 - 1; in median_absolute_deviation()
|
| /dports/science/axom/axom-0.6.1/src/axom/sidre/interface/c_fortran/ |
| H A D | wrapfsidre.F | 929 num_elems, SHT_crv) &
2181 num_elems, offset) &
3010 num_elems) &
3027 num_elems) &
3076 type, num_elems, buff) &
3094 type, num_elems, buff) &
3201 type, num_elems) &
3218 type, num_elems) &
5328 num_elems, offset)
6602 num_elems) &
[all …]
|
| /dports/comms/uhd/uhd-90ce6062b6b5df2eddeee723777be85108e4e7c7/host/include/uhd/rfnoc/ |
| H A D | chdr_types.hpp | 318 size_t num_elems,
323 void deserialize(const uint64_t* buff, size_t num_elems) in deserialize() argument
329 deserialize(buff, num_elems, conv_byte_order); in deserialize()
442 size_t num_elems,
447 void deserialize(const uint64_t* buff, size_t num_elems) in deserialize() argument
453 deserialize(buff, num_elems, conv_byte_order); in deserialize()
544 size_t num_elems,
549 void deserialize(const uint64_t* buff, size_t num_elems) in deserialize() argument
555 deserialize(buff, num_elems, conv_byte_order); in deserialize()
850 size_t num_elems,
[all …]
|