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 68*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 69*b00b43a6SJeremy L Thompson // Ceed 70*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 71d7b241e6Sjeremylt #define fCeedInit FORTRAN_NAME(ceedinit,CEEDINIT) 72c2ae719dSJed Brown void fCeedInit(const char *resource, int *ceed, int *err, 73c2ae719dSJed Brown fortran_charlen_t resource_len) { 74c2ae719dSJed Brown FIX_STRING(resource); 75d7b241e6Sjeremylt if (Ceed_count == Ceed_count_max) { 76d7b241e6Sjeremylt Ceed_count_max += Ceed_count_max/2 + 1; 77d7b241e6Sjeremylt CeedRealloc(Ceed_count_max, &Ceed_dict); 78d7b241e6Sjeremylt } 79d7b241e6Sjeremylt 80d7b241e6Sjeremylt Ceed *ceed_ = &Ceed_dict[Ceed_count]; 81c2ae719dSJed Brown *err = CeedInit(resource_c, ceed_); 82d7b241e6Sjeremylt 83d7b241e6Sjeremylt if (*err == 0) { 84d7b241e6Sjeremylt *ceed = Ceed_count++; 85d7b241e6Sjeremylt Ceed_n++; 86d7b241e6Sjeremylt } 87d7b241e6Sjeremylt } 88d7b241e6Sjeremylt 899525855cSJeremy L Thompson #define fCeedIsDeterministic \ 909525855cSJeremy L Thompson FORTRAN_NAME(ceedisdeterministic,CEEDISDETERMINISTIC) 919525855cSJeremy L Thompson void fCeedIsDeterministic(int *ceed, int *isDeterministic, int *err) { 929525855cSJeremy L Thompson *err = CeedIsDeterministic(Ceed_dict[*ceed], (bool *)isDeterministic); 939525855cSJeremy L Thompson } 949525855cSJeremy L Thompson 95c907536fSjeremylt #define fCeedGetPreferredMemType \ 96c907536fSjeremylt FORTRAN_NAME(ceedgetpreferredmemtype,CEEDGETPREFERREDMEMTYPE) 97c907536fSjeremylt void fCeedGetPreferredMemType(int *ceed, int *type, int *err) { 98c907536fSjeremylt *err = CeedGetPreferredMemType(Ceed_dict[*ceed], (CeedMemType *)type); 99c907536fSjeremylt } 100c907536fSjeremylt 1010a0da059Sjeremylt #define fCeedView FORTRAN_NAME(ceedview,CEEDVIEW) 1020a0da059Sjeremylt void fCeedView(int *ceed, int *err) { 1030a0da059Sjeremylt *err = CeedView(Ceed_dict[*ceed], stdout); 1040a0da059Sjeremylt } 1050a0da059Sjeremylt 106d7b241e6Sjeremylt #define fCeedDestroy FORTRAN_NAME(ceeddestroy,CEEDDESTROY) 107d7b241e6Sjeremylt void fCeedDestroy(int *ceed, int *err) { 108c8f84b03SJeremy L Thompson if (Ceed_n == 0 || !Ceed_dict[*ceed]) return; 109d7b241e6Sjeremylt *err = CeedDestroy(&Ceed_dict[*ceed]); 110d7b241e6Sjeremylt 111d7b241e6Sjeremylt if (*err == 0) { 112d7b241e6Sjeremylt Ceed_n--; 113d7b241e6Sjeremylt if (Ceed_n == 0) { 114d7b241e6Sjeremylt CeedFree(&Ceed_dict); 115d7b241e6Sjeremylt Ceed_count = 0; 116d7b241e6Sjeremylt Ceed_count_max = 0; 117d7b241e6Sjeremylt } 118d7b241e6Sjeremylt } 119d7b241e6Sjeremylt } 120d7b241e6Sjeremylt 121*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 122*b00b43a6SJeremy L Thompson // CeedVector 123*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 124d7b241e6Sjeremylt static CeedVector *CeedVector_dict = NULL; 125d7b241e6Sjeremylt static int CeedVector_count = 0; 126d7b241e6Sjeremylt static int CeedVector_n = 0; 127d7b241e6Sjeremylt static int CeedVector_count_max = 0; 128d7b241e6Sjeremylt 129d7b241e6Sjeremylt #define fCeedVectorCreate FORTRAN_NAME(ceedvectorcreate,CEEDVECTORCREATE) 130d7b241e6Sjeremylt void fCeedVectorCreate(int *ceed, int *length, int *vec, int *err) { 131d7b241e6Sjeremylt if (CeedVector_count == CeedVector_count_max) { 132d7b241e6Sjeremylt CeedVector_count_max += CeedVector_count_max/2 + 1; 133d7b241e6Sjeremylt CeedRealloc(CeedVector_count_max, &CeedVector_dict); 134d7b241e6Sjeremylt } 135d7b241e6Sjeremylt 136d7b241e6Sjeremylt CeedVector *vec_ = &CeedVector_dict[CeedVector_count]; 137d7b241e6Sjeremylt *err = CeedVectorCreate(Ceed_dict[*ceed], *length, vec_); 138d7b241e6Sjeremylt 139d7b241e6Sjeremylt if (*err == 0) { 140d7b241e6Sjeremylt *vec = CeedVector_count++; 141d7b241e6Sjeremylt CeedVector_n++; 142d7b241e6Sjeremylt } 143d7b241e6Sjeremylt } 144d7b241e6Sjeremylt 145d7b241e6Sjeremylt #define fCeedVectorSetArray FORTRAN_NAME(ceedvectorsetarray,CEEDVECTORSETARRAY) 146d7b241e6Sjeremylt void fCeedVectorSetArray(int *vec, int *memtype, int *copymode, 147c8b9fe72Sjeremylt CeedScalar *array, int64_t *offset, int *err) { 148399bb197SJed Brown *err = CeedVectorSetArray(CeedVector_dict[*vec], (CeedMemType)*memtype, 149399bb197SJed Brown (CeedCopyMode)*copymode, 150c8b9fe72Sjeremylt (CeedScalar *)(array + *offset)); 151d7b241e6Sjeremylt } 152d7b241e6Sjeremylt 1536a6c615bSJeremy L Thompson #define fCeedVectorTakeArray FORTRAN_NAME(ceedvectortakearray,CEEDVECTORTAKEARRAY) 1546a6c615bSJeremy L Thompson void fCeedVectorTakeArray(int *vec, int *memtype, CeedScalar *array, 1556a6c615bSJeremy L Thompson int64_t *offset, int *err) { 1566a6c615bSJeremy L Thompson CeedScalar *b; 1576a6c615bSJeremy L Thompson CeedVector vec_ = CeedVector_dict[*vec]; 1586a6c615bSJeremy L Thompson *err = CeedVectorTakeArray(vec_, (CeedMemType)*memtype, &b); 1596a6c615bSJeremy L Thompson *offset = b - array; 1606a6c615bSJeremy L Thompson } 1616a6c615bSJeremy L Thompson 16254540941SJeremy L Thompson #define fCeedVectorSyncArray FORTRAN_NAME(ceedvectorsyncarray,CEEDVECTORSYNCARRAY) 16354540941SJeremy L Thompson void fCeedVectorSyncArray(int *vec, int *memtype, int *err) { 164399bb197SJed Brown *err = CeedVectorSyncArray(CeedVector_dict[*vec], (CeedMemType)*memtype); 16554540941SJeremy L Thompson } 16654540941SJeremy L Thompson 167d7b241e6Sjeremylt #define fCeedVectorSetValue FORTRAN_NAME(ceedvectorsetvalue,CEEDVECTORSETVALUE) 168d7b241e6Sjeremylt void fCeedVectorSetValue(int *vec, CeedScalar *value, int *err) { 169d7b241e6Sjeremylt *err = CeedVectorSetValue(CeedVector_dict[*vec], *value); 170d7b241e6Sjeremylt } 171d7b241e6Sjeremylt 172d7b241e6Sjeremylt #define fCeedVectorGetArray FORTRAN_NAME(ceedvectorgetarray,CEEDVECTORGETARRAY) 173a8de75f0Sjeremylt void fCeedVectorGetArray(int *vec, int *memtype, CeedScalar *array, 1746a6c615bSJeremy L Thompson int64_t *offset, int *err) { 175d7b241e6Sjeremylt CeedScalar *b; 176d7b241e6Sjeremylt CeedVector vec_ = CeedVector_dict[*vec]; 177399bb197SJed Brown *err = CeedVectorGetArray(vec_, (CeedMemType)*memtype, &b); 178cbfd6a90SThilina Rathnayake *offset = b - array; 179d7b241e6Sjeremylt } 180d7b241e6Sjeremylt 181d7b241e6Sjeremylt #define fCeedVectorGetArrayRead \ 182d7b241e6Sjeremylt FORTRAN_NAME(ceedvectorgetarrayread,CEEDVECTORGETARRAYREAD) 183d7b241e6Sjeremylt void fCeedVectorGetArrayRead(int *vec, int *memtype, CeedScalar *array, 1843334379fSJed Brown int64_t *offset, int *err) { 185d7b241e6Sjeremylt const CeedScalar *b; 186d7b241e6Sjeremylt CeedVector vec_ = CeedVector_dict[*vec]; 187399bb197SJed Brown *err = CeedVectorGetArrayRead(vec_, (CeedMemType)*memtype, &b); 188cbfd6a90SThilina Rathnayake *offset = b - array; 189d7b241e6Sjeremylt } 190d7b241e6Sjeremylt 191d7b241e6Sjeremylt #define fCeedVectorRestoreArray \ 192d7b241e6Sjeremylt FORTRAN_NAME(ceedvectorrestorearray,CEEDVECTORRESTOREARRAY) 1936456524eSJed Brown void fCeedVectorRestoreArray(int *vec, CeedScalar *array, 1946456524eSJed Brown int64_t *offset, int *err) { 195d7b241e6Sjeremylt *err = CeedVectorRestoreArray(CeedVector_dict[*vec], &array); 1966456524eSJed Brown *offset = 0; 197d7b241e6Sjeremylt } 198d7b241e6Sjeremylt 199d7b241e6Sjeremylt #define fCeedVectorRestoreArrayRead \ 200d7b241e6Sjeremylt FORTRAN_NAME(ceedvectorrestorearrayread,CEEDVECTORRESTOREARRAYREAD) 2016456524eSJed Brown void fCeedVectorRestoreArrayRead(int *vec, const CeedScalar *array, 2026456524eSJed Brown int64_t *offset, int *err) { 203d7b241e6Sjeremylt *err = CeedVectorRestoreArrayRead(CeedVector_dict[*vec], &array); 2046456524eSJed Brown *offset = 0; 205d7b241e6Sjeremylt } 206d7b241e6Sjeremylt 207547d9b97Sjeremylt #define fCeedVectorNorm \ 208547d9b97Sjeremylt FORTRAN_NAME(ceedvectornorm,CEEDVECTORNORM) 209547d9b97Sjeremylt void fCeedVectorNorm(int *vec, int *type, CeedScalar *norm, int *err) { 210399bb197SJed Brown *err = CeedVectorNorm(CeedVector_dict[*vec], (CeedNormType)*type, norm); 211547d9b97Sjeremylt } 212547d9b97Sjeremylt 213d7b241e6Sjeremylt #define fCeedVectorView FORTRAN_NAME(ceedvectorview,CEEDVECTORVIEW) 214d7b241e6Sjeremylt void fCeedVectorView(int *vec, int *err) { 215d7b241e6Sjeremylt *err = CeedVectorView(CeedVector_dict[*vec], "%12.8f", stdout); 216d7b241e6Sjeremylt } 217d7b241e6Sjeremylt 218d7b241e6Sjeremylt #define fCeedVectorDestroy FORTRAN_NAME(ceedvectordestroy,CEEDVECTORDESTROY) 219d7b241e6Sjeremylt void fCeedVectorDestroy(int *vec, int *err) { 220c8f84b03SJeremy L Thompson if (CeedVector_n == 0 || !CeedVector_dict[*vec]) return; 221d7b241e6Sjeremylt *err = CeedVectorDestroy(&CeedVector_dict[*vec]); 222d7b241e6Sjeremylt 223d7b241e6Sjeremylt if (*err == 0) { 224d7b241e6Sjeremylt CeedVector_n--; 225d7b241e6Sjeremylt if (CeedVector_n == 0) { 226d7b241e6Sjeremylt CeedFree(&CeedVector_dict); 227d7b241e6Sjeremylt CeedVector_count = 0; 228d7b241e6Sjeremylt CeedVector_count_max = 0; 229d7b241e6Sjeremylt } 230d7b241e6Sjeremylt } 231d7b241e6Sjeremylt } 232d7b241e6Sjeremylt 233*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 234*b00b43a6SJeremy L Thompson // CeedElemRestriction 235*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 236d7b241e6Sjeremylt static CeedElemRestriction *CeedElemRestriction_dict = NULL; 237d7b241e6Sjeremylt static int CeedElemRestriction_count = 0; 238d7b241e6Sjeremylt static int CeedElemRestriction_n = 0; 239d7b241e6Sjeremylt static int CeedElemRestriction_count_max = 0; 240d7b241e6Sjeremylt 241d7b241e6Sjeremylt #define fCeedElemRestrictionCreate \ 242d7b241e6Sjeremylt FORTRAN_NAME(ceedelemrestrictioncreate, CEEDELEMRESTRICTIONCREATE) 243d979a051Sjeremylt void fCeedElemRestrictionCreate(int *ceed, int *nelements, int *esize, 244d979a051Sjeremylt int *ncomp, int *compstride, int *lsize, 245d979a051Sjeremylt int *memtype, int *copymode, const int *offsets, 2468795c945Sjeremylt int *elemrestriction, int *err) { 247d7b241e6Sjeremylt if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 248d7b241e6Sjeremylt CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 249d7b241e6Sjeremylt CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 250d7b241e6Sjeremylt } 251d7b241e6Sjeremylt 252d979a051Sjeremylt const int *offsets_ = offsets; 253d7b241e6Sjeremylt 254d7b241e6Sjeremylt CeedElemRestriction *elemrestriction_ = 255d7b241e6Sjeremylt &CeedElemRestriction_dict[CeedElemRestriction_count]; 256d979a051Sjeremylt *err = CeedElemRestrictionCreate(Ceed_dict[*ceed], *nelements, *esize, 257d979a051Sjeremylt *ncomp, *compstride, *lsize, 258d979a051Sjeremylt (CeedMemType)*memtype, 259d979a051Sjeremylt (CeedCopyMode)*copymode, offsets_, 260d979a051Sjeremylt elemrestriction_); 261d7b241e6Sjeremylt 262d7b241e6Sjeremylt if (*err == 0) { 263d7b241e6Sjeremylt *elemrestriction = CeedElemRestriction_count++; 264d7b241e6Sjeremylt CeedElemRestriction_n++; 265d7b241e6Sjeremylt } 266d7b241e6Sjeremylt } 267d7b241e6Sjeremylt 2687509a596Sjeremylt #define fCeedElemRestrictionCreateStrided \ 2697509a596Sjeremylt FORTRAN_NAME(ceedelemrestrictioncreatestrided, CEEDELEMRESTRICTIONCREATESTRIDED) 2707509a596Sjeremylt void fCeedElemRestrictionCreateStrided(int *ceed, int *nelements, int *esize, 271d979a051Sjeremylt int *ncomp, int *lsize, int *strides, 272d7b241e6Sjeremylt int *elemrestriction, int *err) { 273d7b241e6Sjeremylt if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 274d7b241e6Sjeremylt CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 275d7b241e6Sjeremylt CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 276d7b241e6Sjeremylt } 277d7b241e6Sjeremylt 278d7b241e6Sjeremylt CeedElemRestriction *elemrestriction_ = 279d7b241e6Sjeremylt &CeedElemRestriction_dict[CeedElemRestriction_count]; 2807509a596Sjeremylt *err = CeedElemRestrictionCreateStrided(Ceed_dict[*ceed], *nelements, *esize, 281d979a051Sjeremylt *ncomp, *lsize, 282d979a051Sjeremylt *strides == FORTRAN_STRIDES_BACKEND ? 283d979a051Sjeremylt CEED_STRIDES_BACKEND : strides, 284523b8ea0Sjeremylt elemrestriction_); 285d7b241e6Sjeremylt if (*err == 0) { 286d7b241e6Sjeremylt *elemrestriction = CeedElemRestriction_count++; 287d7b241e6Sjeremylt CeedElemRestriction_n++; 288d7b241e6Sjeremylt } 289d7b241e6Sjeremylt } 290d7b241e6Sjeremylt 291d7b241e6Sjeremylt #define fCeedElemRestrictionCreateBlocked \ 292d7b241e6Sjeremylt FORTRAN_NAME(ceedelemrestrictioncreateblocked,CEEDELEMRESTRICTIONCREATEBLOCKED) 293d979a051Sjeremylt void fCeedElemRestrictionCreateBlocked(int *ceed, int *nelements, int *esize, 294d979a051Sjeremylt int *blocksize, int *ncomp, 295d979a051Sjeremylt int *compstride, int *lsize, 296d979a051Sjeremylt int *mtype, int *cmode, 2978795c945Sjeremylt int *blkindices, int *elemrestriction, 2988795c945Sjeremylt int *err) { 299d7b241e6Sjeremylt 300d7b241e6Sjeremylt if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 301d7b241e6Sjeremylt CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 302d7b241e6Sjeremylt CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 303d7b241e6Sjeremylt } 304d7b241e6Sjeremylt 305d7b241e6Sjeremylt CeedElemRestriction *elemrestriction_ = 306d7b241e6Sjeremylt &CeedElemRestriction_dict[CeedElemRestriction_count]; 307399bb197SJed Brown *err = CeedElemRestrictionCreateBlocked(Ceed_dict[*ceed], 308d979a051Sjeremylt *nelements, *esize, *blocksize, 309d979a051Sjeremylt *ncomp, *compstride, *lsize, 310d979a051Sjeremylt (CeedMemType)*mtype, 311d979a051Sjeremylt (CeedCopyMode)*cmode, blkindices, 312a8d32208Sjeremylt elemrestriction_); 313d7b241e6Sjeremylt 314d7b241e6Sjeremylt if (*err == 0) { 315d7b241e6Sjeremylt *elemrestriction = CeedElemRestriction_count++; 316d7b241e6Sjeremylt CeedElemRestriction_n++; 317d7b241e6Sjeremylt } 318d7b241e6Sjeremylt } 319d7b241e6Sjeremylt 3207509a596Sjeremylt #define fCeedElemRestrictionCreateBlockedStrided \ 3217509a596Sjeremylt FORTRAN_NAME(ceedelemrestrictioncreateblockedstrided, CEEDELEMRESTRICTIONCREATEBLOCKEDSTRIDED) 3227509a596Sjeremylt void fCeedElemRestrictionCreateBlockedStrided(int *ceed, int *nelements, 323d979a051Sjeremylt int *esize, int *blksize, int *ncomp, int *lsize, int *strides, 3247509a596Sjeremylt int *elemrestriction, int *err) { 3257509a596Sjeremylt if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 3267509a596Sjeremylt CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 3277509a596Sjeremylt CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 3287509a596Sjeremylt } 3297509a596Sjeremylt 3307509a596Sjeremylt CeedElemRestriction *elemrestriction_ = 3317509a596Sjeremylt &CeedElemRestriction_dict[CeedElemRestriction_count]; 3327509a596Sjeremylt *err = CeedElemRestrictionCreateBlockedStrided(Ceed_dict[*ceed], *nelements, 333d979a051Sjeremylt *esize, *blksize, *ncomp, *lsize, strides, elemrestriction_); 3347509a596Sjeremylt if (*err == 0) { 3357509a596Sjeremylt *elemrestriction = CeedElemRestriction_count++; 3367509a596Sjeremylt CeedElemRestriction_n++; 3377509a596Sjeremylt } 3387509a596Sjeremylt } 3397509a596Sjeremylt 340d7b241e6Sjeremylt static CeedRequest *CeedRequest_dict = NULL; 341d7b241e6Sjeremylt static int CeedRequest_count = 0; 342d7b241e6Sjeremylt static int CeedRequest_n = 0; 343d7b241e6Sjeremylt static int CeedRequest_count_max = 0; 344d7b241e6Sjeremylt 345d7b241e6Sjeremylt #define fCeedElemRestrictionApply \ 346d7b241e6Sjeremylt FORTRAN_NAME(ceedelemrestrictionapply,CEEDELEMRESTRICTIONAPPLY) 347a8d32208Sjeremylt void fCeedElemRestrictionApply(int *elemr, int *tmode, int *uvec, int *ruvec, 348a8d32208Sjeremylt int *rqst, int *err) { 349d7b241e6Sjeremylt int createRequest = 1; 350d7b241e6Sjeremylt // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 351d7b241e6Sjeremylt if (*rqst == FORTRAN_REQUEST_IMMEDIATE || *rqst == FORTRAN_REQUEST_ORDERED) 352d7b241e6Sjeremylt createRequest = 0; 353d7b241e6Sjeremylt 354d7b241e6Sjeremylt if (createRequest && CeedRequest_count == CeedRequest_count_max) { 355d7b241e6Sjeremylt CeedRequest_count_max += CeedRequest_count_max/2 + 1; 356d7b241e6Sjeremylt CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 357d7b241e6Sjeremylt } 358d7b241e6Sjeremylt 359d7b241e6Sjeremylt CeedRequest *rqst_; 360d7b241e6Sjeremylt if (*rqst == FORTRAN_REQUEST_IMMEDIATE) rqst_ = CEED_REQUEST_IMMEDIATE; 361d7b241e6Sjeremylt else if (*rqst == FORTRAN_REQUEST_ORDERED ) rqst_ = CEED_REQUEST_ORDERED; 362d7b241e6Sjeremylt else rqst_ = &CeedRequest_dict[CeedRequest_count]; 363d7b241e6Sjeremylt 364399bb197SJed Brown *err = CeedElemRestrictionApply(CeedElemRestriction_dict[*elemr], 365399bb197SJed Brown (CeedTransposeMode)*tmode, 366a8d32208Sjeremylt CeedVector_dict[*uvec], 3678795c945Sjeremylt CeedVector_dict[*ruvec], rqst_); 368d7b241e6Sjeremylt 369d7b241e6Sjeremylt if (*err == 0 && createRequest) { 370d7b241e6Sjeremylt *rqst = CeedRequest_count++; 371d7b241e6Sjeremylt CeedRequest_n++; 372d7b241e6Sjeremylt } 373d7b241e6Sjeremylt } 374d7b241e6Sjeremylt 375be9261b7Sjeremylt #define fCeedElemRestrictionApplyBlock \ 376be9261b7Sjeremylt FORTRAN_NAME(ceedelemrestrictionapplyblock,CEEDELEMRESTRICTIONAPPLYBLOCK) 377f90c8643Sjeremylt void fCeedElemRestrictionApplyBlock(int *elemr, int *block, int *tmode, 378be9261b7Sjeremylt int *uvec, int *ruvec, int *rqst, int *err) { 379be9261b7Sjeremylt int createRequest = 1; 380be9261b7Sjeremylt // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 381be9261b7Sjeremylt if (*rqst == FORTRAN_REQUEST_IMMEDIATE || *rqst == FORTRAN_REQUEST_ORDERED) 382be9261b7Sjeremylt createRequest = 0; 383be9261b7Sjeremylt 384be9261b7Sjeremylt if (createRequest && CeedRequest_count == CeedRequest_count_max) { 385be9261b7Sjeremylt CeedRequest_count_max += CeedRequest_count_max/2 + 1; 386be9261b7Sjeremylt CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 387be9261b7Sjeremylt } 388be9261b7Sjeremylt 389be9261b7Sjeremylt CeedRequest *rqst_; 390be9261b7Sjeremylt if (*rqst == FORTRAN_REQUEST_IMMEDIATE) rqst_ = CEED_REQUEST_IMMEDIATE; 391be9261b7Sjeremylt else if (*rqst == FORTRAN_REQUEST_ORDERED ) rqst_ = CEED_REQUEST_ORDERED; 392be9261b7Sjeremylt else rqst_ = &CeedRequest_dict[CeedRequest_count]; 393be9261b7Sjeremylt 394be9261b7Sjeremylt *err = CeedElemRestrictionApplyBlock(CeedElemRestriction_dict[*elemr], *block, 395399bb197SJed Brown (CeedTransposeMode)*tmode, CeedVector_dict[*uvec], 396be9261b7Sjeremylt CeedVector_dict[*ruvec], rqst_); 397be9261b7Sjeremylt 398be9261b7Sjeremylt if (*err == 0 && createRequest) { 399be9261b7Sjeremylt *rqst = CeedRequest_count++; 400be9261b7Sjeremylt CeedRequest_n++; 401be9261b7Sjeremylt } 402be9261b7Sjeremylt } 403be9261b7Sjeremylt 4041469ee4dSjeremylt #define fCeedElemRestrictionGetMultiplicity \ 4051469ee4dSjeremylt FORTRAN_NAME(ceedelemrestrictiongetmultiplicity,CEEDELEMRESTRICTIONGETMULTIPLICITY) 406a8d32208Sjeremylt void fCeedElemRestrictionGetMultiplicity(int *elemr, int *mult, int *err) { 4071469ee4dSjeremylt *err = CeedElemRestrictionGetMultiplicity(CeedElemRestriction_dict[*elemr], 408a8d32208Sjeremylt CeedVector_dict[*mult]); 4091469ee4dSjeremylt } 4101469ee4dSjeremylt 41149fd234cSJeremy L Thompson #define fCeedElemRestrictionGetELayout \ 41249fd234cSJeremy L Thompson FORTRAN_NAME(ceedelemrestrictiongetelayout,CEEDELEMRESTRICTIONGETELAYOUT) 41349fd234cSJeremy L Thompson void fCeedElemRestrictionGetELayout(int *elemr, int *layout, int *err) { 41449fd234cSJeremy L Thompson CeedInt layout_c[3]; 41549fd234cSJeremy L Thompson *err = CeedElemRestrictionGetELayout(CeedElemRestriction_dict[*elemr], 41649fd234cSJeremy L Thompson &layout_c); 41749fd234cSJeremy L Thompson for (int i=0; i<3; i++) 41849fd234cSJeremy L Thompson layout[i] = layout_c[i]; 41949fd234cSJeremy L Thompson } 42049fd234cSJeremy L Thompson 4215a86f033Sjeremylt #define fCeedElemRestrictionView \ 4225a86f033Sjeremylt FORTRAN_NAME(ceedelemrestrictionview,CEEDELEMRESTRICTIONVIEW) 4235a86f033Sjeremylt void fCeedElemRestrictionView(int *elemr, int *err) { 4245a86f033Sjeremylt *err = CeedElemRestrictionView(CeedElemRestriction_dict[*elemr], stdout); 4255a86f033Sjeremylt } 4261469ee4dSjeremylt 427d7b241e6Sjeremylt #define fCeedRequestWait FORTRAN_NAME(ceedrequestwait, CEEDREQUESTWAIT) 428d7b241e6Sjeremylt void fCeedRequestWait(int *rqst, int *err) { 429d7b241e6Sjeremylt // TODO Uncomment this once CeedRequestWait is implemented 430d7b241e6Sjeremylt //*err = CeedRequestWait(&CeedRequest_dict[*rqst]); 431d7b241e6Sjeremylt 432d7b241e6Sjeremylt if (*err == 0) { 433d7b241e6Sjeremylt CeedRequest_n--; 434d7b241e6Sjeremylt if (CeedRequest_n == 0) { 435d7b241e6Sjeremylt CeedFree(&CeedRequest_dict); 436d7b241e6Sjeremylt CeedRequest_count = 0; 437d7b241e6Sjeremylt CeedRequest_count_max = 0; 438d7b241e6Sjeremylt } 439d7b241e6Sjeremylt } 440d7b241e6Sjeremylt } 441d7b241e6Sjeremylt 442d7b241e6Sjeremylt #define fCeedElemRestrictionDestroy \ 443d7b241e6Sjeremylt FORTRAN_NAME(ceedelemrestrictiondestroy,CEEDELEMRESTRICTIONDESTROY) 444d7b241e6Sjeremylt void fCeedElemRestrictionDestroy(int *elem, int *err) { 445c8f84b03SJeremy L Thompson if (CeedElemRestriction_n == 0 || !CeedElemRestriction_dict[*elem]) return; 446d7b241e6Sjeremylt *err = CeedElemRestrictionDestroy(&CeedElemRestriction_dict[*elem]); 447d7b241e6Sjeremylt 448d7b241e6Sjeremylt if (*err == 0) { 449d7b241e6Sjeremylt CeedElemRestriction_n--; 450d7b241e6Sjeremylt if (CeedElemRestriction_n == 0) { 451d7b241e6Sjeremylt CeedFree(&CeedElemRestriction_dict); 452d7b241e6Sjeremylt CeedElemRestriction_count = 0; 453d7b241e6Sjeremylt CeedElemRestriction_count_max = 0; 454d7b241e6Sjeremylt } 455d7b241e6Sjeremylt } 456d7b241e6Sjeremylt } 457d7b241e6Sjeremylt 458*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 459*b00b43a6SJeremy L Thompson // CeedBasis 460*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 461d7b241e6Sjeremylt static CeedBasis *CeedBasis_dict = NULL; 462d7b241e6Sjeremylt static int CeedBasis_count = 0; 463d7b241e6Sjeremylt static int CeedBasis_n = 0; 464d7b241e6Sjeremylt static int CeedBasis_count_max = 0; 465d7b241e6Sjeremylt 466d7b241e6Sjeremylt #define fCeedBasisCreateTensorH1Lagrange \ 467d7b241e6Sjeremylt FORTRAN_NAME(ceedbasiscreatetensorh1lagrange, CEEDBASISCREATETENSORH1LAGRANGE) 468d7b241e6Sjeremylt void fCeedBasisCreateTensorH1Lagrange(int *ceed, int *dim, 4698795c945Sjeremylt int *ncomp, int *P, int *Q, int *quadmode, 4708795c945Sjeremylt int *basis, int *err) { 471d7b241e6Sjeremylt if (CeedBasis_count == CeedBasis_count_max) { 472d7b241e6Sjeremylt CeedBasis_count_max += CeedBasis_count_max/2 + 1; 473d7b241e6Sjeremylt CeedRealloc(CeedBasis_count_max, &CeedBasis_dict); 474d7b241e6Sjeremylt } 475d7b241e6Sjeremylt 476a8de75f0Sjeremylt *err = CeedBasisCreateTensorH1Lagrange(Ceed_dict[*ceed], *dim, *ncomp, *P, *Q, 477399bb197SJed Brown (CeedQuadMode)*quadmode, 4788795c945Sjeremylt &CeedBasis_dict[CeedBasis_count]); 479d7b241e6Sjeremylt 480d7b241e6Sjeremylt if (*err == 0) { 481d7b241e6Sjeremylt *basis = CeedBasis_count++; 482d7b241e6Sjeremylt CeedBasis_n++; 483d7b241e6Sjeremylt } 484d7b241e6Sjeremylt } 485d7b241e6Sjeremylt 486d7b241e6Sjeremylt #define fCeedBasisCreateTensorH1 \ 487d7b241e6Sjeremylt FORTRAN_NAME(ceedbasiscreatetensorh1, CEEDBASISCREATETENSORH1) 488a8de75f0Sjeremylt void fCeedBasisCreateTensorH1(int *ceed, int *dim, int *ncomp, int *P1d, 4898795c945Sjeremylt int *Q1d, const CeedScalar *interp1d, 4908795c945Sjeremylt const CeedScalar *grad1d, 4918795c945Sjeremylt const CeedScalar *qref1d, 4928795c945Sjeremylt const CeedScalar *qweight1d, int *basis, 4938795c945Sjeremylt int *err) { 494d7b241e6Sjeremylt if (CeedBasis_count == CeedBasis_count_max) { 495d7b241e6Sjeremylt CeedBasis_count_max += CeedBasis_count_max/2 + 1; 496d7b241e6Sjeremylt CeedRealloc(CeedBasis_count_max, &CeedBasis_dict); 497d7b241e6Sjeremylt } 498d7b241e6Sjeremylt 499a8de75f0Sjeremylt *err = CeedBasisCreateTensorH1(Ceed_dict[*ceed], *dim, *ncomp, *P1d, *Q1d, 5008795c945Sjeremylt interp1d, grad1d, qref1d, qweight1d, 5018795c945Sjeremylt &CeedBasis_dict[CeedBasis_count]); 502d7b241e6Sjeremylt 503d7b241e6Sjeremylt if (*err == 0) { 504d7b241e6Sjeremylt *basis = CeedBasis_count++; 505d7b241e6Sjeremylt CeedBasis_n++; 506d7b241e6Sjeremylt } 507d7b241e6Sjeremylt } 508d7b241e6Sjeremylt 509a8de75f0Sjeremylt #define fCeedBasisCreateH1 \ 510a8de75f0Sjeremylt FORTRAN_NAME(ceedbasiscreateh1, CEEDBASISCREATEH1) 5118795c945Sjeremylt void fCeedBasisCreateH1(int *ceed, int *topo, int *ncomp, int *nnodes, 5128795c945Sjeremylt int *nqpts, const CeedScalar *interp, 5138795c945Sjeremylt const CeedScalar *grad, const CeedScalar *qref, 5148795c945Sjeremylt const CeedScalar *qweight, int *basis, int *err) { 515a8de75f0Sjeremylt if (CeedBasis_count == CeedBasis_count_max) { 516a8de75f0Sjeremylt CeedBasis_count_max += CeedBasis_count_max/2 + 1; 517a8de75f0Sjeremylt CeedRealloc(CeedBasis_count_max, &CeedBasis_dict); 518a8de75f0Sjeremylt } 519a8de75f0Sjeremylt 520399bb197SJed Brown *err = CeedBasisCreateH1(Ceed_dict[*ceed], (CeedElemTopology)*topo, *ncomp, 521399bb197SJed Brown *nnodes, *nqpts, interp, grad, qref, qweight, 5228795c945Sjeremylt &CeedBasis_dict[CeedBasis_count]); 523a8de75f0Sjeremylt 524a8de75f0Sjeremylt if (*err == 0) { 525a8de75f0Sjeremylt *basis = CeedBasis_count++; 526a8de75f0Sjeremylt CeedBasis_n++; 527a8de75f0Sjeremylt } 528a8de75f0Sjeremylt } 529a8de75f0Sjeremylt 530d7b241e6Sjeremylt #define fCeedBasisView FORTRAN_NAME(ceedbasisview, CEEDBASISVIEW) 531d7b241e6Sjeremylt void fCeedBasisView(int *basis, int *err) { 532d7b241e6Sjeremylt *err = CeedBasisView(CeedBasis_dict[*basis], stdout); 533d7b241e6Sjeremylt } 534d7b241e6Sjeremylt 535d7b241e6Sjeremylt #define fCeedQRFactorization \ 536d7b241e6Sjeremylt FORTRAN_NAME(ceedqrfactorization, CEEDQRFACTORIZATION) 537a7bd39daSjeremylt void fCeedQRFactorization(int *ceed, CeedScalar *mat, CeedScalar *tau, int *m, 538a7bd39daSjeremylt int *n, int *err) { 539a7bd39daSjeremylt *err = CeedQRFactorization(Ceed_dict[*ceed], mat, tau, *m, *n); 540d7b241e6Sjeremylt } 541d7b241e6Sjeremylt 54252bfb9bbSJeremy L Thompson #define fCeedSymmetricSchurDecomposition \ 54352bfb9bbSJeremy L Thompson FORTRAN_NAME(ceedsymmetricschurdecomposition, CEEDSYMMETRICSCHURDECOMPOSITION) 54452bfb9bbSJeremy L Thompson void fCeedSymmetricSchurDecomposition(int *ceed, CeedScalar *mat, 54552bfb9bbSJeremy L Thompson CeedScalar *lambda, int *n, int *err) { 54652bfb9bbSJeremy L Thompson *err = CeedSymmetricSchurDecomposition(Ceed_dict[*ceed], mat, lambda, *n); 54752bfb9bbSJeremy L Thompson } 54852bfb9bbSJeremy L Thompson 54952bfb9bbSJeremy L Thompson #define fCeedSimultaneousDiagonalization \ 55052bfb9bbSJeremy L Thompson FORTRAN_NAME(ceedsimultaneousdiagonalization, CEEDSIMULTANEOUSDIAGONALIZATION) 55152bfb9bbSJeremy L Thompson void fCeedSimultaneousDiagonalization(int *ceed, CeedScalar *matA, 55252bfb9bbSJeremy L Thompson CeedScalar *matB, CeedScalar *x, 55352bfb9bbSJeremy L Thompson CeedScalar *lambda, int *n, int *err) { 55452bfb9bbSJeremy L Thompson *err = CeedSimultaneousDiagonalization(Ceed_dict[*ceed], matA, matB, x, 55552bfb9bbSJeremy L Thompson lambda, *n); 55652bfb9bbSJeremy L Thompson } 55752bfb9bbSJeremy L Thompson 558783c99b3SValeria Barra #define fCeedBasisGetCollocatedGrad \ 559783c99b3SValeria Barra FORTRAN_NAME(ceedbasisgetcollocatedgrad, CEEDBASISGETCOLLOCATEDGRAD) 560783c99b3SValeria Barra void fCeedBasisGetCollocatedGrad(int *basis, CeedScalar *colograd1d, 561d7b241e6Sjeremylt int *err) { 562783c99b3SValeria Barra *err = CeedBasisGetCollocatedGrad(CeedBasis_dict[*basis], colograd1d); 563d7b241e6Sjeremylt } 564d7b241e6Sjeremylt 565d7b241e6Sjeremylt #define fCeedBasisApply FORTRAN_NAME(ceedbasisapply, CEEDBASISAPPLY) 566d7b241e6Sjeremylt void fCeedBasisApply(int *basis, int *nelem, int *tmode, int *emode, 567aedaa0e5Sjeremylt int *u, int *v, int *err) { 568399bb197SJed Brown *err = CeedBasisApply(CeedBasis_dict[*basis], *nelem, (CeedTransposeMode)*tmode, 569399bb197SJed Brown (CeedEvalMode)*emode, 570399bb197SJed Brown *u == FORTRAN_VECTOR_NONE ? CEED_VECTOR_NONE : CeedVector_dict[*u], 571aedaa0e5Sjeremylt CeedVector_dict[*v]); 572d7b241e6Sjeremylt } 573d7b241e6Sjeremylt 574d7b241e6Sjeremylt #define fCeedBasisGetNumNodes \ 575d7b241e6Sjeremylt FORTRAN_NAME(ceedbasisgetnumnodes, CEEDBASISGETNUMNODES) 576d7b241e6Sjeremylt void fCeedBasisGetNumNodes(int *basis, int *P, int *err) { 577d7b241e6Sjeremylt *err = CeedBasisGetNumNodes(CeedBasis_dict[*basis], P); 578d7b241e6Sjeremylt } 579d7b241e6Sjeremylt 580d7b241e6Sjeremylt #define fCeedBasisGetNumQuadraturePoints \ 581d7b241e6Sjeremylt FORTRAN_NAME(ceedbasisgetnumquadraturepoints, CEEDBASISGETNUMQUADRATUREPOINTS) 582d7b241e6Sjeremylt void fCeedBasisGetNumQuadraturePoints(int *basis, int *Q, int *err) { 583d7b241e6Sjeremylt *err = CeedBasisGetNumQuadraturePoints(CeedBasis_dict[*basis], Q); 584d7b241e6Sjeremylt } 585d7b241e6Sjeremylt 586d7b241e6Sjeremylt #define fCeedBasisDestroy FORTRAN_NAME(ceedbasisdestroy,CEEDBASISDESTROY) 587d7b241e6Sjeremylt void fCeedBasisDestroy(int *basis, int *err) { 588c8f84b03SJeremy L Thompson if (CeedBasis_n == 0 || ! CeedBasis_dict[*basis]) return; 589d7b241e6Sjeremylt *err = CeedBasisDestroy(&CeedBasis_dict[*basis]); 590d7b241e6Sjeremylt 591d7b241e6Sjeremylt if (*err == 0) { 592d7b241e6Sjeremylt CeedBasis_n--; 593d7b241e6Sjeremylt if (CeedBasis_n == 0) { 594d7b241e6Sjeremylt CeedFree(&CeedBasis_dict); 595d7b241e6Sjeremylt CeedBasis_count = 0; 596d7b241e6Sjeremylt CeedBasis_count_max = 0; 597d7b241e6Sjeremylt } 598d7b241e6Sjeremylt } 599d7b241e6Sjeremylt } 600d7b241e6Sjeremylt 601d7b241e6Sjeremylt #define fCeedGaussQuadrature FORTRAN_NAME(ceedgaussquadrature, CEEDGAUSSQUADRATURE) 602d7b241e6Sjeremylt void fCeedGaussQuadrature(int *Q, CeedScalar *qref1d, CeedScalar *qweight1d, 603d7b241e6Sjeremylt int *err) { 604d7b241e6Sjeremylt *err = CeedGaussQuadrature(*Q, qref1d, qweight1d); 605d7b241e6Sjeremylt } 606d7b241e6Sjeremylt 607d7b241e6Sjeremylt #define fCeedLobattoQuadrature \ 608d7b241e6Sjeremylt FORTRAN_NAME(ceedlobattoquadrature, CEEDLOBATTOQUADRATURE) 609d7b241e6Sjeremylt void fCeedLobattoQuadrature(int *Q, CeedScalar *qref1d, CeedScalar *qweight1d, 610d7b241e6Sjeremylt int *err) { 611d7b241e6Sjeremylt *err = CeedLobattoQuadrature(*Q, qref1d, qweight1d); 612d7b241e6Sjeremylt } 613d7b241e6Sjeremylt 614*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 615*b00b43a6SJeremy L Thompson // CeedQFunction 616*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 617d7b241e6Sjeremylt static CeedQFunction *CeedQFunction_dict = NULL; 618d7b241e6Sjeremylt static int CeedQFunction_count = 0; 619d7b241e6Sjeremylt static int CeedQFunction_n = 0; 620d7b241e6Sjeremylt static int CeedQFunction_count_max = 0; 621d7b241e6Sjeremylt 622d7b241e6Sjeremylt static int CeedQFunctionFortranStub(void *ctx, int nq, 6238795c945Sjeremylt const CeedScalar *const *u, 6248795c945Sjeremylt CeedScalar *const *v) { 625418fb8c2Sjeremylt fContext *fctx = ctx; 626d7b241e6Sjeremylt int ierr; 627d7b241e6Sjeremylt 6281e35832bSjeremylt CeedScalar *ctx_ = (CeedScalar *) fctx->innerctx; 6291e35832bSjeremylt fctx->f((void *)ctx_,&nq,u[0],u[1],u[2],u[3],u[4],u[5],u[6], 630418fb8c2Sjeremylt u[7],u[8],u[9],u[10],u[11],u[12],u[13],u[14],u[15], 631418fb8c2Sjeremylt v[0],v[1],v[2],v[3],v[4],v[5],v[6],v[7],v[8],v[9], 632418fb8c2Sjeremylt v[10],v[11],v[12],v[13],v[14],v[15],&ierr); 633d7b241e6Sjeremylt return ierr; 634d7b241e6Sjeremylt } 635d7b241e6Sjeremylt 636d7b241e6Sjeremylt #define fCeedQFunctionCreateInterior \ 637d7b241e6Sjeremylt FORTRAN_NAME(ceedqfunctioncreateinterior, CEEDQFUNCTIONCREATEINTERIOR) 638d7b241e6Sjeremylt void fCeedQFunctionCreateInterior(int *ceed, int *vlength, 639d7b241e6Sjeremylt void (*f)(void *ctx, int *nq, 640418fb8c2Sjeremylt const CeedScalar *u,const CeedScalar *u1, 641418fb8c2Sjeremylt const CeedScalar *u2,const CeedScalar *u3, 642418fb8c2Sjeremylt const CeedScalar *u4,const CeedScalar *u5, 643418fb8c2Sjeremylt const CeedScalar *u6,const CeedScalar *u7, 644418fb8c2Sjeremylt const CeedScalar *u8,const CeedScalar *u9, 645418fb8c2Sjeremylt const CeedScalar *u10,const CeedScalar *u11, 646418fb8c2Sjeremylt const CeedScalar *u12,const CeedScalar *u13, 647418fb8c2Sjeremylt const CeedScalar *u14,const CeedScalar *u15, 648418fb8c2Sjeremylt CeedScalar *v,CeedScalar *v1,CeedScalar *v2, 6498795c945Sjeremylt CeedScalar *v3,CeedScalar *v4, 6508795c945Sjeremylt CeedScalar *v5,CeedScalar *v6, 6518795c945Sjeremylt CeedScalar *v7,CeedScalar *v8, 6528795c945Sjeremylt CeedScalar *v9,CeedScalar *v10, 6538795c945Sjeremylt CeedScalar *v11,CeedScalar *v12, 6548795c945Sjeremylt CeedScalar *v13,CeedScalar *v14, 655418fb8c2Sjeremylt CeedScalar *v15,int *err), 656288c0443SJeremy L Thompson const char *source, int *qf, int *err, 657288c0443SJeremy L Thompson fortran_charlen_t source_len) { 658288c0443SJeremy L Thompson FIX_STRING(source); 659d7b241e6Sjeremylt if (CeedQFunction_count == CeedQFunction_count_max) { 660d7b241e6Sjeremylt CeedQFunction_count_max += CeedQFunction_count_max/2 + 1; 661d7b241e6Sjeremylt CeedRealloc(CeedQFunction_count_max, &CeedQFunction_dict); 662d7b241e6Sjeremylt } 663d7b241e6Sjeremylt 664d7b241e6Sjeremylt CeedQFunction *qf_ = &CeedQFunction_dict[CeedQFunction_count]; 665d7b241e6Sjeremylt *err = CeedQFunctionCreateInterior(Ceed_dict[*ceed], *vlength, 666288c0443SJeremy L Thompson CeedQFunctionFortranStub, source_c, qf_); 667d7b241e6Sjeremylt 668d7b241e6Sjeremylt if (*err == 0) { 669d7b241e6Sjeremylt *qf = CeedQFunction_count++; 670d7b241e6Sjeremylt CeedQFunction_n++; 671d7b241e6Sjeremylt } 672d7b241e6Sjeremylt 673418fb8c2Sjeremylt fContext *fctx; 674d7b241e6Sjeremylt *err = CeedMalloc(1, &fctx); 675d7b241e6Sjeremylt if (*err) return; 676418fb8c2Sjeremylt fctx->f = f; fctx->innerctx = NULL; fctx->innerctxsize = 0; 677d7b241e6Sjeremylt 678418fb8c2Sjeremylt *err = CeedQFunctionSetContext(*qf_, fctx, sizeof(fContext)); 679d7b241e6Sjeremylt 680418fb8c2Sjeremylt (*qf_)->fortranstatus = true; 681d7b241e6Sjeremylt } 682d7b241e6Sjeremylt 683288c0443SJeremy L Thompson #define fCeedQFunctionCreateInteriorByName \ 684288c0443SJeremy L Thompson FORTRAN_NAME(ceedqfunctioncreateinteriorbyname, CEEDQFUNCTIONCREATEINTERIORBYNAME) 685288c0443SJeremy L Thompson void fCeedQFunctionCreateInteriorByName(int *ceed, const char *name, int *qf, 686288c0443SJeremy L Thompson int *err, fortran_charlen_t name_len) { 687288c0443SJeremy L Thompson FIX_STRING(name); 688288c0443SJeremy L Thompson if (CeedQFunction_count == CeedQFunction_count_max) { 689288c0443SJeremy L Thompson CeedQFunction_count_max += CeedQFunction_count_max/2 + 1; 690288c0443SJeremy L Thompson CeedRealloc(CeedQFunction_count_max, &CeedQFunction_dict); 691288c0443SJeremy L Thompson } 692288c0443SJeremy L Thompson 693288c0443SJeremy L Thompson CeedQFunction *qf_ = &CeedQFunction_dict[CeedQFunction_count]; 694288c0443SJeremy L Thompson *err = CeedQFunctionCreateInteriorByName(Ceed_dict[*ceed], name_c, qf_); 695288c0443SJeremy L Thompson 696288c0443SJeremy L Thompson if (*err == 0) { 697288c0443SJeremy L Thompson *qf = CeedQFunction_count++; 698288c0443SJeremy L Thompson CeedQFunction_n++; 699288c0443SJeremy L Thompson } 700288c0443SJeremy L Thompson } 701288c0443SJeremy L Thompson 7020219ea01SJeremy L Thompson #define fCeedQFunctionCreateIdentity \ 7030219ea01SJeremy L Thompson FORTRAN_NAME(ceedqfunctioncreateidentity, CEEDQFUNCTIONCREATEIDENTITY) 70460f77c51Sjeremylt void fCeedQFunctionCreateIdentity(int *ceed, int *size, int *inmode, 70560f77c51Sjeremylt int *outmode, int *qf, int *err) { 7060219ea01SJeremy L Thompson if (CeedQFunction_count == CeedQFunction_count_max) { 7070219ea01SJeremy L Thompson CeedQFunction_count_max += CeedQFunction_count_max/2 + 1; 7080219ea01SJeremy L Thompson CeedRealloc(CeedQFunction_count_max, &CeedQFunction_dict); 7090219ea01SJeremy L Thompson } 7100219ea01SJeremy L Thompson 7110219ea01SJeremy L Thompson CeedQFunction *qf_ = &CeedQFunction_dict[CeedQFunction_count]; 712399bb197SJed Brown *err = CeedQFunctionCreateIdentity(Ceed_dict[*ceed], *size, 713399bb197SJed Brown (CeedEvalMode)*inmode, 714399bb197SJed Brown (CeedEvalMode)*outmode, qf_); 7150219ea01SJeremy L Thompson 7160219ea01SJeremy L Thompson if (*err == 0) { 7170219ea01SJeremy L Thompson *qf = CeedQFunction_count++; 7180219ea01SJeremy L Thompson CeedQFunction_n++; 7190219ea01SJeremy L Thompson } 7200219ea01SJeremy L Thompson } 7210219ea01SJeremy L Thompson 722d7b241e6Sjeremylt #define fCeedQFunctionAddInput \ 723d7b241e6Sjeremylt FORTRAN_NAME(ceedqfunctionaddinput,CEEDQFUNCTIONADDINPUT) 724d7b241e6Sjeremylt void fCeedQFunctionAddInput(int *qf, const char *fieldname, 725c2ae719dSJed Brown CeedInt *ncomp, CeedEvalMode *emode, int *err, 726c2ae719dSJed Brown fortran_charlen_t fieldname_len) { 727c2ae719dSJed Brown FIX_STRING(fieldname); 728d7b241e6Sjeremylt CeedQFunction qf_ = CeedQFunction_dict[*qf]; 729d7b241e6Sjeremylt 730c2ae719dSJed Brown *err = CeedQFunctionAddInput(qf_, fieldname_c, *ncomp, *emode); 731d7b241e6Sjeremylt } 732d7b241e6Sjeremylt 733d7b241e6Sjeremylt #define fCeedQFunctionAddOutput \ 734d7b241e6Sjeremylt FORTRAN_NAME(ceedqfunctionaddoutput,CEEDQFUNCTIONADDOUTPUT) 735d7b241e6Sjeremylt void fCeedQFunctionAddOutput(int *qf, const char *fieldname, 736c2ae719dSJed Brown CeedInt *ncomp, CeedEvalMode *emode, int *err, 737c2ae719dSJed Brown fortran_charlen_t fieldname_len) { 738c2ae719dSJed Brown FIX_STRING(fieldname); 739d7b241e6Sjeremylt CeedQFunction qf_ = CeedQFunction_dict[*qf]; 740d7b241e6Sjeremylt 741c2ae719dSJed Brown *err = CeedQFunctionAddOutput(qf_, fieldname_c, *ncomp, *emode); 742d7b241e6Sjeremylt } 743d7b241e6Sjeremylt 744418fb8c2Sjeremylt #define fCeedQFunctionSetContext \ 745418fb8c2Sjeremylt FORTRAN_NAME(ceedqfunctionsetcontext,CEEDQFUNCTIONSETCONTEXT) 746418fb8c2Sjeremylt void fCeedQFunctionSetContext(int *qf, CeedScalar *ctx, CeedInt *n, int *err) { 747418fb8c2Sjeremylt CeedQFunction qf_ = CeedQFunction_dict[*qf]; 748418fb8c2Sjeremylt 749418fb8c2Sjeremylt fContext *fctx = qf_->ctx; 750418fb8c2Sjeremylt fctx->innerctx = ctx; 7511e35832bSjeremylt fctx->innerctxsize = ((size_t) *n)*sizeof(CeedScalar); 752418fb8c2Sjeremylt } 753418fb8c2Sjeremylt 75475affc3bSjeremylt #define fCeedQFunctionView \ 75575affc3bSjeremylt FORTRAN_NAME(ceedqfunctionview,CEEDQFUNCTIONVIEW) 75675affc3bSjeremylt void fCeedQFunctionView(int *qf, int *err) { 75775affc3bSjeremylt CeedQFunction qf_ = CeedQFunction_dict[*qf]; 75875affc3bSjeremylt 75975affc3bSjeremylt *err = CeedQFunctionView(qf_, stdout); 76075affc3bSjeremylt } 76175affc3bSjeremylt 762d7b241e6Sjeremylt #define fCeedQFunctionApply \ 763d7b241e6Sjeremylt FORTRAN_NAME(ceedqfunctionapply,CEEDQFUNCTIONAPPLY) 764d7b241e6Sjeremylt //TODO Need Fixing, double pointer 765d7b241e6Sjeremylt void fCeedQFunctionApply(int *qf, int *Q, 766aedaa0e5Sjeremylt int *u, int *u1, int *u2, int *u3, 767aedaa0e5Sjeremylt int *u4, int *u5, int *u6, int *u7, 768aedaa0e5Sjeremylt int *u8, int *u9, int *u10, int *u11, 769aedaa0e5Sjeremylt int *u12, int *u13, int *u14, int *u15, 770aedaa0e5Sjeremylt int *v, int *v1, int *v2, int *v3, 771aedaa0e5Sjeremylt int *v4, int *v5, int *v6, int *v7, 772aedaa0e5Sjeremylt int *v8, int *v9, int *v10, int *v11, 773aedaa0e5Sjeremylt int *v12, int *v13, int *v14, int *v15, int *err) { 774d7b241e6Sjeremylt CeedQFunction qf_ = CeedQFunction_dict[*qf]; 775aedaa0e5Sjeremylt CeedVector *in; 776d7b241e6Sjeremylt *err = CeedCalloc(16, &in); 777d7b241e6Sjeremylt if (*err) return; 778aedaa0e5Sjeremylt in[0] = *u==FORTRAN_NULL?NULL:CeedVector_dict[*u]; 779aedaa0e5Sjeremylt in[1] = *u1==FORTRAN_NULL?NULL:CeedVector_dict[*u1]; 780aedaa0e5Sjeremylt in[2] = *u2==FORTRAN_NULL?NULL:CeedVector_dict[*u2]; 781aedaa0e5Sjeremylt in[3] = *u3==FORTRAN_NULL?NULL:CeedVector_dict[*u3]; 782aedaa0e5Sjeremylt in[4] = *u4==FORTRAN_NULL?NULL:CeedVector_dict[*u4]; 783aedaa0e5Sjeremylt in[5] = *u5==FORTRAN_NULL?NULL:CeedVector_dict[*u5]; 784aedaa0e5Sjeremylt in[6] = *u6==FORTRAN_NULL?NULL:CeedVector_dict[*u6]; 785aedaa0e5Sjeremylt in[7] = *u7==FORTRAN_NULL?NULL:CeedVector_dict[*u7]; 786aedaa0e5Sjeremylt in[8] = *u8==FORTRAN_NULL?NULL:CeedVector_dict[*u8]; 787aedaa0e5Sjeremylt in[9] = *u9==FORTRAN_NULL?NULL:CeedVector_dict[*u9]; 788aedaa0e5Sjeremylt in[10] = *u10==FORTRAN_NULL?NULL:CeedVector_dict[*u10]; 789aedaa0e5Sjeremylt in[11] = *u11==FORTRAN_NULL?NULL:CeedVector_dict[*u11]; 790aedaa0e5Sjeremylt in[12] = *u12==FORTRAN_NULL?NULL:CeedVector_dict[*u12]; 791aedaa0e5Sjeremylt in[13] = *u13==FORTRAN_NULL?NULL:CeedVector_dict[*u13]; 792aedaa0e5Sjeremylt in[14] = *u14==FORTRAN_NULL?NULL:CeedVector_dict[*u14]; 793aedaa0e5Sjeremylt in[15] = *u15==FORTRAN_NULL?NULL:CeedVector_dict[*u15]; 794aedaa0e5Sjeremylt CeedVector *out; 795d7b241e6Sjeremylt *err = CeedCalloc(16, &out); 796d7b241e6Sjeremylt if (*err) return; 797aedaa0e5Sjeremylt out[0] = *v==FORTRAN_NULL?NULL:CeedVector_dict[*v]; 798aedaa0e5Sjeremylt out[1] = *v1==FORTRAN_NULL?NULL:CeedVector_dict[*v1]; 799aedaa0e5Sjeremylt out[2] = *v2==FORTRAN_NULL?NULL:CeedVector_dict[*v2]; 800aedaa0e5Sjeremylt out[3] = *v3==FORTRAN_NULL?NULL:CeedVector_dict[*v3]; 801aedaa0e5Sjeremylt out[4] = *v4==FORTRAN_NULL?NULL:CeedVector_dict[*v4]; 802aedaa0e5Sjeremylt out[5] = *v5==FORTRAN_NULL?NULL:CeedVector_dict[*v5]; 803aedaa0e5Sjeremylt out[6] = *v6==FORTRAN_NULL?NULL:CeedVector_dict[*v6]; 804aedaa0e5Sjeremylt out[7] = *v7==FORTRAN_NULL?NULL:CeedVector_dict[*v7]; 805aedaa0e5Sjeremylt out[8] = *v8==FORTRAN_NULL?NULL:CeedVector_dict[*v8]; 806aedaa0e5Sjeremylt out[9] = *v9==FORTRAN_NULL?NULL:CeedVector_dict[*v9]; 807aedaa0e5Sjeremylt out[10] = *v10==FORTRAN_NULL?NULL:CeedVector_dict[*v10]; 808aedaa0e5Sjeremylt out[11] = *v11==FORTRAN_NULL?NULL:CeedVector_dict[*v11]; 809aedaa0e5Sjeremylt out[12] = *v12==FORTRAN_NULL?NULL:CeedVector_dict[*v12]; 810aedaa0e5Sjeremylt out[13] = *v13==FORTRAN_NULL?NULL:CeedVector_dict[*v13]; 811aedaa0e5Sjeremylt out[14] = *v14==FORTRAN_NULL?NULL:CeedVector_dict[*v14]; 812aedaa0e5Sjeremylt out[15] = *v15==FORTRAN_NULL?NULL:CeedVector_dict[*v15]; 813aedaa0e5Sjeremylt *err = CeedQFunctionApply(qf_, *Q, in, out); 814d7b241e6Sjeremylt if (*err) return; 815d7b241e6Sjeremylt 816d7b241e6Sjeremylt *err = CeedFree(&in); 817d7b241e6Sjeremylt if (*err) return; 818d7b241e6Sjeremylt *err = CeedFree(&out); 819d7b241e6Sjeremylt } 820d7b241e6Sjeremylt 821d7b241e6Sjeremylt #define fCeedQFunctionDestroy \ 822d7b241e6Sjeremylt FORTRAN_NAME(ceedqfunctiondestroy,CEEDQFUNCTIONDESTROY) 823d7b241e6Sjeremylt void fCeedQFunctionDestroy(int *qf, int *err) { 824c8f84b03SJeremy L Thompson if (CeedQFunction_n == 0 || !CeedQFunction_dict[*qf]) return; 8251134a487Sjeremylt bool fstatus; 826fd364f38SJeremy L Thompson *err = CeedQFunctionIsFortran(CeedQFunction_dict[*qf], &fstatus); 8271134a487Sjeremylt if (*err) return; 8281134a487Sjeremylt if (fstatus) { 829c4b814baSjeremylt fContext *fctx = CeedQFunction_dict[*qf]->ctx; 830c4b814baSjeremylt *err = CeedFree(&fctx); 831d7b241e6Sjeremylt if (*err) return; 8321134a487Sjeremylt } 833c4b814baSjeremylt 834c4b814baSjeremylt *err = CeedQFunctionDestroy(&CeedQFunction_dict[*qf]); 835c4b814baSjeremylt if (*err) return; 836c4b814baSjeremylt 837d7b241e6Sjeremylt CeedQFunction_n--; 838d7b241e6Sjeremylt if (CeedQFunction_n == 0) { 839d7b241e6Sjeremylt *err = CeedFree(&CeedQFunction_dict); 840d7b241e6Sjeremylt CeedQFunction_count = 0; 841d7b241e6Sjeremylt CeedQFunction_count_max = 0; 842d7b241e6Sjeremylt } 843d7b241e6Sjeremylt } 844d7b241e6Sjeremylt 845*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 846*b00b43a6SJeremy L Thompson // CeedOperator 847*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 848d7b241e6Sjeremylt static CeedOperator *CeedOperator_dict = NULL; 849d7b241e6Sjeremylt static int CeedOperator_count = 0; 850d7b241e6Sjeremylt static int CeedOperator_n = 0; 851d7b241e6Sjeremylt static int CeedOperator_count_max = 0; 852d7b241e6Sjeremylt 853d7b241e6Sjeremylt #define fCeedOperatorCreate \ 854d7b241e6Sjeremylt FORTRAN_NAME(ceedoperatorcreate, CEEDOPERATORCREATE) 855d7b241e6Sjeremylt void fCeedOperatorCreate(int *ceed, 856d7b241e6Sjeremylt int *qf, int *dqf, int *dqfT, int *op, int *err) { 857d7b241e6Sjeremylt if (CeedOperator_count == CeedOperator_count_max) 858d7b241e6Sjeremylt CeedOperator_count_max += CeedOperator_count_max/2 + 1, 8598795c945Sjeremylt CeedOperator_dict = realloc(CeedOperator_dict, 8608795c945Sjeremylt sizeof(CeedOperator)*CeedOperator_count_max); 861d7b241e6Sjeremylt 862d7b241e6Sjeremylt CeedOperator *op_ = &CeedOperator_dict[CeedOperator_count]; 863d7b241e6Sjeremylt 864442e7f0bSjeremylt CeedQFunction dqf_ = CEED_QFUNCTION_NONE, dqfT_ = CEED_QFUNCTION_NONE; 865442e7f0bSjeremylt if (*dqf != FORTRAN_QFUNCTION_NONE) dqf_ = CeedQFunction_dict[*dqf ]; 866442e7f0bSjeremylt if (*dqfT != FORTRAN_QFUNCTION_NONE) dqfT_ = CeedQFunction_dict[*dqfT]; 867d7b241e6Sjeremylt 868d7b241e6Sjeremylt *err = CeedOperatorCreate(Ceed_dict[*ceed], CeedQFunction_dict[*qf], dqf_, 869d7b241e6Sjeremylt dqfT_, op_); 870d7b241e6Sjeremylt if (*err) return; 871d7b241e6Sjeremylt *op = CeedOperator_count++; 872d7b241e6Sjeremylt CeedOperator_n++; 873d7b241e6Sjeremylt } 874d7b241e6Sjeremylt 87552d6035fSJeremy L Thompson #define fCeedCompositeOperatorCreate \ 87652d6035fSJeremy L Thompson FORTRAN_NAME(ceedcompositeoperatorcreate, CEEDCOMPOSITEOPERATORCREATE) 87752d6035fSJeremy L Thompson void fCeedCompositeOperatorCreate(int *ceed, int *op, int *err) { 87852d6035fSJeremy L Thompson if (CeedOperator_count == CeedOperator_count_max) 87952d6035fSJeremy L Thompson CeedOperator_count_max += CeedOperator_count_max/2 + 1, 8808795c945Sjeremylt CeedOperator_dict = realloc(CeedOperator_dict, 8818795c945Sjeremylt sizeof(CeedOperator)*CeedOperator_count_max); 88252d6035fSJeremy L Thompson 88352d6035fSJeremy L Thompson CeedOperator *op_ = &CeedOperator_dict[CeedOperator_count]; 88452d6035fSJeremy L Thompson 88552d6035fSJeremy L Thompson *err = CeedCompositeOperatorCreate(Ceed_dict[*ceed], op_); 88652d6035fSJeremy L Thompson if (*err) return; 88752d6035fSJeremy L Thompson *op = CeedOperator_count++; 88852d6035fSJeremy L Thompson CeedOperator_n++; 88952d6035fSJeremy L Thompson } 89052d6035fSJeremy L Thompson 891d7b241e6Sjeremylt #define fCeedOperatorSetField \ 892d7b241e6Sjeremylt FORTRAN_NAME(ceedoperatorsetfield,CEEDOPERATORSETFIELD) 893a8d32208Sjeremylt void fCeedOperatorSetField(int *op, const char *fieldname, int *r, int *b, 894a8d32208Sjeremylt int *v, int *err, fortran_charlen_t fieldname_len) { 895c2ae719dSJed Brown FIX_STRING(fieldname); 896d7b241e6Sjeremylt CeedElemRestriction r_; 897d7b241e6Sjeremylt CeedBasis b_; 898d7b241e6Sjeremylt CeedVector v_; 899d7b241e6Sjeremylt 900d7b241e6Sjeremylt CeedOperator op_ = CeedOperator_dict[*op]; 901d7b241e6Sjeremylt 902d7b241e6Sjeremylt if (*r == FORTRAN_NULL) { 903d7b241e6Sjeremylt r_ = NULL; 90415910d16Sjeremylt } else if (*r == FORTRAN_ELEMRESTRICTION_NONE) { 90515910d16Sjeremylt r_ = CEED_ELEMRESTRICTION_NONE; 906d7b241e6Sjeremylt } else { 907d7b241e6Sjeremylt r_ = CeedElemRestriction_dict[*r]; 908d7b241e6Sjeremylt } 9094dccadb6Sjeremylt 910d7b241e6Sjeremylt if (*b == FORTRAN_NULL) { 911d7b241e6Sjeremylt b_ = NULL; 912783c99b3SValeria Barra } else if (*b == FORTRAN_BASIS_COLLOCATED) { 913783c99b3SValeria Barra b_ = CEED_BASIS_COLLOCATED; 914d7b241e6Sjeremylt } else { 915d7b241e6Sjeremylt b_ = CeedBasis_dict[*b]; 916d7b241e6Sjeremylt } 917d7b241e6Sjeremylt if (*v == FORTRAN_NULL) { 918d7b241e6Sjeremylt v_ = NULL; 919d7b241e6Sjeremylt } else if (*v == FORTRAN_VECTOR_ACTIVE) { 920d7b241e6Sjeremylt v_ = CEED_VECTOR_ACTIVE; 921d7b241e6Sjeremylt } else if (*v == FORTRAN_VECTOR_NONE) { 922d7b241e6Sjeremylt v_ = CEED_VECTOR_NONE; 923d7b241e6Sjeremylt } else { 924d7b241e6Sjeremylt v_ = CeedVector_dict[*v]; 925d7b241e6Sjeremylt } 926d7b241e6Sjeremylt 927a8d32208Sjeremylt *err = CeedOperatorSetField(op_, fieldname_c, r_, b_, v_); 928d7b241e6Sjeremylt } 929d7b241e6Sjeremylt 93052d6035fSJeremy L Thompson #define fCeedCompositeOperatorAddSub \ 93152d6035fSJeremy L Thompson FORTRAN_NAME(ceedcompositeoperatoraddsub, CEEDCOMPOSITEOPERATORADDSUB) 93252d6035fSJeremy L Thompson void fCeedCompositeOperatorAddSub(int *compositeop, int *subop, int *err) { 93352d6035fSJeremy L Thompson CeedOperator compositeop_ = CeedOperator_dict[*compositeop]; 93452d6035fSJeremy L Thompson CeedOperator subop_ = CeedOperator_dict[*subop]; 93552d6035fSJeremy L Thompson 93652d6035fSJeremy L Thompson *err = CeedCompositeOperatorAddSub(compositeop_, subop_); 93752d6035fSJeremy L Thompson if (*err) return; 93852d6035fSJeremy L Thompson } 93952d6035fSJeremy L Thompson 94080ac2e43SJeremy L Thompson #define fCeedOperatorLinearAssembleQFunction FORTRAN_NAME(ceedoperatorlinearassembleqfunction, CEEDOPERATORLINEARASSEMBLEQFUNCTION) 94180ac2e43SJeremy L Thompson void fCeedOperatorLinearAssembleQFunction(int *op, int *assembledvec, 9421d102b48SJeremy L Thompson int *assembledrstr, int *rqst, int *err) { 9431d102b48SJeremy L Thompson // Vector 9441d102b48SJeremy L Thompson if (CeedVector_count == CeedVector_count_max) { 9451d102b48SJeremy L Thompson CeedVector_count_max += CeedVector_count_max/2 + 1; 9461d102b48SJeremy L Thompson CeedRealloc(CeedVector_count_max, &CeedVector_dict); 9471d102b48SJeremy L Thompson } 9481d102b48SJeremy L Thompson CeedVector *assembledvec_ = &CeedVector_dict[CeedVector_count]; 9491d102b48SJeremy L Thompson 9501d102b48SJeremy L Thompson // Restriction 9511d102b48SJeremy L Thompson if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 9521d102b48SJeremy L Thompson CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 9531d102b48SJeremy L Thompson CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 9541d102b48SJeremy L Thompson } 9551d102b48SJeremy L Thompson CeedElemRestriction *rstr_ = 9561d102b48SJeremy L Thompson &CeedElemRestriction_dict[CeedElemRestriction_count]; 9571d102b48SJeremy L Thompson 9581d102b48SJeremy L Thompson int createRequest = 1; 9591d102b48SJeremy L Thompson // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 9601d102b48SJeremy L Thompson if (*rqst == -1 || *rqst == -2) { 9611d102b48SJeremy L Thompson createRequest = 0; 9621d102b48SJeremy L Thompson } 9631d102b48SJeremy L Thompson 9641d102b48SJeremy L Thompson if (createRequest && CeedRequest_count == CeedRequest_count_max) { 9651d102b48SJeremy L Thompson CeedRequest_count_max += CeedRequest_count_max/2 + 1; 9661d102b48SJeremy L Thompson CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 9671d102b48SJeremy L Thompson } 9681d102b48SJeremy L Thompson 9691d102b48SJeremy L Thompson CeedRequest *rqst_; 9701d102b48SJeremy L Thompson if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 9711d102b48SJeremy L Thompson else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 9721d102b48SJeremy L Thompson else rqst_ = &CeedRequest_dict[CeedRequest_count]; 9731d102b48SJeremy L Thompson 97480ac2e43SJeremy L Thompson *err = CeedOperatorLinearAssembleQFunction(CeedOperator_dict[*op], 9751d102b48SJeremy L Thompson assembledvec_, rstr_, rqst_); 9761d102b48SJeremy L Thompson if (*err) return; 9771d102b48SJeremy L Thompson if (createRequest) { 9781d102b48SJeremy L Thompson *rqst = CeedRequest_count++; 9791d102b48SJeremy L Thompson CeedRequest_n++; 9801d102b48SJeremy L Thompson } 9811d102b48SJeremy L Thompson 9821d102b48SJeremy L Thompson if (*err == 0) { 9831d102b48SJeremy L Thompson *assembledrstr = CeedElemRestriction_count++; 9841d102b48SJeremy L Thompson CeedElemRestriction_n++; 9851d102b48SJeremy L Thompson *assembledvec = CeedVector_count++; 9861d102b48SJeremy L Thompson CeedVector_n++; 9871d102b48SJeremy L Thompson } 9881d102b48SJeremy L Thompson } 9891d102b48SJeremy L Thompson 99080ac2e43SJeremy L Thompson #define fCeedOperatorLinearAssembleDiagonal FORTRAN_NAME(ceedoperatorlinearassemblediagonal, CEEDOPERATORLINEARASSEMBLEDIAGONAL) 99180ac2e43SJeremy L Thompson void fCeedOperatorLinearAssembleDiagonal(int *op, int *assembledvec, 992b7ec98d8SJeremy L Thompson int *rqst, int *err) { 993b7ec98d8SJeremy L Thompson int createRequest = 1; 994b7ec98d8SJeremy L Thompson // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 995b7ec98d8SJeremy L Thompson if (*rqst == -1 || *rqst == -2) { 996b7ec98d8SJeremy L Thompson createRequest = 0; 997b7ec98d8SJeremy L Thompson } 998b7ec98d8SJeremy L Thompson 999b7ec98d8SJeremy L Thompson if (createRequest && CeedRequest_count == CeedRequest_count_max) { 1000b7ec98d8SJeremy L Thompson CeedRequest_count_max += CeedRequest_count_max/2 + 1; 1001b7ec98d8SJeremy L Thompson CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 1002b7ec98d8SJeremy L Thompson } 1003b7ec98d8SJeremy L Thompson 1004b7ec98d8SJeremy L Thompson CeedRequest *rqst_; 1005b7ec98d8SJeremy L Thompson if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 1006b7ec98d8SJeremy L Thompson else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 1007b7ec98d8SJeremy L Thompson else rqst_ = &CeedRequest_dict[CeedRequest_count]; 1008b7ec98d8SJeremy L Thompson 100980ac2e43SJeremy L Thompson *err = CeedOperatorLinearAssembleDiagonal(CeedOperator_dict[*op], 10102bba3ffaSJeremy L Thompson CeedVector_dict[*assembledvec], rqst_); 1011b7ec98d8SJeremy L Thompson if (*err) return; 1012b7ec98d8SJeremy L Thompson if (createRequest) { 1013b7ec98d8SJeremy L Thompson *rqst = CeedRequest_count++; 1014b7ec98d8SJeremy L Thompson CeedRequest_n++; 1015b7ec98d8SJeremy L Thompson } 1016b7ec98d8SJeremy L Thompson } 1017b7ec98d8SJeremy L Thompson 10182ebaca42Sjeremylt #define fCeedOperatorView \ 10192ebaca42Sjeremylt FORTRAN_NAME(ceedoperatorview,CEEDOPERATORVIEW) 10202ebaca42Sjeremylt void fCeedOperatorView(int *op, int *err) { 10212ebaca42Sjeremylt CeedOperator op_ = CeedOperator_dict[*op]; 10222ebaca42Sjeremylt 10232ebaca42Sjeremylt *err = CeedOperatorView(op_, stdout); 10242ebaca42Sjeremylt } 10252ebaca42Sjeremylt 10263bd813ffSjeremylt #define fCeedOperatorCreateFDMElementInverse FORTRAN_NAME(ceedoperatorcreatefdmelementinverse, CEEDOPERATORCREATEFDMELEMENTINVERSE) 10273bd813ffSjeremylt void fCeedOperatorCreateFDMElementInverse(int *op, int *fdminv, 10283bd813ffSjeremylt int *rqst, int *err) { 10293bd813ffSjeremylt // Operator 10303bd813ffSjeremylt if (CeedOperator_count == CeedOperator_count_max) { 10313bd813ffSjeremylt CeedOperator_count_max += CeedOperator_count_max/2 + 1; 10323bd813ffSjeremylt CeedRealloc(CeedOperator_count_max, &CeedOperator_dict); 10333bd813ffSjeremylt } 10343bd813ffSjeremylt CeedOperator *fdminv_ = 10353bd813ffSjeremylt &CeedOperator_dict[CeedOperator_count]; 10363bd813ffSjeremylt 10373bd813ffSjeremylt int createRequest = 1; 10383bd813ffSjeremylt // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 10393bd813ffSjeremylt if (*rqst == -1 || *rqst == -2) { 10403bd813ffSjeremylt createRequest = 0; 10413bd813ffSjeremylt } 10423bd813ffSjeremylt 10433bd813ffSjeremylt if (createRequest && CeedRequest_count == CeedRequest_count_max) { 10443bd813ffSjeremylt CeedRequest_count_max += CeedRequest_count_max/2 + 1; 10453bd813ffSjeremylt CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 10463bd813ffSjeremylt } 10473bd813ffSjeremylt 10483bd813ffSjeremylt CeedRequest *rqst_; 10493bd813ffSjeremylt if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 10503bd813ffSjeremylt else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 10513bd813ffSjeremylt else rqst_ = &CeedRequest_dict[CeedRequest_count]; 10523bd813ffSjeremylt 10533bd813ffSjeremylt *err = CeedOperatorCreateFDMElementInverse(CeedOperator_dict[*op], 10543bd813ffSjeremylt fdminv_, rqst_); 10553bd813ffSjeremylt if (*err) return; 10563bd813ffSjeremylt if (createRequest) { 10573bd813ffSjeremylt *rqst = CeedRequest_count++; 10583bd813ffSjeremylt CeedRequest_n++; 10593bd813ffSjeremylt } 10603bd813ffSjeremylt 10613bd813ffSjeremylt if (*err == 0) { 10623bd813ffSjeremylt *fdminv = CeedOperator_count++; 10633bd813ffSjeremylt CeedOperator_n++; 10643bd813ffSjeremylt } 10653bd813ffSjeremylt } 10663bd813ffSjeremylt 1067d7b241e6Sjeremylt #define fCeedOperatorApply FORTRAN_NAME(ceedoperatorapply, CEEDOPERATORAPPLY) 1068d7b241e6Sjeremylt void fCeedOperatorApply(int *op, int *ustatevec, 1069d7b241e6Sjeremylt int *resvec, int *rqst, int *err) { 1070e97ff134Sjeremylt CeedVector ustatevec_ = (*ustatevec == FORTRAN_NULL) ? 1071e97ff134Sjeremylt NULL : (*ustatevec == FORTRAN_VECTOR_NONE ? 1072e97ff134Sjeremylt CEED_VECTOR_NONE : CeedVector_dict[*ustatevec]); 1073e97ff134Sjeremylt CeedVector resvec_ = (*resvec == FORTRAN_NULL) ? 1074e97ff134Sjeremylt NULL : (*resvec == FORTRAN_VECTOR_NONE ? 1075e97ff134Sjeremylt CEED_VECTOR_NONE : CeedVector_dict[*resvec]); 1076d7b241e6Sjeremylt 1077d7b241e6Sjeremylt int createRequest = 1; 1078d7b241e6Sjeremylt // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 1079d7b241e6Sjeremylt if (*rqst == -1 || *rqst == -2) { 1080d7b241e6Sjeremylt createRequest = 0; 1081d7b241e6Sjeremylt } 1082d7b241e6Sjeremylt 1083d7b241e6Sjeremylt if (createRequest && CeedRequest_count == CeedRequest_count_max) { 1084d7b241e6Sjeremylt CeedRequest_count_max += CeedRequest_count_max/2 + 1; 1085d7b241e6Sjeremylt CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 1086d7b241e6Sjeremylt } 1087d7b241e6Sjeremylt 1088d7b241e6Sjeremylt CeedRequest *rqst_; 1089d7b241e6Sjeremylt if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 1090d7b241e6Sjeremylt else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 1091d7b241e6Sjeremylt else rqst_ = &CeedRequest_dict[CeedRequest_count]; 1092d7b241e6Sjeremylt 1093d7b241e6Sjeremylt *err = CeedOperatorApply(CeedOperator_dict[*op], 109412bf2c11SJed Brown ustatevec_, resvec_, rqst_); 1095d7b241e6Sjeremylt if (*err) return; 1096d7b241e6Sjeremylt if (createRequest) { 1097d7b241e6Sjeremylt *rqst = CeedRequest_count++; 1098d7b241e6Sjeremylt CeedRequest_n++; 1099d7b241e6Sjeremylt } 1100d7b241e6Sjeremylt } 1101d7b241e6Sjeremylt 1102cae8b89aSjeremylt #define fCeedOperatorApplyAdd FORTRAN_NAME(ceedoperatorapplyadd, CEEDOPERATORAPPLYADD) 1103cae8b89aSjeremylt void fCeedOperatorApplyAdd(int *op, int *ustatevec, 1104cae8b89aSjeremylt int *resvec, int *rqst, int *err) { 1105cae8b89aSjeremylt CeedVector ustatevec_ = *ustatevec == FORTRAN_NULL 1106cae8b89aSjeremylt ? NULL : CeedVector_dict[*ustatevec]; 1107cae8b89aSjeremylt CeedVector resvec_ = *resvec == FORTRAN_NULL 1108cae8b89aSjeremylt ? NULL : CeedVector_dict[*resvec]; 1109cae8b89aSjeremylt 1110cae8b89aSjeremylt int createRequest = 1; 1111cae8b89aSjeremylt // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 1112cae8b89aSjeremylt if (*rqst == -1 || *rqst == -2) { 1113cae8b89aSjeremylt createRequest = 0; 1114cae8b89aSjeremylt } 1115cae8b89aSjeremylt 1116cae8b89aSjeremylt if (createRequest && CeedRequest_count == CeedRequest_count_max) { 1117cae8b89aSjeremylt CeedRequest_count_max += CeedRequest_count_max/2 + 1; 1118cae8b89aSjeremylt CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 1119cae8b89aSjeremylt } 1120cae8b89aSjeremylt 1121cae8b89aSjeremylt CeedRequest *rqst_; 1122cae8b89aSjeremylt if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 1123cae8b89aSjeremylt else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 1124cae8b89aSjeremylt else rqst_ = &CeedRequest_dict[CeedRequest_count]; 1125cae8b89aSjeremylt 1126cae8b89aSjeremylt *err = CeedOperatorApplyAdd(CeedOperator_dict[*op], 1127cae8b89aSjeremylt ustatevec_, resvec_, rqst_); 1128cae8b89aSjeremylt if (*err) return; 1129cae8b89aSjeremylt if (createRequest) { 1130cae8b89aSjeremylt *rqst = CeedRequest_count++; 1131cae8b89aSjeremylt CeedRequest_n++; 1132cae8b89aSjeremylt } 1133cae8b89aSjeremylt } 1134cae8b89aSjeremylt 1135d7b241e6Sjeremylt #define fCeedOperatorApplyJacobian \ 1136d7b241e6Sjeremylt FORTRAN_NAME(ceedoperatorapplyjacobian, CEEDOPERATORAPPLYJACOBIAN) 1137d7b241e6Sjeremylt void fCeedOperatorApplyJacobian(int *op, int *qdatavec, int *ustatevec, 11388795c945Sjeremylt int *dustatevec, int *dresvec, int *rqst, 11398795c945Sjeremylt int *err) { 1140d7b241e6Sjeremylt // TODO Uncomment this when CeedOperatorApplyJacobian is implemented 1141d7b241e6Sjeremylt // *err = CeedOperatorApplyJacobian(CeedOperator_dict[*op], CeedVector_dict[*qdatavec], 1142d7b241e6Sjeremylt // CeedVector_dict[*ustatevec], CeedVector_dict[*dustatevec], 1143d7b241e6Sjeremylt // CeedVector_dict[*dresvec], &CeedRequest_dict[*rqst]); 1144d7b241e6Sjeremylt } 1145d7b241e6Sjeremylt 1146d7b241e6Sjeremylt #define fCeedOperatorDestroy \ 1147d7b241e6Sjeremylt FORTRAN_NAME(ceedoperatordestroy, CEEDOPERATORDESTROY) 1148d7b241e6Sjeremylt void fCeedOperatorDestroy(int *op, int *err) { 1149c8f84b03SJeremy L Thompson if (CeedOperator_n == 0 || !CeedOperator_dict[*op]) return; 1150d7b241e6Sjeremylt *err = CeedOperatorDestroy(&CeedOperator_dict[*op]); 1151d7b241e6Sjeremylt if (*err) return; 1152d7b241e6Sjeremylt CeedOperator_n--; 1153d7b241e6Sjeremylt if (CeedOperator_n == 0) { 1154d7b241e6Sjeremylt *err = CeedFree(&CeedOperator_dict); 1155d7b241e6Sjeremylt CeedOperator_count = 0; 1156d7b241e6Sjeremylt CeedOperator_count_max = 0; 1157d7b241e6Sjeremylt } 1158d7b241e6Sjeremylt } 1159*b00b43a6SJeremy L Thompson 1160*b00b43a6SJeremy L Thompson // ----------------------------------------------------------------------------- 1161