119 …ive_Internal(PetscInt dim, PetscInt degree, PetscReal **nodesets, PetscInt tup[], PetscReal node[])  in PetscNodeRecursive_Internal()  argument
127     node[0] = nodesets[degree][tup[0]];  in PetscNodeRecursive_Internal()
128     node[1] = nodesets[degree][tup[1]];  in PetscNodeRecursive_Internal()
132       PetscReal wi = nodesets[degree][degree - tup[i]];  in PetscNodeRecursive_Internal()
134       for (j = 0; j < dim + 1; j++) tup[dim + 1 + j] = tup[j + (j >= i)];  in PetscNodeRecursive_Internal()
135 …PetscCall(PetscNodeRecursive_Internal(dim - 1, degree - tup[i], nodesets, &tup[dim + 1], &node[dim…  in PetscNodeRecursive_Internal()
147   PetscInt   *tup;  in Petsc1DNodeFamilyComputeSimplexNodes()  local
158   PetscCall(PetscCalloc1(dim + 2, &tup));  in Petsc1DNodeFamilyComputeSimplexNodes()
168     tup[0] = degree;  in Petsc1DNodeFamilyComputeSimplexNodes()
169     for (i = 0; i < dim; i++) tup[0] -= tup[i + 1];  in Petsc1DNodeFamilyComputeSimplexNodes()
175         for (i = 0; i < dim; i++) points[dim * k + i] = (PetscReal)tup[i + 1] / (PetscReal)degree;  in Petsc1DNodeFamilyComputeSimplexNodes()
180 …        points[dim * k + i] = ((PetscReal)tup[i + 1] + 1. / (dim + 1.)) / (PetscReal)(degree + 1.);  in Petsc1DNodeFamilyComputeSimplexNodes()
187       for (i = 0; i < dim + 1; i++) tupwork[i] = tup[i];  in Petsc1DNodeFamilyComputeSimplexNodes()
192     PetscCall(PetscDualSpaceLatticePointLexicographic_Internal(dim, degree, &tup[1]));  in Petsc1DNodeFamilyComputeSimplexNodes()
197   PetscCall(PetscFree(tup));  in Petsc1DNodeFamilyComputeSimplexNodes()
1373     PetscInt *tup;  in PetscDualSpaceLagrangeCreateSimplexNodeMat()  local
1376     PetscCall(PetscMalloc1(dim + 1, &tup));  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1381       PetscCall(PetscDTIndexToBary(dim + 1, sum, k, tup));  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1382       for (j = 0; j < dim + 1; j++) tup[j] += numNodeSkip;  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1384         for (j = 0; j < dim + 1; j++) ni->nodeIdx[(k * Nk + c) * (dim + 1) + j] = tup[j] + 1;  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1386       PetscCall(PetscDTBaryToIndex(dim + 1, extraSum, tup, &index));  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1389     PetscCall(PetscFree(tup));  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1393     PetscInt *tup;  in PetscDualSpaceLagrangeCreateSimplexNodeMat()  local
1396     PetscCall(PetscMalloc1(dim + 1, &tup));  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1400       PetscCall(PetscDTIndexToBary(dim + 1, sum, k, tup));  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1406           ni->nodeIdx[(k * Nk + c) * (dim + 1) + j] = tup[j] + 1;  in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1410     PetscCall(PetscFree(tup));  in PetscDualSpaceLagrangeCreateSimplexNodeMat()