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