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); 316ea7c6c1SJed Brown int (*VecCreate)(Ceed, CeedInt, CeedVector); 326ea7c6c1SJed Brown int (*ElemRestrictionCreate)(CeedElemRestriction, CeedMemType, CeedCopyMode, 336ea7c6c1SJed Brown const CeedInt *); 34*4b8bea3bSJed Brown int (*ElemRestrictionCreateBlocked)(CeedElemRestriction, CeedMemType, 35*4b8bea3bSJed Brown CeedCopyMode, 364e35ef05Sjeremylt const CeedInt *); 376ea7c6c1SJed Brown int (*BasisCreateTensorH1)(Ceed, CeedInt, CeedInt, CeedInt, const CeedScalar *, 386ea7c6c1SJed Brown const CeedScalar *, const CeedScalar *, const CeedScalar *, CeedBasis); 396ea7c6c1SJed Brown int (*QFunctionCreate)(CeedQFunction); 406ea7c6c1SJed Brown int (*OperatorCreate)(CeedOperator); 4180061934SJed Brown int refcount; 426ea7c6c1SJed Brown void *data; 436ea7c6c1SJed Brown }; 446ea7c6c1SJed Brown 456ea7c6c1SJed Brown /* In the next 3 functions, p has to be the address of a pointer type, i.e. p 466ea7c6c1SJed Brown has to be a pointer to a pointer. */ 47c7c22b02Scamierjs CEED_INTERN int CeedMallocArray(size_t n, size_t unit, void *p); 48c7c22b02Scamierjs CEED_INTERN int CeedCallocArray(size_t n, size_t unit, void *p); 49c7c22b02Scamierjs CEED_INTERN int CeedReallocArray(size_t n, size_t unit, void *p); 50c7c22b02Scamierjs CEED_INTERN int CeedFree(void *p); 516ea7c6c1SJed Brown 526ea7c6c1SJed Brown #define CeedChk(ierr) do { if (ierr) return ierr; } while (0) 536ea7c6c1SJed Brown /* Note that CeedMalloc and CeedCalloc will, generally, return pointers with 546ea7c6c1SJed Brown different memory alignments: CeedMalloc returns pointers aligned at 556ea7c6c1SJed Brown CEED_ALIGN bytes, while CeedCalloc uses the alignment of calloc. */ 56c7c22b02Scamierjs #define CeedMalloc(n, p) CeedMallocArray((n), sizeof(**(p)), p) 57c7c22b02Scamierjs #define CeedCalloc(n, p) CeedCallocArray((n), sizeof(**(p)), p) 58c7c22b02Scamierjs #define CeedRealloc(n, p) CeedReallocArray((n), sizeof(**(p)), p) 596ea7c6c1SJed Brown 606ea7c6c1SJed Brown struct CeedVector_private { 616ea7c6c1SJed Brown Ceed ceed; 626ea7c6c1SJed Brown int (*SetArray)(CeedVector, CeedMemType, CeedCopyMode, CeedScalar *); 632a1ab385Sjeremylt int (*SetValue)(CeedVector, CeedScalar); 646ea7c6c1SJed Brown int (*GetArray)(CeedVector, CeedMemType, CeedScalar **); 656ea7c6c1SJed Brown int (*GetArrayRead)(CeedVector, CeedMemType, const CeedScalar **); 666ea7c6c1SJed Brown int (*RestoreArray)(CeedVector, CeedScalar **); 676ea7c6c1SJed Brown int (*RestoreArrayRead)(CeedVector, const CeedScalar **); 686ea7c6c1SJed Brown int (*Destroy)(CeedVector); 69540765feSJed Brown int refcount; 706ea7c6c1SJed Brown CeedInt length; 716ea7c6c1SJed Brown void *data; 726ea7c6c1SJed Brown }; 736ea7c6c1SJed Brown 746ea7c6c1SJed Brown struct CeedElemRestriction_private { 756ea7c6c1SJed Brown Ceed ceed; 76ff8ca64bSJed Brown int (*Apply)(CeedElemRestriction, CeedTransposeMode, CeedTransposeMode, 776ea7c6c1SJed Brown CeedVector, CeedVector, CeedRequest *); 786ea7c6c1SJed Brown int (*Destroy)(CeedElemRestriction); 79675ef50dSJed Brown int refcount; 806ea7c6c1SJed Brown CeedInt nelem; /* number of elements */ 816ea7c6c1SJed Brown CeedInt elemsize; /* number of dofs per element */ 826ea7c6c1SJed Brown CeedInt ndof; /* size of the L-vector, can be used for checking for 836ea7c6c1SJed Brown correct vector sizes */ 84ff8ca64bSJed Brown CeedInt ncomp; /* number of components */ 854e35ef05Sjeremylt CeedInt blksize; /* number of elements in a batch */ 864e35ef05Sjeremylt CeedInt nblk; /* number of blocks of elements */ 876ea7c6c1SJed Brown void *data; /* place for the backend to store any data */ 886ea7c6c1SJed Brown }; 896ea7c6c1SJed Brown 906ea7c6c1SJed Brown struct CeedBasis_private { 916ea7c6c1SJed Brown Ceed ceed; 92*4b8bea3bSJed Brown int (*Apply)(CeedBasis, CeedInt, CeedTransposeMode, CeedEvalMode, 93*4b8bea3bSJed Brown const CeedScalar *, 946ea7c6c1SJed Brown CeedScalar *); 956ea7c6c1SJed Brown int (*Destroy)(CeedBasis); 96c3725256SJed Brown int refcount; 970f5de9e9Sjeremylt CeedInt dim; /* topological dimension */ 980f5de9e9Sjeremylt CeedInt ncomp; /* number of field components (1 for scalar fields) */ 990f5de9e9Sjeremylt CeedInt P1d; /* number of nodes in one dimension */ 1000f5de9e9Sjeremylt CeedInt Q1d; /* number of quadrature points in one dimension */ 1010f5de9e9Sjeremylt CeedScalar *qref1d; /* Array of length Q1d holding the locations of 1020f5de9e9Sjeremylt quadrature points on the 1D reference element [-1, 1] */ 1030f5de9e9Sjeremylt CeedScalar *qweight1d; /* array of length Q1d holding the quadrature weights on 1040f5de9e9Sjeremylt the reference element */ 105*4b8bea3bSJed Brown CeedScalar 106*4b8bea3bSJed Brown *interp1d; /* row-major matrix of shape [Q1d, P1d] expressing the values of 1070f5de9e9Sjeremylt nodal basis functions at quadrature points */ 108*4b8bea3bSJed Brown CeedScalar 109*4b8bea3bSJed Brown *grad1d; /* row-major matrix of shape [Q1d, P1d] matrix expressing derivatives of 1100f5de9e9Sjeremylt nodal basis functions at quadrature points */ 111c01dd730Scamierjs void *data; /* place for the backend to store any data */ 1126ea7c6c1SJed Brown }; 1136ea7c6c1SJed Brown 114ff8ca64bSJed Brown struct CeedQFunctionField { 115ff8ca64bSJed Brown const char *fieldname; 116ff8ca64bSJed Brown CeedInt ncomp; 117ff8ca64bSJed Brown CeedEvalMode emode; 118ff8ca64bSJed Brown }; 119ff8ca64bSJed Brown 1206ea7c6c1SJed Brown struct CeedQFunction_private { 1216ea7c6c1SJed Brown Ceed ceed; 122ff8ca64bSJed Brown int (*Apply)(CeedQFunction, CeedInt, const CeedScalar *const *, 1236ea7c6c1SJed Brown CeedScalar *const *); 1246ea7c6c1SJed Brown int (*Destroy)(CeedQFunction); 1252123d1aaSJed Brown int refcount; 1266ea7c6c1SJed Brown CeedInt vlength; // Number of quadrature points must be padded to a multiple of vlength 127ff8ca64bSJed Brown struct CeedQFunctionField inputfields[16]; 128ff8ca64bSJed Brown struct CeedQFunctionField outputfields[16]; 129ff8ca64bSJed Brown CeedInt numinputfields, numoutputfields; 130ff8ca64bSJed Brown int (*function)(void*, CeedInt, const CeedScalar *const*, CeedScalar *const*); 1316ea7c6c1SJed Brown const char *focca; 1326ea7c6c1SJed Brown void *ctx; /* user context for function */ 1336ea7c6c1SJed Brown size_t ctxsize; /* size of user context; may be used to copy to a device */ 1346ea7c6c1SJed Brown void *data; /* backend data */ 1356ea7c6c1SJed Brown }; 1366ea7c6c1SJed Brown 137ff8ca64bSJed Brown struct CeedOperatorField { 138ff8ca64bSJed Brown CeedElemRestriction Erestrict; /// Restriction from L-vector or NULL if identity 139ff8ca64bSJed Brown CeedBasis basis; /// Basis or NULL for collocated fields 140*4b8bea3bSJed Brown CeedVector 141*4b8bea3bSJed Brown vec; /// State vector for passive fields, NULL for active fields 142ff8ca64bSJed Brown }; 143ff8ca64bSJed Brown 1446ea7c6c1SJed Brown struct CeedOperator_private { 1456ea7c6c1SJed Brown Ceed ceed; 146c4da7380SJed Brown int refcount; 147ff8ca64bSJed Brown int (*Apply)(CeedOperator, CeedVector, CeedVector, CeedRequest *); 1486ea7c6c1SJed Brown int (*ApplyJacobian)(CeedOperator, CeedVector, CeedVector, CeedVector, 1496ea7c6c1SJed Brown CeedVector, CeedRequest *); 1506ea7c6c1SJed Brown int (*GetQData)(CeedOperator, CeedVector *); 1516ea7c6c1SJed Brown int (*Destroy)(CeedOperator); 152ff8ca64bSJed Brown struct CeedOperatorField inputfields[16]; 153ff8ca64bSJed Brown struct CeedOperatorField outputfields[16]; 154ff8ca64bSJed Brown CeedInt numelements; /// Number of elements 155ff8ca64bSJed Brown CeedInt numqpoints; /// Number of quadrature points over all elements 156ef700c2cSjeremylt CeedInt nfields; /// Number of fields that have been set 1576ea7c6c1SJed Brown CeedQFunction qf; 1586ea7c6c1SJed Brown CeedQFunction dqf; 1596ea7c6c1SJed Brown CeedQFunction dqfT; 160ff8ca64bSJed Brown bool setupdone; 1616ea7c6c1SJed Brown void *data; 1626ea7c6c1SJed Brown }; 1636ea7c6c1SJed Brown 1646ea7c6c1SJed Brown #endif 165