1af0996ceSBarry Smith #include <petsc/private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2af0996ceSBarry Smith #include <petsc/private/matorderimpl.h> /*I "petscmat.h" I*/ 38ed5f475SMatthew G. Knepley 48ed5f475SMatthew G. Knepley #undef __FUNCT__ 58ed5f475SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateOrderingClosure_Static" 68ed5f475SMatthew G. Knepley PetscErrorCode DMPlexCreateOrderingClosure_Static(DM dm, PetscInt numPoints, const PetscInt pperm[], PetscInt **clperm, PetscInt **invclperm) 78ed5f475SMatthew G. Knepley { 88ed5f475SMatthew G. Knepley PetscInt *perm, *iperm; 98ed5f475SMatthew G. Knepley PetscInt depth, d, pStart, pEnd, fStart, fMax, fEnd, p; 108ed5f475SMatthew G. Knepley PetscErrorCode ierr; 118ed5f475SMatthew G. Knepley 128ed5f475SMatthew G. Knepley PetscFunctionBegin; 138ed5f475SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 148ed5f475SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 15854ce69bSBarry Smith ierr = PetscMalloc1(pEnd-pStart,&perm);CHKERRQ(ierr); 16854ce69bSBarry Smith ierr = PetscMalloc1(pEnd-pStart,&iperm);CHKERRQ(ierr); 178ed5f475SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) iperm[p] = -1; 188ed5f475SMatthew G. Knepley for (d = depth; d > 0; --d) { 198ed5f475SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 208ed5f475SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d-1, &fStart, &fEnd);CHKERRQ(ierr); 218ed5f475SMatthew G. Knepley fMax = fStart; 228ed5f475SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 238ed5f475SMatthew G. Knepley const PetscInt *cone; 248ed5f475SMatthew G. Knepley PetscInt point, coneSize, c; 258ed5f475SMatthew G. Knepley 268ed5f475SMatthew G. Knepley if (d == depth) { 278ed5f475SMatthew G. Knepley perm[p] = pperm[p]; 288ed5f475SMatthew G. Knepley iperm[pperm[p]] = p; 298ed5f475SMatthew G. Knepley } 308ed5f475SMatthew G. Knepley point = perm[p]; 318ed5f475SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr); 328ed5f475SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 338ed5f475SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 348ed5f475SMatthew G. Knepley const PetscInt oldc = cone[c]; 358ed5f475SMatthew G. Knepley const PetscInt newc = iperm[oldc]; 368ed5f475SMatthew G. Knepley 378ed5f475SMatthew G. Knepley if (newc < 0) { 388ed5f475SMatthew G. Knepley perm[fMax] = oldc; 398ed5f475SMatthew G. Knepley iperm[oldc] = fMax++; 408ed5f475SMatthew G. Knepley } 418ed5f475SMatthew G. Knepley } 428ed5f475SMatthew G. Knepley } 438ed5f475SMatthew G. Knepley if (fMax != fEnd) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Number of depth %d faces %d does not match permuted nubmer %d", d, fEnd-fStart, fMax-fStart); 448ed5f475SMatthew G. Knepley } 458ed5f475SMatthew G. Knepley *clperm = perm; 468ed5f475SMatthew G. Knepley *invclperm = iperm; 478ed5f475SMatthew G. Knepley PetscFunctionReturn(0); 488ed5f475SMatthew G. Knepley } 498ed5f475SMatthew G. Knepley 508ed5f475SMatthew G. Knepley #undef __FUNCT__ 518ed5f475SMatthew G. Knepley #define __FUNCT__ "DMPlexGetOrdering" 528ed5f475SMatthew G. Knepley /*@ 538ed5f475SMatthew G. Knepley DMPlexGetOrdering - Calculate a reordering of the mesh 548ed5f475SMatthew G. Knepley 558ed5f475SMatthew G. Knepley Collective on DM 568ed5f475SMatthew G. Knepley 578ed5f475SMatthew G. Knepley Input Parameter: 588ed5f475SMatthew G. Knepley + dm - The DMPlex object 59c99f2573SMatthew G. Knepley . otype - type of reordering, one of the following: 608ed5f475SMatthew G. Knepley $ MATORDERINGNATURAL - Natural 618ed5f475SMatthew G. Knepley $ MATORDERINGND - Nested Dissection 628ed5f475SMatthew G. Knepley $ MATORDERING1WD - One-way Dissection 638ed5f475SMatthew G. Knepley $ MATORDERINGRCM - Reverse Cuthill-McKee 648ed5f475SMatthew G. Knepley $ MATORDERINGQMD - Quotient Minimum Degree 65c99f2573SMatthew G. Knepley - label - [Optional] Label used to segregate ordering into sets, or NULL 668ed5f475SMatthew G. Knepley 678ed5f475SMatthew G. Knepley 688ed5f475SMatthew G. Knepley Output Parameter: 69c99f2573SMatthew G. Knepley . perm - The point permutation as an IS, perm[old point number] = new point number 70c99f2573SMatthew G. Knepley 71c99f2573SMatthew G. Knepley Note: The label is used to group sets of points together by label value. This makes it easy to reorder a mesh which 72c99f2573SMatthew G. Knepley has different types of cells, and then loop over each set of reordered cells for assembly. 738ed5f475SMatthew G. Knepley 748ed5f475SMatthew G. Knepley Level: intermediate 758ed5f475SMatthew G. Knepley 768ed5f475SMatthew G. Knepley .keywords: mesh 778ed5f475SMatthew G. Knepley .seealso: MatGetOrdering() 788ed5f475SMatthew G. Knepley @*/ 79c99f2573SMatthew G. Knepley PetscErrorCode DMPlexGetOrdering(DM dm, MatOrderingType otype, DMLabel label, IS *perm) 808ed5f475SMatthew G. Knepley { 818ed5f475SMatthew G. Knepley PetscInt numCells = 0; 828ed5f475SMatthew G. Knepley PetscInt *start = NULL, *adjacency = NULL, *cperm, *clperm, *invclperm, *mask, *xls, pStart, pEnd, c, i; 838ed5f475SMatthew G. Knepley PetscErrorCode ierr; 848ed5f475SMatthew G. Knepley 858ed5f475SMatthew G. Knepley PetscFunctionBegin; 868ed5f475SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 878ed5f475SMatthew G. Knepley PetscValidPointer(perm, 3); 888ed5f475SMatthew G. Knepley ierr = DMPlexCreateNeighborCSR(dm, 0, &numCells, &start, &adjacency);CHKERRQ(ierr); 89dcca6d9dSJed Brown ierr = PetscMalloc3(numCells,&cperm,numCells,&mask,numCells*2,&xls);CHKERRQ(ierr); 90d80c2872SMatthew G. Knepley if (numCells) { 918ed5f475SMatthew G. Knepley /* Shift for Fortran numbering */ 928ed5f475SMatthew G. Knepley for (i = 0; i < start[numCells]; ++i) ++adjacency[i]; 938ed5f475SMatthew G. Knepley for (i = 0; i <= numCells; ++i) ++start[i]; 948ed5f475SMatthew G. Knepley ierr = SPARSEPACKgenrcm(&numCells, start, adjacency, cperm, mask, xls);CHKERRQ(ierr); 95d80c2872SMatthew G. Knepley } 968ed5f475SMatthew G. Knepley ierr = PetscFree(start);CHKERRQ(ierr); 978ed5f475SMatthew G. Knepley ierr = PetscFree(adjacency);CHKERRQ(ierr); 988ed5f475SMatthew G. Knepley /* Shift for Fortran numbering */ 998ed5f475SMatthew G. Knepley for (c = 0; c < numCells; ++c) --cperm[c]; 100c99f2573SMatthew G. Knepley /* Segregate */ 101c99f2573SMatthew G. Knepley if (label) { 102c99f2573SMatthew G. Knepley IS valueIS; 103c99f2573SMatthew G. Knepley const PetscInt *values; 104c99f2573SMatthew G. Knepley PetscInt numValues, numPoints = 0; 105c99f2573SMatthew G. Knepley PetscInt *sperm, *vsize, *voff, v; 106c99f2573SMatthew G. Knepley 107c99f2573SMatthew G. Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 108*9485cce2SMatthew G. Knepley ierr = ISSort(valueIS);CHKERRQ(ierr); 109c99f2573SMatthew G. Knepley ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr); 110c99f2573SMatthew G. Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 111c99f2573SMatthew G. Knepley ierr = PetscCalloc3(numCells,&sperm,numValues,&vsize,numValues+1,&voff);CHKERRQ(ierr); 112c99f2573SMatthew G. Knepley for (v = 0; v < numValues; ++v) { 113c99f2573SMatthew G. Knepley ierr = DMLabelGetStratumSize(label, values[v], &vsize[v]);CHKERRQ(ierr); 114c99f2573SMatthew G. Knepley if (v < numValues-1) voff[v+2] += vsize[v] + voff[v+1]; 115c99f2573SMatthew G. Knepley numPoints += vsize[v]; 116c99f2573SMatthew G. Knepley } 117c99f2573SMatthew G. Knepley if (numPoints != numCells) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Label only covers %D cells < %D total", numPoints, numCells); 118c99f2573SMatthew G. Knepley for (c = 0; c < numCells; ++c) { 119c99f2573SMatthew G. Knepley const PetscInt oldc = cperm[c]; 120c99f2573SMatthew G. Knepley PetscInt val, vloc; 121c99f2573SMatthew G. Knepley 122c99f2573SMatthew G. Knepley ierr = DMLabelGetValue(label, oldc, &val);CHKERRQ(ierr); 123c99f2573SMatthew G. Knepley if (val == -1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Cell %D not present in label", oldc); 124c99f2573SMatthew G. Knepley ierr = PetscFindInt(val, numValues, values, &vloc);CHKERRQ(ierr); 125c99f2573SMatthew G. Knepley if (vloc < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Value %D not present label", val); 126c99f2573SMatthew G. Knepley sperm[voff[vloc+1]++] = oldc; 127c99f2573SMatthew G. Knepley } 128c99f2573SMatthew G. Knepley for (v = 0; v < numValues; ++v) { 129c99f2573SMatthew G. Knepley if (voff[v+1] - voff[v] != vsize[v]) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Number of %D values found is %D != %D", values[v], voff[v+1] - voff[v], vsize[v]); 130c99f2573SMatthew G. Knepley } 131c99f2573SMatthew G. Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 132c99f2573SMatthew G. Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 133c99f2573SMatthew G. Knepley ierr = PetscMemcpy(cperm, sperm, numCells * sizeof(PetscInt));CHKERRQ(ierr); 134c99f2573SMatthew G. Knepley ierr = PetscFree3(sperm, vsize, voff);CHKERRQ(ierr); 135c99f2573SMatthew G. Knepley } 1368ed5f475SMatthew G. Knepley /* Construct closure */ 137302440fdSBarry Smith ierr = DMPlexCreateOrderingClosure_Static(dm, numCells, cperm, &clperm, &invclperm);CHKERRQ(ierr); 1388ed5f475SMatthew G. Knepley ierr = PetscFree3(cperm,mask,xls);CHKERRQ(ierr); 1398ed5f475SMatthew G. Knepley ierr = PetscFree(clperm);CHKERRQ(ierr); 1408ed5f475SMatthew G. Knepley /* Invert permutation */ 1418ed5f475SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1428ed5f475SMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd-pStart, invclperm, PETSC_OWN_POINTER, perm);CHKERRQ(ierr); 1438ed5f475SMatthew G. Knepley PetscFunctionReturn(0); 1448ed5f475SMatthew G. Knepley } 1458ed5f475SMatthew G. Knepley 1468ed5f475SMatthew G. Knepley #undef __FUNCT__ 1478ed5f475SMatthew G. Knepley #define __FUNCT__ "DMPlexPermute" 1488ed5f475SMatthew G. Knepley /*@ 1498ed5f475SMatthew G. Knepley DMPlexPermute - Reorder the mesh according to the input permutation 1508ed5f475SMatthew G. Knepley 1518ed5f475SMatthew G. Knepley Collective on DM 1528ed5f475SMatthew G. Knepley 1538ed5f475SMatthew G. Knepley Input Parameter: 1548ed5f475SMatthew G. Knepley + dm - The DMPlex object 155c99f2573SMatthew G. Knepley - perm - The point permutation, perm[old point number] = new point number 1568ed5f475SMatthew G. Knepley 1578ed5f475SMatthew G. Knepley Output Parameter: 1588ed5f475SMatthew G. Knepley . pdm - The permuted DM 1598ed5f475SMatthew G. Knepley 1608ed5f475SMatthew G. Knepley Level: intermediate 1618ed5f475SMatthew G. Knepley 1628ed5f475SMatthew G. Knepley .keywords: mesh 1638ed5f475SMatthew G. Knepley .seealso: MatPermute() 1648ed5f475SMatthew G. Knepley @*/ 1658ed5f475SMatthew G. Knepley PetscErrorCode DMPlexPermute(DM dm, IS perm, DM *pdm) 1668ed5f475SMatthew G. Knepley { 1678ed5f475SMatthew G. Knepley DM_Plex *plex = (DM_Plex *) dm->data, *plexNew; 1688ed5f475SMatthew G. Knepley PetscSection section, sectionNew; 1698ed5f475SMatthew G. Knepley PetscInt dim; 1708ed5f475SMatthew G. Knepley PetscErrorCode ierr; 1718ed5f475SMatthew G. Knepley 1728ed5f475SMatthew G. Knepley PetscFunctionBegin; 1738ed5f475SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1748ed5f475SMatthew G. Knepley PetscValidHeaderSpecific(perm, IS_CLASSID, 2); 1758ed5f475SMatthew G. Knepley PetscValidPointer(pdm, 3); 1768ed5f475SMatthew G. Knepley ierr = DMCreate(PetscObjectComm((PetscObject) dm), pdm);CHKERRQ(ierr); 1778ed5f475SMatthew G. Knepley ierr = DMSetType(*pdm, DMPLEX);CHKERRQ(ierr); 178c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 179c73cfb54SMatthew G. Knepley ierr = DMSetDimension(*pdm, dim);CHKERRQ(ierr); 1808ed5f475SMatthew G. Knepley ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 181dd742cf1SMatthew G. Knepley if (section) { 1828ed5f475SMatthew G. Knepley ierr = PetscSectionPermute(section, perm, §ionNew);CHKERRQ(ierr); 1838ed5f475SMatthew G. Knepley ierr = DMSetDefaultSection(*pdm, sectionNew);CHKERRQ(ierr); 1848ed5f475SMatthew G. Knepley ierr = PetscSectionDestroy(§ionNew);CHKERRQ(ierr); 185dd742cf1SMatthew G. Knepley } 1868ed5f475SMatthew G. Knepley plexNew = (DM_Plex *) (*pdm)->data; 1878ed5f475SMatthew G. Knepley /* Ignore ltogmap, ltogmapb */ 1888ed5f475SMatthew G. Knepley /* Ignore sf, defaultSF */ 1898ed5f475SMatthew G. Knepley /* Ignore globalVertexNumbers, globalCellNumbers */ 1908ed5f475SMatthew G. Knepley /* Remap coordinates */ 1918ed5f475SMatthew G. Knepley { 1928ed5f475SMatthew G. Knepley DM cdm, cdmNew; 1938ed5f475SMatthew G. Knepley PetscSection csection, csectionNew; 1948ed5f475SMatthew G. Knepley Vec coordinates, coordinatesNew; 1958ed5f475SMatthew G. Knepley PetscScalar *coords, *coordsNew; 196dd5a1fb8SMatthew G. Knepley const PetscInt *pperm; 1978ed5f475SMatthew G. Knepley PetscInt pStart, pEnd, p; 19824640c55SToby Isaac const char *name; 1998ed5f475SMatthew G. Knepley 2008ed5f475SMatthew G. Knepley ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 2018ed5f475SMatthew G. Knepley ierr = DMGetDefaultSection(cdm, &csection);CHKERRQ(ierr); 2028ed5f475SMatthew G. Knepley ierr = PetscSectionPermute(csection, perm, &csectionNew);CHKERRQ(ierr); 2038ed5f475SMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2048ed5f475SMatthew G. Knepley ierr = VecDuplicate(coordinates, &coordinatesNew);CHKERRQ(ierr); 20524640c55SToby Isaac ierr = PetscObjectGetName((PetscObject)coordinates,&name);CHKERRQ(ierr); 20624640c55SToby Isaac ierr = PetscObjectSetName((PetscObject)coordinatesNew,name);CHKERRQ(ierr); 2078ed5f475SMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2088ed5f475SMatthew G. Knepley ierr = VecGetArray(coordinatesNew, &coordsNew);CHKERRQ(ierr); 2098ed5f475SMatthew G. Knepley ierr = PetscSectionGetChart(csectionNew, &pStart, &pEnd);CHKERRQ(ierr); 210dd5a1fb8SMatthew G. Knepley ierr = ISGetIndices(perm, &pperm);CHKERRQ(ierr); 2118ed5f475SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 2128ed5f475SMatthew G. Knepley PetscInt dof, off, offNew, d; 2138ed5f475SMatthew G. Knepley 2148ed5f475SMatthew G. Knepley ierr = PetscSectionGetDof(csectionNew, p, &dof);CHKERRQ(ierr); 2158ed5f475SMatthew G. Knepley ierr = PetscSectionGetOffset(csection, p, &off);CHKERRQ(ierr); 216dd5a1fb8SMatthew G. Knepley ierr = PetscSectionGetOffset(csectionNew, pperm[p], &offNew);CHKERRQ(ierr); 2178ed5f475SMatthew G. Knepley for (d = 0; d < dof; ++d) coordsNew[offNew+d] = coords[off+d]; 2188ed5f475SMatthew G. Knepley } 219dd5a1fb8SMatthew G. Knepley ierr = ISRestoreIndices(perm, &pperm);CHKERRQ(ierr); 2208ed5f475SMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2218ed5f475SMatthew G. Knepley ierr = VecRestoreArray(coordinatesNew, &coordsNew);CHKERRQ(ierr); 2228ed5f475SMatthew G. Knepley ierr = DMGetCoordinateDM(*pdm, &cdmNew);CHKERRQ(ierr); 2238ed5f475SMatthew G. Knepley ierr = DMSetDefaultSection(cdmNew, csectionNew);CHKERRQ(ierr); 2248ed5f475SMatthew G. Knepley ierr = DMSetCoordinatesLocal(*pdm, coordinatesNew);CHKERRQ(ierr); 2258ed5f475SMatthew G. Knepley ierr = PetscSectionDestroy(&csectionNew);CHKERRQ(ierr); 2268ed5f475SMatthew G. Knepley ierr = VecDestroy(&coordinatesNew);CHKERRQ(ierr); 2278ed5f475SMatthew G. Knepley } 2288ed5f475SMatthew G. Knepley /* Reorder labels */ 2298ed5f475SMatthew G. Knepley { 230a85475f2SMatthew G. Knepley PetscInt numLabels, l; 231a85475f2SMatthew G. Knepley DMLabel label, labelNew; 2328ed5f475SMatthew G. Knepley 233c58f1c22SToby Isaac ierr = DMGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 234a85475f2SMatthew G. Knepley for (l = numLabels-1; l >= 0; --l) { 235c58f1c22SToby Isaac ierr = DMGetLabelByNum(dm, l, &label);CHKERRQ(ierr); 236a85475f2SMatthew G. Knepley ierr = DMLabelPermute(label, perm, &labelNew);CHKERRQ(ierr); 237c58f1c22SToby Isaac ierr = DMAddLabel(*pdm, labelNew);CHKERRQ(ierr); 2388ed5f475SMatthew G. Knepley } 2398ed5f475SMatthew G. Knepley if (plex->subpointMap) {ierr = DMLabelPermute(plex->subpointMap, perm, &plexNew->subpointMap);CHKERRQ(ierr);} 2408ed5f475SMatthew G. Knepley } 2418ed5f475SMatthew G. Knepley /* Reorder topology */ 2428ed5f475SMatthew G. Knepley { 2438ed5f475SMatthew G. Knepley const PetscInt *pperm; 2448ed5f475SMatthew G. Knepley PetscInt maxConeSize, maxSupportSize, n, pStart, pEnd, p; 2458ed5f475SMatthew G. Knepley 2468ed5f475SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 2478ed5f475SMatthew G. Knepley plexNew->maxConeSize = maxConeSize; 2488ed5f475SMatthew G. Knepley plexNew->maxSupportSize = maxSupportSize; 2498ed5f475SMatthew G. Knepley ierr = PetscSectionDestroy(&plexNew->coneSection);CHKERRQ(ierr); 2508ed5f475SMatthew G. Knepley ierr = PetscSectionPermute(plex->coneSection, perm, &plexNew->coneSection);CHKERRQ(ierr); 2518ed5f475SMatthew G. Knepley ierr = PetscSectionGetStorageSize(plexNew->coneSection, &n);CHKERRQ(ierr); 252785e854fSJed Brown ierr = PetscMalloc1(n, &plexNew->cones);CHKERRQ(ierr); 253785e854fSJed Brown ierr = PetscMalloc1(n, &plexNew->coneOrientations);CHKERRQ(ierr); 2548ed5f475SMatthew G. Knepley ierr = ISGetIndices(perm, &pperm);CHKERRQ(ierr); 2558ed5f475SMatthew G. Knepley ierr = PetscSectionGetChart(plex->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 2568ed5f475SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 2578ed5f475SMatthew G. Knepley PetscInt dof, off, offNew, d; 2588ed5f475SMatthew G. Knepley 2598ed5f475SMatthew G. Knepley ierr = PetscSectionGetDof(plexNew->coneSection, pperm[p], &dof);CHKERRQ(ierr); 2608ed5f475SMatthew G. Knepley ierr = PetscSectionGetOffset(plex->coneSection, p, &off);CHKERRQ(ierr); 2618ed5f475SMatthew G. Knepley ierr = PetscSectionGetOffset(plexNew->coneSection, pperm[p], &offNew);CHKERRQ(ierr); 2628ed5f475SMatthew G. Knepley for (d = 0; d < dof; ++d) { 2638ed5f475SMatthew G. Knepley plexNew->cones[offNew+d] = pperm[plex->cones[off+d]]; 2648ed5f475SMatthew G. Knepley plexNew->coneOrientations[offNew+d] = plex->coneOrientations[off+d]; 2658ed5f475SMatthew G. Knepley } 2668ed5f475SMatthew G. Knepley } 2678ed5f475SMatthew G. Knepley ierr = PetscSectionDestroy(&plexNew->supportSection);CHKERRQ(ierr); 2688ed5f475SMatthew G. Knepley ierr = PetscSectionPermute(plex->supportSection, perm, &plexNew->supportSection);CHKERRQ(ierr); 2698ed5f475SMatthew G. Knepley ierr = PetscSectionGetStorageSize(plexNew->supportSection, &n);CHKERRQ(ierr); 270785e854fSJed Brown ierr = PetscMalloc1(n, &plexNew->supports);CHKERRQ(ierr); 2718ed5f475SMatthew G. Knepley ierr = PetscSectionGetChart(plex->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 2728ed5f475SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 2738ed5f475SMatthew G. Knepley PetscInt dof, off, offNew, d; 2748ed5f475SMatthew G. Knepley 2758ed5f475SMatthew G. Knepley ierr = PetscSectionGetDof(plexNew->supportSection, pperm[p], &dof);CHKERRQ(ierr); 2768ed5f475SMatthew G. Knepley ierr = PetscSectionGetOffset(plex->supportSection, p, &off);CHKERRQ(ierr); 2778ed5f475SMatthew G. Knepley ierr = PetscSectionGetOffset(plexNew->supportSection, pperm[p], &offNew);CHKERRQ(ierr); 2788ed5f475SMatthew G. Knepley for (d = 0; d < dof; ++d) { 2798ed5f475SMatthew G. Knepley plexNew->supports[offNew+d] = pperm[plex->supports[off+d]]; 2808ed5f475SMatthew G. Knepley } 2818ed5f475SMatthew G. Knepley } 2828ed5f475SMatthew G. Knepley ierr = ISRestoreIndices(perm, &pperm);CHKERRQ(ierr); 2838ed5f475SMatthew G. Knepley } 2848ed5f475SMatthew G. Knepley PetscFunctionReturn(0); 2858ed5f475SMatthew G. Knepley } 286