Home
last modified time | relevance | path

Searched refs:nodeIdx (Results 1 – 2 of 2) sorted by relevance

/petsc/src/dm/dt/dualspace/impls/lagrange/
H A Ddspacelagrange.c313 PetscInt *nodeIdx; /* for each node an index of size nodeIdxDim */ member
320 …Int *nodeIdxDim, PetscInt *nodeVecDim, PetscInt *nNodes, const PetscInt *nodeIdx[], const PetscRea… in PetscLagNodeIndicesGetData_Internal() argument
326 *nodeIdx = ni->nodeIdx; in PetscLagNodeIndicesGetData_Internal()
346 PetscCall(PetscMalloc1(ni->nNodes * ni->nodeIdxDim, &((*niNew)->nodeIdx))); in PetscLagNodeIndicesDuplicate()
347 PetscCall(PetscArraycpy((*niNew)->nodeIdx, ni->nodeIdx, ni->nNodes * ni->nodeIdxDim)); in PetscLagNodeIndicesDuplicate()
362 PetscCall(PetscFree((*ni)->nodeIdx)); in PetscLagNodeIndicesDestroy()
410 const PetscInt *iv = &(ni->nodeIdx[idxOrder[v] * nodeIdxDim]); in PetscLagNodeIndicesComputeVertexOrder()
411 const PetscInt *iw = &(ni->nodeIdx[idxOrder[w] * nodeIdxDim]); in PetscLagNodeIndicesComputeVertexOrder()
425 …for (d = 0; d < nodeIdxDim; d++) newNodeIdx[v * ni->nodeIdxDim + d] = ni->nodeIdx[idxOrder[v] * no… in PetscLagNodeIndicesComputeVertexOrder()
427 PetscCall(PetscFree(ni->nodeIdx)); in PetscLagNodeIndicesComputeVertexOrder()
[all …]
/petsc/src/dm/dt/dualspace/impls/lagrange/tests/
H A Dex1.c219 const PetscInt *nodeIdx; in testLagrange() local
224 …dicesGetData_Internal(lag->allNodeIndices, &nodeIdxDim, &nodeVecDim, &nNodes, &nodeIdx, &nodeVec)); in testLagrange()
237 …xDim; j++) PetscCall(PetscPrintf(PETSC_COMM_SELF, " %" PetscInt_FMT ",", nodeIdx[i * nodeIdxDim + … in testLagrange()
263 PetscCall(PetscArraycmp(intNodeIdx, nodeIdx, nodeIdxDim * intNnodes, &same)); in testLagrange()