ceed-qfunction.c (06988bf74cc6ac18eacafe7930f080803395ba29) ceed-qfunction.c (1d0137909cd290d677dbca28a6953e6505c9d054)
1// Copyright (c) 2017, Lawrence Livermore National Security, LLC. Produced at
2// the Lawrence Livermore National Laboratory. LLNL-CODE-734707. All Rights
3// 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.

--- 472 unchanged lines hidden (view full) ---

481 @ref User
482**/
483int CeedQFunctionCreateInteriorByName(Ceed ceed, const char *name,
484 CeedQFunction *qf) {
485 int ierr;
486 size_t matchlen = 0, matchidx = UINT_MAX;
487 char *name_copy;
488
1// Copyright (c) 2017, Lawrence Livermore National Security, LLC. Produced at
2// the Lawrence Livermore National Laboratory. LLNL-CODE-734707. All Rights
3// 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.

--- 472 unchanged lines hidden (view full) ---

481 @ref User
482**/
483int CeedQFunctionCreateInteriorByName(Ceed ceed, const char *name,
484 CeedQFunction *qf) {
485 int ierr;
486 size_t matchlen = 0, matchidx = UINT_MAX;
487 char *name_copy;
488
489 ierr = CeedQFunctionRegisterAll(); CeedChk(ierr);
489 // Find matching backend
490 if (!name) return CeedError(ceed, 1, "No QFunction name provided");
491 for (size_t i=0; i<num_qfunctions; i++) {
492 size_t n;
493 const char *currname = qfunctions[i].name;
494 for (n = 0; currname[n] && currname[n] == name[n]; n++) {}
495 if (n > matchlen) {
496 matchlen = n;

--- 244 unchanged lines hidden --- 		490 // Find matching backend
491 if (!name) return CeedError(ceed, 1, "No QFunction name provided");
492 for (size_t i=0; i<num_qfunctions; i++) {
493 size_t n;
494 const char *currname = qfunctions[i].name;
495 for (n = 0; currname[n] && currname[n] == name[n]; n++) {}
496 if (n > matchlen) {
497 matchlen = n;

--- 244 unchanged lines hidden ---