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