Home
last modified time | relevance | path

Searched refs:is_ordered (Results 1 – 4 of 4) sorted by relevance

/libCEED/backends/hip-ref/
H A Dceed-hip-ref-operator.c279 bool is_ordered[CEED_FIELD_MAX]; in CeedOperatorSetup_Hip() local
282 for (CeedInt i = 0; i < num_input_fields; i++) is_ordered[i] = false; in CeedOperatorSetup_Hip()
288 if (is_ordered[i]) continue; in CeedOperatorSetup_Hip()
289 is_ordered[i] = true; in CeedOperatorSetup_Hip()
308 is_ordered[j] = true; in CeedOperatorSetup_Hip()
320 bool is_ordered[CEED_FIELD_MAX]; in CeedOperatorSetup_Hip() local
323 for (CeedInt i = 0; i < num_output_fields; i++) is_ordered[i] = false; in CeedOperatorSetup_Hip()
329 if (is_ordered[i]) continue; in CeedOperatorSetup_Hip()
330 is_ordered[i] = true; in CeedOperatorSetup_Hip()
344 is_ordered[j] = true; in CeedOperatorSetup_Hip()
[all …]
/libCEED/backends/cuda-ref/
H A Dceed-cuda-ref-operator.c280 bool is_ordered[CEED_FIELD_MAX]; in CeedOperatorSetup_Cuda() local
283 for (CeedInt i = 0; i < num_input_fields; i++) is_ordered[i] = false; in CeedOperatorSetup_Cuda()
289 if (is_ordered[i]) continue; in CeedOperatorSetup_Cuda()
290 is_ordered[i] = true; in CeedOperatorSetup_Cuda()
309 is_ordered[j] = true; in CeedOperatorSetup_Cuda()
321 bool is_ordered[CEED_FIELD_MAX]; in CeedOperatorSetup_Cuda() local
324 for (CeedInt i = 0; i < num_output_fields; i++) is_ordered[i] = false; in CeedOperatorSetup_Cuda()
330 if (is_ordered[i]) continue; in CeedOperatorSetup_Cuda()
331 is_ordered[i] = true; in CeedOperatorSetup_Cuda()
345 is_ordered[j] = true; in CeedOperatorSetup_Cuda()
[all …]
/libCEED/backends/hip-gen/
H A Dceed-hip-gen-operator-build.cpp1543 bool is_ordered[CEED_FIELD_MAX]; in CeedOperatorBuildKernel_Hip_gen() local
1546 for (CeedInt i = 0; i < num_input_fields; i++) is_ordered[i] = false; in CeedOperatorBuildKernel_Hip_gen()
1551 if (is_ordered[i]) continue; in CeedOperatorBuildKernel_Hip_gen()
1553 is_ordered[i] = true; in CeedOperatorBuildKernel_Hip_gen()
1567 is_ordered[j] = true; in CeedOperatorBuildKernel_Hip_gen()
1901 bool is_ordered[CEED_FIELD_MAX]; in CeedOperatorBuildKernelAssemblyAtPoints_Hip_gen() local
1904 for (CeedInt i = 0; i < num_input_fields; i++) is_ordered[i] = false; in CeedOperatorBuildKernelAssemblyAtPoints_Hip_gen()
1909 if (is_ordered[i]) continue; in CeedOperatorBuildKernelAssemblyAtPoints_Hip_gen()
1911 is_ordered[i] = true; in CeedOperatorBuildKernelAssemblyAtPoints_Hip_gen()
1925 is_ordered[j] = true; in CeedOperatorBuildKernelAssemblyAtPoints_Hip_gen()
[all …]
/libCEED/backends/cuda-gen/
H A Dceed-cuda-gen-operator-build.cpp1530 bool is_ordered[CEED_FIELD_MAX]; in CeedOperatorBuildKernel_Cuda_gen() local
1533 for (CeedInt i = 0; i < num_input_fields; i++) is_ordered[i] = false; in CeedOperatorBuildKernel_Cuda_gen()
1538 if (is_ordered[i]) continue; in CeedOperatorBuildKernel_Cuda_gen()
1540 is_ordered[i] = true; in CeedOperatorBuildKernel_Cuda_gen()
1554 is_ordered[j] = true; in CeedOperatorBuildKernel_Cuda_gen()
1896 bool is_ordered[CEED_FIELD_MAX]; in CeedOperatorBuildKernelAssemblyAtPoints_Cuda_gen() local
1899 for (CeedInt i = 0; i < num_input_fields; i++) is_ordered[i] = false; in CeedOperatorBuildKernelAssemblyAtPoints_Cuda_gen()
1904 if (is_ordered[i]) continue; in CeedOperatorBuildKernelAssemblyAtPoints_Cuda_gen()
1906 is_ordered[i] = true; in CeedOperatorBuildKernelAssemblyAtPoints_Cuda_gen()
1920 is_ordered[j] = true; in CeedOperatorBuildKernelAssemblyAtPoints_Cuda_gen()
[all …]