Skip to content

gpu - pad out elem loop for shared/gen #1950

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
jeremylt merged 7 commits into from
Apr 15, 2026
Merged

gpu - pad out elem loop for shared/gen #1950

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
dbffd6c
gpu - pad out elem loop for shared/gen
jeremylt Apr 9, 2026
4283196
typo - fix bad copypasta
jeremylt Apr 13, 2026
bd3602b
cuda - don't padd threads on CUDA
jeremylt Apr 13, 2026
446df38
hip - fix element loop bound
jeremylt Apr 13, 2026
f70b67d
hip - set Chipstar modifications off by default
jeremylt Apr 13, 2026
7808f38
hip - comment on logic
jeremylt Apr 13, 2026
132eca7
hip - move chipstar jit macro definition
jeremylt Apr 15, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
46 changes: 38 additions & 8 deletions backends/cuda-gen/ceed-cuda-gen-operator-build.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -473,13 +473,17 @@ static int CeedOperatorBuildKernelRestriction_Cuda_gen(std::ostringstream &code,
CeedInt comp_stride;

CeedCallBackend(CeedElemRestrictionGetLVectorSize(elem_rstr, &l_size));
code << tab << "if (e < num_elem) {\n";
tab.push();
code << tab << "const CeedInt l_size" << var_suffix << " = " << l_size << ";\n";
CeedCallBackend(CeedElemRestrictionGetCompStride(elem_rstr, &comp_stride));
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n";
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n\n";
data->indices.outputs[i] = (CeedInt *)rstr_data->d_offsets;
code << tab << "WriteLVecStandard" << (is_all_tensor ? max_dim : 1) << "d<num_comp" << var_suffix << ", comp_stride" << var_suffix << ", "
<< P_name << ">(data, l_size" << var_suffix << ", elem, indices.outputs[" << i << "], r_e" << var_suffix << ", d" << var_suffix
<< ");\n";
tab.pop();
code << tab << "}\n";
break;
}
case CEED_RESTRICTION_STRIDED: {
Expand All @@ -493,11 +497,15 @@ static int CeedOperatorBuildKernelRestriction_Cuda_gen(std::ostringstream &code,
if (!has_backend_strides) {
CeedCallBackend(CeedElemRestrictionGetStrides(elem_rstr, strides));
}
code << tab << "if (e < num_elem) {\n";
tab.push();
code << tab << "const CeedInt strides" << var_suffix << "_0 = " << strides[0] << ", strides" << var_suffix << "_1 = " << strides[1]
<< ", strides" << var_suffix << "_2 = " << strides[2] << ";\n";
<< ", strides" << var_suffix << "_2 = " << strides[2] << ";\n\n";
code << tab << "WriteLVecStrided" << (is_all_tensor ? max_dim : 1) << "d<num_comp" << var_suffix << ", " << P_name << ", strides"
<< var_suffix << "_0, strides" << var_suffix << "_1, strides" << var_suffix << "_2>(data, elem, r_e" << var_suffix << ", d" << var_suffix
<< ");\n";
tab.pop();
code << tab << "}\n";
break;
}
case CEED_RESTRICTION_POINTS:
Expand Down Expand Up @@ -1033,10 +1041,14 @@ static int CeedOperatorBuildKernelQFunction_Cuda_gen(std::ostringstream &code, C
CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_output_fields[i], &elem_rstr));
CeedCallBackend(CeedElemRestrictionGetCompStride(elem_rstr, &comp_stride));
CeedCallBackend(CeedElemRestrictionDestroy(&elem_rstr));
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n";
code << tab << "if (e < num_elem) {\n";
tab.push();
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n\n";
code << tab << "WritePoint<num_comp" << var_suffix << ", comp_stride" << var_suffix
<< ", max_num_points>(data, elem, i, points.num_per_elem[elem], indices.outputs[" << i << "]"
<< ", r_s" << var_suffix << ", d" << var_suffix << ");\n";
tab.pop();
code << tab << "}\n";
break;
}
case CEED_EVAL_INTERP:
Expand Down Expand Up @@ -1482,8 +1494,10 @@ extern "C" int CeedOperatorBuildKernel_Cuda_gen(CeedOperator op, bool *is_good_b
// Loop over all elements
code << "\n" << tab << "// Element loop\n";
code << tab << "__syncthreads();\n";
code << tab << "for (CeedInt elem = blockIdx.x*blockDim.z + threadIdx.z; elem < num_elem; elem += gridDim.x*blockDim.z) {\n";
code << tab << "const CeedInt elem_loop_bound = num_elem * ceil(1.0*num_elem/(gridDim.x*blockDim.z));\n\n";
code << tab << "for (CeedInt e = blockIdx.x*blockDim.z + threadIdx.z; e < elem_loop_bound; e += gridDim.x*blockDim.z) {\n";
tab.push();
code << tab << "const CeedInt elem = e % num_elem;\n\n";

// -- Compute minimum buffer space needed
CeedInt max_rstr_buffer_size = 1;
Expand Down Expand Up @@ -1848,8 +1862,10 @@ static int CeedOperatorBuildKernelAssemblyAtPoints_Cuda_gen(CeedOperator op, boo
// Loop over all elements
code << "\n" << tab << "// Element loop\n";
code << tab << "__syncthreads();\n";
code << tab << "for (CeedInt elem = blockIdx.x*blockDim.z + threadIdx.z; elem < num_elem; elem += gridDim.x*blockDim.z) {\n";
code << tab << "const CeedInt elem_loop_bound = num_elem * ceil(1.0*num_elem/(gridDim.x*blockDim.z));\n\n";
code << tab << "for (CeedInt e = blockIdx.x*blockDim.z + threadIdx.z; e < elem_loop_bound; e += gridDim.x*blockDim.z) {\n";
tab.push();
code << tab << "const CeedInt elem = e % num_elem;\n\n";

// -- Compute minimum buffer space needed
CeedInt max_rstr_buffer_size = 1;
Expand Down Expand Up @@ -2042,11 +2058,15 @@ static int CeedOperatorBuildKernelAssemblyAtPoints_Cuda_gen(CeedOperator op, boo

CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_output_fields[i], &elem_rstr));
CeedCallBackend(CeedElemRestrictionGetLVectorSize(elem_rstr, &l_size));
code << tab << "if (e < num_elem) {\n";
tab.push();
code << tab << "const CeedInt l_size" << var_suffix << " = " << l_size << ";\n";
CeedCallBackend(CeedElemRestrictionGetCompStride(elem_rstr, &comp_stride));
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n";
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n\n";
code << tab << "WriteLVecStandard" << max_dim << "d_Assembly<num_comp" << var_suffix << ", comp_stride" << var_suffix << ", P_1d" + var_suffix
<< ">(data, l_size" << var_suffix << ", elem, n, r_e" << var_suffix << ", values_array);\n";
tab.pop();
code << tab << "}\n";
CeedCallBackend(CeedElemRestrictionDestroy(&elem_rstr));
} else {
std::string var_suffix = "_out_" + std::to_string(i);
Expand All @@ -2056,11 +2076,15 @@ static int CeedOperatorBuildKernelAssemblyAtPoints_Cuda_gen(CeedOperator op, boo

CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_output_fields[i], &elem_rstr));
CeedCallBackend(CeedElemRestrictionGetLVectorSize(elem_rstr, &l_size));
code << tab << "if (e < num_elem) {\n";
tab.push();
code << tab << "const CeedInt l_size" << var_suffix << " = " << l_size << ";\n";
CeedCallBackend(CeedElemRestrictionGetCompStride(elem_rstr, &comp_stride));
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n";
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n\n";
code << tab << "WriteLVecStandard" << max_dim << "d_Single<num_comp" << var_suffix << ", comp_stride" << var_suffix << ", P_1d" + var_suffix
<< ">(data, l_size" << var_suffix << ", elem, n, indices.outputs[" << i << "], r_e" << var_suffix << ", values_array);\n";
tab.pop();
code << tab << "}\n";
CeedCallBackend(CeedElemRestrictionDestroy(&elem_rstr));
}
}
Expand Down Expand Up @@ -2425,8 +2449,10 @@ extern "C" int CeedOperatorBuildKernelLinearAssembleQFunction_Cuda_gen(CeedOpera
// Loop over all elements
code << "\n" << tab << "// Element loop\n";
code << tab << "__syncthreads();\n";
code << tab << "for (CeedInt elem = blockIdx.x*blockDim.z + threadIdx.z; elem < num_elem; elem += gridDim.x*blockDim.z) {\n";
code << tab << "const CeedInt elem_loop_bound = num_elem * ceil(1.0*num_elem/(gridDim.x*blockDim.z));\n\n";
code << tab << "for (CeedInt e = blockIdx.x*blockDim.z + threadIdx.z; e < elem_loop_bound; e += gridDim.x*blockDim.z) {\n";
tab.push();
code << tab << "const CeedInt elem = e % num_elem;\n\n";

// -- Compute minimum buffer space needed
CeedInt max_rstr_buffer_size = 1;
Expand Down Expand Up @@ -2642,8 +2668,12 @@ extern "C" int CeedOperatorBuildKernelLinearAssembleQFunction_Cuda_gen(CeedOpera
// ---- Restriction
CeedInt field_size;

code << tab << "if (e < num_elem) {\n";
tab.push();
code << tab << "WriteLVecStandard" << (is_all_tensor ? max_dim : 1) << "d_QFAssembly<total_size_out, field_size_out_" << i << ", "
<< (is_all_tensor ? "Q_1d" : "Q") << ">(data, num_elem, elem, input_offset + s, " << offset << ", r_q_out_" << i << ", values_array);\n";
tab.pop();
code << tab << "}\n";
CeedCallBackend(CeedQFunctionFieldGetSize(qf_output_fields[i], &field_size));
offset += field_size;
}
Expand Down
42 changes: 35 additions & 7 deletions backends/hip-gen/ceed-hip-gen-operator-build.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -500,13 +500,17 @@ static int CeedOperatorBuildKernelRestriction_Hip_gen(std::ostringstream &code,
CeedInt comp_stride;

CeedCallBackend(CeedElemRestrictionGetLVectorSize(elem_rstr, &l_size));
code << tab << "if (e < num_elem) {\n";
tab.push();
code << tab << "const CeedInt l_size" << var_suffix << " = " << l_size << ";\n";
CeedCallBackend(CeedElemRestrictionGetCompStride(elem_rstr, &comp_stride));
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n";
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n\n";
data->indices.outputs[i] = (CeedInt *)rstr_data->d_offsets;
code << tab << "WriteLVecStandard" << (is_all_tensor ? max_dim : 1) << "d<num_comp" << var_suffix << ", comp_stride" << var_suffix << ", "
<< P_name << ">(data, l_size" << var_suffix << ", elem, indices.outputs[" << i << "], r_e" << var_suffix << ", d" << var_suffix
<< ");\n";
tab.pop();
code << tab << "}\n";
break;
}
case CEED_RESTRICTION_STRIDED: {
Expand All @@ -520,11 +524,15 @@ static int CeedOperatorBuildKernelRestriction_Hip_gen(std::ostringstream &code,
if (!has_backend_strides) {
CeedCallBackend(CeedElemRestrictionGetStrides(elem_rstr, strides));
}
code << tab << "if (e < num_elem) <\n";
Comment thread
jeremylt marked this conversation as resolved.
Outdated
tab.push();
code << tab << "const CeedInt strides" << var_suffix << "_0 = " << strides[0] << ", strides" << var_suffix << "_1 = " << strides[1]
<< ", strides" << var_suffix << "_2 = " << strides[2] << ";\n";
<< ", strides" << var_suffix << "_2 = " << strides[2] << ";\n\n";
code << tab << "WriteLVecStrided" << (is_all_tensor ? max_dim : 1) << "d<num_comp" << var_suffix << ", " << P_name << ", strides"
<< var_suffix << "_0, strides" << var_suffix << "_1, strides" << var_suffix << "_2>(data, elem, r_e" << var_suffix << ", d" << var_suffix
<< ");\n";
tab.pop();
code << tab << "}\n";
break;
}
case CEED_RESTRICTION_POINTS:
Expand Down Expand Up @@ -1060,10 +1068,14 @@ static int CeedOperatorBuildKernelQFunction_Hip_gen(std::ostringstream &code, Ce
CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_output_fields[i], &elem_rstr));
CeedCallBackend(CeedElemRestrictionGetCompStride(elem_rstr, &comp_stride));
CeedCallBackend(CeedElemRestrictionDestroy(&elem_rstr));
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n";
code << tab << "if (e < num_elem) {\n";
tab.push();
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n\n";
code << tab << "WritePoint<num_comp" << var_suffix << ", comp_stride" << var_suffix
<< ", max_num_points>(data, elem, i, points.num_per_elem[elem], indices.outputs[" << i << "]"
<< ", r_s" << var_suffix << ", d" << var_suffix << ");\n";
tab.pop();
code << tab << "}\n";
break;
}
case CEED_EVAL_INTERP:
Expand Down Expand Up @@ -1495,8 +1507,10 @@ extern "C" int CeedOperatorBuildKernel_Hip_gen(CeedOperator op, bool *is_good_bu
// Loop over all elements
code << "\n" << tab << "// Element loop\n";
code << tab << "__syncthreads();\n";
code << tab << "for (CeedInt elem = blockIdx.x*blockDim.z + threadIdx.z; elem < num_elem; elem += gridDim.x*blockDim.z) {\n";
code << tab << "const CeedInt elem_loop_bound = num_elem * ceil(1.0*num_elem/(gridDim.x*blockDim.z));\n\n";
code << tab << "for (CeedInt e = blockIdx.x*blockDim.z + threadIdx.z; e < elem_loop_bound; e += gridDim.x*blockDim.z) {\n";
tab.push();
code << tab << "const CeedInt elem = e % num_elem;\n\n";

// -- Compute minimum buffer space needed
CeedInt max_rstr_buffer_size = 1;
Expand Down Expand Up @@ -1853,8 +1867,10 @@ static int CeedOperatorBuildKernelAssemblyAtPoints_Hip_gen(CeedOperator op, bool
// Loop over all elements
code << "\n" << tab << "// Element loop\n";
code << tab << "__syncthreads();\n";
code << tab << "for (CeedInt elem = blockIdx.x*blockDim.z + threadIdx.z; elem < num_elem; elem += gridDim.x*blockDim.z) {\n";
code << tab << "const CeedInt elem_loop_bound = num_elem * ceil(1.0*num_elem/(gridDim.x*blockDim.z));\n\n";
code << tab << "for (CeedInt e = blockIdx.x*blockDim.z + threadIdx.z; e < elem_loop_bound; e += gridDim.x*blockDim.z) {\n";
tab.push();
code << tab << "const CeedInt elem = e % num_elem;\n\n";

// -- Compute minimum buffer space needed
CeedInt max_rstr_buffer_size = 1;
Expand Down Expand Up @@ -2047,11 +2063,15 @@ static int CeedOperatorBuildKernelAssemblyAtPoints_Hip_gen(CeedOperator op, bool

CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_output_fields[i], &elem_rstr));
CeedCallBackend(CeedElemRestrictionGetLVectorSize(elem_rstr, &l_size));
code << tab << "if (e < num_elem) {\n";
tab.push();
code << tab << "const CeedInt l_size" << var_suffix << " = " << l_size << ";\n";
CeedCallBackend(CeedElemRestrictionGetCompStride(elem_rstr, &comp_stride));
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n";
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n\n";
code << tab << "WriteLVecStandard" << max_dim << "d_Assembly<num_comp" << var_suffix << ", comp_stride" << var_suffix << ", P_1d" + var_suffix
<< ">(data, l_size" << var_suffix << ", elem, n, r_e" << var_suffix << ", values_array);\n";
tab.pop();
code << tab << "}\n";
CeedCallBackend(CeedElemRestrictionDestroy(&elem_rstr));
} else {
std::string var_suffix = "_out_" + std::to_string(i);
Expand All @@ -2061,11 +2081,15 @@ static int CeedOperatorBuildKernelAssemblyAtPoints_Hip_gen(CeedOperator op, bool

CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_output_fields[i], &elem_rstr));
CeedCallBackend(CeedElemRestrictionGetLVectorSize(elem_rstr, &l_size));
code << tab << "if (e < num_elem) {\n";
tab.push();
code << tab << "const CeedInt l_size" << var_suffix << " = " << l_size << ";\n";
CeedCallBackend(CeedElemRestrictionGetCompStride(elem_rstr, &comp_stride));
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n";
code << tab << "const CeedInt comp_stride" << var_suffix << " = " << comp_stride << ";\n\n";
code << tab << "WriteLVecStandard" << max_dim << "d_Single<num_comp" << var_suffix << ", comp_stride" << var_suffix << ", P_1d" + var_suffix
<< ">(data, l_size" << var_suffix << ", elem, n, indices.outputs[" << i << "], r_e" << var_suffix << ", values_array);\n";
tab.pop();
code << tab << "}\n";
CeedCallBackend(CeedElemRestrictionDestroy(&elem_rstr));
}
}
Expand Down Expand Up @@ -2638,8 +2662,12 @@ extern "C" int CeedOperatorBuildKernelLinearAssembleQFunction_Hip_gen(CeedOperat
// ---- Restriction
CeedInt field_size;

code << tab << "if (e < num_elem) {\n";
tab.push();
code << tab << "WriteLVecStandard" << (is_all_tensor ? max_dim : 1) << "d_QFAssembly<total_size_out, field_size_out_" << i << ", "
<< (is_all_tensor ? "Q_1d" : "Q") << ">(data, num_elem, elem, input_offset + s, " << offset << ", r_q_out_" << i << ", values_array);\n";
tab.pop();
code << tab << "}\n";
CeedCallBackend(CeedQFunctionFieldGetSize(qf_output_fields[i], &field_size));
offset += field_size;
}
Expand Down
Loading
Loading