16ea7c6c1SJed Brown // Copyright (c) 2017, Lawrence Livermore National Security, LLC. Produced at 26ea7c6c1SJed Brown // the Lawrence Livermore National Laboratory. LLNL-CODE-734707. All Rights 36ea7c6c1SJed Brown // reserved. See files LICENSE and NOTICE for details. 46ea7c6c1SJed Brown // 56ea7c6c1SJed Brown // This file is part of CEED, a collection of benchmarks, miniapps, software 66ea7c6c1SJed Brown // libraries and APIs for efficient high-order finite element and spectral 76ea7c6c1SJed Brown // element discretizations for exascale applications. For more information and 86ea7c6c1SJed Brown // source code availability see http://github.com/ceed. 96ea7c6c1SJed Brown // 106ea7c6c1SJed Brown // The CEED research is supported by the Exascale Computing Project 17-SC-20-SC, 116ea7c6c1SJed Brown // a collaborative effort of two U.S. Department of Energy organizations (Office 126ea7c6c1SJed Brown // of Science and the National Nuclear Security Administration) responsible for 136ea7c6c1SJed Brown // the planning and preparation of a capable exascale ecosystem, including 146ea7c6c1SJed Brown // software, applications, hardware, advanced system engineering and early 156ea7c6c1SJed Brown // testbed platforms, in support of the nation's exascale computing imperative. 166ea7c6c1SJed Brown 176ea7c6c1SJed Brown #ifndef _ceed_impl_h 186ea7c6c1SJed Brown #define _ceed_impl_h 196ea7c6c1SJed Brown 206ea7c6c1SJed Brown #include <ceed.h> 21ff8ca64bSJed Brown #include <stdbool.h> 226ea7c6c1SJed Brown 236ea7c6c1SJed Brown #define CEED_INTERN CEED_EXTERN __attribute__((visibility ("hidden"))) 246ea7c6c1SJed Brown 256ea7c6c1SJed Brown #define CEED_MAX_RESOURCE_LEN 1024 266ea7c6c1SJed Brown #define CEED_ALIGN 64 276ea7c6c1SJed Brown 286ea7c6c1SJed Brown struct Ceed_private { 296ea7c6c1SJed Brown int (*Error)(Ceed, const char *, int, const char *, int, const char *, va_list); 306ea7c6c1SJed Brown int (*Destroy)(Ceed); 31*667bc5fcSjeremylt int (*VecCreate)(CeedInt, CeedVector); 32*667bc5fcSjeremylt int (*ElemRestrictionCreate)(CeedMemType, CeedCopyMode, 33*667bc5fcSjeremylt const CeedInt *, CeedElemRestriction); 34*667bc5fcSjeremylt int (*ElemRestrictionCreateBlocked)(CeedMemType, CeedCopyMode, 35*667bc5fcSjeremylt const CeedInt *, CeedElemRestriction); 36*667bc5fcSjeremylt int (*BasisCreateTensorH1)(CeedInt, CeedInt, CeedInt, const CeedScalar *, 376ea7c6c1SJed Brown const CeedScalar *, const CeedScalar *, const CeedScalar *, CeedBasis); 38*667bc5fcSjeremylt int (*BasisCreateH1)(CeedElemTopology, CeedInt, CeedInt, CeedInt, 39a8de75f0Sjeremylt const CeedScalar *, 40a8de75f0Sjeremylt const CeedScalar *, const CeedScalar *, const CeedScalar *, CeedBasis); 416ea7c6c1SJed Brown int (*QFunctionCreate)(CeedQFunction); 426ea7c6c1SJed Brown int (*OperatorCreate)(CeedOperator); 4380061934SJed Brown int refcount; 446ea7c6c1SJed Brown void *data; 456ea7c6c1SJed Brown }; 466ea7c6c1SJed Brown 476ea7c6c1SJed Brown /* In the next 3 functions, p has to be the address of a pointer type, i.e. p 486ea7c6c1SJed Brown has to be a pointer to a pointer. */ 49c7c22b02Scamierjs CEED_INTERN int CeedMallocArray(size_t n, size_t unit, void *p); 50c7c22b02Scamierjs CEED_INTERN int CeedCallocArray(size_t n, size_t unit, void *p); 51c7c22b02Scamierjs CEED_INTERN int CeedReallocArray(size_t n, size_t unit, void *p); 52c7c22b02Scamierjs CEED_INTERN int CeedFree(void *p); 536ea7c6c1SJed Brown 546ea7c6c1SJed Brown #define CeedChk(ierr) do { if (ierr) return ierr; } while (0) 556ea7c6c1SJed Brown /* Note that CeedMalloc and CeedCalloc will, generally, return pointers with 566ea7c6c1SJed Brown different memory alignments: CeedMalloc returns pointers aligned at 576ea7c6c1SJed Brown CEED_ALIGN bytes, while CeedCalloc uses the alignment of calloc. */ 58c7c22b02Scamierjs #define CeedMalloc(n, p) CeedMallocArray((n), sizeof(**(p)), p) 59c7c22b02Scamierjs #define CeedCalloc(n, p) CeedCallocArray((n), sizeof(**(p)), p) 60c7c22b02Scamierjs #define CeedRealloc(n, p) CeedReallocArray((n), sizeof(**(p)), p) 616ea7c6c1SJed Brown 626ea7c6c1SJed Brown struct CeedVector_private { 636ea7c6c1SJed Brown Ceed ceed; 646ea7c6c1SJed Brown int (*SetArray)(CeedVector, CeedMemType, CeedCopyMode, CeedScalar *); 652a1ab385Sjeremylt int (*SetValue)(CeedVector, CeedScalar); 666ea7c6c1SJed Brown int (*GetArray)(CeedVector, CeedMemType, CeedScalar **); 676ea7c6c1SJed Brown int (*GetArrayRead)(CeedVector, CeedMemType, const CeedScalar **); 686ea7c6c1SJed Brown int (*RestoreArray)(CeedVector, CeedScalar **); 696ea7c6c1SJed Brown int (*RestoreArrayRead)(CeedVector, const CeedScalar **); 706ea7c6c1SJed Brown int (*Destroy)(CeedVector); 71540765feSJed Brown int refcount; 726ea7c6c1SJed Brown CeedInt length; 7336ac90ebSjeremylt uint64_t state; 746ea7c6c1SJed Brown void *data; 756ea7c6c1SJed Brown }; 766ea7c6c1SJed Brown 776ea7c6c1SJed Brown struct CeedElemRestriction_private { 786ea7c6c1SJed Brown Ceed ceed; 79ff8ca64bSJed Brown int (*Apply)(CeedElemRestriction, CeedTransposeMode, CeedTransposeMode, 806ea7c6c1SJed Brown CeedVector, CeedVector, CeedRequest *); 816ea7c6c1SJed Brown int (*Destroy)(CeedElemRestriction); 82675ef50dSJed Brown int refcount; 836ea7c6c1SJed Brown CeedInt nelem; /* number of elements */ 846ea7c6c1SJed Brown CeedInt elemsize; /* number of dofs per element */ 856ea7c6c1SJed Brown CeedInt ndof; /* size of the L-vector, can be used for checking for 866ea7c6c1SJed Brown correct vector sizes */ 87ff8ca64bSJed Brown CeedInt ncomp; /* number of components */ 884e35ef05Sjeremylt CeedInt blksize; /* number of elements in a batch */ 894e35ef05Sjeremylt CeedInt nblk; /* number of blocks of elements */ 906ea7c6c1SJed Brown void *data; /* place for the backend to store any data */ 916ea7c6c1SJed Brown }; 926ea7c6c1SJed Brown 936ea7c6c1SJed Brown struct CeedBasis_private { 946ea7c6c1SJed Brown Ceed ceed; 954b8bea3bSJed Brown int (*Apply)(CeedBasis, CeedInt, CeedTransposeMode, CeedEvalMode, 964b8bea3bSJed Brown const CeedScalar *, 976ea7c6c1SJed Brown CeedScalar *); 986ea7c6c1SJed Brown int (*Destroy)(CeedBasis); 99c3725256SJed Brown int refcount; 100a8de75f0Sjeremylt bool tensorbasis; /* flag for tensor basis */ 1010f5de9e9Sjeremylt CeedInt dim; /* topological dimension */ 1020f5de9e9Sjeremylt CeedInt ncomp; /* number of field components (1 for scalar fields) */ 1030f5de9e9Sjeremylt CeedInt P1d; /* number of nodes in one dimension */ 1040f5de9e9Sjeremylt CeedInt Q1d; /* number of quadrature points in one dimension */ 105a8de75f0Sjeremylt CeedInt P; /* total number of nodes */ 106a8de75f0Sjeremylt CeedInt Q; /* total number of quadrature points */ 1070f5de9e9Sjeremylt CeedScalar *qref1d; /* Array of length Q1d holding the locations of 1080f5de9e9Sjeremylt quadrature points on the 1D reference element [-1, 1] */ 1090f5de9e9Sjeremylt CeedScalar *qweight1d; /* array of length Q1d holding the quadrature weights on 1100f5de9e9Sjeremylt the reference element */ 1114b8bea3bSJed Brown CeedScalar 1124b8bea3bSJed Brown *interp1d; /* row-major matrix of shape [Q1d, P1d] expressing the values of 1130f5de9e9Sjeremylt nodal basis functions at quadrature points */ 1144b8bea3bSJed Brown CeedScalar 1154b8bea3bSJed Brown *grad1d; /* row-major matrix of shape [Q1d, P1d] matrix expressing derivatives of 1160f5de9e9Sjeremylt nodal basis functions at quadrature points */ 117c01dd730Scamierjs void *data; /* place for the backend to store any data */ 1186ea7c6c1SJed Brown }; 1196ea7c6c1SJed Brown 120ff8ca64bSJed Brown struct CeedQFunctionField { 121ff8ca64bSJed Brown const char *fieldname; 122ff8ca64bSJed Brown CeedInt ncomp; 123ff8ca64bSJed Brown CeedEvalMode emode; 124ff8ca64bSJed Brown }; 125ff8ca64bSJed Brown 1266ea7c6c1SJed Brown struct CeedQFunction_private { 1276ea7c6c1SJed Brown Ceed ceed; 128ff8ca64bSJed Brown int (*Apply)(CeedQFunction, CeedInt, const CeedScalar *const *, 1296ea7c6c1SJed Brown CeedScalar *const *); 1306ea7c6c1SJed Brown int (*Destroy)(CeedQFunction); 1312123d1aaSJed Brown int refcount; 1326ea7c6c1SJed Brown CeedInt vlength; // Number of quadrature points must be padded to a multiple of vlength 133ff8ca64bSJed Brown struct CeedQFunctionField inputfields[16]; 134ff8ca64bSJed Brown struct CeedQFunctionField outputfields[16]; 135ff8ca64bSJed Brown CeedInt numinputfields, numoutputfields; 136ff8ca64bSJed Brown int (*function)(void*, CeedInt, const CeedScalar *const*, CeedScalar *const*); 1376ea7c6c1SJed Brown const char *focca; 1386ea7c6c1SJed Brown void *ctx; /* user context for function */ 1396ea7c6c1SJed Brown size_t ctxsize; /* size of user context; may be used to copy to a device */ 1406ea7c6c1SJed Brown void *data; /* backend data */ 1416ea7c6c1SJed Brown }; 1426ea7c6c1SJed Brown 143ff8ca64bSJed Brown struct CeedOperatorField { 144ff8ca64bSJed Brown CeedElemRestriction Erestrict; /// Restriction from L-vector or NULL if identity 145ff8ca64bSJed Brown CeedBasis basis; /// Basis or NULL for collocated fields 1464b8bea3bSJed Brown CeedVector 1474b8bea3bSJed Brown vec; /// State vector for passive fields, NULL for active fields 148ff8ca64bSJed Brown }; 149ff8ca64bSJed Brown 1506ea7c6c1SJed Brown struct CeedOperator_private { 1516ea7c6c1SJed Brown Ceed ceed; 152c4da7380SJed Brown int refcount; 153ff8ca64bSJed Brown int (*Apply)(CeedOperator, CeedVector, CeedVector, CeedRequest *); 1546ea7c6c1SJed Brown int (*ApplyJacobian)(CeedOperator, CeedVector, CeedVector, CeedVector, 1556ea7c6c1SJed Brown CeedVector, CeedRequest *); 1566ea7c6c1SJed Brown int (*GetQData)(CeedOperator, CeedVector *); 1576ea7c6c1SJed Brown int (*Destroy)(CeedOperator); 158ff8ca64bSJed Brown struct CeedOperatorField inputfields[16]; 159ff8ca64bSJed Brown struct CeedOperatorField outputfields[16]; 160ff8ca64bSJed Brown CeedInt numelements; /// Number of elements 161ff8ca64bSJed Brown CeedInt numqpoints; /// Number of quadrature points over all elements 162ef700c2cSjeremylt CeedInt nfields; /// Number of fields that have been set 1636ea7c6c1SJed Brown CeedQFunction qf; 1646ea7c6c1SJed Brown CeedQFunction dqf; 1656ea7c6c1SJed Brown CeedQFunction dqfT; 166ff8ca64bSJed Brown bool setupdone; 1676ea7c6c1SJed Brown void *data; 1686ea7c6c1SJed Brown }; 1696ea7c6c1SJed Brown 1706ea7c6c1SJed Brown #endif 171