// Copyright (c) 2017-2024, Lawrence Livermore National Security, LLC and other CEED contributors. // All Rights Reserved. See the top-level LICENSE and NOTICE files for details. // // SPDX-License-Identifier: BSD-2-Clause // // This file is part of CEED: http://github.com/ceed #define CEED_DEBUG_COLOR 12 #include #include #include #include #include #include #include "../hip-ref/ceed-hip-ref.h" #include "../hip-shared/ceed-hip-shared.h" #include "../hip/ceed-hip-common.h" #include "../hip/ceed-hip-compile.h" #include "ceed-hip-gen.h" //------------------------------------------------------------------------------ // Calculate the block size used for launching the operator kernel //------------------------------------------------------------------------------ extern "C" int BlockGridCalculate_Hip_gen(const CeedInt dim, const CeedInt num_elem, const CeedInt P_1d, const CeedInt Q_1d, CeedInt *block_sizes) { const CeedInt thread1d = CeedIntMax(Q_1d, P_1d); if (dim == 1) { CeedInt elems_per_block = 64 * thread1d > 256 ? 256 / thread1d : 64; elems_per_block = elems_per_block > 0 ? elems_per_block : 1; block_sizes[0] = thread1d; block_sizes[1] = 1; block_sizes[2] = elems_per_block; } else if (dim == 2) { const CeedInt elems_per_block = thread1d < 4 ? 16 : 2; block_sizes[0] = thread1d; block_sizes[1] = thread1d; block_sizes[2] = elems_per_block; } else if (dim == 3) { const CeedInt elems_per_block = thread1d < 6 ? 4 : (thread1d < 8 ? 2 : 1); block_sizes[0] = thread1d; block_sizes[1] = thread1d; block_sizes[2] = elems_per_block; } return CEED_ERROR_SUCCESS; } //------------------------------------------------------------------------------ // Determine type of operator //------------------------------------------------------------------------------ static int CeedOperatorBuildKernelData_Hip_gen(Ceed ceed, CeedInt num_input_fields, CeedOperatorField *op_input_fields, CeedQFunctionField *qf_input_fields, CeedInt num_output_fields, CeedOperatorField *op_output_fields, CeedQFunctionField *qf_output_fields, CeedInt *max_P_1d, CeedInt *Q_1d, CeedInt *dim, bool *is_tensor, bool *use_3d_slices) { // Find dim, P_1d, Q_1d *max_P_1d = 0; *Q_1d = 0; *dim = 0; *is_tensor = true; for (CeedInt i = 0; i < num_input_fields; i++) { CeedBasis basis; CeedCallBackend(CeedOperatorFieldGetBasis(op_input_fields[i], &basis)); if (basis != CEED_BASIS_NONE) { bool is_field_tensor; CeedInt field_P_1d = 0, field_Q_1d = 0, field_dim = 0; // Collect dim, P_1d, and Q_1d CeedCallBackend(CeedBasisIsTensor(basis, &is_field_tensor)); CeedCheck(is_field_tensor, ceed, CEED_ERROR_BACKEND, "Backend does not implement operators with non-tensor basis"); *is_tensor = *is_tensor && is_field_tensor; CeedCallBackend(CeedBasisGetNumNodes1D(basis, &field_P_1d)); *max_P_1d = CeedIntMax(*max_P_1d, field_P_1d); CeedCallBackend(CeedBasisGetDimension(basis, &field_dim)); CeedCheck(*dim == 0 || field_dim == *dim, ceed, CEED_ERROR_BACKEND, "Quadrature spaces must be compatible"); *dim = field_dim; CeedCallBackend(CeedBasisGetNumQuadraturePoints1D(basis, &field_Q_1d)); CeedCheck(*Q_1d == 0 || field_Q_1d == *Q_1d, ceed, CEED_ERROR_BACKEND, "Quadrature spaces must be compatible"); *Q_1d = field_Q_1d; } } for (CeedInt i = 0; i < num_output_fields; i++) { CeedBasis basis; CeedCallBackend(CeedOperatorFieldGetBasis(op_output_fields[i], &basis)); if (basis != CEED_BASIS_NONE) { bool is_field_tensor; CeedInt field_P_1d = 0, field_Q_1d = 0, field_dim = 0; // Collect dim, P_1d, and Q_1d CeedCallBackend(CeedBasisIsTensor(basis, &is_field_tensor)); CeedCheck(is_field_tensor, ceed, CEED_ERROR_BACKEND, "Backend does not implement operators with non-tensor basis"); *is_tensor = *is_tensor && is_field_tensor; CeedCallBackend(CeedBasisGetNumNodes1D(basis, &field_P_1d)); *max_P_1d = CeedIntMax(*max_P_1d, field_P_1d); CeedCallBackend(CeedBasisGetDimension(basis, &field_dim)); CeedCheck(*dim == 0 || field_dim == *dim, ceed, CEED_ERROR_BACKEND, "Quadrature spaces must be compatible"); *dim = field_dim; CeedCallBackend(CeedBasisGetNumQuadraturePoints1D(basis, &field_Q_1d)); CeedCheck(*Q_1d == 0 || field_Q_1d == *Q_1d, ceed, CEED_ERROR_BACKEND, "Quadrature spaces must be compatible"); *Q_1d = field_Q_1d; } } // Only use 3D collocated gradient parallelization strategy when gradient is computed *use_3d_slices = false; if (*dim == 3) { bool was_grad_found = false; for (CeedInt i = 0; i < num_input_fields; i++) { CeedEvalMode eval_mode; CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_input_fields[i], &eval_mode)); if (eval_mode == CEED_EVAL_GRAD) { CeedBasis_Hip_shared *basis_data; CeedBasis basis; CeedCallBackend(CeedOperatorFieldGetBasis(op_input_fields[i], &basis)); CeedCallBackend(CeedBasisGetData(basis, &basis_data)); *use_3d_slices = basis_data->d_collo_grad_1d && (was_grad_found ? *use_3d_slices : true); was_grad_found = true; } } for (CeedInt i = 0; i < num_output_fields; i++) { CeedEvalMode eval_mode; CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_output_fields[i], &eval_mode)); if (eval_mode == CEED_EVAL_GRAD) { CeedBasis_Hip_shared *basis_data; CeedBasis basis; CeedCallBackend(CeedOperatorFieldGetBasis(op_output_fields[i], &basis)); CeedCallBackend(CeedBasisGetData(basis, &basis_data)); *use_3d_slices = basis_data->d_collo_grad_1d && (was_grad_found ? *use_3d_slices : true); was_grad_found = true; } } } return CEED_ERROR_SUCCESS; } //------------------------------------------------------------------------------ // Setup fields //------------------------------------------------------------------------------ static int CeedOperatorBuildKernelFieldData_Hip_gen(std::ostringstream &code, CeedOperator_Hip_gen *data, CeedInt i, CeedOperatorField op_field, CeedQFunctionField qf_field, CeedInt Q_1d, bool is_input, bool use_3d_slices) { std::string var_suffix = (is_input ? "_in_" : "_out_") + std::to_string(i); std::string P_name = "P_1d" + var_suffix, Q_name = "Q_1d"; std::string option_name = (is_input ? "inputs" : "outputs"); CeedEvalMode eval_mode = CEED_EVAL_NONE; CeedInt elem_size = 0, num_comp = 0, P_1d = 0; CeedElemRestriction elem_rstr; CeedBasis_Hip_shared *basis_data; CeedBasis basis; code << " // -- " << (is_input ? "Input" : "Output") << " field " << i << "\n"; // Get field data CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_field, &elem_rstr)); if (elem_rstr != CEED_ELEMRESTRICTION_NONE) { CeedCallBackend(CeedElemRestrictionGetElementSize(elem_rstr, &elem_size)); CeedCallBackend(CeedElemRestrictionGetNumComponents(elem_rstr, &num_comp)); } CeedCallBackend(CeedOperatorFieldGetBasis(op_field, &basis)); if (basis != CEED_BASIS_NONE) { CeedCallBackend(CeedBasisGetData(basis, &basis_data)); CeedCallBackend(CeedBasisGetNumNodes1D(basis, &P_1d)); } CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_field, &eval_mode)); // Set field constants if (eval_mode != CEED_EVAL_WEIGHT) { code << " const CeedInt " << P_name << " = " << (basis == CEED_BASIS_NONE ? Q_1d : P_1d) << ";\n"; code << " const CeedInt num_comp" << var_suffix << " = " << num_comp << ";\n"; } // Load basis data code << " // EvalMode: " << CeedEvalModes[eval_mode] << "\n"; switch (eval_mode) { case CEED_EVAL_NONE: break; case CEED_EVAL_INTERP: if (is_input) data->B.inputs[i] = basis_data->d_interp_1d; else data->B.outputs[i] = basis_data->d_interp_1d; code << " __shared__ CeedScalar s_B" << var_suffix << "[" << P_1d * Q_1d << "];\n"; code << " loadMatrix<" << P_name << ", " << Q_name << ">(data, B." << option_name << "[" << i << "], s_B" << var_suffix << ");\n"; break; case CEED_EVAL_GRAD: if (is_input) data->B.inputs[i] = basis_data->d_interp_1d; else data->B.outputs[i] = basis_data->d_interp_1d; code << " __shared__ CeedScalar s_B" << var_suffix << "[" << P_1d * Q_1d << "];\n"; code << " loadMatrix<" << P_name << ", " << Q_name << ">(data, B." << option_name << "[" << i << "], s_B" << var_suffix << ");\n"; if (use_3d_slices) { if (is_input) data->G.inputs[i] = basis_data->d_collo_grad_1d; else data->G.outputs[i] = basis_data->d_collo_grad_1d; code << " __shared__ CeedScalar s_G" << var_suffix << "[" << Q_1d * Q_1d << "];\n"; code << " loadMatrix<" << Q_name << ", " << Q_name << ">(data, G." << option_name << "[" << i << "], s_G" << var_suffix << ");\n"; } else { bool has_collo_grad = basis_data->d_collo_grad_1d; if (is_input) data->G.inputs[i] = has_collo_grad ? basis_data->d_collo_grad_1d : basis_data->d_grad_1d; else data->G.outputs[i] = has_collo_grad ? basis_data->d_collo_grad_1d : basis_data->d_grad_1d; if (has_collo_grad) { code << " __shared__ CeedScalar s_G" << var_suffix << "[" << Q_1d * Q_1d << "];\n"; code << " loadMatrix<" << Q_name << ", " << Q_name << ">(data, G." << option_name << "[" << i << "], s_G" << var_suffix << ");\n"; } else { code << " __shared__ CeedScalar s_G" << var_suffix << "[" << Q_1d * P_1d << "];\n"; code << " loadMatrix<" << P_name << ", " << Q_name << ">(data, G." << option_name << "[" << i << "], s_G" << var_suffix << ");\n"; } } break; case CEED_EVAL_WEIGHT: break; // No action // LCOV_EXCL_START case CEED_EVAL_DIV: break; // TODO: Not implemented case CEED_EVAL_CURL: break; // TODO: Not implemented // LCOV_EXCL_STOP } return CEED_ERROR_SUCCESS; } //------------------------------------------------------------------------------ // Restriction //------------------------------------------------------------------------------ static int CeedOperatorBuildKernelRestriction_Hip_gen(std::ostringstream &code, CeedOperator_Hip_gen *data, CeedInt i, CeedInt dim, CeedInt field_input_buffer[], CeedOperatorField op_field, CeedQFunctionField qf_field, CeedInt Q_1d, bool is_input, bool use_3d_slices) { std::string var_suffix = (is_input ? "_in_" : "_out_") + std::to_string(i); std::string P_name = "P_1d" + var_suffix; CeedEvalMode eval_mode = CEED_EVAL_NONE; CeedInt elem_size = 0, num_comp = 0, P_1d = 0; CeedSize l_size; CeedElemRestriction_Hip *rstr_data; CeedElemRestriction elem_rstr; CeedBasis basis; // Get field data CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_field, &elem_rstr)); if (elem_rstr != CEED_ELEMRESTRICTION_NONE) { CeedCallBackend(CeedElemRestrictionGetElementSize(elem_rstr, &elem_size)); CeedCallBackend(CeedElemRestrictionGetNumComponents(elem_rstr, &num_comp)); CeedCallBackend(CeedElemRestrictionGetData(elem_rstr, &rstr_data)); } CeedCallBackend(CeedOperatorFieldGetBasis(op_field, &basis)); if (basis != CEED_BASIS_NONE) { CeedCallBackend(CeedBasisGetNumNodes1D(basis, &P_1d)); } CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_field, &eval_mode)); // Restriction if (is_input) { // Input // Input if (field_input_buffer[i] != i) { std::string buffer_name = "r_e_in_" + std::to_string(field_input_buffer[i]); // Restriction was already done for previous input code << " CeedScalar *r_e" << var_suffix << " = " << buffer_name << ";\n"; } else if (eval_mode != CEED_EVAL_WEIGHT && !((eval_mode == CEED_EVAL_NONE) && use_3d_slices)) { bool is_strided; if (eval_mode == CEED_EVAL_NONE) { // No basis action, so r_e_in_* in also r_q_in_* and needs to be allocated code << " CeedScalar r_e" << var_suffix << "[num_comp" << var_suffix << "*" << P_name << "];\n"; } else { // Otherwise we're using the scratch space code << " CeedScalar *r_e" << var_suffix << " = r_e_scratch;\n"; } CeedCallBackend(CeedElemRestrictionIsStrided(elem_rstr, &is_strided)); if (!is_strided) { CeedInt comp_stride; CeedCallBackend(CeedElemRestrictionGetLVectorSize(elem_rstr, &l_size)); code << " const CeedInt l_size" << var_suffix << " = " << l_size << ";\n"; CeedCallBackend(CeedElemRestrictionGetCompStride(elem_rstr, &comp_stride)); code << " // CompStride: " << comp_stride << "\n"; data->indices.inputs[i] = (CeedInt *)rstr_data->d_offsets; code << " readDofsOffset" << dim << "d(data, l_size" << var_suffix << ", elem, indices.inputs[" << i << "], d" << var_suffix << ", r_e" << var_suffix << ");\n"; } else { bool has_backend_strides; CeedInt num_elem; CeedCallBackend(CeedElemRestrictionHasBackendStrides(elem_rstr, &has_backend_strides)); CeedCallBackend(CeedElemRestrictionGetNumElements(elem_rstr, &num_elem)); CeedInt strides[3] = {1, elem_size * num_elem, elem_size}; if (!has_backend_strides) { CeedCallBackend(CeedElemRestrictionGetStrides(elem_rstr, strides)); } code << " // Strides: {" << strides[0] << ", " << strides[1] << ", " << strides[2] << "}\n"; code << " readDofsStrided" << dim << "d(data, elem, d" << var_suffix << ", r_e" << var_suffix << ");\n"; } } } else { // Output bool is_strided; CeedCallBackend(CeedElemRestrictionIsStrided(elem_rstr, &is_strided)); if (!is_strided) { CeedInt comp_stride; CeedCallBackend(CeedElemRestrictionGetLVectorSize(elem_rstr, &l_size)); code << " const CeedInt l_size" << var_suffix << " = " << l_size << ";\n"; CeedCallBackend(CeedElemRestrictionGetCompStride(elem_rstr, &comp_stride)); code << " // CompStride: " << comp_stride << "\n"; data->indices.outputs[i] = (CeedInt *)rstr_data->d_offsets; code << " writeDofsOffset" << dim << "d(data, l_size" << var_suffix << ", elem, indices.outputs[" << i << "], r_e" << var_suffix << ", d" << var_suffix << ");\n"; } else { bool has_backend_strides; CeedInt num_elem; CeedCallBackend(CeedElemRestrictionHasBackendStrides(elem_rstr, &has_backend_strides)); CeedCallBackend(CeedElemRestrictionGetNumElements(elem_rstr, &num_elem)); CeedInt strides[3] = {1, elem_size * num_elem, elem_size}; if (!has_backend_strides) { CeedCallBackend(CeedElemRestrictionGetStrides(elem_rstr, strides)); } code << " // Strides: {" << strides[0] << ", " << strides[1] << ", " << strides[2] << "}\n"; code << " writeDofsStrided" << dim << "d(data, elem, r_e" << var_suffix << ", d" << var_suffix << ");\n"; } } return CEED_ERROR_SUCCESS; } //------------------------------------------------------------------------------ // Basis //------------------------------------------------------------------------------ static int CeedOperatorBuildKernelBasis_Hip_gen(std::ostringstream &code, CeedOperator_Hip_gen *data, CeedInt i, CeedInt dim, CeedOperatorField op_field, CeedQFunctionField qf_field, CeedInt Q_1d, bool is_input, bool use_3d_slices) { std::string var_suffix = (is_input ? "_in_" : "_out_") + std::to_string(i); std::string P_name = "P_1d" + var_suffix, Q_name = "Q_1d"; CeedEvalMode eval_mode = CEED_EVAL_NONE; CeedInt elem_size = 0, num_comp = 0, P_1d = 0; CeedElemRestriction elem_rstr; CeedBasis basis; // Get field data CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_field, &elem_rstr)); if (elem_rstr != CEED_ELEMRESTRICTION_NONE) { CeedCallBackend(CeedElemRestrictionGetElementSize(elem_rstr, &elem_size)); CeedCallBackend(CeedElemRestrictionGetNumComponents(elem_rstr, &num_comp)); } CeedCallBackend(CeedOperatorFieldGetBasis(op_field, &basis)); if (basis != CEED_BASIS_NONE) { CeedCallBackend(CeedBasisGetNumNodes1D(basis, &P_1d)); } CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_field, &eval_mode)); // Basis code << " // EvalMode: " << CeedEvalModes[eval_mode] << "\n"; if (is_input) { switch (eval_mode) { case CEED_EVAL_NONE: if (!use_3d_slices) { code << " CeedScalar *r_q" << var_suffix << " = r_e" << var_suffix << ";\n"; } break; case CEED_EVAL_INTERP: code << " CeedScalar r_q" << var_suffix << "[num_comp" << var_suffix << "*" << Q_name << "];\n"; code << " Interp" << (dim > 1 ? "Tensor" : "") << dim << "d(data, r_e" << var_suffix << ", s_B" << var_suffix << ", r_q" << var_suffix << ");\n"; break; case CEED_EVAL_GRAD: if (use_3d_slices) { code << " CeedScalar r_q" << var_suffix << "[num_comp" << var_suffix << "*" << Q_name << "];\n"; code << " Interp" << (dim > 1 ? "Tensor" : "") << dim << "d(data, r_e" << var_suffix << ", s_B" << var_suffix << ", r_q" << var_suffix << ");\n"; } else { code << " CeedScalar r_q" << var_suffix << "[num_comp" << var_suffix << "*dim*" << Q_name << "];\n"; code << " Grad" << (dim > 1 ? "Tensor" : "") << (dim == 3 && Q_1d >= P_1d ? "Collocated" : "") << dim << "d(data, r_e" << var_suffix << ", s_B" << var_suffix << ", s_G" << var_suffix << ", r_q" << var_suffix << ");\n"; } break; case CEED_EVAL_WEIGHT: { CeedBasis_Hip_shared *basis_data; code << " CeedScalar r_q" << var_suffix << "[" << Q_name << "];\n"; CeedCallBackend(CeedBasisGetData(basis, &basis_data)); data->W = basis_data->d_q_weight_1d; code << " Weight" << (dim > 1 ? "Tensor" : "") << dim << "d<" << Q_name << ">(data, W, r_q" << var_suffix << ");\n"; break; } // LCOV_EXCL_START case CEED_EVAL_DIV: case CEED_EVAL_CURL: break; // TODO: Not implemented // LCOV_EXCL_STOP } } else { switch (eval_mode) { case CEED_EVAL_NONE: code << " CeedScalar *r_e" << var_suffix << " = r_q" << var_suffix << ";\n"; break; // No action case CEED_EVAL_INTERP: code << " CeedScalar *r_e" << var_suffix << " = r_e_scratch;\n"; code << " InterpTranspose" << (dim > 1 ? "Tensor" : "") << dim << "d(data, r_q" << var_suffix << ", s_B" << var_suffix << ", r_e" << var_suffix << ");\n"; break; case CEED_EVAL_GRAD: code << " CeedScalar *r_e" << var_suffix << " = r_e_scratch;\n"; if (use_3d_slices) { code << " InterpTranspose" << (dim > 1 ? "Tensor" : "") << dim << "d(data, r_q" << var_suffix << ", s_B" << var_suffix << ", r_e" << var_suffix << ");\n"; } else { code << " GradTranspose" << (dim > 1 ? "Tensor" : "") << (dim == 3 && Q_1d >= P_1d ? "Collocated" : "") << dim << "d(data, r_q" << var_suffix << ", s_B" << var_suffix << ", s_G" << var_suffix << ", r_e" << var_suffix << ");\n"; } break; // LCOV_EXCL_START case CEED_EVAL_WEIGHT: break; // Should not occur case CEED_EVAL_DIV: case CEED_EVAL_CURL: break; // TODO: Not implemented // LCOV_EXCL_STOP } } return CEED_ERROR_SUCCESS; } //------------------------------------------------------------------------------ // QFunction //------------------------------------------------------------------------------ static int CeedOperatorBuildKernelQFunction_Hip_gen(std::ostringstream &code, CeedOperator_Hip_gen *data, CeedInt dim, CeedInt num_input_fields, CeedOperatorField *op_input_fields, CeedQFunctionField *qf_input_fields, CeedInt num_output_fields, CeedOperatorField *op_output_fields, CeedQFunctionField *qf_output_fields, std::string qfunction_name, CeedInt Q_1d, bool use_3d_slices) { std::string Q_name = "Q_1d"; CeedEvalMode eval_mode = CEED_EVAL_NONE; CeedElemRestriction elem_rstr; // Setup output arays code << "\n // -- Output field setup\n"; for (CeedInt i = 0; i < num_output_fields; i++) { std::string var_suffix = "_out_" + std::to_string(i); code << " // ---- Output field " << i << "\n"; CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_output_fields[i], &eval_mode)); if (eval_mode == CEED_EVAL_NONE || eval_mode == CEED_EVAL_INTERP) { code << " CeedScalar r_q" << var_suffix << "[num_comp" << var_suffix << "*" << Q_name << "];\n"; } if (eval_mode == CEED_EVAL_GRAD) { if (use_3d_slices) { // Accumulator for gradient slices code << " CeedScalar r_q" << var_suffix << "[num_comp" << var_suffix << "*" << Q_name << "];\n"; code << " for (CeedInt i = 0; i < num_comp" << var_suffix << "*" << Q_name << "; i++) {\n"; code << " r_q" << var_suffix << "[i] = 0.0;\n"; code << " }\n"; } else { code << " CeedScalar r_q" << var_suffix << "[num_comp" << var_suffix << "*dim*" << Q_name << "];\n"; } } } // We treat quadrature points per slice in 3d to save registers if (use_3d_slices) { code << "\n // Note: Using planes of 3D elements\n"; code << " #pragma unroll\n"; code << " for (CeedInt q = 0; q < " << Q_name << "; q++) {\n"; code << " // -- Input fields\n"; for (CeedInt i = 0; i < num_input_fields; i++) { std::string var_suffix = "_in_" + std::to_string(i); code << " // ---- Input field " << i << "\n"; CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_input_fields[i], &eval_mode)); // Basis action code << " // EvalMode: " << CeedEvalModes[eval_mode] << "\n"; switch (eval_mode) { case CEED_EVAL_NONE: bool is_strided; code << " CeedScalar r_s" << var_suffix << "[num_comp" << var_suffix << "];\n"; CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_input_fields[i], &elem_rstr)); CeedCallBackend(CeedElemRestrictionIsStrided(elem_rstr, &is_strided)); if (is_strided) { bool has_backend_strides; CeedInt num_elem, elem_size; CeedCallBackend(CeedElemRestrictionGetElementSize(elem_rstr, &elem_size)); CeedCallBackend(CeedElemRestrictionHasBackendStrides(elem_rstr, &has_backend_strides)); CeedCallBackend(CeedElemRestrictionGetNumElements(elem_rstr, &num_elem)); CeedInt strides[3] = {1, elem_size * num_elem, elem_size}; if (!has_backend_strides) { CeedCallBackend(CeedElemRestrictionGetStrides(elem_rstr, strides)); } code << " // Strides: {" << strides[0] << ", " << strides[1] << ", " << strides[2] << "}\n"; code << " readSliceQuadsStrided3d(data, elem, q, d" << var_suffix << ", r_s" << var_suffix << ");\n"; } else { CeedSize l_size = 0; CeedInt comp_stride; CeedElemRestriction_Hip *rstr_data; CeedCallBackend(CeedElemRestrictionGetLVectorSize(elem_rstr, &l_size)); code << " const CeedInt l_size" << var_suffix << " = " << l_size << ";\n"; CeedCallBackend(CeedElemRestrictionGetCompStride(elem_rstr, &comp_stride)); code << " // CompStride: " << comp_stride << "\n"; CeedCallBackend(CeedElemRestrictionGetData(elem_rstr, &rstr_data)); data->indices.inputs[i] = (CeedInt *)rstr_data->d_offsets; code << " readSliceQuadsOffset3d(data, l_size" << var_suffix << ", elem, q, indices.inputs[" << i << "], d" << var_suffix << ", r_s" << var_suffix << ");\n"; } break; case CEED_EVAL_INTERP: code << " CeedScalar r_s" << var_suffix << "[num_comp" << var_suffix << "];\n"; code << " for (CeedInt j = 0; j < num_comp" << var_suffix << "; j++) {\n"; code << " r_s" << var_suffix << "[j] = r_q" << var_suffix << "[q + j*" << Q_name << "];\n"; code << " }\n"; break; case CEED_EVAL_GRAD: code << " CeedScalar r_s" << var_suffix << "[num_comp" << var_suffix << "*dim];\n"; code << " gradCollo3d(data, q, r_q" << var_suffix << ", s_G" << var_suffix << ", r_s" << var_suffix << ");\n"; break; case CEED_EVAL_WEIGHT: code << " CeedScalar r_s" << var_suffix << "[1];\n"; code << " r_s" << var_suffix << "[0] = r_q" << var_suffix << "[q];\n"; break; // No action // LCOV_EXCL_START case CEED_EVAL_DIV: break; // TODO: Not implemented case CEED_EVAL_CURL: break; // TODO: Not implemented // LCOV_EXCL_STOP } } code << "\n // -- Output fields\n"; for (CeedInt i = 0; i < num_output_fields; i++) { std::string var_suffix = "_out_" + std::to_string(i); code << " // ---- Output field " << i << "\n"; CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_output_fields[i], &eval_mode)); // Basis action switch (eval_mode) { case CEED_EVAL_NONE: code << " CeedScalar r_s" << var_suffix << "[num_comp" << var_suffix << "];\n"; break; // No action case CEED_EVAL_INTERP: code << " CeedScalar r_s" << var_suffix << "[num_comp" << var_suffix << "];\n"; break; case CEED_EVAL_GRAD: code << " CeedScalar r_s" << var_suffix << "[num_comp" << var_suffix << "*dim];\n"; break; // LCOV_EXCL_START case CEED_EVAL_WEIGHT: break; // Should not occur case CEED_EVAL_DIV: break; // TODO: Not implemented case CEED_EVAL_CURL: break; // TODO: Not implemented // LCOV_EXCL_STOP } } } else { code << "\n // Note: Using full elements\n"; code << " {\n"; code << " // -- Input fields\n"; for (CeedInt i = 0; i < num_input_fields; i++) { code << " // ---- Input field " << i << "\n"; code << " CeedScalar *r_s_in_" << i << " = r_q_in_" << i << ";\n"; } code << " // -- Output fields\n"; for (CeedInt i = 0; i < num_output_fields; i++) { code << " // ---- Output field " << i << "\n"; code << " CeedScalar *r_s_out_" << i << " = r_q_out_" << i << ";\n"; } } // Input and output buffers code << "\n // -- QFunction inputs and outputs\n"; code << " // ---- Inputs\n"; code << " CeedScalar *inputs[" << CeedIntMax(num_input_fields, 1) << "];\n"; for (CeedInt i = 0; i < num_input_fields; i++) { code << " // ------ Input field " << i << "\n"; code << " inputs[" << i << "] = r_s_in_" << i << ";\n"; } code << " // ---- Outputs\n"; code << " CeedScalar *outputs[" << CeedIntMax(num_output_fields, 1) << "];\n"; for (CeedInt i = 0; i < num_output_fields; i++) { code << " // ------ Output field " << i << "\n"; code << " outputs[" << i << "] = r_s_out_" << i << ";\n"; } // Apply QFunction code << "\n // -- Apply QFunction\n"; code << " " << qfunction_name << "(ctx, "; if (dim != 3 || use_3d_slices) { code << "1"; } else { code << "Q_1d"; } code << ", inputs, outputs);\n"; // Copy or apply transpose grad, if needed if (use_3d_slices) { code << " // -- Output fields\n"; for (CeedInt i = 0; i < num_output_fields; i++) { std::string var_suffix = "_out_" + std::to_string(i); std::string P_name = "P_1d" + var_suffix; code << " // ---- Output field " << i << "\n"; CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_output_fields[i], &eval_mode)); // Basis action code << " // EvalMode: " << CeedEvalModes[eval_mode] << "\n"; switch (eval_mode) { case CEED_EVAL_NONE: code << " for (CeedInt j = 0; j < num_comp" << var_suffix << " ; j++) {\n"; code << " r_q" << var_suffix << "[q + j*" << Q_name << "] = r_s" << var_suffix << "[j];\n"; code << " }\n"; break; // No action case CEED_EVAL_INTERP: code << " for (CeedInt j = 0; j < num_comp" << var_suffix << " ; j++) {\n"; code << " r_q" << var_suffix << "[q + j*" << Q_name << "] = r_s" << var_suffix << "[j];\n"; code << " }\n"; break; case CEED_EVAL_GRAD: code << " gradColloTranspose3d(data, q, r_s" << var_suffix << ", s_G" << var_suffix << ", r_q" << var_suffix << ");\n"; break; // LCOV_EXCL_START case CEED_EVAL_WEIGHT: break; // Should not occur case CEED_EVAL_DIV: break; // TODO: Not implemented case CEED_EVAL_CURL: break; // TODO: Not implemented // LCOV_EXCL_STOP } } } code << " }\n"; return CEED_ERROR_SUCCESS; } //------------------------------------------------------------------------------ // Build single operator kernel //------------------------------------------------------------------------------ extern "C" int CeedOperatorBuildKernel_Hip_gen(CeedOperator op) { bool is_tensor = true, use_3d_slices = false; Ceed ceed; CeedInt Q_1d, num_input_fields, num_output_fields, dim = 1; CeedQFunctionField *qf_input_fields, *qf_output_fields; CeedQFunction_Hip_gen *qf_data; CeedQFunction qf; CeedOperatorField *op_input_fields, *op_output_fields; CeedOperator_Hip_gen *data; std::ostringstream code; { bool is_setup_done; CeedCallBackend(CeedOperatorIsSetupDone(op, &is_setup_done)); if (is_setup_done) return CEED_ERROR_SUCCESS; } CeedCallBackend(CeedOperatorGetCeed(op, &ceed)); CeedCallBackend(CeedOperatorGetData(op, &data)); CeedCallBackend(CeedOperatorGetQFunction(op, &qf)); CeedCallBackend(CeedQFunctionGetData(qf, &qf_data)); CeedCallBackend(CeedOperatorGetFields(op, &num_input_fields, &op_input_fields, &num_output_fields, &op_output_fields)); CeedCallBackend(CeedQFunctionGetFields(qf, NULL, &qf_input_fields, NULL, &qf_output_fields)); // Get operator data CeedCallBackend(CeedOperatorBuildKernelData_Hip_gen(ceed, num_input_fields, op_input_fields, qf_input_fields, num_output_fields, op_output_fields, qf_output_fields, &data->max_P_1d, &Q_1d, &dim, &is_tensor, &use_3d_slices)); if (dim == 0) dim = 1; data->dim = dim; if (Q_1d == 0) { CeedInt Q; CeedCallBackend(CeedOperatorGetNumQuadraturePoints(op, &Q)); Q_1d = Q; } data->Q_1d = Q_1d; // Check for restriction only identity operator { bool is_identity_qf; CeedCallBackend(CeedQFunctionIsIdentity(qf, &is_identity_qf)); if (is_identity_qf) { CeedEvalMode eval_mode_in, eval_mode_out; CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_input_fields[0], &eval_mode_in)); CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_output_fields[0], &eval_mode_out)); CeedCheck(eval_mode_in != CEED_EVAL_NONE || eval_mode_out != CEED_EVAL_NONE, ceed, CEED_ERROR_BACKEND, "Backend does not implement restriction only identity operators"); } } // Load basis source files // TODO: Add non-tensor, AtPoints code << "// Tensor basis source\n"; code << "#include \n\n"; code << "// CodeGen operator source\n"; code << "#include \n\n"; // Get QFunction name std::string qfunction_name(qf_data->qfunction_name); std::string operator_name; operator_name = "CeedKernelHipGenOperator_" + qfunction_name; // Define CEED_Q_VLA code << "\n#undef CEED_Q_VLA\n"; if (dim != 3 || use_3d_slices) { code << "#define CEED_Q_VLA 1\n\n"; } else { code << "#define CEED_Q_VLA " << Q_1d << "\n\n"; } // Add user QFunction source { const char *source_path; CeedCallBackend(CeedQFunctionGetSourcePath(qf, &source_path)); CeedCheck(source_path, ceed, CEED_ERROR_UNSUPPORTED, "/gpu/hip/gen backend requires QFunction source code file"); code << "// User QFunction source\n"; code << "#include \"" << source_path << "\"\n\n"; } // Setup code << "\n// -----------------------------------------------------------------------------\n"; code << "// Operator Kernel\n"; code << "// \n"; code << "// d_[in,out]_i: CeedVector device array\n"; code << "// r_[in,out]_e_i: Element vector register\n"; code << "// r_[in,out]_q_i: Quadrature space vector register\n"; code << "// r_[in,out]_s_i: Quadrature space slice vector register\n"; code << "// \n"; code << "// s_B_[in,out]_i: Interpolation matrix, shared memory\n"; code << "// s_G_[in,out]_i: Gradient matrix, shared memory\n"; code << "// -----------------------------------------------------------------------------\n"; code << "\nextern \"C\" __launch_bounds__(BLOCK_SIZE)\n"; code << "__global__ void " << operator_name << "(CeedInt num_elem, void* ctx, FieldsInt_Hip indices, Fields_Hip fields, Fields_Hip B, Fields_Hip G, CeedScalar* W) {\n"; // Scratch buffers for (CeedInt i = 0; i < num_input_fields; i++) { CeedEvalMode eval_mode; CeedCallBackend(CeedQFunctionFieldGetEvalMode(qf_input_fields[i], &eval_mode)); if (eval_mode != CEED_EVAL_WEIGHT) { // Skip CEED_EVAL_WEIGHT code << " const CeedScalar *d_in_" << i << " = fields.inputs[" << i << "];\n"; } } for (CeedInt i = 0; i < num_output_fields; i++) { code << " CeedScalar *d_out_" << i << " = fields.outputs[" << i << "];\n"; } code << " const CeedInt dim = " << dim << ";\n"; code << " const CeedInt Q_1d = " << Q_1d << ";\n"; // Shared data code << " extern __shared__ CeedScalar slice[];\n"; code << " SharedData_Hip data;\n"; code << " data.t_id_x = threadIdx.x;\n"; code << " data.t_id_y = threadIdx.y;\n"; code << " data.t_id_z = threadIdx.z;\n"; code << " data.t_id = threadIdx.x + threadIdx.y*blockDim.x + threadIdx.z*blockDim.y*blockDim.x;\n"; code << " data.slice = slice + data.t_id_z*T_1D" << (dim > 1 ? "*T_1D" : "") << ";\n"; // Initialize constants, and matrices B and G code << "\n // Input field constants and basis data\n"; for (CeedInt i = 0; i < num_input_fields; i++) { CeedCallBackend(CeedOperatorBuildKernelFieldData_Hip_gen(code, data, i, op_input_fields[i], qf_input_fields[i], Q_1d, true, use_3d_slices)); } code << "\n // Output field constants and basis data\n"; for (CeedInt i = 0; i < num_output_fields; i++) { CeedCallBackend(CeedOperatorBuildKernelFieldData_Hip_gen(code, data, i, op_output_fields[i], qf_output_fields[i], Q_1d, false, use_3d_slices)); } // Loop over all elements code << "\n // Element loop\n"; code << " __syncthreads();\n"; code << " for (CeedInt elem = blockIdx.x*blockDim.z + threadIdx.z; elem < num_elem; elem += gridDim.x*blockDim.z) {\n"; // -- Compute minimum buffer space needed CeedInt max_rstr_buffer_size = 0; for (CeedInt i = 0; i < num_input_fields; i++) { CeedInt num_comp, elem_size; CeedElemRestriction elem_rstr; CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_input_fields[i], &elem_rstr)); CeedCallBackend(CeedElemRestrictionGetNumComponents(elem_rstr, &num_comp)); CeedCallBackend(CeedElemRestrictionGetElementSize(elem_rstr, &elem_size)); max_rstr_buffer_size = CeedIntMax(max_rstr_buffer_size, num_comp * elem_size); CeedCallBackend(CeedElemRestrictionDestroy(&elem_rstr)); } for (CeedInt i = 0; i < num_output_fields; i++) { CeedInt num_comp, elem_size; CeedElemRestriction elem_rstr; CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_output_fields[i], &elem_rstr)); CeedCallBackend(CeedElemRestrictionGetNumComponents(elem_rstr, &num_comp)); CeedCallBackend(CeedElemRestrictionGetElementSize(elem_rstr, &elem_size)); max_rstr_buffer_size = CeedIntMax(max_rstr_buffer_size, num_comp * elem_size); CeedCallBackend(CeedElemRestrictionDestroy(&elem_rstr)); } code << " // Scratch restriction buffer space\n"; code << " CeedScalar r_e_scratch[" << max_rstr_buffer_size << "];\n"; // -- Determine best input field processing order CeedInt field_rstr_in_buffer[CEED_FIELD_MAX], input_field_order[CEED_FIELD_MAX]; for (CeedInt i = 0; i < num_input_fields; i++) { field_rstr_in_buffer[i] = -1; input_field_order[i] = -1; } { bool is_ordered[CEED_FIELD_MAX]; CeedInt curr_index = 0; for (CeedInt i = 0; i < num_input_fields; i++) is_ordered[i] = false; for (CeedInt i = 0; i < num_input_fields; i++) { CeedVector vec_i; CeedElemRestriction rstr_i; if (is_ordered[i]) continue; field_rstr_in_buffer[i] = i; is_ordered[i] = true; input_field_order[curr_index] = i; curr_index++; CeedCallBackend(CeedOperatorFieldGetVector(op_input_fields[i], &vec_i)); if (vec_i == CEED_VECTOR_NONE) continue; // CEED_EVAL_WEIGHT CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_input_fields[i], &rstr_i)); for (CeedInt j = i + 1; j < num_input_fields; j++) { CeedVector vec_j; CeedElemRestriction rstr_j; CeedCallBackend(CeedOperatorFieldGetVector(op_input_fields[j], &vec_j)); CeedCallBackend(CeedOperatorFieldGetElemRestriction(op_input_fields[j], &rstr_j)); if (rstr_i == rstr_j && vec_i == vec_j) { field_rstr_in_buffer[j] = i; is_ordered[j] = true; input_field_order[curr_index] = j; curr_index++; } } } } // -- Input restriction and basis code << " // -- Input field restrictions and basis actions\n"; for (CeedInt i = 0; i < num_input_fields; i++) { CeedInt f = input_field_order[i]; code << " // ---- Input field " << f << "\n"; // ---- Restriction CeedCallBackend(CeedOperatorBuildKernelRestriction_Hip_gen(code, data, f, dim, field_rstr_in_buffer, op_input_fields[f], qf_input_fields[f], Q_1d, true, use_3d_slices)); // ---- Basis action CeedCallBackend(CeedOperatorBuildKernelBasis_Hip_gen(code, data, f, dim, op_input_fields[f], qf_input_fields[f], Q_1d, true, use_3d_slices)); } // -- Q function CeedCallBackend(CeedOperatorBuildKernelQFunction_Hip_gen(code, data, dim, num_input_fields, op_input_fields, qf_input_fields, num_output_fields, op_output_fields, qf_output_fields, qfunction_name, Q_1d, use_3d_slices)); // -- Output basis and restriction code << "\n // -- Output field basis action and restrictions\n"; for (CeedInt i = 0; i < num_output_fields; i++) { code << " // ---- Output field " << i << "\n"; // ---- Basis action CeedCallBackend(CeedOperatorBuildKernelBasis_Hip_gen(code, data, i, dim, op_output_fields[i], qf_output_fields[i], Q_1d, false, use_3d_slices)); // ---- Restriction CeedCallBackend( CeedOperatorBuildKernelRestriction_Hip_gen(code, data, i, dim, NULL, op_output_fields[i], qf_output_fields[i], Q_1d, false, use_3d_slices)); } // Close loop and function code << " }\n"; code << "}\n"; code << "// -----------------------------------------------------------------------------\n\n"; CeedInt block_sizes[3] = {0, 0, 0}; CeedInt num_elem; CeedCallBackend(CeedOperatorGetNumElements(op, &num_elem)); CeedCallBackend(BlockGridCalculate_Hip_gen(dim, num_elem, data->max_P_1d, Q_1d, block_sizes)); CeedCallBackend(CeedCompile_Hip(ceed, code.str().c_str(), &data->module, 2, "T_1D", block_sizes[0], "BLOCK_SIZE", block_sizes[0] * block_sizes[1] * block_sizes[2])); CeedCallBackend(CeedGetKernel_Hip(ceed, data->module, operator_name.c_str(), &data->op)); CeedCallBackend(CeedOperatorSetSetupDone(op)); CeedCallBackend(CeedDestroy(&ceed)); CeedCallBackend(CeedQFunctionDestroy(&qf)); return CEED_ERROR_SUCCESS; } //------------------------------------------------------------------------------