1 // Copyright (c) 2017, Lawrence Livermore National Security, LLC. Produced at 2 // the Lawrence Livermore National Laboratory. LLNL-CODE-734707. All Rights 3 // 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-impl.h> 18 #include <string.h> 19 20 typedef struct { 21 CeedScalar *array; 22 CeedScalar *array_allocated; 23 } CeedVector_Ref; 24 25 typedef struct { 26 const CeedInt *indices; 27 CeedInt *indices_allocated; 28 } CeedElemRestriction_Ref; 29 30 typedef struct { 31 CeedVector etmp; 32 CeedVector qdata; 33 } CeedOperator_Ref; 34 35 static int CeedVectorSetArray_Ref(CeedVector vec, CeedMemType mtype, 36 CeedCopyMode cmode, CeedScalar *array) { 37 CeedVector_Ref *impl = vec->data; 38 int ierr; 39 40 if (mtype != CEED_MEM_HOST) 41 return CeedError(vec->ceed, 1, "Only MemType = HOST supported"); 42 ierr = CeedFree(&impl->array_allocated); CeedChk(ierr); 43 switch (cmode) { 44 case CEED_COPY_VALUES: 45 ierr = CeedMalloc(vec->length, &impl->array_allocated); CeedChk(ierr); 46 impl->array = impl->array_allocated; 47 if (array) memcpy(impl->array, array, vec->length * sizeof(array[0])); 48 break; 49 case CEED_OWN_POINTER: 50 impl->array_allocated = array; 51 impl->array = array; 52 break; 53 case CEED_USE_POINTER: 54 impl->array = array; 55 } 56 return 0; 57 } 58 59 static int CeedVectorGetArray_Ref(CeedVector vec, CeedMemType mtype, 60 CeedScalar **array) { 61 CeedVector_Ref *impl = vec->data; 62 int ierr; 63 64 if (mtype != CEED_MEM_HOST) 65 return CeedError(vec->ceed, 1, "Can only provide to HOST memory"); 66 if (!impl->array) { // Allocate if array is not yet allocated 67 ierr = CeedVectorSetArray(vec, CEED_MEM_HOST, CEED_COPY_VALUES, NULL); 68 CeedChk(ierr); 69 } 70 *array = impl->array; 71 return 0; 72 } 73 74 static int CeedVectorGetArrayRead_Ref(CeedVector vec, CeedMemType mtype, 75 const CeedScalar **array) { 76 CeedVector_Ref *impl = vec->data; 77 int ierr; 78 79 if (mtype != CEED_MEM_HOST) 80 return CeedError(vec->ceed, 1, "Can only provide to HOST memory"); 81 if (!impl->array) { // Allocate if array is not yet allocated 82 ierr = CeedVectorSetArray(vec, CEED_MEM_HOST, CEED_COPY_VALUES, NULL); 83 CeedChk(ierr); 84 } 85 *array = impl->array; 86 return 0; 87 } 88 89 static int CeedVectorRestoreArray_Ref(CeedVector vec, CeedScalar **array) { 90 *array = NULL; 91 return 0; 92 } 93 94 static int CeedVectorRestoreArrayRead_Ref(CeedVector vec, 95 const CeedScalar **array) { 96 *array = NULL; 97 return 0; 98 } 99 100 static int CeedVectorDestroy_Ref(CeedVector vec) { 101 CeedVector_Ref *impl = vec->data; 102 int ierr; 103 104 ierr = CeedFree(&impl->array_allocated); CeedChk(ierr); 105 ierr = CeedFree(&vec->data); CeedChk(ierr); 106 return 0; 107 } 108 109 static int CeedVectorCreate_Ref(Ceed ceed, CeedInt n, CeedVector vec) { 110 CeedVector_Ref *impl; 111 int ierr; 112 113 vec->SetArray = CeedVectorSetArray_Ref; 114 vec->GetArray = CeedVectorGetArray_Ref; 115 vec->GetArrayRead = CeedVectorGetArrayRead_Ref; 116 vec->RestoreArray = CeedVectorRestoreArray_Ref; 117 vec->RestoreArrayRead = CeedVectorRestoreArrayRead_Ref; 118 vec->Destroy = CeedVectorDestroy_Ref; 119 ierr = CeedCalloc(1,&impl); CeedChk(ierr); 120 vec->data = impl; 121 return 0; 122 } 123 124 static int CeedElemRestrictionApply_Ref(CeedElemRestriction r, 125 CeedTransposeMode tmode, CeedInt ncomp, 126 CeedTransposeMode lmode, CeedVector u, 127 CeedVector v, CeedRequest *request) { 128 CeedElemRestriction_Ref *impl = r->data; 129 int ierr; 130 const CeedScalar *uu; 131 CeedScalar *vv; 132 CeedInt esize = r->nelem*r->elemsize; 133 134 ierr = CeedVectorGetArrayRead(u, CEED_MEM_HOST, &uu); CeedChk(ierr); 135 ierr = CeedVectorGetArray(v, CEED_MEM_HOST, &vv); CeedChk(ierr); 136 if (tmode == CEED_NOTRANSPOSE) { 137 // Perform: v = r * u 138 if (ncomp == 1) { 139 for (CeedInt i=0; i<esize; i++) vv[i] = uu[impl->indices[i]]; 140 } else { 141 // vv is (elemsize x ncomp x nelem), column-major 142 if (lmode == CEED_NOTRANSPOSE) { // u is (ndof x ncomp), column-major 143 for (CeedInt e = 0; e < r->nelem; e++) 144 for (CeedInt d = 0; d < ncomp; d++) 145 for (CeedInt i=0; i<r->elemsize; i++) { 146 vv[i+r->elemsize*(d+ncomp*e)] = 147 uu[impl->indices[i+r->elemsize*e]+r->ndof*d]; 148 } 149 } else { // u is (ncomp x ndof), column-major 150 for (CeedInt e = 0; e < r->nelem; e++) 151 for (CeedInt d = 0; d < ncomp; d++) 152 for (CeedInt i=0; i<r->elemsize; i++) { 153 vv[i+r->elemsize*(d+ncomp*e)] = 154 uu[d+ncomp*impl->indices[i+r->elemsize*e]]; 155 } 156 } 157 } 158 } else { 159 // Note: in transpose mode, we perform: v += r^t * u 160 if (ncomp == 1) { 161 for (CeedInt i=0; i<esize; i++) vv[impl->indices[i]] += uu[i]; 162 } else { 163 // u is (elemsize x ncomp x nelem) 164 if (lmode == CEED_NOTRANSPOSE) { // vv is (ndof x ncomp), column-major 165 for (CeedInt e = 0; e < r->nelem; e++) 166 for (CeedInt d = 0; d < ncomp; d++) 167 for (CeedInt i=0; i<r->elemsize; i++) { 168 vv[impl->indices[i+r->elemsize*e]+r->ndof*d] += 169 uu[i+r->elemsize*(d+e*ncomp)]; 170 } 171 } else { // vv is (ncomp x ndof), column-major 172 for (CeedInt e = 0; e < r->nelem; e++) 173 for (CeedInt d = 0; d < ncomp; d++) 174 for (CeedInt i=0; i<r->elemsize; i++) { 175 vv[d+ncomp*impl->indices[i+r->elemsize*e]] += 176 uu[i+r->elemsize*(d+e*ncomp)]; 177 } 178 } 179 } 180 } 181 ierr = CeedVectorRestoreArrayRead(u, &uu); CeedChk(ierr); 182 ierr = CeedVectorRestoreArray(v, &vv); CeedChk(ierr); 183 if (request != CEED_REQUEST_IMMEDIATE) *request = NULL; 184 return 0; 185 } 186 187 static int CeedElemRestrictionDestroy_Ref(CeedElemRestriction r) { 188 CeedElemRestriction_Ref *impl = r->data; 189 int ierr; 190 191 ierr = CeedFree(&impl->indices_allocated); CeedChk(ierr); 192 ierr = CeedFree(&r->data); CeedChk(ierr); 193 return 0; 194 } 195 196 static int CeedElemRestrictionCreate_Ref(CeedElemRestriction r, 197 CeedMemType mtype, 198 CeedCopyMode cmode, const CeedInt *indices) { 199 int ierr; 200 CeedElemRestriction_Ref *impl; 201 202 if (mtype != CEED_MEM_HOST) 203 return CeedError(r->ceed, 1, "Only MemType = HOST supported"); 204 ierr = CeedCalloc(1,&impl); CeedChk(ierr); 205 switch (cmode) { 206 case CEED_COPY_VALUES: 207 ierr = CeedMalloc(r->nelem*r->elemsize, &impl->indices_allocated); 208 CeedChk(ierr); 209 memcpy(impl->indices_allocated, indices, 210 r->nelem * r->elemsize * sizeof(indices[0])); 211 impl->indices = impl->indices_allocated; 212 break; 213 case CEED_OWN_POINTER: 214 impl->indices_allocated = (CeedInt *)indices; 215 impl->indices = impl->indices_allocated; 216 break; 217 case CEED_USE_POINTER: 218 impl->indices = indices; 219 } 220 r->data = impl; 221 r->Apply = CeedElemRestrictionApply_Ref; 222 r->Destroy = CeedElemRestrictionDestroy_Ref; 223 return 0; 224 } 225 226 // Contracts on the middle index 227 // NOTRANSPOSE: V_ajc = T_jb U_abc 228 // TRANSPOSE: V_ajc = T_bj U_abc 229 static int CeedTensorContract_Ref(Ceed ceed, 230 CeedInt A, CeedInt B, CeedInt C, CeedInt J, 231 const CeedScalar *t, CeedTransposeMode tmode, 232 const CeedScalar *u, CeedScalar *v) { 233 CeedInt tstride0 = B, tstride1 = 1; 234 if (tmode == CEED_TRANSPOSE) { 235 tstride0 = 1; tstride1 = J; 236 } 237 238 for (CeedInt a=0; a<A; a++) { 239 for (CeedInt j=0; j<J; j++) { 240 for (CeedInt c=0; c<C; c++) 241 v[(a*J+j)*C+c] = 0; 242 for (CeedInt b=0; b<B; b++) { 243 for (CeedInt c=0; c<C; c++) { 244 v[(a*J+j)*C+c] += t[j*tstride0 + b*tstride1] * u[(a*B+b)*C+c]; 245 } 246 } 247 } 248 } 249 return 0; 250 } 251 252 static int CeedBasisApply_Ref(CeedBasis basis, CeedTransposeMode tmode, 253 CeedEvalMode emode, 254 const CeedScalar *u, CeedScalar *v) { 255 int ierr; 256 const CeedInt dim = basis->dim; 257 const CeedInt ndof = basis->ndof; 258 259 if (emode & CEED_EVAL_INTERP) { 260 CeedInt P = basis->P1d, Q = basis->Q1d; 261 if (tmode == CEED_TRANSPOSE) { 262 P = basis->Q1d; Q = basis->P1d; 263 } 264 CeedInt pre = ndof*CeedPowInt(P, dim-1), post = 1; 265 CeedScalar tmp[2][Q*CeedPowInt(P>Q?P:Q, dim-1)]; 266 for (CeedInt d=0; d<dim; d++) { 267 ierr = CeedTensorContract_Ref(basis->ceed, pre, P, post, Q, basis->interp1d, 268 tmode, d==0?u:tmp[d%2], d==dim-1?v:tmp[(d+1)%2]); 269 CeedChk(ierr); 270 pre /= P; 271 post *= Q; 272 } 273 if (tmode == CEED_NOTRANSPOSE) { 274 v += ndof*CeedPowInt(Q, dim); 275 } else { 276 u += ndof*CeedPowInt(Q, dim); 277 } 278 } 279 if (emode & CEED_EVAL_GRAD) { 280 CeedInt P = basis->P1d, Q = basis->Q1d; 281 if (tmode == CEED_NOTRANSPOSE) { 282 // u is (P^dim x nc), column-major layout (nc = ndof) 283 // v is (Q^dim x nc x dim), column-major layout (nc = ndof) 284 CeedScalar tmp[2][Q*CeedPowInt(P>Q?P:Q, dim-1)]; 285 for (CeedInt p = 0; p < dim; p++) { 286 CeedInt pre = ndof*CeedPowInt(P, dim-1), post = 1; 287 for (CeedInt d=0; d<dim; d++) { 288 ierr = CeedTensorContract_Ref(basis->ceed, pre, P, post, Q, 289 (p==d)?basis->grad1d:basis->interp1d, 290 tmode, d==0?u:tmp[d%2], 291 d==dim-1?v:tmp[(d+1)%2]); CeedChk(ierr); 292 pre /= P; 293 post *= Q; 294 } 295 v += ndof*CeedPowInt(Q, dim); 296 } 297 } else { 298 // TODO: CEED_EVAL_GRAD + CEED_TRANSPOSE 299 CeedError(basis->ceed, 1, "TODO: CEED_EVAL_GRAD + CEED_TRANSPOSE"); 300 u += ndof*dim*CeedPowInt(Q, dim); 301 } 302 } 303 if (emode & CEED_EVAL_WEIGHT) { 304 if (tmode == CEED_TRANSPOSE) 305 return CeedError(basis->ceed, 1, 306 "CEED_EVAL_WEIGHT incompatible with CEED_TRANSPOSE"); 307 CeedInt Q = basis->Q1d; 308 for (CeedInt d=0; d<dim; d++) { 309 CeedInt pre = CeedPowInt(Q, dim-d-1), post = CeedPowInt(Q, d); 310 for (CeedInt i=0; i<pre; i++) { 311 for (CeedInt j=0; j<Q; j++) { 312 for (CeedInt k=0; k<post; k++) { 313 v[(i*Q + j)*post + k] = basis->qweight1d[j] 314 * (d == 0 ? 1 : v[(i*Q + j)*post + k]); 315 } 316 } 317 } 318 } 319 } 320 return 0; 321 } 322 323 static int CeedBasisDestroy_Ref(CeedBasis basis) { 324 return 0; 325 } 326 327 static int CeedBasisCreateTensorH1_Ref(Ceed ceed, CeedInt dim, CeedInt P1d, 328 CeedInt Q1d, const CeedScalar *interp1d, 329 const CeedScalar *grad1d, 330 const CeedScalar *qref1d, 331 const CeedScalar *qweight1d, 332 CeedBasis basis) { 333 basis->Apply = CeedBasisApply_Ref; 334 basis->Destroy = CeedBasisDestroy_Ref; 335 return 0; 336 } 337 338 static int CeedQFunctionApply_Ref(CeedQFunction qf, void *qdata, CeedInt Q, 339 const CeedScalar *const *u, 340 CeedScalar *const *v) { 341 int ierr; 342 ierr = qf->function(qf->ctx, qdata, Q, u, v); CeedChk(ierr); 343 return 0; 344 } 345 346 static int CeedQFunctionDestroy_Ref(CeedQFunction qf) { 347 return 0; 348 } 349 350 static int CeedQFunctionCreate_Ref(CeedQFunction qf) { 351 qf->Apply = CeedQFunctionApply_Ref; 352 qf->Destroy = CeedQFunctionDestroy_Ref; 353 return 0; 354 } 355 356 static int CeedOperatorDestroy_Ref(CeedOperator op) { 357 CeedOperator_Ref *impl = op->data; 358 int ierr; 359 360 ierr = CeedVectorDestroy(&impl->etmp); CeedChk(ierr); 361 ierr = CeedVectorDestroy(&impl->qdata); CeedChk(ierr); 362 ierr = CeedFree(&op->data); CeedChk(ierr); 363 return 0; 364 } 365 366 static int CeedOperatorApply_Ref(CeedOperator op, CeedVector qdata, 367 CeedVector ustate, 368 CeedVector residual, CeedRequest *request) { 369 CeedOperator_Ref *impl = op->data; 370 CeedVector etmp; 371 CeedInt Q; 372 const CeedInt nc = op->basis->ndof, dim = op->basis->dim; 373 CeedScalar *Eu; 374 char *qd; 375 int ierr; 376 CeedTransposeMode lmode = CEED_NOTRANSPOSE; 377 378 if (!impl->etmp) { 379 ierr = CeedVectorCreate(op->ceed, 380 nc * op->Erestrict->nelem * op->Erestrict->elemsize, 381 &impl->etmp); CeedChk(ierr); 382 // etmp is allocated when CeedVectorGetArray is called below 383 } 384 etmp = impl->etmp; 385 if (op->qf->inmode & ~CEED_EVAL_WEIGHT) { 386 ierr = CeedElemRestrictionApply(op->Erestrict, CEED_NOTRANSPOSE, 387 nc, lmode, ustate, etmp, 388 CEED_REQUEST_IMMEDIATE); CeedChk(ierr); 389 } 390 ierr = CeedBasisGetNumQuadraturePoints(op->basis, &Q); CeedChk(ierr); 391 ierr = CeedVectorGetArray(etmp, CEED_MEM_HOST, &Eu); CeedChk(ierr); 392 ierr = CeedVectorGetArray(qdata, CEED_MEM_HOST, (CeedScalar**)&qd); 393 CeedChk(ierr); 394 for (CeedInt e=0; e<op->Erestrict->nelem; e++) { 395 CeedScalar BEu[Q*nc*(dim+2)], BEv[Q*nc*(dim+2)], *out[5] = {0,0,0,0,0}; 396 const CeedScalar *in[5] = {0,0,0,0,0}; 397 // TODO: quadrature weights can be computed just once 398 ierr = CeedBasisApply(op->basis, CEED_NOTRANSPOSE, op->qf->inmode, 399 &Eu[e*op->Erestrict->elemsize*nc], BEu); 400 CeedChk(ierr); 401 CeedScalar *u_ptr = BEu, *v_ptr = BEv; 402 if (op->qf->inmode & CEED_EVAL_INTERP) { in[0] = u_ptr; u_ptr += Q*nc; } 403 if (op->qf->inmode & CEED_EVAL_GRAD) { in[1] = u_ptr; u_ptr += Q*nc*dim; } 404 if (op->qf->inmode & CEED_EVAL_WEIGHT) { in[4] = u_ptr; u_ptr += Q; } 405 if (op->qf->outmode & CEED_EVAL_INTERP) { out[0] = v_ptr; v_ptr += Q*nc; } 406 if (op->qf->outmode & CEED_EVAL_GRAD) { out[1] = v_ptr; v_ptr += Q*nc*dim; } 407 ierr = CeedQFunctionApply(op->qf, &qd[e*Q*op->qf->qdatasize], Q, in, out); 408 CeedChk(ierr); 409 ierr = CeedBasisApply(op->basis, CEED_TRANSPOSE, op->qf->outmode, BEv, 410 &Eu[e*op->Erestrict->elemsize*nc]); 411 CeedChk(ierr); 412 } 413 ierr = CeedVectorRestoreArray(etmp, &Eu); CeedChk(ierr); 414 if (residual) { 415 CeedScalar *res; 416 CeedVectorGetArray(residual, CEED_MEM_HOST, &res); 417 for (int i = 0; i < residual->length; i++) 418 res[i] = (CeedScalar)0; 419 ierr = CeedElemRestrictionApply(op->Erestrict, CEED_TRANSPOSE, 420 nc, lmode, etmp, residual, 421 CEED_REQUEST_IMMEDIATE); CeedChk(ierr); 422 } 423 if (request != CEED_REQUEST_IMMEDIATE) *request = NULL; 424 return 0; 425 } 426 427 static int CeedOperatorGetQData_Ref(CeedOperator op, CeedVector *qdata) { 428 CeedOperator_Ref *impl = op->data; 429 int ierr; 430 431 if (!impl->qdata) { 432 CeedInt Q; 433 ierr = CeedBasisGetNumQuadraturePoints(op->basis, &Q); CeedChk(ierr); 434 ierr = CeedVectorCreate(op->ceed, 435 op->Erestrict->nelem * Q 436 * op->qf->qdatasize / sizeof(CeedScalar), 437 &impl->qdata); CeedChk(ierr); 438 } 439 *qdata = impl->qdata; 440 return 0; 441 } 442 443 static int CeedOperatorCreate_Ref(CeedOperator op) { 444 CeedOperator_Ref *impl; 445 int ierr; 446 447 ierr = CeedCalloc(1, &impl); CeedChk(ierr); 448 op->data = impl; 449 op->Destroy = CeedOperatorDestroy_Ref; 450 op->Apply = CeedOperatorApply_Ref; 451 op->GetQData = CeedOperatorGetQData_Ref; 452 return 0; 453 } 454 455 static int CeedInit_Ref(const char *resource, Ceed ceed) { 456 if (strcmp(resource, "/cpu/self") 457 && strcmp(resource, "/cpu/self/ref")) 458 return CeedError(ceed, 1, "Ref backend cannot use resource: %s", resource); 459 ceed->VecCreate = CeedVectorCreate_Ref; 460 ceed->BasisCreateTensorH1 = CeedBasisCreateTensorH1_Ref; 461 ceed->ElemRestrictionCreate = CeedElemRestrictionCreate_Ref; 462 ceed->QFunctionCreate = CeedQFunctionCreate_Ref; 463 ceed->OperatorCreate = CeedOperatorCreate_Ref; 464 return 0; 465 } 466 467 __attribute__((constructor)) 468 static void Register(void) { 469 CeedRegister("/cpu/self/ref", CeedInit_Ref); 470 } 471