Home
last modified time | relevance | path

Searched refs:e (Results 1 – 25 of 103) sorted by relevance

12345

/libCEED/examples/fluids/
H A DSTGInflow_blasius.dat2e+00 0.000000000000000000e+00 0.000000000000000000e+00 0.000000000000000000e+00 1.0000000000000000…
3e-06 6.641140981505948560e-01 3.630359440264661799e-05 0.000000000000000000e+00 1.0000000000000000…
4e-06 6.827985921104507971e-01 3.837509590908312938e-05 0.000000000000000000e+00 1.0000000000000000…
5e-06 7.020087597129041068e-01 4.056479791879753598e-05 0.000000000000000000e+00 1.0000000000000000…
6e-06 7.217593898384206952e-01 4.287944492540062035e-05 0.000000000000000000e+00 1.0000000000000000…
7e-06 7.420656873629547512e-01 4.532616625247044189e-05 0.000000000000000000e+00 1.0000000000000000…
8e-06 7.629432848520516508e-01 4.791249800990936422e-05 0.000000000000000000e+00 1.0000000000000000…
9e-06 7.844082545828384712e-01 5.064640630279787997e-05 0.000000000000000000e+00 1.0000000000000000…
10e-06 8.064771209029573118e-01 5.353631176415636492e-05 0.000000000000000000e+00 1.0000000000000000…
11e-06 8.291668729357855039e-01 5.659111548710616638e-05 0.000000000000000000e+00 1.0000000000000000…
[all …]
/libCEED/examples/fluids/tests-output/
H A Ddiff_filter_mms_y_spacing.dat2 0.00000000e-00
3 1.02996826e-03
4 2.12542713e-03
5 3.28713586e-03
6 4.52012056e-03
7 5.83032053e-03
8 7.22210482e-03
9 8.69917590e-03
10 1.02688847e-02
11 1.19348252e-02
[all …]
/libCEED/examples/solids/tests-output/
H A DMR-strain1.csv2 0.000000,0.000000e+00
3 0.066667,5.210502e-03
4 0.133333,2.079358e-02
5 0.200000,4.636534e-02
6 0.266667,8.073178e-02
7 0.333333,1.217654e-01
8 0.400000,1.670271e-01
9 0.466667,2.146438e-01
10 0.533333,2.636486e-01
11 0.600000,3.138221e-01
[all …]
H A DMR-strain.csv2 0.000000,0.000000e+00
3 0.066667,5.271562e-03
4 0.133333,2.069557e-02
5 0.200000,4.509268e-02
6 0.266667,7.661738e-02
7 0.333333,1.131503e-01
8 0.400000,1.528054e-01
9 0.466667,1.942671e-01
10 0.533333,2.368184e-01
11 0.600000,2.801812e-01
[all …]
H A DNH-strain.csv2 0.000000,0.000000e+00
3 0.066667,5.271562e-03
4 0.133333,2.069557e-02
5 0.200000,4.509268e-02
6 0.266667,7.661738e-02
7 0.333333,1.131503e-01
8 0.400000,1.528054e-01
9 0.466667,1.942671e-01
10 0.533333,2.368184e-01
11 0.600000,2.801812e-01
[all …]
/libCEED/backends/memcheck/
H A Dceed-memcheck-restriction.c59 for (CeedSize e = start * block_size; e < stop * block_size; e += block_size) { in CeedElemRestrictionApplyStridedNoTranspose_Memcheck_Core() local
63 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyStridedNoTranspose_Memcheck_Core()
64 … uu[n * strides[0] + k * strides[1] + CeedIntMin(e + j, num_elem - 1) * (CeedSize)strides[2]]; in CeedElemRestrictionApplyStridedNoTranspose_Memcheck_Core()
80 for (CeedSize e = start * block_size; e < stop * block_size; e += block_size) { in CeedElemRestrictionApplyOffsetNoTranspose_Memcheck_Core() local
83 …vv[elem_size * (k * block_size + e * num_comp) + i - v_offset] = uu[impl->offsets[i + e * elem_siz… in CeedElemRestrictionApplyOffsetNoTranspose_Memcheck_Core()
98 for (CeedSize e = start * block_size; e < stop * block_size; e += block_size) { in CeedElemRestrictionApplyOrientedNoTranspose_Memcheck_Core() local
101 vv[elem_size * (k * block_size + e * num_comp) + i - v_offset] = in CeedElemRestrictionApplyOrientedNoTranspose_Memcheck_Core()
102 …uu[impl->offsets[i + e * elem_size] + k * comp_stride] * (impl->orients[i + e * elem_size] ? -1.0 … in CeedElemRestrictionApplyOrientedNoTranspose_Memcheck_Core()
117 for (CeedSize e = start * block_size; e < stop * block_size; e += block_size) { in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core() local
122 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyCurlOrientedNoTranspose_Memcheck_Core()
[all …]
/libCEED/benchmarks/
H A Dpostprocess_plot.py107 d = [[e[2], e[3]] for e in d if e[0] == sol_p]
110 min([e[1] for e in d if e[0] == nun]),
111 max([e[1] for e in d if e[0] == nun])]
112 for nun in set([e[0] for e in d])]
131 d = [[e[2], e[3]] for e in d if e[0] == sol_p]
136 min([e[1] for e in d if e[0] == nun]),
137 max([e[1] for e in d if e[0] == nun])]
138 for nun in set([e[0] for e in d])]
/libCEED/backends/ref/
H A Dceed-ref-restriction.c30 for (CeedSize e = start * block_size; e < stop * block_size; e += block_size) { in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core() local
34 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core()
35 … uu[n + k * elem_size + CeedIntMin(e + j, num_elem - 1) * elem_size * (CeedSize)num_comp]; in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core()
45 for (CeedSize e = start * block_size; e < stop * block_size; e += block_size) { in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core() local
49 vv[e * elem_size * num_comp + (k * elem_size + n) * block_size + j - v_offset] = in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core()
50 … uu[n * strides[0] + k * strides[1] + CeedIntMin(e + j, num_elem - 1) * (CeedSize)strides[2]]; in CeedElemRestrictionApplyStridedNoTranspose_Ref_Core()
67 for (CeedSize e = start * block_size; e < stop * block_size; e += block_size) { in CeedElemRestrictionApplyOffsetNoTranspose_Ref_Core() local
70 …vv[elem_size * (k * block_size + e * num_comp) + i - v_offset] = uu[impl->offsets[i + e * elem_siz… in CeedElemRestrictionApplyOffsetNoTranspose_Ref_Core()
85 for (CeedSize e = start * block_size; e < stop * block_size; e += block_size) { in CeedElemRestrictionApplyOrientedNoTranspose_Ref_Core() local
88 vv[elem_size * (k * block_size + e * num_comp) + i - v_offset] = in CeedElemRestrictionApplyOrientedNoTranspose_Ref_Core()
[all …]
/libCEED/examples/solids/qfunctions/
H A Dlinear.h72 const CeedScalar e[3][3] = { in ElasResidual_Linear() local
99 const CeedScalar sigma00 = ss * ((1 - nu) * e[0][0] + nu * e[1][1] + nu * e[2][2]), in ElasResidual_Linear()
100 sigma11 = ss * (nu * e[0][0] + (1 - nu) * e[1][1] + nu * e[2][2]), in ElasResidual_Linear()
101 …sigma22 = ss * (nu * e[0][0] + nu * e[1][1] + (1 - nu) * e[2][2]), sigma12 = ss * (1 - 2 * nu) * e in ElasResidual_Linear()
102 … sigma02 = ss * (1 - 2 * nu) * e[0][2] * 0.5, sigma01 = ss * (1 - 2 * nu) * e[0][1] * 0.5; in ElasResidual_Linear()
267 const CeedScalar e[3][3] = { in ElasEnergy_Linear() local
274 const CeedScalar strain_vol = e[0][0] + e[1][1] + e[2][2]; in ElasEnergy_Linear()
276 … strain_vol * strain_vol / 2. + strain_vol * mu + (e[0][1] * e[0][1] + e[0][2] * e[0][2] + e[1][2]… in ElasEnergy_Linear()
334 const CeedScalar e[3][3] = { in ElasDiagnostic_Linear() local
346 const CeedScalar strain_vol = e[0][0] + e[1][1] + e[2][2]; in ElasDiagnostic_Linear()
[all …]
/libCEED/include/ceed/jit-source/hip/
H A Dhip-ref-operator-assemble.h45 …for (IndexType e = blockIdx.x * blockDim.z + threadIdx.z; e < num_elem; e += gridDim.x * blockDim.… in __launch_bounds__() local
50 …exType qf_index_comp = q_comp_in_stride * comp_in + q_comp_out_stride * comp_out + q_e_stride * e; in __launch_bounds__()
66 result *= orients_in[NUM_NODES_IN * e + l] ? -1.0 : 1.0; in __launch_bounds__()
69 result *= orients_out[NUM_NODES_OUT * e + i] ? -1.0 : 1.0; in __launch_bounds__()
72 …IndexType val_index = e_stride * e + comp_in_stride * comp_in + comp_out_stride * comp_out + NUM_N… in __launch_bounds__()
79 …_C[NUM_NODES_IN * threadIdx.y + l - 1] * curl_orients_in[3 * NUM_NODES_IN * e + 3 * l - 1] : 0.0) + in __launch_bounds__()
80 … s_C[NUM_NODES_IN * threadIdx.y + l] * curl_orients_in[3 * NUM_NODES_IN * e + 3 * l + 1] + in __launch_bounds__()
81 …s_C[NUM_NODES_IN * threadIdx.y + l + 1] * curl_orients_in[3 * NUM_NODES_IN * e + 3 * l + 3] : 0.0); in __launch_bounds__()
90 …IndexType val_index = e_stride * e + comp_in_stride * comp_in + comp_out_stride * comp_out + NUM_N… in __launch_bounds__()
94 …0 ? s_CT[NUM_NODES_IN * (i - 1) + l] * curl_orients_out[3 * NUM_NODES_OUT * e + 3 * i - 1] : 0.0) + in __launch_bounds__()
[all …]
H A Dhip-ref-operator-assemble-diagonal.h58 …for (IndexType e = blockIdx.x * blockDim.z + threadIdx.z; e < num_elem; e += gridDim.x * blockDim.… in __launch_bounds__() local
91 …M_COMP + comp_in) * NUM_EVAL_MODES_OUT + e_out) * NUM_COMP + comp_out) * num_elem + e) * NUM_QPTS + in __launch_bounds__()
96 … elem_diag_array[((comp_out * NUM_COMP + comp_in) * num_elem + e) * NUM_NODES + tid] += e_value; in __launch_bounds__()
105 …_COMP + comp_out) * NUM_EVAL_MODES_OUT + e_out) * NUM_COMP + comp_out) * num_elem + e) * NUM_QPTS + in __launch_bounds__()
110 elem_diag_array[(comp_out * num_elem + e) * NUM_NODES + tid] += e_value; in __launch_bounds__()
/libCEED/include/ceed/jit-source/cuda/
H A Dcuda-ref-operator-assemble.h45 …for (IndexType e = blockIdx.x * blockDim.z + threadIdx.z; e < num_elem; e += gridDim.x * blockDim.… in __launch_bounds__() local
50 …exType qf_index_comp = q_comp_in_stride * comp_in + q_comp_out_stride * comp_out + q_e_stride * e; in __launch_bounds__()
66 result *= orients_in[NUM_NODES_IN * e + l] ? -1.0 : 1.0; in __launch_bounds__()
69 result *= orients_out[NUM_NODES_OUT * e + i] ? -1.0 : 1.0; in __launch_bounds__()
72 …IndexType val_index = e_stride * e + comp_in_stride * comp_in + comp_out_stride * comp_out + NUM_N… in __launch_bounds__()
79 …_C[NUM_NODES_IN * threadIdx.y + l - 1] * curl_orients_in[3 * NUM_NODES_IN * e + 3 * l - 1] : 0.0) + in __launch_bounds__()
80 … s_C[NUM_NODES_IN * threadIdx.y + l] * curl_orients_in[3 * NUM_NODES_IN * e + 3 * l + 1] + in __launch_bounds__()
81 …s_C[NUM_NODES_IN * threadIdx.y + l + 1] * curl_orients_in[3 * NUM_NODES_IN * e + 3 * l + 3] : 0.0); in __launch_bounds__()
90 …IndexType val_index = e_stride * e + comp_in_stride * comp_in + comp_out_stride * comp_out + NUM_N… in __launch_bounds__()
94 …0 ? s_CT[NUM_NODES_IN * (i - 1) + l] * curl_orients_out[3 * NUM_NODES_OUT * e + 3 * i - 1] : 0.0) + in __launch_bounds__()
[all …]
H A Dcuda-ref-operator-assemble-diagonal.h58 …for (IndexType e = blockIdx.x * blockDim.z + threadIdx.z; e < num_elem; e += gridDim.x * blockDim.… in __launch_bounds__() local
91 …M_COMP + comp_in) * NUM_EVAL_MODES_OUT + e_out) * NUM_COMP + comp_out) * num_elem + e) * NUM_QPTS + in __launch_bounds__()
96 … elem_diag_array[((comp_out * NUM_COMP + comp_in) * num_elem + e) * NUM_NODES + tid] += e_value; in __launch_bounds__()
105 …_COMP + comp_out) * NUM_EVAL_MODES_OUT + e_out) * NUM_COMP + comp_out) * num_elem + e) * NUM_QPTS + in __launch_bounds__()
110 elem_diag_array[(comp_out * num_elem + e) * NUM_NODES + tid] += e_value; in __launch_bounds__()
/libCEED/tests/
H A Dt595-operator.c30 for (CeedInt e = 0; e < num_elem; e++) { in main() local
32 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
33 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
34 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
35 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
59 for (CeedInt e = 0; e < num_elem; e++) { in main() local
64 CeedInt r_e = e; in main()
71 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main()
H A Dt590-operator.c28 for (CeedInt e = 0; e < num_elem; e++) { in main() local
30 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
31 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
32 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
33 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
50 for (CeedInt e = 0; e < num_elem; e++) { in main() local
55 CeedInt r_e = e; in main()
62 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main()
H A Dt591-operator.c29 for (CeedInt e = 0; e < num_elem; e++) { in main() local
31 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
32 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
33 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
34 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
57 for (CeedInt e = 0; e < num_elem; e++) { in main() local
62 CeedInt r_e = e; in main()
69 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; in main()
103 for (CeedInt e = 0; e < num_elem; e++) { in main() local
108 CeedInt r_e = e; in main()
[all …]
H A Dt598-operator.c30 for (CeedInt e = 0; e < num_elem; e++) { in main() local
32 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
33 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
34 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
35 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
58 for (CeedInt e = 0; e < num_elem; e++) { in main() local
63 CeedInt r_e = e; in main()
70 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; in main()
104 for (CeedInt e = 0; e < num_elem; e++) { in main() local
109 CeedInt r_e = e; in main()
[all …]
H A Dt599-operator.c27 for (CeedInt e = 0; e < num_elem; e++) { in main() local
29 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
30 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
31 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
32 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
52 for (CeedInt e = 0; e < num_elem; e++) { in main() local
57 CeedInt r_e = e; in main()
64 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main()
H A Dt592-operator.c29 for (CeedInt e = 0; e < num_elem; e++) { in main() local
31 x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; in main()
32 x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; in main()
33 x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; in main()
34 x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; in main()
57 for (CeedInt e = 0; e < num_elem; e++) { in main() local
62 CeedInt r_e = e; in main()
69 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; in main()
103 for (CeedInt e = 0; e < num_elem; e++) { in main() local
108 CeedInt r_e = e; in main()
[all …]
/libCEED/backends/sycl-ref/
H A Dceed-sycl-restriction.sycl.cpp37 std::vector<sycl::event> e; in CeedElemRestrictionStridedNoTranspose_Sycl() local
39 if (!sycl_queue.is_in_order()) e = {sycl_queue.ext_oneapi_submit_barrier()}; in CeedElemRestrictionStridedNoTranspose_Sycl()
40 sycl_queue.parallel_for<CeedElemRestrSyclStridedNT>(kernel_range, e, [=](sycl::id<1> node) { in CeedElemRestrictionStridedNoTranspose_Sycl()
64 std::vector<sycl::event> e; in CeedElemRestrictionOffsetNoTranspose_Sycl() local
66 if (!sycl_queue.is_in_order()) e = {sycl_queue.ext_oneapi_submit_barrier()}; in CeedElemRestrictionOffsetNoTranspose_Sycl()
67 sycl_queue.parallel_for<CeedElemRestrSyclOffsetNT>(kernel_range, e, [=](sycl::id<1> node) { in CeedElemRestrictionOffsetNoTranspose_Sycl()
93 std::vector<sycl::event> e; in CeedElemRestrictionStridedTranspose_Sycl() local
95 if (!sycl_queue.is_in_order()) e = {sycl_queue.ext_oneapi_submit_barrier()}; in CeedElemRestrictionStridedTranspose_Sycl()
96 sycl_queue.parallel_for<CeedElemRestrSyclStridedT>(kernel_range, e, [=](sycl::id<1> node) { in CeedElemRestrictionStridedTranspose_Sycl()
123 std::vector<sycl::event> e; in CeedElemRestrictionOffsetTranspose_Sycl() local
[all …]
H A Dceed-sycl-vector.sycl.cpp63 std::vector<sycl::event> e; in CeedVectorSyncH2D_Sycl() local
65 if (!data->sycl_queue.is_in_order()) e = {data->sycl_queue.ext_oneapi_submit_barrier()}; in CeedVectorSyncH2D_Sycl()
66 …CeedCallSycl(ceed, data->sycl_queue.copy<CeedScalar>(impl->h_array, impl->d_array, length, e).wait… in CeedVectorSyncH2D_Sycl()
97 std::vector<sycl::event> e; in CeedVectorSyncD2H_Sycl() local
99 if (!data->sycl_queue.is_in_order()) e = {data->sycl_queue.ext_oneapi_submit_barrier()}; in CeedVectorSyncD2H_Sycl()
100 …CeedCallSycl(ceed, data->sycl_queue.copy<CeedScalar>(impl->d_array, impl->h_array, length, e).wait… in CeedVectorSyncD2H_Sycl()
213 std::vector<sycl::event> e; in CeedVectorSetArrayDevice_Sycl() local
215 if (!data->sycl_queue.is_in_order()) e = {data->sycl_queue.ext_oneapi_submit_barrier()}; in CeedVectorSetArrayDevice_Sycl()
224 …CeedCallSycl(ceed, data->sycl_queue.copy<CeedScalar>(array, impl->d_array_owned, length, e).wait_a… in CeedVectorSetArrayDevice_Sycl()
285 std::vector<sycl::event> e; in CeedDeviceSetValue_Sycl() local
[all …]
H A Dceed-sycl-ref-basis.sycl.cpp52 std::vector<sycl::event> e; in CeedBasisApplyInterp_Sycl() local
54 if (!sycl_queue.is_in_order()) e = {sycl_queue.ext_oneapi_submit_barrier()}; in CeedBasisApplyInterp_Sycl()
57 cgh.depends_on(e); in CeedBasisApplyInterp_Sycl()
155 std::vector<sycl::event> e; in CeedBasisApplyGrad_Sycl() local
157 if (!sycl_queue.is_in_order()) e = {sycl_queue.ext_oneapi_submit_barrier()}; in CeedBasisApplyGrad_Sycl()
160 cgh.depends_on(e); in CeedBasisApplyGrad_Sycl()
255 std::vector<sycl::event> e; in CeedBasisApplyWeight_Sycl() local
257 if (!sycl_queue.is_in_order()) e = {sycl_queue.ext_oneapi_submit_barrier()}; in CeedBasisApplyWeight_Sycl()
259 sycl_queue.parallel_for<CeedBasisSyclWeight>(kernel_range, e, [=](sycl::item<3> work_item) { in CeedBasisApplyWeight_Sycl()
292 std::vector<sycl::event> e; in CeedBasisApply_Sycl() local
[all …]
/libCEED/rust/libceed/src/
H A Dqfunction.rs520 ($e:expr) => {
522 $e, $e, $e, $e, $e, $e, $e, $e, $e, $e, $e, $e, $e, $e, $e, $e,
/libCEED/examples/nek/bps/
H A Dbps.usr10 C_TESTARGS(name="BP1") -c {ceed_resource} -e bp1 -n 1 -b 4 -test
11 C_TESTARGS(name="BP3") -c {ceed_resource} -e bp3 -n 1 -b 4 -test
201 integer e,i,L
208 do e=1,lelt
218 subroutine dist_fld_h1(e)
220 C Input: Output: e
224 real*8 e(1)
233 e(i) = dsqrt(x*x+y*y+z*z)
236 call dsavg(e) ! This is requisite for random fields
241 subroutine sin_fld_h1(e)
[all …]
/libCEED/backends/sycl-shared/
H A Dceed-sycl-shared-basis.sycl.cpp66 std::vector<sycl::event> e; in CeedBasisApplyTensor_Sycl_shared() local
68 … if (!ceed_Sycl->sycl_queue.is_in_order()) e = {ceed_Sycl->sycl_queue.ext_oneapi_submit_barrier()}; in CeedBasisApplyTensor_Sycl_shared()
70 cgh.depends_on(e); in CeedBasisApplyTensor_Sycl_shared()
88 std::vector<sycl::event> e; in CeedBasisApplyTensor_Sycl_shared() local
90 … if (!ceed_Sycl->sycl_queue.is_in_order()) e = {ceed_Sycl->sycl_queue.ext_oneapi_submit_barrier()}; in CeedBasisApplyTensor_Sycl_shared()
93 cgh.depends_on(e); in CeedBasisApplyTensor_Sycl_shared()
107 std::vector<sycl::event> e; in CeedBasisApplyTensor_Sycl_shared() local
110 … if (!ceed_Sycl->sycl_queue.is_in_order()) e = {ceed_Sycl->sycl_queue.ext_oneapi_submit_barrier()}; in CeedBasisApplyTensor_Sycl_shared()
113 cgh.depends_on(e); in CeedBasisApplyTensor_Sycl_shared()
198 std::vector<sycl::event> e; in CeedBasisCreateTensorH1_Sycl_shared() local
[all …]

12345