xref: /libCEED/rust/libceed-sys/c-src/include/ceed-impl.h (revision 0f5de9e98068b12a59dcd312c9f1e18e27ffc25d)
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 *);
346ea7c6c1SJed Brown   int (*BasisCreateTensorH1)(Ceed, CeedInt, CeedInt, CeedInt, const CeedScalar *,
356ea7c6c1SJed Brown                              const CeedScalar *, const CeedScalar *, const CeedScalar *, CeedBasis);
366ea7c6c1SJed Brown   int (*QFunctionCreate)(CeedQFunction);
376ea7c6c1SJed Brown   int (*OperatorCreate)(CeedOperator);
3880061934SJed Brown   int refcount;
396ea7c6c1SJed Brown   void *data;
406ea7c6c1SJed Brown };
416ea7c6c1SJed Brown 
426ea7c6c1SJed Brown /* In the next 3 functions, p has to be the address of a pointer type, i.e. p
436ea7c6c1SJed Brown    has to be a pointer to a pointer. */
44c7c22b02Scamierjs CEED_INTERN int CeedMallocArray(size_t n, size_t unit, void *p);
45c7c22b02Scamierjs CEED_INTERN int CeedCallocArray(size_t n, size_t unit, void *p);
46c7c22b02Scamierjs CEED_INTERN int CeedReallocArray(size_t n, size_t unit, void *p);
47c7c22b02Scamierjs CEED_INTERN int CeedFree(void *p);
486ea7c6c1SJed Brown 
496ea7c6c1SJed Brown #define CeedChk(ierr) do { if (ierr) return ierr; } while (0)
506ea7c6c1SJed Brown /* Note that CeedMalloc and CeedCalloc will, generally, return pointers with
516ea7c6c1SJed Brown    different memory alignments: CeedMalloc returns pointers aligned at
526ea7c6c1SJed Brown    CEED_ALIGN bytes, while CeedCalloc uses the alignment of calloc. */
53c7c22b02Scamierjs #define CeedMalloc(n, p) CeedMallocArray((n), sizeof(**(p)), p)
54c7c22b02Scamierjs #define CeedCalloc(n, p) CeedCallocArray((n), sizeof(**(p)), p)
55c7c22b02Scamierjs #define CeedRealloc(n, p) CeedReallocArray((n), sizeof(**(p)), p)
566ea7c6c1SJed Brown 
576ea7c6c1SJed Brown struct CeedVector_private {
586ea7c6c1SJed Brown   Ceed ceed;
596ea7c6c1SJed Brown   int (*SetArray)(CeedVector, CeedMemType, CeedCopyMode, CeedScalar *);
606ea7c6c1SJed Brown   int (*GetArray)(CeedVector, CeedMemType, CeedScalar **);
616ea7c6c1SJed Brown   int (*GetArrayRead)(CeedVector, CeedMemType, const CeedScalar **);
626ea7c6c1SJed Brown   int (*RestoreArray)(CeedVector, CeedScalar **);
636ea7c6c1SJed Brown   int (*RestoreArrayRead)(CeedVector, const CeedScalar **);
646ea7c6c1SJed Brown   int (*Destroy)(CeedVector);
65540765feSJed Brown   int refcount;
666ea7c6c1SJed Brown   CeedInt length;
676ea7c6c1SJed Brown   void *data;
686ea7c6c1SJed Brown };
696ea7c6c1SJed Brown 
706ea7c6c1SJed Brown struct CeedElemRestriction_private {
716ea7c6c1SJed Brown   Ceed ceed;
72ff8ca64bSJed Brown   int (*Apply)(CeedElemRestriction, CeedTransposeMode, CeedTransposeMode,
736ea7c6c1SJed Brown                CeedVector, CeedVector, CeedRequest *);
746ea7c6c1SJed Brown   int (*Destroy)(CeedElemRestriction);
75675ef50dSJed Brown   int refcount;
766ea7c6c1SJed Brown   CeedInt nelem;    /* number of elements */
776ea7c6c1SJed Brown   CeedInt elemsize; /* number of dofs per element */
786ea7c6c1SJed Brown   CeedInt ndof;     /* size of the L-vector, can be used for checking for
796ea7c6c1SJed Brown                        correct vector sizes */
80ff8ca64bSJed Brown   CeedInt ncomp;    /* number of components */
816ea7c6c1SJed Brown   void *data;       /* place for the backend to store any data */
826ea7c6c1SJed Brown };
836ea7c6c1SJed Brown 
846ea7c6c1SJed Brown struct CeedBasis_private {
856ea7c6c1SJed Brown   Ceed ceed;
866ea7c6c1SJed Brown   int (*Apply)(CeedBasis, CeedTransposeMode, CeedEvalMode, const CeedScalar *,
876ea7c6c1SJed Brown                CeedScalar *);
886ea7c6c1SJed Brown   int (*Destroy)(CeedBasis);
89c3725256SJed Brown   int refcount;
90*0f5de9e9Sjeremylt   CeedInt dim;           /* topological dimension */
91*0f5de9e9Sjeremylt   CeedInt ncomp;         /* number of field components (1 for scalar fields) */
92*0f5de9e9Sjeremylt   CeedInt P1d;           /* number of nodes in one dimension */
93*0f5de9e9Sjeremylt   CeedInt Q1d;           /* number of quadrature points in one dimension */
94*0f5de9e9Sjeremylt   CeedScalar *qref1d;    /* Array of length Q1d holding the locations of
95*0f5de9e9Sjeremylt                             quadrature points on the 1D reference element [-1, 1] */
96*0f5de9e9Sjeremylt   CeedScalar *qweight1d; /* array of length Q1d holding the quadrature weights on
97*0f5de9e9Sjeremylt                             the reference element */
98*0f5de9e9Sjeremylt   CeedScalar *interp1d;  /* row-major Q1d × P1d matrix expressing the values of
99*0f5de9e9Sjeremylt                             nodal basis functions at quadrature points */
100*0f5de9e9Sjeremylt   CeedScalar *grad1d;    /* row-major Q1d × P1d matrix expressing derivatives of
101*0f5de9e9Sjeremylt                             nodal basis functions at quadrature points */
102c01dd730Scamierjs   void *data;            /* place for the backend to store any data */
1036ea7c6c1SJed Brown };
1046ea7c6c1SJed Brown 
105ff8ca64bSJed Brown struct CeedQFunctionField {
106ff8ca64bSJed Brown   const char *fieldname;
107ff8ca64bSJed Brown   CeedInt ncomp;
108ff8ca64bSJed Brown   CeedEvalMode emode;
109ff8ca64bSJed Brown };
110ff8ca64bSJed Brown 
1116ea7c6c1SJed Brown struct CeedQFunction_private {
1126ea7c6c1SJed Brown   Ceed ceed;
113ff8ca64bSJed Brown   int (*Apply)(CeedQFunction, CeedInt, const CeedScalar *const *,
1146ea7c6c1SJed Brown                CeedScalar *const *);
1156ea7c6c1SJed Brown   int (*Destroy)(CeedQFunction);
1162123d1aaSJed Brown   int refcount;
1176ea7c6c1SJed Brown   CeedInt vlength;    // Number of quadrature points must be padded to a multiple of vlength
118ff8ca64bSJed Brown   struct CeedQFunctionField inputfields[16];
119ff8ca64bSJed Brown   struct CeedQFunctionField outputfields[16];
120ff8ca64bSJed Brown   CeedInt numinputfields, numoutputfields;
121ff8ca64bSJed Brown   int (*function)(void*, CeedInt, const CeedScalar *const*, CeedScalar *const*);
1226ea7c6c1SJed Brown   const char *focca;
1236ea7c6c1SJed Brown   void *ctx;      /* user context for function */
1246ea7c6c1SJed Brown   size_t ctxsize; /* size of user context; may be used to copy to a device */
1256ea7c6c1SJed Brown   void *data;     /* backend data */
1266ea7c6c1SJed Brown };
1276ea7c6c1SJed Brown 
128ff8ca64bSJed Brown struct CeedOperatorField {
129ff8ca64bSJed Brown   CeedElemRestriction Erestrict; /// Restriction from L-vector or NULL if identity
130ff8ca64bSJed Brown   CeedBasis basis;               /// Basis or NULL for collocated fields
131ff8ca64bSJed Brown   CeedVector vec;                /// State vector for passive fields, NULL for active fields
132ff8ca64bSJed Brown };
133ff8ca64bSJed Brown 
1346ea7c6c1SJed Brown struct CeedOperator_private {
1356ea7c6c1SJed Brown   Ceed ceed;
136c4da7380SJed Brown   int refcount;
137ff8ca64bSJed Brown   int (*Apply)(CeedOperator, CeedVector, CeedVector, CeedRequest *);
1386ea7c6c1SJed Brown   int (*ApplyJacobian)(CeedOperator, CeedVector, CeedVector, CeedVector,
1396ea7c6c1SJed Brown                        CeedVector, CeedRequest *);
1406ea7c6c1SJed Brown   int (*GetQData)(CeedOperator, CeedVector *);
1416ea7c6c1SJed Brown   int (*Destroy)(CeedOperator);
142ff8ca64bSJed Brown   struct CeedOperatorField inputfields[16];
143ff8ca64bSJed Brown   struct CeedOperatorField outputfields[16];
144ff8ca64bSJed Brown   CeedInt numelements; /// Number of elements
145ff8ca64bSJed Brown   CeedInt numqpoints;  /// Number of quadrature points over all elements
1466ea7c6c1SJed Brown   CeedQFunction qf;
1476ea7c6c1SJed Brown   CeedQFunction dqf;
1486ea7c6c1SJed Brown   CeedQFunction dqfT;
149ff8ca64bSJed Brown   bool setupdone;
1506ea7c6c1SJed Brown   void *data;
1516ea7c6c1SJed Brown };
1526ea7c6c1SJed Brown 
1536ea7c6c1SJed Brown #endif
154