/dports/math/tblis/tblis-1.2.0/test/ |
H A D | test.cxx | 257 len_vector len_A; in random_tensor() local 259 A.reset(len_A); in random_tensor() 296 len_vector len_A; in random_tensor() local 300 auto idxs_A = random_indices(len_vector(len_A.begin()+dense_d, len_A.end()), 0.5); in random_tensor() 302 A.reset(len_A, idxs_A); in random_tensor() 482 swap(len_A, len_B); in random_lengths() 493 len_vector len_A, len_B; in random_tensors() local 498 A.reset(len_A); in random_tensors() 592 A.reset(len_A, idxs_A); in random_tensors() 991 A.reset(len_A); in random_tensors() [all …]
|
H A D | bench.cxx | 297 len_vector len_A, len_B, len_C; in operator ()() local 306 len_A.push_back(len); in operator ()() 330 len_A.push_back(len); in operator ()() 338 dim_vector reorder_A = range<unsigned>(len_A.size()); in operator ()() 347 permute(len_A, reorder_A); in operator ()() 353 varray<T> A(len_A); in operator ()() 397 len_vector len_A, len_B, len_C; in operator ()() local 404 len_A.push_back(lengths.at(c)); in operator ()() 417 varray<T> A(len_A); in operator ()()
|
/dports/math/tblis/tblis-1.2.0/src/internal/1t/dense/ |
H A D | scale.cxx | 12 const len_vector& len_A, in scale() argument 15 bool empty = len_A.size() == 0; in scale() 17 len_type n0 = (empty ? 1 : len_A[0]); in scale() 18 len_vector len1(len_A.begin() + !empty, len_A.end()); in scale() 47 const len_vector& len_A, \
|
H A D | set.cxx | 12 const len_vector& len_A, in set() argument 15 bool empty = len_A.size() == 0; in set() 17 len_type n0 = (empty ? 1 : len_A[0]); in set() 18 len_vector len1(len_A.begin() + !empty, len_A.end()); in set() 45 const len_vector& len_A, \
|
H A D | shift.cxx | 12 const len_vector& len_A, in shift() argument 15 bool empty = len_A.size() == 0; in shift() 17 len_type n0 = (empty ? 1 : len_A[0]); in shift() 18 len_vector len1(len_A.begin() + !empty, len_A.end()); in shift() 46 const len_vector& len_A, \
|
H A D | reduce.cxx | 14 const len_vector& len_A, in reduce() argument 18 bool empty = len_A.size() == 0; in reduce() 20 len_type n0 = (empty ? 1 : len_A[0]); in reduce() 21 len_vector len1(len_A.begin() + !empty, len_A.end()); in reduce() 71 const len_vector& len_A, \
|
H A D | add.cxx | 31 auto len_A = stl_ext::permuted(len_A_, perm_A); in add() local 41 len_type n_A = stl_ext::prod(len_A); in add() 61 reduce(comm, cfg, REDUCE_SUM, len_A, A, stride_A, sum, idx); in add() 109 viterator<1> iter_A(len_A, stride_A); in add() 265 const len_vector& len_A, \
|
/dports/math/tblis/tblis-1.2.0/src/iface/1t/ |
H A D | shift.cxx | 31 len_vector len_A; in tblis_tensor_shift() local 34 diagonal(ndim_A, A->len, A->stride, idx_A_, len_A, stride_A, idx_A); in tblis_tensor_shift() 38 len_A.push_back(1); in tblis_tensor_shift() 43 fold(len_A, idx_A, stride_A); in tblis_tensor_shift() 52 internal::set<T>(comm, get_config(cfg), len_A, in tblis_tensor_shift() 59 internal::scale<T>(comm, get_config(cfg), len_A, in tblis_tensor_shift() 66 internal::shift<T>(comm, get_config(cfg), len_A, in tblis_tensor_shift()
|
H A D | scale.cxx | 24 len_vector len_A; in tblis_tensor_scale() local 27 diagonal(ndim_A, A->len, A->stride, idx_A_, len_A, stride_A, idx_A); in tblis_tensor_scale() 31 len_A.push_back(1); in tblis_tensor_scale() 36 fold(len_A, idx_A, stride_A); in tblis_tensor_scale() 45 internal::set<T>(comm, get_config(cfg), len_A, in tblis_tensor_scale() 50 internal::scale<T>(comm, get_config(cfg), len_A, in tblis_tensor_scale()
|
H A D | set.cxx | 22 len_vector len_A; in tblis_tensor_set() local 25 diagonal(ndim_A, A->len, A->stride, idx_A_, len_A, stride_A, idx_A); in tblis_tensor_set() 29 len_A.push_back(1); in tblis_tensor_set() 34 fold(len_A, idx_A, stride_A); in tblis_tensor_set() 41 internal::set<T>(comm, get_config(cfg), len_A, in tblis_tensor_set()
|
H A D | reduce.cxx | 23 len_vector len_A; in tblis_tensor_reduce() local 26 diagonal(ndim_A, A->len, A->stride, idx_A_, len_A, stride_A, idx_A); in tblis_tensor_reduce() 30 len_A.push_back(1); in tblis_tensor_reduce() 35 fold(len_A, idx_A, stride_A); in tblis_tensor_reduce() 48 internal::reduce<T>(comm, get_config(cfg), op, len_A, in tblis_tensor_reduce()
|
H A D | dot.cxx | 25 len_vector len_A; in tblis_tensor_dot() local 28 diagonal(ndim_A, A->len, A->stride, idx_A_, len_A, stride_A, idx_A); in tblis_tensor_dot() 38 len_A.push_back(1); in tblis_tensor_dot() 48 auto len_AB = stl_ext::select_from(len_A, idx_A, idx_AB); in tblis_tensor_dot()
|
H A D | add.cxx | 31 len_vector len_A; in tblis_tensor_add() local 34 diagonal(ndim_A, A->len, A->stride, idx_A_, len_A, stride_A, idx_A); in tblis_tensor_add() 44 len_A.push_back(1); in tblis_tensor_add() 54 auto len_AB = stl_ext::select_from(len_A, idx_A, idx_AB); in tblis_tensor_add() 60 auto len_A_only = stl_ext::select_from(len_A, idx_A, idx_A_only); in tblis_tensor_add()
|
/dports/math/tblis/tblis-1.2.0/src/internal/1t/dpd/ |
H A D | add.cxx | 37 add(comm, cfg, len_A, len_B, len_AB, in add_full() 61 len_vector len_A(ndim_A); in trace_block() local 65 len_A[i] += A.length(i, irrep); in trace_block() 79 dense_A *= len_A[i]; in trace_block() 88 dense_AB *= len_A[i]; in trace_block() 166 len_vector len_A(ndim_A); in replicate_block() local 170 len_A[i] += A.length(i, irrep); in replicate_block() 193 dense_AB *= len_A[i]; in replicate_block() 290 len_vector len_A(ndim_A); in transpose_block() local 294 len_A[i] += A.length(i, irrep); in transpose_block() [all …]
|
H A D | util.hpp | 77 len_vector len_A(ndim_A); in block_to_full() local 83 off_A[i][irrep] = len_A[i]; in block_to_full() 84 len_A[i] += A.length(i, irrep); in block_to_full() 88 if (comm.master()) A2.reset(len_A); in block_to_full()
|
/dports/lang/gnu-apl/apl-1.8/src/ |
H A D | Bif_OPER2_INNER.cc | 52 ShapeItem len_A = 1; in eval_ALRB() local 55 len_A = A->get_last_shape_item(); in eval_ALRB() 102 if (job.LO && job.RO && A->is_simple() && B->is_simple() && len_A) in eval_ALRB() 109 if (len_A != len_B && job.incA && job.incB) LENGTH_ERROR; in eval_ALRB() 114 job.LO_len = A->is_scalar() ? len_B : len_A; in eval_ALRB()
|
H A D | PrimitiveFunction.cc | 332 loop(a, len_A) in eval_AB() 1435 const ShapeItem len = (len_A == 1) ? len_B : len_A; in decode_int() 1452 if (len_A != 1) --cA; in decode_int() 1468 const ShapeItem len = (len_A == 1) ? len_B : len_A; in decode_real() 1476 if (len_A != 1) --cA; in decode_real() 1495 const ShapeItem len = (len_A == 1) ? len_B : len_A; in decode_complex() 1503 if (len_A != 1) --cA; in decode_complex() 2750 if (len_A*len_B > 60*60) in eval_AB() 2766 loop(idx_A, len_A) in eval_AB() 2803 loop(a, len_A) in eval_AB() [all …]
|
H A D | Bif_OPER1_REDUCE.cc | 51 ShapeItem len_A = A->element_count(); in replicate() local 55 if (len_A == 1) // single a -> a a ... a (len_B times) in replicate() 57 len_A = len_B; in replicate() 59 loop(a, len_A) rep_counts.push_back(rep_A); in replicate() 66 loop(a, len_A) in replicate()
|
H A D | ScalarFunction.cc | 1067 const ShapeItem len_A = A->element_count(); in eval_AB() local 1073 if (len_A*len_B > 60*60) in eval_AB() 1077 Value_P Z(len_A, LOC); in eval_AB() 1081 loop(a, len_A) in eval_AB() 1111 const ShapeItem len_A = A->element_count(); in large_eval_AB() local 1113 const Cell ** cells_A = new const Cell *[2*len_A + len_B]; in large_eval_AB() 1114 const Cell ** cells_Z = cells_A + len_A; in large_eval_AB() 1115 const Cell ** cells_B = cells_A + 2*len_A; in large_eval_AB() 1117 loop(a, len_A) cells_A[a] = &A->get_ravel(a); in large_eval_AB() 1120 Heapsort<const Cell *>::sort(cells_A, len_A, 0, Cell::compare_stable); in large_eval_AB() [all …]
|
/dports/math/tblis/tblis-1.2.0/src/util/ |
H A D | tensor.hpp | 183 inline bool are_compatible(const len_vector& len_A, in are_compatible() argument 188 TBLIS_ASSERT(len_A.size() == stride_A.size()); in are_compatible() 190 auto len_Ar = stl_ext::permuted(len_A, dims_A); in are_compatible() 304 bool operator()(const len_vector& len_A, in operator ()() 309 return are_compatible(len_A, std::get<I>(stride_A), in operator ()() 311 are_compatible_helper<I+1, N, Strides...>()(len_A, stride_A, in operator ()() 329 bool are_compatible(const len_vector& len_A, in are_compatible() argument 335 len_A, stride_A, len_B, stride_B); in are_compatible()
|
/dports/multimedia/librist/librist-5c1f4a06ab46e16e6bba42fe7381d8353020a1fd/contrib/ |
H A D | srp.h | 150 const unsigned char * bytes_A, size_t len_A, 195 … const unsigned char ** bytes_A, size_t * len_A );
|
H A D | srp.c | 614 const unsigned char * bytes_A, size_t len_A, in srp_verifier_new() argument 631 mbedtls_mpi_read_binary(A, bytes_A, len_A); in srp_verifier_new() 931 const unsigned char ** bytes_A, size_t * len_A ) in srp_user_start_authentication() argument 937 *len_A = mbedtls_mpi_size(usr->A); in srp_user_start_authentication() 938 *bytes_A = malloc( *len_A ); in srp_user_start_authentication() 942 *len_A = 0; in srp_user_start_authentication() 948 mbedtls_mpi_write_binary( usr->A, (unsigned char *) *bytes_A, *len_A ); in srp_user_start_authentication()
|
/dports/games/minetest/minetest-5.4.1/src/util/ |
H A D | srp.h | 128 const unsigned char *bytes_A, size_t len_A, 180 unsigned char **bytes_A, size_t* len_A);
|
/dports/math/tblis/tblis-1.2.0/src/internal/1t/indexed_dpd/ |
H A D | add.cxx | 31 auto len_A = stl_ext::select_from(A2.lengths(), idx_A_A); in add_full() local 39 add(comm, cfg, len_A, len_B, len_AB, in add_full() 132 len_vector len_A; in trace_block() local 134 get_local_geometry(indices_A[idx_A].idx[1], group_A, len_A, in trace_block() 152 add(subcomm, cfg, len_A, {}, len_AB, in trace_block()
|
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/polyselect/ |
H A D | ropt_stage2.c | 875 unsigned long j, len_A, len_B, size_array_mem, size_B_block; in rootsieve_one_sublattice() local 894 len_A = (unsigned long) (s2param->Amax - s2param->Amin + 1); in rootsieve_one_sublattice() 899 if (len_B < (double) size_array_mem / len_A) in rootsieve_one_sublattice() 900 size_array_mem = len_B * len_A; in rootsieve_one_sublattice() 901 if (size_array_mem <= (unsigned long) len_A) { in rootsieve_one_sublattice() 912 size_B_block = (unsigned long) ((double)size_array_mem/(double)len_A); in rootsieve_one_sublattice() 915 size_array_mem = len_A * size_B_block; in rootsieve_one_sublattice() 926 sievearray_init (sa, len_A, size_B_block); in rootsieve_one_sublattice()
|