121617c04Sjeremylt // Copyright (c) 2017-2018, Lawrence Livermore National Security, LLC. 221617c04Sjeremylt // Produced at the Lawrence Livermore National Laboratory. LLNL-CODE-734707. 321617c04Sjeremylt // All Rights reserved. See files LICENSE and NOTICE for details. 421617c04Sjeremylt // 521617c04Sjeremylt // This file is part of CEED, a collection of benchmarks, miniapps, software 621617c04Sjeremylt // libraries and APIs for efficient high-order finite element and spectral 721617c04Sjeremylt // element discretizations for exascale applications. For more information and 821617c04Sjeremylt // source code availability see http://github.com/ceed. 921617c04Sjeremylt // 1021617c04Sjeremylt // The CEED research is supported by the Exascale Computing Project 17-SC-20-SC, 1121617c04Sjeremylt // a collaborative effort of two U.S. Department of Energy organizations (Office 1221617c04Sjeremylt // of Science and the National Nuclear Security Administration) responsible for 1321617c04Sjeremylt // the planning and preparation of a capable exascale ecosystem, including 1421617c04Sjeremylt // software, applications, hardware, advanced system engineering and early 1521617c04Sjeremylt // testbed platforms, in support of the nation's exascale computing imperative. 1621617c04Sjeremylt 1721617c04Sjeremylt #include "ceed-ref.h" 1821617c04Sjeremylt 19be9261b7Sjeremylt static inline int CeedElemRestrictionApply_Ref_Core(CeedElemRestriction r, 20be9261b7Sjeremylt CeedInt start, CeedInt stop, CeedTransposeMode tmode, 21be9261b7Sjeremylt CeedTransposeMode lmode, CeedVector u, CeedVector v, CeedRequest *request) { 2221617c04Sjeremylt int ierr; 234ce2993fSjeremylt CeedElemRestriction_Ref *impl; 244ce2993fSjeremylt ierr = CeedElemRestrictionGetData(r, (void *)&impl); CeedChk(ierr);; 2521617c04Sjeremylt const CeedScalar *uu; 2621617c04Sjeremylt CeedScalar *vv; 278795c945Sjeremylt CeedInt blksize, nelem, elemsize, nnodes, ncomp, voffset; 284ce2993fSjeremylt ierr = CeedElemRestrictionGetBlockSize(r, &blksize); CeedChk(ierr); 294ce2993fSjeremylt ierr = CeedElemRestrictionGetNumElements(r, &nelem); CeedChk(ierr); 304ce2993fSjeremylt ierr = CeedElemRestrictionGetElementSize(r, &elemsize); CeedChk(ierr); 318795c945Sjeremylt ierr = CeedElemRestrictionGetNumNodes(r, &nnodes); CeedChk(ierr); 324ce2993fSjeremylt ierr = CeedElemRestrictionGetNumComponents(r, &ncomp); CeedChk(ierr); 33be9261b7Sjeremylt voffset = start*blksize*elemsize*ncomp; 3421617c04Sjeremylt 3521617c04Sjeremylt ierr = CeedVectorGetArrayRead(u, CEED_MEM_HOST, &uu); CeedChk(ierr); 3621617c04Sjeremylt ierr = CeedVectorGetArray(v, CEED_MEM_HOST, &vv); CeedChk(ierr); 378d94b059Sjeremylt // Restriction from lvector to evector 3821617c04Sjeremylt // Perform: v = r * u 398d94b059Sjeremylt if (tmode == CEED_NOTRANSPOSE) { 408c91a0c9SJeremy L Thompson // No indices provided, Identity Restriction 41e17b31afSThilina Rathnayake if (!impl->indices) { 42be9261b7Sjeremylt for (CeedInt e = start*blksize; e < stop*blksize; e+=blksize) 43170d5e71Sjeremylt for (CeedInt j = 0; j < blksize; j++) 44170d5e71Sjeremylt for (CeedInt k = 0; k < ncomp*elemsize; k++) 45be9261b7Sjeremylt vv[e*elemsize*ncomp + k*blksize + j - voffset] 464ce2993fSjeremylt = uu[CeedIntMin(e+j,nelem-1)*ncomp*elemsize + k]; 4721617c04Sjeremylt } else { 488c91a0c9SJeremy L Thompson // Indices provided, standard or blocked restriction 49ecf6354eSJed Brown // vv has shape [elemsize, ncomp, nelem], row-major 508795c945Sjeremylt // uu has shape [nnodes, ncomp] 51be9261b7Sjeremylt for (CeedInt e = start*blksize; e < stop*blksize; e+=blksize) 5221617c04Sjeremylt for (CeedInt d = 0; d < ncomp; d++) 5306cdd269SJed Brown for (CeedInt i = 0; i < elemsize*blksize; i++) 54be9261b7Sjeremylt vv[i+elemsize*(d*blksize+ncomp*e) - voffset] 5506cdd269SJed Brown = uu[lmode == CEED_NOTRANSPOSE 568795c945Sjeremylt ? impl->indices[i+elemsize*e]+nnodes*d 5706cdd269SJed Brown : d+ncomp*impl->indices[i+elemsize*e]]; 5821617c04Sjeremylt } 5921617c04Sjeremylt } else { 608d94b059Sjeremylt // Restriction from evector to lvector 618d94b059Sjeremylt // Performing v += r^T * u 628c91a0c9SJeremy L Thompson // No indices provided, Identity Restriction 63e17b31afSThilina Rathnayake if (!impl->indices) { 64be9261b7Sjeremylt for (CeedInt e = start*blksize; e < stop*blksize; e+=blksize) 654ce2993fSjeremylt for (CeedInt j = 0; j < CeedIntMin(blksize, nelem-e); j++) 66170d5e71Sjeremylt for (CeedInt k = 0; k < ncomp*elemsize; k++) 67be9261b7Sjeremylt vv[(e+j)*ncomp*elemsize + k] 68be9261b7Sjeremylt += uu[e*elemsize*ncomp + k*blksize + j - voffset]; 6921617c04Sjeremylt } else { 708c91a0c9SJeremy L Thompson // Indices provided, standard or blocked restriction 71ecf6354eSJed Brown // uu has shape [elemsize, ncomp, nelem] 728795c945Sjeremylt // vv has shape [nnodes, ncomp] 73be9261b7Sjeremylt for (CeedInt e = start*blksize; e < stop*blksize; e+=blksize) { 74170d5e71Sjeremylt for (CeedInt d = 0; d < ncomp; d++) 7506cdd269SJed Brown for (CeedInt i = 0; i < elemsize*blksize; i+=blksize) 768d94b059Sjeremylt // Iteration bound set to discard padding elements 774ce2993fSjeremylt for (CeedInt j = i; j < i+CeedIntMin(blksize, nelem-e); j++) 7806cdd269SJed Brown vv[lmode == CEED_NOTRANSPOSE 798795c945Sjeremylt ? impl->indices[j+e*elemsize]+nnodes*d 8006cdd269SJed Brown : d+ncomp*impl->indices[j+e*elemsize]] 81be9261b7Sjeremylt += uu[j+elemsize*(d*blksize+ncomp*e) - voffset]; 8221617c04Sjeremylt } 8321617c04Sjeremylt } 8421617c04Sjeremylt } 8521617c04Sjeremylt ierr = CeedVectorRestoreArrayRead(u, &uu); CeedChk(ierr); 8621617c04Sjeremylt ierr = CeedVectorRestoreArray(v, &vv); CeedChk(ierr); 8721617c04Sjeremylt if (request != CEED_REQUEST_IMMEDIATE && request != CEED_REQUEST_ORDERED) 8821617c04Sjeremylt *request = NULL; 8921617c04Sjeremylt return 0; 9021617c04Sjeremylt } 9121617c04Sjeremylt 92be9261b7Sjeremylt static int CeedElemRestrictionApply_Ref(CeedElemRestriction r, 93f90c8643Sjeremylt CeedTransposeMode tmode, 94f90c8643Sjeremylt CeedTransposeMode lmode, CeedVector u, 95be9261b7Sjeremylt CeedVector v, CeedRequest *request) { 96be9261b7Sjeremylt int ierr; 97be9261b7Sjeremylt CeedInt nblk; 98be9261b7Sjeremylt ierr = CeedElemRestrictionGetNumBlocks(r, &nblk); CeedChk(ierr); 99be9261b7Sjeremylt return CeedElemRestrictionApply_Ref_Core(r, 0, nblk, tmode, lmode, u, v, 100be9261b7Sjeremylt request); 101be9261b7Sjeremylt } 102be9261b7Sjeremylt 103be9261b7Sjeremylt static int CeedElemRestrictionApplyBlock_Ref(CeedElemRestriction r, 104be9261b7Sjeremylt CeedInt block, CeedTransposeMode tmode, CeedTransposeMode lmode, 105be9261b7Sjeremylt CeedVector u, CeedVector v, CeedRequest *request) { 106be9261b7Sjeremylt return CeedElemRestrictionApply_Ref_Core(r, block, block+1, tmode, lmode, u, 107be9261b7Sjeremylt v, request); 108be9261b7Sjeremylt } 109be9261b7Sjeremylt 11021617c04Sjeremylt static int CeedElemRestrictionDestroy_Ref(CeedElemRestriction r) { 11121617c04Sjeremylt int ierr; 112fe2413ffSjeremylt CeedElemRestriction_Ref *impl; 113fe2413ffSjeremylt ierr = CeedElemRestrictionGetData(r, (void *)&impl); CeedChk(ierr); 11421617c04Sjeremylt 11521617c04Sjeremylt ierr = CeedFree(&impl->indices_allocated); CeedChk(ierr); 116fe2413ffSjeremylt ierr = CeedFree(&impl); CeedChk(ierr); 11721617c04Sjeremylt return 0; 11821617c04Sjeremylt } 11921617c04Sjeremylt 120667bc5fcSjeremylt int CeedElemRestrictionCreate_Ref(CeedMemType mtype, CeedCopyMode cmode, 121667bc5fcSjeremylt const CeedInt *indices, CeedElemRestriction r) { 12221617c04Sjeremylt int ierr; 12321617c04Sjeremylt CeedElemRestriction_Ref *impl; 1244ce2993fSjeremylt CeedInt elemsize, nelem; 1254ce2993fSjeremylt ierr = CeedElemRestrictionGetNumElements(r, &nelem); CeedChk(ierr); 1264ce2993fSjeremylt ierr = CeedElemRestrictionGetElementSize(r, &elemsize); CeedChk(ierr); 1274ce2993fSjeremylt Ceed ceed; 1284ce2993fSjeremylt ierr = CeedElemRestrictionGetCeed(r, &ceed); CeedChk(ierr); 12921617c04Sjeremylt 13021617c04Sjeremylt if (mtype != CEED_MEM_HOST) 131*c042f62fSJeremy L Thompson // LCOV_EXCL_START 1324ce2993fSjeremylt return CeedError(ceed, 1, "Only MemType = HOST supported"); 133*c042f62fSJeremy L Thompson // LCOV_EXCL_STOP 13421617c04Sjeremylt ierr = CeedCalloc(1,&impl); CeedChk(ierr); 13521617c04Sjeremylt switch (cmode) { 13621617c04Sjeremylt case CEED_COPY_VALUES: 1374ce2993fSjeremylt ierr = CeedMalloc(nelem*elemsize, &impl->indices_allocated); 13821617c04Sjeremylt CeedChk(ierr); 13921617c04Sjeremylt memcpy(impl->indices_allocated, indices, 1404ce2993fSjeremylt nelem * elemsize * sizeof(indices[0])); 14121617c04Sjeremylt impl->indices = impl->indices_allocated; 14221617c04Sjeremylt break; 14321617c04Sjeremylt case CEED_OWN_POINTER: 14421617c04Sjeremylt impl->indices_allocated = (CeedInt *)indices; 14521617c04Sjeremylt impl->indices = impl->indices_allocated; 14621617c04Sjeremylt break; 14721617c04Sjeremylt case CEED_USE_POINTER: 14821617c04Sjeremylt impl->indices = indices; 14921617c04Sjeremylt } 150fe2413ffSjeremylt 151fe2413ffSjeremylt ierr = CeedElemRestrictionSetData(r, (void *)&impl); CeedChk(ierr); 152fe2413ffSjeremylt ierr = CeedSetBackendFunction(ceed, "ElemRestriction", r, "Apply", 153fe2413ffSjeremylt CeedElemRestrictionApply_Ref); CeedChk(ierr); 154be9261b7Sjeremylt ierr = CeedSetBackendFunction(ceed, "ElemRestriction", r, "ApplyBlock", 155be9261b7Sjeremylt CeedElemRestrictionApplyBlock_Ref); 156be9261b7Sjeremylt CeedChk(ierr); 157fe2413ffSjeremylt ierr = CeedSetBackendFunction(ceed, "ElemRestriction", r, "Destroy", 158fe2413ffSjeremylt CeedElemRestrictionDestroy_Ref); CeedChk(ierr); 15921617c04Sjeremylt return 0; 16021617c04Sjeremylt } 161