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