313   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()
428     ni->nodeIdx = newNodeIdx;  in PetscLagNodeIndicesComputeVertexOrder()
461 …->nodeIdxDim; d++) newNodeIdx[revlexOrder[v] * ni->nodeIdxDim + d] = ni->nodeIdx[v * ni->nodeIdxDi…  in PetscLagNodeIndicesComputeVertexOrder()
463   PetscCall(PetscFree(ni->nodeIdx));  in PetscLagNodeIndicesComputeVertexOrder()
464   ni->nodeIdx = newNodeIdx;  in PetscLagNodeIndicesComputeVertexOrder()
485   PetscCall(PetscCalloc1((dim + 1) * (dim + 1), &ni->nodeIdx));  in PetscLagNodeIndicesCreateSimplexVertices()
486   for (d = 0; d < dim + 1; d++) ni->nodeIdx[d * (dim + 2)] = 1;  in PetscLagNodeIndicesCreateSimplexVertices()
511   PetscCall(PetscCalloc1(nodeIdxDim * nVerts, &ni->nodeIdx));  in PetscLagNodeIndicesCreateTensorVertices()
514 …for (g = 0; g < subNodeIdxDim; g++) ni->nodeIdx[f * nodeIdxDim + g] = facetni->nodeIdx[e * subNode…  in PetscLagNodeIndicesCreateTensorVertices()
515       ni->nodeIdx[f * nodeIdxDim + subNodeIdxDim]     = (1 - d);  in PetscLagNodeIndicesCreateTensorVertices()
516       ni->nodeIdx[f * nodeIdxDim + subNodeIdxDim + 1] = d;  in PetscLagNodeIndicesCreateTensorVertices()
552   const PetscInt    *vertIdx       = vert->nodeIdx;  in PetscLagNodeIndicesPushForward()
553   const PetscInt    *subVertIdx    = vertp->nodeIdx;  in PetscLagNodeIndicesPushForward()
554   const PetscInt    *nodeIdx       = nodep->nodeIdx;  in PetscLagNodeIndicesPushForward()  local
599 …    for (n = 0; n < nNodes; n++) pfNodeIdx[n * nodeIdxDim + i] = nodeIdx[n * subNodeIdxDim + subi];  in PetscLagNodeIndicesPushForward()
676   PetscCall(PetscMalloc1(nNodes * nodeIdxDim, &ni->nodeIdx));  in PetscLagNodeIndicesTensor()
682 …for (m = 0; m < tracei->nodeIdxDim; m++) ni->nodeIdx[l * nodeIdxDim + n++] = tracei->nodeIdx[i * t…  in PetscLagNodeIndicesTensor()
683 …for (m = 0; m < fiberi->nodeIdxDim; m++) ni->nodeIdx[l * nodeIdxDim + n++] = fiberi->nodeIdx[j * f…  in PetscLagNodeIndicesTensor()
763   PetscCall(PetscMalloc1(nNodes * nodeIdxDim, &ni->nodeIdx));  in PetscLagNodeIndicesMerge()
765   PetscCall(PetscArraycpy(ni->nodeIdx, niA->nodeIdx, niA->nNodes * nodeIdxDim));  in PetscLagNodeIndicesMerge()
767 …PetscCall(PetscArraycpy(&ni->nodeIdx[niA->nNodes * nodeIdxDim], niB->nodeIdx, niB->nNodes * nodeId…  in PetscLagNodeIndicesMerge()
824       for (j = 0; j < nodeIdxDim; j++) sorter[k++] = ni->nodeIdx[l++];  in PetscLagNodeIndicesGetPermutation()
1365   PetscCall(PetscMalloc1(nNodes * Nk * (dim + 1), &ni->nodeIdx));  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1384         for (j = 0; j < dim + 1; j++) ni->nodeIdx[(k * Nk + c) * (dim + 1) + j] = tup[j] + 1;  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1406           ni->nodeIdx[(k * Nk + c) * (dim + 1) + j] = tup[j] + 1;  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1459   PetscCall(PetscMalloc1(nodeIdxDim * nDofs, &ni->nodeIdx));  in PetscDualSpaceLagrangeCreateAllNodeIdx()
1464     PetscCall(PetscArraycpy(ni->nodeIdx, lag->intNodeIndices->nodeIdx, spintdim * nodeIdxDim));  in PetscDualSpaceLagrangeCreateAllNodeIdx()
1476 …, verti, p, plag->vertIndices, plag->intNodeIndices, 0, formDegree, &ni->nodeIdx[off * nodeIdxDim]…  in PetscDualSpaceLagrangeCreateAllNodeIdx()
1961 …for (j = 0; j < nodeIdxDim; j++) nIdxPerm[i * nodeIdxDim + j] = ni->nodeIdx[perm[i] * nodeIdxDim +…  in MatPermuteByNodeIdx()
1972   PetscCall(PetscFree(ni->nodeIdx));  in MatPermuteByNodeIdx()
1974   ni->nodeIdx = nIdxPerm;  in MatPermuteByNodeIdx()
2494   PetscCall(PetscMalloc1(nNodes * nodeIdxDim, &ni->nodeIdx));  in PetscDualSpaceCreateInteriorSymmetryMatrix_Lagrange()
2497 …ward(dm, vertIndices, 0, vertIndices, intNodeIndices, ornt, formDegree, ni->nodeIdx, ni->nodeVec));  in PetscDualSpaceCreateInteriorSymmetryMatrix_Lagrange()
2503     PetscInt *nind = &(ni->nodeIdx[permOrnt[n] * nodeIdxDim]);  in PetscDualSpaceCreateInteriorSymmetryMatrix_Lagrange()
2508       PetscInt *mind = &(ni->nodeIdx[permOrnt[nEnd] * nodeIdxDim]);  in PetscDualSpaceCreateInteriorSymmetryMatrix_Lagrange()
2522       PetscInt *nind = &(intNodeIndices->nodeIdx[perm[n] * nodeIdxDim]);  in PetscDualSpaceCreateInteriorSymmetryMatrix_Lagrange()
2525         PetscInt *mind = &(intNodeIndices->nodeIdx[perm[m] * nodeIdxDim]);  in PetscDualSpaceCreateInteriorSymmetryMatrix_Lagrange()
2548     PetscInt *nind = &(ni->nodeIdx[permOrnt[n] * nodeIdxDim]);  in PetscDualSpaceCreateInteriorSymmetryMatrix_Lagrange()
2553       PetscInt *mind = &(ni->nodeIdx[permOrnt[nEnd] * nodeIdxDim]);  in PetscDualSpaceCreateInteriorSymmetryMatrix_Lagrange()