1c8817ca9Svaleriabarra // Copyright (c) 2017-2018, Lawrence Livermore National Security, LLC. 2c8817ca9Svaleriabarra // Produced at the Lawrence Livermore National Laboratory. LLNL-CODE-734707. 3c8817ca9Svaleriabarra // All Rights reserved. See files LICENSE and NOTICE for details. 4c8817ca9Svaleriabarra // 5c8817ca9Svaleriabarra // This file is part of CEED, a collection of benchmarks, miniapps, software 6c8817ca9Svaleriabarra // libraries and APIs for efficient high-order finite element and spectral 7c8817ca9Svaleriabarra // element discretizations for exascale applications. For more information and 8c8817ca9Svaleriabarra // source code availability see http://github.com/ceed. 9c8817ca9Svaleriabarra // 10c8817ca9Svaleriabarra // The CEED research is supported by the Exascale Computing Project 17-SC-20-SC, 11c8817ca9Svaleriabarra // a collaborative effort of two U.S. Department of Energy organizations (Office 12c8817ca9Svaleriabarra // of Science and the National Nuclear Security Administration) responsible for 13c8817ca9Svaleriabarra // the planning and preparation of a capable exascale ecosystem, including 14c8817ca9Svaleriabarra // software, applications, hardware, advanced system engineering and early 15c8817ca9Svaleriabarra // testbed platforms, in support of the nation's exascale computing imperative. 16c8817ca9Svaleriabarra 17d7b241e6Sjeremylt // Fortran interface 18d7b241e6Sjeremylt #include <ceed.h> 19d7b241e6Sjeremylt #include <ceed-impl.h> 20d863ab9bSjeremylt #include <ceed-backend.h> 21d7b241e6Sjeremylt #include <ceed-fortran-name.h> 22d7b241e6Sjeremylt #include <stdlib.h> 23d7b241e6Sjeremylt #include <string.h> 24d7b241e6Sjeremylt 25d7b241e6Sjeremylt #define FORTRAN_REQUEST_IMMEDIATE -1 26d7b241e6Sjeremylt #define FORTRAN_REQUEST_ORDERED -2 27d7b241e6Sjeremylt #define FORTRAN_NULL -3 2815910d16Sjeremylt #define FORTRAN_STRIDES_BACKEND -4 2915910d16Sjeremylt #define FORTRAN_VECTOR_ACTIVE -5 3015910d16Sjeremylt #define FORTRAN_VECTOR_NONE -6 3115910d16Sjeremylt #define FORTRAN_ELEMRESTRICTION_NONE -7 3215910d16Sjeremylt #define FORTRAN_BASIS_COLLOCATED -8 3315910d16Sjeremylt #define FORTRAN_QFUNCTION_NONE -9 34d7b241e6Sjeremylt 35d7b241e6Sjeremylt static Ceed *Ceed_dict = NULL; 36d7b241e6Sjeremylt static int Ceed_count = 0; 37d7b241e6Sjeremylt static int Ceed_n = 0; 38d7b241e6Sjeremylt static int Ceed_count_max = 0; 39d7b241e6Sjeremylt 40c2ae719dSJed Brown // This test should actually be for the gfortran version, but we don't currently 41c2ae719dSJed Brown // have a configure system to determine that (TODO). At present, this will use 42c2ae719dSJed Brown // the smaller integer when run with clang+gfortran=8, for example. (That is 43c2ae719dSJed Brown // sketchy, but will likely work for users that don't have huge character 44c2ae719dSJed Brown // strings.) 45c2ae719dSJed Brown #if __GNUC__ >= 8 46c2ae719dSJed Brown typedef size_t fortran_charlen_t; 47c2ae719dSJed Brown #else 48c2ae719dSJed Brown typedef int fortran_charlen_t; 49c2ae719dSJed Brown #endif 50c2ae719dSJed Brown 51c2ae719dSJed Brown #define Splice(a, b) a ## b 52c2ae719dSJed Brown 53c2ae719dSJed Brown // Fortran strings are generally unterminated and the length is passed as an 54c2ae719dSJed Brown // extra argument after all the normal arguments. Some compilers (I only know 55c2ae719dSJed Brown // of Windows) place the length argument immediately after the string parameter 56c2ae719dSJed Brown // (TODO). 57c2ae719dSJed Brown // 58c2ae719dSJed Brown // We can't just NULL-terminate the string in-place because that could overwrite 59c2ae719dSJed Brown // other strings or attempt to write to read-only memory. This macro allocates 60c2ae719dSJed Brown // a string to hold the null-terminated version of the string that C expects. 61c2ae719dSJed Brown #define FIX_STRING(stringname) \ 62c2ae719dSJed Brown char Splice(stringname, _c)[1024]; \ 63c2ae719dSJed Brown if (Splice(stringname, _len) > 1023) \ 64c2ae719dSJed Brown CeedError(NULL, 1, "Fortran string length too long %zd", (size_t)Splice(stringname, _len)); \ 65c2ae719dSJed Brown strncpy(Splice(stringname, _c), stringname, Splice(stringname, _len)); \ 66c2ae719dSJed Brown Splice(stringname, _c)[Splice(stringname, _len)] = 0; \ 67c2ae719dSJed Brown 68d7b241e6Sjeremylt #define fCeedInit FORTRAN_NAME(ceedinit,CEEDINIT) 69c2ae719dSJed Brown void fCeedInit(const char *resource, int *ceed, int *err, 70c2ae719dSJed Brown fortran_charlen_t resource_len) { 71c2ae719dSJed Brown FIX_STRING(resource); 72d7b241e6Sjeremylt if (Ceed_count == Ceed_count_max) { 73d7b241e6Sjeremylt Ceed_count_max += Ceed_count_max/2 + 1; 74d7b241e6Sjeremylt CeedRealloc(Ceed_count_max, &Ceed_dict); 75d7b241e6Sjeremylt } 76d7b241e6Sjeremylt 77d7b241e6Sjeremylt Ceed *ceed_ = &Ceed_dict[Ceed_count]; 78c2ae719dSJed Brown *err = CeedInit(resource_c, ceed_); 79d7b241e6Sjeremylt 80d7b241e6Sjeremylt if (*err == 0) { 81d7b241e6Sjeremylt *ceed = Ceed_count++; 82d7b241e6Sjeremylt Ceed_n++; 83d7b241e6Sjeremylt } 84d7b241e6Sjeremylt } 85d7b241e6Sjeremylt 869525855cSJeremy L Thompson #define fCeedIsDeterministic \ 879525855cSJeremy L Thompson FORTRAN_NAME(ceedisdeterministic,CEEDISDETERMINISTIC) 889525855cSJeremy L Thompson void fCeedIsDeterministic(int *ceed, int *isDeterministic, int *err) { 899525855cSJeremy L Thompson *err = CeedIsDeterministic(Ceed_dict[*ceed], (bool *)isDeterministic); 909525855cSJeremy L Thompson } 919525855cSJeremy L Thompson 92c907536fSjeremylt #define fCeedGetPreferredMemType \ 93c907536fSjeremylt FORTRAN_NAME(ceedgetpreferredmemtype,CEEDGETPREFERREDMEMTYPE) 94c907536fSjeremylt void fCeedGetPreferredMemType(int *ceed, int *type, int *err) { 95c907536fSjeremylt *err = CeedGetPreferredMemType(Ceed_dict[*ceed], (CeedMemType *)type); 96c907536fSjeremylt } 97c907536fSjeremylt 980a0da059Sjeremylt #define fCeedView FORTRAN_NAME(ceedview,CEEDVIEW) 990a0da059Sjeremylt void fCeedView(int *ceed, int *err) { 1000a0da059Sjeremylt *err = CeedView(Ceed_dict[*ceed], stdout); 1010a0da059Sjeremylt } 1020a0da059Sjeremylt 103d7b241e6Sjeremylt #define fCeedDestroy FORTRAN_NAME(ceeddestroy,CEEDDESTROY) 104d7b241e6Sjeremylt void fCeedDestroy(int *ceed, int *err) { 105d7b241e6Sjeremylt *err = CeedDestroy(&Ceed_dict[*ceed]); 106d7b241e6Sjeremylt 107d7b241e6Sjeremylt if (*err == 0) { 108d7b241e6Sjeremylt Ceed_n--; 109d7b241e6Sjeremylt if (Ceed_n == 0) { 110d7b241e6Sjeremylt CeedFree(&Ceed_dict); 111d7b241e6Sjeremylt Ceed_count = 0; 112d7b241e6Sjeremylt Ceed_count_max = 0; 113d7b241e6Sjeremylt } 114d7b241e6Sjeremylt } 115d7b241e6Sjeremylt } 116d7b241e6Sjeremylt 117d7b241e6Sjeremylt static CeedVector *CeedVector_dict = NULL; 118d7b241e6Sjeremylt static int CeedVector_count = 0; 119d7b241e6Sjeremylt static int CeedVector_n = 0; 120d7b241e6Sjeremylt static int CeedVector_count_max = 0; 121d7b241e6Sjeremylt 122d7b241e6Sjeremylt #define fCeedVectorCreate FORTRAN_NAME(ceedvectorcreate,CEEDVECTORCREATE) 123d7b241e6Sjeremylt void fCeedVectorCreate(int *ceed, int *length, int *vec, int *err) { 124d7b241e6Sjeremylt if (CeedVector_count == CeedVector_count_max) { 125d7b241e6Sjeremylt CeedVector_count_max += CeedVector_count_max/2 + 1; 126d7b241e6Sjeremylt CeedRealloc(CeedVector_count_max, &CeedVector_dict); 127d7b241e6Sjeremylt } 128d7b241e6Sjeremylt 129d7b241e6Sjeremylt CeedVector *vec_ = &CeedVector_dict[CeedVector_count]; 130d7b241e6Sjeremylt *err = CeedVectorCreate(Ceed_dict[*ceed], *length, vec_); 131d7b241e6Sjeremylt 132d7b241e6Sjeremylt if (*err == 0) { 133d7b241e6Sjeremylt *vec = CeedVector_count++; 134d7b241e6Sjeremylt CeedVector_n++; 135d7b241e6Sjeremylt } 136d7b241e6Sjeremylt } 137d7b241e6Sjeremylt 138d7b241e6Sjeremylt #define fCeedVectorSetArray FORTRAN_NAME(ceedvectorsetarray,CEEDVECTORSETARRAY) 139d7b241e6Sjeremylt void fCeedVectorSetArray(int *vec, int *memtype, int *copymode, 140c8b9fe72Sjeremylt CeedScalar *array, int64_t *offset, int *err) { 141399bb197SJed Brown *err = CeedVectorSetArray(CeedVector_dict[*vec], (CeedMemType)*memtype, 142399bb197SJed Brown (CeedCopyMode)*copymode, 143c8b9fe72Sjeremylt (CeedScalar *)(array + *offset)); 144d7b241e6Sjeremylt } 145d7b241e6Sjeremylt 146*6a6c615bSJeremy L Thompson #define fCeedVectorTakeArray FORTRAN_NAME(ceedvectortakearray,CEEDVECTORTAKEARRAY) 147*6a6c615bSJeremy L Thompson void fCeedVectorTakeArray(int *vec, int *memtype, CeedScalar *array, 148*6a6c615bSJeremy L Thompson int64_t *offset, int *err) { 149*6a6c615bSJeremy L Thompson CeedScalar *b; 150*6a6c615bSJeremy L Thompson CeedVector vec_ = CeedVector_dict[*vec]; 151*6a6c615bSJeremy L Thompson *err = CeedVectorTakeArray(vec_, (CeedMemType)*memtype, &b); 152*6a6c615bSJeremy L Thompson *offset = b - array; 153*6a6c615bSJeremy L Thompson } 154*6a6c615bSJeremy L Thompson 15554540941SJeremy L Thompson #define fCeedVectorSyncArray FORTRAN_NAME(ceedvectorsyncarray,CEEDVECTORSYNCARRAY) 15654540941SJeremy L Thompson void fCeedVectorSyncArray(int *vec, int *memtype, int *err) { 157399bb197SJed Brown *err = CeedVectorSyncArray(CeedVector_dict[*vec], (CeedMemType)*memtype); 15854540941SJeremy L Thompson } 15954540941SJeremy L Thompson 160d7b241e6Sjeremylt #define fCeedVectorSetValue FORTRAN_NAME(ceedvectorsetvalue,CEEDVECTORSETVALUE) 161d7b241e6Sjeremylt void fCeedVectorSetValue(int *vec, CeedScalar *value, int *err) { 162d7b241e6Sjeremylt *err = CeedVectorSetValue(CeedVector_dict[*vec], *value); 163d7b241e6Sjeremylt } 164d7b241e6Sjeremylt 165d7b241e6Sjeremylt #define fCeedVectorGetArray FORTRAN_NAME(ceedvectorgetarray,CEEDVECTORGETARRAY) 166a8de75f0Sjeremylt void fCeedVectorGetArray(int *vec, int *memtype, CeedScalar *array, 167*6a6c615bSJeremy L Thompson int64_t *offset, int *err) { 168d7b241e6Sjeremylt CeedScalar *b; 169d7b241e6Sjeremylt CeedVector vec_ = CeedVector_dict[*vec]; 170399bb197SJed Brown *err = CeedVectorGetArray(vec_, (CeedMemType)*memtype, &b); 171cbfd6a90SThilina Rathnayake *offset = b - array; 172d7b241e6Sjeremylt } 173d7b241e6Sjeremylt 174d7b241e6Sjeremylt #define fCeedVectorGetArrayRead \ 175d7b241e6Sjeremylt FORTRAN_NAME(ceedvectorgetarrayread,CEEDVECTORGETARRAYREAD) 176d7b241e6Sjeremylt void fCeedVectorGetArrayRead(int *vec, int *memtype, CeedScalar *array, 1773334379fSJed Brown int64_t *offset, int *err) { 178d7b241e6Sjeremylt const CeedScalar *b; 179d7b241e6Sjeremylt CeedVector vec_ = CeedVector_dict[*vec]; 180399bb197SJed Brown *err = CeedVectorGetArrayRead(vec_, (CeedMemType)*memtype, &b); 181cbfd6a90SThilina Rathnayake *offset = b - array; 182d7b241e6Sjeremylt } 183d7b241e6Sjeremylt 184d7b241e6Sjeremylt #define fCeedVectorRestoreArray \ 185d7b241e6Sjeremylt FORTRAN_NAME(ceedvectorrestorearray,CEEDVECTORRESTOREARRAY) 1866456524eSJed Brown void fCeedVectorRestoreArray(int *vec, CeedScalar *array, 1876456524eSJed Brown int64_t *offset, int *err) { 188d7b241e6Sjeremylt *err = CeedVectorRestoreArray(CeedVector_dict[*vec], &array); 1896456524eSJed Brown *offset = 0; 190d7b241e6Sjeremylt } 191d7b241e6Sjeremylt 192d7b241e6Sjeremylt #define fCeedVectorRestoreArrayRead \ 193d7b241e6Sjeremylt FORTRAN_NAME(ceedvectorrestorearrayread,CEEDVECTORRESTOREARRAYREAD) 1946456524eSJed Brown void fCeedVectorRestoreArrayRead(int *vec, const CeedScalar *array, 1956456524eSJed Brown int64_t *offset, int *err) { 196d7b241e6Sjeremylt *err = CeedVectorRestoreArrayRead(CeedVector_dict[*vec], &array); 1976456524eSJed Brown *offset = 0; 198d7b241e6Sjeremylt } 199d7b241e6Sjeremylt 200547d9b97Sjeremylt #define fCeedVectorNorm \ 201547d9b97Sjeremylt FORTRAN_NAME(ceedvectornorm,CEEDVECTORNORM) 202547d9b97Sjeremylt void fCeedVectorNorm(int *vec, int *type, CeedScalar *norm, int *err) { 203399bb197SJed Brown *err = CeedVectorNorm(CeedVector_dict[*vec], (CeedNormType)*type, norm); 204547d9b97Sjeremylt } 205547d9b97Sjeremylt 206d7b241e6Sjeremylt #define fCeedVectorView FORTRAN_NAME(ceedvectorview,CEEDVECTORVIEW) 207d7b241e6Sjeremylt void fCeedVectorView(int *vec, int *err) { 208d7b241e6Sjeremylt *err = CeedVectorView(CeedVector_dict[*vec], "%12.8f", stdout); 209d7b241e6Sjeremylt } 210d7b241e6Sjeremylt 211d7b241e6Sjeremylt #define fCeedVectorDestroy FORTRAN_NAME(ceedvectordestroy,CEEDVECTORDESTROY) 212d7b241e6Sjeremylt void fCeedVectorDestroy(int *vec, int *err) { 213d7b241e6Sjeremylt *err = CeedVectorDestroy(&CeedVector_dict[*vec]); 214d7b241e6Sjeremylt 215d7b241e6Sjeremylt if (*err == 0) { 216d7b241e6Sjeremylt CeedVector_n--; 217d7b241e6Sjeremylt if (CeedVector_n == 0) { 218d7b241e6Sjeremylt CeedFree(&CeedVector_dict); 219d7b241e6Sjeremylt CeedVector_count = 0; 220d7b241e6Sjeremylt CeedVector_count_max = 0; 221d7b241e6Sjeremylt } 222d7b241e6Sjeremylt } 223d7b241e6Sjeremylt } 224d7b241e6Sjeremylt 225d7b241e6Sjeremylt static CeedElemRestriction *CeedElemRestriction_dict = NULL; 226d7b241e6Sjeremylt static int CeedElemRestriction_count = 0; 227d7b241e6Sjeremylt static int CeedElemRestriction_n = 0; 228d7b241e6Sjeremylt static int CeedElemRestriction_count_max = 0; 229d7b241e6Sjeremylt 230d7b241e6Sjeremylt #define fCeedElemRestrictionCreate \ 231d7b241e6Sjeremylt FORTRAN_NAME(ceedelemrestrictioncreate, CEEDELEMRESTRICTIONCREATE) 232d979a051Sjeremylt void fCeedElemRestrictionCreate(int *ceed, int *nelements, int *esize, 233d979a051Sjeremylt int *ncomp, int *compstride, int *lsize, 234d979a051Sjeremylt int *memtype, int *copymode, const int *offsets, 2358795c945Sjeremylt int *elemrestriction, int *err) { 236d7b241e6Sjeremylt if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 237d7b241e6Sjeremylt CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 238d7b241e6Sjeremylt CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 239d7b241e6Sjeremylt } 240d7b241e6Sjeremylt 241d979a051Sjeremylt const int *offsets_ = offsets; 242d7b241e6Sjeremylt 243d7b241e6Sjeremylt CeedElemRestriction *elemrestriction_ = 244d7b241e6Sjeremylt &CeedElemRestriction_dict[CeedElemRestriction_count]; 245d979a051Sjeremylt *err = CeedElemRestrictionCreate(Ceed_dict[*ceed], *nelements, *esize, 246d979a051Sjeremylt *ncomp, *compstride, *lsize, 247d979a051Sjeremylt (CeedMemType)*memtype, 248d979a051Sjeremylt (CeedCopyMode)*copymode, offsets_, 249d979a051Sjeremylt elemrestriction_); 250d7b241e6Sjeremylt 251d7b241e6Sjeremylt if (*err == 0) { 252d7b241e6Sjeremylt *elemrestriction = CeedElemRestriction_count++; 253d7b241e6Sjeremylt CeedElemRestriction_n++; 254d7b241e6Sjeremylt } 255d7b241e6Sjeremylt } 256d7b241e6Sjeremylt 2577509a596Sjeremylt #define fCeedElemRestrictionCreateStrided \ 2587509a596Sjeremylt FORTRAN_NAME(ceedelemrestrictioncreatestrided, CEEDELEMRESTRICTIONCREATESTRIDED) 2597509a596Sjeremylt void fCeedElemRestrictionCreateStrided(int *ceed, int *nelements, int *esize, 260d979a051Sjeremylt int *ncomp, int *lsize, int *strides, 261d7b241e6Sjeremylt int *elemrestriction, int *err) { 262d7b241e6Sjeremylt if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 263d7b241e6Sjeremylt CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 264d7b241e6Sjeremylt CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 265d7b241e6Sjeremylt } 266d7b241e6Sjeremylt 267d7b241e6Sjeremylt CeedElemRestriction *elemrestriction_ = 268d7b241e6Sjeremylt &CeedElemRestriction_dict[CeedElemRestriction_count]; 2697509a596Sjeremylt *err = CeedElemRestrictionCreateStrided(Ceed_dict[*ceed], *nelements, *esize, 270d979a051Sjeremylt *ncomp, *lsize, 271d979a051Sjeremylt *strides == FORTRAN_STRIDES_BACKEND ? 272d979a051Sjeremylt CEED_STRIDES_BACKEND : strides, 273523b8ea0Sjeremylt elemrestriction_); 274d7b241e6Sjeremylt if (*err == 0) { 275d7b241e6Sjeremylt *elemrestriction = CeedElemRestriction_count++; 276d7b241e6Sjeremylt CeedElemRestriction_n++; 277d7b241e6Sjeremylt } 278d7b241e6Sjeremylt } 279d7b241e6Sjeremylt 280d7b241e6Sjeremylt #define fCeedElemRestrictionCreateBlocked \ 281d7b241e6Sjeremylt FORTRAN_NAME(ceedelemrestrictioncreateblocked,CEEDELEMRESTRICTIONCREATEBLOCKED) 282d979a051Sjeremylt void fCeedElemRestrictionCreateBlocked(int *ceed, int *nelements, int *esize, 283d979a051Sjeremylt int *blocksize, int *ncomp, 284d979a051Sjeremylt int *compstride, int *lsize, 285d979a051Sjeremylt int *mtype, int *cmode, 2868795c945Sjeremylt int *blkindices, int *elemrestriction, 2878795c945Sjeremylt int *err) { 288d7b241e6Sjeremylt 289d7b241e6Sjeremylt if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 290d7b241e6Sjeremylt CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 291d7b241e6Sjeremylt CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 292d7b241e6Sjeremylt } 293d7b241e6Sjeremylt 294d7b241e6Sjeremylt CeedElemRestriction *elemrestriction_ = 295d7b241e6Sjeremylt &CeedElemRestriction_dict[CeedElemRestriction_count]; 296399bb197SJed Brown *err = CeedElemRestrictionCreateBlocked(Ceed_dict[*ceed], 297d979a051Sjeremylt *nelements, *esize, *blocksize, 298d979a051Sjeremylt *ncomp, *compstride, *lsize, 299d979a051Sjeremylt (CeedMemType)*mtype, 300d979a051Sjeremylt (CeedCopyMode)*cmode, blkindices, 301a8d32208Sjeremylt elemrestriction_); 302d7b241e6Sjeremylt 303d7b241e6Sjeremylt if (*err == 0) { 304d7b241e6Sjeremylt *elemrestriction = CeedElemRestriction_count++; 305d7b241e6Sjeremylt CeedElemRestriction_n++; 306d7b241e6Sjeremylt } 307d7b241e6Sjeremylt } 308d7b241e6Sjeremylt 3097509a596Sjeremylt #define fCeedElemRestrictionCreateBlockedStrided \ 3107509a596Sjeremylt FORTRAN_NAME(ceedelemrestrictioncreateblockedstrided, CEEDELEMRESTRICTIONCREATEBLOCKEDSTRIDED) 3117509a596Sjeremylt void fCeedElemRestrictionCreateBlockedStrided(int *ceed, int *nelements, 312d979a051Sjeremylt int *esize, int *blksize, int *ncomp, int *lsize, int *strides, 3137509a596Sjeremylt int *elemrestriction, int *err) { 3147509a596Sjeremylt if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 3157509a596Sjeremylt CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 3167509a596Sjeremylt CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 3177509a596Sjeremylt } 3187509a596Sjeremylt 3197509a596Sjeremylt CeedElemRestriction *elemrestriction_ = 3207509a596Sjeremylt &CeedElemRestriction_dict[CeedElemRestriction_count]; 3217509a596Sjeremylt *err = CeedElemRestrictionCreateBlockedStrided(Ceed_dict[*ceed], *nelements, 322d979a051Sjeremylt *esize, *blksize, *ncomp, *lsize, strides, elemrestriction_); 3237509a596Sjeremylt if (*err == 0) { 3247509a596Sjeremylt *elemrestriction = CeedElemRestriction_count++; 3257509a596Sjeremylt CeedElemRestriction_n++; 3267509a596Sjeremylt } 3277509a596Sjeremylt } 3287509a596Sjeremylt 329d7b241e6Sjeremylt static CeedRequest *CeedRequest_dict = NULL; 330d7b241e6Sjeremylt static int CeedRequest_count = 0; 331d7b241e6Sjeremylt static int CeedRequest_n = 0; 332d7b241e6Sjeremylt static int CeedRequest_count_max = 0; 333d7b241e6Sjeremylt 334d7b241e6Sjeremylt #define fCeedElemRestrictionApply \ 335d7b241e6Sjeremylt FORTRAN_NAME(ceedelemrestrictionapply,CEEDELEMRESTRICTIONAPPLY) 336a8d32208Sjeremylt void fCeedElemRestrictionApply(int *elemr, int *tmode, int *uvec, int *ruvec, 337a8d32208Sjeremylt int *rqst, int *err) { 338d7b241e6Sjeremylt int createRequest = 1; 339d7b241e6Sjeremylt // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 340d7b241e6Sjeremylt if (*rqst == FORTRAN_REQUEST_IMMEDIATE || *rqst == FORTRAN_REQUEST_ORDERED) 341d7b241e6Sjeremylt createRequest = 0; 342d7b241e6Sjeremylt 343d7b241e6Sjeremylt if (createRequest && CeedRequest_count == CeedRequest_count_max) { 344d7b241e6Sjeremylt CeedRequest_count_max += CeedRequest_count_max/2 + 1; 345d7b241e6Sjeremylt CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 346d7b241e6Sjeremylt } 347d7b241e6Sjeremylt 348d7b241e6Sjeremylt CeedRequest *rqst_; 349d7b241e6Sjeremylt if (*rqst == FORTRAN_REQUEST_IMMEDIATE) rqst_ = CEED_REQUEST_IMMEDIATE; 350d7b241e6Sjeremylt else if (*rqst == FORTRAN_REQUEST_ORDERED ) rqst_ = CEED_REQUEST_ORDERED; 351d7b241e6Sjeremylt else rqst_ = &CeedRequest_dict[CeedRequest_count]; 352d7b241e6Sjeremylt 353399bb197SJed Brown *err = CeedElemRestrictionApply(CeedElemRestriction_dict[*elemr], 354399bb197SJed Brown (CeedTransposeMode)*tmode, 355a8d32208Sjeremylt CeedVector_dict[*uvec], 3568795c945Sjeremylt CeedVector_dict[*ruvec], rqst_); 357d7b241e6Sjeremylt 358d7b241e6Sjeremylt if (*err == 0 && createRequest) { 359d7b241e6Sjeremylt *rqst = CeedRequest_count++; 360d7b241e6Sjeremylt CeedRequest_n++; 361d7b241e6Sjeremylt } 362d7b241e6Sjeremylt } 363d7b241e6Sjeremylt 364be9261b7Sjeremylt #define fCeedElemRestrictionApplyBlock \ 365be9261b7Sjeremylt FORTRAN_NAME(ceedelemrestrictionapplyblock,CEEDELEMRESTRICTIONAPPLYBLOCK) 366f90c8643Sjeremylt void fCeedElemRestrictionApplyBlock(int *elemr, int *block, int *tmode, 367be9261b7Sjeremylt int *uvec, int *ruvec, int *rqst, int *err) { 368be9261b7Sjeremylt int createRequest = 1; 369be9261b7Sjeremylt // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 370be9261b7Sjeremylt if (*rqst == FORTRAN_REQUEST_IMMEDIATE || *rqst == FORTRAN_REQUEST_ORDERED) 371be9261b7Sjeremylt createRequest = 0; 372be9261b7Sjeremylt 373be9261b7Sjeremylt if (createRequest && CeedRequest_count == CeedRequest_count_max) { 374be9261b7Sjeremylt CeedRequest_count_max += CeedRequest_count_max/2 + 1; 375be9261b7Sjeremylt CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 376be9261b7Sjeremylt } 377be9261b7Sjeremylt 378be9261b7Sjeremylt CeedRequest *rqst_; 379be9261b7Sjeremylt if (*rqst == FORTRAN_REQUEST_IMMEDIATE) rqst_ = CEED_REQUEST_IMMEDIATE; 380be9261b7Sjeremylt else if (*rqst == FORTRAN_REQUEST_ORDERED ) rqst_ = CEED_REQUEST_ORDERED; 381be9261b7Sjeremylt else rqst_ = &CeedRequest_dict[CeedRequest_count]; 382be9261b7Sjeremylt 383be9261b7Sjeremylt *err = CeedElemRestrictionApplyBlock(CeedElemRestriction_dict[*elemr], *block, 384399bb197SJed Brown (CeedTransposeMode)*tmode, CeedVector_dict[*uvec], 385be9261b7Sjeremylt CeedVector_dict[*ruvec], rqst_); 386be9261b7Sjeremylt 387be9261b7Sjeremylt if (*err == 0 && createRequest) { 388be9261b7Sjeremylt *rqst = CeedRequest_count++; 389be9261b7Sjeremylt CeedRequest_n++; 390be9261b7Sjeremylt } 391be9261b7Sjeremylt } 392be9261b7Sjeremylt 3931469ee4dSjeremylt #define fCeedElemRestrictionGetMultiplicity \ 3941469ee4dSjeremylt FORTRAN_NAME(ceedelemrestrictiongetmultiplicity,CEEDELEMRESTRICTIONGETMULTIPLICITY) 395a8d32208Sjeremylt void fCeedElemRestrictionGetMultiplicity(int *elemr, int *mult, int *err) { 3961469ee4dSjeremylt *err = CeedElemRestrictionGetMultiplicity(CeedElemRestriction_dict[*elemr], 397a8d32208Sjeremylt CeedVector_dict[*mult]); 3981469ee4dSjeremylt } 3991469ee4dSjeremylt 40049fd234cSJeremy L Thompson #define fCeedElemRestrictionGetELayout \ 40149fd234cSJeremy L Thompson FORTRAN_NAME(ceedelemrestrictiongetelayout,CEEDELEMRESTRICTIONGETELAYOUT) 40249fd234cSJeremy L Thompson void fCeedElemRestrictionGetELayout(int *elemr, int *layout, int *err) { 40349fd234cSJeremy L Thompson CeedInt layout_c[3]; 40449fd234cSJeremy L Thompson *err = CeedElemRestrictionGetELayout(CeedElemRestriction_dict[*elemr], 40549fd234cSJeremy L Thompson &layout_c); 40649fd234cSJeremy L Thompson for (int i=0; i<3; i++) 40749fd234cSJeremy L Thompson layout[i] = layout_c[i]; 40849fd234cSJeremy L Thompson } 40949fd234cSJeremy L Thompson 4105a86f033Sjeremylt #define fCeedElemRestrictionView \ 4115a86f033Sjeremylt FORTRAN_NAME(ceedelemrestrictionview,CEEDELEMRESTRICTIONVIEW) 4125a86f033Sjeremylt void fCeedElemRestrictionView(int *elemr, int *err) { 4135a86f033Sjeremylt *err = CeedElemRestrictionView(CeedElemRestriction_dict[*elemr], stdout); 4145a86f033Sjeremylt } 4151469ee4dSjeremylt 416d7b241e6Sjeremylt #define fCeedRequestWait FORTRAN_NAME(ceedrequestwait, CEEDREQUESTWAIT) 417d7b241e6Sjeremylt void fCeedRequestWait(int *rqst, int *err) { 418d7b241e6Sjeremylt // TODO Uncomment this once CeedRequestWait is implemented 419d7b241e6Sjeremylt //*err = CeedRequestWait(&CeedRequest_dict[*rqst]); 420d7b241e6Sjeremylt 421d7b241e6Sjeremylt if (*err == 0) { 422d7b241e6Sjeremylt CeedRequest_n--; 423d7b241e6Sjeremylt if (CeedRequest_n == 0) { 424d7b241e6Sjeremylt CeedFree(&CeedRequest_dict); 425d7b241e6Sjeremylt CeedRequest_count = 0; 426d7b241e6Sjeremylt CeedRequest_count_max = 0; 427d7b241e6Sjeremylt } 428d7b241e6Sjeremylt } 429d7b241e6Sjeremylt } 430d7b241e6Sjeremylt 431d7b241e6Sjeremylt #define fCeedElemRestrictionDestroy \ 432d7b241e6Sjeremylt FORTRAN_NAME(ceedelemrestrictiondestroy,CEEDELEMRESTRICTIONDESTROY) 433d7b241e6Sjeremylt void fCeedElemRestrictionDestroy(int *elem, int *err) { 434d7b241e6Sjeremylt *err = CeedElemRestrictionDestroy(&CeedElemRestriction_dict[*elem]); 435d7b241e6Sjeremylt 436d7b241e6Sjeremylt if (*err == 0) { 437d7b241e6Sjeremylt CeedElemRestriction_n--; 438d7b241e6Sjeremylt if (CeedElemRestriction_n == 0) { 439d7b241e6Sjeremylt CeedFree(&CeedElemRestriction_dict); 440d7b241e6Sjeremylt CeedElemRestriction_count = 0; 441d7b241e6Sjeremylt CeedElemRestriction_count_max = 0; 442d7b241e6Sjeremylt } 443d7b241e6Sjeremylt } 444d7b241e6Sjeremylt } 445d7b241e6Sjeremylt 446d7b241e6Sjeremylt static CeedBasis *CeedBasis_dict = NULL; 447d7b241e6Sjeremylt static int CeedBasis_count = 0; 448d7b241e6Sjeremylt static int CeedBasis_n = 0; 449d7b241e6Sjeremylt static int CeedBasis_count_max = 0; 450d7b241e6Sjeremylt 451d7b241e6Sjeremylt #define fCeedBasisCreateTensorH1Lagrange \ 452d7b241e6Sjeremylt FORTRAN_NAME(ceedbasiscreatetensorh1lagrange, CEEDBASISCREATETENSORH1LAGRANGE) 453d7b241e6Sjeremylt void fCeedBasisCreateTensorH1Lagrange(int *ceed, int *dim, 4548795c945Sjeremylt int *ncomp, int *P, int *Q, int *quadmode, 4558795c945Sjeremylt int *basis, int *err) { 456d7b241e6Sjeremylt if (CeedBasis_count == CeedBasis_count_max) { 457d7b241e6Sjeremylt CeedBasis_count_max += CeedBasis_count_max/2 + 1; 458d7b241e6Sjeremylt CeedRealloc(CeedBasis_count_max, &CeedBasis_dict); 459d7b241e6Sjeremylt } 460d7b241e6Sjeremylt 461a8de75f0Sjeremylt *err = CeedBasisCreateTensorH1Lagrange(Ceed_dict[*ceed], *dim, *ncomp, *P, *Q, 462399bb197SJed Brown (CeedQuadMode)*quadmode, 4638795c945Sjeremylt &CeedBasis_dict[CeedBasis_count]); 464d7b241e6Sjeremylt 465d7b241e6Sjeremylt if (*err == 0) { 466d7b241e6Sjeremylt *basis = CeedBasis_count++; 467d7b241e6Sjeremylt CeedBasis_n++; 468d7b241e6Sjeremylt } 469d7b241e6Sjeremylt } 470d7b241e6Sjeremylt 471d7b241e6Sjeremylt #define fCeedBasisCreateTensorH1 \ 472d7b241e6Sjeremylt FORTRAN_NAME(ceedbasiscreatetensorh1, CEEDBASISCREATETENSORH1) 473a8de75f0Sjeremylt void fCeedBasisCreateTensorH1(int *ceed, int *dim, int *ncomp, int *P1d, 4748795c945Sjeremylt int *Q1d, const CeedScalar *interp1d, 4758795c945Sjeremylt const CeedScalar *grad1d, 4768795c945Sjeremylt const CeedScalar *qref1d, 4778795c945Sjeremylt const CeedScalar *qweight1d, int *basis, 4788795c945Sjeremylt int *err) { 479d7b241e6Sjeremylt if (CeedBasis_count == CeedBasis_count_max) { 480d7b241e6Sjeremylt CeedBasis_count_max += CeedBasis_count_max/2 + 1; 481d7b241e6Sjeremylt CeedRealloc(CeedBasis_count_max, &CeedBasis_dict); 482d7b241e6Sjeremylt } 483d7b241e6Sjeremylt 484a8de75f0Sjeremylt *err = CeedBasisCreateTensorH1(Ceed_dict[*ceed], *dim, *ncomp, *P1d, *Q1d, 4858795c945Sjeremylt interp1d, grad1d, qref1d, qweight1d, 4868795c945Sjeremylt &CeedBasis_dict[CeedBasis_count]); 487d7b241e6Sjeremylt 488d7b241e6Sjeremylt if (*err == 0) { 489d7b241e6Sjeremylt *basis = CeedBasis_count++; 490d7b241e6Sjeremylt CeedBasis_n++; 491d7b241e6Sjeremylt } 492d7b241e6Sjeremylt } 493d7b241e6Sjeremylt 494a8de75f0Sjeremylt #define fCeedBasisCreateH1 \ 495a8de75f0Sjeremylt FORTRAN_NAME(ceedbasiscreateh1, CEEDBASISCREATEH1) 4968795c945Sjeremylt void fCeedBasisCreateH1(int *ceed, int *topo, int *ncomp, int *nnodes, 4978795c945Sjeremylt int *nqpts, const CeedScalar *interp, 4988795c945Sjeremylt const CeedScalar *grad, const CeedScalar *qref, 4998795c945Sjeremylt const CeedScalar *qweight, int *basis, int *err) { 500a8de75f0Sjeremylt if (CeedBasis_count == CeedBasis_count_max) { 501a8de75f0Sjeremylt CeedBasis_count_max += CeedBasis_count_max/2 + 1; 502a8de75f0Sjeremylt CeedRealloc(CeedBasis_count_max, &CeedBasis_dict); 503a8de75f0Sjeremylt } 504a8de75f0Sjeremylt 505399bb197SJed Brown *err = CeedBasisCreateH1(Ceed_dict[*ceed], (CeedElemTopology)*topo, *ncomp, 506399bb197SJed Brown *nnodes, *nqpts, interp, grad, qref, qweight, 5078795c945Sjeremylt &CeedBasis_dict[CeedBasis_count]); 508a8de75f0Sjeremylt 509a8de75f0Sjeremylt if (*err == 0) { 510a8de75f0Sjeremylt *basis = CeedBasis_count++; 511a8de75f0Sjeremylt CeedBasis_n++; 512a8de75f0Sjeremylt } 513a8de75f0Sjeremylt } 514a8de75f0Sjeremylt 515d7b241e6Sjeremylt #define fCeedBasisView FORTRAN_NAME(ceedbasisview, CEEDBASISVIEW) 516d7b241e6Sjeremylt void fCeedBasisView(int *basis, int *err) { 517d7b241e6Sjeremylt *err = CeedBasisView(CeedBasis_dict[*basis], stdout); 518d7b241e6Sjeremylt } 519d7b241e6Sjeremylt 520d7b241e6Sjeremylt #define fCeedQRFactorization \ 521d7b241e6Sjeremylt FORTRAN_NAME(ceedqrfactorization, CEEDQRFACTORIZATION) 522a7bd39daSjeremylt void fCeedQRFactorization(int *ceed, CeedScalar *mat, CeedScalar *tau, int *m, 523a7bd39daSjeremylt int *n, int *err) { 524a7bd39daSjeremylt *err = CeedQRFactorization(Ceed_dict[*ceed], mat, tau, *m, *n); 525d7b241e6Sjeremylt } 526d7b241e6Sjeremylt 52752bfb9bbSJeremy L Thompson #define fCeedSymmetricSchurDecomposition \ 52852bfb9bbSJeremy L Thompson FORTRAN_NAME(ceedsymmetricschurdecomposition, CEEDSYMMETRICSCHURDECOMPOSITION) 52952bfb9bbSJeremy L Thompson void fCeedSymmetricSchurDecomposition(int *ceed, CeedScalar *mat, 53052bfb9bbSJeremy L Thompson CeedScalar *lambda, int *n, int *err) { 53152bfb9bbSJeremy L Thompson *err = CeedSymmetricSchurDecomposition(Ceed_dict[*ceed], mat, lambda, *n); 53252bfb9bbSJeremy L Thompson } 53352bfb9bbSJeremy L Thompson 53452bfb9bbSJeremy L Thompson #define fCeedSimultaneousDiagonalization \ 53552bfb9bbSJeremy L Thompson FORTRAN_NAME(ceedsimultaneousdiagonalization, CEEDSIMULTANEOUSDIAGONALIZATION) 53652bfb9bbSJeremy L Thompson void fCeedSimultaneousDiagonalization(int *ceed, CeedScalar *matA, 53752bfb9bbSJeremy L Thompson CeedScalar *matB, CeedScalar *x, 53852bfb9bbSJeremy L Thompson CeedScalar *lambda, int *n, int *err) { 53952bfb9bbSJeremy L Thompson *err = CeedSimultaneousDiagonalization(Ceed_dict[*ceed], matA, matB, x, 54052bfb9bbSJeremy L Thompson lambda, *n); 54152bfb9bbSJeremy L Thompson } 54252bfb9bbSJeremy L Thompson 543783c99b3SValeria Barra #define fCeedBasisGetCollocatedGrad \ 544783c99b3SValeria Barra FORTRAN_NAME(ceedbasisgetcollocatedgrad, CEEDBASISGETCOLLOCATEDGRAD) 545783c99b3SValeria Barra void fCeedBasisGetCollocatedGrad(int *basis, CeedScalar *colograd1d, 546d7b241e6Sjeremylt int *err) { 547783c99b3SValeria Barra *err = CeedBasisGetCollocatedGrad(CeedBasis_dict[*basis], colograd1d); 548d7b241e6Sjeremylt } 549d7b241e6Sjeremylt 550d7b241e6Sjeremylt #define fCeedBasisApply FORTRAN_NAME(ceedbasisapply, CEEDBASISAPPLY) 551d7b241e6Sjeremylt void fCeedBasisApply(int *basis, int *nelem, int *tmode, int *emode, 552aedaa0e5Sjeremylt int *u, int *v, int *err) { 553399bb197SJed Brown *err = CeedBasisApply(CeedBasis_dict[*basis], *nelem, (CeedTransposeMode)*tmode, 554399bb197SJed Brown (CeedEvalMode)*emode, 555399bb197SJed Brown *u == FORTRAN_VECTOR_NONE ? CEED_VECTOR_NONE : CeedVector_dict[*u], 556aedaa0e5Sjeremylt CeedVector_dict[*v]); 557d7b241e6Sjeremylt } 558d7b241e6Sjeremylt 559d7b241e6Sjeremylt #define fCeedBasisGetNumNodes \ 560d7b241e6Sjeremylt FORTRAN_NAME(ceedbasisgetnumnodes, CEEDBASISGETNUMNODES) 561d7b241e6Sjeremylt void fCeedBasisGetNumNodes(int *basis, int *P, int *err) { 562d7b241e6Sjeremylt *err = CeedBasisGetNumNodes(CeedBasis_dict[*basis], P); 563d7b241e6Sjeremylt } 564d7b241e6Sjeremylt 565d7b241e6Sjeremylt #define fCeedBasisGetNumQuadraturePoints \ 566d7b241e6Sjeremylt FORTRAN_NAME(ceedbasisgetnumquadraturepoints, CEEDBASISGETNUMQUADRATUREPOINTS) 567d7b241e6Sjeremylt void fCeedBasisGetNumQuadraturePoints(int *basis, int *Q, int *err) { 568d7b241e6Sjeremylt *err = CeedBasisGetNumQuadraturePoints(CeedBasis_dict[*basis], Q); 569d7b241e6Sjeremylt } 570d7b241e6Sjeremylt 571d7b241e6Sjeremylt #define fCeedBasisDestroy FORTRAN_NAME(ceedbasisdestroy,CEEDBASISDESTROY) 572d7b241e6Sjeremylt void fCeedBasisDestroy(int *basis, int *err) { 573d7b241e6Sjeremylt *err = CeedBasisDestroy(&CeedBasis_dict[*basis]); 574d7b241e6Sjeremylt 575d7b241e6Sjeremylt if (*err == 0) { 576d7b241e6Sjeremylt CeedBasis_n--; 577d7b241e6Sjeremylt if (CeedBasis_n == 0) { 578d7b241e6Sjeremylt CeedFree(&CeedBasis_dict); 579d7b241e6Sjeremylt CeedBasis_count = 0; 580d7b241e6Sjeremylt CeedBasis_count_max = 0; 581d7b241e6Sjeremylt } 582d7b241e6Sjeremylt } 583d7b241e6Sjeremylt } 584d7b241e6Sjeremylt 585d7b241e6Sjeremylt #define fCeedGaussQuadrature FORTRAN_NAME(ceedgaussquadrature, CEEDGAUSSQUADRATURE) 586d7b241e6Sjeremylt void fCeedGaussQuadrature(int *Q, CeedScalar *qref1d, CeedScalar *qweight1d, 587d7b241e6Sjeremylt int *err) { 588d7b241e6Sjeremylt *err = CeedGaussQuadrature(*Q, qref1d, qweight1d); 589d7b241e6Sjeremylt } 590d7b241e6Sjeremylt 591d7b241e6Sjeremylt #define fCeedLobattoQuadrature \ 592d7b241e6Sjeremylt FORTRAN_NAME(ceedlobattoquadrature, CEEDLOBATTOQUADRATURE) 593d7b241e6Sjeremylt void fCeedLobattoQuadrature(int *Q, CeedScalar *qref1d, CeedScalar *qweight1d, 594d7b241e6Sjeremylt int *err) { 595d7b241e6Sjeremylt *err = CeedLobattoQuadrature(*Q, qref1d, qweight1d); 596d7b241e6Sjeremylt } 597d7b241e6Sjeremylt 598d7b241e6Sjeremylt static CeedQFunction *CeedQFunction_dict = NULL; 599d7b241e6Sjeremylt static int CeedQFunction_count = 0; 600d7b241e6Sjeremylt static int CeedQFunction_n = 0; 601d7b241e6Sjeremylt static int CeedQFunction_count_max = 0; 602d7b241e6Sjeremylt 603d7b241e6Sjeremylt static int CeedQFunctionFortranStub(void *ctx, int nq, 6048795c945Sjeremylt const CeedScalar *const *u, 6058795c945Sjeremylt CeedScalar *const *v) { 606418fb8c2Sjeremylt fContext *fctx = ctx; 607d7b241e6Sjeremylt int ierr; 608d7b241e6Sjeremylt 6091e35832bSjeremylt CeedScalar *ctx_ = (CeedScalar *) fctx->innerctx; 6101e35832bSjeremylt fctx->f((void *)ctx_,&nq,u[0],u[1],u[2],u[3],u[4],u[5],u[6], 611418fb8c2Sjeremylt u[7],u[8],u[9],u[10],u[11],u[12],u[13],u[14],u[15], 612418fb8c2Sjeremylt v[0],v[1],v[2],v[3],v[4],v[5],v[6],v[7],v[8],v[9], 613418fb8c2Sjeremylt v[10],v[11],v[12],v[13],v[14],v[15],&ierr); 614d7b241e6Sjeremylt return ierr; 615d7b241e6Sjeremylt } 616d7b241e6Sjeremylt 617d7b241e6Sjeremylt #define fCeedQFunctionCreateInterior \ 618d7b241e6Sjeremylt FORTRAN_NAME(ceedqfunctioncreateinterior, CEEDQFUNCTIONCREATEINTERIOR) 619d7b241e6Sjeremylt void fCeedQFunctionCreateInterior(int *ceed, int *vlength, 620d7b241e6Sjeremylt void (*f)(void *ctx, int *nq, 621418fb8c2Sjeremylt const CeedScalar *u,const CeedScalar *u1, 622418fb8c2Sjeremylt const CeedScalar *u2,const CeedScalar *u3, 623418fb8c2Sjeremylt const CeedScalar *u4,const CeedScalar *u5, 624418fb8c2Sjeremylt const CeedScalar *u6,const CeedScalar *u7, 625418fb8c2Sjeremylt const CeedScalar *u8,const CeedScalar *u9, 626418fb8c2Sjeremylt const CeedScalar *u10,const CeedScalar *u11, 627418fb8c2Sjeremylt const CeedScalar *u12,const CeedScalar *u13, 628418fb8c2Sjeremylt const CeedScalar *u14,const CeedScalar *u15, 629418fb8c2Sjeremylt CeedScalar *v,CeedScalar *v1,CeedScalar *v2, 6308795c945Sjeremylt CeedScalar *v3,CeedScalar *v4, 6318795c945Sjeremylt CeedScalar *v5,CeedScalar *v6, 6328795c945Sjeremylt CeedScalar *v7,CeedScalar *v8, 6338795c945Sjeremylt CeedScalar *v9,CeedScalar *v10, 6348795c945Sjeremylt CeedScalar *v11,CeedScalar *v12, 6358795c945Sjeremylt CeedScalar *v13,CeedScalar *v14, 636418fb8c2Sjeremylt CeedScalar *v15,int *err), 637288c0443SJeremy L Thompson const char *source, int *qf, int *err, 638288c0443SJeremy L Thompson fortran_charlen_t source_len) { 639288c0443SJeremy L Thompson FIX_STRING(source); 640d7b241e6Sjeremylt if (CeedQFunction_count == CeedQFunction_count_max) { 641d7b241e6Sjeremylt CeedQFunction_count_max += CeedQFunction_count_max/2 + 1; 642d7b241e6Sjeremylt CeedRealloc(CeedQFunction_count_max, &CeedQFunction_dict); 643d7b241e6Sjeremylt } 644d7b241e6Sjeremylt 645d7b241e6Sjeremylt CeedQFunction *qf_ = &CeedQFunction_dict[CeedQFunction_count]; 646d7b241e6Sjeremylt *err = CeedQFunctionCreateInterior(Ceed_dict[*ceed], *vlength, 647288c0443SJeremy L Thompson CeedQFunctionFortranStub, source_c, qf_); 648d7b241e6Sjeremylt 649d7b241e6Sjeremylt if (*err == 0) { 650d7b241e6Sjeremylt *qf = CeedQFunction_count++; 651d7b241e6Sjeremylt CeedQFunction_n++; 652d7b241e6Sjeremylt } 653d7b241e6Sjeremylt 654418fb8c2Sjeremylt fContext *fctx; 655d7b241e6Sjeremylt *err = CeedMalloc(1, &fctx); 656d7b241e6Sjeremylt if (*err) return; 657418fb8c2Sjeremylt fctx->f = f; fctx->innerctx = NULL; fctx->innerctxsize = 0; 658d7b241e6Sjeremylt 659418fb8c2Sjeremylt *err = CeedQFunctionSetContext(*qf_, fctx, sizeof(fContext)); 660d7b241e6Sjeremylt 661418fb8c2Sjeremylt (*qf_)->fortranstatus = true; 662d7b241e6Sjeremylt } 663d7b241e6Sjeremylt 664288c0443SJeremy L Thompson #define fCeedQFunctionCreateInteriorByName \ 665288c0443SJeremy L Thompson FORTRAN_NAME(ceedqfunctioncreateinteriorbyname, CEEDQFUNCTIONCREATEINTERIORBYNAME) 666288c0443SJeremy L Thompson void fCeedQFunctionCreateInteriorByName(int *ceed, const char *name, int *qf, 667288c0443SJeremy L Thompson int *err, fortran_charlen_t name_len) { 668288c0443SJeremy L Thompson FIX_STRING(name); 669288c0443SJeremy L Thompson if (CeedQFunction_count == CeedQFunction_count_max) { 670288c0443SJeremy L Thompson CeedQFunction_count_max += CeedQFunction_count_max/2 + 1; 671288c0443SJeremy L Thompson CeedRealloc(CeedQFunction_count_max, &CeedQFunction_dict); 672288c0443SJeremy L Thompson } 673288c0443SJeremy L Thompson 674288c0443SJeremy L Thompson CeedQFunction *qf_ = &CeedQFunction_dict[CeedQFunction_count]; 675288c0443SJeremy L Thompson *err = CeedQFunctionCreateInteriorByName(Ceed_dict[*ceed], name_c, qf_); 676288c0443SJeremy L Thompson 677288c0443SJeremy L Thompson if (*err == 0) { 678288c0443SJeremy L Thompson *qf = CeedQFunction_count++; 679288c0443SJeremy L Thompson CeedQFunction_n++; 680288c0443SJeremy L Thompson } 681288c0443SJeremy L Thompson } 682288c0443SJeremy L Thompson 6830219ea01SJeremy L Thompson #define fCeedQFunctionCreateIdentity \ 6840219ea01SJeremy L Thompson FORTRAN_NAME(ceedqfunctioncreateidentity, CEEDQFUNCTIONCREATEIDENTITY) 68560f77c51Sjeremylt void fCeedQFunctionCreateIdentity(int *ceed, int *size, int *inmode, 68660f77c51Sjeremylt int *outmode, int *qf, int *err) { 6870219ea01SJeremy L Thompson if (CeedQFunction_count == CeedQFunction_count_max) { 6880219ea01SJeremy L Thompson CeedQFunction_count_max += CeedQFunction_count_max/2 + 1; 6890219ea01SJeremy L Thompson CeedRealloc(CeedQFunction_count_max, &CeedQFunction_dict); 6900219ea01SJeremy L Thompson } 6910219ea01SJeremy L Thompson 6920219ea01SJeremy L Thompson CeedQFunction *qf_ = &CeedQFunction_dict[CeedQFunction_count]; 693399bb197SJed Brown *err = CeedQFunctionCreateIdentity(Ceed_dict[*ceed], *size, 694399bb197SJed Brown (CeedEvalMode)*inmode, 695399bb197SJed Brown (CeedEvalMode)*outmode, qf_); 6960219ea01SJeremy L Thompson 6970219ea01SJeremy L Thompson if (*err == 0) { 6980219ea01SJeremy L Thompson *qf = CeedQFunction_count++; 6990219ea01SJeremy L Thompson CeedQFunction_n++; 7000219ea01SJeremy L Thompson } 7010219ea01SJeremy L Thompson } 7020219ea01SJeremy L Thompson 703d7b241e6Sjeremylt #define fCeedQFunctionAddInput \ 704d7b241e6Sjeremylt FORTRAN_NAME(ceedqfunctionaddinput,CEEDQFUNCTIONADDINPUT) 705d7b241e6Sjeremylt void fCeedQFunctionAddInput(int *qf, const char *fieldname, 706c2ae719dSJed Brown CeedInt *ncomp, CeedEvalMode *emode, int *err, 707c2ae719dSJed Brown fortran_charlen_t fieldname_len) { 708c2ae719dSJed Brown FIX_STRING(fieldname); 709d7b241e6Sjeremylt CeedQFunction qf_ = CeedQFunction_dict[*qf]; 710d7b241e6Sjeremylt 711c2ae719dSJed Brown *err = CeedQFunctionAddInput(qf_, fieldname_c, *ncomp, *emode); 712d7b241e6Sjeremylt } 713d7b241e6Sjeremylt 714d7b241e6Sjeremylt #define fCeedQFunctionAddOutput \ 715d7b241e6Sjeremylt FORTRAN_NAME(ceedqfunctionaddoutput,CEEDQFUNCTIONADDOUTPUT) 716d7b241e6Sjeremylt void fCeedQFunctionAddOutput(int *qf, const char *fieldname, 717c2ae719dSJed Brown CeedInt *ncomp, CeedEvalMode *emode, int *err, 718c2ae719dSJed Brown fortran_charlen_t fieldname_len) { 719c2ae719dSJed Brown FIX_STRING(fieldname); 720d7b241e6Sjeremylt CeedQFunction qf_ = CeedQFunction_dict[*qf]; 721d7b241e6Sjeremylt 722c2ae719dSJed Brown *err = CeedQFunctionAddOutput(qf_, fieldname_c, *ncomp, *emode); 723d7b241e6Sjeremylt } 724d7b241e6Sjeremylt 725418fb8c2Sjeremylt #define fCeedQFunctionSetContext \ 726418fb8c2Sjeremylt FORTRAN_NAME(ceedqfunctionsetcontext,CEEDQFUNCTIONSETCONTEXT) 727418fb8c2Sjeremylt void fCeedQFunctionSetContext(int *qf, CeedScalar *ctx, CeedInt *n, int *err) { 728418fb8c2Sjeremylt CeedQFunction qf_ = CeedQFunction_dict[*qf]; 729418fb8c2Sjeremylt 730418fb8c2Sjeremylt fContext *fctx = qf_->ctx; 731418fb8c2Sjeremylt fctx->innerctx = ctx; 7321e35832bSjeremylt fctx->innerctxsize = ((size_t) *n)*sizeof(CeedScalar); 733418fb8c2Sjeremylt } 734418fb8c2Sjeremylt 73575affc3bSjeremylt #define fCeedQFunctionView \ 73675affc3bSjeremylt FORTRAN_NAME(ceedqfunctionview,CEEDQFUNCTIONVIEW) 73775affc3bSjeremylt void fCeedQFunctionView(int *qf, int *err) { 73875affc3bSjeremylt CeedQFunction qf_ = CeedQFunction_dict[*qf]; 73975affc3bSjeremylt 74075affc3bSjeremylt *err = CeedQFunctionView(qf_, stdout); 74175affc3bSjeremylt } 74275affc3bSjeremylt 743d7b241e6Sjeremylt #define fCeedQFunctionApply \ 744d7b241e6Sjeremylt FORTRAN_NAME(ceedqfunctionapply,CEEDQFUNCTIONAPPLY) 745d7b241e6Sjeremylt //TODO Need Fixing, double pointer 746d7b241e6Sjeremylt void fCeedQFunctionApply(int *qf, int *Q, 747aedaa0e5Sjeremylt int *u, int *u1, int *u2, int *u3, 748aedaa0e5Sjeremylt int *u4, int *u5, int *u6, int *u7, 749aedaa0e5Sjeremylt int *u8, int *u9, int *u10, int *u11, 750aedaa0e5Sjeremylt int *u12, int *u13, int *u14, int *u15, 751aedaa0e5Sjeremylt int *v, int *v1, int *v2, int *v3, 752aedaa0e5Sjeremylt int *v4, int *v5, int *v6, int *v7, 753aedaa0e5Sjeremylt int *v8, int *v9, int *v10, int *v11, 754aedaa0e5Sjeremylt int *v12, int *v13, int *v14, int *v15, int *err) { 755d7b241e6Sjeremylt CeedQFunction qf_ = CeedQFunction_dict[*qf]; 756aedaa0e5Sjeremylt CeedVector *in; 757d7b241e6Sjeremylt *err = CeedCalloc(16, &in); 758d7b241e6Sjeremylt if (*err) return; 759aedaa0e5Sjeremylt in[0] = *u==FORTRAN_NULL?NULL:CeedVector_dict[*u]; 760aedaa0e5Sjeremylt in[1] = *u1==FORTRAN_NULL?NULL:CeedVector_dict[*u1]; 761aedaa0e5Sjeremylt in[2] = *u2==FORTRAN_NULL?NULL:CeedVector_dict[*u2]; 762aedaa0e5Sjeremylt in[3] = *u3==FORTRAN_NULL?NULL:CeedVector_dict[*u3]; 763aedaa0e5Sjeremylt in[4] = *u4==FORTRAN_NULL?NULL:CeedVector_dict[*u4]; 764aedaa0e5Sjeremylt in[5] = *u5==FORTRAN_NULL?NULL:CeedVector_dict[*u5]; 765aedaa0e5Sjeremylt in[6] = *u6==FORTRAN_NULL?NULL:CeedVector_dict[*u6]; 766aedaa0e5Sjeremylt in[7] = *u7==FORTRAN_NULL?NULL:CeedVector_dict[*u7]; 767aedaa0e5Sjeremylt in[8] = *u8==FORTRAN_NULL?NULL:CeedVector_dict[*u8]; 768aedaa0e5Sjeremylt in[9] = *u9==FORTRAN_NULL?NULL:CeedVector_dict[*u9]; 769aedaa0e5Sjeremylt in[10] = *u10==FORTRAN_NULL?NULL:CeedVector_dict[*u10]; 770aedaa0e5Sjeremylt in[11] = *u11==FORTRAN_NULL?NULL:CeedVector_dict[*u11]; 771aedaa0e5Sjeremylt in[12] = *u12==FORTRAN_NULL?NULL:CeedVector_dict[*u12]; 772aedaa0e5Sjeremylt in[13] = *u13==FORTRAN_NULL?NULL:CeedVector_dict[*u13]; 773aedaa0e5Sjeremylt in[14] = *u14==FORTRAN_NULL?NULL:CeedVector_dict[*u14]; 774aedaa0e5Sjeremylt in[15] = *u15==FORTRAN_NULL?NULL:CeedVector_dict[*u15]; 775aedaa0e5Sjeremylt CeedVector *out; 776d7b241e6Sjeremylt *err = CeedCalloc(16, &out); 777d7b241e6Sjeremylt if (*err) return; 778aedaa0e5Sjeremylt out[0] = *v==FORTRAN_NULL?NULL:CeedVector_dict[*v]; 779aedaa0e5Sjeremylt out[1] = *v1==FORTRAN_NULL?NULL:CeedVector_dict[*v1]; 780aedaa0e5Sjeremylt out[2] = *v2==FORTRAN_NULL?NULL:CeedVector_dict[*v2]; 781aedaa0e5Sjeremylt out[3] = *v3==FORTRAN_NULL?NULL:CeedVector_dict[*v3]; 782aedaa0e5Sjeremylt out[4] = *v4==FORTRAN_NULL?NULL:CeedVector_dict[*v4]; 783aedaa0e5Sjeremylt out[5] = *v5==FORTRAN_NULL?NULL:CeedVector_dict[*v5]; 784aedaa0e5Sjeremylt out[6] = *v6==FORTRAN_NULL?NULL:CeedVector_dict[*v6]; 785aedaa0e5Sjeremylt out[7] = *v7==FORTRAN_NULL?NULL:CeedVector_dict[*v7]; 786aedaa0e5Sjeremylt out[8] = *v8==FORTRAN_NULL?NULL:CeedVector_dict[*v8]; 787aedaa0e5Sjeremylt out[9] = *v9==FORTRAN_NULL?NULL:CeedVector_dict[*v9]; 788aedaa0e5Sjeremylt out[10] = *v10==FORTRAN_NULL?NULL:CeedVector_dict[*v10]; 789aedaa0e5Sjeremylt out[11] = *v11==FORTRAN_NULL?NULL:CeedVector_dict[*v11]; 790aedaa0e5Sjeremylt out[12] = *v12==FORTRAN_NULL?NULL:CeedVector_dict[*v12]; 791aedaa0e5Sjeremylt out[13] = *v13==FORTRAN_NULL?NULL:CeedVector_dict[*v13]; 792aedaa0e5Sjeremylt out[14] = *v14==FORTRAN_NULL?NULL:CeedVector_dict[*v14]; 793aedaa0e5Sjeremylt out[15] = *v15==FORTRAN_NULL?NULL:CeedVector_dict[*v15]; 794aedaa0e5Sjeremylt *err = CeedQFunctionApply(qf_, *Q, in, out); 795d7b241e6Sjeremylt if (*err) return; 796d7b241e6Sjeremylt 797d7b241e6Sjeremylt *err = CeedFree(&in); 798d7b241e6Sjeremylt if (*err) return; 799d7b241e6Sjeremylt *err = CeedFree(&out); 800d7b241e6Sjeremylt } 801d7b241e6Sjeremylt 802d7b241e6Sjeremylt #define fCeedQFunctionDestroy \ 803d7b241e6Sjeremylt FORTRAN_NAME(ceedqfunctiondestroy,CEEDQFUNCTIONDESTROY) 804d7b241e6Sjeremylt void fCeedQFunctionDestroy(int *qf, int *err) { 8051134a487Sjeremylt bool fstatus; 806fd364f38SJeremy L Thompson *err = CeedQFunctionIsFortran(CeedQFunction_dict[*qf], &fstatus); 8071134a487Sjeremylt if (*err) return; 8081134a487Sjeremylt if (fstatus) { 809c4b814baSjeremylt fContext *fctx = CeedQFunction_dict[*qf]->ctx; 810c4b814baSjeremylt *err = CeedFree(&fctx); 811d7b241e6Sjeremylt if (*err) return; 8121134a487Sjeremylt } 813c4b814baSjeremylt 814c4b814baSjeremylt *err = CeedQFunctionDestroy(&CeedQFunction_dict[*qf]); 815c4b814baSjeremylt if (*err) return; 816c4b814baSjeremylt 817d7b241e6Sjeremylt CeedQFunction_n--; 818d7b241e6Sjeremylt if (CeedQFunction_n == 0) { 819d7b241e6Sjeremylt *err = CeedFree(&CeedQFunction_dict); 820d7b241e6Sjeremylt CeedQFunction_count = 0; 821d7b241e6Sjeremylt CeedQFunction_count_max = 0; 822d7b241e6Sjeremylt } 823d7b241e6Sjeremylt } 824d7b241e6Sjeremylt 825d7b241e6Sjeremylt static CeedOperator *CeedOperator_dict = NULL; 826d7b241e6Sjeremylt static int CeedOperator_count = 0; 827d7b241e6Sjeremylt static int CeedOperator_n = 0; 828d7b241e6Sjeremylt static int CeedOperator_count_max = 0; 829d7b241e6Sjeremylt 830d7b241e6Sjeremylt #define fCeedOperatorCreate \ 831d7b241e6Sjeremylt FORTRAN_NAME(ceedoperatorcreate, CEEDOPERATORCREATE) 832d7b241e6Sjeremylt void fCeedOperatorCreate(int *ceed, 833d7b241e6Sjeremylt int *qf, int *dqf, int *dqfT, int *op, int *err) { 834d7b241e6Sjeremylt if (CeedOperator_count == CeedOperator_count_max) 835d7b241e6Sjeremylt CeedOperator_count_max += CeedOperator_count_max/2 + 1, 8368795c945Sjeremylt CeedOperator_dict = realloc(CeedOperator_dict, 8378795c945Sjeremylt sizeof(CeedOperator)*CeedOperator_count_max); 838d7b241e6Sjeremylt 839d7b241e6Sjeremylt CeedOperator *op_ = &CeedOperator_dict[CeedOperator_count]; 840d7b241e6Sjeremylt 841442e7f0bSjeremylt CeedQFunction dqf_ = CEED_QFUNCTION_NONE, dqfT_ = CEED_QFUNCTION_NONE; 842442e7f0bSjeremylt if (*dqf != FORTRAN_QFUNCTION_NONE) dqf_ = CeedQFunction_dict[*dqf ]; 843442e7f0bSjeremylt if (*dqfT != FORTRAN_QFUNCTION_NONE) dqfT_ = CeedQFunction_dict[*dqfT]; 844d7b241e6Sjeremylt 845d7b241e6Sjeremylt *err = CeedOperatorCreate(Ceed_dict[*ceed], CeedQFunction_dict[*qf], dqf_, 846d7b241e6Sjeremylt dqfT_, op_); 847d7b241e6Sjeremylt if (*err) return; 848d7b241e6Sjeremylt *op = CeedOperator_count++; 849d7b241e6Sjeremylt CeedOperator_n++; 850d7b241e6Sjeremylt } 851d7b241e6Sjeremylt 85252d6035fSJeremy L Thompson #define fCeedCompositeOperatorCreate \ 85352d6035fSJeremy L Thompson FORTRAN_NAME(ceedcompositeoperatorcreate, CEEDCOMPOSITEOPERATORCREATE) 85452d6035fSJeremy L Thompson void fCeedCompositeOperatorCreate(int *ceed, int *op, int *err) { 85552d6035fSJeremy L Thompson if (CeedOperator_count == CeedOperator_count_max) 85652d6035fSJeremy L Thompson CeedOperator_count_max += CeedOperator_count_max/2 + 1, 8578795c945Sjeremylt CeedOperator_dict = realloc(CeedOperator_dict, 8588795c945Sjeremylt sizeof(CeedOperator)*CeedOperator_count_max); 85952d6035fSJeremy L Thompson 86052d6035fSJeremy L Thompson CeedOperator *op_ = &CeedOperator_dict[CeedOperator_count]; 86152d6035fSJeremy L Thompson 86252d6035fSJeremy L Thompson *err = CeedCompositeOperatorCreate(Ceed_dict[*ceed], op_); 86352d6035fSJeremy L Thompson if (*err) return; 86452d6035fSJeremy L Thompson *op = CeedOperator_count++; 86552d6035fSJeremy L Thompson CeedOperator_n++; 86652d6035fSJeremy L Thompson } 86752d6035fSJeremy L Thompson 868d7b241e6Sjeremylt #define fCeedOperatorSetField \ 869d7b241e6Sjeremylt FORTRAN_NAME(ceedoperatorsetfield,CEEDOPERATORSETFIELD) 870a8d32208Sjeremylt void fCeedOperatorSetField(int *op, const char *fieldname, int *r, int *b, 871a8d32208Sjeremylt int *v, int *err, fortran_charlen_t fieldname_len) { 872c2ae719dSJed Brown FIX_STRING(fieldname); 873d7b241e6Sjeremylt CeedElemRestriction r_; 874d7b241e6Sjeremylt CeedBasis b_; 875d7b241e6Sjeremylt CeedVector v_; 876d7b241e6Sjeremylt 877d7b241e6Sjeremylt CeedOperator op_ = CeedOperator_dict[*op]; 878d7b241e6Sjeremylt 879d7b241e6Sjeremylt if (*r == FORTRAN_NULL) { 880d7b241e6Sjeremylt r_ = NULL; 88115910d16Sjeremylt } else if (*r == FORTRAN_ELEMRESTRICTION_NONE) { 88215910d16Sjeremylt r_ = CEED_ELEMRESTRICTION_NONE; 883d7b241e6Sjeremylt } else { 884d7b241e6Sjeremylt r_ = CeedElemRestriction_dict[*r]; 885d7b241e6Sjeremylt } 8864dccadb6Sjeremylt 887d7b241e6Sjeremylt if (*b == FORTRAN_NULL) { 888d7b241e6Sjeremylt b_ = NULL; 889783c99b3SValeria Barra } else if (*b == FORTRAN_BASIS_COLLOCATED) { 890783c99b3SValeria Barra b_ = CEED_BASIS_COLLOCATED; 891d7b241e6Sjeremylt } else { 892d7b241e6Sjeremylt b_ = CeedBasis_dict[*b]; 893d7b241e6Sjeremylt } 894d7b241e6Sjeremylt if (*v == FORTRAN_NULL) { 895d7b241e6Sjeremylt v_ = NULL; 896d7b241e6Sjeremylt } else if (*v == FORTRAN_VECTOR_ACTIVE) { 897d7b241e6Sjeremylt v_ = CEED_VECTOR_ACTIVE; 898d7b241e6Sjeremylt } else if (*v == FORTRAN_VECTOR_NONE) { 899d7b241e6Sjeremylt v_ = CEED_VECTOR_NONE; 900d7b241e6Sjeremylt } else { 901d7b241e6Sjeremylt v_ = CeedVector_dict[*v]; 902d7b241e6Sjeremylt } 903d7b241e6Sjeremylt 904a8d32208Sjeremylt *err = CeedOperatorSetField(op_, fieldname_c, r_, b_, v_); 905d7b241e6Sjeremylt } 906d7b241e6Sjeremylt 90752d6035fSJeremy L Thompson #define fCeedCompositeOperatorAddSub \ 90852d6035fSJeremy L Thompson FORTRAN_NAME(ceedcompositeoperatoraddsub, CEEDCOMPOSITEOPERATORADDSUB) 90952d6035fSJeremy L Thompson void fCeedCompositeOperatorAddSub(int *compositeop, int *subop, int *err) { 91052d6035fSJeremy L Thompson CeedOperator compositeop_ = CeedOperator_dict[*compositeop]; 91152d6035fSJeremy L Thompson CeedOperator subop_ = CeedOperator_dict[*subop]; 91252d6035fSJeremy L Thompson 91352d6035fSJeremy L Thompson *err = CeedCompositeOperatorAddSub(compositeop_, subop_); 91452d6035fSJeremy L Thompson if (*err) return; 91552d6035fSJeremy L Thompson } 91652d6035fSJeremy L Thompson 91780ac2e43SJeremy L Thompson #define fCeedOperatorLinearAssembleQFunction FORTRAN_NAME(ceedoperatorlinearassembleqfunction, CEEDOPERATORLINEARASSEMBLEQFUNCTION) 91880ac2e43SJeremy L Thompson void fCeedOperatorLinearAssembleQFunction(int *op, int *assembledvec, 9191d102b48SJeremy L Thompson int *assembledrstr, int *rqst, int *err) { 9201d102b48SJeremy L Thompson // Vector 9211d102b48SJeremy L Thompson if (CeedVector_count == CeedVector_count_max) { 9221d102b48SJeremy L Thompson CeedVector_count_max += CeedVector_count_max/2 + 1; 9231d102b48SJeremy L Thompson CeedRealloc(CeedVector_count_max, &CeedVector_dict); 9241d102b48SJeremy L Thompson } 9251d102b48SJeremy L Thompson CeedVector *assembledvec_ = &CeedVector_dict[CeedVector_count]; 9261d102b48SJeremy L Thompson 9271d102b48SJeremy L Thompson // Restriction 9281d102b48SJeremy L Thompson if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 9291d102b48SJeremy L Thompson CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 9301d102b48SJeremy L Thompson CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 9311d102b48SJeremy L Thompson } 9321d102b48SJeremy L Thompson CeedElemRestriction *rstr_ = 9331d102b48SJeremy L Thompson &CeedElemRestriction_dict[CeedElemRestriction_count]; 9341d102b48SJeremy L Thompson 9351d102b48SJeremy L Thompson int createRequest = 1; 9361d102b48SJeremy L Thompson // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 9371d102b48SJeremy L Thompson if (*rqst == -1 || *rqst == -2) { 9381d102b48SJeremy L Thompson createRequest = 0; 9391d102b48SJeremy L Thompson } 9401d102b48SJeremy L Thompson 9411d102b48SJeremy L Thompson if (createRequest && CeedRequest_count == CeedRequest_count_max) { 9421d102b48SJeremy L Thompson CeedRequest_count_max += CeedRequest_count_max/2 + 1; 9431d102b48SJeremy L Thompson CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 9441d102b48SJeremy L Thompson } 9451d102b48SJeremy L Thompson 9461d102b48SJeremy L Thompson CeedRequest *rqst_; 9471d102b48SJeremy L Thompson if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 9481d102b48SJeremy L Thompson else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 9491d102b48SJeremy L Thompson else rqst_ = &CeedRequest_dict[CeedRequest_count]; 9501d102b48SJeremy L Thompson 95180ac2e43SJeremy L Thompson *err = CeedOperatorLinearAssembleQFunction(CeedOperator_dict[*op], 9521d102b48SJeremy L Thompson assembledvec_, rstr_, rqst_); 9531d102b48SJeremy L Thompson if (*err) return; 9541d102b48SJeremy L Thompson if (createRequest) { 9551d102b48SJeremy L Thompson *rqst = CeedRequest_count++; 9561d102b48SJeremy L Thompson CeedRequest_n++; 9571d102b48SJeremy L Thompson } 9581d102b48SJeremy L Thompson 9591d102b48SJeremy L Thompson if (*err == 0) { 9601d102b48SJeremy L Thompson *assembledrstr = CeedElemRestriction_count++; 9611d102b48SJeremy L Thompson CeedElemRestriction_n++; 9621d102b48SJeremy L Thompson *assembledvec = CeedVector_count++; 9631d102b48SJeremy L Thompson CeedVector_n++; 9641d102b48SJeremy L Thompson } 9651d102b48SJeremy L Thompson } 9661d102b48SJeremy L Thompson 96780ac2e43SJeremy L Thompson #define fCeedOperatorLinearAssembleDiagonal FORTRAN_NAME(ceedoperatorlinearassemblediagonal, CEEDOPERATORLINEARASSEMBLEDIAGONAL) 96880ac2e43SJeremy L Thompson void fCeedOperatorLinearAssembleDiagonal(int *op, int *assembledvec, 969b7ec98d8SJeremy L Thompson int *rqst, int *err) { 970b7ec98d8SJeremy L Thompson int createRequest = 1; 971b7ec98d8SJeremy L Thompson // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 972b7ec98d8SJeremy L Thompson if (*rqst == -1 || *rqst == -2) { 973b7ec98d8SJeremy L Thompson createRequest = 0; 974b7ec98d8SJeremy L Thompson } 975b7ec98d8SJeremy L Thompson 976b7ec98d8SJeremy L Thompson if (createRequest && CeedRequest_count == CeedRequest_count_max) { 977b7ec98d8SJeremy L Thompson CeedRequest_count_max += CeedRequest_count_max/2 + 1; 978b7ec98d8SJeremy L Thompson CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 979b7ec98d8SJeremy L Thompson } 980b7ec98d8SJeremy L Thompson 981b7ec98d8SJeremy L Thompson CeedRequest *rqst_; 982b7ec98d8SJeremy L Thompson if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 983b7ec98d8SJeremy L Thompson else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 984b7ec98d8SJeremy L Thompson else rqst_ = &CeedRequest_dict[CeedRequest_count]; 985b7ec98d8SJeremy L Thompson 98680ac2e43SJeremy L Thompson *err = CeedOperatorLinearAssembleDiagonal(CeedOperator_dict[*op], 9872bba3ffaSJeremy L Thompson CeedVector_dict[*assembledvec], rqst_); 988b7ec98d8SJeremy L Thompson if (*err) return; 989b7ec98d8SJeremy L Thompson if (createRequest) { 990b7ec98d8SJeremy L Thompson *rqst = CeedRequest_count++; 991b7ec98d8SJeremy L Thompson CeedRequest_n++; 992b7ec98d8SJeremy L Thompson } 993b7ec98d8SJeremy L Thompson } 994b7ec98d8SJeremy L Thompson 9952ebaca42Sjeremylt #define fCeedOperatorView \ 9962ebaca42Sjeremylt FORTRAN_NAME(ceedoperatorview,CEEDOPERATORVIEW) 9972ebaca42Sjeremylt void fCeedOperatorView(int *op, int *err) { 9982ebaca42Sjeremylt CeedOperator op_ = CeedOperator_dict[*op]; 9992ebaca42Sjeremylt 10002ebaca42Sjeremylt *err = CeedOperatorView(op_, stdout); 10012ebaca42Sjeremylt } 10022ebaca42Sjeremylt 10033bd813ffSjeremylt #define fCeedOperatorCreateFDMElementInverse FORTRAN_NAME(ceedoperatorcreatefdmelementinverse, CEEDOPERATORCREATEFDMELEMENTINVERSE) 10043bd813ffSjeremylt void fCeedOperatorCreateFDMElementInverse(int *op, int *fdminv, 10053bd813ffSjeremylt int *rqst, int *err) { 10063bd813ffSjeremylt // Operator 10073bd813ffSjeremylt if (CeedOperator_count == CeedOperator_count_max) { 10083bd813ffSjeremylt CeedOperator_count_max += CeedOperator_count_max/2 + 1; 10093bd813ffSjeremylt CeedRealloc(CeedOperator_count_max, &CeedOperator_dict); 10103bd813ffSjeremylt } 10113bd813ffSjeremylt CeedOperator *fdminv_ = 10123bd813ffSjeremylt &CeedOperator_dict[CeedOperator_count]; 10133bd813ffSjeremylt 10143bd813ffSjeremylt int createRequest = 1; 10153bd813ffSjeremylt // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 10163bd813ffSjeremylt if (*rqst == -1 || *rqst == -2) { 10173bd813ffSjeremylt createRequest = 0; 10183bd813ffSjeremylt } 10193bd813ffSjeremylt 10203bd813ffSjeremylt if (createRequest && CeedRequest_count == CeedRequest_count_max) { 10213bd813ffSjeremylt CeedRequest_count_max += CeedRequest_count_max/2 + 1; 10223bd813ffSjeremylt CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 10233bd813ffSjeremylt } 10243bd813ffSjeremylt 10253bd813ffSjeremylt CeedRequest *rqst_; 10263bd813ffSjeremylt if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 10273bd813ffSjeremylt else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 10283bd813ffSjeremylt else rqst_ = &CeedRequest_dict[CeedRequest_count]; 10293bd813ffSjeremylt 10303bd813ffSjeremylt *err = CeedOperatorCreateFDMElementInverse(CeedOperator_dict[*op], 10313bd813ffSjeremylt fdminv_, rqst_); 10323bd813ffSjeremylt if (*err) return; 10333bd813ffSjeremylt if (createRequest) { 10343bd813ffSjeremylt *rqst = CeedRequest_count++; 10353bd813ffSjeremylt CeedRequest_n++; 10363bd813ffSjeremylt } 10373bd813ffSjeremylt 10383bd813ffSjeremylt if (*err == 0) { 10393bd813ffSjeremylt *fdminv = CeedOperator_count++; 10403bd813ffSjeremylt CeedOperator_n++; 10413bd813ffSjeremylt } 10423bd813ffSjeremylt } 10433bd813ffSjeremylt 1044d7b241e6Sjeremylt #define fCeedOperatorApply FORTRAN_NAME(ceedoperatorapply, CEEDOPERATORAPPLY) 1045d7b241e6Sjeremylt void fCeedOperatorApply(int *op, int *ustatevec, 1046d7b241e6Sjeremylt int *resvec, int *rqst, int *err) { 1047e97ff134Sjeremylt CeedVector ustatevec_ = (*ustatevec == FORTRAN_NULL) ? 1048e97ff134Sjeremylt NULL : (*ustatevec == FORTRAN_VECTOR_NONE ? 1049e97ff134Sjeremylt CEED_VECTOR_NONE : CeedVector_dict[*ustatevec]); 1050e97ff134Sjeremylt CeedVector resvec_ = (*resvec == FORTRAN_NULL) ? 1051e97ff134Sjeremylt NULL : (*resvec == FORTRAN_VECTOR_NONE ? 1052e97ff134Sjeremylt CEED_VECTOR_NONE : CeedVector_dict[*resvec]); 1053d7b241e6Sjeremylt 1054d7b241e6Sjeremylt int createRequest = 1; 1055d7b241e6Sjeremylt // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 1056d7b241e6Sjeremylt if (*rqst == -1 || *rqst == -2) { 1057d7b241e6Sjeremylt createRequest = 0; 1058d7b241e6Sjeremylt } 1059d7b241e6Sjeremylt 1060d7b241e6Sjeremylt if (createRequest && CeedRequest_count == CeedRequest_count_max) { 1061d7b241e6Sjeremylt CeedRequest_count_max += CeedRequest_count_max/2 + 1; 1062d7b241e6Sjeremylt CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 1063d7b241e6Sjeremylt } 1064d7b241e6Sjeremylt 1065d7b241e6Sjeremylt CeedRequest *rqst_; 1066d7b241e6Sjeremylt if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 1067d7b241e6Sjeremylt else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 1068d7b241e6Sjeremylt else rqst_ = &CeedRequest_dict[CeedRequest_count]; 1069d7b241e6Sjeremylt 1070d7b241e6Sjeremylt *err = CeedOperatorApply(CeedOperator_dict[*op], 107112bf2c11SJed Brown ustatevec_, resvec_, rqst_); 1072d7b241e6Sjeremylt if (*err) return; 1073d7b241e6Sjeremylt if (createRequest) { 1074d7b241e6Sjeremylt *rqst = CeedRequest_count++; 1075d7b241e6Sjeremylt CeedRequest_n++; 1076d7b241e6Sjeremylt } 1077d7b241e6Sjeremylt } 1078d7b241e6Sjeremylt 1079cae8b89aSjeremylt #define fCeedOperatorApplyAdd FORTRAN_NAME(ceedoperatorapplyadd, CEEDOPERATORAPPLYADD) 1080cae8b89aSjeremylt void fCeedOperatorApplyAdd(int *op, int *ustatevec, 1081cae8b89aSjeremylt int *resvec, int *rqst, int *err) { 1082cae8b89aSjeremylt CeedVector ustatevec_ = *ustatevec == FORTRAN_NULL 1083cae8b89aSjeremylt ? NULL : CeedVector_dict[*ustatevec]; 1084cae8b89aSjeremylt CeedVector resvec_ = *resvec == FORTRAN_NULL 1085cae8b89aSjeremylt ? NULL : CeedVector_dict[*resvec]; 1086cae8b89aSjeremylt 1087cae8b89aSjeremylt int createRequest = 1; 1088cae8b89aSjeremylt // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 1089cae8b89aSjeremylt if (*rqst == -1 || *rqst == -2) { 1090cae8b89aSjeremylt createRequest = 0; 1091cae8b89aSjeremylt } 1092cae8b89aSjeremylt 1093cae8b89aSjeremylt if (createRequest && CeedRequest_count == CeedRequest_count_max) { 1094cae8b89aSjeremylt CeedRequest_count_max += CeedRequest_count_max/2 + 1; 1095cae8b89aSjeremylt CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 1096cae8b89aSjeremylt } 1097cae8b89aSjeremylt 1098cae8b89aSjeremylt CeedRequest *rqst_; 1099cae8b89aSjeremylt if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 1100cae8b89aSjeremylt else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 1101cae8b89aSjeremylt else rqst_ = &CeedRequest_dict[CeedRequest_count]; 1102cae8b89aSjeremylt 1103cae8b89aSjeremylt *err = CeedOperatorApplyAdd(CeedOperator_dict[*op], 1104cae8b89aSjeremylt ustatevec_, resvec_, rqst_); 1105cae8b89aSjeremylt if (*err) return; 1106cae8b89aSjeremylt if (createRequest) { 1107cae8b89aSjeremylt *rqst = CeedRequest_count++; 1108cae8b89aSjeremylt CeedRequest_n++; 1109cae8b89aSjeremylt } 1110cae8b89aSjeremylt } 1111cae8b89aSjeremylt 1112d7b241e6Sjeremylt #define fCeedOperatorApplyJacobian \ 1113d7b241e6Sjeremylt FORTRAN_NAME(ceedoperatorapplyjacobian, CEEDOPERATORAPPLYJACOBIAN) 1114d7b241e6Sjeremylt void fCeedOperatorApplyJacobian(int *op, int *qdatavec, int *ustatevec, 11158795c945Sjeremylt int *dustatevec, int *dresvec, int *rqst, 11168795c945Sjeremylt int *err) { 1117d7b241e6Sjeremylt // TODO Uncomment this when CeedOperatorApplyJacobian is implemented 1118d7b241e6Sjeremylt // *err = CeedOperatorApplyJacobian(CeedOperator_dict[*op], CeedVector_dict[*qdatavec], 1119d7b241e6Sjeremylt // CeedVector_dict[*ustatevec], CeedVector_dict[*dustatevec], 1120d7b241e6Sjeremylt // CeedVector_dict[*dresvec], &CeedRequest_dict[*rqst]); 1121d7b241e6Sjeremylt } 1122d7b241e6Sjeremylt 1123d7b241e6Sjeremylt #define fCeedOperatorDestroy \ 1124d7b241e6Sjeremylt FORTRAN_NAME(ceedoperatordestroy, CEEDOPERATORDESTROY) 1125d7b241e6Sjeremylt void fCeedOperatorDestroy(int *op, int *err) { 1126d7b241e6Sjeremylt *err = CeedOperatorDestroy(&CeedOperator_dict[*op]); 1127d7b241e6Sjeremylt if (*err) return; 1128d7b241e6Sjeremylt CeedOperator_n--; 1129d7b241e6Sjeremylt if (CeedOperator_n == 0) { 1130d7b241e6Sjeremylt *err = CeedFree(&CeedOperator_dict); 1131d7b241e6Sjeremylt CeedOperator_count = 0; 1132d7b241e6Sjeremylt CeedOperator_count_max = 0; 1133d7b241e6Sjeremylt } 1134d7b241e6Sjeremylt } 1135