1 // Copyright (c) 2017-2018, Lawrence Livermore National Security, LLC. 2 // Produced at the Lawrence Livermore National Laboratory. LLNL-CODE-734707. 3 // All Rights reserved. See files LICENSE and NOTICE for details. 4 // 5 // This file is part of CEED, a collection of benchmarks, miniapps, software 6 // libraries and APIs for efficient high-order finite element and spectral 7 // element discretizations for exascale applications. For more information and 8 // source code availability see http://github.com/ceed. 9 // 10 // The CEED research is supported by the Exascale Computing Project 17-SC-20-SC, 11 // a collaborative effort of two U.S. Department of Energy organizations (Office 12 // of Science and the National Nuclear Security Administration) responsible for 13 // the planning and preparation of a capable exascale ecosystem, including 14 // software, applications, hardware, advanced system engineering and early 15 // testbed platforms, in support of the nation's exascale computing imperative. 16 17 // Fortran interface 18 #include <ceed.h> 19 #include <ceed-impl.h> 20 #include <ceed-backend.h> 21 #include <ceed-fortran-name.h> 22 #include <stdlib.h> 23 #include <string.h> 24 25 #define FORTRAN_REQUEST_IMMEDIATE -1 26 #define FORTRAN_REQUEST_ORDERED -2 27 #define FORTRAN_NULL -3 28 #define FORTRAN_BASIS_COLLOCATED -1 29 #define FORTRAN_VECTOR_ACTIVE -1 30 #define FORTRAN_VECTOR_NONE -2 31 #define FORTRAN_QFUNCTION_NONE -1 32 33 static Ceed *Ceed_dict = NULL; 34 static int Ceed_count = 0; 35 static int Ceed_n = 0; 36 static int Ceed_count_max = 0; 37 38 // This test should actually be for the gfortran version, but we don't currently 39 // have a configure system to determine that (TODO). At present, this will use 40 // the smaller integer when run with clang+gfortran=8, for example. (That is 41 // sketchy, but will likely work for users that don't have huge character 42 // strings.) 43 #if __GNUC__ >= 8 44 typedef size_t fortran_charlen_t; 45 #else 46 typedef int fortran_charlen_t; 47 #endif 48 49 #define Splice(a, b) a ## b 50 51 // Fortran strings are generally unterminated and the length is passed as an 52 // extra argument after all the normal arguments. Some compilers (I only know 53 // of Windows) place the length argument immediately after the string parameter 54 // (TODO). 55 // 56 // We can't just NULL-terminate the string in-place because that could overwrite 57 // other strings or attempt to write to read-only memory. This macro allocates 58 // a string to hold the null-terminated version of the string that C expects. 59 #define FIX_STRING(stringname) \ 60 char Splice(stringname, _c)[1024]; \ 61 if (Splice(stringname, _len) > 1023) \ 62 CeedError(NULL, 1, "Fortran string length too long %zd", (size_t)Splice(stringname, _len)); \ 63 strncpy(Splice(stringname, _c), stringname, Splice(stringname, _len)); \ 64 Splice(stringname, _c)[Splice(stringname, _len)] = 0; \ 65 66 #define fCeedInit FORTRAN_NAME(ceedinit,CEEDINIT) 67 void fCeedInit(const char *resource, int *ceed, int *err, 68 fortran_charlen_t resource_len) { 69 FIX_STRING(resource); 70 if (Ceed_count == Ceed_count_max) { 71 Ceed_count_max += Ceed_count_max/2 + 1; 72 CeedRealloc(Ceed_count_max, &Ceed_dict); 73 } 74 75 Ceed *ceed_ = &Ceed_dict[Ceed_count]; 76 *err = CeedInit(resource_c, ceed_); 77 78 if (*err == 0) { 79 *ceed = Ceed_count++; 80 Ceed_n++; 81 } 82 } 83 84 #define fCeedGetPreferredMemType \ 85 FORTRAN_NAME(ceedgetpreferredmemtype,CEEDGETPREFERREDMEMTYPE) 86 void fCeedGetPreferredMemType(int *ceed, int *type, int *err) { 87 *err = CeedGetPreferredMemType(Ceed_dict[*ceed], (CeedMemType *)type); 88 } 89 90 #define fCeedDestroy FORTRAN_NAME(ceeddestroy,CEEDDESTROY) 91 void fCeedDestroy(int *ceed, int *err) { 92 *err = CeedDestroy(&Ceed_dict[*ceed]); 93 94 if (*err == 0) { 95 Ceed_n--; 96 if (Ceed_n == 0) { 97 CeedFree(&Ceed_dict); 98 Ceed_count = 0; 99 Ceed_count_max = 0; 100 } 101 } 102 } 103 104 static CeedVector *CeedVector_dict = NULL; 105 static int CeedVector_count = 0; 106 static int CeedVector_n = 0; 107 static int CeedVector_count_max = 0; 108 109 #define fCeedVectorCreate FORTRAN_NAME(ceedvectorcreate,CEEDVECTORCREATE) 110 void fCeedVectorCreate(int *ceed, int *length, int *vec, int *err) { 111 if (CeedVector_count == CeedVector_count_max) { 112 CeedVector_count_max += CeedVector_count_max/2 + 1; 113 CeedRealloc(CeedVector_count_max, &CeedVector_dict); 114 } 115 116 CeedVector *vec_ = &CeedVector_dict[CeedVector_count]; 117 *err = CeedVectorCreate(Ceed_dict[*ceed], *length, vec_); 118 119 if (*err == 0) { 120 *vec = CeedVector_count++; 121 CeedVector_n++; 122 } 123 } 124 125 #define fCeedVectorSetArray FORTRAN_NAME(ceedvectorsetarray,CEEDVECTORSETARRAY) 126 void fCeedVectorSetArray(int *vec, int *memtype, int *copymode, 127 CeedScalar *array, int64_t *offset, int *err) { 128 *err = CeedVectorSetArray(CeedVector_dict[*vec], *memtype, *copymode, 129 (CeedScalar *)(array + *offset)); 130 } 131 132 #define fCeedVectorSyncArray FORTRAN_NAME(ceedvectorsyncarray,CEEDVECTORSYNCARRAY) 133 void fCeedVectorSyncArray(int *vec, int *memtype, int *err) { 134 *err = CeedVectorSyncArray(CeedVector_dict[*vec], *memtype); 135 } 136 137 #define fCeedVectorSetValue FORTRAN_NAME(ceedvectorsetvalue,CEEDVECTORSETVALUE) 138 void fCeedVectorSetValue(int *vec, CeedScalar *value, int *err) { 139 *err = CeedVectorSetValue(CeedVector_dict[*vec], *value); 140 } 141 142 #define fCeedVectorGetArray FORTRAN_NAME(ceedvectorgetarray,CEEDVECTORGETARRAY) 143 void fCeedVectorGetArray(int *vec, int *memtype, CeedScalar *array, 144 int64_t *offset, 145 int *err) { 146 CeedScalar *b; 147 CeedVector vec_ = CeedVector_dict[*vec]; 148 *err = CeedVectorGetArray(vec_, *memtype, &b); 149 *offset = b - array; 150 } 151 152 #define fCeedVectorGetArrayRead \ 153 FORTRAN_NAME(ceedvectorgetarrayread,CEEDVECTORGETARRAYREAD) 154 void fCeedVectorGetArrayRead(int *vec, int *memtype, CeedScalar *array, 155 int64_t *offset, int *err) { 156 const CeedScalar *b; 157 CeedVector vec_ = CeedVector_dict[*vec]; 158 *err = CeedVectorGetArrayRead(vec_, *memtype, &b); 159 *offset = b - array; 160 } 161 162 #define fCeedVectorRestoreArray \ 163 FORTRAN_NAME(ceedvectorrestorearray,CEEDVECTORRESTOREARRAY) 164 void fCeedVectorRestoreArray(int *vec, CeedScalar *array, 165 int64_t *offset, int *err) { 166 *err = CeedVectorRestoreArray(CeedVector_dict[*vec], &array); 167 *offset = 0; 168 } 169 170 #define fCeedVectorRestoreArrayRead \ 171 FORTRAN_NAME(ceedvectorrestorearrayread,CEEDVECTORRESTOREARRAYREAD) 172 void fCeedVectorRestoreArrayRead(int *vec, const CeedScalar *array, 173 int64_t *offset, int *err) { 174 *err = CeedVectorRestoreArrayRead(CeedVector_dict[*vec], &array); 175 *offset = 0; 176 } 177 178 #define fCeedVectorView FORTRAN_NAME(ceedvectorview,CEEDVECTORVIEW) 179 void fCeedVectorView(int *vec, int *err) { 180 *err = CeedVectorView(CeedVector_dict[*vec], "%12.8f", stdout); 181 } 182 183 #define fCeedVectorDestroy FORTRAN_NAME(ceedvectordestroy,CEEDVECTORDESTROY) 184 void fCeedVectorDestroy(int *vec, int *err) { 185 *err = CeedVectorDestroy(&CeedVector_dict[*vec]); 186 187 if (*err == 0) { 188 CeedVector_n--; 189 if (CeedVector_n == 0) { 190 CeedFree(&CeedVector_dict); 191 CeedVector_count = 0; 192 CeedVector_count_max = 0; 193 } 194 } 195 } 196 197 static CeedElemRestriction *CeedElemRestriction_dict = NULL; 198 static int CeedElemRestriction_count = 0; 199 static int CeedElemRestriction_n = 0; 200 static int CeedElemRestriction_count_max = 0; 201 202 #define fCeedElemRestrictionCreate \ 203 FORTRAN_NAME(ceedelemrestrictioncreate, CEEDELEMRESTRICTIONCREATE) 204 void fCeedElemRestrictionCreate(int *ceed, int *nelements, 205 int *esize, int *nnodes, int *ncomp, 206 int *memtype, int *copymode, const int *indices, 207 int *elemrestriction, int *err) { 208 if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 209 CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 210 CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 211 } 212 213 const int *indices_ = indices; 214 215 CeedElemRestriction *elemrestriction_ = 216 &CeedElemRestriction_dict[CeedElemRestriction_count]; 217 *err = CeedElemRestrictionCreate(Ceed_dict[*ceed], *nelements, *esize, 218 *nnodes, *ncomp, *memtype, *copymode, 219 indices_, elemrestriction_); 220 221 if (*err == 0) { 222 *elemrestriction = CeedElemRestriction_count++; 223 CeedElemRestriction_n++; 224 } 225 } 226 227 #define fCeedElemRestrictionCreateIdentity \ 228 FORTRAN_NAME(ceedelemrestrictioncreateidentity, CEEDELEMRESTRICTIONCREATEIDENTITY) 229 void fCeedElemRestrictionCreateIdentity(int *ceed, int *nelements, 230 int *esize, int *nnodes, int *ncomp, 231 int *elemrestriction, int *err) { 232 if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 233 CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 234 CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 235 } 236 237 CeedElemRestriction *elemrestriction_ = 238 &CeedElemRestriction_dict[CeedElemRestriction_count]; 239 *err = CeedElemRestrictionCreateIdentity(Ceed_dict[*ceed], *nelements, *esize, 240 *nnodes, *ncomp, elemrestriction_); 241 242 if (*err == 0) { 243 *elemrestriction = CeedElemRestriction_count++; 244 CeedElemRestriction_n++; 245 } 246 } 247 248 #define fCeedElemRestrictionCreateBlocked \ 249 FORTRAN_NAME(ceedelemrestrictioncreateblocked,CEEDELEMRESTRICTIONCREATEBLOCKED) 250 void fCeedElemRestrictionCreateBlocked(int *ceed, int *nelements, 251 int *esize, int *blocksize, int *nnodes, 252 int *ncomp, int *mtype, int *cmode, 253 int *blkindices, int *elemrestriction, 254 int *err) { 255 256 if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 257 CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 258 CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 259 } 260 261 CeedElemRestriction *elemrestriction_ = 262 &CeedElemRestriction_dict[CeedElemRestriction_count]; 263 *err = CeedElemRestrictionCreateBlocked(Ceed_dict[*ceed], *nelements, *esize, 264 *blocksize, *nnodes, *ncomp, *mtype, 265 *cmode, blkindices, elemrestriction_); 266 267 if (*err == 0) { 268 *elemrestriction = CeedElemRestriction_count++; 269 CeedElemRestriction_n++; 270 } 271 } 272 273 static CeedRequest *CeedRequest_dict = NULL; 274 static int CeedRequest_count = 0; 275 static int CeedRequest_n = 0; 276 static int CeedRequest_count_max = 0; 277 278 #define fCeedElemRestrictionApply \ 279 FORTRAN_NAME(ceedelemrestrictionapply,CEEDELEMRESTRICTIONAPPLY) 280 void fCeedElemRestrictionApply(int *elemr, int *tmode, int *lmode, 281 int *uvec, int *ruvec, int *rqst, int *err) { 282 int createRequest = 1; 283 // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 284 if (*rqst == FORTRAN_REQUEST_IMMEDIATE || *rqst == FORTRAN_REQUEST_ORDERED) 285 createRequest = 0; 286 287 if (createRequest && CeedRequest_count == CeedRequest_count_max) { 288 CeedRequest_count_max += CeedRequest_count_max/2 + 1; 289 CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 290 } 291 292 CeedRequest *rqst_; 293 if (*rqst == FORTRAN_REQUEST_IMMEDIATE) rqst_ = CEED_REQUEST_IMMEDIATE; 294 else if (*rqst == FORTRAN_REQUEST_ORDERED ) rqst_ = CEED_REQUEST_ORDERED; 295 else rqst_ = &CeedRequest_dict[CeedRequest_count]; 296 297 *err = CeedElemRestrictionApply(CeedElemRestriction_dict[*elemr], *tmode, 298 *lmode, CeedVector_dict[*uvec], 299 CeedVector_dict[*ruvec], rqst_); 300 301 if (*err == 0 && createRequest) { 302 *rqst = CeedRequest_count++; 303 CeedRequest_n++; 304 } 305 } 306 307 #define fCeedElemRestrictionApplyBlock \ 308 FORTRAN_NAME(ceedelemrestrictionapplyblock,CEEDELEMRESTRICTIONAPPLYBLOCK) 309 void fCeedElemRestrictionApplyBlock(int *elemr, int *block, int *tmode, 310 int *lmode, 311 int *uvec, int *ruvec, int *rqst, int *err) { 312 int createRequest = 1; 313 // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 314 if (*rqst == FORTRAN_REQUEST_IMMEDIATE || *rqst == FORTRAN_REQUEST_ORDERED) 315 createRequest = 0; 316 317 if (createRequest && CeedRequest_count == CeedRequest_count_max) { 318 CeedRequest_count_max += CeedRequest_count_max/2 + 1; 319 CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 320 } 321 322 CeedRequest *rqst_; 323 if (*rqst == FORTRAN_REQUEST_IMMEDIATE) rqst_ = CEED_REQUEST_IMMEDIATE; 324 else if (*rqst == FORTRAN_REQUEST_ORDERED ) rqst_ = CEED_REQUEST_ORDERED; 325 else rqst_ = &CeedRequest_dict[CeedRequest_count]; 326 327 *err = CeedElemRestrictionApplyBlock(CeedElemRestriction_dict[*elemr], *block, 328 *tmode, *lmode, CeedVector_dict[*uvec], 329 CeedVector_dict[*ruvec], rqst_); 330 331 if (*err == 0 && createRequest) { 332 *rqst = CeedRequest_count++; 333 CeedRequest_n++; 334 } 335 } 336 337 #define fCeedElemRestrictionGetMultiplicity \ 338 FORTRAN_NAME(ceedelemrestrictiongetmultiplicity,CEEDELEMRESTRICTIONGETMULTIPLICITY) 339 void fCeedElemRestrictionGetMultiplicity(int *elemr, int *mult, int *err) { 340 *err = CeedElemRestrictionGetMultiplicity(CeedElemRestriction_dict[*elemr], 341 CeedVector_dict[*mult]); 342 } 343 344 #define fCeedElemRestrictionView \ 345 FORTRAN_NAME(ceedelemrestrictionview,CEEDELEMRESTRICTIONVIEW) 346 void fCeedElemRestrictionView(int *elemr, int *err) { 347 *err = CeedElemRestrictionView(CeedElemRestriction_dict[*elemr], stdout); 348 } 349 350 #define fCeedRequestWait FORTRAN_NAME(ceedrequestwait, CEEDREQUESTWAIT) 351 void fCeedRequestWait(int *rqst, int *err) { 352 // TODO Uncomment this once CeedRequestWait is implemented 353 //*err = CeedRequestWait(&CeedRequest_dict[*rqst]); 354 355 if (*err == 0) { 356 CeedRequest_n--; 357 if (CeedRequest_n == 0) { 358 CeedFree(&CeedRequest_dict); 359 CeedRequest_count = 0; 360 CeedRequest_count_max = 0; 361 } 362 } 363 } 364 365 #define fCeedElemRestrictionDestroy \ 366 FORTRAN_NAME(ceedelemrestrictiondestroy,CEEDELEMRESTRICTIONDESTROY) 367 void fCeedElemRestrictionDestroy(int *elem, int *err) { 368 *err = CeedElemRestrictionDestroy(&CeedElemRestriction_dict[*elem]); 369 370 if (*err == 0) { 371 CeedElemRestriction_n--; 372 if (CeedElemRestriction_n == 0) { 373 CeedFree(&CeedElemRestriction_dict); 374 CeedElemRestriction_count = 0; 375 CeedElemRestriction_count_max = 0; 376 } 377 } 378 } 379 380 static CeedBasis *CeedBasis_dict = NULL; 381 static int CeedBasis_count = 0; 382 static int CeedBasis_n = 0; 383 static int CeedBasis_count_max = 0; 384 385 #define fCeedBasisCreateTensorH1Lagrange \ 386 FORTRAN_NAME(ceedbasiscreatetensorh1lagrange, CEEDBASISCREATETENSORH1LAGRANGE) 387 void fCeedBasisCreateTensorH1Lagrange(int *ceed, int *dim, 388 int *ncomp, int *P, int *Q, int *quadmode, 389 int *basis, int *err) { 390 if (CeedBasis_count == CeedBasis_count_max) { 391 CeedBasis_count_max += CeedBasis_count_max/2 + 1; 392 CeedRealloc(CeedBasis_count_max, &CeedBasis_dict); 393 } 394 395 *err = CeedBasisCreateTensorH1Lagrange(Ceed_dict[*ceed], *dim, *ncomp, *P, *Q, 396 *quadmode, 397 &CeedBasis_dict[CeedBasis_count]); 398 399 if (*err == 0) { 400 *basis = CeedBasis_count++; 401 CeedBasis_n++; 402 } 403 } 404 405 #define fCeedBasisCreateTensorH1 \ 406 FORTRAN_NAME(ceedbasiscreatetensorh1, CEEDBASISCREATETENSORH1) 407 void fCeedBasisCreateTensorH1(int *ceed, int *dim, int *ncomp, int *P1d, 408 int *Q1d, const CeedScalar *interp1d, 409 const CeedScalar *grad1d, 410 const CeedScalar *qref1d, 411 const CeedScalar *qweight1d, int *basis, 412 int *err) { 413 if (CeedBasis_count == CeedBasis_count_max) { 414 CeedBasis_count_max += CeedBasis_count_max/2 + 1; 415 CeedRealloc(CeedBasis_count_max, &CeedBasis_dict); 416 } 417 418 *err = CeedBasisCreateTensorH1(Ceed_dict[*ceed], *dim, *ncomp, *P1d, *Q1d, 419 interp1d, grad1d, qref1d, qweight1d, 420 &CeedBasis_dict[CeedBasis_count]); 421 422 if (*err == 0) { 423 *basis = CeedBasis_count++; 424 CeedBasis_n++; 425 } 426 } 427 428 #define fCeedBasisCreateH1 \ 429 FORTRAN_NAME(ceedbasiscreateh1, CEEDBASISCREATEH1) 430 void fCeedBasisCreateH1(int *ceed, int *topo, int *ncomp, int *nnodes, 431 int *nqpts, const CeedScalar *interp, 432 const CeedScalar *grad, const CeedScalar *qref, 433 const CeedScalar *qweight, int *basis, int *err) { 434 if (CeedBasis_count == CeedBasis_count_max) { 435 CeedBasis_count_max += CeedBasis_count_max/2 + 1; 436 CeedRealloc(CeedBasis_count_max, &CeedBasis_dict); 437 } 438 439 *err = CeedBasisCreateH1(Ceed_dict[*ceed], *topo, *ncomp, *nnodes, *nqpts, 440 interp, grad, qref, qweight, 441 &CeedBasis_dict[CeedBasis_count]); 442 443 if (*err == 0) { 444 *basis = CeedBasis_count++; 445 CeedBasis_n++; 446 } 447 } 448 449 #define fCeedBasisView FORTRAN_NAME(ceedbasisview, CEEDBASISVIEW) 450 void fCeedBasisView(int *basis, int *err) { 451 *err = CeedBasisView(CeedBasis_dict[*basis], stdout); 452 } 453 454 #define fCeedQRFactorization \ 455 FORTRAN_NAME(ceedqrfactorization, CEEDQRFACTORIZATION) 456 void fCeedQRFactorization(int *ceed, CeedScalar *mat, CeedScalar *tau, int *m, 457 int *n, int *err) { 458 *err = CeedQRFactorization(Ceed_dict[*ceed], mat, tau, *m, *n); 459 } 460 461 #define fCeedSymmetricSchurDecomposition \ 462 FORTRAN_NAME(ceedsymmetricschurdecomposition, CEEDSYMMETRICSCHURDECOMPOSITION) 463 void fCeedSymmetricSchurDecomposition(int *ceed, CeedScalar *mat, 464 CeedScalar *lambda, int *n, int *err) { 465 *err = CeedSymmetricSchurDecomposition(Ceed_dict[*ceed], mat, lambda, *n); 466 } 467 468 #define fCeedSimultaneousDiagonalization \ 469 FORTRAN_NAME(ceedsimultaneousdiagonalization, CEEDSIMULTANEOUSDIAGONALIZATION) 470 void fCeedSimultaneousDiagonalization(int *ceed, CeedScalar *matA, 471 CeedScalar *matB, CeedScalar *x, 472 CeedScalar *lambda, int *n, int *err) { 473 *err = CeedSimultaneousDiagonalization(Ceed_dict[*ceed], matA, matB, x, 474 lambda, *n); 475 } 476 477 #define fCeedBasisGetCollocatedGrad \ 478 FORTRAN_NAME(ceedbasisgetcollocatedgrad, CEEDBASISGETCOLLOCATEDGRAD) 479 void fCeedBasisGetCollocatedGrad(int *basis, CeedScalar *colograd1d, 480 int *err) { 481 *err = CeedBasisGetCollocatedGrad(CeedBasis_dict[*basis], colograd1d); 482 } 483 484 #define fCeedBasisApply FORTRAN_NAME(ceedbasisapply, CEEDBASISAPPLY) 485 void fCeedBasisApply(int *basis, int *nelem, int *tmode, int *emode, 486 int *u, int *v, int *err) { 487 *err = CeedBasisApply(CeedBasis_dict[*basis], *nelem, *tmode, *emode, 488 *u==FORTRAN_VECTOR_NONE? 489 CEED_VECTOR_NONE:CeedVector_dict[*u], 490 CeedVector_dict[*v]); 491 } 492 493 #define fCeedBasisGetNumNodes \ 494 FORTRAN_NAME(ceedbasisgetnumnodes, CEEDBASISGETNUMNODES) 495 void fCeedBasisGetNumNodes(int *basis, int *P, int *err) { 496 *err = CeedBasisGetNumNodes(CeedBasis_dict[*basis], P); 497 } 498 499 #define fCeedBasisGetNumQuadraturePoints \ 500 FORTRAN_NAME(ceedbasisgetnumquadraturepoints, CEEDBASISGETNUMQUADRATUREPOINTS) 501 void fCeedBasisGetNumQuadraturePoints(int *basis, int *Q, int *err) { 502 *err = CeedBasisGetNumQuadraturePoints(CeedBasis_dict[*basis], Q); 503 } 504 505 #define fCeedBasisDestroy FORTRAN_NAME(ceedbasisdestroy,CEEDBASISDESTROY) 506 void fCeedBasisDestroy(int *basis, int *err) { 507 *err = CeedBasisDestroy(&CeedBasis_dict[*basis]); 508 509 if (*err == 0) { 510 CeedBasis_n--; 511 if (CeedBasis_n == 0) { 512 CeedFree(&CeedBasis_dict); 513 CeedBasis_count = 0; 514 CeedBasis_count_max = 0; 515 } 516 } 517 } 518 519 #define fCeedGaussQuadrature FORTRAN_NAME(ceedgaussquadrature, CEEDGAUSSQUADRATURE) 520 void fCeedGaussQuadrature(int *Q, CeedScalar *qref1d, CeedScalar *qweight1d, 521 int *err) { 522 *err = CeedGaussQuadrature(*Q, qref1d, qweight1d); 523 } 524 525 #define fCeedLobattoQuadrature \ 526 FORTRAN_NAME(ceedlobattoquadrature, CEEDLOBATTOQUADRATURE) 527 void fCeedLobattoQuadrature(int *Q, CeedScalar *qref1d, CeedScalar *qweight1d, 528 int *err) { 529 *err = CeedLobattoQuadrature(*Q, qref1d, qweight1d); 530 } 531 532 static CeedQFunction *CeedQFunction_dict = NULL; 533 static int CeedQFunction_count = 0; 534 static int CeedQFunction_n = 0; 535 static int CeedQFunction_count_max = 0; 536 537 static int CeedQFunctionFortranStub(void *ctx, int nq, 538 const CeedScalar *const *u, 539 CeedScalar *const *v) { 540 fContext *fctx = ctx; 541 int ierr; 542 543 CeedScalar *ctx_ = (CeedScalar *) fctx->innerctx; 544 fctx->f((void *)ctx_,&nq,u[0],u[1],u[2],u[3],u[4],u[5],u[6], 545 u[7],u[8],u[9],u[10],u[11],u[12],u[13],u[14],u[15], 546 v[0],v[1],v[2],v[3],v[4],v[5],v[6],v[7],v[8],v[9], 547 v[10],v[11],v[12],v[13],v[14],v[15],&ierr); 548 return ierr; 549 } 550 551 #define fCeedQFunctionCreateInterior \ 552 FORTRAN_NAME(ceedqfunctioncreateinterior, CEEDQFUNCTIONCREATEINTERIOR) 553 void fCeedQFunctionCreateInterior(int *ceed, int *vlength, 554 void (*f)(void *ctx, int *nq, 555 const CeedScalar *u,const CeedScalar *u1, 556 const CeedScalar *u2,const CeedScalar *u3, 557 const CeedScalar *u4,const CeedScalar *u5, 558 const CeedScalar *u6,const CeedScalar *u7, 559 const CeedScalar *u8,const CeedScalar *u9, 560 const CeedScalar *u10,const CeedScalar *u11, 561 const CeedScalar *u12,const CeedScalar *u13, 562 const CeedScalar *u14,const CeedScalar *u15, 563 CeedScalar *v,CeedScalar *v1,CeedScalar *v2, 564 CeedScalar *v3,CeedScalar *v4, 565 CeedScalar *v5,CeedScalar *v6, 566 CeedScalar *v7,CeedScalar *v8, 567 CeedScalar *v9,CeedScalar *v10, 568 CeedScalar *v11,CeedScalar *v12, 569 CeedScalar *v13,CeedScalar *v14, 570 CeedScalar *v15,int *err), 571 const char *source, int *qf, int *err, 572 fortran_charlen_t source_len) { 573 FIX_STRING(source); 574 if (CeedQFunction_count == CeedQFunction_count_max) { 575 CeedQFunction_count_max += CeedQFunction_count_max/2 + 1; 576 CeedRealloc(CeedQFunction_count_max, &CeedQFunction_dict); 577 } 578 579 CeedQFunction *qf_ = &CeedQFunction_dict[CeedQFunction_count]; 580 *err = CeedQFunctionCreateInterior(Ceed_dict[*ceed], *vlength, 581 CeedQFunctionFortranStub, source_c, qf_); 582 583 if (*err == 0) { 584 *qf = CeedQFunction_count++; 585 CeedQFunction_n++; 586 } 587 588 fContext *fctx; 589 *err = CeedMalloc(1, &fctx); 590 if (*err) return; 591 fctx->f = f; fctx->innerctx = NULL; fctx->innerctxsize = 0; 592 593 *err = CeedQFunctionSetContext(*qf_, fctx, sizeof(fContext)); 594 595 (*qf_)->fortranstatus = true; 596 } 597 598 #define fCeedQFunctionCreateInteriorByName \ 599 FORTRAN_NAME(ceedqfunctioncreateinteriorbyname, CEEDQFUNCTIONCREATEINTERIORBYNAME) 600 void fCeedQFunctionCreateInteriorByName(int *ceed, const char *name, int *qf, 601 int *err, fortran_charlen_t name_len) { 602 FIX_STRING(name); 603 if (CeedQFunction_count == CeedQFunction_count_max) { 604 CeedQFunction_count_max += CeedQFunction_count_max/2 + 1; 605 CeedRealloc(CeedQFunction_count_max, &CeedQFunction_dict); 606 } 607 608 CeedQFunction *qf_ = &CeedQFunction_dict[CeedQFunction_count]; 609 *err = CeedQFunctionCreateInteriorByName(Ceed_dict[*ceed], name_c, qf_); 610 611 if (*err == 0) { 612 *qf = CeedQFunction_count++; 613 CeedQFunction_n++; 614 } 615 } 616 617 #define fCeedQFunctionCreateIdentity \ 618 FORTRAN_NAME(ceedqfunctioncreateidentity, CEEDQFUNCTIONCREATEIDENTITY) 619 void fCeedQFunctionCreateIdentity(int *ceed, int *size, int *inmode, 620 int *outmode, int *qf, int *err) { 621 if (CeedQFunction_count == CeedQFunction_count_max) { 622 CeedQFunction_count_max += CeedQFunction_count_max/2 + 1; 623 CeedRealloc(CeedQFunction_count_max, &CeedQFunction_dict); 624 } 625 626 CeedQFunction *qf_ = &CeedQFunction_dict[CeedQFunction_count]; 627 *err = CeedQFunctionCreateIdentity(Ceed_dict[*ceed], *size, *inmode, 628 *outmode, qf_); 629 630 if (*err == 0) { 631 *qf = CeedQFunction_count++; 632 CeedQFunction_n++; 633 } 634 } 635 636 #define fCeedQFunctionAddInput \ 637 FORTRAN_NAME(ceedqfunctionaddinput,CEEDQFUNCTIONADDINPUT) 638 void fCeedQFunctionAddInput(int *qf, const char *fieldname, 639 CeedInt *ncomp, CeedEvalMode *emode, int *err, 640 fortran_charlen_t fieldname_len) { 641 FIX_STRING(fieldname); 642 CeedQFunction qf_ = CeedQFunction_dict[*qf]; 643 644 *err = CeedQFunctionAddInput(qf_, fieldname_c, *ncomp, *emode); 645 } 646 647 #define fCeedQFunctionAddOutput \ 648 FORTRAN_NAME(ceedqfunctionaddoutput,CEEDQFUNCTIONADDOUTPUT) 649 void fCeedQFunctionAddOutput(int *qf, const char *fieldname, 650 CeedInt *ncomp, CeedEvalMode *emode, int *err, 651 fortran_charlen_t fieldname_len) { 652 FIX_STRING(fieldname); 653 CeedQFunction qf_ = CeedQFunction_dict[*qf]; 654 655 *err = CeedQFunctionAddOutput(qf_, fieldname_c, *ncomp, *emode); 656 } 657 658 #define fCeedQFunctionSetContext \ 659 FORTRAN_NAME(ceedqfunctionsetcontext,CEEDQFUNCTIONSETCONTEXT) 660 void fCeedQFunctionSetContext(int *qf, CeedScalar *ctx, CeedInt *n, int *err) { 661 CeedQFunction qf_ = CeedQFunction_dict[*qf]; 662 663 fContext *fctx = qf_->ctx; 664 fctx->innerctx = ctx; 665 fctx->innerctxsize = ((size_t) *n)*sizeof(CeedScalar); 666 } 667 668 #define fCeedQFunctionView \ 669 FORTRAN_NAME(ceedqfunctionview,CEEDQFUNCTIONVIEW) 670 void fCeedQFunctionView(int *qf, int *err) { 671 CeedQFunction qf_ = CeedQFunction_dict[*qf]; 672 673 *err = CeedQFunctionView(qf_, stdout); 674 } 675 676 #define fCeedQFunctionApply \ 677 FORTRAN_NAME(ceedqfunctionapply,CEEDQFUNCTIONAPPLY) 678 //TODO Need Fixing, double pointer 679 void fCeedQFunctionApply(int *qf, int *Q, 680 int *u, int *u1, int *u2, int *u3, 681 int *u4, int *u5, int *u6, int *u7, 682 int *u8, int *u9, int *u10, int *u11, 683 int *u12, int *u13, int *u14, int *u15, 684 int *v, int *v1, int *v2, int *v3, 685 int *v4, int *v5, int *v6, int *v7, 686 int *v8, int *v9, int *v10, int *v11, 687 int *v12, int *v13, int *v14, int *v15, int *err) { 688 CeedQFunction qf_ = CeedQFunction_dict[*qf]; 689 CeedVector *in; 690 *err = CeedCalloc(16, &in); 691 if (*err) return; 692 in[0] = *u==FORTRAN_NULL?NULL:CeedVector_dict[*u]; 693 in[1] = *u1==FORTRAN_NULL?NULL:CeedVector_dict[*u1]; 694 in[2] = *u2==FORTRAN_NULL?NULL:CeedVector_dict[*u2]; 695 in[3] = *u3==FORTRAN_NULL?NULL:CeedVector_dict[*u3]; 696 in[4] = *u4==FORTRAN_NULL?NULL:CeedVector_dict[*u4]; 697 in[5] = *u5==FORTRAN_NULL?NULL:CeedVector_dict[*u5]; 698 in[6] = *u6==FORTRAN_NULL?NULL:CeedVector_dict[*u6]; 699 in[7] = *u7==FORTRAN_NULL?NULL:CeedVector_dict[*u7]; 700 in[8] = *u8==FORTRAN_NULL?NULL:CeedVector_dict[*u8]; 701 in[9] = *u9==FORTRAN_NULL?NULL:CeedVector_dict[*u9]; 702 in[10] = *u10==FORTRAN_NULL?NULL:CeedVector_dict[*u10]; 703 in[11] = *u11==FORTRAN_NULL?NULL:CeedVector_dict[*u11]; 704 in[12] = *u12==FORTRAN_NULL?NULL:CeedVector_dict[*u12]; 705 in[13] = *u13==FORTRAN_NULL?NULL:CeedVector_dict[*u13]; 706 in[14] = *u14==FORTRAN_NULL?NULL:CeedVector_dict[*u14]; 707 in[15] = *u15==FORTRAN_NULL?NULL:CeedVector_dict[*u15]; 708 CeedVector *out; 709 *err = CeedCalloc(16, &out); 710 if (*err) return; 711 out[0] = *v==FORTRAN_NULL?NULL:CeedVector_dict[*v]; 712 out[1] = *v1==FORTRAN_NULL?NULL:CeedVector_dict[*v1]; 713 out[2] = *v2==FORTRAN_NULL?NULL:CeedVector_dict[*v2]; 714 out[3] = *v3==FORTRAN_NULL?NULL:CeedVector_dict[*v3]; 715 out[4] = *v4==FORTRAN_NULL?NULL:CeedVector_dict[*v4]; 716 out[5] = *v5==FORTRAN_NULL?NULL:CeedVector_dict[*v5]; 717 out[6] = *v6==FORTRAN_NULL?NULL:CeedVector_dict[*v6]; 718 out[7] = *v7==FORTRAN_NULL?NULL:CeedVector_dict[*v7]; 719 out[8] = *v8==FORTRAN_NULL?NULL:CeedVector_dict[*v8]; 720 out[9] = *v9==FORTRAN_NULL?NULL:CeedVector_dict[*v9]; 721 out[10] = *v10==FORTRAN_NULL?NULL:CeedVector_dict[*v10]; 722 out[11] = *v11==FORTRAN_NULL?NULL:CeedVector_dict[*v11]; 723 out[12] = *v12==FORTRAN_NULL?NULL:CeedVector_dict[*v12]; 724 out[13] = *v13==FORTRAN_NULL?NULL:CeedVector_dict[*v13]; 725 out[14] = *v14==FORTRAN_NULL?NULL:CeedVector_dict[*v14]; 726 out[15] = *v15==FORTRAN_NULL?NULL:CeedVector_dict[*v15]; 727 *err = CeedQFunctionApply(qf_, *Q, in, out); 728 if (*err) return; 729 730 *err = CeedFree(&in); 731 if (*err) return; 732 *err = CeedFree(&out); 733 } 734 735 #define fCeedQFunctionDestroy \ 736 FORTRAN_NAME(ceedqfunctiondestroy,CEEDQFUNCTIONDESTROY) 737 void fCeedQFunctionDestroy(int *qf, int *err) { 738 bool fstatus; 739 *err = CeedQFunctionGetFortranStatus(CeedQFunction_dict[*qf], &fstatus); 740 if (*err) return; 741 if (fstatus) { 742 fContext *fctx = CeedQFunction_dict[*qf]->ctx; 743 *err = CeedFree(&fctx); 744 if (*err) return; 745 } 746 747 *err = CeedQFunctionDestroy(&CeedQFunction_dict[*qf]); 748 if (*err) return; 749 750 CeedQFunction_n--; 751 if (CeedQFunction_n == 0) { 752 *err = CeedFree(&CeedQFunction_dict); 753 CeedQFunction_count = 0; 754 CeedQFunction_count_max = 0; 755 } 756 } 757 758 static CeedOperator *CeedOperator_dict = NULL; 759 static int CeedOperator_count = 0; 760 static int CeedOperator_n = 0; 761 static int CeedOperator_count_max = 0; 762 763 #define fCeedOperatorCreate \ 764 FORTRAN_NAME(ceedoperatorcreate, CEEDOPERATORCREATE) 765 void fCeedOperatorCreate(int *ceed, 766 int *qf, int *dqf, int *dqfT, int *op, int *err) { 767 if (CeedOperator_count == CeedOperator_count_max) 768 CeedOperator_count_max += CeedOperator_count_max/2 + 1, 769 CeedOperator_dict = realloc(CeedOperator_dict, 770 sizeof(CeedOperator)*CeedOperator_count_max); 771 772 CeedOperator *op_ = &CeedOperator_dict[CeedOperator_count]; 773 774 CeedQFunction dqf_ = CEED_QFUNCTION_NONE, dqfT_ = CEED_QFUNCTION_NONE; 775 if (*dqf != FORTRAN_QFUNCTION_NONE) dqf_ = CeedQFunction_dict[*dqf ]; 776 if (*dqfT != FORTRAN_QFUNCTION_NONE) dqfT_ = CeedQFunction_dict[*dqfT]; 777 778 *err = CeedOperatorCreate(Ceed_dict[*ceed], CeedQFunction_dict[*qf], dqf_, 779 dqfT_, op_); 780 if (*err) return; 781 *op = CeedOperator_count++; 782 CeedOperator_n++; 783 } 784 785 #define fCeedCompositeOperatorCreate \ 786 FORTRAN_NAME(ceedcompositeoperatorcreate, CEEDCOMPOSITEOPERATORCREATE) 787 void fCeedCompositeOperatorCreate(int *ceed, int *op, int *err) { 788 if (CeedOperator_count == CeedOperator_count_max) 789 CeedOperator_count_max += CeedOperator_count_max/2 + 1, 790 CeedOperator_dict = realloc(CeedOperator_dict, 791 sizeof(CeedOperator)*CeedOperator_count_max); 792 793 CeedOperator *op_ = &CeedOperator_dict[CeedOperator_count]; 794 795 *err = CeedCompositeOperatorCreate(Ceed_dict[*ceed], op_); 796 if (*err) return; 797 *op = CeedOperator_count++; 798 CeedOperator_n++; 799 } 800 801 #define fCeedOperatorSetField \ 802 FORTRAN_NAME(ceedoperatorsetfield,CEEDOPERATORSETFIELD) 803 void fCeedOperatorSetField(int *op, const char *fieldname, 804 int *r, int *lmode, int *b, int *v, int *err, 805 fortran_charlen_t fieldname_len) { 806 FIX_STRING(fieldname); 807 CeedElemRestriction r_; 808 CeedBasis b_; 809 CeedVector v_; 810 811 CeedOperator op_ = CeedOperator_dict[*op]; 812 813 if (*r == FORTRAN_NULL) { 814 r_ = NULL; 815 } else { 816 r_ = CeedElemRestriction_dict[*r]; 817 } 818 819 if (*b == FORTRAN_NULL) { 820 b_ = NULL; 821 } else if (*b == FORTRAN_BASIS_COLLOCATED) { 822 b_ = CEED_BASIS_COLLOCATED; 823 } else { 824 b_ = CeedBasis_dict[*b]; 825 } 826 if (*v == FORTRAN_NULL) { 827 v_ = NULL; 828 } else if (*v == FORTRAN_VECTOR_ACTIVE) { 829 v_ = CEED_VECTOR_ACTIVE; 830 } else if (*v == FORTRAN_VECTOR_NONE) { 831 v_ = CEED_VECTOR_NONE; 832 } else { 833 v_ = CeedVector_dict[*v]; 834 } 835 836 *err = CeedOperatorSetField(op_, fieldname_c, r_, *lmode, b_, v_); 837 } 838 839 #define fCeedCompositeOperatorAddSub \ 840 FORTRAN_NAME(ceedcompositeoperatoraddsub, CEEDCOMPOSITEOPERATORADDSUB) 841 void fCeedCompositeOperatorAddSub(int *compositeop, int *subop, int *err) { 842 CeedOperator compositeop_ = CeedOperator_dict[*compositeop]; 843 CeedOperator subop_ = CeedOperator_dict[*subop]; 844 845 *err = CeedCompositeOperatorAddSub(compositeop_, subop_); 846 if (*err) return; 847 } 848 849 #define fCeedOperatorAssembleLinearQFunction FORTRAN_NAME(ceedoperatorassemblelinearqfunction, CEEDOPERATORASSEMBLELINEARQFUNCTION) 850 void fCeedOperatorAssembleLinearQFunction(int *op, int *assembledvec, 851 int *assembledrstr, int *rqst, int *err) { 852 // Vector 853 if (CeedVector_count == CeedVector_count_max) { 854 CeedVector_count_max += CeedVector_count_max/2 + 1; 855 CeedRealloc(CeedVector_count_max, &CeedVector_dict); 856 } 857 CeedVector *assembledvec_ = &CeedVector_dict[CeedVector_count]; 858 859 // Restriction 860 if (CeedElemRestriction_count == CeedElemRestriction_count_max) { 861 CeedElemRestriction_count_max += CeedElemRestriction_count_max/2 + 1; 862 CeedRealloc(CeedElemRestriction_count_max, &CeedElemRestriction_dict); 863 } 864 CeedElemRestriction *rstr_ = 865 &CeedElemRestriction_dict[CeedElemRestriction_count]; 866 867 int createRequest = 1; 868 // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 869 if (*rqst == -1 || *rqst == -2) { 870 createRequest = 0; 871 } 872 873 if (createRequest && CeedRequest_count == CeedRequest_count_max) { 874 CeedRequest_count_max += CeedRequest_count_max/2 + 1; 875 CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 876 } 877 878 CeedRequest *rqst_; 879 if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 880 else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 881 else rqst_ = &CeedRequest_dict[CeedRequest_count]; 882 883 *err = CeedOperatorAssembleLinearQFunction(CeedOperator_dict[*op], 884 assembledvec_, rstr_, rqst_); 885 if (*err) return; 886 if (createRequest) { 887 *rqst = CeedRequest_count++; 888 CeedRequest_n++; 889 } 890 891 if (*err == 0) { 892 *assembledrstr = CeedElemRestriction_count++; 893 CeedElemRestriction_n++; 894 *assembledvec = CeedVector_count++; 895 CeedVector_n++; 896 } 897 } 898 899 #define fCeedOperatorAssembleLinearDiagonal FORTRAN_NAME(ceedoperatorassemblelineardiagonal, CEEDOPERATORASSEMBLELINEARDIAGONAL) 900 void fCeedOperatorAssembleLinearDiagonal(int *op, int *assembledvec, 901 int *rqst, int *err) { 902 // Vector 903 if (CeedVector_count == CeedVector_count_max) { 904 CeedVector_count_max += CeedVector_count_max/2 + 1; 905 CeedRealloc(CeedVector_count_max, &CeedVector_dict); 906 } 907 CeedVector *assembledvec_ = &CeedVector_dict[CeedVector_count]; 908 909 int createRequest = 1; 910 // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 911 if (*rqst == -1 || *rqst == -2) { 912 createRequest = 0; 913 } 914 915 if (createRequest && CeedRequest_count == CeedRequest_count_max) { 916 CeedRequest_count_max += CeedRequest_count_max/2 + 1; 917 CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 918 } 919 920 CeedRequest *rqst_; 921 if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 922 else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 923 else rqst_ = &CeedRequest_dict[CeedRequest_count]; 924 925 *err = CeedOperatorAssembleLinearDiagonal(CeedOperator_dict[*op], 926 assembledvec_, rqst_); 927 if (*err) return; 928 if (createRequest) { 929 *rqst = CeedRequest_count++; 930 CeedRequest_n++; 931 } 932 933 if (*err == 0) { 934 *assembledvec = CeedVector_count++; 935 CeedVector_n++; 936 } 937 } 938 939 #define fCeedOperatorView \ 940 FORTRAN_NAME(ceedoperatorview,CEEDOPERATORVIEW) 941 void fCeedOperatorView(int *op, int *err) { 942 CeedOperator op_ = CeedOperator_dict[*op]; 943 944 *err = CeedOperatorView(op_, stdout); 945 } 946 947 #define fCeedOperatorApply FORTRAN_NAME(ceedoperatorapply, CEEDOPERATORAPPLY) 948 void fCeedOperatorApply(int *op, int *ustatevec, 949 int *resvec, int *rqst, int *err) { 950 CeedVector ustatevec_ = (*ustatevec == FORTRAN_NULL) ? 951 NULL : (*ustatevec == FORTRAN_VECTOR_NONE ? 952 CEED_VECTOR_NONE : CeedVector_dict[*ustatevec]); 953 CeedVector resvec_ = (*resvec == FORTRAN_NULL) ? 954 NULL : (*resvec == FORTRAN_VECTOR_NONE ? 955 CEED_VECTOR_NONE : CeedVector_dict[*resvec]); 956 957 int createRequest = 1; 958 // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 959 if (*rqst == -1 || *rqst == -2) { 960 createRequest = 0; 961 } 962 963 if (createRequest && CeedRequest_count == CeedRequest_count_max) { 964 CeedRequest_count_max += CeedRequest_count_max/2 + 1; 965 CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 966 } 967 968 CeedRequest *rqst_; 969 if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 970 else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 971 else rqst_ = &CeedRequest_dict[CeedRequest_count]; 972 973 *err = CeedOperatorApply(CeedOperator_dict[*op], 974 ustatevec_, resvec_, rqst_); 975 if (*err) return; 976 if (createRequest) { 977 *rqst = CeedRequest_count++; 978 CeedRequest_n++; 979 } 980 } 981 982 #define fCeedOperatorApplyAdd FORTRAN_NAME(ceedoperatorapplyadd, CEEDOPERATORAPPLYADD) 983 void fCeedOperatorApplyAdd(int *op, int *ustatevec, 984 int *resvec, int *rqst, int *err) { 985 CeedVector ustatevec_ = *ustatevec == FORTRAN_NULL 986 ? NULL : CeedVector_dict[*ustatevec]; 987 CeedVector resvec_ = *resvec == FORTRAN_NULL 988 ? NULL : CeedVector_dict[*resvec]; 989 990 int createRequest = 1; 991 // Check if input is CEED_REQUEST_ORDERED(-2) or CEED_REQUEST_IMMEDIATE(-1) 992 if (*rqst == -1 || *rqst == -2) { 993 createRequest = 0; 994 } 995 996 if (createRequest && CeedRequest_count == CeedRequest_count_max) { 997 CeedRequest_count_max += CeedRequest_count_max/2 + 1; 998 CeedRealloc(CeedRequest_count_max, &CeedRequest_dict); 999 } 1000 1001 CeedRequest *rqst_; 1002 if (*rqst == -1) rqst_ = CEED_REQUEST_IMMEDIATE; 1003 else if (*rqst == -2) rqst_ = CEED_REQUEST_ORDERED; 1004 else rqst_ = &CeedRequest_dict[CeedRequest_count]; 1005 1006 *err = CeedOperatorApplyAdd(CeedOperator_dict[*op], 1007 ustatevec_, resvec_, rqst_); 1008 if (*err) return; 1009 if (createRequest) { 1010 *rqst = CeedRequest_count++; 1011 CeedRequest_n++; 1012 } 1013 } 1014 1015 #define fCeedOperatorApplyJacobian \ 1016 FORTRAN_NAME(ceedoperatorapplyjacobian, CEEDOPERATORAPPLYJACOBIAN) 1017 void fCeedOperatorApplyJacobian(int *op, int *qdatavec, int *ustatevec, 1018 int *dustatevec, int *dresvec, int *rqst, 1019 int *err) { 1020 // TODO Uncomment this when CeedOperatorApplyJacobian is implemented 1021 // *err = CeedOperatorApplyJacobian(CeedOperator_dict[*op], CeedVector_dict[*qdatavec], 1022 // CeedVector_dict[*ustatevec], CeedVector_dict[*dustatevec], 1023 // CeedVector_dict[*dresvec], &CeedRequest_dict[*rqst]); 1024 } 1025 1026 #define fCeedOperatorDestroy \ 1027 FORTRAN_NAME(ceedoperatordestroy, CEEDOPERATORDESTROY) 1028 void fCeedOperatorDestroy(int *op, int *err) { 1029 *err = CeedOperatorDestroy(&CeedOperator_dict[*op]); 1030 if (*err) return; 1031 CeedOperator_n--; 1032 if (CeedOperator_n == 0) { 1033 *err = CeedFree(&CeedOperator_dict); 1034 CeedOperator_count = 0; 1035 CeedOperator_count_max = 0; 1036 } 1037 } 1038