Home
last modified time | relevance | path

Searched refs:numLeaves (Results 1 – 9 of 9) sorted by relevance

/petsc/src/dm/impls/plex/
H A Dplexrefine.c26 PetscInt numRoots, numLeaves, l; in DMPlexCreateProcessSF() local
41 PetscCall(PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints)); in DMPlexCreateProcessSF()
42 PetscCall(PetscMalloc1(numLeaves, &ranks)); in DMPlexCreateProcessSF()
43 for (l = 0; l < numLeaves; ++l) ranks[l] = (PetscMPIInt)remotePoints[l].rank; in DMPlexCreateProcessSF()
44 PetscCall(PetscSortRemoveDupsMPIInt(&numLeaves, ranks)); in DMPlexCreateProcessSF()
45 PetscCall(PetscMalloc1(numLeaves, &ranksNew)); in DMPlexCreateProcessSF()
46 PetscCall(PetscMalloc1(numLeaves, &localPointsNew)); in DMPlexCreateProcessSF()
47 PetscCall(PetscMalloc1(numLeaves, &remotePointsNew)); in DMPlexCreateProcessSF()
48 for (l = 0; l < numLeaves; ++l) { in DMPlexCreateProcessSF()
55 …if (processRanks) PetscCall(ISCreateGeneral(PetscObjectComm((PetscObject)dm), numLeaves, ranksNew,… in DMPlexCreateProcessSF()
[all …]
H A Dplexorient.c350 …PetscInt numLeaves, numRoots, dim, h, cStart, cEnd, c, cell, fStart, fEnd, face, off, to… in DMPlexOrient() local
362 PetscCall(PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints)); in DMPlexOrient()
449 if (numLeaves >= 0) { in DMPlexOrient()
463 if (lpoints) PetscCall(PetscFindInt(support[s], numLeaves, lpoints, &l)); in DMPlexOrient()
465 if (support[s] >= 0 && support[s] < numLeaves) l = support[s]; in DMPlexOrient()
501 PetscCall(PetscMalloc1(PetscMax(numLeaves, 0), &neighbors[comp])); in DMPlexOrient()
503 for (l = 0; l < numLeaves; ++l) { in DMPlexOrient()
547 if (numLeaves >= 0) { in DMPlexOrient()
754 PetscInt numLeaves, numRoots, dim, Ncomp, totNeighbors = 0; in DMPlexOrientCells_Internal() local
769 PetscCall(PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints)); in DMPlexOrientCells_Internal()
[all …]
H A Dplexsubmesh.c709 PetscInt numRoots, numLeaves, l, pStart, pEnd, depth = 0, totShift = 0; in DMPlexShiftSF_Single() local
714 PetscCall(PetscSFGetGraph(sf, &numRoots, &numLeaves, &localPoints, &remotePoints)); in DMPlexShiftSF_Single()
721 PetscCall(PetscMalloc1(numLeaves, &glocalPoints)); in DMPlexShiftSF_Single()
722 PetscCall(PetscMalloc1(numLeaves, &gremotePoints)); in DMPlexShiftSF_Single()
723 for (l = 0; l < numLeaves; ++l) { in DMPlexShiftSF_Single()
729 …PetscCall(PetscSFSetGraph(sfNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, … in DMPlexShiftSF_Single()
814 PetscInt cellHeight, cStart, cEnd, c, fStart, fEnd, f, numLeaves, l; in DMPlexCreateVTKLabel_Internal() local
823 PetscCall(PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote)); in DMPlexCreateVTKLabel_Internal()
830 for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) { in DMPlexCreateVTKLabel_Internal()
3713 …PetscInt numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl = 0… in DMPlexCreateSubmeshGeneric_Interpolated() local
[all …]
H A Dplexinterpolate.c1855 PetscInt numRoots, numLeaves, l; in DMPlexUninterpolate() local
1862 PetscCall(PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints)); in DMPlexUninterpolate()
1865 for (l = 0; l < numLeaves; ++l) { in DMPlexUninterpolate()
1873 for (l = 0; l < numLeaves; l++) { in DMPlexUninterpolate()
H A Dplextree.c3561 PetscInt numLeaves, leafStart, leafEnd, l, dof, cdof, gOff; in DMPlexComputeInjectorTree() local
3584 PetscCall(PetscSectionGetDof(multiRootSec, p, &numLeaves)); in DMPlexComputeInjectorTree()
3586 leafEnd = leafStart + numLeaves; in DMPlexComputeInjectorTree()
3665 PetscInt numLeaves, leafStart, leafEnd, l, dof, cdof, gOff; in DMPlexComputeInjectorTree() local
3688 PetscCall(PetscSectionGetDof(multiRootSec, p, &numLeaves)); in DMPlexComputeInjectorTree()
3690 leafEnd = leafStart + numLeaves; in DMPlexComputeInjectorTree()
4113 PetscInt numLeaves, leafStart, leafEnd, l, dof, cdof, gOff; in DMPlexTransferVecTree_Inject() local
4138 PetscCall(PetscSectionGetDof(multiRootSec, p, &numLeaves)); in DMPlexTransferVecTree_Inject()
4140 leafEnd = leafStart + numLeaves; in DMPlexTransferVecTree_Inject()
H A Dplexdistribute.c355 PetscInt pStart, pEnd, p, numLeaves, l, numNeighbors, n; in DMPlexCreateTwoSidedProcessSF() local
365 PetscCall(PetscSFGetGraph(sfPoint, NULL, &numLeaves, NULL, &remotePoints)); in DMPlexCreateTwoSidedProcessSF()
391 for (l = 0; l < numLeaves; ++l) PetscCall(PetscBTSet(neighbors, remotePoints[l].rank)); in DMPlexCreateTwoSidedProcessSF()
H A Dplex.c4500 PetscInt numRoots = 0, numLeaves = 0; in DMPlexStratify_Topological_Private() local
4518 ++numLeaves; in DMPlexStratify_Topological_Private()
4528 if (numRoots + numLeaves == (pEnd - pStart)) { in DMPlexStratify_Topological_Private()
/petsc/src/dm/impls/forest/p4est/
H A Dpforest.h1123 PetscInt numRoots, numLeaves; in DMSetUp_pforest() local
1130 numLeaves = (PetscInt)(postEnd - postStart); in DMSetUp_pforest()
1147 …PetscCall(PetscSFSetGraph(repartSF, numRoots, numLeaves, NULL, PETSC_OWN_POINTER, repartRoots, PET… in DMSetUp_pforest()
2818 PetscInt numLeaves; in DMPforestGetTransferSF_Point() local
2825 numLeaves = 0; in DMPforestGetTransferSF_Point()
2827 if (roots[p - pStartF].index >= 0) numLeaves++; in DMPforestGetTransferSF_Point()
2829 PetscCall(PetscMalloc1(numLeaves, &leaves)); in DMPforestGetTransferSF_Point()
2830 PetscCall(PetscMalloc1(numLeaves, &iremote)); in DMPforestGetTransferSF_Point()
2831 numLeaves = 0; in DMPforestGetTransferSF_Point()
2834 leaves[numLeaves] = p - pStartF; in DMPforestGetTransferSF_Point()
[all …]
/petsc/src/dm/impls/plex/transform/interface/
H A Dplextransform.c1995 PetscInt numRoots, numLeaves, numLeavesNew = 0, l, m; in DMPlexTransformCreateSF() local
2015 PetscCall(PetscSFGetGraph(sf, &numRoots, &numLeaves, &localPoints, &remotePoints)); in DMPlexTransformCreateSF()
2020 for (l = 0; l < numLeaves; ++l) { in DMPlexTransformCreateSF()
2078 for (l = 0, m = 0; l < numLeaves; ++l) { in DMPlexTransformCreateSF()