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. 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 /// @file 18 /// Public header for user and utility components of libCEED 19 #ifndef _ceed_h 20 #define _ceed_h 21 22 /// @defgroup Ceed Ceed: core components 23 /// @defgroup CeedVector CeedVector: storing and manipulating vectors 24 /// @defgroup CeedElemRestriction CeedElemRestriction: restriction from local vectors to elements 25 /// @defgroup CeedBasis CeedBasis: fully discrete finite element-like objects 26 /// @defgroup CeedQFunction CeedQFunction: independent operations at quadrature points 27 /// @defgroup CeedOperator CeedOperator: composed FE-type operations on vectors 28 /// 29 /// @page FunctionCategories libCEED: Types of Functions 30 /// libCEED provides three different header files depending upon the type of 31 /// functions a user requires. 32 /// @section Utility Utility Functions 33 /// These functions are intended general utilities that may be useful to 34 /// libCEED developers and users. These functions can generally be found in 35 /// "ceed.h". 36 /// @section Basic User Functions 37 /// These functions are intended to be used by general users of the libCEED 38 /// interface. These functions can generally be found in "ceed.h". 39 /// @section Advanced Backend Developer Functions 40 /// These functions are intended to be used by backend developers of the 41 /// libCEED interface. These functions can generally be found in 42 /// "ceed-backend.h". 43 /// @section Developer Frontend Developer Functions 44 /// These functions are intended to be used by frontend developers of the 45 /// libCEED interface. These functions can generally be found in "ceed-impl.h". 46 47 /** 48 CEED_EXTERN is used in this header to denote all publicly visible symbols. 49 50 No other file should declare publicly visible symbols, thus it should never be 51 used outside ceed.h. 52 */ 53 #ifdef __cplusplus 54 # define CEED_EXTERN extern "C" 55 #else 56 # define CEED_EXTERN extern 57 #endif 58 59 #ifndef CEED_QFUNCTION 60 #define CEED_QFUNCTION(name) \ 61 static const char name ## _loc[] = __FILE__ ":" #name; \ 62 static int name 63 #endif 64 65 #ifndef CeedPragmaSIMD 66 # if defined(__INTEL_COMPILER) &&__INTEL_COMPILER >= 900 67 # define CeedPragmaSIMD _Pragma("simd") 68 # elif defined(__GNUC__) && __GNUC__ >= 5 69 # define CeedPragmaSIMD _Pragma("GCC ivdep") 70 # elif defined(_OPENMP) && _OPENMP >= 201307 // OpenMP-4.0 (July, 2013) 71 # define CeedPragmaSIMD _Pragma("omp simd") 72 # else 73 # define CeedPragmaSIMD 74 # endif 75 #endif 76 77 #include <assert.h> 78 #include <stdint.h> 79 #include <stddef.h> 80 #include <stdarg.h> 81 #include <stdio.h> 82 #include <stdbool.h> 83 84 /// We can discuss ways to avoid forcing these to be compile-time decisions, 85 /// but let's leave that for later. 86 /// Integer type, used for indexing 87 /// @ingroup Ceed 88 typedef int32_t CeedInt; 89 /// Scalar (floating point) type 90 /// @ingroup Ceed 91 typedef double CeedScalar; 92 93 /// Library context created by CeedInit() 94 /// @ingroup Ceed 95 typedef struct Ceed_private *Ceed; 96 /// Non-blocking Ceed interfaces return a CeedRequest. 97 /// To perform an operation immediately, pass \ref CEED_REQUEST_IMMEDIATE instead. 98 /// @ingroup Ceed 99 typedef struct CeedRequest_private *CeedRequest; 100 /// Handle for vectors over the field \ref CeedScalar 101 /// @ingroup CeedVector 102 typedef struct CeedVector_private *CeedVector; 103 /// Handle for object describing restriction to elements 104 /// @ingroup CeedElemRestriction 105 typedef struct CeedElemRestriction_private *CeedElemRestriction; 106 /// Handle for object describing discrete finite element evaluations 107 /// @ingroup CeedBasis 108 typedef struct CeedBasis_private *CeedBasis; 109 /// Handle for object describing functions evaluated independently at quadrature points 110 /// @ingroup CeedQFunction 111 typedef struct CeedQFunction_private *CeedQFunction; 112 /// Handle for object describing FE-type operators acting on vectors 113 /// 114 /// Given an element restriction \f$E\f$, basis evaluator \f$B\f$, and 115 /// quadrature function\f$f\f$, a CeedOperator expresses operations of the form 116 /// $$ E^T B^T f(B E u) $$ 117 /// acting on the vector \f$u\f$. 118 /// @ingroup CeedOperator 119 typedef struct CeedOperator_private *CeedOperator; 120 121 CEED_EXTERN int CeedInit(const char *resource, Ceed *ceed); 122 CEED_EXTERN int CeedGetResource(Ceed ceed, const char **resource); 123 CEED_EXTERN int CeedDestroy(Ceed *ceed); 124 125 CEED_EXTERN int CeedErrorImpl(Ceed, const char *, int, const char *, int, 126 const char *, ...); 127 /// Raise an error on ceed object 128 /// 129 /// @param ceed Ceed library context or NULL 130 /// @param ecode Error code (int) 131 /// @param ... printf-style format string followed by arguments as needed 132 /// 133 /// @ingroup Ceed 134 /// @sa CeedSetErrorHandler() 135 #if defined(__clang__) 136 /// Use nonstandard ternary to convince the compiler/clang-tidy that this 137 /// function never returns zero. 138 # define CeedError(ceed, ecode, ...) \ 139 (CeedErrorImpl((ceed), __FILE__, __LINE__, __func__, (ecode), __VA_ARGS__) ?: (ecode)) 140 #else 141 # define CeedError(ceed, ecode, ...) \ 142 CeedErrorImpl((ceed), __FILE__, __LINE__, __func__, (ecode), __VA_ARGS__) ?: (ecode) 143 #endif 144 /// Specify memory type 145 /// 146 /// Many Ceed interfaces take or return pointers to memory. This enum is used to 147 /// specify where the memory being provided or requested must reside. 148 /// @ingroup Ceed 149 typedef enum { 150 /// Memory resides on the host 151 CEED_MEM_HOST, 152 /// Memory resides on a device (corresponding to \ref Ceed resource) 153 CEED_MEM_DEVICE, 154 } CeedMemType; 155 156 CEED_EXTERN const char *const CeedMemTypes[]; 157 158 CEED_EXTERN int CeedGetPreferredMemType(Ceed ceed, CeedMemType *type); 159 160 /// Conveys ownership status of arrays passed to Ceed interfaces. 161 /// @ingroup Ceed 162 typedef enum { 163 /// Implementation will copy the values and not store the passed pointer. 164 CEED_COPY_VALUES, 165 /// Implementation can use and modify the data provided by the user, but does 166 /// not take ownership. 167 CEED_USE_POINTER, 168 /// Implementation takes ownership of the pointer and will free using 169 /// CeedFree() when done using it. The user should not assume that the 170 /// pointer remains valid after ownership has been transferred. Note that 171 /// arrays allocated using C++ operator new or other allocators cannot 172 /// generally be freed using CeedFree(). CeedFree() is capable of freeing any 173 /// memory that can be freed using free(3). 174 CEED_OWN_POINTER, 175 } CeedCopyMode; 176 177 /// Denotes type of vector norm to be computed 178 /// @ingroup CeedVector 179 typedef enum { 180 /// L_1 norm: sum_i |x_i| 181 CEED_NORM_1, 182 /// L_2 norm: sqrt(sum_i |x_i|^2) 183 CEED_NORM_2, 184 /// L_Infinity norm: max_i |x_i| 185 CEED_NORM_MAX, 186 } CeedNormType; 187 188 CEED_EXTERN const char *const CeedCopyModes[]; 189 190 CEED_EXTERN int CeedVectorCreate(Ceed ceed, CeedInt len, CeedVector *vec); 191 CEED_EXTERN int CeedVectorSetArray(CeedVector vec, CeedMemType mtype, 192 CeedCopyMode cmode, CeedScalar *array); 193 CEED_EXTERN int CeedVectorSetValue(CeedVector vec, CeedScalar value); 194 CEED_EXTERN int CeedVectorSyncArray(CeedVector vec, CeedMemType mtype); 195 CEED_EXTERN int CeedVectorGetArray(CeedVector vec, CeedMemType mtype, 196 CeedScalar **array); 197 CEED_EXTERN int CeedVectorGetArrayRead(CeedVector vec, CeedMemType mtype, 198 const CeedScalar **array); 199 CEED_EXTERN int CeedVectorRestoreArray(CeedVector vec, CeedScalar **array); 200 CEED_EXTERN int CeedVectorRestoreArrayRead(CeedVector vec, 201 const CeedScalar **array); 202 CEED_EXTERN int CeedVectorNorm(CeedVector vec, CeedNormType type, 203 CeedScalar *norm); 204 CEED_EXTERN int CeedVectorView(CeedVector vec, const char *fpfmt, FILE *stream); 205 CEED_EXTERN int CeedVectorGetLength(CeedVector vec, CeedInt *length); 206 CEED_EXTERN int CeedVectorDestroy(CeedVector *vec); 207 208 CEED_EXTERN CeedRequest *const CEED_REQUEST_IMMEDIATE; 209 CEED_EXTERN CeedRequest *const CEED_REQUEST_ORDERED; 210 CEED_EXTERN int CeedRequestWait(CeedRequest *req); 211 212 /// Argument for CeedOperatorSetField that vector is collocated with 213 /// quadrature points, used with QFunction eval mode CEED_EVAL_NONE 214 /// or CEED_EVAL_INTERP only, not with CEED_EVAL_GRAD, CEED_EVAL_DIV, 215 /// or CEED_EVAL_CURL 216 /// @ingroup CeedBasis 217 CEED_EXTERN CeedBasis CEED_BASIS_COLLOCATED; 218 219 /// Argument for CeedOperatorSetField to use active input or output 220 /// @ingroup CeedVector 221 CEED_EXTERN CeedVector CEED_VECTOR_ACTIVE; 222 223 /// Argument for CeedOperatorSetField to use no vector, used with 224 /// qfunction input with eval mode CEED_EVAL_WEIGHTS 225 /// @ingroup CeedVector 226 CEED_EXTERN CeedVector CEED_VECTOR_NONE; 227 228 /// Argument for CeedOperatorCreate that QFunction is not created by user. 229 /// Only used for QFunctions dqf and dqfT. If implemented, a backend may 230 /// attempt to provide the action of these QFunctions. 231 /// @ingroup CeedQFunction 232 CEED_EXTERN CeedQFunction CEED_QFUNCTION_NONE; 233 234 /// Denotes whether a linear transformation or its transpose should be applied 235 /// @ingroup CeedBasis 236 typedef enum { 237 /// Apply the linear transformation 238 CEED_NOTRANSPOSE, 239 /// Apply the transpose 240 CEED_TRANSPOSE 241 } CeedTransposeMode; 242 243 CEED_EXTERN const char *const CeedTransposeModes[]; 244 245 /// Denotes whether a L-vector is ordered [component, node] or [node, component] 246 /// with the right-most index being contiguous in memory 247 /// @ingroup CeedElemRestriction 248 typedef enum { 249 /// L-vector data is not interlaced, ordered [component, node] 250 CEED_NONINTERLACED, 251 /// L-vector data is interlaced, ordered [node, component] 252 CEED_INTERLACED 253 } CeedInterlaceMode; 254 255 CEED_EXTERN const char *const CeedInterlaceModes[]; 256 257 CEED_EXTERN int CeedElemRestrictionCreate(Ceed ceed, CeedInterlaceMode imode, 258 CeedInt nelem, CeedInt elemsize, CeedInt nnodes, CeedInt ncomp, 259 CeedMemType mtype, CeedCopyMode cmode, const CeedInt *indices, 260 CeedElemRestriction *rstr); 261 CEED_EXTERN int CeedElemRestrictionCreateBlocked(Ceed ceed, 262 CeedInterlaceMode imode, CeedInt nelem, CeedInt elemsize, CeedInt blksize, 263 CeedInt nnodes, CeedInt ncomp, CeedMemType mtype, CeedCopyMode cmode, 264 const CeedInt *indices, CeedElemRestriction *rstr); 265 CEED_EXTERN int CeedElemRestrictionCreateStrided(Ceed ceed, 266 CeedInt nelem, CeedInt elemsize, CeedInt nnodes, CeedInt ncomp, 267 CeedInt strides[3], CeedElemRestriction *rstr); 268 CEED_EXTERN int CeedElemRestrictionCreateBlockedStrided(Ceed ceed, 269 CeedInt nelem, CeedInt elemsize, CeedInt blksize, CeedInt nnodes, 270 CeedInt ncomp, CeedInt strides[3], CeedElemRestriction *rstr); 271 CEED_EXTERN int CeedElemRestrictionCreateVector(CeedElemRestriction rstr, 272 CeedVector *lvec, CeedVector *evec); 273 CEED_EXTERN int CeedElemRestrictionApply(CeedElemRestriction rstr, 274 CeedTransposeMode tmode, CeedVector u, CeedVector ru, CeedRequest *request); 275 CEED_EXTERN int CeedElemRestrictionApplyBlock(CeedElemRestriction rstr, 276 CeedInt block, CeedTransposeMode tmode, CeedVector u, CeedVector ru, 277 CeedRequest *request); 278 CEED_EXTERN int CeedElemRestrictionGetIMode(CeedElemRestriction rstr, 279 CeedInterlaceMode *Imode); 280 CEED_EXTERN int CeedElemRestrictionGetNumElements(CeedElemRestriction rstr, 281 CeedInt *numelem); 282 CEED_EXTERN int CeedElemRestrictionGetElementSize(CeedElemRestriction rstr, 283 CeedInt *elemsize); 284 CEED_EXTERN int CeedElemRestrictionGetNumNodes(CeedElemRestriction rstr, 285 CeedInt *numnodes); 286 CEED_EXTERN int CeedElemRestrictionGetNumComponents(CeedElemRestriction rstr, 287 CeedInt *numcomp); 288 CEED_EXTERN int CeedElemRestrictionGetNumBlocks(CeedElemRestriction rstr, 289 CeedInt *numblk); 290 CEED_EXTERN int CeedElemRestrictionGetBlockSize(CeedElemRestriction rstr, 291 CeedInt *blksize); 292 CEED_EXTERN int CeedElemRestrictionGetMultiplicity(CeedElemRestriction rstr, 293 CeedVector mult); 294 CEED_EXTERN int CeedElemRestrictionView(CeedElemRestriction rstr, FILE *stream); 295 CEED_EXTERN int CeedElemRestrictionDestroy(CeedElemRestriction *rstr); 296 297 /// The formalism here is that we have the structure 298 /// \int_\Omega v^T f_0(u, \nabla u, qdata) + (\nabla v)^T f_1(u, \nabla u, qdata) 299 /// where gradients are with respect to the reference element. 300 301 /// Basis evaluation mode 302 /// 303 /// Modes can be bitwise ORed when passing to most functions. 304 /// @ingroup CeedBasis 305 typedef enum { 306 /// Perform no evaluation (either because there is no data or it is already at 307 /// quadrature points) 308 CEED_EVAL_NONE = 0, 309 /// Interpolate from nodes to quadrature points 310 CEED_EVAL_INTERP = 1, 311 /// Evaluate gradients at quadrature points from input in a nodal basis 312 CEED_EVAL_GRAD = 2, 313 /// Evaluate divergence at quadrature points from input in a nodal basis 314 CEED_EVAL_DIV = 4, 315 /// Evaluate curl at quadrature points from input in a nodal basis 316 CEED_EVAL_CURL = 8, 317 /// Using no input, evaluate quadrature weights on the reference element 318 CEED_EVAL_WEIGHT = 16, 319 } CeedEvalMode; 320 321 CEED_EXTERN const char *const CeedEvalModes[]; 322 323 /// Type of quadrature; also used for location of nodes 324 /// @ingroup CeedBasis 325 typedef enum { 326 /// Gauss-Legendre quadrature 327 CEED_GAUSS = 0, 328 /// Gauss-Legendre-Lobatto quadrature 329 CEED_GAUSS_LOBATTO = 1, 330 } CeedQuadMode; 331 332 CEED_EXTERN const char *const CeedQuadModes[]; 333 334 /// Type of basis shape to create non-tensor H1 element basis 335 /// 336 /// Dimension can be extracted with bitwise AND 337 /// (CeedElemTopology & 2**(dim + 2)) == TRUE 338 /// @ingroup CeedBasis 339 typedef enum { 340 /// Line 341 CEED_LINE = 1 << 16 | 0, 342 /// Triangle - 2D shape 343 CEED_TRIANGLE = 2 << 16 | 1, 344 /// Quadralateral - 2D shape 345 CEED_QUAD = 2 << 16 | 2, 346 /// Tetrahedron - 3D shape 347 CEED_TET = 3 << 16 | 3, 348 /// Pyramid - 3D shape 349 CEED_PYRAMID = 3 << 16 | 4, 350 /// Prism - 3D shape 351 CEED_PRISM = 3 << 16 | 5, 352 /// Hexehedron - 3D shape 353 CEED_HEX = 3 << 16 | 6, 354 } CeedElemTopology; 355 356 CEED_EXTERN const char *const CeedElemTopologies[]; 357 358 CEED_EXTERN int CeedBasisCreateTensorH1Lagrange(Ceed ceed, CeedInt dim, 359 CeedInt ncomp, CeedInt P, CeedInt Q, CeedQuadMode qmode, CeedBasis *basis); 360 CEED_EXTERN int CeedBasisCreateTensorH1(Ceed ceed, CeedInt dim, CeedInt ncomp, 361 CeedInt P1d, CeedInt Q1d, 362 const CeedScalar *interp1d, 363 const CeedScalar *grad1d, 364 const CeedScalar *qref1d, 365 const CeedScalar *qweight1d, 366 CeedBasis *basis); 367 CEED_EXTERN int CeedBasisCreateH1(Ceed ceed, CeedElemTopology topo, 368 CeedInt ncomp, 369 CeedInt nnodes, CeedInt nqpts, 370 const CeedScalar *interp, 371 const CeedScalar *grad, 372 const CeedScalar *qref, 373 const CeedScalar *qweight, CeedBasis *basis); 374 CEED_EXTERN int CeedBasisView(CeedBasis basis, FILE *stream); 375 CEED_EXTERN int CeedBasisGetNumNodes(CeedBasis basis, CeedInt *P); 376 CEED_EXTERN int CeedBasisGetNumQuadraturePoints(CeedBasis basis, CeedInt *Q); 377 CEED_EXTERN int CeedBasisApply(CeedBasis basis, CeedInt nelem, 378 CeedTransposeMode tmode, 379 CeedEvalMode emode, CeedVector u, CeedVector v); 380 CEED_EXTERN int CeedBasisDestroy(CeedBasis *basis); 381 382 CEED_EXTERN int CeedGaussQuadrature(CeedInt Q, CeedScalar *qref1d, 383 CeedScalar *qweight1d); 384 CEED_EXTERN int CeedLobattoQuadrature(CeedInt Q, CeedScalar *qref1d, 385 CeedScalar *qweight1d); 386 CEED_EXTERN int CeedQRFactorization(Ceed ceed, CeedScalar *mat, CeedScalar *tau, 387 CeedInt m, CeedInt n); 388 CEED_EXTERN int CeedSymmetricSchurDecomposition(Ceed ceed, CeedScalar *mat, 389 CeedScalar *lambda, CeedInt n); 390 CEED_EXTERN int CeedSimultaneousDiagonalization(Ceed ceed, CeedScalar *matA, 391 CeedScalar *matB, CeedScalar *x, CeedScalar *lambda, CeedInt n); 392 393 /** Handle for the object describing the user CeedQFunction 394 395 @param ctx user-defined context set using CeedQFunctionSetContext() or NULL 396 397 @param Q number of quadrature points at which to evaluate 398 399 @param in array of pointers to each input argument in the order provided 400 by the user in CeedQFunctionAddInput(). Each array has shape 401 `[dim, ncomp, Q]` where `dim` is the geometric dimension for 402 \ref CEED_EVAL_GRAD (`dim=1` for \ref CEED_EVAL_INTERP) and 403 `ncomp` is the number of field components (`ncomp=1` for 404 scalar fields). This results in indexing the `i`th input at 405 quadrature point `j` as `in[i][(d*ncomp + c)*Q + j]`. 406 407 @param out array of pointers to each output array in the order provided 408 using CeedQFunctionAddOutput(). The shapes are as above for 409 \a in. 410 411 @return An error code: 0 - success, otherwise - failure 412 413 @ingroup CeedQFunction 414 **/ 415 typedef int (*CeedQFunctionUser)(void *ctx, const CeedInt Q, 416 const CeedScalar *const *in, 417 CeedScalar *const *out); 418 419 CEED_EXTERN int CeedQFunctionCreateInterior(Ceed ceed, CeedInt vlength, 420 CeedQFunctionUser f, const char *source, CeedQFunction *qf); 421 CEED_EXTERN int CeedQFunctionCreateInteriorByName(Ceed ceed, const char *name, 422 CeedQFunction *qf); 423 CEED_EXTERN int CeedQFunctionCreateIdentity(Ceed ceed, CeedInt size, 424 CeedEvalMode inmode, CeedEvalMode outmode, CeedQFunction *qf); 425 CEED_EXTERN int CeedQFunctionAddInput(CeedQFunction qf, const char *fieldname, 426 CeedInt size, CeedEvalMode emode); 427 CEED_EXTERN int CeedQFunctionAddOutput(CeedQFunction qf, const char *fieldname, 428 CeedInt size, CeedEvalMode emode); 429 CEED_EXTERN int CeedQFunctionSetContext(CeedQFunction qf, void *ctx, 430 size_t ctxsize); 431 CEED_EXTERN int CeedQFunctionView(CeedQFunction qf, FILE *stream); 432 CEED_EXTERN int CeedQFunctionApply(CeedQFunction qf, CeedInt Q, 433 CeedVector *u, CeedVector *v); 434 CEED_EXTERN int CeedQFunctionDestroy(CeedQFunction *qf); 435 436 CEED_EXTERN int CeedOperatorCreate(Ceed ceed, CeedQFunction qf, 437 CeedQFunction dqf, CeedQFunction dqfT, 438 CeedOperator *op); 439 CEED_EXTERN int CeedCompositeOperatorCreate(Ceed ceed, CeedOperator *op); 440 CEED_EXTERN int CeedOperatorSetField(CeedOperator op, const char *fieldname, 441 CeedElemRestriction r, CeedBasis b, 442 CeedVector v); 443 CEED_EXTERN int CeedCompositeOperatorAddSub(CeedOperator compositeop, 444 CeedOperator subop); 445 CEED_EXTERN int CeedOperatorAssembleLinearQFunction(CeedOperator op, 446 CeedVector *assembled, CeedElemRestriction *rstr, CeedRequest *request); 447 CEED_EXTERN int CeedOperatorAssembleLinearDiagonal(CeedOperator op, 448 CeedVector *assembled, CeedRequest *request); 449 CEED_EXTERN int CeedOperatorView(CeedOperator op, FILE *stream); 450 CEED_EXTERN int CeedOperatorCreateFDMElementInverse(CeedOperator op, 451 CeedOperator *fdminv, CeedRequest *request); 452 CEED_EXTERN int CeedOperatorApply(CeedOperator op, CeedVector in, 453 CeedVector out, CeedRequest *request); 454 CEED_EXTERN int CeedOperatorApplyAdd(CeedOperator op, CeedVector in, 455 CeedVector out, CeedRequest *request); 456 CEED_EXTERN int CeedOperatorDestroy(CeedOperator *op); 457 458 /** 459 @brief Return integer power 460 461 @param[in] base The base to exponentiate 462 @param[in] power The power to raise the base to 463 464 @return base^power 465 466 @ref Utility 467 **/ 468 static inline CeedInt CeedIntPow(CeedInt base, CeedInt power) { 469 CeedInt result = 1; 470 while (power) { 471 if (power & 1) result *= base; 472 power >>= 1; 473 base *= base; 474 } 475 return result; 476 } 477 478 /** 479 @brief Return minimum of two integers 480 481 @param[in] a The first integer to compare 482 @param[in] b The second integer to compare 483 484 @return The minimum of the two integers 485 486 @ref Utility 487 **/ 488 static inline CeedInt CeedIntMin(CeedInt a, CeedInt b) { return a < b ? a : b; } 489 490 #endif 491