Home
last modified time | relevance | path

Searched refs:num_calls (Results 1 – 2 of 2) sorted by relevance

/libCEED/backends/cuda-ref/
H A Dceed-cuda-ref-vector.c481 CeedSize num_calls; in CeedVectorNorm_Cuda() local
496 num_calls = length / INT_MAX; in CeedVectorNorm_Cuda()
497 if (length % INT_MAX > 0) num_calls += 1; in CeedVectorNorm_Cuda()
512 for (CeedInt i = 0; i < num_calls; i++) { in CeedVectorNorm_Cuda()
515 CeedInt sub_length = (i == num_calls - 1) ? (CeedInt)(remaining_length) : INT_MAX; in CeedVectorNorm_Cuda()
528 for (CeedInt i = 0; i < num_calls; i++) { in CeedVectorNorm_Cuda()
531 CeedInt sub_length = (i == num_calls - 1) ? (CeedInt)(remaining_length) : INT_MAX; in CeedVectorNorm_Cuda()
548 for (CeedInt i = 0; i < num_calls; i++) { in CeedVectorNorm_Cuda()
551 CeedInt sub_length = (i == num_calls - 1) ? (CeedInt)(remaining_length) : INT_MAX; in CeedVectorNorm_Cuda()
565 for (CeedInt i = 0; i < num_calls; i++) { in CeedVectorNorm_Cuda()
[all …]
/libCEED/backends/hip-ref/
H A Dceed-hip-ref-vector.c557 CeedSize num_calls; in CeedVectorNorm_Hip() local
575 num_calls = length / INT_MAX; in CeedVectorNorm_Hip()
576 if (length % INT_MAX > 0) num_calls += 1; in CeedVectorNorm_Hip()
592 for (CeedInt i = 0; i < num_calls; i++) { in CeedVectorNorm_Hip()
595 CeedInt sub_length = (i == num_calls - 1) ? (CeedInt)(remaining_length) : INT_MAX; in CeedVectorNorm_Hip()
610 for (CeedInt i = 0; i < num_calls; i++) { in CeedVectorNorm_Hip()
613 CeedInt sub_length = (i == num_calls - 1) ? (CeedInt)(remaining_length) : INT_MAX; in CeedVectorNorm_Hip()
632 for (CeedInt i = 0; i < num_calls; i++) { in CeedVectorNorm_Hip()
635 CeedInt sub_length = (i == num_calls - 1) ? (CeedInt)(remaining_length) : INT_MAX; in CeedVectorNorm_Hip()
651 for (CeedInt i = 0; i < num_calls; i++) { in CeedVectorNorm_Hip()
[all …]