1 // Copyright (c) 2017-2018, Lawrence Livermore National Security, LLC. 2 // Produced at the Lawrence Livermore National Laboratory. LLNL-CODE-734707. 3 // All Rights reserved. See files LICENSE and NOTICE for details. 4 // 5 // This file is part of CEED, a collection of benchmarks, miniapps, software 6 // libraries and APIs for efficient high-order finite element and spectral 7 // element discretizations for exascale applications. For more information and 8 // source code availability see http://github.com/ceed. 9 // 10 // The CEED research is supported by the Exascale Computing Project 17-SC-20-SC, 11 // a collaborative effort of two U.S. Department of Energy organizations (Office 12 // of Science and the National Nuclear Security Administration) responsible for 13 // the planning and preparation of a capable exascale ecosystem, including 14 // software, applications, hardware, advanced system engineering and early 15 // testbed platforms, in support of the nation's exascale computing imperative. 16 17 #include <ceed/ceed.h> 18 #include <ceed/backend.h> 19 #include <stddef.h> 20 #include "ceed-hip-gen.h" 21 #include "ceed-hip-gen-operator-build.h" 22 #include "../hip/ceed-hip-compile.h" 23 24 //------------------------------------------------------------------------------ 25 // Destroy operator 26 //------------------------------------------------------------------------------ 27 static int CeedOperatorDestroy_Hip_gen(CeedOperator op) { 28 int ierr; 29 CeedOperator_Hip_gen *impl; 30 ierr = CeedOperatorGetData(op, &impl); CeedChkBackend(ierr); 31 ierr = CeedFree(&impl); CeedChkBackend(ierr); 32 return CEED_ERROR_SUCCESS; 33 } 34 35 //------------------------------------------------------------------------------ 36 // Apply and add to output 37 //------------------------------------------------------------------------------ 38 static int CeedOperatorApplyAdd_Hip_gen(CeedOperator op, CeedVector invec, 39 CeedVector outvec, CeedRequest *request) { 40 int ierr; 41 Ceed ceed; 42 ierr = CeedOperatorGetCeed(op, &ceed); CeedChkBackend(ierr); 43 CeedOperator_Hip_gen *data; 44 ierr = CeedOperatorGetData(op, &data); CeedChkBackend(ierr); 45 CeedQFunction qf; 46 CeedQFunction_Hip_gen *qf_data; 47 ierr = CeedOperatorGetQFunction(op, &qf); CeedChkBackend(ierr); 48 ierr = CeedQFunctionGetData(qf, &qf_data); CeedChkBackend(ierr); 49 CeedInt nelem, numinputfields, numoutputfields; 50 ierr = CeedOperatorGetNumElements(op, &nelem); CeedChkBackend(ierr); 51 ierr = CeedQFunctionGetNumArgs(qf, &numinputfields, &numoutputfields); 52 CeedChkBackend(ierr); 53 CeedOperatorField *opinputfields, *opoutputfields; 54 ierr = CeedOperatorGetFields(op, &opinputfields, &opoutputfields); 55 CeedChkBackend(ierr); 56 CeedQFunctionField *qfinputfields, *qfoutputfields; 57 ierr = CeedQFunctionGetFields(qf, &qfinputfields, &qfoutputfields); 58 CeedChkBackend(ierr); 59 CeedEvalMode emode; 60 CeedVector vec, outvecs[16] = {}; 61 62 //Creation of the operator 63 ierr = CeedHipGenOperatorBuild(op); CeedChkBackend(ierr); 64 65 // Input vectors 66 for (CeedInt i = 0; i < numinputfields; i++) { 67 ierr = CeedQFunctionFieldGetEvalMode(qfinputfields[i], &emode); 68 CeedChkBackend(ierr); 69 if (emode == CEED_EVAL_WEIGHT) { // Skip 70 data->fields.in[i] = NULL; 71 } else { 72 // Get input vector 73 ierr = CeedOperatorFieldGetVector(opinputfields[i], &vec); CeedChkBackend(ierr); 74 if (vec == CEED_VECTOR_ACTIVE) vec = invec; 75 ierr = CeedVectorGetArrayRead(vec, CEED_MEM_DEVICE, &data->fields.in[i]); 76 CeedChkBackend(ierr); 77 } 78 } 79 80 // Output vectors 81 for (CeedInt i = 0; i < numoutputfields; i++) { 82 ierr = CeedQFunctionFieldGetEvalMode(qfoutputfields[i], &emode); 83 CeedChkBackend(ierr); 84 if (emode == CEED_EVAL_WEIGHT) { // Skip 85 data->fields.out[i] = NULL; 86 } else { 87 // Get output vector 88 ierr = CeedOperatorFieldGetVector(opoutputfields[i], &vec); 89 CeedChkBackend(ierr); 90 if (vec == CEED_VECTOR_ACTIVE) vec = outvec; 91 outvecs[i] = vec; 92 // Check for multiple output modes 93 CeedInt index = -1; 94 for (CeedInt j = 0; j < i; j++) { 95 if (vec == outvecs[j]) { 96 index = j; 97 break; 98 } 99 } 100 if (index == -1) { 101 ierr = CeedVectorGetArray(vec, CEED_MEM_DEVICE, &data->fields.out[i]); 102 CeedChkBackend(ierr); 103 } else { 104 data->fields.out[i] = data->fields.out[index]; 105 } 106 } 107 } 108 109 // Get context data 110 CeedQFunctionContext ctx; 111 ierr = CeedQFunctionGetInnerContext(qf, &ctx); CeedChkBackend(ierr); 112 if (ctx) { 113 ierr = CeedQFunctionContextGetData(ctx, CEED_MEM_DEVICE, &qf_data->d_c); 114 CeedChkBackend(ierr); 115 } 116 117 // Apply operator 118 void *opargs[] = {(void *) &nelem, &qf_data->d_c, &data->indices, 119 &data->fields, &data->B, &data->G, &data->W 120 }; 121 const CeedInt dim = data->dim; 122 const CeedInt Q1d = data->Q1d; 123 const CeedInt P1d = data->maxP1d; 124 const CeedInt thread1d = CeedIntMax(Q1d, P1d); 125 if (dim==1) { 126 CeedInt elemsPerBlock = 64*thread1d > 256? 256/thread1d : 64; 127 elemsPerBlock = elemsPerBlock>0?elemsPerBlock:1; 128 CeedInt grid = nelem/elemsPerBlock + ( (nelem/elemsPerBlock*elemsPerBlock<nelem) 129 ? 1 : 0 ); 130 CeedInt sharedMem = elemsPerBlock*thread1d*sizeof(CeedScalar); 131 ierr = CeedRunKernelDimSharedHip(ceed, data->op, grid, thread1d, 1, 132 elemsPerBlock, sharedMem, opargs); 133 } else if (dim==2) { 134 const CeedInt elemsPerBlock = thread1d<4? 16 : 2; 135 CeedInt grid = nelem/elemsPerBlock + ( (nelem/elemsPerBlock*elemsPerBlock<nelem) 136 ? 1 : 0 ); 137 CeedInt sharedMem = elemsPerBlock*thread1d*thread1d*sizeof(CeedScalar); 138 ierr = CeedRunKernelDimSharedHip(ceed, data->op, grid, thread1d, thread1d, 139 elemsPerBlock, sharedMem, opargs); 140 } else if (dim==3) { 141 const CeedInt elemsPerBlock = thread1d<6? 4 : (thread1d<8? 2 : 1); 142 CeedInt grid = nelem/elemsPerBlock + ( (nelem/elemsPerBlock*elemsPerBlock<nelem) 143 ? 1 : 0 ); 144 CeedInt sharedMem = elemsPerBlock*thread1d*thread1d*sizeof(CeedScalar); 145 ierr = CeedRunKernelDimSharedHip(ceed, data->op, grid, thread1d, thread1d, 146 elemsPerBlock, sharedMem, opargs); 147 } 148 CeedChkBackend(ierr); 149 150 // Restore input arrays 151 for (CeedInt i = 0; i < numinputfields; i++) { 152 ierr = CeedQFunctionFieldGetEvalMode(qfinputfields[i], &emode); 153 CeedChkBackend(ierr); 154 if (emode == CEED_EVAL_WEIGHT) { // Skip 155 } else { 156 ierr = CeedOperatorFieldGetVector(opinputfields[i], &vec); CeedChkBackend(ierr); 157 if (vec == CEED_VECTOR_ACTIVE) vec = invec; 158 ierr = CeedVectorRestoreArrayRead(vec, &data->fields.in[i]); 159 CeedChkBackend(ierr); 160 } 161 } 162 163 // Restore output arrays 164 for (CeedInt i = 0; i < numoutputfields; i++) { 165 ierr = CeedQFunctionFieldGetEvalMode(qfoutputfields[i], &emode); 166 CeedChkBackend(ierr); 167 if (emode == CEED_EVAL_WEIGHT) { // Skip 168 } else { 169 ierr = CeedOperatorFieldGetVector(opoutputfields[i], &vec); 170 CeedChkBackend(ierr); 171 if (vec == CEED_VECTOR_ACTIVE) vec = outvec; 172 // Check for multiple output modes 173 CeedInt index = -1; 174 for (CeedInt j = 0; j < i; j++) { 175 if (vec == outvecs[j]) { 176 index = j; 177 break; 178 } 179 } 180 if (index == -1) { 181 ierr = CeedVectorRestoreArray(vec, &data->fields.out[i]); 182 CeedChkBackend(ierr); 183 } 184 } 185 } 186 187 // Restore context data 188 if (ctx) { 189 ierr = CeedQFunctionContextRestoreData(ctx, &qf_data->d_c); 190 CeedChkBackend(ierr); 191 } 192 return CEED_ERROR_SUCCESS; 193 } 194 195 //------------------------------------------------------------------------------ 196 // Create operator 197 //------------------------------------------------------------------------------ 198 int CeedOperatorCreate_Hip_gen(CeedOperator op) { 199 int ierr; 200 Ceed ceed; 201 ierr = CeedOperatorGetCeed(op, &ceed); CeedChkBackend(ierr); 202 CeedOperator_Hip_gen *impl; 203 204 ierr = CeedCalloc(1, &impl); CeedChkBackend(ierr); 205 ierr = CeedOperatorSetData(op, impl); CeedChkBackend(ierr); 206 207 ierr = CeedSetBackendFunction(ceed, "Operator", op, "ApplyAdd", 208 CeedOperatorApplyAdd_Hip_gen); CeedChkBackend(ierr); 209 ierr = CeedSetBackendFunction(ceed, "Operator", op, "Destroy", 210 CeedOperatorDestroy_Hip_gen); CeedChkBackend(ierr); 211 return CEED_ERROR_SUCCESS; 212 } 213 //------------------------------------------------------------------------------ 214