170034214SMatthew G. Knepley #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 270034214SMatthew G. Knepley #include <petscsf.h> 370034214SMatthew G. Knepley 470034214SMatthew G. Knepley #undef __FUNCT__ 570034214SMatthew G. Knepley #define __FUNCT__ "DMPlexSetAdjacencyUseCone" 670034214SMatthew G. Knepley /*@ 770034214SMatthew G. Knepley DMPlexSetAdjacencyUseCone - Define adjacency in the mesh using either the cone or the support first 870034214SMatthew G. Knepley 970034214SMatthew G. Knepley Input Parameters: 1070034214SMatthew G. Knepley + dm - The DM object 1170034214SMatthew G. Knepley - useCone - Flag to use the cone first 1270034214SMatthew G. Knepley 1370034214SMatthew G. Knepley Level: intermediate 1470034214SMatthew G. Knepley 1570034214SMatthew G. Knepley Notes: 1670034214SMatthew G. Knepley $ FEM: Two points p and q are adjacent if q \in closure(star(p)), useCone = PETSC_FALSE, useClosure = PETSC_TRUE 1770034214SMatthew G. Knepley $ FVM: Two points p and q are adjacent if q \in star(cone(p)), useCone = PETSC_TRUE, useClosure = PETSC_FALSE 1870034214SMatthew G. Knepley $ FVM++: Two points p and q are adjacent if q \in star(closure(p)), useCone = PETSC_TRUE, useClosure = PETSC_TRUE 1970034214SMatthew G. Knepley 2070034214SMatthew G. Knepley .seealso: DMPlexGetAdjacencyUseCone(), DMPlexSetAdjacencyUseClosure(), DMPlexGetAdjacencyUseClosure(), DMPlexDistribute(), DMPlexPreallocateOperator() 2170034214SMatthew G. Knepley @*/ 2270034214SMatthew G. Knepley PetscErrorCode DMPlexSetAdjacencyUseCone(DM dm, PetscBool useCone) 2370034214SMatthew G. Knepley { 2470034214SMatthew G. Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 2570034214SMatthew G. Knepley 2670034214SMatthew G. Knepley PetscFunctionBegin; 2770034214SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2870034214SMatthew G. Knepley mesh->useCone = useCone; 2970034214SMatthew G. Knepley PetscFunctionReturn(0); 3070034214SMatthew G. Knepley } 3170034214SMatthew G. Knepley 3270034214SMatthew G. Knepley #undef __FUNCT__ 3370034214SMatthew G. Knepley #define __FUNCT__ "DMPlexGetAdjacencyUseCone" 3470034214SMatthew G. Knepley /*@ 3570034214SMatthew G. Knepley DMPlexGetAdjacencyUseCone - Query whether adjacency in the mesh uses the cone or the support first 3670034214SMatthew G. Knepley 3770034214SMatthew G. Knepley Input Parameter: 3870034214SMatthew G. Knepley . dm - The DM object 3970034214SMatthew G. Knepley 4070034214SMatthew G. Knepley Output Parameter: 4170034214SMatthew G. Knepley . useCone - Flag to use the cone first 4270034214SMatthew G. Knepley 4370034214SMatthew G. Knepley Level: intermediate 4470034214SMatthew G. Knepley 4570034214SMatthew G. Knepley Notes: 4670034214SMatthew G. Knepley $ FEM: Two points p and q are adjacent if q \in closure(star(p)), useCone = PETSC_FALSE, useClosure = PETSC_TRUE 4770034214SMatthew G. Knepley $ FVM: Two points p and q are adjacent if q \in star(cone(p)), useCone = PETSC_TRUE, useClosure = PETSC_FALSE 4870034214SMatthew G. Knepley $ FVM++: Two points p and q are adjacent if q \in star(closure(p)), useCone = PETSC_TRUE, useClosure = PETSC_TRUE 4970034214SMatthew G. Knepley 5070034214SMatthew G. Knepley .seealso: DMPlexSetAdjacencyUseCone(), DMPlexSetAdjacencyUseClosure(), DMPlexGetAdjacencyUseClosure(), DMPlexDistribute(), DMPlexPreallocateOperator() 5170034214SMatthew G. Knepley @*/ 5270034214SMatthew G. Knepley PetscErrorCode DMPlexGetAdjacencyUseCone(DM dm, PetscBool *useCone) 5370034214SMatthew G. Knepley { 5470034214SMatthew G. Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 5570034214SMatthew G. Knepley 5670034214SMatthew G. Knepley PetscFunctionBegin; 5770034214SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5870034214SMatthew G. Knepley PetscValidIntPointer(useCone, 2); 5970034214SMatthew G. Knepley *useCone = mesh->useCone; 6070034214SMatthew G. Knepley PetscFunctionReturn(0); 6170034214SMatthew G. Knepley } 6270034214SMatthew G. Knepley 6370034214SMatthew G. Knepley #undef __FUNCT__ 6470034214SMatthew G. Knepley #define __FUNCT__ "DMPlexSetAdjacencyUseClosure" 6570034214SMatthew G. Knepley /*@ 6670034214SMatthew G. Knepley DMPlexSetAdjacencyUseClosure - Define adjacency in the mesh using the transitive closure 6770034214SMatthew G. Knepley 6870034214SMatthew G. Knepley Input Parameters: 6970034214SMatthew G. Knepley + dm - The DM object 7070034214SMatthew G. Knepley - useClosure - Flag to use the closure 7170034214SMatthew G. Knepley 7270034214SMatthew G. Knepley Level: intermediate 7370034214SMatthew G. Knepley 7470034214SMatthew G. Knepley Notes: 7570034214SMatthew G. Knepley $ FEM: Two points p and q are adjacent if q \in closure(star(p)), useCone = PETSC_FALSE, useClosure = PETSC_TRUE 7670034214SMatthew G. Knepley $ FVM: Two points p and q are adjacent if q \in star(cone(p)), useCone = PETSC_TRUE, useClosure = PETSC_FALSE 7770034214SMatthew G. Knepley $ FVM++: Two points p and q are adjacent if q \in star(closure(p)), useCone = PETSC_TRUE, useClosure = PETSC_TRUE 7870034214SMatthew G. Knepley 7970034214SMatthew G. Knepley .seealso: DMPlexGetAdjacencyUseClosure(), DMPlexSetAdjacencyUseCone(), DMPlexGetAdjacencyUseCone(), DMPlexDistribute(), DMPlexPreallocateOperator() 8070034214SMatthew G. Knepley @*/ 8170034214SMatthew G. Knepley PetscErrorCode DMPlexSetAdjacencyUseClosure(DM dm, PetscBool useClosure) 8270034214SMatthew G. Knepley { 8370034214SMatthew G. Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 8470034214SMatthew G. Knepley 8570034214SMatthew G. Knepley PetscFunctionBegin; 8670034214SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 8770034214SMatthew G. Knepley mesh->useClosure = useClosure; 8870034214SMatthew G. Knepley PetscFunctionReturn(0); 8970034214SMatthew G. Knepley } 9070034214SMatthew G. Knepley 9170034214SMatthew G. Knepley #undef __FUNCT__ 9270034214SMatthew G. Knepley #define __FUNCT__ "DMPlexGetAdjacencyUseClosure" 9370034214SMatthew G. Knepley /*@ 9470034214SMatthew G. Knepley DMPlexGetAdjacencyUseClosure - Query whether adjacency in the mesh uses the transitive closure 9570034214SMatthew G. Knepley 9670034214SMatthew G. Knepley Input Parameter: 9770034214SMatthew G. Knepley . dm - The DM object 9870034214SMatthew G. Knepley 9970034214SMatthew G. Knepley Output Parameter: 10070034214SMatthew G. Knepley . useClosure - Flag to use the closure 10170034214SMatthew G. Knepley 10270034214SMatthew G. Knepley Level: intermediate 10370034214SMatthew G. Knepley 10470034214SMatthew G. Knepley Notes: 10570034214SMatthew G. Knepley $ FEM: Two points p and q are adjacent if q \in closure(star(p)), useCone = PETSC_FALSE, useClosure = PETSC_TRUE 10670034214SMatthew G. Knepley $ FVM: Two points p and q are adjacent if q \in star(cone(p)), useCone = PETSC_TRUE, useClosure = PETSC_FALSE 10770034214SMatthew G. Knepley $ FVM++: Two points p and q are adjacent if q \in star(closure(p)), useCone = PETSC_TRUE, useClosure = PETSC_TRUE 10870034214SMatthew G. Knepley 10970034214SMatthew G. Knepley .seealso: DMPlexSetAdjacencyUseClosure(), DMPlexSetAdjacencyUseCone(), DMPlexGetAdjacencyUseCone(), DMPlexDistribute(), DMPlexPreallocateOperator() 11070034214SMatthew G. Knepley @*/ 11170034214SMatthew G. Knepley PetscErrorCode DMPlexGetAdjacencyUseClosure(DM dm, PetscBool *useClosure) 11270034214SMatthew G. Knepley { 11370034214SMatthew G. Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 11470034214SMatthew G. Knepley 11570034214SMatthew G. Knepley PetscFunctionBegin; 11670034214SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 11770034214SMatthew G. Knepley PetscValidIntPointer(useClosure, 2); 11870034214SMatthew G. Knepley *useClosure = mesh->useClosure; 11970034214SMatthew G. Knepley PetscFunctionReturn(0); 12070034214SMatthew G. Knepley } 12170034214SMatthew G. Knepley 12270034214SMatthew G. Knepley #undef __FUNCT__ 12370034214SMatthew G. Knepley #define __FUNCT__ "DMPlexGetAdjacency_Cone_Internal" 12470034214SMatthew G. Knepley static PetscErrorCode DMPlexGetAdjacency_Cone_Internal(DM dm, PetscInt p, PetscInt *adjSize, PetscInt adj[]) 12570034214SMatthew G. Knepley { 12670034214SMatthew G. Knepley const PetscInt *cone = NULL; 12770034214SMatthew G. Knepley PetscInt numAdj = 0, maxAdjSize = *adjSize, coneSize, c; 12870034214SMatthew G. Knepley PetscErrorCode ierr; 12970034214SMatthew G. Knepley 13070034214SMatthew G. Knepley PetscFunctionBeginHot; 13170034214SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 13270034214SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 13370034214SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 13470034214SMatthew G. Knepley const PetscInt *support = NULL; 13570034214SMatthew G. Knepley PetscInt supportSize, s, q; 13670034214SMatthew G. Knepley 13770034214SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 13870034214SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 13970034214SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 14070034214SMatthew G. Knepley for (q = 0; q < numAdj || (adj[numAdj++] = support[s],0); ++q) { 14170034214SMatthew G. Knepley if (support[s] == adj[q]) break; 14270034214SMatthew G. Knepley } 14370034214SMatthew G. Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 14470034214SMatthew G. Knepley } 14570034214SMatthew G. Knepley } 14670034214SMatthew G. Knepley *adjSize = numAdj; 14770034214SMatthew G. Knepley PetscFunctionReturn(0); 14870034214SMatthew G. Knepley } 14970034214SMatthew G. Knepley 15070034214SMatthew G. Knepley #undef __FUNCT__ 15170034214SMatthew G. Knepley #define __FUNCT__ "DMPlexGetAdjacency_Support_Internal" 15270034214SMatthew G. Knepley static PetscErrorCode DMPlexGetAdjacency_Support_Internal(DM dm, PetscInt p, PetscInt *adjSize, PetscInt adj[]) 15370034214SMatthew G. Knepley { 15470034214SMatthew G. Knepley const PetscInt *support = NULL; 15570034214SMatthew G. Knepley PetscInt numAdj = 0, maxAdjSize = *adjSize, supportSize, s; 15670034214SMatthew G. Knepley PetscErrorCode ierr; 15770034214SMatthew G. Knepley 15870034214SMatthew G. Knepley PetscFunctionBeginHot; 15970034214SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 16070034214SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 16170034214SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 16270034214SMatthew G. Knepley const PetscInt *cone = NULL; 16370034214SMatthew G. Knepley PetscInt coneSize, c, q; 16470034214SMatthew G. Knepley 16570034214SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 16670034214SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 16770034214SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 16870034214SMatthew G. Knepley for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) { 16970034214SMatthew G. Knepley if (cone[c] == adj[q]) break; 17070034214SMatthew G. Knepley } 17170034214SMatthew G. Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 17270034214SMatthew G. Knepley } 17370034214SMatthew G. Knepley } 17470034214SMatthew G. Knepley *adjSize = numAdj; 17570034214SMatthew G. Knepley PetscFunctionReturn(0); 17670034214SMatthew G. Knepley } 17770034214SMatthew G. Knepley 17870034214SMatthew G. Knepley #undef __FUNCT__ 17970034214SMatthew G. Knepley #define __FUNCT__ "DMPlexGetAdjacency_Transitive_Internal" 18070034214SMatthew G. Knepley static PetscErrorCode DMPlexGetAdjacency_Transitive_Internal(DM dm, PetscInt p, PetscBool useClosure, PetscInt *adjSize, PetscInt adj[]) 18170034214SMatthew G. Knepley { 18270034214SMatthew G. Knepley PetscInt *star = NULL; 18370034214SMatthew G. Knepley PetscInt numAdj = 0, maxAdjSize = *adjSize, starSize, s; 18470034214SMatthew G. Knepley PetscErrorCode ierr; 18570034214SMatthew G. Knepley 18670034214SMatthew G. Knepley PetscFunctionBeginHot; 18770034214SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, p, useClosure, &starSize, &star);CHKERRQ(ierr); 18870034214SMatthew G. Knepley for (s = 0; s < starSize*2; s += 2) { 18970034214SMatthew G. Knepley const PetscInt *closure = NULL; 19070034214SMatthew G. Knepley PetscInt closureSize, c, q; 19170034214SMatthew G. Knepley 19270034214SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, star[s], (PetscBool)!useClosure, &closureSize, (PetscInt**) &closure);CHKERRQ(ierr); 19370034214SMatthew G. Knepley for (c = 0; c < closureSize*2; c += 2) { 19470034214SMatthew G. Knepley for (q = 0; q < numAdj || (adj[numAdj++] = closure[c],0); ++q) { 19570034214SMatthew G. Knepley if (closure[c] == adj[q]) break; 19670034214SMatthew G. Knepley } 19770034214SMatthew G. Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 19870034214SMatthew G. Knepley } 19970034214SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, star[s], (PetscBool)!useClosure, &closureSize, (PetscInt**) &closure);CHKERRQ(ierr); 20070034214SMatthew G. Knepley } 20170034214SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, p, useClosure, &starSize, &star);CHKERRQ(ierr); 20270034214SMatthew G. Knepley *adjSize = numAdj; 20370034214SMatthew G. Knepley PetscFunctionReturn(0); 20470034214SMatthew G. Knepley } 20570034214SMatthew G. Knepley 20670034214SMatthew G. Knepley #undef __FUNCT__ 20770034214SMatthew G. Knepley #define __FUNCT__ "DMPlexGetAdjacency_Internal" 20879bad331SMatthew G. Knepley PetscErrorCode DMPlexGetAdjacency_Internal(DM dm, PetscInt p, PetscBool useCone, PetscBool useTransitiveClosure, PetscInt *adjSize, PetscInt *adj[]) 20970034214SMatthew G. Knepley { 21079bad331SMatthew G. Knepley static PetscInt asiz = 0; 21170034214SMatthew G. Knepley PetscErrorCode ierr; 21270034214SMatthew G. Knepley 21370034214SMatthew G. Knepley PetscFunctionBeginHot; 21479bad331SMatthew G. Knepley if (!*adj) { 21579bad331SMatthew G. Knepley PetscInt depth, maxConeSize, maxSupportSize; 21679bad331SMatthew G. Knepley 21779bad331SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 21879bad331SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 21979bad331SMatthew G. Knepley asiz = PetscPowInt(maxConeSize, depth+1) * PetscPowInt(maxSupportSize, depth+1) + 1; 22079bad331SMatthew G. Knepley ierr = PetscMalloc1(asiz,adj);CHKERRQ(ierr); 22179bad331SMatthew G. Knepley } 22279bad331SMatthew G. Knepley if (*adjSize < 0) *adjSize = asiz; 22370034214SMatthew G. Knepley if (useTransitiveClosure) { 22479bad331SMatthew G. Knepley ierr = DMPlexGetAdjacency_Transitive_Internal(dm, p, useCone, adjSize, *adj);CHKERRQ(ierr); 22570034214SMatthew G. Knepley } else if (useCone) { 22679bad331SMatthew G. Knepley ierr = DMPlexGetAdjacency_Cone_Internal(dm, p, adjSize, *adj);CHKERRQ(ierr); 22770034214SMatthew G. Knepley } else { 22879bad331SMatthew G. Knepley ierr = DMPlexGetAdjacency_Support_Internal(dm, p, adjSize, *adj);CHKERRQ(ierr); 22970034214SMatthew G. Knepley } 23070034214SMatthew G. Knepley PetscFunctionReturn(0); 23170034214SMatthew G. Knepley } 23270034214SMatthew G. Knepley 23370034214SMatthew G. Knepley #undef __FUNCT__ 23470034214SMatthew G. Knepley #define __FUNCT__ "DMPlexGetAdjacency" 23570034214SMatthew G. Knepley /*@ 23670034214SMatthew G. Knepley DMPlexGetAdjacency - Return all points adjacent to the given point 23770034214SMatthew G. Knepley 23870034214SMatthew G. Knepley Input Parameters: 23970034214SMatthew G. Knepley + dm - The DM object 24070034214SMatthew G. Knepley . p - The point 24170034214SMatthew G. Knepley . adjSize - The maximum size of adj if it is non-NULL, or PETSC_DETERMINE 24270034214SMatthew G. Knepley - adj - Either NULL so that the array is allocated, or an existing array with size adjSize 24370034214SMatthew G. Knepley 24470034214SMatthew G. Knepley Output Parameters: 24570034214SMatthew G. Knepley + adjSize - The number of adjacent points 24670034214SMatthew G. Knepley - adj - The adjacent points 24770034214SMatthew G. Knepley 24870034214SMatthew G. Knepley Level: advanced 24970034214SMatthew G. Knepley 25070034214SMatthew G. Knepley Notes: The user must PetscFree the adj array if it was not passed in. 25170034214SMatthew G. Knepley 25270034214SMatthew G. Knepley .seealso: DMPlexSetAdjacencyUseCone(), DMPlexSetAdjacencyUseClosure(), DMPlexDistribute(), DMCreateMatrix(), DMPlexPreallocateOperator() 25370034214SMatthew G. Knepley @*/ 25470034214SMatthew G. Knepley PetscErrorCode DMPlexGetAdjacency(DM dm, PetscInt p, PetscInt *adjSize, PetscInt *adj[]) 25570034214SMatthew G. Knepley { 25670034214SMatthew G. Knepley DM_Plex *mesh = (DM_Plex *) dm->data; 25770034214SMatthew G. Knepley PetscErrorCode ierr; 25870034214SMatthew G. Knepley 25970034214SMatthew G. Knepley PetscFunctionBeginHot; 26070034214SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 26170034214SMatthew G. Knepley PetscValidPointer(adjSize,3); 26270034214SMatthew G. Knepley PetscValidPointer(adj,4); 26379bad331SMatthew G. Knepley ierr = DMPlexGetAdjacency_Internal(dm, p, mesh->useCone, mesh->useClosure, adjSize, adj);CHKERRQ(ierr); 26470034214SMatthew G. Knepley PetscFunctionReturn(0); 26570034214SMatthew G. Knepley } 26670034214SMatthew G. Knepley 26770034214SMatthew G. Knepley #undef __FUNCT__ 26870034214SMatthew G. Knepley #define __FUNCT__ "DMPlexDistributeField" 26970034214SMatthew G. Knepley /*@ 27070034214SMatthew G. Knepley DMPlexDistributeField - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 27170034214SMatthew G. Knepley 27270034214SMatthew G. Knepley Collective on DM 27370034214SMatthew G. Knepley 27470034214SMatthew G. Knepley Input Parameters: 27570034214SMatthew G. Knepley + dm - The DMPlex object 27670034214SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 27770034214SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 27870034214SMatthew G. Knepley - originalVec - The existing data 27970034214SMatthew G. Knepley 28070034214SMatthew G. Knepley Output Parameters: 28170034214SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 28270034214SMatthew G. Knepley - newVec - The new data 28370034214SMatthew G. Knepley 28470034214SMatthew G. Knepley Level: developer 28570034214SMatthew G. Knepley 28670034214SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeData() 28770034214SMatthew G. Knepley @*/ 28870034214SMatthew G. Knepley PetscErrorCode DMPlexDistributeField(DM dm, PetscSF pointSF, PetscSection originalSection, Vec originalVec, PetscSection newSection, Vec newVec) 28970034214SMatthew G. Knepley { 29070034214SMatthew G. Knepley PetscSF fieldSF; 29170034214SMatthew G. Knepley PetscInt *remoteOffsets, fieldSize; 29270034214SMatthew G. Knepley PetscScalar *originalValues, *newValues; 29370034214SMatthew G. Knepley PetscErrorCode ierr; 29470034214SMatthew G. Knepley 29570034214SMatthew G. Knepley PetscFunctionBegin; 29670034214SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeField,dm,0,0,0);CHKERRQ(ierr); 29770034214SMatthew G. Knepley ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 29870034214SMatthew G. Knepley 29970034214SMatthew G. Knepley ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 30070034214SMatthew G. Knepley ierr = VecSetSizes(newVec, fieldSize, PETSC_DETERMINE);CHKERRQ(ierr); 30170034214SMatthew G. Knepley ierr = VecSetType(newVec,dm->vectype);CHKERRQ(ierr); 30270034214SMatthew G. Knepley 30370034214SMatthew G. Knepley ierr = VecGetArray(originalVec, &originalValues);CHKERRQ(ierr); 30470034214SMatthew G. Knepley ierr = VecGetArray(newVec, &newValues);CHKERRQ(ierr); 30570034214SMatthew G. Knepley ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 30670034214SMatthew G. Knepley ierr = PetscSFBcastBegin(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 30770034214SMatthew G. Knepley ierr = PetscSFBcastEnd(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 30870034214SMatthew G. Knepley ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 30970034214SMatthew G. Knepley ierr = VecRestoreArray(newVec, &newValues);CHKERRQ(ierr); 31070034214SMatthew G. Knepley ierr = VecRestoreArray(originalVec, &originalValues);CHKERRQ(ierr); 31170034214SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeField,dm,0,0,0);CHKERRQ(ierr); 31270034214SMatthew G. Knepley PetscFunctionReturn(0); 31370034214SMatthew G. Knepley } 31470034214SMatthew G. Knepley 31570034214SMatthew G. Knepley #undef __FUNCT__ 31670034214SMatthew G. Knepley #define __FUNCT__ "DMPlexDistributeData" 31770034214SMatthew G. Knepley /*@ 31870034214SMatthew G. Knepley DMPlexDistributeData - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 31970034214SMatthew G. Knepley 32070034214SMatthew G. Knepley Collective on DM 32170034214SMatthew G. Knepley 32270034214SMatthew G. Knepley Input Parameters: 32370034214SMatthew G. Knepley + dm - The DMPlex object 32470034214SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 32570034214SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 32670034214SMatthew G. Knepley . datatype - The type of data 32770034214SMatthew G. Knepley - originalData - The existing data 32870034214SMatthew G. Knepley 32970034214SMatthew G. Knepley Output Parameters: 33070034214SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 33170034214SMatthew G. Knepley - newData - The new data 33270034214SMatthew G. Knepley 33370034214SMatthew G. Knepley Level: developer 33470034214SMatthew G. Knepley 33570034214SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeField() 33670034214SMatthew G. Knepley @*/ 33770034214SMatthew G. Knepley PetscErrorCode DMPlexDistributeData(DM dm, PetscSF pointSF, PetscSection originalSection, MPI_Datatype datatype, void *originalData, PetscSection newSection, void **newData) 33870034214SMatthew G. Knepley { 33970034214SMatthew G. Knepley PetscSF fieldSF; 34070034214SMatthew G. Knepley PetscInt *remoteOffsets, fieldSize; 34170034214SMatthew G. Knepley PetscMPIInt dataSize; 34270034214SMatthew G. Knepley PetscErrorCode ierr; 34370034214SMatthew G. Knepley 34470034214SMatthew G. Knepley PetscFunctionBegin; 34570034214SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeData,dm,0,0,0);CHKERRQ(ierr); 34670034214SMatthew G. Knepley ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 34770034214SMatthew G. Knepley 34870034214SMatthew G. Knepley ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 34970034214SMatthew G. Knepley ierr = MPI_Type_size(datatype, &dataSize);CHKERRQ(ierr); 35070034214SMatthew G. Knepley ierr = PetscMalloc(fieldSize * dataSize, newData);CHKERRQ(ierr); 35170034214SMatthew G. Knepley 35270034214SMatthew G. Knepley ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 35370034214SMatthew G. Knepley ierr = PetscSFBcastBegin(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 35470034214SMatthew G. Knepley ierr = PetscSFBcastEnd(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 35570034214SMatthew G. Knepley ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 35670034214SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeData,dm,0,0,0);CHKERRQ(ierr); 35770034214SMatthew G. Knepley PetscFunctionReturn(0); 35870034214SMatthew G. Knepley } 35970034214SMatthew G. Knepley 36070034214SMatthew G. Knepley #undef __FUNCT__ 36170034214SMatthew G. Knepley #define __FUNCT__ "DMPlexDistribute" 36270034214SMatthew G. Knepley /*@C 36370034214SMatthew G. Knepley DMPlexDistribute - Distributes the mesh and any associated sections. 36470034214SMatthew G. Knepley 36570034214SMatthew G. Knepley Not Collective 36670034214SMatthew G. Knepley 36770034214SMatthew G. Knepley Input Parameter: 36870034214SMatthew G. Knepley + dm - The original DMPlex object 36970034214SMatthew G. Knepley . partitioner - The partitioning package, or NULL for the default 37070034214SMatthew G. Knepley - overlap - The overlap of partitions, 0 is the default 37170034214SMatthew G. Knepley 37270034214SMatthew G. Knepley Output Parameter: 37370034214SMatthew G. Knepley + sf - The PetscSF used for point distribution 37470034214SMatthew G. Knepley - parallelMesh - The distributed DMPlex object, or NULL 37570034214SMatthew G. Knepley 376a9c22940SMatthew G. Knepley Note: If the mesh was not distributed, the return value is NULL. 377a9c22940SMatthew G. Knepley 378a9c22940SMatthew G. Knepley The user can control the definition of adjacency for the mesh using DMPlexGetAdjacencyUseCone() and 379a9c22940SMatthew G. Knepley DMPlexSetAdjacencyUseClosure(). They should choose the combination appropriate for the function 380a9c22940SMatthew G. Knepley representation on the mesh. 38170034214SMatthew G. Knepley 38270034214SMatthew G. Knepley Level: intermediate 38370034214SMatthew G. Knepley 38470034214SMatthew G. Knepley .keywords: mesh, elements 385a9c22940SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexDistributeByFace(), DMPlexSetAdjacencyUseCone(), DMPlexSetAdjacencyUseClosure() 38670034214SMatthew G. Knepley @*/ 38770034214SMatthew G. Knepley PetscErrorCode DMPlexDistribute(DM dm, const char partitioner[], PetscInt overlap, PetscSF *sf, DM *dmParallel) 38870034214SMatthew G. Knepley { 38970034214SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data, *pmesh; 39070034214SMatthew G. Knepley MPI_Comm comm; 39170034214SMatthew G. Knepley const PetscInt height = 0; 39270034214SMatthew G. Knepley PetscInt dim, numRemoteRanks; 39370034214SMatthew G. Knepley IS origCellPart, origPart, cellPart, part; 39470034214SMatthew G. Knepley PetscSection origCellPartSection, origPartSection, cellPartSection, partSection; 39570034214SMatthew G. Knepley PetscSFNode *remoteRanks; 39670034214SMatthew G. Knepley PetscSF partSF, pointSF, coneSF; 39770034214SMatthew G. Knepley ISLocalToGlobalMapping renumbering; 39870034214SMatthew G. Knepley PetscSection originalConeSection, newConeSection; 39970034214SMatthew G. Knepley PetscInt *remoteOffsets; 40070034214SMatthew G. Knepley PetscInt *cones, *newCones, newConesSize; 40170034214SMatthew G. Knepley PetscBool flg; 40270034214SMatthew G. Knepley PetscMPIInt rank, numProcs, p; 40370034214SMatthew G. Knepley PetscErrorCode ierr; 40470034214SMatthew G. Knepley 40570034214SMatthew G. Knepley PetscFunctionBegin; 40670034214SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 40770034214SMatthew G. Knepley if (sf) PetscValidPointer(sf,4); 40870034214SMatthew G. Knepley PetscValidPointer(dmParallel,5); 40970034214SMatthew G. Knepley 41070034214SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 41170034214SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 41270034214SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 41370034214SMatthew G. Knepley ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr); 41470034214SMatthew G. Knepley 41570034214SMatthew G. Knepley *dmParallel = NULL; 41670034214SMatthew G. Knepley if (numProcs == 1) PetscFunctionReturn(0); 41770034214SMatthew G. Knepley 418*c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 41970034214SMatthew G. Knepley /* Create cell partition - We need to rewrite to use IS, use the MatPartition stuff */ 42070034214SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 42170034214SMatthew G. Knepley if (overlap > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Overlap > 1 not yet implemented"); 42270034214SMatthew G. Knepley ierr = DMPlexCreatePartition(dm, partitioner, height, overlap > 0 ? PETSC_TRUE : PETSC_FALSE, &cellPartSection, &cellPart, &origCellPartSection, &origCellPart);CHKERRQ(ierr); 42370034214SMatthew G. Knepley /* Create SF assuming a serial partition for all processes: Could check for IS length here */ 42470034214SMatthew G. Knepley if (!rank) numRemoteRanks = numProcs; 42570034214SMatthew G. Knepley else numRemoteRanks = 0; 42670034214SMatthew G. Knepley ierr = PetscMalloc1(numRemoteRanks, &remoteRanks);CHKERRQ(ierr); 42770034214SMatthew G. Knepley for (p = 0; p < numRemoteRanks; ++p) { 42870034214SMatthew G. Knepley remoteRanks[p].rank = p; 42970034214SMatthew G. Knepley remoteRanks[p].index = 0; 43070034214SMatthew G. Knepley } 43170034214SMatthew G. Knepley ierr = PetscSFCreate(comm, &partSF);CHKERRQ(ierr); 43270034214SMatthew G. Knepley ierr = PetscSFSetGraph(partSF, 1, numRemoteRanks, NULL, PETSC_OWN_POINTER, remoteRanks, PETSC_OWN_POINTER);CHKERRQ(ierr); 43370034214SMatthew G. Knepley ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-partition_view", &flg);CHKERRQ(ierr); 43470034214SMatthew G. Knepley if (flg) { 43570034214SMatthew G. Knepley ierr = PetscPrintf(comm, "Cell Partition:\n");CHKERRQ(ierr); 43670034214SMatthew G. Knepley ierr = PetscSectionView(cellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 43770034214SMatthew G. Knepley ierr = ISView(cellPart, NULL);CHKERRQ(ierr); 43870034214SMatthew G. Knepley if (origCellPart) { 43970034214SMatthew G. Knepley ierr = PetscPrintf(comm, "Original Cell Partition:\n");CHKERRQ(ierr); 44070034214SMatthew G. Knepley ierr = PetscSectionView(origCellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 44170034214SMatthew G. Knepley ierr = ISView(origCellPart, NULL);CHKERRQ(ierr); 44270034214SMatthew G. Knepley } 44370034214SMatthew G. Knepley ierr = PetscSFView(partSF, NULL);CHKERRQ(ierr); 44470034214SMatthew G. Knepley } 44570034214SMatthew G. Knepley /* Close the partition over the mesh */ 44670034214SMatthew G. Knepley ierr = DMPlexCreatePartitionClosure(dm, cellPartSection, cellPart, &partSection, &part);CHKERRQ(ierr); 44770034214SMatthew G. Knepley ierr = ISDestroy(&cellPart);CHKERRQ(ierr); 44870034214SMatthew G. Knepley ierr = PetscSectionDestroy(&cellPartSection);CHKERRQ(ierr); 44970034214SMatthew G. Knepley /* Create new mesh */ 45070034214SMatthew G. Knepley ierr = DMPlexCreate(comm, dmParallel);CHKERRQ(ierr); 451*c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*dmParallel, dim);CHKERRQ(ierr); 45270034214SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) *dmParallel, "Parallel Mesh");CHKERRQ(ierr); 45370034214SMatthew G. Knepley pmesh = (DM_Plex*) (*dmParallel)->data; 45470034214SMatthew G. Knepley /* Distribute sieve points and the global point numbering (replaces creating remote bases) */ 45570034214SMatthew G. Knepley ierr = PetscSFConvertPartition(partSF, partSection, part, &renumbering, &pointSF);CHKERRQ(ierr); 45670034214SMatthew G. Knepley if (flg) { 45770034214SMatthew G. Knepley ierr = PetscPrintf(comm, "Point Partition:\n");CHKERRQ(ierr); 45870034214SMatthew G. Knepley ierr = PetscSectionView(partSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 45970034214SMatthew G. Knepley ierr = ISView(part, NULL);CHKERRQ(ierr); 46070034214SMatthew G. Knepley ierr = PetscSFView(pointSF, NULL);CHKERRQ(ierr); 46170034214SMatthew G. Knepley ierr = PetscPrintf(comm, "Point Renumbering after partition:\n");CHKERRQ(ierr); 46270034214SMatthew G. Knepley ierr = ISLocalToGlobalMappingView(renumbering, NULL);CHKERRQ(ierr); 46370034214SMatthew G. Knepley } 46470034214SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 46570034214SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeCones,dm,0,0,0);CHKERRQ(ierr); 46670034214SMatthew G. Knepley /* Distribute cone section */ 46770034214SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &originalConeSection);CHKERRQ(ierr); 46870034214SMatthew G. Knepley ierr = DMPlexGetConeSection(*dmParallel, &newConeSection);CHKERRQ(ierr); 46970034214SMatthew G. Knepley ierr = PetscSFDistributeSection(pointSF, originalConeSection, &remoteOffsets, newConeSection);CHKERRQ(ierr); 47070034214SMatthew G. Knepley ierr = DMSetUp(*dmParallel);CHKERRQ(ierr); 47170034214SMatthew G. Knepley { 47270034214SMatthew G. Knepley PetscInt pStart, pEnd, p; 47370034214SMatthew G. Knepley 47470034214SMatthew G. Knepley ierr = PetscSectionGetChart(newConeSection, &pStart, &pEnd);CHKERRQ(ierr); 47570034214SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 47670034214SMatthew G. Knepley PetscInt coneSize; 47770034214SMatthew G. Knepley ierr = PetscSectionGetDof(newConeSection, p, &coneSize);CHKERRQ(ierr); 47870034214SMatthew G. Knepley pmesh->maxConeSize = PetscMax(pmesh->maxConeSize, coneSize); 47970034214SMatthew G. Knepley } 48070034214SMatthew G. Knepley } 48170034214SMatthew G. Knepley /* Communicate and renumber cones */ 48270034214SMatthew G. Knepley ierr = PetscSFCreateSectionSF(pointSF, originalConeSection, remoteOffsets, newConeSection, &coneSF);CHKERRQ(ierr); 48370034214SMatthew G. Knepley ierr = DMPlexGetCones(dm, &cones);CHKERRQ(ierr); 48470034214SMatthew G. Knepley ierr = DMPlexGetCones(*dmParallel, &newCones);CHKERRQ(ierr); 48570034214SMatthew G. Knepley ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 48670034214SMatthew G. Knepley ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 48770034214SMatthew G. Knepley ierr = PetscSectionGetStorageSize(newConeSection, &newConesSize);CHKERRQ(ierr); 4889d90f715SBarry Smith ierr = ISGlobalToLocalMappingApplyBlock(renumbering, IS_GTOLM_MASK, newConesSize, newCones, NULL, newCones);CHKERRQ(ierr); 48970034214SMatthew G. Knepley ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-cones_view", &flg);CHKERRQ(ierr); 49070034214SMatthew G. Knepley if (flg) { 49170034214SMatthew G. Knepley ierr = PetscPrintf(comm, "Serial Cone Section:\n");CHKERRQ(ierr); 49270034214SMatthew G. Knepley ierr = PetscSectionView(originalConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 49370034214SMatthew G. Knepley ierr = PetscPrintf(comm, "Parallel Cone Section:\n");CHKERRQ(ierr); 49470034214SMatthew G. Knepley ierr = PetscSectionView(newConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 49570034214SMatthew G. Knepley ierr = PetscSFView(coneSF, NULL);CHKERRQ(ierr); 49670034214SMatthew G. Knepley } 49770034214SMatthew G. Knepley ierr = DMPlexGetConeOrientations(dm, &cones);CHKERRQ(ierr); 49870034214SMatthew G. Knepley ierr = DMPlexGetConeOrientations(*dmParallel, &newCones);CHKERRQ(ierr); 49970034214SMatthew G. Knepley ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 50070034214SMatthew G. Knepley ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 50170034214SMatthew G. Knepley ierr = PetscSFDestroy(&coneSF);CHKERRQ(ierr); 50270034214SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeCones,dm,0,0,0);CHKERRQ(ierr); 50370034214SMatthew G. Knepley /* Create supports and stratify sieve */ 50470034214SMatthew G. Knepley { 50570034214SMatthew G. Knepley PetscInt pStart, pEnd; 50670034214SMatthew G. Knepley 50770034214SMatthew G. Knepley ierr = PetscSectionGetChart(pmesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 50870034214SMatthew G. Knepley ierr = PetscSectionSetChart(pmesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 50970034214SMatthew G. Knepley } 51070034214SMatthew G. Knepley ierr = DMPlexSymmetrize(*dmParallel);CHKERRQ(ierr); 51170034214SMatthew G. Knepley ierr = DMPlexStratify(*dmParallel);CHKERRQ(ierr); 51270034214SMatthew G. Knepley /* Distribute Coordinates */ 51370034214SMatthew G. Knepley { 51470034214SMatthew G. Knepley PetscSection originalCoordSection, newCoordSection; 51570034214SMatthew G. Knepley Vec originalCoordinates, newCoordinates; 51643e6038aSMatthew G. Knepley PetscInt bs; 51770034214SMatthew G. Knepley const char *name; 51870034214SMatthew G. Knepley 51970034214SMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &originalCoordSection);CHKERRQ(ierr); 52070034214SMatthew G. Knepley ierr = DMGetCoordinateSection(*dmParallel, &newCoordSection);CHKERRQ(ierr); 52170034214SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &originalCoordinates);CHKERRQ(ierr); 52270034214SMatthew G. Knepley ierr = VecCreate(comm, &newCoordinates);CHKERRQ(ierr); 52370034214SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) originalCoordinates, &name);CHKERRQ(ierr); 52470034214SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) newCoordinates, name);CHKERRQ(ierr); 52570034214SMatthew G. Knepley 52670034214SMatthew G. Knepley ierr = DMPlexDistributeField(dm, pointSF, originalCoordSection, originalCoordinates, newCoordSection, newCoordinates);CHKERRQ(ierr); 52770034214SMatthew G. Knepley ierr = DMSetCoordinatesLocal(*dmParallel, newCoordinates);CHKERRQ(ierr); 52843e6038aSMatthew G. Knepley ierr = VecGetBlockSize(originalCoordinates, &bs);CHKERRQ(ierr); 52943e6038aSMatthew G. Knepley ierr = VecSetBlockSize(newCoordinates, bs);CHKERRQ(ierr); 53070034214SMatthew G. Knepley ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 53170034214SMatthew G. Knepley } 53270034214SMatthew G. Knepley /* Distribute labels */ 53370034214SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 53470034214SMatthew G. Knepley { 53570034214SMatthew G. Knepley DMLabel next = mesh->labels, newNext = pmesh->labels; 53670034214SMatthew G. Knepley PetscInt numLabels = 0, l; 53770034214SMatthew G. Knepley 53870034214SMatthew G. Knepley /* Bcast number of labels */ 53970034214SMatthew G. Knepley while (next) {++numLabels; next = next->next;} 54070034214SMatthew G. Knepley ierr = MPI_Bcast(&numLabels, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 54170034214SMatthew G. Knepley next = mesh->labels; 54270034214SMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 54370034214SMatthew G. Knepley DMLabel labelNew; 54470034214SMatthew G. Knepley PetscBool isdepth; 54570034214SMatthew G. Knepley 54670034214SMatthew G. Knepley /* Skip "depth" because it is recreated */ 54770034214SMatthew G. Knepley if (!rank) {ierr = PetscStrcmp(next->name, "depth", &isdepth);CHKERRQ(ierr);} 54870034214SMatthew G. Knepley ierr = MPI_Bcast(&isdepth, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 54970034214SMatthew G. Knepley if (isdepth) {if (!rank) next = next->next; continue;} 55070034214SMatthew G. Knepley ierr = DMLabelDistribute(next, partSection, part, renumbering, &labelNew);CHKERRQ(ierr); 55170034214SMatthew G. Knepley /* Insert into list */ 55270034214SMatthew G. Knepley if (newNext) newNext->next = labelNew; 55370034214SMatthew G. Knepley else pmesh->labels = labelNew; 55470034214SMatthew G. Knepley newNext = labelNew; 55570034214SMatthew G. Knepley if (!rank) next = next->next; 55670034214SMatthew G. Knepley } 55770034214SMatthew G. Knepley } 55870034214SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 55970034214SMatthew G. Knepley /* Setup hybrid structure */ 56070034214SMatthew G. Knepley { 56170034214SMatthew G. Knepley const PetscInt *gpoints; 56270034214SMatthew G. Knepley PetscInt depth, n, d; 56370034214SMatthew G. Knepley 56470034214SMatthew G. Knepley for (d = 0; d <= dim; ++d) {pmesh->hybridPointMax[d] = mesh->hybridPointMax[d];} 56570034214SMatthew G. Knepley ierr = MPI_Bcast(pmesh->hybridPointMax, dim+1, MPIU_INT, 0, comm);CHKERRQ(ierr); 56670034214SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetSize(renumbering, &n);CHKERRQ(ierr); 56770034214SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetIndices(renumbering, &gpoints);CHKERRQ(ierr); 56870034214SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 56970034214SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 57070034214SMatthew G. Knepley PetscInt pmax = pmesh->hybridPointMax[d], newmax = 0, pEnd, stratum[2], p; 57170034214SMatthew G. Knepley 57270034214SMatthew G. Knepley if (pmax < 0) continue; 57370034214SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d > depth ? depth : d, &stratum[0], &stratum[1]);CHKERRQ(ierr); 57470034214SMatthew G. Knepley ierr = DMPlexGetDepthStratum(*dmParallel, d, NULL, &pEnd);CHKERRQ(ierr); 57570034214SMatthew G. Knepley ierr = MPI_Bcast(stratum, 2, MPIU_INT, 0, comm);CHKERRQ(ierr); 57670034214SMatthew G. Knepley for (p = 0; p < n; ++p) { 57770034214SMatthew G. Knepley const PetscInt point = gpoints[p]; 57870034214SMatthew G. Knepley 57970034214SMatthew G. Knepley if ((point >= stratum[0]) && (point < stratum[1]) && (point >= pmax)) ++newmax; 58070034214SMatthew G. Knepley } 58170034214SMatthew G. Knepley if (newmax > 0) pmesh->hybridPointMax[d] = pEnd - newmax; 58270034214SMatthew G. Knepley else pmesh->hybridPointMax[d] = -1; 58370034214SMatthew G. Knepley } 58470034214SMatthew G. Knepley ierr = ISLocalToGlobalMappingRestoreIndices(renumbering, &gpoints);CHKERRQ(ierr); 58570034214SMatthew G. Knepley } 58670034214SMatthew G. Knepley /* Cleanup Partition */ 58770034214SMatthew G. Knepley ierr = ISLocalToGlobalMappingDestroy(&renumbering);CHKERRQ(ierr); 58870034214SMatthew G. Knepley ierr = PetscSFDestroy(&partSF);CHKERRQ(ierr); 58970034214SMatthew G. Knepley ierr = PetscSectionDestroy(&partSection);CHKERRQ(ierr); 59070034214SMatthew G. Knepley ierr = ISDestroy(&part);CHKERRQ(ierr); 59170034214SMatthew G. Knepley /* Create point SF for parallel mesh */ 59270034214SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 59370034214SMatthew G. Knepley { 59470034214SMatthew G. Knepley const PetscInt *leaves; 59570034214SMatthew G. Knepley PetscSFNode *remotePoints, *rowners, *lowners; 59670034214SMatthew G. Knepley PetscInt numRoots, numLeaves, numGhostPoints = 0, p, gp, *ghostPoints; 59770034214SMatthew G. Knepley PetscInt pStart, pEnd; 59870034214SMatthew G. Knepley 59970034214SMatthew G. Knepley ierr = DMPlexGetChart(*dmParallel, &pStart, &pEnd);CHKERRQ(ierr); 60070034214SMatthew G. Knepley ierr = PetscSFGetGraph(pointSF, &numRoots, &numLeaves, &leaves, NULL);CHKERRQ(ierr); 60170034214SMatthew G. Knepley ierr = PetscMalloc2(numRoots,&rowners,numLeaves,&lowners);CHKERRQ(ierr); 60270034214SMatthew G. Knepley for (p=0; p<numRoots; p++) { 60370034214SMatthew G. Knepley rowners[p].rank = -1; 60470034214SMatthew G. Knepley rowners[p].index = -1; 60570034214SMatthew G. Knepley } 60670034214SMatthew G. Knepley if (origCellPart) { 60770034214SMatthew G. Knepley /* Make sure points in the original partition are not assigned to other procs */ 60870034214SMatthew G. Knepley const PetscInt *origPoints; 60970034214SMatthew G. Knepley 61070034214SMatthew G. Knepley ierr = DMPlexCreatePartitionClosure(dm, origCellPartSection, origCellPart, &origPartSection, &origPart);CHKERRQ(ierr); 61170034214SMatthew G. Knepley ierr = ISGetIndices(origPart, &origPoints);CHKERRQ(ierr); 61270034214SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 61370034214SMatthew G. Knepley PetscInt dof, off, d; 61470034214SMatthew G. Knepley 61570034214SMatthew G. Knepley ierr = PetscSectionGetDof(origPartSection, p, &dof);CHKERRQ(ierr); 61670034214SMatthew G. Knepley ierr = PetscSectionGetOffset(origPartSection, p, &off);CHKERRQ(ierr); 61770034214SMatthew G. Knepley for (d = off; d < off+dof; ++d) { 61870034214SMatthew G. Knepley rowners[origPoints[d]].rank = p; 61970034214SMatthew G. Knepley } 62070034214SMatthew G. Knepley } 62170034214SMatthew G. Knepley ierr = ISRestoreIndices(origPart, &origPoints);CHKERRQ(ierr); 62270034214SMatthew G. Knepley ierr = ISDestroy(&origPart);CHKERRQ(ierr); 62370034214SMatthew G. Knepley ierr = PetscSectionDestroy(&origPartSection);CHKERRQ(ierr); 62470034214SMatthew G. Knepley } 62570034214SMatthew G. Knepley ierr = ISDestroy(&origCellPart);CHKERRQ(ierr); 62670034214SMatthew G. Knepley ierr = PetscSectionDestroy(&origCellPartSection);CHKERRQ(ierr); 62770034214SMatthew G. Knepley 62870034214SMatthew G. Knepley ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 62970034214SMatthew G. Knepley ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 63070034214SMatthew G. Knepley for (p = 0; p < numLeaves; ++p) { 63170034214SMatthew G. Knepley if (lowners[p].rank < 0 || lowners[p].rank == rank) { /* Either put in a bid or we know we own it */ 63270034214SMatthew G. Knepley lowners[p].rank = rank; 63370034214SMatthew G. Knepley lowners[p].index = leaves ? leaves[p] : p; 63470034214SMatthew G. Knepley } else if (lowners[p].rank >= 0) { /* Point already claimed so flag so that MAXLOC does not listen to us */ 63570034214SMatthew G. Knepley lowners[p].rank = -2; 63670034214SMatthew G. Knepley lowners[p].index = -2; 63770034214SMatthew G. Knepley } 63870034214SMatthew G. Knepley } 63970034214SMatthew G. Knepley for (p=0; p<numRoots; p++) { /* Root must not participate in the rediction, flag so that MAXLOC does not use */ 64070034214SMatthew G. Knepley rowners[p].rank = -3; 64170034214SMatthew G. Knepley rowners[p].index = -3; 64270034214SMatthew G. Knepley } 64370034214SMatthew G. Knepley ierr = PetscSFReduceBegin(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 64470034214SMatthew G. Knepley ierr = PetscSFReduceEnd(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 64570034214SMatthew G. Knepley ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 64670034214SMatthew G. Knepley ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 64770034214SMatthew G. Knepley for (p = 0; p < numLeaves; ++p) { 64870034214SMatthew G. Knepley if (lowners[p].rank < 0 || lowners[p].index < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cell partition corrupt: point not claimed"); 64970034214SMatthew G. Knepley if (lowners[p].rank != rank) ++numGhostPoints; 65070034214SMatthew G. Knepley } 65170034214SMatthew G. Knepley ierr = PetscMalloc1(numGhostPoints, &ghostPoints);CHKERRQ(ierr); 65270034214SMatthew G. Knepley ierr = PetscMalloc1(numGhostPoints, &remotePoints);CHKERRQ(ierr); 65370034214SMatthew G. Knepley for (p = 0, gp = 0; p < numLeaves; ++p) { 65470034214SMatthew G. Knepley if (lowners[p].rank != rank) { 65570034214SMatthew G. Knepley ghostPoints[gp] = leaves ? leaves[p] : p; 65670034214SMatthew G. Knepley remotePoints[gp].rank = lowners[p].rank; 65770034214SMatthew G. Knepley remotePoints[gp].index = lowners[p].index; 65870034214SMatthew G. Knepley ++gp; 65970034214SMatthew G. Knepley } 66070034214SMatthew G. Knepley } 66170034214SMatthew G. Knepley ierr = PetscFree2(rowners,lowners);CHKERRQ(ierr); 66270034214SMatthew G. Knepley ierr = PetscSFSetGraph((*dmParallel)->sf, pEnd - pStart, numGhostPoints, ghostPoints, PETSC_OWN_POINTER, remotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 66370034214SMatthew G. Knepley ierr = PetscSFSetFromOptions((*dmParallel)->sf);CHKERRQ(ierr); 66470034214SMatthew G. Knepley } 665a42b08eeSMatthew G. Knepley pmesh->useCone = mesh->useCone; 666a42b08eeSMatthew G. Knepley pmesh->useClosure = mesh->useClosure; 66770034214SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 66886719b60SMatthew G. Knepley /* Copy BC */ 66986719b60SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmParallel);CHKERRQ(ierr); 67070034214SMatthew G. Knepley /* Cleanup */ 67170034214SMatthew G. Knepley if (sf) {*sf = pointSF;} 67270034214SMatthew G. Knepley else {ierr = PetscSFDestroy(&pointSF);CHKERRQ(ierr);} 67370034214SMatthew G. Knepley ierr = DMSetFromOptions(*dmParallel);CHKERRQ(ierr); 67470034214SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 67570034214SMatthew G. Knepley PetscFunctionReturn(0); 67670034214SMatthew G. Knepley } 677