xref: /petsc/src/dm/impls/plex/plex.c (revision 8abc87a09af54a521f0834b8afaba7e47c504675)
134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h>   /*I      "petscdmplex.h"   I*/
2a68b90caSToby Isaac #include <petsc-private/dmimpl.h>
3552f7358SJed Brown #include <../src/sys/utils/hash.h>
4d53a3d6fSBarry Smith #include <petsc-private/isimpl.h>
50c312b8eSJed Brown #include <petscsf.h>
60f7c717fSToby Isaac #include <petscksp.h>
70f7c717fSToby Isaac #include <petscpc.h>
8e228b242SToby Isaac #include <petscds.h>
9552f7358SJed Brown 
10552f7358SJed Brown /* Logging support */
113d822a50SMichael Lange PetscLogEvent DMPLEX_Interpolate, PETSCPARTITIONER_Partition, DMPLEX_Distribute, DMPLEX_DistributeCones, DMPLEX_DistributeLabels, DMPLEX_DistributeSF, DMPLEX_DistributeOverlap, DMPLEX_DistributeField, DMPLEX_DistributeData, DMPLEX_Stratify, DMPLEX_Preallocate, DMPLEX_ResidualFEM, DMPLEX_JacobianFEM, DMPLEX_InterpolatorFEM, DMPLEX_InjectorFEM;
12552f7358SJed Brown 
135a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer);
145a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer);
152c40f234SMatthew G. Knepley PETSC_EXTERN PetscErrorCode VecLoad_Default(Vec, PetscViewer);
16552f7358SJed Brown 
177e42fee7SMatthew G. Knepley #undef __FUNCT__
187afe7537SMatthew G. Knepley #define __FUNCT__ "DMPlexGetFieldType_Internal"
197afe7537SMatthew G. Knepley PetscErrorCode DMPlexGetFieldType_Internal(DM dm, PetscSection section, PetscInt field, PetscInt *sStart, PetscInt *sEnd, PetscViewerVTKFieldType *ft)
207e42fee7SMatthew G. Knepley {
217e42fee7SMatthew G. Knepley   PetscInt       dim, pStart, pEnd, vStart, vEnd, cStart, cEnd, vdof = 0, cdof = 0;
227e42fee7SMatthew G. Knepley   PetscErrorCode ierr;
237e42fee7SMatthew G. Knepley 
247e42fee7SMatthew G. Knepley   PetscFunctionBegin;
257e42fee7SMatthew G. Knepley   *ft  = PETSC_VTK_POINT_FIELD;
26c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
277e42fee7SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
287e42fee7SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
297e42fee7SMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
307e42fee7SMatthew G. Knepley   if (field >= 0) {
317e42fee7SMatthew G. Knepley     if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, vStart, field, &vdof);CHKERRQ(ierr);}
327e42fee7SMatthew G. Knepley     if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, cStart, field, &cdof);CHKERRQ(ierr);}
337e42fee7SMatthew G. Knepley   } else {
347e42fee7SMatthew G. Knepley     if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);}
357e42fee7SMatthew G. Knepley     if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);}
367e42fee7SMatthew G. Knepley   }
377e42fee7SMatthew G. Knepley   if (vdof) {
387e42fee7SMatthew G. Knepley     *sStart = vStart;
397e42fee7SMatthew G. Knepley     *sEnd   = vEnd;
407e42fee7SMatthew G. Knepley     if (vdof == dim) *ft = PETSC_VTK_POINT_VECTOR_FIELD;
417e42fee7SMatthew G. Knepley     else             *ft = PETSC_VTK_POINT_FIELD;
427e42fee7SMatthew G. Knepley   } else if (cdof) {
437e42fee7SMatthew G. Knepley     *sStart = cStart;
447e42fee7SMatthew G. Knepley     *sEnd   = cEnd;
457e42fee7SMatthew G. Knepley     if (cdof == dim) *ft = PETSC_VTK_CELL_VECTOR_FIELD;
467e42fee7SMatthew G. Knepley     else             *ft = PETSC_VTK_CELL_FIELD;
477e42fee7SMatthew G. Knepley   } else SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK");
487e42fee7SMatthew G. Knepley   PetscFunctionReturn(0);
497e42fee7SMatthew G. Knepley }
507e42fee7SMatthew G. Knepley 
51552f7358SJed Brown #undef __FUNCT__
52552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local"
53552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer)
54552f7358SJed Brown {
55552f7358SJed Brown   DM             dm;
56b136c2c9SMatthew G. Knepley   PetscBool      isvtk, ishdf5, isseq;
57552f7358SJed Brown   PetscErrorCode ierr;
58552f7358SJed Brown 
59552f7358SJed Brown   PetscFunctionBegin;
60552f7358SJed Brown   ierr = VecGetDM(v, &dm);CHKERRQ(ierr);
6182f516ccSBarry Smith   if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM");
62552f7358SJed Brown   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK,  &isvtk);CHKERRQ(ierr);
63b136c2c9SMatthew G. Knepley   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr);
64b136c2c9SMatthew G. Knepley   ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr);
65ef31f671SMatthew G. Knepley   if (isvtk || ishdf5) {
66ef31f671SMatthew G. Knepley     PetscInt  numFields;
67ef31f671SMatthew G. Knepley     PetscBool fem = PETSC_FALSE;
68ef31f671SMatthew G. Knepley 
69ef31f671SMatthew G. Knepley     ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr);
70ef31f671SMatthew G. Knepley     if (numFields) {
71ef31f671SMatthew G. Knepley       PetscObject fe;
72ef31f671SMatthew G. Knepley 
73ef31f671SMatthew G. Knepley       ierr = DMGetField(dm, 0, &fe);CHKERRQ(ierr);
74ef31f671SMatthew G. Knepley       if (fe->classid == PETSCFE_CLASSID) fem = PETSC_TRUE;
75ef31f671SMatthew G. Knepley     }
76d7ddef95SMatthew G. Knepley     if (fem) {ierr = DMPlexInsertBoundaryValues(dm, v, 0.0, NULL, NULL, NULL);CHKERRQ(ierr);}
77ef31f671SMatthew G. Knepley   }
78552f7358SJed Brown   if (isvtk) {
79552f7358SJed Brown     PetscSection            section;
80b136c2c9SMatthew G. Knepley     PetscViewerVTKFieldType ft;
81b136c2c9SMatthew G. Knepley     PetscInt                pStart, pEnd;
82552f7358SJed Brown 
83552f7358SJed Brown     ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);
847afe7537SMatthew G. Knepley     ierr = DMPlexGetFieldType_Internal(dm, section, PETSC_DETERMINE, &pStart, &pEnd, &ft);CHKERRQ(ierr);
85552f7358SJed Brown     ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */
86552f7358SJed Brown     ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr);  /* viewer drops reference */
87552f7358SJed Brown     ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr);
88b136c2c9SMatthew G. Knepley   } else if (ishdf5) {
89b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5)
90b136c2c9SMatthew G. Knepley     ierr = VecView_Plex_Local_HDF5(v, viewer);CHKERRQ(ierr);
91b136c2c9SMatthew G. Knepley #else
92b136c2c9SMatthew G. Knepley     SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5");
93b136c2c9SMatthew G. Knepley #endif
94552f7358SJed Brown   } else {
9555f2e967SMatthew G. Knepley     if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);}
9655f2e967SMatthew G. Knepley     else       {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);}
97552f7358SJed Brown   }
98552f7358SJed Brown   PetscFunctionReturn(0);
99552f7358SJed Brown }
100552f7358SJed Brown 
101552f7358SJed Brown #undef __FUNCT__
102552f7358SJed Brown #define __FUNCT__ "VecView_Plex"
103552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer)
104552f7358SJed Brown {
105552f7358SJed Brown   DM             dm;
10655f2e967SMatthew G. Knepley   PetscBool      isvtk, ishdf5, isseq;
107552f7358SJed Brown   PetscErrorCode ierr;
108552f7358SJed Brown 
109552f7358SJed Brown   PetscFunctionBegin;
110552f7358SJed Brown   ierr = VecGetDM(v, &dm);CHKERRQ(ierr);
11182f516ccSBarry Smith   if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM");
112552f7358SJed Brown   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK,  &isvtk);CHKERRQ(ierr);
11333c3e6b4SMatthew G. Knepley   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr);
11455f2e967SMatthew G. Knepley   ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr);
115552f7358SJed Brown   if (isvtk) {
116552f7358SJed Brown     Vec         locv;
117552f7358SJed Brown     const char *name;
118552f7358SJed Brown 
119552f7358SJed Brown     ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr);
120552f7358SJed Brown     ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr);
121552f7358SJed Brown     ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr);
122552f7358SJed Brown     ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr);
123552f7358SJed Brown     ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr);
124552f7358SJed Brown     ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr);
125552f7358SJed Brown     ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr);
126b136c2c9SMatthew G. Knepley   } else if (ishdf5) {
127b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5)
128b136c2c9SMatthew G. Knepley     ierr = VecView_Plex_HDF5(v, viewer);CHKERRQ(ierr);
129b136c2c9SMatthew G. Knepley #else
130b136c2c9SMatthew G. Knepley     SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5");
131b136c2c9SMatthew G. Knepley #endif
132552f7358SJed Brown   } else {
13355f2e967SMatthew G. Knepley     if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);}
13455f2e967SMatthew G. Knepley     else       {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);}
135552f7358SJed Brown   }
136552f7358SJed Brown   PetscFunctionReturn(0);
137552f7358SJed Brown }
138552f7358SJed Brown 
139552f7358SJed Brown #undef __FUNCT__
1402c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex_Local"
1412c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex_Local(Vec v, PetscViewer viewer)
1422c40f234SMatthew G. Knepley {
1432c40f234SMatthew G. Knepley   DM             dm;
1442c40f234SMatthew G. Knepley   PetscBool      ishdf5;
1452c40f234SMatthew G. Knepley   PetscErrorCode ierr;
1462c40f234SMatthew G. Knepley 
1472c40f234SMatthew G. Knepley   PetscFunctionBegin;
1482c40f234SMatthew G. Knepley   ierr = VecGetDM(v, &dm);CHKERRQ(ierr);
1492c40f234SMatthew G. Knepley   if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM");
1502c40f234SMatthew G. Knepley   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr);
1512c40f234SMatthew G. Knepley   if (ishdf5) {
1522c40f234SMatthew G. Knepley     DM          dmBC;
1532c40f234SMatthew G. Knepley     Vec         gv;
1542c40f234SMatthew G. Knepley     const char *name;
1552c40f234SMatthew G. Knepley 
1562c40f234SMatthew G. Knepley     ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr);
1572c40f234SMatthew G. Knepley     ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr);
1582c40f234SMatthew G. Knepley     ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr);
1592c40f234SMatthew G. Knepley     ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr);
1602c40f234SMatthew G. Knepley     ierr = VecLoad_Default(gv, viewer);CHKERRQ(ierr);
1612c40f234SMatthew G. Knepley     ierr = DMGlobalToLocalBegin(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr);
1622c40f234SMatthew G. Knepley     ierr = DMGlobalToLocalEnd(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr);
1632c40f234SMatthew G. Knepley     ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr);
1642c40f234SMatthew G. Knepley   } else {
1652c40f234SMatthew G. Knepley     ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr);
1662c40f234SMatthew G. Knepley   }
1672c40f234SMatthew G. Knepley   PetscFunctionReturn(0);
1682c40f234SMatthew G. Knepley }
1692c40f234SMatthew G. Knepley 
1702c40f234SMatthew G. Knepley #undef __FUNCT__
1712c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex"
1722c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex(Vec v, PetscViewer viewer)
1732c40f234SMatthew G. Knepley {
1742c40f234SMatthew G. Knepley   DM             dm;
1752c40f234SMatthew G. Knepley   PetscBool      ishdf5;
1762c40f234SMatthew G. Knepley   PetscErrorCode ierr;
1772c40f234SMatthew G. Knepley 
1782c40f234SMatthew G. Knepley   PetscFunctionBegin;
1792c40f234SMatthew G. Knepley   ierr = VecGetDM(v, &dm);CHKERRQ(ierr);
1802c40f234SMatthew G. Knepley   if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM");
1812c40f234SMatthew G. Knepley   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr);
1822c40f234SMatthew G. Knepley   if (ishdf5) {
183878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5)
184b136c2c9SMatthew G. Knepley     ierr = VecLoad_Plex_HDF5(v, viewer);CHKERRQ(ierr);
185b136c2c9SMatthew G. Knepley #else
186b136c2c9SMatthew G. Knepley     SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5");
187878b459fSMatthew G. Knepley #endif
1882c40f234SMatthew G. Knepley   } else {
1892c40f234SMatthew G. Knepley     ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr);
190552f7358SJed Brown   }
191552f7358SJed Brown   PetscFunctionReturn(0);
192552f7358SJed Brown }
193552f7358SJed Brown 
194552f7358SJed Brown #undef __FUNCT__
195552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii"
196552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer)
197552f7358SJed Brown {
198552f7358SJed Brown   DM_Plex          *mesh = (DM_Plex*) dm->data;
199552f7358SJed Brown   DM                cdm;
200552f7358SJed Brown   DMLabel           markers;
201552f7358SJed Brown   PetscSection      coordSection;
202552f7358SJed Brown   Vec               coordinates;
203552f7358SJed Brown   PetscViewerFormat format;
204552f7358SJed Brown   PetscErrorCode    ierr;
205552f7358SJed Brown 
206552f7358SJed Brown   PetscFunctionBegin;
207552f7358SJed Brown   ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr);
208552f7358SJed Brown   ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr);
209552f7358SJed Brown   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
210552f7358SJed Brown   ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr);
211552f7358SJed Brown   if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) {
212552f7358SJed Brown     const char *name;
213552f7358SJed Brown     PetscInt    maxConeSize, maxSupportSize;
214552f7358SJed Brown     PetscInt    pStart, pEnd, p;
215552f7358SJed Brown     PetscMPIInt rank, size;
216552f7358SJed Brown 
21782f516ccSBarry Smith     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
21882f516ccSBarry Smith     ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr);
219552f7358SJed Brown     ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr);
220552f7358SJed Brown     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
221552f7358SJed Brown     ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
222552f7358SJed Brown     ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr);
223552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr);
224552f7358SJed Brown     ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr);
225552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr);
226552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr);
227552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
228552f7358SJed Brown       PetscInt dof, off, s;
229552f7358SJed Brown 
230552f7358SJed Brown       ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
231552f7358SJed Brown       ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
232552f7358SJed Brown       for (s = off; s < off+dof; ++s) {
233552f7358SJed Brown         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr);
234552f7358SJed Brown       }
235552f7358SJed Brown     }
236552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
237552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr);
238552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
239552f7358SJed Brown       PetscInt dof, off, c;
240552f7358SJed Brown 
241552f7358SJed Brown       ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
242552f7358SJed Brown       ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
243552f7358SJed Brown       for (c = off; c < off+dof; ++c) {
244552f7358SJed Brown         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr);
245552f7358SJed Brown       }
246552f7358SJed Brown     }
247552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
2480298fd71SBarry Smith     ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr);
249552f7358SJed Brown     if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);}
250552f7358SJed Brown     ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr);
251552f7358SJed Brown     ierr = DMLabelView(markers,viewer);CHKERRQ(ierr);
252552f7358SJed Brown     if (size > 1) {
253552f7358SJed Brown       PetscSF sf;
254552f7358SJed Brown 
255552f7358SJed Brown       ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr);
256552f7358SJed Brown       ierr = PetscSFView(sf, viewer);CHKERRQ(ierr);
257552f7358SJed Brown     }
258552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
259552f7358SJed Brown   } else if (format == PETSC_VIEWER_ASCII_LATEX) {
260552f7358SJed Brown     const char  *name;
261552f7358SJed Brown     const char  *colors[3] = {"red", "blue", "green"};
262552f7358SJed Brown     const int    numColors  = 3;
263552f7358SJed Brown     PetscReal    scale      = 2.0;
264552f7358SJed Brown     PetscScalar *coords;
265552f7358SJed Brown     PetscInt     depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p;
266552f7358SJed Brown     PetscMPIInt  rank, size;
267552f7358SJed Brown 
268552f7358SJed Brown     ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
26982f516ccSBarry Smith     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
27082f516ccSBarry Smith     ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr);
271552f7358SJed Brown     ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr);
272552f7358SJed Brown     ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr);
273770b213bSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "\
274770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\
275552f7358SJed Brown \\usepackage{tikz}\n\
276552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\
277552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\
278552f7358SJed Brown \\usetikzlibrary{arrows}\n\
279552f7358SJed Brown \\begin{document}\n\
280f738dd31SMatthew G. Knepley \\vbox{\n");CHKERRQ(ierr);
281f738dd31SMatthew G. Knepley     ierr = PetscViewerASCIIPrintf(viewer, "%s for process ", name);CHKERRQ(ierr);
282770b213bSMatthew G Knepley     for (p = 0; p < size; ++p) {
283770b213bSMatthew G Knepley       if (p > 0 && p == size-1) {
284770b213bSMatthew G Knepley         ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr);
285770b213bSMatthew G Knepley       } else if (p > 0) {
286770b213bSMatthew G Knepley         ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr);
287770b213bSMatthew G Knepley       }
288770b213bSMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr);
289770b213bSMatthew G Knepley     }
290770b213bSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\
291f738dd31SMatthew G. Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n", 8.0/scale);CHKERRQ(ierr);
292552f7358SJed Brown     /* Plot vertices */
293552f7358SJed Brown     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
294552f7358SJed Brown     ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
295552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr);
296552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
297552f7358SJed Brown       PetscInt off, dof, d;
298552f7358SJed Brown 
299552f7358SJed Brown       ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
300552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
301552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr);
302552f7358SJed Brown       for (d = 0; d < dof; ++d) {
303552f7358SJed Brown         if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);}
3046712e2f1SBarry Smith         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr);
305552f7358SJed Brown       }
306552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr);
307552f7358SJed Brown     }
308552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
309552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
310552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr);
311552f7358SJed Brown     /* Plot edges */
312552f7358SJed Brown     ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
313552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr);
314552f7358SJed Brown     if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);}
315552f7358SJed Brown     for (e = eStart; e < eEnd; ++e) {
316552f7358SJed Brown       const PetscInt *cone;
317552f7358SJed Brown       PetscInt        coneSize, offA, offB, dof, d;
318552f7358SJed Brown 
319552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr);
32082f516ccSBarry Smith       if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize);
321552f7358SJed Brown       ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr);
322552f7358SJed Brown       ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr);
323552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr);
324552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr);
325552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr);
326552f7358SJed Brown       for (d = 0; d < dof; ++d) {
327552f7358SJed Brown         if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);}
3286712e2f1SBarry Smith         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr);
329552f7358SJed Brown       }
330552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr);
331552f7358SJed Brown     }
332552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
333552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
334552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr);
335552f7358SJed Brown     /* Plot cells */
336552f7358SJed Brown     ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
337552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
3380298fd71SBarry Smith       PetscInt *closure = NULL;
339552f7358SJed Brown       PetscInt  closureSize, firstPoint = -1;
340552f7358SJed Brown 
341552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
342552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr);
343552f7358SJed Brown       for (p = 0; p < closureSize*2; p += 2) {
344552f7358SJed Brown         const PetscInt point = closure[p];
345552f7358SJed Brown 
346552f7358SJed Brown         if ((point < vStart) || (point >= vEnd)) continue;
347552f7358SJed Brown         if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);}
348552f7358SJed Brown         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr);
349552f7358SJed Brown         if (firstPoint < 0) firstPoint = point;
350552f7358SJed Brown       }
351552f7358SJed Brown       /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */
352552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr);
353552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
354552f7358SJed Brown     }
355552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
356f738dd31SMatthew G. Knepley     ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n}\n");CHKERRQ(ierr);
357770b213bSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr);
358552f7358SJed Brown   } else {
35982f516ccSBarry Smith     MPI_Comm    comm;
360834065abSMatthew G. Knepley     PetscInt   *sizes, *hybsizes;
361834065abSMatthew G. Knepley     PetscInt    locDepth, depth, dim, d, pMax[4];
362552f7358SJed Brown     PetscInt    pStart, pEnd, p;
363a57dd577SMatthew G Knepley     PetscInt    numLabels, l;
3641143a3c0SMatthew G. Knepley     const char *name;
365552f7358SJed Brown     PetscMPIInt size;
366552f7358SJed Brown 
36782f516ccSBarry Smith     ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
368552f7358SJed Brown     ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr);
369c73cfb54SMatthew G. Knepley     ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
3705f64d76eSMatthew G. Knepley     ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr);
3711143a3c0SMatthew G. Knepley     if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);}
3721143a3c0SMatthew G. Knepley     else      {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);}
373552f7358SJed Brown     ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr);
374552f7358SJed Brown     ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
375bb81ee50SMatthew G. Knepley     ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr);
376dcca6d9dSJed Brown     ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr);
377552f7358SJed Brown     if (depth == 1) {
378552f7358SJed Brown       ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr);
379552f7358SJed Brown       pEnd = pEnd - pStart;
380552f7358SJed Brown       ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
381552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "  %D-cells:", 0);CHKERRQ(ierr);
382552f7358SJed Brown       for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);}
383552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
384552f7358SJed Brown       ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr);
385552f7358SJed Brown       pEnd = pEnd - pStart;
386552f7358SJed Brown       ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
387552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "  %D-cells:", dim);CHKERRQ(ierr);
388552f7358SJed Brown       for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);}
389552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
390552f7358SJed Brown     } else {
391552f7358SJed Brown       for (d = 0; d <= dim; d++) {
392552f7358SJed Brown         ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
393834065abSMatthew G. Knepley         pEnd    -= pStart;
394834065abSMatthew G. Knepley         pMax[d] -= pStart;
395552f7358SJed Brown         ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
396834065abSMatthew G. Knepley         ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
397552f7358SJed Brown         ierr = PetscViewerASCIIPrintf(viewer, "  %D-cells:", d);CHKERRQ(ierr);
398834065abSMatthew G. Knepley         for (p = 0; p < size; ++p) {
399834065abSMatthew G. Knepley           if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);}
400834065abSMatthew G. Knepley           else                  {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);}
401834065abSMatthew G. Knepley         }
402552f7358SJed Brown         ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
403552f7358SJed Brown       }
404552f7358SJed Brown     }
405834065abSMatthew G. Knepley     ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr);
406a57dd577SMatthew G Knepley     ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr);
407a57dd577SMatthew G Knepley     if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);}
408a57dd577SMatthew G Knepley     for (l = 0; l < numLabels; ++l) {
409a57dd577SMatthew G Knepley       DMLabel         label;
410a57dd577SMatthew G Knepley       const char     *name;
411a57dd577SMatthew G Knepley       IS              valueIS;
412a57dd577SMatthew G Knepley       const PetscInt *values;
413a57dd577SMatthew G Knepley       PetscInt        numValues, v;
414a57dd577SMatthew G Knepley 
415a57dd577SMatthew G Knepley       ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr);
416a57dd577SMatthew G Knepley       ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
417a57dd577SMatthew G Knepley       ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr);
418a57dd577SMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, "  %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr);
419a57dd577SMatthew G Knepley       ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
420a57dd577SMatthew G Knepley       ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
421a57dd577SMatthew G Knepley       for (v = 0; v < numValues; ++v) {
422a57dd577SMatthew G Knepley         PetscInt size;
423a57dd577SMatthew G Knepley 
424a57dd577SMatthew G Knepley         ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr);
425a57dd577SMatthew G Knepley         if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);}
426a57dd577SMatthew G Knepley         ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr);
427a57dd577SMatthew G Knepley       }
428a57dd577SMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr);
429a57dd577SMatthew G Knepley       ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
4304d41221fSMatthew G Knepley       ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
431a57dd577SMatthew G Knepley     }
432552f7358SJed Brown   }
433552f7358SJed Brown   PetscFunctionReturn(0);
434552f7358SJed Brown }
435552f7358SJed Brown 
436552f7358SJed Brown #undef __FUNCT__
437552f7358SJed Brown #define __FUNCT__ "DMView_Plex"
438552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer)
439552f7358SJed Brown {
440fcf6c8fdSToby Isaac   PetscBool      iascii, ishdf5, isvtk;
441552f7358SJed Brown   PetscErrorCode ierr;
442552f7358SJed Brown 
443552f7358SJed Brown   PetscFunctionBegin;
444552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
445552f7358SJed Brown   PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2);
446552f7358SJed Brown   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr);
447fcf6c8fdSToby Isaac   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK,   &isvtk);CHKERRQ(ierr);
448c6ccd67eSMatthew G. Knepley   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5,  &ishdf5);CHKERRQ(ierr);
449552f7358SJed Brown   if (iascii) {
450552f7358SJed Brown     ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr);
451c6ccd67eSMatthew G. Knepley   } else if (ishdf5) {
452c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5)
4537afe7537SMatthew G. Knepley     ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr);
454c6ccd67eSMatthew G. Knepley     ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr);
4557afe7537SMatthew G. Knepley     ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr);
456c6ccd67eSMatthew G. Knepley #else
457c6ccd67eSMatthew G. Knepley     SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5");
458552f7358SJed Brown #endif
45911aeaf0aSBarry Smith   }
460fcf6c8fdSToby Isaac   else if (isvtk) {
461fcf6c8fdSToby Isaac     ierr = DMPlexVTKWriteAll((PetscObject) dm,viewer);CHKERRQ(ierr);
462fcf6c8fdSToby Isaac   }
463552f7358SJed Brown   PetscFunctionReturn(0);
464552f7358SJed Brown }
465552f7358SJed Brown 
4662c40f234SMatthew G. Knepley #undef __FUNCT__
4672c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex"
4682c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer)
4692c40f234SMatthew G. Knepley {
4702c40f234SMatthew G. Knepley   PetscBool      isbinary, ishdf5;
4712c40f234SMatthew G. Knepley   PetscErrorCode ierr;
4722c40f234SMatthew G. Knepley 
4732c40f234SMatthew G. Knepley   PetscFunctionBegin;
4742c40f234SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4752c40f234SMatthew G. Knepley   PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2);
4762c40f234SMatthew G. Knepley   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr);
4772c40f234SMatthew G. Knepley   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5,   &ishdf5);CHKERRQ(ierr);
4782c40f234SMatthew G. Knepley   if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");}
4792c40f234SMatthew G. Knepley   else if (ishdf5) {
4802c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5)
48110b7db4eSMatthew G. Knepley     ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr);
4822c40f234SMatthew G. Knepley #else
4832c40f234SMatthew G. Knepley     SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5");
484552f7358SJed Brown #endif
485552f7358SJed Brown   }
486552f7358SJed Brown   PetscFunctionReturn(0);
487552f7358SJed Brown }
488552f7358SJed Brown 
489552f7358SJed Brown #undef __FUNCT__
4906c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy"
4916c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary)
4926c73c22cSMatthew G. Knepley {
4936c73c22cSMatthew G. Knepley   DMBoundary     b, next;
4946c73c22cSMatthew G. Knepley   PetscErrorCode ierr;
4956c73c22cSMatthew G. Knepley 
4968e136ac0SMatthew G. Knepley   PetscFunctionBegin;
4976c73c22cSMatthew G. Knepley   if (!boundary) PetscFunctionReturn(0);
4986c73c22cSMatthew G. Knepley   b = *boundary;
4996c73c22cSMatthew G. Knepley   *boundary = NULL;
5006c73c22cSMatthew G. Knepley   for (; b; b = next) {
5016c73c22cSMatthew G. Knepley     next = b->next;
5026c73c22cSMatthew G. Knepley     ierr = PetscFree(b->ids);CHKERRQ(ierr);
5036c73c22cSMatthew G. Knepley     ierr = PetscFree(b->name);CHKERRQ(ierr);
50463d5297fSMatthew G. Knepley     ierr = PetscFree(b->labelname);CHKERRQ(ierr);
5056c73c22cSMatthew G. Knepley     ierr = PetscFree(b);CHKERRQ(ierr);
5066c73c22cSMatthew G. Knepley   }
5076c73c22cSMatthew G. Knepley   PetscFunctionReturn(0);
5086c73c22cSMatthew G. Knepley }
5096c73c22cSMatthew G. Knepley 
5106c73c22cSMatthew G. Knepley #undef __FUNCT__
511552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex"
512552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm)
513552f7358SJed Brown {
514552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
515a85475f2SMatthew G. Knepley   PlexLabel      next = mesh->labels;
516552f7358SJed Brown   PetscErrorCode ierr;
517552f7358SJed Brown 
518552f7358SJed Brown   PetscFunctionBegin;
5190d644c17SKarl Rupp   if (--mesh->refct > 0) PetscFunctionReturn(0);
520552f7358SJed Brown   ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr);
521552f7358SJed Brown   ierr = PetscFree(mesh->cones);CHKERRQ(ierr);
522552f7358SJed Brown   ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr);
523552f7358SJed Brown   ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr);
524552f7358SJed Brown   ierr = PetscFree(mesh->supports);CHKERRQ(ierr);
525552f7358SJed Brown   ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr);
526d9deefdfSMatthew G. Knepley   ierr = PetscFree(mesh->tetgenOpts);CHKERRQ(ierr);
527d9deefdfSMatthew G. Knepley   ierr = PetscFree(mesh->triangleOpts);CHKERRQ(ierr);
52877623264SMatthew G. Knepley   ierr = PetscPartitionerDestroy(&mesh->partitioner);CHKERRQ(ierr);
529552f7358SJed Brown   while (next) {
530a85475f2SMatthew G. Knepley     PlexLabel tmp = next->next;
531552f7358SJed Brown 
532a85475f2SMatthew G. Knepley     ierr = DMLabelDestroy(&next->label);CHKERRQ(ierr);
533a85475f2SMatthew G. Knepley     ierr = PetscFree(next);CHKERRQ(ierr);
534552f7358SJed Brown     next = tmp;
535552f7358SJed Brown   }
5363913d7c8SMatthew G. Knepley   ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr);
537a89082eeSMatthew G Knepley   ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr);
538552f7358SJed Brown   ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr);
539552f7358SJed Brown   ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr);
5406c73c22cSMatthew G. Knepley   ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr);
541a68b90caSToby Isaac   ierr = PetscSectionDestroy(&mesh->anchorSection);CHKERRQ(ierr);
542a68b90caSToby Isaac   ierr = ISDestroy(&mesh->anchorIS);CHKERRQ(ierr);
543d961a43aSToby Isaac   ierr = PetscSectionDestroy(&mesh->parentSection);CHKERRQ(ierr);
544d961a43aSToby Isaac   ierr = PetscFree(mesh->parents);CHKERRQ(ierr);
545d961a43aSToby Isaac   ierr = PetscFree(mesh->childIDs);CHKERRQ(ierr);
546d961a43aSToby Isaac   ierr = PetscSectionDestroy(&mesh->childSection);CHKERRQ(ierr);
547d961a43aSToby Isaac   ierr = PetscFree(mesh->children);CHKERRQ(ierr);
548d6a7ad0dSToby Isaac   ierr = DMDestroy(&mesh->referenceTree);CHKERRQ(ierr);
549552f7358SJed Brown   /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */
550552f7358SJed Brown   ierr = PetscFree(mesh);CHKERRQ(ierr);
551552f7358SJed Brown   PetscFunctionReturn(0);
552552f7358SJed Brown }
553552f7358SJed Brown 
554552f7358SJed Brown #undef __FUNCT__
555552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex"
556b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J)
557552f7358SJed Brown {
558552f7358SJed Brown   PetscSection   section, sectionGlobal;
559552f7358SJed Brown   PetscInt       bs = -1;
560552f7358SJed Brown   PetscInt       localSize;
56189545effSMatthew G. Knepley   PetscBool      isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock;
562552f7358SJed Brown   PetscErrorCode ierr;
563b412c318SBarry Smith   MatType        mtype;
564552f7358SJed Brown 
565552f7358SJed Brown   PetscFunctionBegin;
566607a6623SBarry Smith   ierr = MatInitializePackage();CHKERRQ(ierr);
567b412c318SBarry Smith   mtype = dm->mattype;
568552f7358SJed Brown   ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);
569552f7358SJed Brown   ierr = DMGetDefaultGlobalSection(dm, &sectionGlobal);CHKERRQ(ierr);
570552f7358SJed Brown   /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */
571552f7358SJed Brown   ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr);
57282f516ccSBarry Smith   ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr);
573552f7358SJed Brown   ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
574552f7358SJed Brown   ierr = MatSetType(*J, mtype);CHKERRQ(ierr);
575552f7358SJed Brown   ierr = MatSetFromOptions(*J);CHKERRQ(ierr);
576552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr);
577552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr);
578552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr);
579552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr);
580552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr);
581552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr);
582552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr);
583552f7358SJed Brown   if (!isShell) {
584552f7358SJed Brown     PetscBool fillMatrix = (PetscBool) !dm->prealloc_only;
5852a28c762SMatthew G Knepley     PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin;
586552f7358SJed Brown 
587552f7358SJed Brown     if (bs < 0) {
588552f7358SJed Brown       if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) {
589fad22124SMatthew G Knepley         PetscInt pStart, pEnd, p, dof, cdof;
590552f7358SJed Brown 
591552f7358SJed Brown         ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr);
592552f7358SJed Brown         for (p = pStart; p < pEnd; ++p) {
593552f7358SJed Brown           ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr);
594fad22124SMatthew G Knepley           ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr);
595fad22124SMatthew G Knepley           if (dof-cdof) {
5962a28c762SMatthew G Knepley             if (bs < 0) {
597fad22124SMatthew G Knepley               bs = dof-cdof;
598fad22124SMatthew G Knepley             } else if (bs != dof-cdof) {
5992a28c762SMatthew G Knepley               /* Layout does not admit a pointwise block size */
6002a28c762SMatthew G Knepley               bs = 1;
601552f7358SJed Brown               break;
602552f7358SJed Brown             }
603552f7358SJed Brown           }
6042a28c762SMatthew G Knepley         }
6052a28c762SMatthew G Knepley         /* Must have same blocksize on all procs (some might have no points) */
6062a28c762SMatthew G Knepley         bsLocal = bs;
60782f516ccSBarry Smith         ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr);
6082a28c762SMatthew G Knepley         bsLocal = bs < 0 ? bsMax : bs;
60982f516ccSBarry Smith         ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr);
6102a28c762SMatthew G Knepley         if (bsMin != bsMax) {
6112a28c762SMatthew G Knepley           bs = 1;
6122a28c762SMatthew G Knepley         } else {
6132a28c762SMatthew G Knepley           bs = bsMax;
6142a28c762SMatthew G Knepley         }
615552f7358SJed Brown       } else {
616552f7358SJed Brown         bs = 1;
617552f7358SJed Brown       }
618552f7358SJed Brown     }
6191795a4d1SJed Brown     ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr);
620552f7358SJed Brown     ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr);
621552f7358SJed Brown     ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr);
622552f7358SJed Brown   }
623552f7358SJed Brown   PetscFunctionReturn(0);
624552f7358SJed Brown }
625552f7358SJed Brown 
626552f7358SJed Brown #undef __FUNCT__
627552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart"
628552f7358SJed Brown /*@
629552f7358SJed Brown   DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd)
630552f7358SJed Brown 
631552f7358SJed Brown   Not collective
632552f7358SJed Brown 
633552f7358SJed Brown   Input Parameter:
634552f7358SJed Brown . mesh - The DMPlex
635552f7358SJed Brown 
636552f7358SJed Brown   Output Parameters:
637552f7358SJed Brown + pStart - The first mesh point
638552f7358SJed Brown - pEnd   - The upper bound for mesh points
639552f7358SJed Brown 
640552f7358SJed Brown   Level: beginner
641552f7358SJed Brown 
642552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart()
643552f7358SJed Brown @*/
644552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd)
645552f7358SJed Brown {
646552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
647552f7358SJed Brown   PetscErrorCode ierr;
648552f7358SJed Brown 
649552f7358SJed Brown   PetscFunctionBegin;
650552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
651552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr);
652552f7358SJed Brown   PetscFunctionReturn(0);
653552f7358SJed Brown }
654552f7358SJed Brown 
655552f7358SJed Brown #undef __FUNCT__
656552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart"
657552f7358SJed Brown /*@
658552f7358SJed Brown   DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd)
659552f7358SJed Brown 
660552f7358SJed Brown   Not collective
661552f7358SJed Brown 
662552f7358SJed Brown   Input Parameters:
663552f7358SJed Brown + mesh - The DMPlex
664552f7358SJed Brown . pStart - The first mesh point
665552f7358SJed Brown - pEnd   - The upper bound for mesh points
666552f7358SJed Brown 
667552f7358SJed Brown   Output Parameters:
668552f7358SJed Brown 
669552f7358SJed Brown   Level: beginner
670552f7358SJed Brown 
671552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart()
672552f7358SJed Brown @*/
673552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd)
674552f7358SJed Brown {
675552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
676552f7358SJed Brown   PetscErrorCode ierr;
677552f7358SJed Brown 
678552f7358SJed Brown   PetscFunctionBegin;
679552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
680552f7358SJed Brown   ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr);
681552f7358SJed Brown   ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr);
682552f7358SJed Brown   PetscFunctionReturn(0);
683552f7358SJed Brown }
684552f7358SJed Brown 
685552f7358SJed Brown #undef __FUNCT__
686552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize"
687552f7358SJed Brown /*@
688552f7358SJed Brown   DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG
689552f7358SJed Brown 
690552f7358SJed Brown   Not collective
691552f7358SJed Brown 
692552f7358SJed Brown   Input Parameters:
693552f7358SJed Brown + mesh - The DMPlex
694552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
695552f7358SJed Brown 
696552f7358SJed Brown   Output Parameter:
697552f7358SJed Brown . size - The cone size for point p
698552f7358SJed Brown 
699552f7358SJed Brown   Level: beginner
700552f7358SJed Brown 
701552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart()
702552f7358SJed Brown @*/
703552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size)
704552f7358SJed Brown {
705552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
706552f7358SJed Brown   PetscErrorCode ierr;
707552f7358SJed Brown 
708552f7358SJed Brown   PetscFunctionBegin;
709552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
710552f7358SJed Brown   PetscValidPointer(size, 3);
711552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr);
712552f7358SJed Brown   PetscFunctionReturn(0);
713552f7358SJed Brown }
714552f7358SJed Brown 
715552f7358SJed Brown #undef __FUNCT__
716552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize"
717552f7358SJed Brown /*@
718552f7358SJed Brown   DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG
719552f7358SJed Brown 
720552f7358SJed Brown   Not collective
721552f7358SJed Brown 
722552f7358SJed Brown   Input Parameters:
723552f7358SJed Brown + mesh - The DMPlex
724552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
725552f7358SJed Brown - size - The cone size for point p
726552f7358SJed Brown 
727552f7358SJed Brown   Output Parameter:
728552f7358SJed Brown 
729552f7358SJed Brown   Note:
730552f7358SJed Brown   This should be called after DMPlexSetChart().
731552f7358SJed Brown 
732552f7358SJed Brown   Level: beginner
733552f7358SJed Brown 
734552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart()
735552f7358SJed Brown @*/
736552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size)
737552f7358SJed Brown {
738552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
739552f7358SJed Brown   PetscErrorCode ierr;
740552f7358SJed Brown 
741552f7358SJed Brown   PetscFunctionBegin;
742552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
743552f7358SJed Brown   ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr);
7440d644c17SKarl Rupp 
745552f7358SJed Brown   mesh->maxConeSize = PetscMax(mesh->maxConeSize, size);
746552f7358SJed Brown   PetscFunctionReturn(0);
747552f7358SJed Brown }
748552f7358SJed Brown 
749552f7358SJed Brown #undef __FUNCT__
750f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize"
751f5a469b9SMatthew G. Knepley /*@
752f5a469b9SMatthew G. Knepley   DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG
753f5a469b9SMatthew G. Knepley 
754f5a469b9SMatthew G. Knepley   Not collective
755f5a469b9SMatthew G. Knepley 
756f5a469b9SMatthew G. Knepley   Input Parameters:
757f5a469b9SMatthew G. Knepley + mesh - The DMPlex
758f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
759f5a469b9SMatthew G. Knepley - size - The additional cone size for point p
760f5a469b9SMatthew G. Knepley 
761f5a469b9SMatthew G. Knepley   Output Parameter:
762f5a469b9SMatthew G. Knepley 
763f5a469b9SMatthew G. Knepley   Note:
764f5a469b9SMatthew G. Knepley   This should be called after DMPlexSetChart().
765f5a469b9SMatthew G. Knepley 
766f5a469b9SMatthew G. Knepley   Level: beginner
767f5a469b9SMatthew G. Knepley 
768f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart()
769f5a469b9SMatthew G. Knepley @*/
770f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size)
771f5a469b9SMatthew G. Knepley {
772f5a469b9SMatthew G. Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
773f5a469b9SMatthew G. Knepley   PetscInt       csize;
774f5a469b9SMatthew G. Knepley   PetscErrorCode ierr;
775f5a469b9SMatthew G. Knepley 
776f5a469b9SMatthew G. Knepley   PetscFunctionBegin;
777f5a469b9SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
778f5a469b9SMatthew G. Knepley   ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr);
779f5a469b9SMatthew G. Knepley   ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr);
780f5a469b9SMatthew G. Knepley 
781f5a469b9SMatthew G. Knepley   mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize);
782f5a469b9SMatthew G. Knepley   PetscFunctionReturn(0);
783f5a469b9SMatthew G. Knepley }
784f5a469b9SMatthew G. Knepley 
785f5a469b9SMatthew G. Knepley #undef __FUNCT__
786552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone"
787552f7358SJed Brown /*@C
788552f7358SJed Brown   DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG
789552f7358SJed Brown 
790552f7358SJed Brown   Not collective
791552f7358SJed Brown 
792552f7358SJed Brown   Input Parameters:
793552f7358SJed Brown + mesh - The DMPlex
794552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
795552f7358SJed Brown 
796552f7358SJed Brown   Output Parameter:
797552f7358SJed Brown . cone - An array of points which are on the in-edges for point p
798552f7358SJed Brown 
799552f7358SJed Brown   Level: beginner
800552f7358SJed Brown 
8013813dfbdSMatthew G Knepley   Fortran Notes:
8023813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
8033813dfbdSMatthew G Knepley   include petsc.h90 in your code.
8043813dfbdSMatthew G Knepley 
8053813dfbdSMatthew G Knepley   You must also call DMPlexRestoreCone() after you finish using the returned array.
806552f7358SJed Brown 
807552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart()
808552f7358SJed Brown @*/
809552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[])
810552f7358SJed Brown {
811552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
812552f7358SJed Brown   PetscInt       off;
813552f7358SJed Brown   PetscErrorCode ierr;
814552f7358SJed Brown 
815552f7358SJed Brown   PetscFunctionBegin;
816552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
817552f7358SJed Brown   PetscValidPointer(cone, 3);
818552f7358SJed Brown   ierr  = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
819552f7358SJed Brown   *cone = &mesh->cones[off];
820552f7358SJed Brown   PetscFunctionReturn(0);
821552f7358SJed Brown }
822552f7358SJed Brown 
823552f7358SJed Brown #undef __FUNCT__
824552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone"
825552f7358SJed Brown /*@
826552f7358SJed Brown   DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG
827552f7358SJed Brown 
828552f7358SJed Brown   Not collective
829552f7358SJed Brown 
830552f7358SJed Brown   Input Parameters:
831552f7358SJed Brown + mesh - The DMPlex
832552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
833552f7358SJed Brown - cone - An array of points which are on the in-edges for point p
834552f7358SJed Brown 
835552f7358SJed Brown   Output Parameter:
836552f7358SJed Brown 
837552f7358SJed Brown   Note:
838552f7358SJed Brown   This should be called after all calls to DMPlexSetConeSize() and DMSetUp().
839552f7358SJed Brown 
840552f7358SJed Brown   Level: beginner
841552f7358SJed Brown 
842552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp()
843552f7358SJed Brown @*/
844552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[])
845552f7358SJed Brown {
846552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
847552f7358SJed Brown   PetscInt       pStart, pEnd;
848552f7358SJed Brown   PetscInt       dof, off, c;
849552f7358SJed Brown   PetscErrorCode ierr;
850552f7358SJed Brown 
851552f7358SJed Brown   PetscFunctionBegin;
852552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
853552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
854552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
855552f7358SJed Brown   if (dof) PetscValidPointer(cone, 3);
856552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
85782f516ccSBarry Smith   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
858552f7358SJed Brown   for (c = 0; c < dof; ++c) {
85982f516ccSBarry Smith     if ((cone[c] < pStart) || (cone[c] >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone point %D is not in the valid range [%D, %D)", cone[c], pStart, pEnd);
860552f7358SJed Brown     mesh->cones[off+c] = cone[c];
861552f7358SJed Brown   }
862552f7358SJed Brown   PetscFunctionReturn(0);
863552f7358SJed Brown }
864552f7358SJed Brown 
865552f7358SJed Brown #undef __FUNCT__
866552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation"
867552f7358SJed Brown /*@C
868552f7358SJed Brown   DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG
869552f7358SJed Brown 
870552f7358SJed Brown   Not collective
871552f7358SJed Brown 
872552f7358SJed Brown   Input Parameters:
873552f7358SJed Brown + mesh - The DMPlex
874552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
875552f7358SJed Brown 
876552f7358SJed Brown   Output Parameter:
877552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an
878552f7358SJed Brown                     integer giving the prescription for cone traversal. If it is negative, the cone is
879552f7358SJed Brown                     traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives
880552f7358SJed Brown                     the index of the cone point on which to start.
881552f7358SJed Brown 
882552f7358SJed Brown   Level: beginner
883552f7358SJed Brown 
8843813dfbdSMatthew G Knepley   Fortran Notes:
8853813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
8863813dfbdSMatthew G Knepley   include petsc.h90 in your code.
8873813dfbdSMatthew G Knepley 
8883813dfbdSMatthew G Knepley   You must also call DMPlexRestoreConeOrientation() after you finish using the returned array.
889552f7358SJed Brown 
890552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart()
891552f7358SJed Brown @*/
892552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[])
893552f7358SJed Brown {
894552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
895552f7358SJed Brown   PetscInt       off;
896552f7358SJed Brown   PetscErrorCode ierr;
897552f7358SJed Brown 
898552f7358SJed Brown   PetscFunctionBegin;
899552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
900552f7358SJed Brown #if defined(PETSC_USE_DEBUG)
901552f7358SJed Brown   {
902552f7358SJed Brown     PetscInt dof;
903552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
904552f7358SJed Brown     if (dof) PetscValidPointer(coneOrientation, 3);
905552f7358SJed Brown   }
906552f7358SJed Brown #endif
907552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
9080d644c17SKarl Rupp 
909552f7358SJed Brown   *coneOrientation = &mesh->coneOrientations[off];
910552f7358SJed Brown   PetscFunctionReturn(0);
911552f7358SJed Brown }
912552f7358SJed Brown 
913552f7358SJed Brown #undef __FUNCT__
914552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation"
915552f7358SJed Brown /*@
916552f7358SJed Brown   DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG
917552f7358SJed Brown 
918552f7358SJed Brown   Not collective
919552f7358SJed Brown 
920552f7358SJed Brown   Input Parameters:
921552f7358SJed Brown + mesh - The DMPlex
922552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
923552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an
924552f7358SJed Brown                     integer giving the prescription for cone traversal. If it is negative, the cone is
925552f7358SJed Brown                     traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives
926552f7358SJed Brown                     the index of the cone point on which to start.
927552f7358SJed Brown 
928552f7358SJed Brown   Output Parameter:
929552f7358SJed Brown 
930552f7358SJed Brown   Note:
931552f7358SJed Brown   This should be called after all calls to DMPlexSetConeSize() and DMSetUp().
932552f7358SJed Brown 
933552f7358SJed Brown   Level: beginner
934552f7358SJed Brown 
935552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp()
936552f7358SJed Brown @*/
937552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[])
938552f7358SJed Brown {
939552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
940552f7358SJed Brown   PetscInt       pStart, pEnd;
941552f7358SJed Brown   PetscInt       dof, off, c;
942552f7358SJed Brown   PetscErrorCode ierr;
943552f7358SJed Brown 
944552f7358SJed Brown   PetscFunctionBegin;
945552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
946552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
947552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
948552f7358SJed Brown   if (dof) PetscValidPointer(coneOrientation, 3);
949552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
95082f516ccSBarry Smith   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
951552f7358SJed Brown   for (c = 0; c < dof; ++c) {
952552f7358SJed Brown     PetscInt cdof, o = coneOrientation[c];
953552f7358SJed Brown 
954552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr);
95582f516ccSBarry Smith     if (o && ((o < -(cdof+1)) || (o >= cdof))) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone orientation %D is not in the valid range [%D. %D)", o, -(cdof+1), cdof);
956552f7358SJed Brown     mesh->coneOrientations[off+c] = o;
957552f7358SJed Brown   }
958552f7358SJed Brown   PetscFunctionReturn(0);
959552f7358SJed Brown }
960552f7358SJed Brown 
961552f7358SJed Brown #undef __FUNCT__
962552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone"
963552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint)
964552f7358SJed Brown {
965552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
966552f7358SJed Brown   PetscInt       pStart, pEnd;
967552f7358SJed Brown   PetscInt       dof, off;
968552f7358SJed Brown   PetscErrorCode ierr;
969552f7358SJed Brown 
970552f7358SJed Brown   PetscFunctionBegin;
971552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
972552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
97382f516ccSBarry Smith   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
97482f516ccSBarry Smith   if ((conePoint < pStart) || (conePoint >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone point %D is not in the valid range [%D, %D)", conePoint, pStart, pEnd);
97577c88f5bSMatthew G Knepley   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
97677c88f5bSMatthew G Knepley   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
97777c88f5bSMatthew G Knepley   if ((conePos < 0) || (conePos >= dof)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone position %D of point %D is not in the valid range [0, %D)", conePos, p, dof);
978552f7358SJed Brown   mesh->cones[off+conePos] = conePoint;
979552f7358SJed Brown   PetscFunctionReturn(0);
980552f7358SJed Brown }
981552f7358SJed Brown 
982552f7358SJed Brown #undef __FUNCT__
98377c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation"
98477c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation)
98577c88f5bSMatthew G Knepley {
98677c88f5bSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
98777c88f5bSMatthew G Knepley   PetscInt       pStart, pEnd;
98877c88f5bSMatthew G Knepley   PetscInt       dof, off;
98977c88f5bSMatthew G Knepley   PetscErrorCode ierr;
99077c88f5bSMatthew G Knepley 
99177c88f5bSMatthew G Knepley   PetscFunctionBegin;
99277c88f5bSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
99377c88f5bSMatthew G Knepley   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
99477c88f5bSMatthew G Knepley   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
99577c88f5bSMatthew G Knepley   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
99677c88f5bSMatthew G Knepley   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
99777c88f5bSMatthew G Knepley   if ((conePos < 0) || (conePos >= dof)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone position %D of point %D is not in the valid range [0, %D)", conePos, p, dof);
99877c88f5bSMatthew G Knepley   mesh->coneOrientations[off+conePos] = coneOrientation;
99977c88f5bSMatthew G Knepley   PetscFunctionReturn(0);
100077c88f5bSMatthew G Knepley }
100177c88f5bSMatthew G Knepley 
100277c88f5bSMatthew G Knepley #undef __FUNCT__
1003552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize"
1004552f7358SJed Brown /*@
1005552f7358SJed Brown   DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG
1006552f7358SJed Brown 
1007552f7358SJed Brown   Not collective
1008552f7358SJed Brown 
1009552f7358SJed Brown   Input Parameters:
1010552f7358SJed Brown + mesh - The DMPlex
1011552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1012552f7358SJed Brown 
1013552f7358SJed Brown   Output Parameter:
1014552f7358SJed Brown . size - The support size for point p
1015552f7358SJed Brown 
1016552f7358SJed Brown   Level: beginner
1017552f7358SJed Brown 
1018552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize()
1019552f7358SJed Brown @*/
1020552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size)
1021552f7358SJed Brown {
1022552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1023552f7358SJed Brown   PetscErrorCode ierr;
1024552f7358SJed Brown 
1025552f7358SJed Brown   PetscFunctionBegin;
1026552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1027552f7358SJed Brown   PetscValidPointer(size, 3);
1028552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr);
1029552f7358SJed Brown   PetscFunctionReturn(0);
1030552f7358SJed Brown }
1031552f7358SJed Brown 
1032552f7358SJed Brown #undef __FUNCT__
1033552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize"
1034552f7358SJed Brown /*@
1035552f7358SJed Brown   DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG
1036552f7358SJed Brown 
1037552f7358SJed Brown   Not collective
1038552f7358SJed Brown 
1039552f7358SJed Brown   Input Parameters:
1040552f7358SJed Brown + mesh - The DMPlex
1041552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1042552f7358SJed Brown - size - The support size for point p
1043552f7358SJed Brown 
1044552f7358SJed Brown   Output Parameter:
1045552f7358SJed Brown 
1046552f7358SJed Brown   Note:
1047552f7358SJed Brown   This should be called after DMPlexSetChart().
1048552f7358SJed Brown 
1049552f7358SJed Brown   Level: beginner
1050552f7358SJed Brown 
1051552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart()
1052552f7358SJed Brown @*/
1053552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size)
1054552f7358SJed Brown {
1055552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1056552f7358SJed Brown   PetscErrorCode ierr;
1057552f7358SJed Brown 
1058552f7358SJed Brown   PetscFunctionBegin;
1059552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1060552f7358SJed Brown   ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr);
10610d644c17SKarl Rupp 
1062552f7358SJed Brown   mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size);
1063552f7358SJed Brown   PetscFunctionReturn(0);
1064552f7358SJed Brown }
1065552f7358SJed Brown 
1066552f7358SJed Brown #undef __FUNCT__
1067552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport"
1068552f7358SJed Brown /*@C
1069552f7358SJed Brown   DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG
1070552f7358SJed Brown 
1071552f7358SJed Brown   Not collective
1072552f7358SJed Brown 
1073552f7358SJed Brown   Input Parameters:
1074552f7358SJed Brown + mesh - The DMPlex
1075552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1076552f7358SJed Brown 
1077552f7358SJed Brown   Output Parameter:
1078552f7358SJed Brown . support - An array of points which are on the out-edges for point p
1079552f7358SJed Brown 
1080552f7358SJed Brown   Level: beginner
1081552f7358SJed Brown 
10823813dfbdSMatthew G Knepley   Fortran Notes:
10833813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
10843813dfbdSMatthew G Knepley   include petsc.h90 in your code.
10853813dfbdSMatthew G Knepley 
10863813dfbdSMatthew G Knepley   You must also call DMPlexRestoreSupport() after you finish using the returned array.
10873813dfbdSMatthew G Knepley 
1088552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1089552f7358SJed Brown @*/
1090552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[])
1091552f7358SJed Brown {
1092552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1093552f7358SJed Brown   PetscInt       off;
1094552f7358SJed Brown   PetscErrorCode ierr;
1095552f7358SJed Brown 
1096552f7358SJed Brown   PetscFunctionBegin;
1097552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1098552f7358SJed Brown   PetscValidPointer(support, 3);
1099552f7358SJed Brown   ierr     = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
1100552f7358SJed Brown   *support = &mesh->supports[off];
1101552f7358SJed Brown   PetscFunctionReturn(0);
1102552f7358SJed Brown }
1103552f7358SJed Brown 
1104552f7358SJed Brown #undef __FUNCT__
1105552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport"
1106552f7358SJed Brown /*@
1107552f7358SJed Brown   DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG
1108552f7358SJed Brown 
1109552f7358SJed Brown   Not collective
1110552f7358SJed Brown 
1111552f7358SJed Brown   Input Parameters:
1112552f7358SJed Brown + mesh - The DMPlex
1113552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1114552f7358SJed Brown - support - An array of points which are on the in-edges for point p
1115552f7358SJed Brown 
1116552f7358SJed Brown   Output Parameter:
1117552f7358SJed Brown 
1118552f7358SJed Brown   Note:
1119552f7358SJed Brown   This should be called after all calls to DMPlexSetSupportSize() and DMSetUp().
1120552f7358SJed Brown 
1121552f7358SJed Brown   Level: beginner
1122552f7358SJed Brown 
1123552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp()
1124552f7358SJed Brown @*/
1125552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[])
1126552f7358SJed Brown {
1127552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1128552f7358SJed Brown   PetscInt       pStart, pEnd;
1129552f7358SJed Brown   PetscInt       dof, off, c;
1130552f7358SJed Brown   PetscErrorCode ierr;
1131552f7358SJed Brown 
1132552f7358SJed Brown   PetscFunctionBegin;
1133552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1134552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr);
1135552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
1136552f7358SJed Brown   if (dof) PetscValidPointer(support, 3);
1137552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
113882f516ccSBarry Smith   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
1139552f7358SJed Brown   for (c = 0; c < dof; ++c) {
114082f516ccSBarry Smith     if ((support[c] < pStart) || (support[c] >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support point %D is not in the valid range [%D, %D)", support[c], pStart, pEnd);
1141552f7358SJed Brown     mesh->supports[off+c] = support[c];
1142552f7358SJed Brown   }
1143552f7358SJed Brown   PetscFunctionReturn(0);
1144552f7358SJed Brown }
1145552f7358SJed Brown 
1146552f7358SJed Brown #undef __FUNCT__
1147552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport"
1148552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint)
1149552f7358SJed Brown {
1150552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1151552f7358SJed Brown   PetscInt       pStart, pEnd;
1152552f7358SJed Brown   PetscInt       dof, off;
1153552f7358SJed Brown   PetscErrorCode ierr;
1154552f7358SJed Brown 
1155552f7358SJed Brown   PetscFunctionBegin;
1156552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1157552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr);
1158552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
1159552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
116082f516ccSBarry Smith   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
116182f516ccSBarry Smith   if ((supportPoint < pStart) || (supportPoint >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support point %D is not in the valid range [%D, %D)", supportPoint, pStart, pEnd);
116282f516ccSBarry Smith   if (supportPos >= dof) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support position %D of point %D is not in the valid range [0, %D)", supportPos, p, dof);
1163552f7358SJed Brown   mesh->supports[off+supportPos] = supportPoint;
1164552f7358SJed Brown   PetscFunctionReturn(0);
1165552f7358SJed Brown }
1166552f7358SJed Brown 
1167552f7358SJed Brown #undef __FUNCT__
1168552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure"
1169552f7358SJed Brown /*@C
1170552f7358SJed Brown   DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG
1171552f7358SJed Brown 
1172552f7358SJed Brown   Not collective
1173552f7358SJed Brown 
1174552f7358SJed Brown   Input Parameters:
1175552f7358SJed Brown + mesh - The DMPlex
1176552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1177552f7358SJed Brown . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
11780298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used
1179552f7358SJed Brown 
1180552f7358SJed Brown   Output Parameters:
1181552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints
1182552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...]
1183552f7358SJed Brown 
1184552f7358SJed Brown   Note:
11850298fd71SBarry Smith   If using internal storage (points is NULL on input), each call overwrites the last output.
1186552f7358SJed Brown 
11873813dfbdSMatthew G Knepley   Fortran Notes:
11883813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
11893813dfbdSMatthew G Knepley   include petsc.h90 in your code.
11903813dfbdSMatthew G Knepley 
11913813dfbdSMatthew G Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
11923813dfbdSMatthew G Knepley 
1193552f7358SJed Brown   Level: beginner
1194552f7358SJed Brown 
1195552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1196552f7358SJed Brown @*/
1197552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
1198552f7358SJed Brown {
1199552f7358SJed Brown   DM_Plex        *mesh = (DM_Plex*) dm->data;
1200552f7358SJed Brown   PetscInt       *closure, *fifo;
12010298fd71SBarry Smith   const PetscInt *tmp = NULL, *tmpO = NULL;
1202552f7358SJed Brown   PetscInt        tmpSize, t;
1203552f7358SJed Brown   PetscInt        depth       = 0, maxSize;
1204552f7358SJed Brown   PetscInt        closureSize = 2, fifoSize = 0, fifoStart = 0;
1205552f7358SJed Brown   PetscErrorCode  ierr;
1206552f7358SJed Brown 
1207552f7358SJed Brown   PetscFunctionBegin;
1208552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1209552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1210552f7358SJed Brown   /* This is only 1-level */
1211552f7358SJed Brown   if (useCone) {
1212552f7358SJed Brown     ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr);
1213552f7358SJed Brown     ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr);
1214552f7358SJed Brown     ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr);
1215552f7358SJed Brown   } else {
1216552f7358SJed Brown     ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr);
1217552f7358SJed Brown     ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr);
1218552f7358SJed Brown   }
1219bfbcdd7aSMatthew G. Knepley   if (depth == 1) {
1220bfbcdd7aSMatthew G. Knepley     if (*points) {
1221bfbcdd7aSMatthew G. Knepley       closure = *points;
1222bfbcdd7aSMatthew G. Knepley     } else {
1223bfbcdd7aSMatthew G. Knepley       maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1);
1224bfbcdd7aSMatthew G. Knepley       ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
1225bfbcdd7aSMatthew G. Knepley     }
1226bfbcdd7aSMatthew G. Knepley     closure[0] = p; closure[1] = 0;
1227bfbcdd7aSMatthew G. Knepley     for (t = 0; t < tmpSize; ++t, closureSize += 2) {
1228bfbcdd7aSMatthew G. Knepley       closure[closureSize]   = tmp[t];
1229bfbcdd7aSMatthew G. Knepley       closure[closureSize+1] = tmpO ? tmpO[t] : 0;
1230bfbcdd7aSMatthew G. Knepley     }
1231bfbcdd7aSMatthew G. Knepley     if (numPoints) *numPoints = closureSize/2;
1232bfbcdd7aSMatthew G. Knepley     if (points)    *points    = closure;
1233bfbcdd7aSMatthew G. Knepley     PetscFunctionReturn(0);
1234bfbcdd7aSMatthew G. Knepley   }
123524c766afSToby Isaac   {
123624c766afSToby Isaac     PetscInt c, coneSeries, s,supportSeries;
123724c766afSToby Isaac 
123824c766afSToby Isaac     c = mesh->maxConeSize;
123924c766afSToby Isaac     coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1;
124024c766afSToby Isaac     s = mesh->maxSupportSize;
124124c766afSToby Isaac     supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1;
124224c766afSToby Isaac     maxSize = 2*PetscMax(coneSeries,supportSeries);
124324c766afSToby Isaac   }
1244bfbcdd7aSMatthew G. Knepley   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
1245bfbcdd7aSMatthew G. Knepley   if (*points) {
1246bfbcdd7aSMatthew G. Knepley     closure = *points;
1247bfbcdd7aSMatthew G. Knepley   } else {
1248bfbcdd7aSMatthew G. Knepley     ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
1249bfbcdd7aSMatthew G. Knepley   }
1250bfbcdd7aSMatthew G. Knepley   closure[0] = p; closure[1] = 0;
1251552f7358SJed Brown   for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) {
1252552f7358SJed Brown     const PetscInt cp = tmp[t];
1253552f7358SJed Brown     const PetscInt co = tmpO ? tmpO[t] : 0;
1254552f7358SJed Brown 
1255552f7358SJed Brown     closure[closureSize]   = cp;
1256552f7358SJed Brown     closure[closureSize+1] = co;
1257552f7358SJed Brown     fifo[fifoSize]         = cp;
1258552f7358SJed Brown     fifo[fifoSize+1]       = co;
1259552f7358SJed Brown   }
1260bfbcdd7aSMatthew G. Knepley   /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */
1261552f7358SJed Brown   while (fifoSize - fifoStart) {
1262552f7358SJed Brown     const PetscInt q   = fifo[fifoStart];
1263552f7358SJed Brown     const PetscInt o   = fifo[fifoStart+1];
1264552f7358SJed Brown     const PetscInt rev = o >= 0 ? 0 : 1;
1265552f7358SJed Brown     const PetscInt off = rev ? -(o+1) : o;
1266552f7358SJed Brown 
1267552f7358SJed Brown     if (useCone) {
1268552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr);
1269552f7358SJed Brown       ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr);
1270552f7358SJed Brown       ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr);
1271552f7358SJed Brown     } else {
1272552f7358SJed Brown       ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr);
1273552f7358SJed Brown       ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr);
12740298fd71SBarry Smith       tmpO = NULL;
1275552f7358SJed Brown     }
1276552f7358SJed Brown     for (t = 0; t < tmpSize; ++t) {
1277552f7358SJed Brown       const PetscInt i  = ((rev ? tmpSize-t : t) + off)%tmpSize;
1278552f7358SJed Brown       const PetscInt cp = tmp[i];
12792e1b13c2SMatthew G. Knepley       /* Must propogate orientation: When we reverse orientation, we both reverse the direction of iteration and start at the other end of the chain. */
12802e1b13c2SMatthew G. Knepley       /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1)
12812e1b13c2SMatthew G. Knepley        const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */
12822e1b13c2SMatthew G. Knepley       PetscInt       co = tmpO ? tmpO[i] : 0;
1283552f7358SJed Brown       PetscInt       c;
1284552f7358SJed Brown 
12852e1b13c2SMatthew G. Knepley       if (rev) {
12862e1b13c2SMatthew G. Knepley         PetscInt childSize, coff;
12872e1b13c2SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
12882e1b13c2SMatthew G. Knepley         coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
12892e1b13c2SMatthew G. Knepley         co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
12902e1b13c2SMatthew G. Knepley       }
1291552f7358SJed Brown       /* Check for duplicate */
1292552f7358SJed Brown       for (c = 0; c < closureSize; c += 2) {
1293552f7358SJed Brown         if (closure[c] == cp) break;
1294552f7358SJed Brown       }
1295552f7358SJed Brown       if (c == closureSize) {
1296552f7358SJed Brown         closure[closureSize]   = cp;
1297552f7358SJed Brown         closure[closureSize+1] = co;
1298552f7358SJed Brown         fifo[fifoSize]         = cp;
1299552f7358SJed Brown         fifo[fifoSize+1]       = co;
1300552f7358SJed Brown         closureSize           += 2;
1301552f7358SJed Brown         fifoSize              += 2;
1302552f7358SJed Brown       }
1303552f7358SJed Brown     }
1304552f7358SJed Brown     fifoStart += 2;
1305552f7358SJed Brown   }
1306552f7358SJed Brown   if (numPoints) *numPoints = closureSize/2;
1307552f7358SJed Brown   if (points)    *points    = closure;
1308552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
1309552f7358SJed Brown   PetscFunctionReturn(0);
1310552f7358SJed Brown }
1311552f7358SJed Brown 
1312552f7358SJed Brown #undef __FUNCT__
13139bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal"
13149bf0dad6SMatthew G. Knepley /*@C
13159bf0dad6SMatthew G. Knepley   DMPlexGetTransitiveClosure_Internal - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG with a specified initial orientation
13169bf0dad6SMatthew G. Knepley 
13179bf0dad6SMatthew G. Knepley   Not collective
13189bf0dad6SMatthew G. Knepley 
13199bf0dad6SMatthew G. Knepley   Input Parameters:
13209bf0dad6SMatthew G. Knepley + mesh - The DMPlex
13219bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
13229bf0dad6SMatthew G. Knepley . orientation - The orientation of the point
13239bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
13249bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used
13259bf0dad6SMatthew G. Knepley 
13269bf0dad6SMatthew G. Knepley   Output Parameters:
13279bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints
13289bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...]
13299bf0dad6SMatthew G. Knepley 
13309bf0dad6SMatthew G. Knepley   Note:
13319bf0dad6SMatthew G. Knepley   If using internal storage (points is NULL on input), each call overwrites the last output.
13329bf0dad6SMatthew G. Knepley 
13339bf0dad6SMatthew G. Knepley   Fortran Notes:
13349bf0dad6SMatthew G. Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
13359bf0dad6SMatthew G. Knepley   include petsc.h90 in your code.
13369bf0dad6SMatthew G. Knepley 
13379bf0dad6SMatthew G. Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
13389bf0dad6SMatthew G. Knepley 
13399bf0dad6SMatthew G. Knepley   Level: beginner
13409bf0dad6SMatthew G. Knepley 
13419bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
13429bf0dad6SMatthew G. Knepley @*/
13439bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
13449bf0dad6SMatthew G. Knepley {
13459bf0dad6SMatthew G. Knepley   DM_Plex        *mesh = (DM_Plex*) dm->data;
13469bf0dad6SMatthew G. Knepley   PetscInt       *closure, *fifo;
13479bf0dad6SMatthew G. Knepley   const PetscInt *tmp = NULL, *tmpO = NULL;
13489bf0dad6SMatthew G. Knepley   PetscInt        tmpSize, t;
13499bf0dad6SMatthew G. Knepley   PetscInt        depth       = 0, maxSize;
13509bf0dad6SMatthew G. Knepley   PetscInt        closureSize = 2, fifoSize = 0, fifoStart = 0;
13519bf0dad6SMatthew G. Knepley   PetscErrorCode  ierr;
13529bf0dad6SMatthew G. Knepley 
13539bf0dad6SMatthew G. Knepley   PetscFunctionBegin;
13549bf0dad6SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
13559bf0dad6SMatthew G. Knepley   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
13569bf0dad6SMatthew G. Knepley   /* This is only 1-level */
13579bf0dad6SMatthew G. Knepley   if (useCone) {
13589bf0dad6SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr);
13599bf0dad6SMatthew G. Knepley     ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr);
13609bf0dad6SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr);
13619bf0dad6SMatthew G. Knepley   } else {
13629bf0dad6SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr);
13639bf0dad6SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr);
13649bf0dad6SMatthew G. Knepley   }
13659bf0dad6SMatthew G. Knepley   if (depth == 1) {
13669bf0dad6SMatthew G. Knepley     if (*points) {
13679bf0dad6SMatthew G. Knepley       closure = *points;
13689bf0dad6SMatthew G. Knepley     } else {
13699bf0dad6SMatthew G. Knepley       maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1);
13709bf0dad6SMatthew G. Knepley       ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
13719bf0dad6SMatthew G. Knepley     }
13729bf0dad6SMatthew G. Knepley     closure[0] = p; closure[1] = ornt;
13739bf0dad6SMatthew G. Knepley     for (t = 0; t < tmpSize; ++t, closureSize += 2) {
13749bf0dad6SMatthew G. Knepley       const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize;
13759bf0dad6SMatthew G. Knepley       closure[closureSize]   = tmp[i];
13769bf0dad6SMatthew G. Knepley       closure[closureSize+1] = tmpO ? tmpO[i] : 0;
13779bf0dad6SMatthew G. Knepley     }
13789bf0dad6SMatthew G. Knepley     if (numPoints) *numPoints = closureSize/2;
13799bf0dad6SMatthew G. Knepley     if (points)    *points    = closure;
13809bf0dad6SMatthew G. Knepley     PetscFunctionReturn(0);
13819bf0dad6SMatthew G. Knepley   }
138224c766afSToby Isaac   {
138324c766afSToby Isaac     PetscInt c, coneSeries, s,supportSeries;
138424c766afSToby Isaac 
138524c766afSToby Isaac     c = mesh->maxConeSize;
138624c766afSToby Isaac     coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1;
138724c766afSToby Isaac     s = mesh->maxSupportSize;
138824c766afSToby Isaac     supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1;
138924c766afSToby Isaac     maxSize = 2*PetscMax(coneSeries,supportSeries);
139024c766afSToby Isaac   }
13919bf0dad6SMatthew G. Knepley   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
13929bf0dad6SMatthew G. Knepley   if (*points) {
13939bf0dad6SMatthew G. Knepley     closure = *points;
13949bf0dad6SMatthew G. Knepley   } else {
13959bf0dad6SMatthew G. Knepley     ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
13969bf0dad6SMatthew G. Knepley   }
13979bf0dad6SMatthew G. Knepley   closure[0] = p; closure[1] = ornt;
13989bf0dad6SMatthew G. Knepley   for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) {
13999bf0dad6SMatthew G. Knepley     const PetscInt i  = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize;
14009bf0dad6SMatthew G. Knepley     const PetscInt cp = tmp[i];
14019bf0dad6SMatthew G. Knepley     PetscInt       co = tmpO ? tmpO[i] : 0;
14029bf0dad6SMatthew G. Knepley 
14039bf0dad6SMatthew G. Knepley     if (ornt < 0) {
14049bf0dad6SMatthew G. Knepley       PetscInt childSize, coff;
14059bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
14069bf0dad6SMatthew G. Knepley       coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
14079bf0dad6SMatthew G. Knepley       co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
14089bf0dad6SMatthew G. Knepley     }
14099bf0dad6SMatthew G. Knepley     closure[closureSize]   = cp;
14109bf0dad6SMatthew G. Knepley     closure[closureSize+1] = co;
14119bf0dad6SMatthew G. Knepley     fifo[fifoSize]         = cp;
14129bf0dad6SMatthew G. Knepley     fifo[fifoSize+1]       = co;
14139bf0dad6SMatthew G. Knepley   }
14149bf0dad6SMatthew G. Knepley   /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */
14159bf0dad6SMatthew G. Knepley   while (fifoSize - fifoStart) {
14169bf0dad6SMatthew G. Knepley     const PetscInt q   = fifo[fifoStart];
14179bf0dad6SMatthew G. Knepley     const PetscInt o   = fifo[fifoStart+1];
14189bf0dad6SMatthew G. Knepley     const PetscInt rev = o >= 0 ? 0 : 1;
14199bf0dad6SMatthew G. Knepley     const PetscInt off = rev ? -(o+1) : o;
14209bf0dad6SMatthew G. Knepley 
14219bf0dad6SMatthew G. Knepley     if (useCone) {
14229bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr);
14239bf0dad6SMatthew G. Knepley       ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr);
14249bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr);
14259bf0dad6SMatthew G. Knepley     } else {
14269bf0dad6SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr);
14279bf0dad6SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr);
14289bf0dad6SMatthew G. Knepley       tmpO = NULL;
14299bf0dad6SMatthew G. Knepley     }
14309bf0dad6SMatthew G. Knepley     for (t = 0; t < tmpSize; ++t) {
14319bf0dad6SMatthew G. Knepley       const PetscInt i  = ((rev ? tmpSize-t : t) + off)%tmpSize;
14329bf0dad6SMatthew G. Knepley       const PetscInt cp = tmp[i];
14339bf0dad6SMatthew G. Knepley       /* Must propogate orientation: When we reverse orientation, we both reverse the direction of iteration and start at the other end of the chain. */
14349bf0dad6SMatthew G. Knepley       /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1)
14359bf0dad6SMatthew G. Knepley        const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */
14369bf0dad6SMatthew G. Knepley       PetscInt       co = tmpO ? tmpO[i] : 0;
14379bf0dad6SMatthew G. Knepley       PetscInt       c;
14389bf0dad6SMatthew G. Knepley 
14399bf0dad6SMatthew G. Knepley       if (rev) {
14409bf0dad6SMatthew G. Knepley         PetscInt childSize, coff;
14419bf0dad6SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
14429bf0dad6SMatthew G. Knepley         coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
14439bf0dad6SMatthew G. Knepley         co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
14449bf0dad6SMatthew G. Knepley       }
14459bf0dad6SMatthew G. Knepley       /* Check for duplicate */
14469bf0dad6SMatthew G. Knepley       for (c = 0; c < closureSize; c += 2) {
14479bf0dad6SMatthew G. Knepley         if (closure[c] == cp) break;
14489bf0dad6SMatthew G. Knepley       }
14499bf0dad6SMatthew G. Knepley       if (c == closureSize) {
14509bf0dad6SMatthew G. Knepley         closure[closureSize]   = cp;
14519bf0dad6SMatthew G. Knepley         closure[closureSize+1] = co;
14529bf0dad6SMatthew G. Knepley         fifo[fifoSize]         = cp;
14539bf0dad6SMatthew G. Knepley         fifo[fifoSize+1]       = co;
14549bf0dad6SMatthew G. Knepley         closureSize           += 2;
14559bf0dad6SMatthew G. Knepley         fifoSize              += 2;
14569bf0dad6SMatthew G. Knepley       }
14579bf0dad6SMatthew G. Knepley     }
14589bf0dad6SMatthew G. Knepley     fifoStart += 2;
14599bf0dad6SMatthew G. Knepley   }
14609bf0dad6SMatthew G. Knepley   if (numPoints) *numPoints = closureSize/2;
14619bf0dad6SMatthew G. Knepley   if (points)    *points    = closure;
14629bf0dad6SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
14639bf0dad6SMatthew G. Knepley   PetscFunctionReturn(0);
14649bf0dad6SMatthew G. Knepley }
14659bf0dad6SMatthew G. Knepley 
14669bf0dad6SMatthew G. Knepley #undef __FUNCT__
1467552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure"
1468552f7358SJed Brown /*@C
1469552f7358SJed Brown   DMPlexRestoreTransitiveClosure - Restore the array of points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG
1470552f7358SJed Brown 
1471552f7358SJed Brown   Not collective
1472552f7358SJed Brown 
1473552f7358SJed Brown   Input Parameters:
1474552f7358SJed Brown + mesh - The DMPlex
1475552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1476552f7358SJed Brown . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
1477e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit
1478e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit
1479552f7358SJed Brown 
1480552f7358SJed Brown   Note:
14810298fd71SBarry Smith   If not using internal storage (points is not NULL on input), this call is unnecessary
1482552f7358SJed Brown 
14833813dfbdSMatthew G Knepley   Fortran Notes:
14843813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
14853813dfbdSMatthew G Knepley   include petsc.h90 in your code.
14863813dfbdSMatthew G Knepley 
14873813dfbdSMatthew G Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
14883813dfbdSMatthew G Knepley 
1489552f7358SJed Brown   Level: beginner
1490552f7358SJed Brown 
1491552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1492552f7358SJed Brown @*/
1493552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
1494552f7358SJed Brown {
1495552f7358SJed Brown   PetscErrorCode ierr;
1496552f7358SJed Brown 
1497552f7358SJed Brown   PetscFunctionBegin;
1498552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1499e5c84f05SJed Brown   if (numPoints) PetscValidIntPointer(numPoints,4);
1500e5c84f05SJed Brown   if (points) PetscValidPointer(points,5);
1501552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr);
15024ff43b2cSJed Brown   if (numPoints) *numPoints = 0;
1503552f7358SJed Brown   PetscFunctionReturn(0);
1504552f7358SJed Brown }
1505552f7358SJed Brown 
1506552f7358SJed Brown #undef __FUNCT__
1507552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes"
1508552f7358SJed Brown /*@
1509552f7358SJed Brown   DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG
1510552f7358SJed Brown 
1511552f7358SJed Brown   Not collective
1512552f7358SJed Brown 
1513552f7358SJed Brown   Input Parameter:
1514552f7358SJed Brown . mesh - The DMPlex
1515552f7358SJed Brown 
1516552f7358SJed Brown   Output Parameters:
1517552f7358SJed Brown + maxConeSize - The maximum number of in-edges
1518552f7358SJed Brown - maxSupportSize - The maximum number of out-edges
1519552f7358SJed Brown 
1520552f7358SJed Brown   Level: beginner
1521552f7358SJed Brown 
1522552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart()
1523552f7358SJed Brown @*/
1524552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize)
1525552f7358SJed Brown {
1526552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
1527552f7358SJed Brown 
1528552f7358SJed Brown   PetscFunctionBegin;
1529552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1530552f7358SJed Brown   if (maxConeSize)    *maxConeSize    = mesh->maxConeSize;
1531552f7358SJed Brown   if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize;
1532552f7358SJed Brown   PetscFunctionReturn(0);
1533552f7358SJed Brown }
1534552f7358SJed Brown 
1535552f7358SJed Brown #undef __FUNCT__
1536552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex"
1537552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm)
1538552f7358SJed Brown {
1539552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1540552f7358SJed Brown   PetscInt       size;
1541552f7358SJed Brown   PetscErrorCode ierr;
1542552f7358SJed Brown 
1543552f7358SJed Brown   PetscFunctionBegin;
1544552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1545552f7358SJed Brown   ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr);
1546552f7358SJed Brown   ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr);
15471795a4d1SJed Brown   ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr);
15481795a4d1SJed Brown   ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr);
1549552f7358SJed Brown   if (mesh->maxSupportSize) {
1550552f7358SJed Brown     ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr);
1551552f7358SJed Brown     ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr);
15521795a4d1SJed Brown     ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr);
1553552f7358SJed Brown   }
1554552f7358SJed Brown   PetscFunctionReturn(0);
1555552f7358SJed Brown }
1556552f7358SJed Brown 
1557552f7358SJed Brown #undef __FUNCT__
1558552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex"
1559552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm)
1560552f7358SJed Brown {
1561552f7358SJed Brown   PetscErrorCode ierr;
1562552f7358SJed Brown 
1563552f7358SJed Brown   PetscFunctionBegin;
15644d9407bcSMatthew G. Knepley   if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);}
15654d9407bcSMatthew G. Knepley   ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr);
1566552f7358SJed Brown   PetscFunctionReturn(0);
1567552f7358SJed Brown }
1568552f7358SJed Brown 
1569552f7358SJed Brown #undef __FUNCT__
1570552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize"
1571552f7358SJed Brown /*@
1572552f7358SJed Brown   DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation
1573552f7358SJed Brown 
1574552f7358SJed Brown   Not collective
1575552f7358SJed Brown 
1576552f7358SJed Brown   Input Parameter:
1577552f7358SJed Brown . mesh - The DMPlex
1578552f7358SJed Brown 
1579552f7358SJed Brown   Output Parameter:
1580552f7358SJed Brown 
1581552f7358SJed Brown   Note:
1582552f7358SJed Brown   This should be called after all calls to DMPlexSetCone()
1583552f7358SJed Brown 
1584552f7358SJed Brown   Level: beginner
1585552f7358SJed Brown 
1586552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone()
1587552f7358SJed Brown @*/
1588552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm)
1589552f7358SJed Brown {
1590552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1591552f7358SJed Brown   PetscInt      *offsets;
1592552f7358SJed Brown   PetscInt       supportSize;
1593552f7358SJed Brown   PetscInt       pStart, pEnd, p;
1594552f7358SJed Brown   PetscErrorCode ierr;
1595552f7358SJed Brown 
1596552f7358SJed Brown   PetscFunctionBegin;
1597552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
159882f516ccSBarry Smith   if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex");
1599552f7358SJed Brown   /* Calculate support sizes */
1600552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
1601552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1602552f7358SJed Brown     PetscInt dof, off, c;
1603552f7358SJed Brown 
1604552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
1605552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
1606552f7358SJed Brown     for (c = off; c < off+dof; ++c) {
1607552f7358SJed Brown       ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr);
1608552f7358SJed Brown     }
1609552f7358SJed Brown   }
1610552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1611552f7358SJed Brown     PetscInt dof;
1612552f7358SJed Brown 
1613552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
16140d644c17SKarl Rupp 
1615552f7358SJed Brown     mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof);
1616552f7358SJed Brown   }
1617552f7358SJed Brown   ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr);
1618552f7358SJed Brown   /* Calculate supports */
1619552f7358SJed Brown   ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr);
16201795a4d1SJed Brown   ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr);
16211795a4d1SJed Brown   ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr);
1622552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1623552f7358SJed Brown     PetscInt dof, off, c;
1624552f7358SJed Brown 
1625552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
1626552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
1627552f7358SJed Brown     for (c = off; c < off+dof; ++c) {
1628552f7358SJed Brown       const PetscInt q = mesh->cones[c];
1629552f7358SJed Brown       PetscInt       offS;
1630552f7358SJed Brown 
1631552f7358SJed Brown       ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr);
16320d644c17SKarl Rupp 
1633552f7358SJed Brown       mesh->supports[offS+offsets[q]] = p;
1634552f7358SJed Brown       ++offsets[q];
1635552f7358SJed Brown     }
1636552f7358SJed Brown   }
1637552f7358SJed Brown   ierr = PetscFree(offsets);CHKERRQ(ierr);
1638552f7358SJed Brown   PetscFunctionReturn(0);
1639552f7358SJed Brown }
1640552f7358SJed Brown 
1641552f7358SJed Brown #undef __FUNCT__
1642552f7358SJed Brown #define __FUNCT__ "DMPlexStratify"
1643552f7358SJed Brown /*@
1644552f7358SJed Brown   DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and
1645552f7358SJed Brown   can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the
1646552f7358SJed Brown   same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in
1647552f7358SJed Brown   the DAG.
1648552f7358SJed Brown 
1649552f7358SJed Brown   Not collective
1650552f7358SJed Brown 
1651552f7358SJed Brown   Input Parameter:
1652552f7358SJed Brown . mesh - The DMPlex
1653552f7358SJed Brown 
1654552f7358SJed Brown   Output Parameter:
1655552f7358SJed Brown 
1656552f7358SJed Brown   Notes:
1657150b719bSJed Brown   Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices,
1658150b719bSJed Brown   1 for edges, and so on.  The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or
1659150b719bSJed Brown   manually via DMPlexGetLabel().  The height is defined implicitly by height = maxDimension - depth, and can be accessed
1660150b719bSJed Brown   via DMPlexGetHeightStratum().  For example, cells have height 0 and faces have height 1.
1661552f7358SJed Brown 
1662150b719bSJed Brown   DMPlexStratify() should be called after all calls to DMPlexSymmetrize()
1663552f7358SJed Brown 
1664552f7358SJed Brown   Level: beginner
1665552f7358SJed Brown 
1666552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize()
1667552f7358SJed Brown @*/
1668552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm)
1669552f7358SJed Brown {
1670aa50250dSMatthew G. Knepley   DMLabel        label;
1671552f7358SJed Brown   PetscInt       pStart, pEnd, p;
1672552f7358SJed Brown   PetscInt       numRoots = 0, numLeaves = 0;
1673552f7358SJed Brown   PetscErrorCode ierr;
1674552f7358SJed Brown 
1675552f7358SJed Brown   PetscFunctionBegin;
1676552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1677552f7358SJed Brown   ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr);
1678552f7358SJed Brown   /* Calculate depth */
1679aa50250dSMatthew G. Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
1680aa50250dSMatthew G. Knepley   ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr);
1681aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
1682552f7358SJed Brown   /* Initialize roots and count leaves */
1683552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1684552f7358SJed Brown     PetscInt coneSize, supportSize;
1685552f7358SJed Brown 
1686552f7358SJed Brown     ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
1687552f7358SJed Brown     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
1688552f7358SJed Brown     if (!coneSize && supportSize) {
1689552f7358SJed Brown       ++numRoots;
1690aa50250dSMatthew G. Knepley       ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr);
1691552f7358SJed Brown     } else if (!supportSize && coneSize) {
1692552f7358SJed Brown       ++numLeaves;
1693552f7358SJed Brown     } else if (!supportSize && !coneSize) {
1694552f7358SJed Brown       /* Isolated points */
1695aa50250dSMatthew G. Knepley       ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr);
1696552f7358SJed Brown     }
1697552f7358SJed Brown   }
1698552f7358SJed Brown   if (numRoots + numLeaves == (pEnd - pStart)) {
1699552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
1700552f7358SJed Brown       PetscInt coneSize, supportSize;
1701552f7358SJed Brown 
1702552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
1703552f7358SJed Brown       ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
1704552f7358SJed Brown       if (!supportSize && coneSize) {
1705aa50250dSMatthew G. Knepley         ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr);
1706552f7358SJed Brown       }
1707552f7358SJed Brown     }
1708552f7358SJed Brown   } else {
170974ef644bSMatthew G. Knepley     IS       pointIS;
171074ef644bSMatthew G. Knepley     PetscInt numPoints = 0, level = 0;
1711552f7358SJed Brown 
171274ef644bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr);
171374ef644bSMatthew G. Knepley     if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);}
171474ef644bSMatthew G. Knepley     while (numPoints) {
171574ef644bSMatthew G. Knepley       const PetscInt *points;
171674ef644bSMatthew G. Knepley       const PetscInt  newLevel = level+1;
171774ef644bSMatthew G. Knepley 
171874ef644bSMatthew G. Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
171974ef644bSMatthew G. Knepley       for (p = 0; p < numPoints; ++p) {
172074ef644bSMatthew G. Knepley         const PetscInt  point = points[p];
172174ef644bSMatthew G. Knepley         const PetscInt *support;
172274ef644bSMatthew G. Knepley         PetscInt        supportSize, s;
172374ef644bSMatthew G. Knepley 
172474ef644bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
172574ef644bSMatthew G. Knepley         ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
172674ef644bSMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
172774ef644bSMatthew G. Knepley           ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr);
1728552f7358SJed Brown         }
1729552f7358SJed Brown       }
17305edfc765SMatthew G. Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
173174ef644bSMatthew G. Knepley       ++level;
173274ef644bSMatthew G. Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
173374ef644bSMatthew G. Knepley       ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr);
173474ef644bSMatthew G. Knepley       if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);}
173574ef644bSMatthew G. Knepley       else         {numPoints = 0;}
173674ef644bSMatthew G. Knepley     }
173774ef644bSMatthew G. Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
173874ef644bSMatthew G. Knepley   }
1739552f7358SJed Brown   ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr);
1740552f7358SJed Brown   PetscFunctionReturn(0);
1741552f7358SJed Brown }
1742552f7358SJed Brown 
1743552f7358SJed Brown #undef __FUNCT__
1744552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin"
1745552f7358SJed Brown /*@C
1746552f7358SJed Brown   DMPlexGetJoin - Get an array for the join of the set of points
1747552f7358SJed Brown 
1748552f7358SJed Brown   Not Collective
1749552f7358SJed Brown 
1750552f7358SJed Brown   Input Parameters:
1751552f7358SJed Brown + dm - The DMPlex object
1752552f7358SJed Brown . numPoints - The number of input points for the join
1753552f7358SJed Brown - points - The input points
1754552f7358SJed Brown 
1755552f7358SJed Brown   Output Parameters:
1756552f7358SJed Brown + numCoveredPoints - The number of points in the join
1757552f7358SJed Brown - coveredPoints - The points in the join
1758552f7358SJed Brown 
1759552f7358SJed Brown   Level: intermediate
1760552f7358SJed Brown 
1761552f7358SJed Brown   Note: Currently, this is restricted to a single level join
1762552f7358SJed Brown 
17633813dfbdSMatthew G Knepley   Fortran Notes:
17643813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
17653813dfbdSMatthew G Knepley   include petsc.h90 in your code.
17663813dfbdSMatthew G Knepley 
17673813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
17683813dfbdSMatthew G Knepley 
1769552f7358SJed Brown .keywords: mesh
1770552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet()
1771552f7358SJed Brown @*/
1772552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1773552f7358SJed Brown {
1774552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1775552f7358SJed Brown   PetscInt      *join[2];
1776552f7358SJed Brown   PetscInt       joinSize, i = 0;
1777552f7358SJed Brown   PetscInt       dof, off, p, c, m;
1778552f7358SJed Brown   PetscErrorCode ierr;
1779552f7358SJed Brown 
1780552f7358SJed Brown   PetscFunctionBegin;
1781552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1782552f7358SJed Brown   PetscValidPointer(points, 2);
1783552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1784552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1785552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr);
1786552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr);
1787552f7358SJed Brown   /* Copy in support of first point */
1788552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr);
1789552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr);
1790552f7358SJed Brown   for (joinSize = 0; joinSize < dof; ++joinSize) {
1791552f7358SJed Brown     join[i][joinSize] = mesh->supports[off+joinSize];
1792552f7358SJed Brown   }
1793552f7358SJed Brown   /* Check each successive support */
1794552f7358SJed Brown   for (p = 1; p < numPoints; ++p) {
1795552f7358SJed Brown     PetscInt newJoinSize = 0;
1796552f7358SJed Brown 
1797552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr);
1798552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr);
1799552f7358SJed Brown     for (c = 0; c < dof; ++c) {
1800552f7358SJed Brown       const PetscInt point = mesh->supports[off+c];
1801552f7358SJed Brown 
1802552f7358SJed Brown       for (m = 0; m < joinSize; ++m) {
1803552f7358SJed Brown         if (point == join[i][m]) {
1804552f7358SJed Brown           join[1-i][newJoinSize++] = point;
1805552f7358SJed Brown           break;
1806552f7358SJed Brown         }
1807552f7358SJed Brown       }
1808552f7358SJed Brown     }
1809552f7358SJed Brown     joinSize = newJoinSize;
1810552f7358SJed Brown     i        = 1-i;
1811552f7358SJed Brown   }
1812552f7358SJed Brown   *numCoveredPoints = joinSize;
1813552f7358SJed Brown   *coveredPoints    = join[i];
1814552f7358SJed Brown   ierr              = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr);
1815552f7358SJed Brown   PetscFunctionReturn(0);
1816552f7358SJed Brown }
1817552f7358SJed Brown 
1818552f7358SJed Brown #undef __FUNCT__
1819552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin"
1820552f7358SJed Brown /*@C
1821552f7358SJed Brown   DMPlexRestoreJoin - Restore an array for the join of the set of points
1822552f7358SJed Brown 
1823552f7358SJed Brown   Not Collective
1824552f7358SJed Brown 
1825552f7358SJed Brown   Input Parameters:
1826552f7358SJed Brown + dm - The DMPlex object
1827552f7358SJed Brown . numPoints - The number of input points for the join
1828552f7358SJed Brown - points - The input points
1829552f7358SJed Brown 
1830552f7358SJed Brown   Output Parameters:
1831552f7358SJed Brown + numCoveredPoints - The number of points in the join
1832552f7358SJed Brown - coveredPoints - The points in the join
1833552f7358SJed Brown 
18343813dfbdSMatthew G Knepley   Fortran Notes:
18353813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
18363813dfbdSMatthew G Knepley   include petsc.h90 in your code.
18373813dfbdSMatthew G Knepley 
18383813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
18393813dfbdSMatthew G Knepley 
1840552f7358SJed Brown   Level: intermediate
1841552f7358SJed Brown 
1842552f7358SJed Brown .keywords: mesh
1843552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet()
1844552f7358SJed Brown @*/
1845552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1846552f7358SJed Brown {
1847552f7358SJed Brown   PetscErrorCode ierr;
1848552f7358SJed Brown 
1849552f7358SJed Brown   PetscFunctionBegin;
1850552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1851d7902bd2SMatthew G. Knepley   if (points) PetscValidIntPointer(points,3);
1852d7902bd2SMatthew G. Knepley   if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4);
1853d7902bd2SMatthew G. Knepley   PetscValidPointer(coveredPoints, 5);
1854552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr);
1855d7902bd2SMatthew G. Knepley   if (numCoveredPoints) *numCoveredPoints = 0;
1856552f7358SJed Brown   PetscFunctionReturn(0);
1857552f7358SJed Brown }
1858552f7358SJed Brown 
1859552f7358SJed Brown #undef __FUNCT__
1860552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin"
1861552f7358SJed Brown /*@C
1862552f7358SJed Brown   DMPlexGetFullJoin - Get an array for the join of the set of points
1863552f7358SJed Brown 
1864552f7358SJed Brown   Not Collective
1865552f7358SJed Brown 
1866552f7358SJed Brown   Input Parameters:
1867552f7358SJed Brown + dm - The DMPlex object
1868552f7358SJed Brown . numPoints - The number of input points for the join
1869552f7358SJed Brown - points - The input points
1870552f7358SJed Brown 
1871552f7358SJed Brown   Output Parameters:
1872552f7358SJed Brown + numCoveredPoints - The number of points in the join
1873552f7358SJed Brown - coveredPoints - The points in the join
1874552f7358SJed Brown 
18753813dfbdSMatthew G Knepley   Fortran Notes:
18763813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
18773813dfbdSMatthew G Knepley   include petsc.h90 in your code.
18783813dfbdSMatthew G Knepley 
18793813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
18803813dfbdSMatthew G Knepley 
1881552f7358SJed Brown   Level: intermediate
1882552f7358SJed Brown 
1883552f7358SJed Brown .keywords: mesh
1884552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet()
1885552f7358SJed Brown @*/
1886552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1887552f7358SJed Brown {
1888552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1889552f7358SJed Brown   PetscInt      *offsets, **closures;
1890552f7358SJed Brown   PetscInt      *join[2];
1891552f7358SJed Brown   PetscInt       depth = 0, maxSize, joinSize = 0, i = 0;
189224c766afSToby Isaac   PetscInt       p, d, c, m, ms;
1893552f7358SJed Brown   PetscErrorCode ierr;
1894552f7358SJed Brown 
1895552f7358SJed Brown   PetscFunctionBegin;
1896552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1897552f7358SJed Brown   PetscValidPointer(points, 2);
1898552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1899552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1900552f7358SJed Brown 
1901552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
19021795a4d1SJed Brown   ierr    = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr);
1903552f7358SJed Brown   ierr    = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr);
190424c766afSToby Isaac   ms      = mesh->maxSupportSize;
190524c766afSToby Isaac   maxSize = (ms > 1) ? ((PetscPowInt(ms,depth+1)-1)/(ms-1)) : depth + 1;
1906552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr);
1907552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr);
1908552f7358SJed Brown 
1909552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
1910552f7358SJed Brown     PetscInt closureSize;
1911552f7358SJed Brown 
1912552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr);
19130d644c17SKarl Rupp 
1914552f7358SJed Brown     offsets[p*(depth+2)+0] = 0;
1915552f7358SJed Brown     for (d = 0; d < depth+1; ++d) {
1916552f7358SJed Brown       PetscInt pStart, pEnd, i;
1917552f7358SJed Brown 
1918552f7358SJed Brown       ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
1919552f7358SJed Brown       for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) {
1920552f7358SJed Brown         if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) {
1921552f7358SJed Brown           offsets[p*(depth+2)+d+1] = i;
1922552f7358SJed Brown           break;
1923552f7358SJed Brown         }
1924552f7358SJed Brown       }
1925552f7358SJed Brown       if (i == closureSize) offsets[p*(depth+2)+d+1] = i;
1926552f7358SJed Brown     }
192782f516ccSBarry Smith     if (offsets[p*(depth+2)+depth+1] != closureSize) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Total size of closure %D should be %D", offsets[p*(depth+2)+depth+1], closureSize);
1928552f7358SJed Brown   }
1929552f7358SJed Brown   for (d = 0; d < depth+1; ++d) {
1930552f7358SJed Brown     PetscInt dof;
1931552f7358SJed Brown 
1932552f7358SJed Brown     /* Copy in support of first point */
1933552f7358SJed Brown     dof = offsets[d+1] - offsets[d];
1934552f7358SJed Brown     for (joinSize = 0; joinSize < dof; ++joinSize) {
1935552f7358SJed Brown       join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2];
1936552f7358SJed Brown     }
1937552f7358SJed Brown     /* Check each successive cone */
1938552f7358SJed Brown     for (p = 1; p < numPoints && joinSize; ++p) {
1939552f7358SJed Brown       PetscInt newJoinSize = 0;
1940552f7358SJed Brown 
1941552f7358SJed Brown       dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d];
1942552f7358SJed Brown       for (c = 0; c < dof; ++c) {
1943552f7358SJed Brown         const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2];
1944552f7358SJed Brown 
1945552f7358SJed Brown         for (m = 0; m < joinSize; ++m) {
1946552f7358SJed Brown           if (point == join[i][m]) {
1947552f7358SJed Brown             join[1-i][newJoinSize++] = point;
1948552f7358SJed Brown             break;
1949552f7358SJed Brown           }
1950552f7358SJed Brown         }
1951552f7358SJed Brown       }
1952552f7358SJed Brown       joinSize = newJoinSize;
1953552f7358SJed Brown       i        = 1-i;
1954552f7358SJed Brown     }
1955552f7358SJed Brown     if (joinSize) break;
1956552f7358SJed Brown   }
1957552f7358SJed Brown   *numCoveredPoints = joinSize;
1958552f7358SJed Brown   *coveredPoints    = join[i];
1959552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
19600298fd71SBarry Smith     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr);
1961552f7358SJed Brown   }
1962552f7358SJed Brown   ierr = PetscFree(closures);CHKERRQ(ierr);
1963552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr);
1964552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr);
1965552f7358SJed Brown   PetscFunctionReturn(0);
1966552f7358SJed Brown }
1967552f7358SJed Brown 
1968552f7358SJed Brown #undef __FUNCT__
1969552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet"
1970552f7358SJed Brown /*@C
1971552f7358SJed Brown   DMPlexGetMeet - Get an array for the meet of the set of points
1972552f7358SJed Brown 
1973552f7358SJed Brown   Not Collective
1974552f7358SJed Brown 
1975552f7358SJed Brown   Input Parameters:
1976552f7358SJed Brown + dm - The DMPlex object
1977552f7358SJed Brown . numPoints - The number of input points for the meet
1978552f7358SJed Brown - points - The input points
1979552f7358SJed Brown 
1980552f7358SJed Brown   Output Parameters:
1981552f7358SJed Brown + numCoveredPoints - The number of points in the meet
1982552f7358SJed Brown - coveredPoints - The points in the meet
1983552f7358SJed Brown 
1984552f7358SJed Brown   Level: intermediate
1985552f7358SJed Brown 
1986552f7358SJed Brown   Note: Currently, this is restricted to a single level meet
1987552f7358SJed Brown 
19883813dfbdSMatthew G Knepley   Fortran Notes:
19893813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
19903813dfbdSMatthew G Knepley   include petsc.h90 in your code.
19913813dfbdSMatthew G Knepley 
19923813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
19933813dfbdSMatthew G Knepley 
1994552f7358SJed Brown .keywords: mesh
1995552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin()
1996552f7358SJed Brown @*/
1997552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints)
1998552f7358SJed Brown {
1999552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
2000552f7358SJed Brown   PetscInt      *meet[2];
2001552f7358SJed Brown   PetscInt       meetSize, i = 0;
2002552f7358SJed Brown   PetscInt       dof, off, p, c, m;
2003552f7358SJed Brown   PetscErrorCode ierr;
2004552f7358SJed Brown 
2005552f7358SJed Brown   PetscFunctionBegin;
2006552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2007552f7358SJed Brown   PetscValidPointer(points, 2);
2008552f7358SJed Brown   PetscValidPointer(numCoveringPoints, 3);
2009552f7358SJed Brown   PetscValidPointer(coveringPoints, 4);
2010552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr);
2011552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr);
2012552f7358SJed Brown   /* Copy in cone of first point */
2013552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr);
2014552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr);
2015552f7358SJed Brown   for (meetSize = 0; meetSize < dof; ++meetSize) {
2016552f7358SJed Brown     meet[i][meetSize] = mesh->cones[off+meetSize];
2017552f7358SJed Brown   }
2018552f7358SJed Brown   /* Check each successive cone */
2019552f7358SJed Brown   for (p = 1; p < numPoints; ++p) {
2020552f7358SJed Brown     PetscInt newMeetSize = 0;
2021552f7358SJed Brown 
2022552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr);
2023552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr);
2024552f7358SJed Brown     for (c = 0; c < dof; ++c) {
2025552f7358SJed Brown       const PetscInt point = mesh->cones[off+c];
2026552f7358SJed Brown 
2027552f7358SJed Brown       for (m = 0; m < meetSize; ++m) {
2028552f7358SJed Brown         if (point == meet[i][m]) {
2029552f7358SJed Brown           meet[1-i][newMeetSize++] = point;
2030552f7358SJed Brown           break;
2031552f7358SJed Brown         }
2032552f7358SJed Brown       }
2033552f7358SJed Brown     }
2034552f7358SJed Brown     meetSize = newMeetSize;
2035552f7358SJed Brown     i        = 1-i;
2036552f7358SJed Brown   }
2037552f7358SJed Brown   *numCoveringPoints = meetSize;
2038552f7358SJed Brown   *coveringPoints    = meet[i];
2039552f7358SJed Brown   ierr               = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr);
2040552f7358SJed Brown   PetscFunctionReturn(0);
2041552f7358SJed Brown }
2042552f7358SJed Brown 
2043552f7358SJed Brown #undef __FUNCT__
2044552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet"
2045552f7358SJed Brown /*@C
2046552f7358SJed Brown   DMPlexRestoreMeet - Restore an array for the meet of the set of points
2047552f7358SJed Brown 
2048552f7358SJed Brown   Not Collective
2049552f7358SJed Brown 
2050552f7358SJed Brown   Input Parameters:
2051552f7358SJed Brown + dm - The DMPlex object
2052552f7358SJed Brown . numPoints - The number of input points for the meet
2053552f7358SJed Brown - points - The input points
2054552f7358SJed Brown 
2055552f7358SJed Brown   Output Parameters:
2056552f7358SJed Brown + numCoveredPoints - The number of points in the meet
2057552f7358SJed Brown - coveredPoints - The points in the meet
2058552f7358SJed Brown 
2059552f7358SJed Brown   Level: intermediate
2060552f7358SJed Brown 
20613813dfbdSMatthew G Knepley   Fortran Notes:
20623813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
20633813dfbdSMatthew G Knepley   include petsc.h90 in your code.
20643813dfbdSMatthew G Knepley 
20653813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
20663813dfbdSMatthew G Knepley 
2067552f7358SJed Brown .keywords: mesh
2068552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin()
2069552f7358SJed Brown @*/
2070552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
2071552f7358SJed Brown {
2072552f7358SJed Brown   PetscErrorCode ierr;
2073552f7358SJed Brown 
2074552f7358SJed Brown   PetscFunctionBegin;
2075552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2076d7902bd2SMatthew G. Knepley   if (points) PetscValidIntPointer(points,3);
2077d7902bd2SMatthew G. Knepley   if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4);
2078d7902bd2SMatthew G. Knepley   PetscValidPointer(coveredPoints,5);
2079552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr);
2080d7902bd2SMatthew G. Knepley   if (numCoveredPoints) *numCoveredPoints = 0;
2081552f7358SJed Brown   PetscFunctionReturn(0);
2082552f7358SJed Brown }
2083552f7358SJed Brown 
2084552f7358SJed Brown #undef __FUNCT__
2085552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet"
2086552f7358SJed Brown /*@C
2087552f7358SJed Brown   DMPlexGetFullMeet - Get an array for the meet of the set of points
2088552f7358SJed Brown 
2089552f7358SJed Brown   Not Collective
2090552f7358SJed Brown 
2091552f7358SJed Brown   Input Parameters:
2092552f7358SJed Brown + dm - The DMPlex object
2093552f7358SJed Brown . numPoints - The number of input points for the meet
2094552f7358SJed Brown - points - The input points
2095552f7358SJed Brown 
2096552f7358SJed Brown   Output Parameters:
2097552f7358SJed Brown + numCoveredPoints - The number of points in the meet
2098552f7358SJed Brown - coveredPoints - The points in the meet
2099552f7358SJed Brown 
2100552f7358SJed Brown   Level: intermediate
2101552f7358SJed Brown 
21023813dfbdSMatthew G Knepley   Fortran Notes:
21033813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
21043813dfbdSMatthew G Knepley   include petsc.h90 in your code.
21053813dfbdSMatthew G Knepley 
21063813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
21073813dfbdSMatthew G Knepley 
2108552f7358SJed Brown .keywords: mesh
2109552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin()
2110552f7358SJed Brown @*/
2111552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
2112552f7358SJed Brown {
2113552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
2114552f7358SJed Brown   PetscInt      *offsets, **closures;
2115552f7358SJed Brown   PetscInt      *meet[2];
2116552f7358SJed Brown   PetscInt       height = 0, maxSize, meetSize = 0, i = 0;
211724c766afSToby Isaac   PetscInt       p, h, c, m, mc;
2118552f7358SJed Brown   PetscErrorCode ierr;
2119552f7358SJed Brown 
2120552f7358SJed Brown   PetscFunctionBegin;
2121552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2122552f7358SJed Brown   PetscValidPointer(points, 2);
2123552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
2124552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
2125552f7358SJed Brown 
2126552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &height);CHKERRQ(ierr);
2127785e854fSJed Brown   ierr    = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr);
2128552f7358SJed Brown   ierr    = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr);
212924c766afSToby Isaac   mc      = mesh->maxConeSize;
213024c766afSToby Isaac   maxSize = (mc > 1) ? ((PetscPowInt(mc,height+1)-1)/(mc-1)) : height + 1;
2131552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr);
2132552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr);
2133552f7358SJed Brown 
2134552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
2135552f7358SJed Brown     PetscInt closureSize;
2136552f7358SJed Brown 
2137552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr);
21380d644c17SKarl Rupp 
2139552f7358SJed Brown     offsets[p*(height+2)+0] = 0;
2140552f7358SJed Brown     for (h = 0; h < height+1; ++h) {
2141552f7358SJed Brown       PetscInt pStart, pEnd, i;
2142552f7358SJed Brown 
2143552f7358SJed Brown       ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr);
2144552f7358SJed Brown       for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) {
2145552f7358SJed Brown         if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) {
2146552f7358SJed Brown           offsets[p*(height+2)+h+1] = i;
2147552f7358SJed Brown           break;
2148552f7358SJed Brown         }
2149552f7358SJed Brown       }
2150552f7358SJed Brown       if (i == closureSize) offsets[p*(height+2)+h+1] = i;
2151552f7358SJed Brown     }
215282f516ccSBarry Smith     if (offsets[p*(height+2)+height+1] != closureSize) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Total size of closure %D should be %D", offsets[p*(height+2)+height+1], closureSize);
2153552f7358SJed Brown   }
2154552f7358SJed Brown   for (h = 0; h < height+1; ++h) {
2155552f7358SJed Brown     PetscInt dof;
2156552f7358SJed Brown 
2157552f7358SJed Brown     /* Copy in cone of first point */
2158552f7358SJed Brown     dof = offsets[h+1] - offsets[h];
2159552f7358SJed Brown     for (meetSize = 0; meetSize < dof; ++meetSize) {
2160552f7358SJed Brown       meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2];
2161552f7358SJed Brown     }
2162552f7358SJed Brown     /* Check each successive cone */
2163552f7358SJed Brown     for (p = 1; p < numPoints && meetSize; ++p) {
2164552f7358SJed Brown       PetscInt newMeetSize = 0;
2165552f7358SJed Brown 
2166552f7358SJed Brown       dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h];
2167552f7358SJed Brown       for (c = 0; c < dof; ++c) {
2168552f7358SJed Brown         const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2];
2169552f7358SJed Brown 
2170552f7358SJed Brown         for (m = 0; m < meetSize; ++m) {
2171552f7358SJed Brown           if (point == meet[i][m]) {
2172552f7358SJed Brown             meet[1-i][newMeetSize++] = point;
2173552f7358SJed Brown             break;
2174552f7358SJed Brown           }
2175552f7358SJed Brown         }
2176552f7358SJed Brown       }
2177552f7358SJed Brown       meetSize = newMeetSize;
2178552f7358SJed Brown       i        = 1-i;
2179552f7358SJed Brown     }
2180552f7358SJed Brown     if (meetSize) break;
2181552f7358SJed Brown   }
2182552f7358SJed Brown   *numCoveredPoints = meetSize;
2183552f7358SJed Brown   *coveredPoints    = meet[i];
2184552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
21850298fd71SBarry Smith     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr);
2186552f7358SJed Brown   }
2187552f7358SJed Brown   ierr = PetscFree(closures);CHKERRQ(ierr);
2188552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr);
2189552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr);
2190552f7358SJed Brown   PetscFunctionReturn(0);
2191552f7358SJed Brown }
2192552f7358SJed Brown 
2193552f7358SJed Brown #undef __FUNCT__
21944e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual"
21954e3744c5SMatthew G. Knepley /*@C
21964e3744c5SMatthew G. Knepley   DMPlexEqual - Determine if two DMs have the same topology
21974e3744c5SMatthew G. Knepley 
21984e3744c5SMatthew G. Knepley   Not Collective
21994e3744c5SMatthew G. Knepley 
22004e3744c5SMatthew G. Knepley   Input Parameters:
22014e3744c5SMatthew G. Knepley + dmA - A DMPlex object
22024e3744c5SMatthew G. Knepley - dmB - A DMPlex object
22034e3744c5SMatthew G. Knepley 
22044e3744c5SMatthew G. Knepley   Output Parameters:
22054e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical
22064e3744c5SMatthew G. Knepley 
22074e3744c5SMatthew G. Knepley   Level: intermediate
22084e3744c5SMatthew G. Knepley 
22094e3744c5SMatthew G. Knepley   Notes:
22104e3744c5SMatthew G. Knepley   We are not solving graph isomorphism, so we do not permutation.
22114e3744c5SMatthew G. Knepley 
22124e3744c5SMatthew G. Knepley .keywords: mesh
22134e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone()
22144e3744c5SMatthew G. Knepley @*/
22154e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal)
22164e3744c5SMatthew G. Knepley {
22174e3744c5SMatthew G. Knepley   PetscInt       depth, depthB, pStart, pEnd, pStartB, pEndB, p;
22184e3744c5SMatthew G. Knepley   PetscErrorCode ierr;
22194e3744c5SMatthew G. Knepley 
22204e3744c5SMatthew G. Knepley   PetscFunctionBegin;
22214e3744c5SMatthew G. Knepley   PetscValidHeaderSpecific(dmA, DM_CLASSID, 1);
22224e3744c5SMatthew G. Knepley   PetscValidHeaderSpecific(dmB, DM_CLASSID, 2);
22234e3744c5SMatthew G. Knepley   PetscValidPointer(equal, 3);
22244e3744c5SMatthew G. Knepley 
22254e3744c5SMatthew G. Knepley   *equal = PETSC_FALSE;
22264e3744c5SMatthew G. Knepley   ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr);
22274e3744c5SMatthew G. Knepley   ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr);
22284e3744c5SMatthew G. Knepley   if (depth != depthB) PetscFunctionReturn(0);
22294e3744c5SMatthew G. Knepley   ierr = DMPlexGetChart(dmA, &pStart,  &pEnd);CHKERRQ(ierr);
22304e3744c5SMatthew G. Knepley   ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr);
22314e3744c5SMatthew G. Knepley   if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0);
22324e3744c5SMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {
22334e3744c5SMatthew G. Knepley     const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB;
22344e3744c5SMatthew G. Knepley     PetscInt        coneSize, coneSizeB, c, supportSize, supportSizeB, s;
22354e3744c5SMatthew G. Knepley 
22364e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr);
22374e3744c5SMatthew G. Knepley     ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr);
22384e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr);
22394e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr);
22404e3744c5SMatthew G. Knepley     ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr);
22414e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr);
22424e3744c5SMatthew G. Knepley     if (coneSize != coneSizeB) PetscFunctionReturn(0);
22434e3744c5SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
22444e3744c5SMatthew G. Knepley       if (cone[c] != coneB[c]) PetscFunctionReturn(0);
22454e3744c5SMatthew G. Knepley       if (ornt[c] != orntB[c]) PetscFunctionReturn(0);
22464e3744c5SMatthew G. Knepley     }
22474e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr);
22484e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr);
22494e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr);
22504e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr);
22514e3744c5SMatthew G. Knepley     if (supportSize != supportSizeB) PetscFunctionReturn(0);
22524e3744c5SMatthew G. Knepley     for (s = 0; s < supportSize; ++s) {
22534e3744c5SMatthew G. Knepley       if (support[s] != supportB[s]) PetscFunctionReturn(0);
22544e3744c5SMatthew G. Knepley     }
22554e3744c5SMatthew G. Knepley   }
22564e3744c5SMatthew G. Knepley   *equal = PETSC_TRUE;
22574e3744c5SMatthew G. Knepley   PetscFunctionReturn(0);
22584e3744c5SMatthew G. Knepley }
22594e3744c5SMatthew G. Knepley 
22604e3744c5SMatthew G. Knepley #undef __FUNCT__
226118ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices"
226218ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices)
2263a6dfd86eSKarl Rupp {
226482f516ccSBarry Smith   MPI_Comm       comm;
2265552f7358SJed Brown   PetscErrorCode ierr;
2266552f7358SJed Brown 
2267552f7358SJed Brown   PetscFunctionBegin;
226882f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2269552f7358SJed Brown   PetscValidPointer(numFaceVertices,3);
2270552f7358SJed Brown   switch (cellDim) {
2271552f7358SJed Brown   case 0:
2272552f7358SJed Brown     *numFaceVertices = 0;
2273552f7358SJed Brown     break;
2274552f7358SJed Brown   case 1:
2275552f7358SJed Brown     *numFaceVertices = 1;
2276552f7358SJed Brown     break;
2277552f7358SJed Brown   case 2:
2278552f7358SJed Brown     switch (numCorners) {
227919436ca2SJed Brown     case 3: /* triangle */
228019436ca2SJed Brown       *numFaceVertices = 2; /* Edge has 2 vertices */
2281552f7358SJed Brown       break;
228219436ca2SJed Brown     case 4: /* quadrilateral */
228319436ca2SJed Brown       *numFaceVertices = 2; /* Edge has 2 vertices */
2284552f7358SJed Brown       break;
228519436ca2SJed Brown     case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */
228619436ca2SJed Brown       *numFaceVertices = 3; /* Edge has 3 vertices */
2287552f7358SJed Brown       break;
228819436ca2SJed Brown     case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */
228919436ca2SJed Brown       *numFaceVertices = 3; /* Edge has 3 vertices */
2290552f7358SJed Brown       break;
2291552f7358SJed Brown     default:
2292552f7358SJed Brown       SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim);
2293552f7358SJed Brown     }
2294552f7358SJed Brown     break;
2295552f7358SJed Brown   case 3:
2296552f7358SJed Brown     switch (numCorners) {
229719436ca2SJed Brown     case 4: /* tetradehdron */
229819436ca2SJed Brown       *numFaceVertices = 3; /* Face has 3 vertices */
2299552f7358SJed Brown       break;
230019436ca2SJed Brown     case 6: /* tet cohesive cells */
230119436ca2SJed Brown       *numFaceVertices = 4; /* Face has 4 vertices */
2302552f7358SJed Brown       break;
230319436ca2SJed Brown     case 8: /* hexahedron */
230419436ca2SJed Brown       *numFaceVertices = 4; /* Face has 4 vertices */
2305552f7358SJed Brown       break;
230619436ca2SJed Brown     case 9: /* tet cohesive Lagrange cells */
230719436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2308552f7358SJed Brown       break;
230919436ca2SJed Brown     case 10: /* quadratic tetrahedron */
231019436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2311552f7358SJed Brown       break;
231219436ca2SJed Brown     case 12: /* hex cohesive Lagrange cells */
231319436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2314552f7358SJed Brown       break;
231519436ca2SJed Brown     case 18: /* quadratic tet cohesive Lagrange cells */
231619436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2317552f7358SJed Brown       break;
231819436ca2SJed Brown     case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */
231919436ca2SJed Brown       *numFaceVertices = 9; /* Face has 9 vertices */
2320552f7358SJed Brown       break;
2321552f7358SJed Brown     default:
2322552f7358SJed Brown       SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim);
2323552f7358SJed Brown     }
2324552f7358SJed Brown     break;
2325552f7358SJed Brown   default:
2326552f7358SJed Brown     SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim);
2327552f7358SJed Brown   }
2328552f7358SJed Brown   PetscFunctionReturn(0);
2329552f7358SJed Brown }
2330552f7358SJed Brown 
2331552f7358SJed Brown #undef __FUNCT__
2332d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient"
2333d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */
2334d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm)
2335d27a0f52SMatthew G. Knepley {
2336a1b4d4a2SMatthew G. Knepley   PetscBT        seenCells, flippedCells, seenFaces;
2337a1b4d4a2SMatthew G. Knepley   PetscInt      *faceFIFO, fTop, fBottom;
2338a1b4d4a2SMatthew G. Knepley   PetscInt       dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO;
2339d27a0f52SMatthew G. Knepley   PetscErrorCode ierr;
2340d27a0f52SMatthew G. Knepley 
2341d27a0f52SMatthew G. Knepley   PetscFunctionBegin;
2342d27a0f52SMatthew G. Knepley   /* Truth Table
2343d27a0f52SMatthew G. Knepley      mismatch    flips   do action   mismatch   flipA ^ flipB   action
2344d27a0f52SMatthew G. Knepley          F       0 flips     no         F             F           F
2345d27a0f52SMatthew G. Knepley          F       1 flip      yes        F             T           T
2346d27a0f52SMatthew G. Knepley          F       2 flips     no         T             F           T
2347d27a0f52SMatthew G. Knepley          T       0 flips     yes        T             T           F
2348d27a0f52SMatthew G. Knepley          T       1 flip      no
2349d27a0f52SMatthew G. Knepley          T       2 flips     yes
2350d27a0f52SMatthew G. Knepley   */
2351c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2352d27a0f52SMatthew G. Knepley   ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr);
2353a1b4d4a2SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, h,   &cStart, &cEnd);CHKERRQ(ierr);
2354d27a0f52SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr);
2355a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr);
2356a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr);
2357a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr);
2358a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr);
2359a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr);
2360a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr);
2361785e854fSJed Brown   ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr);
2362a1b4d4a2SMatthew G. Knepley   fTop = fBottom = 0;
2363a1b4d4a2SMatthew G. Knepley   /* Initialize FIFO with first cell */
2364defeeaeaSMatthew G. Knepley   if (cEnd > cStart) {
2365a1b4d4a2SMatthew G. Knepley     const PetscInt *cone;
2366a1b4d4a2SMatthew G. Knepley     PetscInt        coneSize;
2367a1b4d4a2SMatthew G. Knepley 
2368a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr);
2369a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr);
2370a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
2371a1b4d4a2SMatthew G. Knepley       faceFIFO[fBottom++] = cone[c];
2372a1b4d4a2SMatthew G. Knepley       ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr);
2373a1b4d4a2SMatthew G. Knepley     }
2374a1b4d4a2SMatthew G. Knepley   }
2375a1b4d4a2SMatthew G. Knepley   /* Consider each face in FIFO */
2376a1b4d4a2SMatthew G. Knepley   while (fTop < fBottom) {
2377d27a0f52SMatthew G. Knepley     const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB;
2378a1b4d4a2SMatthew G. Knepley     PetscInt        supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1;
2379d27a0f52SMatthew G. Knepley     PetscInt        seenA, flippedA, seenB, flippedB, mismatch;
2380d27a0f52SMatthew G. Knepley 
2381a1b4d4a2SMatthew G. Knepley     face = faceFIFO[fTop++];
2382a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2383a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
2384d27a0f52SMatthew G. Knepley     if (supportSize < 2) continue;
2385d27a0f52SMatthew G. Knepley     if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize);
2386a1b4d4a2SMatthew G. Knepley     seenA    = PetscBTLookup(seenCells,    support[0]-cStart);
238786cff514SMatthew G. Knepley     flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0;
2388a1b4d4a2SMatthew G. Knepley     seenB    = PetscBTLookup(seenCells,    support[1]-cStart);
238986cff514SMatthew G. Knepley     flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0;
2390d27a0f52SMatthew G. Knepley 
2391d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr);
2392d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr);
2393d27a0f52SMatthew G. Knepley     ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr);
2394d27a0f52SMatthew G. Knepley     ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr);
2395d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr);
2396d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr);
2397a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSizeA; ++c) {
2398a1b4d4a2SMatthew G. Knepley       if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) {
2399a1b4d4a2SMatthew G. Knepley         faceFIFO[fBottom++] = coneA[c];
2400a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr);
2401a1b4d4a2SMatthew G. Knepley       }
2402a1b4d4a2SMatthew G. Knepley       if (coneA[c] == face) posA = c;
2403a1b4d4a2SMatthew G. Knepley       if (fBottom > fEnd-fStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Face %d was pushed exceeding capacity %d > %d", coneA[c], fBottom, fEnd-fStart);
2404a1b4d4a2SMatthew G. Knepley     }
2405a1b4d4a2SMatthew G. Knepley     if (posA < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d could not be located in cell %d", face, support[0]);
2406a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSizeB; ++c) {
2407a1b4d4a2SMatthew G. Knepley       if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) {
2408a1b4d4a2SMatthew G. Knepley         faceFIFO[fBottom++] = coneB[c];
2409a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr);
2410a1b4d4a2SMatthew G. Knepley       }
2411a1b4d4a2SMatthew G. Knepley       if (coneB[c] == face) posB = c;
2412a1b4d4a2SMatthew G. Knepley       if (fBottom > fEnd-fStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Face %d was pushed exceeding capacity %d > %d", coneA[c], fBottom, fEnd-fStart);
2413a1b4d4a2SMatthew G. Knepley     }
2414a1b4d4a2SMatthew G. Knepley     if (posB < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d could not be located in cell %d", face, support[1]);
2415d27a0f52SMatthew G. Knepley 
2416d27a0f52SMatthew G. Knepley     if (dim == 1) {
2417d27a0f52SMatthew G. Knepley       mismatch = posA == posB;
2418d27a0f52SMatthew G. Knepley     } else {
2419d27a0f52SMatthew G. Knepley       mismatch = coneOA[posA] == coneOB[posB];
2420d27a0f52SMatthew G. Knepley     }
2421d27a0f52SMatthew G. Knepley 
2422d27a0f52SMatthew G. Knepley     if (mismatch ^ (flippedA ^ flippedB)) {
2423d27a0f52SMatthew G. Knepley       if (seenA && seenB) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen cells %d and %d do not match: Fault mesh is non-orientable", support[0], support[1]);
2424d27a0f52SMatthew G. Knepley       if (!seenA && !flippedA) {
2425a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr);
2426d27a0f52SMatthew G. Knepley       } else if (!seenB && !flippedB) {
2427a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr);
2428d27a0f52SMatthew G. Knepley       } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable");
242986cff514SMatthew G. Knepley     } else if (mismatch && flippedA && flippedB) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Attempt to flip already flipped cell: Fault mesh is non-orientable");
2430a1b4d4a2SMatthew G. Knepley     ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr);
2431a1b4d4a2SMatthew G. Knepley     ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr);
2432d27a0f52SMatthew G. Knepley   }
2433fedde076SMatthew G. Knepley   /* Now all subdomains are oriented, but we need a consistent parallel orientation */
2434fedde076SMatthew G. Knepley   {
2435fedde076SMatthew G. Knepley     /* Find a representative face (edge) separating pairs of procs */
2436fedde076SMatthew G. Knepley     PetscSF            sf;
2437fedde076SMatthew G. Knepley     const PetscInt    *lpoints;
2438fedde076SMatthew G. Knepley     const PetscSFNode *rpoints;
243913048561SMatthew G. Knepley     PetscInt          *neighbors, *nranks;
2440fedde076SMatthew G. Knepley     PetscInt           numLeaves, numRoots, numNeighbors = 0, l, n;
2441a1b4d4a2SMatthew G. Knepley 
2442fedde076SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr);
2443fedde076SMatthew G. Knepley     ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr);
2444fedde076SMatthew G. Knepley     if (numLeaves >= 0) {
244562ad4a6aSMatthew G. Knepley       const PetscInt *cone, *ornt, *support;
244662ad4a6aSMatthew G. Knepley       PetscInt        coneSize, supportSize;
244762ad4a6aSMatthew G. Knepley       int            *rornt, *lornt; /* PetscSF cannot handle smaller than int */
244813048561SMatthew G. Knepley       PetscBool      *match, flipped = PETSC_FALSE;
244962ad4a6aSMatthew G. Knepley 
2450fedde076SMatthew G. Knepley       ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr);
2451fedde076SMatthew G. Knepley       /* I know this is p^2 time in general, but for bounded degree its alright */
2452fedde076SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
2453fedde076SMatthew G. Knepley         const PetscInt face = lpoints[l];
2454fedde076SMatthew G. Knepley         if ((face >= fStart) && (face < fEnd)) {
2455fedde076SMatthew G. Knepley           const PetscInt rank = rpoints[l].rank;
2456fedde076SMatthew G. Knepley           for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break;
2457fedde076SMatthew G. Knepley           if (n >= numNeighbors) {
2458fedde076SMatthew G. Knepley             PetscInt supportSize;
2459fedde076SMatthew G. Knepley             ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2460fedde076SMatthew G. Knepley             if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize);
2461fedde076SMatthew G. Knepley             neighbors[numNeighbors++] = l;
2462fedde076SMatthew G. Knepley           }
2463fedde076SMatthew G. Knepley         }
2464fedde076SMatthew G. Knepley       }
246513048561SMatthew G. Knepley       ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr);
2466fedde076SMatthew G. Knepley       for (face = fStart; face < fEnd; ++face) {
2467fedde076SMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2468fedde076SMatthew G. Knepley         if (supportSize != 1) continue;
2469fedde076SMatthew G. Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
2470fedde076SMatthew G. Knepley 
2471fedde076SMatthew G. Knepley         ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr);
247262ad4a6aSMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr);
2473fedde076SMatthew G. Knepley         ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr);
2474fedde076SMatthew G. Knepley         for (c = 0; c < coneSize; ++c) if (cone[c] == face) break;
24755b7033fcSMatthew G. Knepley         if (dim == 1) {
24765b7033fcSMatthew G. Knepley           /* Use cone position instead, shifted to -1 or 1 */
24775b7033fcSMatthew G. Knepley           rornt[face] = c*2-1;
24785b7033fcSMatthew G. Knepley         } else {
2479fedde076SMatthew G. Knepley           if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 :  1;
2480fedde076SMatthew G. Knepley           else                                                rornt[face] = ornt[c] < 0 ?  1 : -1;
2481fedde076SMatthew G. Knepley         }
24825b7033fcSMatthew G. Knepley       }
2483fedde076SMatthew G. Knepley       /* Mark each edge with match or nomatch */
2484fedde076SMatthew G. Knepley       ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr);
2485fedde076SMatthew G. Knepley       ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr);
2486fedde076SMatthew G. Knepley       for (n = 0; n < numNeighbors; ++n) {
2487fedde076SMatthew G. Knepley         const PetscInt face = lpoints[neighbors[n]];
2488fedde076SMatthew G. Knepley 
248913048561SMatthew G. Knepley         if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE;
249013048561SMatthew G. Knepley         else                             match[n] = PETSC_FALSE;
249113048561SMatthew G. Knepley         nranks[n] = rpoints[neighbors[n]].rank;
2492fedde076SMatthew G. Knepley       }
249313048561SMatthew G. Knepley       /* Collect the graph on 0 */
249413048561SMatthew G. Knepley       {
249513048561SMatthew G. Knepley         MPI_Comm     comm = PetscObjectComm((PetscObject) sf);
2496e8f90184SMatthew G. Knepley         Mat          G;
249713048561SMatthew G. Knepley         PetscBT      seenProcs, flippedProcs;
249813048561SMatthew G. Knepley         PetscInt    *procFIFO, pTop, pBottom;
249913048561SMatthew G. Knepley         PetscInt    *adj = NULL;
250013048561SMatthew G. Knepley         PetscBool   *val = NULL;
250113048561SMatthew G. Knepley         PetscMPIInt *recvcounts = NULL, *displs = NULL, p;
250213048561SMatthew G. Knepley         PetscMPIInt  N = numNeighbors, numProcs = 0, rank;
250313048561SMatthew G. Knepley         PetscInt     debug = 0;
250413048561SMatthew G. Knepley 
250513048561SMatthew G. Knepley         ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
250613048561SMatthew G. Knepley         if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);}
250713048561SMatthew G. Knepley         ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr);
250813048561SMatthew G. Knepley         ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr);
250913048561SMatthew G. Knepley         for (p = 0; p < numProcs; ++p) {
251013048561SMatthew G. Knepley           displs[p+1] = displs[p] + recvcounts[p];
251113048561SMatthew G. Knepley         }
251213048561SMatthew G. Knepley         if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);}
251313048561SMatthew G. Knepley         ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr);
251413048561SMatthew G. Knepley         ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr);
251513048561SMatthew G. Knepley         if (debug) {
251613048561SMatthew G. Knepley           for (p = 0; p < numProcs; ++p) {
251713048561SMatthew G. Knepley             ierr = PetscPrintf(comm, "Proc %d:\n", p);
251813048561SMatthew G. Knepley             for (n = 0; n < recvcounts[p]; ++n) {
251913048561SMatthew G. Knepley               ierr = PetscPrintf(comm, "  edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]);
252013048561SMatthew G. Knepley             }
252113048561SMatthew G. Knepley           }
252213048561SMatthew G. Knepley         }
2523e8f90184SMatthew G. Knepley         /* Symmetrize the graph */
2524e8f90184SMatthew G. Knepley         ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr);
2525e8f90184SMatthew G. Knepley         ierr = MatSetSizes(G, numProcs, numProcs, numProcs, numProcs);CHKERRQ(ierr);
2526e8f90184SMatthew G. Knepley         ierr = MatSetUp(G);CHKERRQ(ierr);
2527e8f90184SMatthew G. Knepley         for (p = 0; p < numProcs; ++p) {
2528e8f90184SMatthew G. Knepley           for (n = 0; n < recvcounts[p]; ++n) {
25299a4fe19dSMatthew G. Knepley             const PetscInt    r = p;
2530e8f90184SMatthew G. Knepley             const PetscInt    q = adj[displs[p]+n];
25317406edfbSMatthew G. Knepley             const PetscScalar o = val[displs[p]+n] ? 1.0 : 0.0;
2532e8f90184SMatthew G. Knepley 
25337406edfbSMatthew G. Knepley             ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr);
25347406edfbSMatthew G. Knepley             ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr);
2535e8f90184SMatthew G. Knepley           }
2536e8f90184SMatthew G. Knepley         }
2537e8f90184SMatthew G. Knepley         ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
2538e8f90184SMatthew G. Knepley         ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
2539e8f90184SMatthew G. Knepley 
254013048561SMatthew G. Knepley         ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr);
254113048561SMatthew G. Knepley         ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr);
254213048561SMatthew G. Knepley         ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr);
254313048561SMatthew G. Knepley         ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr);
254413048561SMatthew G. Knepley         ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr);
254513048561SMatthew G. Knepley         pTop = pBottom = 0;
254613048561SMatthew G. Knepley         for (p = 0; p < numProcs; ++p) {
254713048561SMatthew G. Knepley           if (PetscBTLookup(seenProcs, p)) continue;
254813048561SMatthew G. Knepley           /* Initialize FIFO with next proc */
254913048561SMatthew G. Knepley           procFIFO[pBottom++] = p;
255013048561SMatthew G. Knepley           ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr);
255113048561SMatthew G. Knepley           /* Consider each proc in FIFO */
255213048561SMatthew G. Knepley           while (pTop < pBottom) {
2553e8f90184SMatthew G. Knepley             const PetscScalar *ornt;
2554e8f90184SMatthew G. Knepley             const PetscInt    *neighbors;
2555e8f90184SMatthew G. Knepley             PetscInt           proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors;
255613048561SMatthew G. Knepley 
255713048561SMatthew G. Knepley             proc     = procFIFO[pTop++];
255813048561SMatthew G. Knepley             flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0;
2559e8f90184SMatthew G. Knepley             ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr);
256013048561SMatthew G. Knepley             /* Loop over neighboring procs */
2561e8f90184SMatthew G. Knepley             for (n = 0; n < numNeighbors; ++n) {
2562e8f90184SMatthew G. Knepley               nproc    = neighbors[n];
25637406edfbSMatthew G. Knepley               mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1;
256413048561SMatthew G. Knepley               seen     = PetscBTLookup(seenProcs, nproc);
256513048561SMatthew G. Knepley               flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0;
256613048561SMatthew G. Knepley 
256713048561SMatthew G. Knepley               if (mismatch ^ (flippedA ^ flippedB)) {
256813048561SMatthew G. Knepley                 if (seen) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen procs %d and %d do not match: Fault mesh is non-orientable", proc, nproc);
256913048561SMatthew G. Knepley                 if (!flippedB) {
257013048561SMatthew G. Knepley                   ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr);
257113048561SMatthew G. Knepley               } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable");
257213048561SMatthew G. Knepley               } else if (mismatch && flippedA && flippedB) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Attempt to flip already flipped cell: Fault mesh is non-orientable");
257313048561SMatthew G. Knepley               if (!seen) {
257413048561SMatthew G. Knepley                 procFIFO[pBottom++] = nproc;
257513048561SMatthew G. Knepley                 ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr);
257613048561SMatthew G. Knepley               }
257713048561SMatthew G. Knepley             }
257813048561SMatthew G. Knepley           }
257913048561SMatthew G. Knepley         }
258013048561SMatthew G. Knepley         ierr = PetscFree(procFIFO);CHKERRQ(ierr);
2581e8f90184SMatthew G. Knepley         ierr = MatDestroy(&G);CHKERRQ(ierr);
258213048561SMatthew G. Knepley 
258313048561SMatthew G. Knepley         ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr);
258413048561SMatthew G. Knepley         ierr = PetscFree2(adj,val);CHKERRQ(ierr);
258513048561SMatthew G. Knepley         {
258613048561SMatthew G. Knepley           PetscBool *flips;
258713048561SMatthew G. Knepley 
258813048561SMatthew G. Knepley           ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr);
258913048561SMatthew G. Knepley           for (p = 0; p < numProcs; ++p) {
259013048561SMatthew G. Knepley             flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE;
259113048561SMatthew G. Knepley             if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);}
259213048561SMatthew G. Knepley           }
259313048561SMatthew G. Knepley           ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr);
259413048561SMatthew G. Knepley           ierr = PetscFree(flips);CHKERRQ(ierr);
259513048561SMatthew G. Knepley         }
259613048561SMatthew G. Knepley         ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr);
259713048561SMatthew G. Knepley         ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr);
259813048561SMatthew G. Knepley       }
259913048561SMatthew G. Knepley       ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr);
2600fedde076SMatthew G. Knepley       ierr = PetscFree(neighbors);CHKERRQ(ierr);
260113048561SMatthew G. Knepley       if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}}
2602fedde076SMatthew G. Knepley     }
2603fedde076SMatthew G. Knepley   }
2604fedde076SMatthew G. Knepley   /* Reverse flipped cells in the mesh */
2605d27a0f52SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2606d27a0f52SMatthew G. Knepley   ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr);
2607d27a0f52SMatthew G. Knepley   ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr);
2608a1b4d4a2SMatthew G. Knepley   for (c = cStart; c < cEnd; ++c) {
2609f4e909fcSMatthew G. Knepley     const PetscInt *cone, *coneO, *support;
2610f4e909fcSMatthew G. Knepley     PetscInt        coneSize, supportSize, faceSize, cp, sp;
2611d27a0f52SMatthew G. Knepley 
2612a1b4d4a2SMatthew G. Knepley     if (!PetscBTLookup(flippedCells, c-cStart)) continue;
2613a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
2614a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2615a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr);
2616a1b4d4a2SMatthew G. Knepley     for (cp = 0; cp < coneSize; ++cp) {
2617a1b4d4a2SMatthew G. Knepley       const PetscInt rcp = coneSize-cp-1;
2618a1b4d4a2SMatthew G. Knepley 
2619a1b4d4a2SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr);
2620a1b4d4a2SMatthew G. Knepley       revcone[cp]  = cone[rcp];
2621a1b4d4a2SMatthew G. Knepley       revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp];
2622d27a0f52SMatthew G. Knepley     }
2623a1b4d4a2SMatthew G. Knepley     ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr);
2624a1b4d4a2SMatthew G. Knepley     ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr);
2625f4e909fcSMatthew G. Knepley     /* Reverse orientations of support */
2626f4e909fcSMatthew G. Knepley     faceSize = coneSize;
2627f4e909fcSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr);
2628f4e909fcSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr);
2629f4e909fcSMatthew G. Knepley     for (sp = 0; sp < supportSize; ++sp) {
2630f4e909fcSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr);
2631f4e909fcSMatthew G. Knepley       ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr);
2632f4e909fcSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr);
2633f4e909fcSMatthew G. Knepley       for (cp = 0; cp < coneSize; ++cp) {
2634f4e909fcSMatthew G. Knepley         if (cone[cp] != c) continue;
2635f4e909fcSMatthew G. Knepley         ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr);
2636f4e909fcSMatthew G. Knepley       }
2637f4e909fcSMatthew G. Knepley     }
2638d27a0f52SMatthew G. Knepley   }
2639d27a0f52SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr);
2640d27a0f52SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr);
2641d27a0f52SMatthew G. Knepley   ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr);
2642a1b4d4a2SMatthew G. Knepley   ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr);
2643a1b4d4a2SMatthew G. Knepley   ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr);
2644a1b4d4a2SMatthew G. Knepley   ierr = PetscFree(faceFIFO);CHKERRQ(ierr);
2645d27a0f52SMatthew G. Knepley   PetscFunctionReturn(0);
2646d27a0f52SMatthew G. Knepley }
2647d27a0f52SMatthew G. Knepley 
2648d27a0f52SMatthew G. Knepley #undef __FUNCT__
2649d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal"
2650d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[])
2651d49fcaecSMatthew G. Knepley {
2652d49fcaecSMatthew G. Knepley   PetscInt d;
2653d49fcaecSMatthew G. Knepley 
2654d49fcaecSMatthew G. Knepley   PetscFunctionBegin;
2655d49fcaecSMatthew G. Knepley   if (!dm->maxCell) {
2656d49fcaecSMatthew G. Knepley     for (d = 0; d < dim; ++d) out[d] = in[d];
2657d49fcaecSMatthew G. Knepley   } else {
2658d49fcaecSMatthew G. Knepley     for (d = 0; d < dim; ++d) {
2659d49fcaecSMatthew G. Knepley       if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) {
2660858aadebSMatthew G. Knepley         out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d];
2661d49fcaecSMatthew G. Knepley       } else {
2662d49fcaecSMatthew G. Knepley         out[d] = in[d];
2663d49fcaecSMatthew G. Knepley       }
2664d49fcaecSMatthew G. Knepley     }
2665d49fcaecSMatthew G. Knepley   }
2666d49fcaecSMatthew G. Knepley   PetscFunctionReturn(0);
2667d49fcaecSMatthew G. Knepley }
2668d49fcaecSMatthew G. Knepley 
2669d49fcaecSMatthew G. Knepley #undef __FUNCT__
2670d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal"
2671d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[])
2672d49fcaecSMatthew G. Knepley {
2673d49fcaecSMatthew G. Knepley   PetscInt d;
2674d49fcaecSMatthew G. Knepley 
2675d49fcaecSMatthew G. Knepley   PetscFunctionBegin;
2676d49fcaecSMatthew G. Knepley   if (!dm->maxCell) {
2677d49fcaecSMatthew G. Knepley     for (d = 0; d < dim; ++d) out[d] += in[d];
2678d49fcaecSMatthew G. Knepley   } else {
2679d49fcaecSMatthew G. Knepley     for (d = 0; d < dim; ++d) {
2680d49fcaecSMatthew G. Knepley       if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) {
2681858aadebSMatthew G. Knepley         out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d];
2682d49fcaecSMatthew G. Knepley       } else {
2683d49fcaecSMatthew G. Knepley         out[d] += in[d];
2684d49fcaecSMatthew G. Knepley       }
2685d49fcaecSMatthew G. Knepley     }
2686d49fcaecSMatthew G. Knepley   }
2687d49fcaecSMatthew G. Knepley   PetscFunctionReturn(0);
2688d49fcaecSMatthew G. Knepley }
2689d49fcaecSMatthew G. Knepley 
2690d49fcaecSMatthew G. Knepley #undef __FUNCT__
2691d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates"
2692d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm)
2693d49fcaecSMatthew G. Knepley {
2694d49fcaecSMatthew G. Knepley   PetscSection   coordSection, cSection;
2695d49fcaecSMatthew G. Knepley   Vec            coordinates,  cVec;
2696d49fcaecSMatthew G. Knepley   PetscScalar   *coords, *coords2, *anchor;
26978c7f9fc6SMatthew G. Knepley   PetscInt       Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize;
2698d49fcaecSMatthew G. Knepley   PetscErrorCode ierr;
2699d49fcaecSMatthew G. Knepley 
2700d49fcaecSMatthew G. Knepley   PetscFunctionBegin;
2701d49fcaecSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2702d49fcaecSMatthew G. Knepley   if (!dm->maxCell) PetscFunctionReturn(0);
2703d49fcaecSMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
2704d49fcaecSMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
2705d49fcaecSMatthew G. Knepley   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
2706d49fcaecSMatthew G. Knepley   ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2707d49fcaecSMatthew G. Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr);
27088c7f9fc6SMatthew G. Knepley   ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr);
27098c7f9fc6SMatthew G. Knepley   ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr);
27108c7f9fc6SMatthew G. Knepley   ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr);
2711d49fcaecSMatthew G. Knepley   ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr);
2712d49fcaecSMatthew G. Knepley   for (v = vStart; v < vEnd; ++v) {
2713d49fcaecSMatthew G. Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
2714d49fcaecSMatthew G. Knepley     ierr = PetscSectionSetDof(cSection,     v,  dof);CHKERRQ(ierr);
27158c7f9fc6SMatthew G. Knepley     ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr);
2716d49fcaecSMatthew G. Knepley   }
2717d49fcaecSMatthew G. Knepley   for (c = cStart; c < cEnd; ++c) {
2718d49fcaecSMatthew G. Knepley     ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr);
2719d49fcaecSMatthew G. Knepley     ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr);
27208c7f9fc6SMatthew G. Knepley     ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr);
2721d49fcaecSMatthew G. Knepley   }
2722d49fcaecSMatthew G. Knepley   ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr);
2723d49fcaecSMatthew G. Knepley   ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr);
2724d49fcaecSMatthew G. Knepley   ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr);
2725d49fcaecSMatthew G. Knepley   ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr);
2726d49fcaecSMatthew G. Knepley   ierr = VecSetBlockSize(cVec,         bs);CHKERRQ(ierr);
2727d49fcaecSMatthew G. Knepley   ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
2728d49fcaecSMatthew G. Knepley   ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr);
2729d49fcaecSMatthew G. Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
2730d49fcaecSMatthew G. Knepley   ierr = VecGetArray(cVec,        &coords2);CHKERRQ(ierr);
2731d49fcaecSMatthew G. Knepley   for (v = vStart; v < vEnd; ++v) {
2732d49fcaecSMatthew G. Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
2733d49fcaecSMatthew G. Knepley     ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
2734d49fcaecSMatthew G. Knepley     ierr = PetscSectionGetOffset(cSection,     v, &off2);CHKERRQ(ierr);
2735d49fcaecSMatthew G. Knepley     for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d];
2736d49fcaecSMatthew G. Knepley   }
2737d49fcaecSMatthew G. Knepley   ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr);
2738d49fcaecSMatthew G. Knepley   for (c = cStart; c < cEnd; ++c) {
2739d49fcaecSMatthew G. Knepley     PetscScalar *cellCoords = NULL;
2740d49fcaecSMatthew G. Knepley     PetscInt     b;
2741d49fcaecSMatthew G. Knepley 
2742d49fcaecSMatthew G. Knepley     ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr);
2743d49fcaecSMatthew G. Knepley     ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr);
2744d49fcaecSMatthew G. Knepley     for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b];
2745d49fcaecSMatthew G. Knepley     for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);}
2746d49fcaecSMatthew G. Knepley     ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr);
2747d49fcaecSMatthew G. Knepley   }
2748d49fcaecSMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr);
2749d49fcaecSMatthew G. Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
2750d49fcaecSMatthew G. Knepley   ierr = VecRestoreArray(cVec,        &coords2);CHKERRQ(ierr);
275146e270d4SMatthew G. Knepley   ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr);
2752d49fcaecSMatthew G. Knepley   ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr);
2753d49fcaecSMatthew G. Knepley   ierr = VecDestroy(&cVec);CHKERRQ(ierr);
2754d49fcaecSMatthew G. Knepley   ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr);
2755d49fcaecSMatthew G. Knepley   PetscFunctionReturn(0);
2756d49fcaecSMatthew G. Knepley }
2757d49fcaecSMatthew G. Knepley 
2758d49fcaecSMatthew G. Knepley #undef __FUNCT__
2759aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel"
2760552f7358SJed Brown /*@
2761aa50250dSMatthew G. Knepley   DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point
2762552f7358SJed Brown 
2763552f7358SJed Brown   Not Collective
2764552f7358SJed Brown 
2765aa50250dSMatthew G. Knepley   Input Parameter:
2766552f7358SJed Brown . dm    - The DMPlex object
2767552f7358SJed Brown 
2768aa50250dSMatthew G. Knepley   Output Parameter:
2769aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth
2770552f7358SJed Brown 
2771552f7358SJed Brown   Level: developer
2772552f7358SJed Brown 
2773aa50250dSMatthew G. Knepley .keywords: mesh, points
2774aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum()
2775aa50250dSMatthew G. Knepley @*/
2776aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel)
2777aa50250dSMatthew G. Knepley {
2778aa50250dSMatthew G. Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
2779aa50250dSMatthew G. Knepley   PetscErrorCode ierr;
2780aa50250dSMatthew G. Knepley 
2781aa50250dSMatthew G. Knepley   PetscFunctionBegin;
2782aa50250dSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2783aa50250dSMatthew G. Knepley   PetscValidPointer(depthLabel, 2);
278463d1a920SMatthew G. Knepley   if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);}
2785aa50250dSMatthew G. Knepley   *depthLabel = mesh->depthLabel;
2786aa50250dSMatthew G. Knepley   PetscFunctionReturn(0);
2787aa50250dSMatthew G. Knepley }
2788aa50250dSMatthew G. Knepley 
2789aa50250dSMatthew G. Knepley #undef __FUNCT__
2790aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth"
2791aa50250dSMatthew G. Knepley /*@
2792aa50250dSMatthew G. Knepley   DMPlexGetDepth - Get the depth of the DAG representing this mesh
2793aa50250dSMatthew G. Knepley 
2794aa50250dSMatthew G. Knepley   Not Collective
2795aa50250dSMatthew G. Knepley 
2796aa50250dSMatthew G. Knepley   Input Parameter:
2797aa50250dSMatthew G. Knepley . dm    - The DMPlex object
2798aa50250dSMatthew G. Knepley 
2799aa50250dSMatthew G. Knepley   Output Parameter:
2800aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG
2801aa50250dSMatthew G. Knepley 
2802aa50250dSMatthew G. Knepley   Level: developer
2803552f7358SJed Brown 
2804552f7358SJed Brown .keywords: mesh, points
2805aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum()
2806552f7358SJed Brown @*/
2807552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth)
2808552f7358SJed Brown {
2809aa50250dSMatthew G. Knepley   DMLabel        label;
2810aa50250dSMatthew G. Knepley   PetscInt       d = 0;
2811552f7358SJed Brown   PetscErrorCode ierr;
2812552f7358SJed Brown 
2813552f7358SJed Brown   PetscFunctionBegin;
2814552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2815552f7358SJed Brown   PetscValidPointer(depth, 2);
2816aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
2817aa50250dSMatthew G. Knepley   if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);}
2818552f7358SJed Brown   *depth = d-1;
2819552f7358SJed Brown   PetscFunctionReturn(0);
2820552f7358SJed Brown }
2821552f7358SJed Brown 
2822552f7358SJed Brown #undef __FUNCT__
2823552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum"
2824552f7358SJed Brown /*@
2825552f7358SJed Brown   DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth.
2826552f7358SJed Brown 
2827552f7358SJed Brown   Not Collective
2828552f7358SJed Brown 
2829552f7358SJed Brown   Input Parameters:
2830552f7358SJed Brown + dm           - The DMPlex object
2831552f7358SJed Brown - stratumValue - The requested depth
2832552f7358SJed Brown 
2833552f7358SJed Brown   Output Parameters:
2834552f7358SJed Brown + start - The first point at this depth
2835552f7358SJed Brown - end   - One beyond the last point at this depth
2836552f7358SJed Brown 
2837552f7358SJed Brown   Level: developer
2838552f7358SJed Brown 
2839552f7358SJed Brown .keywords: mesh, points
2840552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth()
2841552f7358SJed Brown @*/
28420adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end)
28430adebc6cSBarry Smith {
2844aa50250dSMatthew G. Knepley   DMLabel        label;
284563d1a920SMatthew G. Knepley   PetscInt       pStart, pEnd;
2846552f7358SJed Brown   PetscErrorCode ierr;
2847552f7358SJed Brown 
2848552f7358SJed Brown   PetscFunctionBegin;
2849552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
285063d1a920SMatthew G. Knepley   if (start) {PetscValidPointer(start, 3); *start = 0;}
285163d1a920SMatthew G. Knepley   if (end)   {PetscValidPointer(end,   4); *end   = 0;}
2852552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
28530d644c17SKarl Rupp   if (pStart == pEnd) PetscFunctionReturn(0);
285463d1a920SMatthew G. Knepley   if (stratumValue < 0) {
285563d1a920SMatthew G. Knepley     if (start) *start = pStart;
285663d1a920SMatthew G. Knepley     if (end)   *end   = pEnd;
285763d1a920SMatthew G. Knepley     PetscFunctionReturn(0);
2858552f7358SJed Brown   }
2859aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
286063d1a920SMatthew G. Knepley   if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");
286163d1a920SMatthew G. Knepley   ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr);
2862552f7358SJed Brown   PetscFunctionReturn(0);
2863552f7358SJed Brown }
2864552f7358SJed Brown 
2865552f7358SJed Brown #undef __FUNCT__
2866552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum"
2867552f7358SJed Brown /*@
2868552f7358SJed Brown   DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height.
2869552f7358SJed Brown 
2870552f7358SJed Brown   Not Collective
2871552f7358SJed Brown 
2872552f7358SJed Brown   Input Parameters:
2873552f7358SJed Brown + dm           - The DMPlex object
2874552f7358SJed Brown - stratumValue - The requested height
2875552f7358SJed Brown 
2876552f7358SJed Brown   Output Parameters:
2877552f7358SJed Brown + start - The first point at this height
2878552f7358SJed Brown - end   - One beyond the last point at this height
2879552f7358SJed Brown 
2880552f7358SJed Brown   Level: developer
2881552f7358SJed Brown 
2882552f7358SJed Brown .keywords: mesh, points
2883552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth()
2884552f7358SJed Brown @*/
28850adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end)
28860adebc6cSBarry Smith {
2887aa50250dSMatthew G. Knepley   DMLabel        label;
288863d1a920SMatthew G. Knepley   PetscInt       depth, pStart, pEnd;
2889552f7358SJed Brown   PetscErrorCode ierr;
2890552f7358SJed Brown 
2891552f7358SJed Brown   PetscFunctionBegin;
2892552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
289363d1a920SMatthew G. Knepley   if (start) {PetscValidPointer(start, 3); *start = 0;}
289463d1a920SMatthew G. Knepley   if (end)   {PetscValidPointer(end,   4); *end   = 0;}
2895552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
28960d644c17SKarl Rupp   if (pStart == pEnd) PetscFunctionReturn(0);
289763d1a920SMatthew G. Knepley   if (stratumValue < 0) {
289863d1a920SMatthew G. Knepley     if (start) *start = pStart;
289963d1a920SMatthew G. Knepley     if (end)   *end   = pEnd;
290063d1a920SMatthew G. Knepley     PetscFunctionReturn(0);
2901552f7358SJed Brown   }
2902aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
2903aa50250dSMatthew G. Knepley   if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr);
290463d1a920SMatthew G. Knepley   ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr);
290563d1a920SMatthew G. Knepley   ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr);
2906552f7358SJed Brown   PetscFunctionReturn(0);
2907552f7358SJed Brown }
2908552f7358SJed Brown 
2909552f7358SJed Brown #undef __FUNCT__
2910552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial"
2911552f7358SJed Brown /* Set the number of dof on each point and separate by fields */
2912a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section)
2913a6dfd86eSKarl Rupp {
2914552f7358SJed Brown   PetscInt      *numDofTot;
2915916f0f19SMatthew G. Knepley   PetscInt       depth, pStart = 0, pEnd = 0;
2916916f0f19SMatthew G. Knepley   PetscInt       p, d, dep, f;
2917552f7358SJed Brown   PetscErrorCode ierr;
2918552f7358SJed Brown 
2919552f7358SJed Brown   PetscFunctionBegin;
2920785e854fSJed Brown   ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr);
2921552f7358SJed Brown   for (d = 0; d <= dim; ++d) {
2922552f7358SJed Brown     numDofTot[d] = 0;
29230d644c17SKarl Rupp     for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d];
2924552f7358SJed Brown   }
292582f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr);
2926552f7358SJed Brown   if (numFields > 0) {
2927552f7358SJed Brown     ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr);
2928552f7358SJed Brown     if (numComp) {
2929552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
2930552f7358SJed Brown         ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr);
2931552f7358SJed Brown       }
2932552f7358SJed Brown     }
2933552f7358SJed Brown   }
2934552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
2935552f7358SJed Brown   ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr);
2936916f0f19SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
2937916f0f19SMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
2938916f0f19SMatthew G. Knepley     d    = dim == depth ? dep : (!dep ? 0 : dim);
2939916f0f19SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr);
2940552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
2941552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
2942552f7358SJed Brown         ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr);
2943552f7358SJed Brown       }
2944552f7358SJed Brown       ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr);
2945552f7358SJed Brown     }
2946552f7358SJed Brown   }
2947552f7358SJed Brown   ierr = PetscFree(numDofTot);CHKERRQ(ierr);
2948552f7358SJed Brown   PetscFunctionReturn(0);
2949552f7358SJed Brown }
2950552f7358SJed Brown 
2951552f7358SJed Brown #undef __FUNCT__
2952552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof"
2953552f7358SJed Brown /* Set the number of dof on each point and separate by fields
2954552f7358SJed Brown    If constDof is PETSC_DETERMINE, constrain every dof on the point
2955552f7358SJed Brown */
2956a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section)
2957a6dfd86eSKarl Rupp {
2958552f7358SJed Brown   PetscInt       numFields;
2959552f7358SJed Brown   PetscInt       bc;
2960a68b90caSToby Isaac   PetscSection   aSec;
2961552f7358SJed Brown   PetscErrorCode ierr;
2962552f7358SJed Brown 
2963552f7358SJed Brown   PetscFunctionBegin;
2964552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
2965552f7358SJed Brown   for (bc = 0; bc < numBC; ++bc) {
2966552f7358SJed Brown     PetscInt        field = 0;
2967552f7358SJed Brown     const PetscInt *idx;
2968552f7358SJed Brown     PetscInt        n, i;
2969552f7358SJed Brown 
29700d644c17SKarl Rupp     if (numFields) field = bcField[bc];
2971552f7358SJed Brown     ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr);
2972552f7358SJed Brown     ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
2973552f7358SJed Brown     for (i = 0; i < n; ++i) {
2974552f7358SJed Brown       const PetscInt p        = idx[i];
2975552f7358SJed Brown       PetscInt       numConst = constDof;
2976552f7358SJed Brown 
2977552f7358SJed Brown       /* Constrain every dof on the point */
2978552f7358SJed Brown       if (numConst < 0) {
2979552f7358SJed Brown         if (numFields) {
2980552f7358SJed Brown           ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr);
2981552f7358SJed Brown         } else {
2982552f7358SJed Brown           ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr);
2983552f7358SJed Brown         }
2984552f7358SJed Brown       }
2985552f7358SJed Brown       if (numFields) {
2986552f7358SJed Brown         ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr);
2987552f7358SJed Brown       }
2988552f7358SJed Brown       ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr);
2989552f7358SJed Brown     }
2990552f7358SJed Brown     ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
2991552f7358SJed Brown   }
2992a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr);
2993a68b90caSToby Isaac   if (aSec) {
2994a68b90caSToby Isaac     PetscInt aStart, aEnd, a;
2995a68b90caSToby Isaac 
2996a68b90caSToby Isaac     ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr);
2997a68b90caSToby Isaac     for (a = aStart; a < aEnd; a++) {
2998a68b90caSToby Isaac       PetscInt dof;
2999a68b90caSToby Isaac 
3000a68b90caSToby Isaac       ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr);
3001a68b90caSToby Isaac       if (dof) {
3002a68b90caSToby Isaac         /* if there are point-to-point constraints, then all dofs are constrained */
3003a68b90caSToby Isaac         ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr);
3004a68b90caSToby Isaac         ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr);
3005a68b90caSToby Isaac         if (numFields) {
3006a68b90caSToby Isaac           PetscInt f;
3007a68b90caSToby Isaac 
3008a68b90caSToby Isaac           for (f = 0; f < numFields; f++) {
3009a68b90caSToby Isaac             ierr = PetscSectionGetFieldDof(section, a, f, &dof);CHKERRQ(ierr);
3010a68b90caSToby Isaac             ierr = PetscSectionSetFieldConstraintDof(section, a, f, dof);CHKERRQ(ierr);
3011a68b90caSToby Isaac           }
3012a68b90caSToby Isaac         }
3013a68b90caSToby Isaac       }
3014a68b90caSToby Isaac     }
3015a68b90caSToby Isaac   }
3016552f7358SJed Brown   PetscFunctionReturn(0);
3017552f7358SJed Brown }
3018552f7358SJed Brown 
3019552f7358SJed Brown #undef __FUNCT__
3020552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll"
3021552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */
30220adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section)
30230adebc6cSBarry Smith {
3024552f7358SJed Brown   PetscInt      *maxConstraints;
3025552f7358SJed Brown   PetscInt       numFields, f, pStart = 0, pEnd = 0, p;
3026552f7358SJed Brown   PetscErrorCode ierr;
3027552f7358SJed Brown 
3028552f7358SJed Brown   PetscFunctionBegin;
3029552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
3030552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3031785e854fSJed Brown   ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr);
30320d644c17SKarl Rupp   for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0;
3033552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
3034552f7358SJed Brown     PetscInt cdof;
3035552f7358SJed Brown 
3036552f7358SJed Brown     if (numFields) {
3037552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
3038552f7358SJed Brown         ierr              = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr);
3039552f7358SJed Brown         maxConstraints[f] = PetscMax(maxConstraints[f], cdof);
3040552f7358SJed Brown       }
3041552f7358SJed Brown     } else {
3042552f7358SJed Brown       ierr              = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
3043552f7358SJed Brown       maxConstraints[0] = PetscMax(maxConstraints[0], cdof);
3044552f7358SJed Brown     }
3045552f7358SJed Brown   }
3046552f7358SJed Brown   for (f = 0; f < numFields; ++f) {
3047552f7358SJed Brown     maxConstraints[numFields] += maxConstraints[f];
3048552f7358SJed Brown   }
3049552f7358SJed Brown   if (maxConstraints[numFields]) {
3050552f7358SJed Brown     PetscInt *indices;
3051552f7358SJed Brown 
3052785e854fSJed Brown     ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr);
3053552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
3054552f7358SJed Brown       PetscInt cdof, d;
3055552f7358SJed Brown 
3056552f7358SJed Brown       ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
3057552f7358SJed Brown       if (cdof) {
3058552f7358SJed Brown         if (cdof > maxConstraints[numFields]) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_LIB, "Likely memory corruption, point %D cDof %D > maxConstraints %D", p, cdof, maxConstraints[numFields]);
3059552f7358SJed Brown         if (numFields) {
3060552f7358SJed Brown           PetscInt numConst = 0, foff = 0;
3061552f7358SJed Brown 
3062552f7358SJed Brown           for (f = 0; f < numFields; ++f) {
3063552f7358SJed Brown             PetscInt cfdof, fdof;
3064552f7358SJed Brown 
3065552f7358SJed Brown             ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr);
3066552f7358SJed Brown             ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr);
3067552f7358SJed Brown             /* Change constraint numbering from absolute local dof number to field relative local dof number */
30680d644c17SKarl Rupp             for (d = 0; d < cfdof; ++d) indices[numConst+d] = d;
3069552f7358SJed Brown             ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr);
30700d644c17SKarl Rupp             for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff;
3071552f7358SJed Brown             numConst += cfdof;
3072552f7358SJed Brown             foff     += fdof;
3073552f7358SJed Brown           }
3074552f7358SJed Brown           if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof);
3075552f7358SJed Brown         } else {
30760d644c17SKarl Rupp           for (d = 0; d < cdof; ++d) indices[d] = d;
3077552f7358SJed Brown         }
3078552f7358SJed Brown         ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr);
3079552f7358SJed Brown       }
3080552f7358SJed Brown     }
3081552f7358SJed Brown     ierr = PetscFree(indices);CHKERRQ(ierr);
3082552f7358SJed Brown   }
3083552f7358SJed Brown   ierr = PetscFree(maxConstraints);CHKERRQ(ierr);
3084552f7358SJed Brown   PetscFunctionReturn(0);
3085552f7358SJed Brown }
3086552f7358SJed Brown 
3087552f7358SJed Brown #undef __FUNCT__
3088552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField"
3089552f7358SJed Brown /* Set the constrained field indices on each point */
30900adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section)
30910adebc6cSBarry Smith {
3092552f7358SJed Brown   const PetscInt *points, *indices;
3093552f7358SJed Brown   PetscInt        numFields, maxDof, numPoints, p, numConstraints;
3094552f7358SJed Brown   PetscErrorCode  ierr;
3095552f7358SJed Brown 
3096552f7358SJed Brown   PetscFunctionBegin;
3097552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
3098552f7358SJed Brown   if ((field < 0) || (field >= numFields)) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Section field %d should be in [%d, %d)", field, 0, numFields);
3099552f7358SJed Brown 
3100552f7358SJed Brown   ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr);
3101552f7358SJed Brown   ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr);
3102552f7358SJed Brown   if (!constraintIndices) {
3103552f7358SJed Brown     PetscInt *idx, i;
3104552f7358SJed Brown 
3105552f7358SJed Brown     ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
3106785e854fSJed Brown     ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr);
31070d644c17SKarl Rupp     for (i = 0; i < maxDof; ++i) idx[i] = i;
3108552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
3109552f7358SJed Brown       ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr);
3110552f7358SJed Brown     }
3111552f7358SJed Brown     ierr = PetscFree(idx);CHKERRQ(ierr);
3112552f7358SJed Brown   } else {
3113552f7358SJed Brown     ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr);
3114552f7358SJed Brown     ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr);
3115552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
3116552f7358SJed Brown       PetscInt fcdof;
3117552f7358SJed Brown 
3118552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr);
311982f516ccSBarry Smith       if (fcdof != numConstraints) SETERRQ4(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Section point %d field %d has %d constraints, but yo ugave %d indices", p, field, fcdof, numConstraints);
3120552f7358SJed Brown       ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr);
3121552f7358SJed Brown     }
3122552f7358SJed Brown     ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr);
3123552f7358SJed Brown   }
3124552f7358SJed Brown   ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr);
3125552f7358SJed Brown   PetscFunctionReturn(0);
3126552f7358SJed Brown }
3127552f7358SJed Brown 
3128552f7358SJed Brown #undef __FUNCT__
3129552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices"
3130552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */
31310adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section)
31320adebc6cSBarry Smith {
3133552f7358SJed Brown   PetscInt      *indices;
3134552f7358SJed Brown   PetscInt       numFields, maxDof, f, pStart = 0, pEnd = 0, p;
3135552f7358SJed Brown   PetscErrorCode ierr;
3136552f7358SJed Brown 
3137552f7358SJed Brown   PetscFunctionBegin;
3138552f7358SJed Brown   ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
3139785e854fSJed Brown   ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr);
3140552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
314182f516ccSBarry Smith   if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices.");
3142552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3143552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
3144552f7358SJed Brown     PetscInt cdof, d;
3145552f7358SJed Brown 
3146552f7358SJed Brown     ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
3147552f7358SJed Brown     if (cdof) {
3148552f7358SJed Brown       PetscInt numConst = 0, foff = 0;
3149552f7358SJed Brown 
3150552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
3151552f7358SJed Brown         const PetscInt *fcind;
3152552f7358SJed Brown         PetscInt        fdof, fcdof;
3153552f7358SJed Brown 
3154552f7358SJed Brown         ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr);
3155552f7358SJed Brown         ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr);
3156552f7358SJed Brown         if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);}
3157552f7358SJed Brown         /* Change constraint numbering from field relative local dof number to absolute local dof number */
31580d644c17SKarl Rupp         for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff;
3159552f7358SJed Brown         foff     += fdof;
3160552f7358SJed Brown         numConst += fcdof;
3161552f7358SJed Brown       }
316282f516ccSBarry Smith       if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof);
3163552f7358SJed Brown       ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr);
3164552f7358SJed Brown     }
3165552f7358SJed Brown   }
3166552f7358SJed Brown   ierr = PetscFree(indices);CHKERRQ(ierr);
3167552f7358SJed Brown   PetscFunctionReturn(0);
3168552f7358SJed Brown }
3169552f7358SJed Brown 
3170552f7358SJed Brown #undef __FUNCT__
3171552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection"
3172552f7358SJed Brown /*@C
3173552f7358SJed Brown   DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided.
3174552f7358SJed Brown 
3175552f7358SJed Brown   Not Collective
3176552f7358SJed Brown 
3177552f7358SJed Brown   Input Parameters:
3178552f7358SJed Brown + dm        - The DMPlex object
3179552f7358SJed Brown . dim       - The spatial dimension of the problem
3180552f7358SJed Brown . numFields - The number of fields in the problem
3181552f7358SJed Brown . numComp   - An array of size numFields that holds the number of components for each field
3182552f7358SJed Brown . numDof    - An array of size numFields*(dim+1) which holds the number of dof for each field on a mesh piece of dimension d
3183552f7358SJed Brown . numBC     - The number of boundary conditions
3184552f7358SJed Brown . bcField   - An array of size numBC giving the field number for each boundry condition
3185f8f126e8SMatthew G. Knepley . bcPoints  - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies
3186f8f126e8SMatthew G. Knepley - perm      - Optional permutation of the chart, or NULL
3187552f7358SJed Brown 
3188552f7358SJed Brown   Output Parameter:
3189552f7358SJed Brown . section - The PetscSection object
3190552f7358SJed Brown 
3191552f7358SJed Brown   Notes: numDof[f*(dim+1)+d] gives the number of dof for field f on sieve points of dimension d. For instance, numDof[1] is the
3192f8f126e8SMatthew G. Knepley   number of dof for field 0 on each edge.
3193f8f126e8SMatthew G. Knepley 
3194f8f126e8SMatthew G. Knepley   The chart permutation is the same one set using PetscSectionSetPermutation()
3195552f7358SJed Brown 
3196552f7358SJed Brown   Level: developer
3197552f7358SJed Brown 
31983813dfbdSMatthew G Knepley   Fortran Notes:
31993813dfbdSMatthew G Knepley   A Fortran 90 version is available as DMPlexCreateSectionF90()
32003813dfbdSMatthew G Knepley 
3201552f7358SJed Brown .keywords: mesh, elements
3202f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation()
3203552f7358SJed Brown @*/
3204f8f126e8SMatthew G. Knepley PetscErrorCode DMPlexCreateSection(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], IS perm, PetscSection *section)
3205a6dfd86eSKarl Rupp {
3206a68b90caSToby Isaac   PetscSection   aSec;
3207552f7358SJed Brown   PetscErrorCode ierr;
3208552f7358SJed Brown 
3209552f7358SJed Brown   PetscFunctionBegin;
3210552f7358SJed Brown   ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr);
3211552f7358SJed Brown   ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr);
3212f8f126e8SMatthew G. Knepley   if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);}
3213552f7358SJed Brown   ierr = PetscSectionSetUp(*section);CHKERRQ(ierr);
3214a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm,&aSec,NULL);CHKERRQ(ierr);
3215a68b90caSToby Isaac   if (numBC || aSec) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);}
3216ce1779c8SBarry Smith   ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr);
3217552f7358SJed Brown   PetscFunctionReturn(0);
3218552f7358SJed Brown }
3219552f7358SJed Brown 
3220552f7358SJed Brown #undef __FUNCT__
3221552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex"
32220adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm)
32230adebc6cSBarry Smith {
3224552f7358SJed Brown   PetscSection   section;
3225552f7358SJed Brown   PetscErrorCode ierr;
3226552f7358SJed Brown 
3227552f7358SJed Brown   PetscFunctionBegin;
322838221697SMatthew G. Knepley   ierr = DMClone(dm, cdm);CHKERRQ(ierr);
322982f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &section);CHKERRQ(ierr);
3230552f7358SJed Brown   ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr);
32311d799100SJed Brown   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
3232552f7358SJed Brown   PetscFunctionReturn(0);
3233552f7358SJed Brown }
3234552f7358SJed Brown 
3235552f7358SJed Brown #undef __FUNCT__
3236552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection"
32370adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section)
32380adebc6cSBarry Smith {
3239552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
3240552f7358SJed Brown 
3241552f7358SJed Brown   PetscFunctionBegin;
3242552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3243552f7358SJed Brown   if (section) *section = mesh->coneSection;
3244552f7358SJed Brown   PetscFunctionReturn(0);
3245552f7358SJed Brown }
3246552f7358SJed Brown 
3247552f7358SJed Brown #undef __FUNCT__
32488cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection"
32498cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section)
32508cb4d582SMatthew G. Knepley {
32518cb4d582SMatthew G. Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
32528cb4d582SMatthew G. Knepley 
32538cb4d582SMatthew G. Knepley   PetscFunctionBegin;
32548cb4d582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
32558cb4d582SMatthew G. Knepley   if (section) *section = mesh->supportSection;
32568cb4d582SMatthew G. Knepley   PetscFunctionReturn(0);
32578cb4d582SMatthew G. Knepley }
32588cb4d582SMatthew G. Knepley 
32598cb4d582SMatthew G. Knepley #undef __FUNCT__
3260552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones"
3261a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[])
3262a6dfd86eSKarl Rupp {
3263552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
3264552f7358SJed Brown 
3265552f7358SJed Brown   PetscFunctionBegin;
3266552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3267552f7358SJed Brown   if (cones) *cones = mesh->cones;
3268552f7358SJed Brown   PetscFunctionReturn(0);
3269552f7358SJed Brown }
3270552f7358SJed Brown 
3271552f7358SJed Brown #undef __FUNCT__
3272552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations"
3273a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[])
3274a6dfd86eSKarl Rupp {
3275552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
3276552f7358SJed Brown 
3277552f7358SJed Brown   PetscFunctionBegin;
3278552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3279552f7358SJed Brown   if (coneOrientations) *coneOrientations = mesh->coneOrientations;
3280552f7358SJed Brown   PetscFunctionReturn(0);
3281552f7358SJed Brown }
3282552f7358SJed Brown 
3283552f7358SJed Brown /******************************** FEM Support **********************************/
3284552f7358SJed Brown 
3285552f7358SJed Brown #undef __FUNCT__
32861a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static"
32871a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
3288a6dfd86eSKarl Rupp {
3289552f7358SJed Brown   PetscScalar    *array, *vArray;
3290d9917b9dSMatthew G. Knepley   const PetscInt *cone, *coneO;
32911a271a75SMatthew G. Knepley   PetscInt        pStart, pEnd, p, numPoints, size = 0, offset = 0;
3292552f7358SJed Brown   PetscErrorCode  ierr;
3293552f7358SJed Brown 
32941b406b76SMatthew G. Knepley   PetscFunctionBeginHot;
32952a3aaacfSMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
32965a1bb5cfSMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr);
32975a1bb5cfSMatthew G. Knepley   ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
32985a1bb5cfSMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr);
32993f7cbbe7SMatthew G. Knepley   if (!values || !*values) {
33009df71ca4SMatthew G. Knepley     if ((point >= pStart) && (point < pEnd)) {
33019df71ca4SMatthew G. Knepley       PetscInt dof;
3302d9917b9dSMatthew G. Knepley 
33039df71ca4SMatthew G. Knepley       ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
33049df71ca4SMatthew G. Knepley       size += dof;
33059df71ca4SMatthew G. Knepley     }
33069df71ca4SMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
33079df71ca4SMatthew G. Knepley       const PetscInt cp = cone[p];
33082a3aaacfSMatthew G. Knepley       PetscInt       dof;
33095a1bb5cfSMatthew G. Knepley 
33105a1bb5cfSMatthew G. Knepley       if ((cp < pStart) || (cp >= pEnd)) continue;
33112a3aaacfSMatthew G. Knepley       ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
33125a1bb5cfSMatthew G. Knepley       size += dof;
33135a1bb5cfSMatthew G. Knepley     }
33143f7cbbe7SMatthew G. Knepley     if (!values) {
33153f7cbbe7SMatthew G. Knepley       if (csize) *csize = size;
33163f7cbbe7SMatthew G. Knepley       PetscFunctionReturn(0);
33173f7cbbe7SMatthew G. Knepley     }
33185a1bb5cfSMatthew G. Knepley     ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr);
3319982e9ed1SMatthew G. Knepley   } else {
3320982e9ed1SMatthew G. Knepley     array = *values;
3321982e9ed1SMatthew G. Knepley   }
33229df71ca4SMatthew G. Knepley   size = 0;
33235a1bb5cfSMatthew G. Knepley   ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
33249df71ca4SMatthew G. Knepley   if ((point >= pStart) && (point < pEnd)) {
33259df71ca4SMatthew G. Knepley     PetscInt     dof, off, d;
33269df71ca4SMatthew G. Knepley     PetscScalar *varr;
3327d9917b9dSMatthew G. Knepley 
33289df71ca4SMatthew G. Knepley     ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
33299df71ca4SMatthew G. Knepley     ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
33309df71ca4SMatthew G. Knepley     varr = &vArray[off];
33311a271a75SMatthew G. Knepley     for (d = 0; d < dof; ++d, ++offset) {
33321a271a75SMatthew G. Knepley       array[offset] = varr[d];
33339df71ca4SMatthew G. Knepley     }
33349df71ca4SMatthew G. Knepley     size += dof;
33359df71ca4SMatthew G. Knepley   }
33369df71ca4SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) {
33379df71ca4SMatthew G. Knepley     const PetscInt cp = cone[p];
33389df71ca4SMatthew G. Knepley     PetscInt       o  = coneO[p];
33395a1bb5cfSMatthew G. Knepley     PetscInt       dof, off, d;
33405a1bb5cfSMatthew G. Knepley     PetscScalar   *varr;
33415a1bb5cfSMatthew G. Knepley 
334252ed52e8SMatthew G. Knepley     if ((cp < pStart) || (cp >= pEnd)) continue;
33435a1bb5cfSMatthew G. Knepley     ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
33445a1bb5cfSMatthew G. Knepley     ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr);
33455a1bb5cfSMatthew G. Knepley     varr = &vArray[off];
33465a1bb5cfSMatthew G. Knepley     if (o >= 0) {
33471a271a75SMatthew G. Knepley       for (d = 0; d < dof; ++d, ++offset) {
33481a271a75SMatthew G. Knepley         array[offset] = varr[d];
33495a1bb5cfSMatthew G. Knepley       }
33505a1bb5cfSMatthew G. Knepley     } else {
33511a271a75SMatthew G. Knepley       for (d = dof-1; d >= 0; --d, ++offset) {
33521a271a75SMatthew G. Knepley         array[offset] = varr[d];
33535a1bb5cfSMatthew G. Knepley       }
33545a1bb5cfSMatthew G. Knepley     }
33559df71ca4SMatthew G. Knepley     size += dof;
33565a1bb5cfSMatthew G. Knepley   }
33575a1bb5cfSMatthew G. Knepley   ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
33589df71ca4SMatthew G. Knepley   if (!*values) {
33595a1bb5cfSMatthew G. Knepley     if (csize) *csize = size;
33605a1bb5cfSMatthew G. Knepley     *values = array;
33619df71ca4SMatthew G. Knepley   } else {
33629df71ca4SMatthew G. Knepley     if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size);
33638c312ff3SMatthew G. Knepley     *csize = size;
33649df71ca4SMatthew G. Knepley   }
33655a1bb5cfSMatthew G. Knepley   PetscFunctionReturn(0);
33665a1bb5cfSMatthew G. Knepley }
3367d9917b9dSMatthew G. Knepley 
3368d9917b9dSMatthew G. Knepley #undef __FUNCT__
33691a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static"
33701a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[])
33711a271a75SMatthew G. Knepley {
33721a271a75SMatthew G. Knepley   PetscInt       offset = 0, p;
33731a271a75SMatthew G. Knepley   PetscErrorCode ierr;
33741a271a75SMatthew G. Knepley 
33751a271a75SMatthew G. Knepley   PetscFunctionBeginHot;
3376fe02ba77SJed Brown   *size = 0;
33771a271a75SMatthew G. Knepley   for (p = 0; p < numPoints*2; p += 2) {
33781a271a75SMatthew G. Knepley     const PetscInt point = points[p];
33791a271a75SMatthew G. Knepley     const PetscInt o     = points[p+1];
33801a271a75SMatthew G. Knepley     PetscInt       dof, off, d;
33811a271a75SMatthew G. Knepley     const PetscScalar *varr;
33821a271a75SMatthew G. Knepley 
33831a271a75SMatthew G. Knepley     ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
33841a271a75SMatthew G. Knepley     ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
33851a271a75SMatthew G. Knepley     varr = &vArray[off];
33861a271a75SMatthew G. Knepley     if (o >= 0) {
33871a271a75SMatthew G. Knepley       for (d = 0; d < dof; ++d, ++offset)    array[offset] = varr[d];
33881a271a75SMatthew G. Knepley     } else {
33891a271a75SMatthew G. Knepley       for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d];
33901a271a75SMatthew G. Knepley     }
33911a271a75SMatthew G. Knepley   }
33921a271a75SMatthew G. Knepley   *size = offset;
33931a271a75SMatthew G. Knepley   PetscFunctionReturn(0);
33941a271a75SMatthew G. Knepley }
33951a271a75SMatthew G. Knepley 
33961a271a75SMatthew G. Knepley #undef __FUNCT__
33971a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static"
33981a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Fields_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], PetscInt numFields, const PetscScalar vArray[], PetscInt *size, PetscScalar array[])
33991a271a75SMatthew G. Knepley {
34001a271a75SMatthew G. Knepley   PetscInt       offset = 0, f;
34011a271a75SMatthew G. Knepley   PetscErrorCode ierr;
34021a271a75SMatthew G. Knepley 
34031a271a75SMatthew G. Knepley   PetscFunctionBeginHot;
3404fe02ba77SJed Brown   *size = 0;
34051a271a75SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
34061a271a75SMatthew G. Knepley     PetscInt fcomp, p;
34071a271a75SMatthew G. Knepley 
34081a271a75SMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
34091a271a75SMatthew G. Knepley     for (p = 0; p < numPoints*2; p += 2) {
34101a271a75SMatthew G. Knepley       const PetscInt point = points[p];
34111a271a75SMatthew G. Knepley       const PetscInt o     = points[p+1];
34121a271a75SMatthew G. Knepley       PetscInt       fdof, foff, d, c;
34131a271a75SMatthew G. Knepley       const PetscScalar *varr;
34141a271a75SMatthew G. Knepley 
34151a271a75SMatthew G. Knepley       ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
34161a271a75SMatthew G. Knepley       ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr);
34171a271a75SMatthew G. Knepley       varr = &vArray[foff];
34181a271a75SMatthew G. Knepley       if (o >= 0) {
34191a271a75SMatthew G. Knepley         for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d];
34201a271a75SMatthew G. Knepley       } else {
34211a271a75SMatthew G. Knepley         for (d = fdof/fcomp-1; d >= 0; --d) {
34221a271a75SMatthew G. Knepley           for (c = 0; c < fcomp; ++c, ++offset) {
34231a271a75SMatthew G. Knepley             array[offset] = varr[d*fcomp+c];
34241a271a75SMatthew G. Knepley           }
34251a271a75SMatthew G. Knepley         }
34261a271a75SMatthew G. Knepley       }
34271a271a75SMatthew G. Knepley     }
34281a271a75SMatthew G. Knepley   }
34291a271a75SMatthew G. Knepley   *size = offset;
34301a271a75SMatthew G. Knepley   PetscFunctionReturn(0);
34311a271a75SMatthew G. Knepley }
34321a271a75SMatthew G. Knepley 
34331a271a75SMatthew G. Knepley #undef __FUNCT__
3434552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure"
3435552f7358SJed Brown /*@C
3436552f7358SJed Brown   DMPlexVecGetClosure - Get an array of the values on the closure of 'point'
3437552f7358SJed Brown 
3438552f7358SJed Brown   Not collective
3439552f7358SJed Brown 
3440552f7358SJed Brown   Input Parameters:
3441552f7358SJed Brown + dm - The DM
3442552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section
3443552f7358SJed Brown . v - The local vector
3444552f7358SJed Brown - point - The sieve point in the DM
3445552f7358SJed Brown 
3446552f7358SJed Brown   Output Parameters:
3447552f7358SJed Brown + csize - The number of values in the closure, or NULL
3448552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed
3449552f7358SJed Brown 
3450552f7358SJed Brown   Fortran Notes:
3451552f7358SJed Brown   Since it returns an array, this routine is only available in Fortran 90, and you must
3452552f7358SJed Brown   include petsc.h90 in your code.
3453552f7358SJed Brown 
3454552f7358SJed Brown   The csize argument is not present in the Fortran 90 binding since it is internal to the array.
3455552f7358SJed Brown 
3456552f7358SJed Brown   Level: intermediate
3457552f7358SJed Brown 
3458552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
3459552f7358SJed Brown @*/
3460552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
3461552f7358SJed Brown {
3462552f7358SJed Brown   PetscSection    clSection;
3463d9917b9dSMatthew G. Knepley   IS              clPoints;
3464552f7358SJed Brown   PetscScalar    *array, *vArray;
3465552f7358SJed Brown   PetscInt       *points = NULL;
3466d9917b9dSMatthew G. Knepley   const PetscInt *clp;
34671a271a75SMatthew G. Knepley   PetscInt        depth, numFields, numPoints, size;
3468552f7358SJed Brown   PetscErrorCode  ierr;
3469552f7358SJed Brown 
3470d9917b9dSMatthew G. Knepley   PetscFunctionBeginHot;
3471552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3472552f7358SJed Brown   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
34731a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
34741a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
3475552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3476552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
3477552f7358SJed Brown   if (depth == 1 && numFields < 2) {
34781a271a75SMatthew G. Knepley     ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr);
3479552f7358SJed Brown     PetscFunctionReturn(0);
3480552f7358SJed Brown   }
34811a271a75SMatthew G. Knepley   /* Get points */
3482d9917b9dSMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr);
3483d9917b9dSMatthew G. Knepley   if (!clPoints) {
34841a271a75SMatthew G. Knepley     PetscInt pStart, pEnd, p, q;
3485552f7358SJed Brown 
34861a271a75SMatthew G. Knepley     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3487552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3488552f7358SJed Brown     /* Compress out points not in the section */
3489552f7358SJed Brown     for (p = 0, q = 0; p < numPoints*2; p += 2) {
3490552f7358SJed Brown       if ((points[p] >= pStart) && (points[p] < pEnd)) {
3491552f7358SJed Brown         points[q*2]   = points[p];
3492552f7358SJed Brown         points[q*2+1] = points[p+1];
3493552f7358SJed Brown         ++q;
3494552f7358SJed Brown       }
3495552f7358SJed Brown     }
3496552f7358SJed Brown     numPoints = q;
3497d9917b9dSMatthew G. Knepley   } else {
3498d9917b9dSMatthew G. Knepley     PetscInt dof, off;
3499552f7358SJed Brown 
3500d9917b9dSMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
3501d9917b9dSMatthew G. Knepley     ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
3502d9917b9dSMatthew G. Knepley     ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr);
35031a271a75SMatthew G. Knepley     numPoints = dof/2;
3504d9917b9dSMatthew G. Knepley     points    = (PetscInt *) &clp[off];
3505552f7358SJed Brown   }
35061a271a75SMatthew G. Knepley   /* Get array */
3507552f7358SJed Brown   if (!values || !*values) {
35081a271a75SMatthew G. Knepley     PetscInt asize = 0, dof, p;
3509552f7358SJed Brown 
35101a271a75SMatthew G. Knepley     for (p = 0; p < numPoints*2; p += 2) {
3511552f7358SJed Brown       ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
35121a271a75SMatthew G. Knepley       asize += dof;
3513552f7358SJed Brown     }
3514bd6c0d32SMatthew G. Knepley     if (!values) {
3515d9917b9dSMatthew G. Knepley       if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);}
35161a271a75SMatthew G. Knepley       else           {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);}
35171a271a75SMatthew G. Knepley       if (csize) *csize = asize;
3518bd6c0d32SMatthew G. Knepley       PetscFunctionReturn(0);
3519bd6c0d32SMatthew G. Knepley     }
35201a271a75SMatthew G. Knepley     ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr);
3521d0f6b257SMatthew G. Knepley   } else {
3522d0f6b257SMatthew G. Knepley     array = *values;
3523d0f6b257SMatthew G. Knepley   }
3524552f7358SJed Brown   ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
35251a271a75SMatthew G. Knepley   /* Get values */
3526ef90cfe2SMatthew G. Knepley   if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);}
35271a271a75SMatthew G. Knepley   else               {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);}
35281a271a75SMatthew G. Knepley   /* Cleanup points */
35291a271a75SMatthew G. Knepley   if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);}
35301a271a75SMatthew G. Knepley   else           {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);}
35311a271a75SMatthew G. Knepley   /* Cleanup array */
3532552f7358SJed Brown   ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
3533d0f6b257SMatthew G. Knepley   if (!*values) {
3534552f7358SJed Brown     if (csize) *csize = size;
3535552f7358SJed Brown     *values = array;
3536d0f6b257SMatthew G. Knepley   } else {
3537d0f6b257SMatthew G. Knepley     if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size);
3538d0f6b257SMatthew G. Knepley     *csize = size;
3539d0f6b257SMatthew G. Knepley   }
3540552f7358SJed Brown   PetscFunctionReturn(0);
3541552f7358SJed Brown }
3542552f7358SJed Brown 
3543552f7358SJed Brown #undef __FUNCT__
3544552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure"
3545552f7358SJed Brown /*@C
3546552f7358SJed Brown   DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point'
3547552f7358SJed Brown 
3548552f7358SJed Brown   Not collective
3549552f7358SJed Brown 
3550552f7358SJed Brown   Input Parameters:
3551552f7358SJed Brown + dm - The DM
35520298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section
3553552f7358SJed Brown . v - The local vector
3554552f7358SJed Brown . point - The sieve point in the DM
35550298fd71SBarry Smith . csize - The number of values in the closure, or NULL
3556552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed
3557552f7358SJed Brown 
35583813dfbdSMatthew G Knepley   Fortran Notes:
35593813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
35603813dfbdSMatthew G Knepley   include petsc.h90 in your code.
35613813dfbdSMatthew G Knepley 
35623813dfbdSMatthew G Knepley   The csize argument is not present in the Fortran 90 binding since it is internal to the array.
35633813dfbdSMatthew G Knepley 
3564552f7358SJed Brown   Level: intermediate
3565552f7358SJed Brown 
3566552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
3567552f7358SJed Brown @*/
35687c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
3569a6dfd86eSKarl Rupp {
3570552f7358SJed Brown   PetscInt       size = 0;
3571552f7358SJed Brown   PetscErrorCode ierr;
3572552f7358SJed Brown 
3573552f7358SJed Brown   PetscFunctionBegin;
3574552f7358SJed Brown   /* Should work without recalculating size */
3575552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr);
3576552f7358SJed Brown   PetscFunctionReturn(0);
3577552f7358SJed Brown }
3578552f7358SJed Brown 
3579552f7358SJed Brown PETSC_STATIC_INLINE void add   (PetscScalar *x, PetscScalar y) {*x += y;}
3580552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x  = y;}
3581552f7358SJed Brown 
3582552f7358SJed Brown #undef __FUNCT__
3583552f7358SJed Brown #define __FUNCT__ "updatePoint_private"
35841a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePoint_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, PetscInt orientation, const PetscScalar values[], PetscScalar array[])
3585552f7358SJed Brown {
3586552f7358SJed Brown   PetscInt        cdof;   /* The number of constraints on this point */
3587552f7358SJed Brown   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
3588552f7358SJed Brown   PetscScalar    *a;
3589552f7358SJed Brown   PetscInt        off, cind = 0, k;
3590552f7358SJed Brown   PetscErrorCode  ierr;
3591552f7358SJed Brown 
3592552f7358SJed Brown   PetscFunctionBegin;
3593552f7358SJed Brown   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
3594552f7358SJed Brown   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
3595552f7358SJed Brown   a    = &array[off];
3596552f7358SJed Brown   if (!cdof || setBC) {
3597552f7358SJed Brown     if (orientation >= 0) {
3598552f7358SJed Brown       for (k = 0; k < dof; ++k) {
3599552f7358SJed Brown         fuse(&a[k], values[k]);
3600552f7358SJed Brown       }
3601552f7358SJed Brown     } else {
3602552f7358SJed Brown       for (k = 0; k < dof; ++k) {
3603552f7358SJed Brown         fuse(&a[k], values[dof-k-1]);
3604552f7358SJed Brown       }
3605552f7358SJed Brown     }
3606552f7358SJed Brown   } else {
3607552f7358SJed Brown     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
3608552f7358SJed Brown     if (orientation >= 0) {
3609552f7358SJed Brown       for (k = 0; k < dof; ++k) {
3610552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
3611552f7358SJed Brown         fuse(&a[k], values[k]);
3612552f7358SJed Brown       }
3613552f7358SJed Brown     } else {
3614552f7358SJed Brown       for (k = 0; k < dof; ++k) {
3615552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
3616552f7358SJed Brown         fuse(&a[k], values[dof-k-1]);
3617552f7358SJed Brown       }
3618552f7358SJed Brown     }
3619552f7358SJed Brown   }
3620552f7358SJed Brown   PetscFunctionReturn(0);
3621552f7358SJed Brown }
3622552f7358SJed Brown 
3623552f7358SJed Brown #undef __FUNCT__
3624a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private"
36251a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointBC_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscInt orientation, const PetscScalar values[], PetscScalar array[])
3626a5e93ea8SMatthew G. Knepley {
3627a5e93ea8SMatthew G. Knepley   PetscInt        cdof;   /* The number of constraints on this point */
3628a5e93ea8SMatthew G. Knepley   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
3629a5e93ea8SMatthew G. Knepley   PetscScalar    *a;
3630a5e93ea8SMatthew G. Knepley   PetscInt        off, cind = 0, k;
3631a5e93ea8SMatthew G. Knepley   PetscErrorCode  ierr;
3632a5e93ea8SMatthew G. Knepley 
3633a5e93ea8SMatthew G. Knepley   PetscFunctionBegin;
3634a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
3635a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
3636a5e93ea8SMatthew G. Knepley   a    = &array[off];
3637a5e93ea8SMatthew G. Knepley   if (cdof) {
3638a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
3639a5e93ea8SMatthew G. Knepley     if (orientation >= 0) {
3640a5e93ea8SMatthew G. Knepley       for (k = 0; k < dof; ++k) {
3641a5e93ea8SMatthew G. Knepley         if ((cind < cdof) && (k == cdofs[cind])) {
3642a5e93ea8SMatthew G. Knepley           fuse(&a[k], values[k]);
3643a5e93ea8SMatthew G. Knepley           ++cind;
3644a5e93ea8SMatthew G. Knepley         }
3645a5e93ea8SMatthew G. Knepley       }
3646a5e93ea8SMatthew G. Knepley     } else {
3647a5e93ea8SMatthew G. Knepley       for (k = 0; k < dof; ++k) {
3648a5e93ea8SMatthew G. Knepley         if ((cind < cdof) && (k == cdofs[cind])) {
3649a5e93ea8SMatthew G. Knepley           fuse(&a[k], values[dof-k-1]);
3650a5e93ea8SMatthew G. Knepley           ++cind;
3651a5e93ea8SMatthew G. Knepley         }
3652a5e93ea8SMatthew G. Knepley       }
3653a5e93ea8SMatthew G. Knepley     }
3654a5e93ea8SMatthew G. Knepley   }
3655a5e93ea8SMatthew G. Knepley   PetscFunctionReturn(0);
3656a5e93ea8SMatthew G. Knepley }
3657a5e93ea8SMatthew G. Knepley 
3658a5e93ea8SMatthew G. Knepley #undef __FUNCT__
3659552f7358SJed Brown #define __FUNCT__ "updatePointFields_private"
36601a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointFields_private(PetscSection section, PetscInt point, PetscInt o, PetscInt f, PetscInt fcomp, void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, const PetscScalar values[], PetscInt *offset, PetscScalar array[])
3661a6dfd86eSKarl Rupp {
3662552f7358SJed Brown   PetscScalar    *a;
36631a271a75SMatthew G. Knepley   PetscInt        fdof, foff, fcdof, foffset = *offset;
36641a271a75SMatthew G. Knepley   const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
36651a271a75SMatthew G. Knepley   PetscInt        cind = 0, k, c;
3666552f7358SJed Brown   PetscErrorCode  ierr;
3667552f7358SJed Brown 
3668552f7358SJed Brown   PetscFunctionBegin;
3669552f7358SJed Brown   ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
3670552f7358SJed Brown   ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr);
36711a271a75SMatthew G. Knepley   ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr);
36721a271a75SMatthew G. Knepley   a    = &array[foff];
3673552f7358SJed Brown   if (!fcdof || setBC) {
36741a271a75SMatthew G. Knepley     if (o >= 0) {
36751a271a75SMatthew G. Knepley       for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]);
3676552f7358SJed Brown     } else {
3677552f7358SJed Brown       for (k = fdof/fcomp-1; k >= 0; --k) {
3678552f7358SJed Brown         for (c = 0; c < fcomp; ++c) {
36791a271a75SMatthew G. Knepley           fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]);
3680552f7358SJed Brown         }
3681552f7358SJed Brown       }
3682552f7358SJed Brown     }
3683552f7358SJed Brown   } else {
3684552f7358SJed Brown     ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
36851a271a75SMatthew G. Knepley     if (o >= 0) {
3686552f7358SJed Brown       for (k = 0; k < fdof; ++k) {
3687552f7358SJed Brown         if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;}
36881a271a75SMatthew G. Knepley         fuse(&a[k], values[foffset+k]);
3689552f7358SJed Brown       }
3690552f7358SJed Brown     } else {
3691552f7358SJed Brown       for (k = fdof/fcomp-1; k >= 0; --k) {
3692552f7358SJed Brown         for (c = 0; c < fcomp; ++c) {
3693552f7358SJed Brown           if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;}
36941a271a75SMatthew G. Knepley           fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]);
3695552f7358SJed Brown         }
3696552f7358SJed Brown       }
3697552f7358SJed Brown     }
3698552f7358SJed Brown   }
36991a271a75SMatthew G. Knepley   *offset += fdof;
3700552f7358SJed Brown   PetscFunctionReturn(0);
3701552f7358SJed Brown }
3702552f7358SJed Brown 
3703552f7358SJed Brown #undef __FUNCT__
3704a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private"
37051a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointFieldsBC_private(PetscSection section, PetscInt point, PetscInt o, PetscInt f, PetscInt fcomp, void (*fuse)(PetscScalar*, PetscScalar), const PetscScalar values[], PetscInt *offset, PetscScalar array[])
3706a5e93ea8SMatthew G. Knepley {
3707a5e93ea8SMatthew G. Knepley   PetscScalar    *a;
37081a271a75SMatthew G. Knepley   PetscInt        fdof, foff, fcdof, foffset = *offset;
37091a271a75SMatthew G. Knepley   const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
37101a271a75SMatthew G. Knepley   PetscInt        cind = 0, k, c;
3711a5e93ea8SMatthew G. Knepley   PetscErrorCode  ierr;
3712a5e93ea8SMatthew G. Knepley 
3713a5e93ea8SMatthew G. Knepley   PetscFunctionBegin;
3714a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
3715a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr);
37161a271a75SMatthew G. Knepley   ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr);
37171a271a75SMatthew G. Knepley   a    = &array[foff];
3718a5e93ea8SMatthew G. Knepley   if (fcdof) {
3719a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
37201a271a75SMatthew G. Knepley     if (o >= 0) {
3721a5e93ea8SMatthew G. Knepley       for (k = 0; k < fdof; ++k) {
3722a5e93ea8SMatthew G. Knepley         if ((cind < fcdof) && (k == fcdofs[cind])) {
37231a271a75SMatthew G. Knepley           fuse(&a[k], values[foffset+k]);
3724a5e93ea8SMatthew G. Knepley           ++cind;
3725a5e93ea8SMatthew G. Knepley         }
3726a5e93ea8SMatthew G. Knepley       }
3727a5e93ea8SMatthew G. Knepley     } else {
3728a5e93ea8SMatthew G. Knepley       for (k = fdof/fcomp-1; k >= 0; --k) {
3729a5e93ea8SMatthew G. Knepley         for (c = 0; c < fcomp; ++c) {
3730a5e93ea8SMatthew G. Knepley           if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {
37311a271a75SMatthew G. Knepley             fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]);
3732a5e93ea8SMatthew G. Knepley             ++cind;
3733a5e93ea8SMatthew G. Knepley           }
3734a5e93ea8SMatthew G. Knepley         }
3735a5e93ea8SMatthew G. Knepley       }
3736a5e93ea8SMatthew G. Knepley     }
3737a5e93ea8SMatthew G. Knepley   }
37381a271a75SMatthew G. Knepley   *offset += fdof;
3739a5e93ea8SMatthew G. Knepley   PetscFunctionReturn(0);
3740a5e93ea8SMatthew G. Knepley }
3741a5e93ea8SMatthew G. Knepley 
3742a5e93ea8SMatthew G. Knepley #undef __FUNCT__
37431b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static"
37441a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode)
3745a6dfd86eSKarl Rupp {
3746552f7358SJed Brown   PetscScalar    *array;
37471b406b76SMatthew G. Knepley   const PetscInt *cone, *coneO;
37481b406b76SMatthew G. Knepley   PetscInt        pStart, pEnd, p, numPoints, off, dof;
3749552f7358SJed Brown   PetscErrorCode  ierr;
3750552f7358SJed Brown 
37511b406b76SMatthew G. Knepley   PetscFunctionBeginHot;
3752b6ebb6e6SMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3753b6ebb6e6SMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr);
3754b6ebb6e6SMatthew G. Knepley   ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
3755b6ebb6e6SMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr);
3756b6ebb6e6SMatthew G. Knepley   ierr = VecGetArray(v, &array);CHKERRQ(ierr);
3757b6ebb6e6SMatthew G. Knepley   for (p = 0, off = 0; p <= numPoints; ++p, off += dof) {
3758b6ebb6e6SMatthew G. Knepley     const PetscInt cp = !p ? point : cone[p-1];
3759b6ebb6e6SMatthew G. Knepley     const PetscInt o  = !p ? 0     : coneO[p-1];
3760b6ebb6e6SMatthew G. Knepley 
3761b6ebb6e6SMatthew G. Knepley     if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;}
3762b6ebb6e6SMatthew G. Knepley     ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
3763b6ebb6e6SMatthew G. Knepley     /* ADD_VALUES */
3764b6ebb6e6SMatthew G. Knepley     {
3765b6ebb6e6SMatthew G. Knepley       const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
3766b6ebb6e6SMatthew G. Knepley       PetscScalar    *a;
3767b6ebb6e6SMatthew G. Knepley       PetscInt        cdof, coff, cind = 0, k;
3768b6ebb6e6SMatthew G. Knepley 
3769b6ebb6e6SMatthew G. Knepley       ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr);
3770b6ebb6e6SMatthew G. Knepley       ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr);
3771b6ebb6e6SMatthew G. Knepley       a    = &array[coff];
3772b6ebb6e6SMatthew G. Knepley       if (!cdof) {
3773b6ebb6e6SMatthew G. Knepley         if (o >= 0) {
3774b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
3775b6ebb6e6SMatthew G. Knepley             a[k] += values[off+k];
3776b6ebb6e6SMatthew G. Knepley           }
3777b6ebb6e6SMatthew G. Knepley         } else {
3778b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
3779b6ebb6e6SMatthew G. Knepley             a[k] += values[off+dof-k-1];
3780b6ebb6e6SMatthew G. Knepley           }
3781b6ebb6e6SMatthew G. Knepley         }
3782b6ebb6e6SMatthew G. Knepley       } else {
3783b6ebb6e6SMatthew G. Knepley         ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr);
3784b6ebb6e6SMatthew G. Knepley         if (o >= 0) {
3785b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
3786b6ebb6e6SMatthew G. Knepley             if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
3787b6ebb6e6SMatthew G. Knepley             a[k] += values[off+k];
3788b6ebb6e6SMatthew G. Knepley           }
3789b6ebb6e6SMatthew G. Knepley         } else {
3790b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
3791b6ebb6e6SMatthew G. Knepley             if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
3792b6ebb6e6SMatthew G. Knepley             a[k] += values[off+dof-k-1];
3793b6ebb6e6SMatthew G. Knepley           }
3794b6ebb6e6SMatthew G. Knepley         }
3795b6ebb6e6SMatthew G. Knepley       }
3796b6ebb6e6SMatthew G. Knepley     }
3797b6ebb6e6SMatthew G. Knepley   }
3798b6ebb6e6SMatthew G. Knepley   ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
3799b6ebb6e6SMatthew G. Knepley   PetscFunctionReturn(0);
3800b6ebb6e6SMatthew G. Knepley }
38011b406b76SMatthew G. Knepley 
38021b406b76SMatthew G. Knepley #undef __FUNCT__
38031b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure"
38041b406b76SMatthew G. Knepley /*@C
38051b406b76SMatthew G. Knepley   DMPlexVecSetClosure - Set an array of the values on the closure of 'point'
38061b406b76SMatthew G. Knepley 
38071b406b76SMatthew G. Knepley   Not collective
38081b406b76SMatthew G. Knepley 
38091b406b76SMatthew G. Knepley   Input Parameters:
38101b406b76SMatthew G. Knepley + dm - The DM
38111b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section
38121b406b76SMatthew G. Knepley . v - The local vector
38131b406b76SMatthew G. Knepley . point - The sieve point in the DM
38141b406b76SMatthew G. Knepley . values - The array of values
38151b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions
38161b406b76SMatthew G. Knepley 
38171b406b76SMatthew G. Knepley   Fortran Notes:
38181b406b76SMatthew G. Knepley   This routine is only available in Fortran 90, and you must include petsc.h90 in your code.
38191b406b76SMatthew G. Knepley 
38201b406b76SMatthew G. Knepley   Level: intermediate
38211b406b76SMatthew G. Knepley 
38221b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure()
38231b406b76SMatthew G. Knepley @*/
38241b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode)
38251b406b76SMatthew G. Knepley {
38261b406b76SMatthew G. Knepley   PetscSection    clSection;
38271b406b76SMatthew G. Knepley   IS              clPoints;
38281b406b76SMatthew G. Knepley   PetscScalar    *array;
38291b406b76SMatthew G. Knepley   PetscInt       *points = NULL;
38301b406b76SMatthew G. Knepley   const PetscInt *clp;
38311a271a75SMatthew G. Knepley   PetscInt        depth, numFields, numPoints, p;
38321b406b76SMatthew G. Knepley   PetscErrorCode  ierr;
38331b406b76SMatthew G. Knepley 
38341a271a75SMatthew G. Knepley   PetscFunctionBeginHot;
38351b406b76SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
38361b406b76SMatthew G. Knepley   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
38371a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
38381a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
38391b406b76SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
38401b406b76SMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
38411b406b76SMatthew G. Knepley   if (depth == 1 && numFields < 2 && mode == ADD_VALUES) {
38421a271a75SMatthew G. Knepley     ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr);
38431b406b76SMatthew G. Knepley     PetscFunctionReturn(0);
38441b406b76SMatthew G. Knepley   }
38451a271a75SMatthew G. Knepley   /* Get points */
38461b406b76SMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr);
38471b406b76SMatthew G. Knepley   if (!clPoints) {
38481a271a75SMatthew G. Knepley     PetscInt pStart, pEnd, q;
38491a271a75SMatthew G. Knepley 
38501a271a75SMatthew G. Knepley     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3851552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3852552f7358SJed Brown     /* Compress out points not in the section */
3853552f7358SJed Brown     for (p = 0, q = 0; p < numPoints*2; p += 2) {
3854552f7358SJed Brown       if ((points[p] >= pStart) && (points[p] < pEnd)) {
3855552f7358SJed Brown         points[q*2]   = points[p];
3856552f7358SJed Brown         points[q*2+1] = points[p+1];
3857552f7358SJed Brown         ++q;
3858552f7358SJed Brown       }
3859552f7358SJed Brown     }
3860552f7358SJed Brown     numPoints = q;
38611b406b76SMatthew G. Knepley   } else {
38621b406b76SMatthew G. Knepley     PetscInt dof, off;
3863552f7358SJed Brown 
38641b406b76SMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
38651b406b76SMatthew G. Knepley     ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
38661b406b76SMatthew G. Knepley     ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr);
38671a271a75SMatthew G. Knepley     numPoints = dof/2;
38681b406b76SMatthew G. Knepley     points    = (PetscInt *) &clp[off];
3869552f7358SJed Brown   }
38701a271a75SMatthew G. Knepley   /* Get array */
3871552f7358SJed Brown   ierr = VecGetArray(v, &array);CHKERRQ(ierr);
38721a271a75SMatthew G. Knepley   /* Get values */
3873ef90cfe2SMatthew G. Knepley   if (numFields > 0) {
38741a271a75SMatthew G. Knepley     PetscInt offset = 0, fcomp, f;
3875552f7358SJed Brown     for (f = 0; f < numFields; ++f) {
38761a271a75SMatthew G. Knepley       ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
3877552f7358SJed Brown       switch (mode) {
3878552f7358SJed Brown       case INSERT_VALUES:
3879552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
38801a271a75SMatthew G. Knepley           const PetscInt point = points[p];
38811a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
38821a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array);
3883552f7358SJed Brown         } break;
3884552f7358SJed Brown       case INSERT_ALL_VALUES:
3885552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
38861a271a75SMatthew G. Knepley           const PetscInt point = points[p];
38871a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
38881a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array);
3889552f7358SJed Brown         } break;
3890a5e93ea8SMatthew G. Knepley       case INSERT_BC_VALUES:
3891a5e93ea8SMatthew G. Knepley         for (p = 0; p < numPoints*2; p += 2) {
38921a271a75SMatthew G. Knepley           const PetscInt point = points[p];
38931a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
38941a271a75SMatthew G. Knepley           updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array);
3895a5e93ea8SMatthew G. Knepley         } break;
3896552f7358SJed Brown       case ADD_VALUES:
3897552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
38981a271a75SMatthew G. Knepley           const PetscInt point = points[p];
38991a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
39001a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array);
3901552f7358SJed Brown         } break;
3902552f7358SJed Brown       case ADD_ALL_VALUES:
3903552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
39041a271a75SMatthew G. Knepley           const PetscInt point = points[p];
39051a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
39061a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array);
3907552f7358SJed Brown         } break;
3908552f7358SJed Brown       default:
390982f516ccSBarry Smith         SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
3910552f7358SJed Brown       }
39111a271a75SMatthew G. Knepley     }
3912552f7358SJed Brown   } else {
39131a271a75SMatthew G. Knepley     PetscInt dof, off;
39141a271a75SMatthew G. Knepley 
3915552f7358SJed Brown     switch (mode) {
3916552f7358SJed Brown     case INSERT_VALUES:
3917552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
3918552f7358SJed Brown         PetscInt o = points[p+1];
3919552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
3920552f7358SJed Brown         updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array);
3921552f7358SJed Brown       } break;
3922552f7358SJed Brown     case INSERT_ALL_VALUES:
3923552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
3924552f7358SJed Brown         PetscInt o = points[p+1];
3925552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
3926552f7358SJed Brown         updatePoint_private(section, points[p], dof, insert, PETSC_TRUE,  o, &values[off], array);
3927552f7358SJed Brown       } break;
3928a5e93ea8SMatthew G. Knepley     case INSERT_BC_VALUES:
3929a5e93ea8SMatthew G. Knepley       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
3930a5e93ea8SMatthew G. Knepley         PetscInt o = points[p+1];
3931a5e93ea8SMatthew G. Knepley         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
3932a5e93ea8SMatthew G. Knepley         updatePointBC_private(section, points[p], dof, insert,  o, &values[off], array);
3933a5e93ea8SMatthew G. Knepley       } break;
3934552f7358SJed Brown     case ADD_VALUES:
3935552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
3936552f7358SJed Brown         PetscInt o = points[p+1];
3937552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
3938552f7358SJed Brown         updatePoint_private(section, points[p], dof, add,    PETSC_FALSE, o, &values[off], array);
3939552f7358SJed Brown       } break;
3940552f7358SJed Brown     case ADD_ALL_VALUES:
3941552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
3942552f7358SJed Brown         PetscInt o = points[p+1];
3943552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
3944552f7358SJed Brown         updatePoint_private(section, points[p], dof, add,    PETSC_TRUE,  o, &values[off], array);
3945552f7358SJed Brown       } break;
3946552f7358SJed Brown     default:
394782f516ccSBarry Smith       SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
3948552f7358SJed Brown     }
3949552f7358SJed Brown   }
39501a271a75SMatthew G. Knepley   /* Cleanup points */
39511a271a75SMatthew G. Knepley   if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);}
39521a271a75SMatthew G. Knepley   else           {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);}
39531a271a75SMatthew G. Knepley   /* Cleanup array */
3954552f7358SJed Brown   ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
3955552f7358SJed Brown   PetscFunctionReturn(0);
3956552f7358SJed Brown }
3957552f7358SJed Brown 
3958552f7358SJed Brown #undef __FUNCT__
3959e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal"
3960e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode)
3961e07394fbSMatthew G. Knepley {
3962e07394fbSMatthew G. Knepley   PetscSection    clSection;
3963e07394fbSMatthew G. Knepley   IS              clPoints;
3964e07394fbSMatthew G. Knepley   PetscScalar    *array;
3965e07394fbSMatthew G. Knepley   PetscInt       *points = NULL;
3966e07394fbSMatthew G. Knepley   const PetscInt *clp;
3967e07394fbSMatthew G. Knepley   PetscInt        numFields, numPoints, p;
3968e07394fbSMatthew G. Knepley   PetscInt        offset = 0, fcomp, f;
3969e07394fbSMatthew G. Knepley   PetscErrorCode  ierr;
3970e07394fbSMatthew G. Knepley 
3971e07394fbSMatthew G. Knepley   PetscFunctionBeginHot;
3972e07394fbSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3973e07394fbSMatthew G. Knepley   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
3974e07394fbSMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
3975e07394fbSMatthew G. Knepley   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
3976e07394fbSMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
3977e07394fbSMatthew G. Knepley   /* Get points */
3978e07394fbSMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr);
3979e07394fbSMatthew G. Knepley   if (!clPoints) {
3980e07394fbSMatthew G. Knepley     PetscInt pStart, pEnd, q;
3981e07394fbSMatthew G. Knepley 
3982e07394fbSMatthew G. Knepley     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3983e07394fbSMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3984e07394fbSMatthew G. Knepley     /* Compress out points not in the section */
3985e07394fbSMatthew G. Knepley     for (p = 0, q = 0; p < numPoints*2; p += 2) {
3986e07394fbSMatthew G. Knepley       if ((points[p] >= pStart) && (points[p] < pEnd)) {
3987e07394fbSMatthew G. Knepley         points[q*2]   = points[p];
3988e07394fbSMatthew G. Knepley         points[q*2+1] = points[p+1];
3989e07394fbSMatthew G. Knepley         ++q;
3990e07394fbSMatthew G. Knepley       }
3991e07394fbSMatthew G. Knepley     }
3992e07394fbSMatthew G. Knepley     numPoints = q;
3993e07394fbSMatthew G. Knepley   } else {
3994e07394fbSMatthew G. Knepley     PetscInt dof, off;
3995e07394fbSMatthew G. Knepley 
3996e07394fbSMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
3997e07394fbSMatthew G. Knepley     ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
3998e07394fbSMatthew G. Knepley     ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr);
3999e07394fbSMatthew G. Knepley     numPoints = dof/2;
4000e07394fbSMatthew G. Knepley     points    = (PetscInt *) &clp[off];
4001e07394fbSMatthew G. Knepley   }
4002e07394fbSMatthew G. Knepley   /* Get array */
4003e07394fbSMatthew G. Knepley   ierr = VecGetArray(v, &array);CHKERRQ(ierr);
4004e07394fbSMatthew G. Knepley   /* Get values */
4005e07394fbSMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
4006e07394fbSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
4007e07394fbSMatthew G. Knepley     if (!fieldActive[f]) {
4008e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4009e07394fbSMatthew G. Knepley         PetscInt fdof;
4010e07394fbSMatthew G. Knepley         ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
4011e07394fbSMatthew G. Knepley         offset += fdof;
4012e07394fbSMatthew G. Knepley       }
4013e07394fbSMatthew G. Knepley       continue;
4014e07394fbSMatthew G. Knepley     }
4015e07394fbSMatthew G. Knepley     switch (mode) {
4016e07394fbSMatthew G. Knepley     case INSERT_VALUES:
4017e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4018e07394fbSMatthew G. Knepley         const PetscInt point = points[p];
4019e07394fbSMatthew G. Knepley         const PetscInt o     = points[p+1];
4020e07394fbSMatthew G. Knepley         updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array);
4021e07394fbSMatthew G. Knepley       } break;
4022e07394fbSMatthew G. Knepley     case INSERT_ALL_VALUES:
4023e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4024e07394fbSMatthew G. Knepley         const PetscInt point = points[p];
4025e07394fbSMatthew G. Knepley         const PetscInt o     = points[p+1];
4026e07394fbSMatthew G. Knepley         updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array);
4027e07394fbSMatthew G. Knepley         } break;
4028e07394fbSMatthew G. Knepley     case INSERT_BC_VALUES:
4029e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4030e07394fbSMatthew G. Knepley         const PetscInt point = points[p];
4031e07394fbSMatthew G. Knepley         const PetscInt o     = points[p+1];
4032e07394fbSMatthew G. Knepley         updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array);
4033e07394fbSMatthew G. Knepley       } break;
4034e07394fbSMatthew G. Knepley     case ADD_VALUES:
4035e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4036e07394fbSMatthew G. Knepley         const PetscInt point = points[p];
4037e07394fbSMatthew G. Knepley         const PetscInt o     = points[p+1];
4038e07394fbSMatthew G. Knepley         updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array);
4039e07394fbSMatthew G. Knepley       } break;
4040e07394fbSMatthew G. Knepley     case ADD_ALL_VALUES:
4041e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4042e07394fbSMatthew G. Knepley         const PetscInt point = points[p];
4043e07394fbSMatthew G. Knepley         const PetscInt o     = points[p+1];
4044e07394fbSMatthew G. Knepley         updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array);
4045e07394fbSMatthew G. Knepley       } break;
4046e07394fbSMatthew G. Knepley     default:
4047e07394fbSMatthew G. Knepley       SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
4048e07394fbSMatthew G. Knepley     }
4049e07394fbSMatthew G. Knepley   }
4050e07394fbSMatthew G. Knepley   /* Cleanup points */
4051e07394fbSMatthew G. Knepley   if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);}
4052e07394fbSMatthew G. Knepley   else           {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);}
4053e07394fbSMatthew G. Knepley   /* Cleanup array */
4054e07394fbSMatthew G. Knepley   ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
4055e07394fbSMatthew G. Knepley   PetscFunctionReturn(0);
4056e07394fbSMatthew G. Knepley }
4057e07394fbSMatthew G. Knepley 
4058e07394fbSMatthew G. Knepley #undef __FUNCT__
4059552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues"
4060b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[])
4061552f7358SJed Brown {
4062552f7358SJed Brown   PetscMPIInt    rank;
4063552f7358SJed Brown   PetscInt       i, j;
4064552f7358SJed Brown   PetscErrorCode ierr;
4065552f7358SJed Brown 
4066552f7358SJed Brown   PetscFunctionBegin;
406782f516ccSBarry Smith   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr);
406877a6746dSMatthew G Knepley   ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr);
4069b0ecff45SMatthew G. Knepley   for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);}
4070b0ecff45SMatthew G. Knepley   for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);}
4071b0ecff45SMatthew G. Knepley   numCIndices = numCIndices ? numCIndices : numRIndices;
4072b0ecff45SMatthew G. Knepley   for (i = 0; i < numRIndices; i++) {
407377a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr);
4074b0ecff45SMatthew G. Knepley     for (j = 0; j < numCIndices; j++) {
4075519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX)
40767eba1a17SMatthew G. Knepley       ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr);
4077552f7358SJed Brown #else
4078b0ecff45SMatthew G. Knepley       ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr);
4079552f7358SJed Brown #endif
4080552f7358SJed Brown     }
408177a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
4082552f7358SJed Brown   }
4083552f7358SJed Brown   PetscFunctionReturn(0);
4084552f7358SJed Brown }
4085552f7358SJed Brown 
4086552f7358SJed Brown #undef __FUNCT__
4087552f7358SJed Brown #define __FUNCT__ "indicesPoint_private"
4088552f7358SJed Brown /* . off - The global offset of this point */
4089e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[])
4090a6dfd86eSKarl Rupp {
4091e6ccafaeSMatthew G Knepley   PetscInt        dof;    /* The number of unknowns on this point */
4092552f7358SJed Brown   PetscInt        cdof;   /* The number of constraints on this point */
4093552f7358SJed Brown   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
4094552f7358SJed Brown   PetscInt        cind = 0, k;
4095552f7358SJed Brown   PetscErrorCode  ierr;
4096552f7358SJed Brown 
4097552f7358SJed Brown   PetscFunctionBegin;
4098552f7358SJed Brown   ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
4099552f7358SJed Brown   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
4100552f7358SJed Brown   if (!cdof || setBC) {
4101552f7358SJed Brown     if (orientation >= 0) {
4102e6ccafaeSMatthew G Knepley       for (k = 0; k < dof; ++k) indices[*loff+k] = off+k;
4103552f7358SJed Brown     } else {
4104e6ccafaeSMatthew G Knepley       for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k;
4105552f7358SJed Brown     }
4106552f7358SJed Brown   } else {
4107552f7358SJed Brown     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
4108552f7358SJed Brown     if (orientation >= 0) {
4109552f7358SJed Brown       for (k = 0; k < dof; ++k) {
4110552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {
4111552f7358SJed Brown           /* Insert check for returning constrained indices */
4112e6ccafaeSMatthew G Knepley           indices[*loff+k] = -(off+k+1);
4113552f7358SJed Brown           ++cind;
4114552f7358SJed Brown         } else {
4115e6ccafaeSMatthew G Knepley           indices[*loff+k] = off+k-cind;
4116552f7358SJed Brown         }
4117552f7358SJed Brown       }
4118552f7358SJed Brown     } else {
4119552f7358SJed Brown       for (k = 0; k < dof; ++k) {
4120552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {
4121552f7358SJed Brown           /* Insert check for returning constrained indices */
4122e6ccafaeSMatthew G Knepley           indices[*loff+dof-k-1] = -(off+k+1);
4123552f7358SJed Brown           ++cind;
4124552f7358SJed Brown         } else {
4125e6ccafaeSMatthew G Knepley           indices[*loff+dof-k-1] = off+k-cind;
4126552f7358SJed Brown         }
4127552f7358SJed Brown       }
4128552f7358SJed Brown     }
4129552f7358SJed Brown   }
4130e6ccafaeSMatthew G Knepley   *loff += dof;
4131552f7358SJed Brown   PetscFunctionReturn(0);
4132552f7358SJed Brown }
4133552f7358SJed Brown 
4134552f7358SJed Brown #undef __FUNCT__
4135552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private"
4136552f7358SJed Brown /* . off - The global offset of this point */
4137a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[])
4138a6dfd86eSKarl Rupp {
4139552f7358SJed Brown   PetscInt       numFields, foff, f;
4140552f7358SJed Brown   PetscErrorCode ierr;
4141552f7358SJed Brown 
4142552f7358SJed Brown   PetscFunctionBegin;
4143552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4144552f7358SJed Brown   for (f = 0, foff = 0; f < numFields; ++f) {
4145552f7358SJed Brown     PetscInt        fdof, fcomp, cfdof;
4146552f7358SJed Brown     const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
4147552f7358SJed Brown     PetscInt        cind = 0, k, c;
4148552f7358SJed Brown 
4149552f7358SJed Brown     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
4150552f7358SJed Brown     ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
4151552f7358SJed Brown     ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr);
4152552f7358SJed Brown     if (!cfdof || setBC) {
4153552f7358SJed Brown       if (orientation >= 0) {
41540d644c17SKarl Rupp         for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k;
4155552f7358SJed Brown       } else {
4156552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
4157552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
4158552f7358SJed Brown             indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c;
4159552f7358SJed Brown           }
4160552f7358SJed Brown         }
4161552f7358SJed Brown       }
4162552f7358SJed Brown     } else {
4163552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
4164552f7358SJed Brown       if (orientation >= 0) {
4165552f7358SJed Brown         for (k = 0; k < fdof; ++k) {
4166552f7358SJed Brown           if ((cind < cfdof) && (k == fcdofs[cind])) {
4167552f7358SJed Brown             indices[foffs[f]+k] = -(off+foff+k+1);
4168552f7358SJed Brown             ++cind;
4169552f7358SJed Brown           } else {
4170552f7358SJed Brown             indices[foffs[f]+k] = off+foff+k-cind;
4171552f7358SJed Brown           }
4172552f7358SJed Brown         }
4173552f7358SJed Brown       } else {
4174552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
4175552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
4176552f7358SJed Brown             if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) {
4177552f7358SJed Brown               indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1);
4178552f7358SJed Brown               ++cind;
4179552f7358SJed Brown             } else {
4180552f7358SJed Brown               indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind;
4181552f7358SJed Brown             }
4182552f7358SJed Brown           }
4183552f7358SJed Brown         }
4184552f7358SJed Brown       }
4185552f7358SJed Brown     }
4186552f7358SJed Brown     foff     += fdof - cfdof;
4187552f7358SJed Brown     foffs[f] += fdof;
4188552f7358SJed Brown   }
4189552f7358SJed Brown   PetscFunctionReturn(0);
4190552f7358SJed Brown }
4191552f7358SJed Brown 
4192552f7358SJed Brown #undef __FUNCT__
4193f7c74593SToby Isaac #define __FUNCT__ "DMPlexAnchorsModifyMat"
4194f7c74593SToby Isaac static PetscErrorCode DMPlexAnchorsModifyMat(DM dm, PetscSection section, PetscInt numPoints, PetscInt numIndices, const PetscInt points[], const PetscScalar values[], PetscInt *outNumPoints, PetscInt *outNumIndices, PetscInt *outPoints[], PetscScalar *outValues[], PetscInt offsets[])
4195d3d1a6afSToby Isaac {
4196d3d1a6afSToby Isaac   Mat             cMat;
4197d3d1a6afSToby Isaac   PetscSection    aSec, cSec;
4198d3d1a6afSToby Isaac   IS              aIS;
4199d3d1a6afSToby Isaac   PetscInt        aStart = -1, aEnd = -1;
4200d3d1a6afSToby Isaac   const PetscInt  *anchors;
4201e17c06e0SMatthew G. Knepley   PetscInt        numFields, f, p, q, newP = 0;
4202d3d1a6afSToby Isaac   PetscInt        newNumPoints = 0, newNumIndices = 0;
4203d3d1a6afSToby Isaac   PetscInt        *newPoints, *indices, *newIndices;
4204d3d1a6afSToby Isaac   PetscInt        maxAnchor, maxDof;
4205d3d1a6afSToby Isaac   PetscInt        newOffsets[32];
4206d3d1a6afSToby Isaac   PetscInt        *pointMatOffsets[32];
4207d3d1a6afSToby Isaac   PetscInt        *newPointOffsets[32];
4208d3d1a6afSToby Isaac   PetscScalar     *pointMat[32];
4209d3d1a6afSToby Isaac   PetscScalar     *newValues,*tmpValues;
4210d3d1a6afSToby Isaac   PetscBool       anyConstrained = PETSC_FALSE;
4211d3d1a6afSToby Isaac   PetscErrorCode  ierr;
4212d3d1a6afSToby Isaac 
4213d3d1a6afSToby Isaac   PetscFunctionBegin;
4214d3d1a6afSToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4215d3d1a6afSToby Isaac   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
4216d3d1a6afSToby Isaac   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4217d3d1a6afSToby Isaac 
4218a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr);
4219d3d1a6afSToby Isaac   /* if there are point-to-point constraints */
4220d3d1a6afSToby Isaac   if (aSec) {
4221d3d1a6afSToby Isaac     ierr = PetscMemzero(newOffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
4222d3d1a6afSToby Isaac     ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr);
4223d3d1a6afSToby Isaac     ierr = PetscSectionGetChart(aSec,&aStart,&aEnd);CHKERRQ(ierr);
4224d3d1a6afSToby Isaac     /* figure out how many points are going to be in the new element matrix
4225d3d1a6afSToby Isaac      * (we allow double counting, because it's all just going to be summed
4226d3d1a6afSToby Isaac      * into the global matrix anyway) */
4227d3d1a6afSToby Isaac     for (p = 0; p < 2*numPoints; p+=2) {
4228d3d1a6afSToby Isaac       PetscInt b    = points[p];
4229d3d1a6afSToby Isaac       PetscInt bDof = 0;
4230d3d1a6afSToby Isaac 
4231d3d1a6afSToby Isaac       if (b >= aStart && b < aEnd) {
4232d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(aSec,b,&bDof);CHKERRQ(ierr);
4233d3d1a6afSToby Isaac       }
4234d3d1a6afSToby Isaac       if (bDof) {
4235d3d1a6afSToby Isaac         /* this point is constrained */
4236d3d1a6afSToby Isaac         /* it is going to be replaced by its anchors */
4237d3d1a6afSToby Isaac         PetscInt bOff, q;
4238d3d1a6afSToby Isaac 
4239d3d1a6afSToby Isaac         anyConstrained = PETSC_TRUE;
4240d3d1a6afSToby Isaac         newNumPoints  += bDof;
4241d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset(aSec,b,&bOff);CHKERRQ(ierr);
4242d3d1a6afSToby Isaac         for (q = 0; q < bDof; q++) {
4243d3d1a6afSToby Isaac           PetscInt a = anchors[bOff + q];
4244d3d1a6afSToby Isaac           PetscInt aDof;
4245d3d1a6afSToby Isaac 
4246d3d1a6afSToby Isaac           ierr           = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr);
4247d3d1a6afSToby Isaac           newNumIndices += aDof;
4248d3d1a6afSToby Isaac           for (f = 0; f < numFields; ++f) {
4249d3d1a6afSToby Isaac             PetscInt fDof;
4250d3d1a6afSToby Isaac 
4251d3d1a6afSToby Isaac             ierr             = PetscSectionGetFieldDof(section, a, f, &fDof);CHKERRQ(ierr);
4252d3d1a6afSToby Isaac             newOffsets[f+1] += fDof;
4253d3d1a6afSToby Isaac           }
4254d3d1a6afSToby Isaac         }
4255d3d1a6afSToby Isaac       }
4256d3d1a6afSToby Isaac       else {
4257d3d1a6afSToby Isaac         /* this point is not constrained */
4258d3d1a6afSToby Isaac         newNumPoints++;
4259d3d1a6afSToby Isaac         ierr           = PetscSectionGetDof(section,b,&bDof);CHKERRQ(ierr);
4260d3d1a6afSToby Isaac         newNumIndices += bDof;
4261d3d1a6afSToby Isaac         for (f = 0; f < numFields; ++f) {
4262d3d1a6afSToby Isaac           PetscInt fDof;
4263d3d1a6afSToby Isaac 
4264d3d1a6afSToby Isaac           ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr);
4265d3d1a6afSToby Isaac           newOffsets[f+1] += fDof;
4266d3d1a6afSToby Isaac         }
4267d3d1a6afSToby Isaac       }
4268d3d1a6afSToby Isaac     }
4269d3d1a6afSToby Isaac   }
4270d3d1a6afSToby Isaac   if (!anyConstrained) {
4271d3d1a6afSToby Isaac     *outNumPoints  = 0;
4272d3d1a6afSToby Isaac     *outNumIndices = 0;
4273d3d1a6afSToby Isaac     *outPoints     = NULL;
4274d3d1a6afSToby Isaac     *outValues     = NULL;
4275d3d1a6afSToby Isaac     if (aSec) {
4276d3d1a6afSToby Isaac       ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr);
4277d3d1a6afSToby Isaac     }
4278d3d1a6afSToby Isaac     PetscFunctionReturn(0);
4279d3d1a6afSToby Isaac   }
4280d3d1a6afSToby Isaac 
4281d3d1a6afSToby Isaac   for (f = 1; f < numFields; ++f) newOffsets[f+1] += newOffsets[f];
4282d3d1a6afSToby Isaac 
4283d3d1a6afSToby Isaac   if (numFields && newOffsets[numFields] != newNumIndices) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", newOffsets[numFields], newNumIndices);
4284d3d1a6afSToby Isaac 
4285f7c74593SToby Isaac   ierr = DMGetDefaultConstraints(dm, &cSec, &cMat);CHKERRQ(ierr);
4286d3d1a6afSToby Isaac 
4287d3d1a6afSToby Isaac   /* output arrays */
4288d3d1a6afSToby Isaac   ierr = DMGetWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr);
4289d3d1a6afSToby Isaac   ierr = DMGetWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr);
4290d3d1a6afSToby Isaac 
4291d3d1a6afSToby Isaac   /* workspaces */
4292d3d1a6afSToby Isaac   ierr = DMGetWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr);
4293d3d1a6afSToby Isaac   if (numFields) {
4294d3d1a6afSToby Isaac     for (f = 0; f < numFields; f++) {
4295d3d1a6afSToby Isaac       ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr);
4296d3d1a6afSToby Isaac       ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr);
4297d3d1a6afSToby Isaac     }
4298d3d1a6afSToby Isaac   }
4299d3d1a6afSToby Isaac   else {
4300d3d1a6afSToby Isaac     ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr);
4301d3d1a6afSToby Isaac     ierr = DMGetWorkArray(dm,numPoints,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr);
4302d3d1a6afSToby Isaac   }
4303d3d1a6afSToby Isaac 
4304d3d1a6afSToby Isaac   /* get workspaces for the point-to-point matrices */
4305d3d1a6afSToby Isaac   if (numFields) {
4306d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4307d3d1a6afSToby Isaac       PetscInt b    = points[2*p];
4308d3d1a6afSToby Isaac       PetscInt bDof = 0;
4309d3d1a6afSToby Isaac 
4310d3d1a6afSToby Isaac       if (b >= aStart && b < aEnd) {
4311d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr);
4312d3d1a6afSToby Isaac       }
4313d3d1a6afSToby Isaac       if (bDof) {
4314d3d1a6afSToby Isaac         for (f = 0; f < numFields; f++) {
4315d3d1a6afSToby Isaac           PetscInt fDof, q, bOff, allFDof = 0;
4316d3d1a6afSToby Isaac 
4317d3d1a6afSToby Isaac           ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr);
4318d3d1a6afSToby Isaac           ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr);
4319d3d1a6afSToby Isaac           for (q = 0; q < bDof; q++) {
4320d3d1a6afSToby Isaac             PetscInt a = anchors[bOff + q];
4321d3d1a6afSToby Isaac             PetscInt aFDof;
4322d3d1a6afSToby Isaac 
4323d3d1a6afSToby Isaac             ierr     = PetscSectionGetFieldDof(section, a, f, &aFDof);CHKERRQ(ierr);
4324d3d1a6afSToby Isaac             allFDof += aFDof;
4325d3d1a6afSToby Isaac           }
4326d3d1a6afSToby Isaac           newPointOffsets[f][p+1] = allFDof;
4327d3d1a6afSToby Isaac           pointMatOffsets[f][p+1] = fDof * allFDof;
4328d3d1a6afSToby Isaac         }
4329d3d1a6afSToby Isaac       }
4330d3d1a6afSToby Isaac       else {
4331d3d1a6afSToby Isaac         for (f = 0; f < numFields; f++) {
4332d3d1a6afSToby Isaac           PetscInt fDof;
4333d3d1a6afSToby Isaac 
4334d3d1a6afSToby Isaac           ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr);
4335d3d1a6afSToby Isaac           newPointOffsets[f][p+1] = fDof;
4336d3d1a6afSToby Isaac           pointMatOffsets[f][p+1] = 0;
4337d3d1a6afSToby Isaac         }
4338d3d1a6afSToby Isaac       }
4339d3d1a6afSToby Isaac     }
4340d3d1a6afSToby Isaac     for (f = 0; f < numFields; f++) {
4341d3d1a6afSToby Isaac       newPointOffsets[f][0] = 0;
4342d3d1a6afSToby Isaac       pointMatOffsets[f][0] = 0;
4343d3d1a6afSToby Isaac       for (p = 0; p < numPoints; p++) {
4344d3d1a6afSToby Isaac         newPointOffsets[f][p+1] += newPointOffsets[f][p];
4345d3d1a6afSToby Isaac         pointMatOffsets[f][p+1] += pointMatOffsets[f][p];
4346d3d1a6afSToby Isaac       }
4347d3d1a6afSToby Isaac       ierr = DMGetWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr);
4348d3d1a6afSToby Isaac     }
4349d3d1a6afSToby Isaac   }
4350d3d1a6afSToby Isaac   else {
4351d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4352d3d1a6afSToby Isaac       PetscInt b    = points[2*p];
4353d3d1a6afSToby Isaac       PetscInt bDof = 0;
4354d3d1a6afSToby Isaac 
4355d3d1a6afSToby Isaac       if (b >= aStart && b < aEnd) {
4356d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr);
4357d3d1a6afSToby Isaac       }
4358d3d1a6afSToby Isaac       if (bDof) {
4359d3d1a6afSToby Isaac         PetscInt dof, bOff, q, allDof = 0;
4360d3d1a6afSToby Isaac 
4361d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr);
4362d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr);
4363d3d1a6afSToby Isaac         for (q = 0; q < bDof; q++) {
4364d3d1a6afSToby Isaac           PetscInt a = anchors[bOff + q], aDof;
4365d3d1a6afSToby Isaac 
4366d3d1a6afSToby Isaac           ierr    = PetscSectionGetDof(section, a, &aDof);CHKERRQ(ierr);
4367d3d1a6afSToby Isaac           allDof += aDof;
4368d3d1a6afSToby Isaac         }
4369d3d1a6afSToby Isaac         newPointOffsets[0][p+1] = allDof;
4370d3d1a6afSToby Isaac         pointMatOffsets[0][p+1] = dof * allDof;
4371d3d1a6afSToby Isaac       }
4372d3d1a6afSToby Isaac       else {
4373d3d1a6afSToby Isaac         PetscInt dof;
4374d3d1a6afSToby Isaac 
4375d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr);
4376d3d1a6afSToby Isaac         newPointOffsets[0][p+1] = dof;
4377d3d1a6afSToby Isaac         pointMatOffsets[0][p+1] = 0;
4378d3d1a6afSToby Isaac       }
4379d3d1a6afSToby Isaac     }
4380d3d1a6afSToby Isaac     newPointOffsets[0][0] = 0;
4381d3d1a6afSToby Isaac     pointMatOffsets[0][0] = 0;
4382d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4383d3d1a6afSToby Isaac       newPointOffsets[0][p+1] += newPointOffsets[0][p];
4384d3d1a6afSToby Isaac       pointMatOffsets[0][p+1] += pointMatOffsets[0][p];
4385d3d1a6afSToby Isaac     }
4386d3d1a6afSToby Isaac     ierr = DMGetWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr);
4387d3d1a6afSToby Isaac   }
4388d3d1a6afSToby Isaac 
4389d3d1a6afSToby Isaac   /* get the point-to-point matrices; construct newPoints */
4390d3d1a6afSToby Isaac   ierr = PetscSectionGetMaxDof(aSec, &maxAnchor);CHKERRQ(ierr);
4391d3d1a6afSToby Isaac   ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
4392d3d1a6afSToby Isaac   ierr = DMGetWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr);
4393d3d1a6afSToby Isaac   ierr = DMGetWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr);
4394d3d1a6afSToby Isaac   if (numFields) {
4395d3d1a6afSToby Isaac     for (p = 0, newP = 0; p < numPoints; p++) {
4396d3d1a6afSToby Isaac       PetscInt b    = points[2*p];
4397d3d1a6afSToby Isaac       PetscInt o    = points[2*p+1];
4398d3d1a6afSToby Isaac       PetscInt bDof = 0;
4399d3d1a6afSToby Isaac 
4400d3d1a6afSToby Isaac       if (b >= aStart && b < aEnd) {
4401d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr);
4402d3d1a6afSToby Isaac       }
4403d3d1a6afSToby Isaac       if (bDof) {
4404d3d1a6afSToby Isaac         PetscInt fStart[32], fEnd[32], fAnchorStart[32], fAnchorEnd[32], bOff, q;
4405d3d1a6afSToby Isaac 
4406d3d1a6afSToby Isaac         fStart[0] = 0;
4407d3d1a6afSToby Isaac         fEnd[0]   = 0;
4408d3d1a6afSToby Isaac         for (f = 0; f < numFields; f++) {
4409d3d1a6afSToby Isaac           PetscInt fDof;
4410d3d1a6afSToby Isaac 
4411d3d1a6afSToby Isaac           ierr        = PetscSectionGetFieldDof(cSec, b, f, &fDof);CHKERRQ(ierr);
4412d3d1a6afSToby Isaac           fStart[f+1] = fStart[f] + fDof;
4413d3d1a6afSToby Isaac           fEnd[f+1]   = fStart[f+1];
4414d3d1a6afSToby Isaac         }
4415d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr);
4416d3d1a6afSToby Isaac         ierr = indicesPointFields_private(cSec, b, bOff, fEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr);
4417d3d1a6afSToby Isaac 
4418d3d1a6afSToby Isaac         fAnchorStart[0] = 0;
4419d3d1a6afSToby Isaac         fAnchorEnd[0]   = 0;
4420d3d1a6afSToby Isaac         for (f = 0; f < numFields; f++) {
4421d3d1a6afSToby Isaac           PetscInt fDof = newPointOffsets[f][p + 1] - newPointOffsets[f][p];
4422d3d1a6afSToby Isaac 
4423d3d1a6afSToby Isaac           fAnchorStart[f+1] = fAnchorStart[f] + fDof;
4424d3d1a6afSToby Isaac           fAnchorEnd[f+1]   = fAnchorStart[f + 1];
4425d3d1a6afSToby Isaac         }
4426d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr);
4427d3d1a6afSToby Isaac         for (q = 0; q < bDof; q++) {
4428d3d1a6afSToby Isaac           PetscInt a = anchors[bOff + q], aOff;
4429d3d1a6afSToby Isaac 
4430d3d1a6afSToby Isaac           /* we take the orientation of ap into account in the order that we constructed the indices above: the newly added points have no orientation */
4431d3d1a6afSToby Isaac           newPoints[2*(newP + q)]     = a;
4432d3d1a6afSToby Isaac           newPoints[2*(newP + q) + 1] = 0;
4433d3d1a6afSToby Isaac           ierr = PetscSectionGetOffset(section, a, &aOff);
4434d3d1a6afSToby Isaac           ierr = indicesPointFields_private(section, a, aOff, fAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr);
4435d3d1a6afSToby Isaac         }
4436d3d1a6afSToby Isaac         newP += bDof;
4437d3d1a6afSToby Isaac 
4438d3d1a6afSToby Isaac         /* get the point-to-point submatrix */
4439d3d1a6afSToby Isaac         for (f = 0; f < numFields; f++) {
4440d3d1a6afSToby Isaac           ierr = MatGetValues(cMat,fEnd[f]-fStart[f],indices + fStart[f],fAnchorEnd[f] - fAnchorStart[f],newIndices + fAnchorStart[f],pointMat[f] + pointMatOffsets[f][p]);CHKERRQ(ierr);
4441d3d1a6afSToby Isaac         }
4442d3d1a6afSToby Isaac       }
4443d3d1a6afSToby Isaac       else {
4444d3d1a6afSToby Isaac         newPoints[2 * newP]     = b;
4445d3d1a6afSToby Isaac         newPoints[2 * newP + 1] = o;
4446d3d1a6afSToby Isaac         newP++;
4447d3d1a6afSToby Isaac       }
4448d3d1a6afSToby Isaac     }
4449d3d1a6afSToby Isaac   } else {
4450d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4451d3d1a6afSToby Isaac       PetscInt b    = points[2*p];
4452d3d1a6afSToby Isaac       PetscInt o    = points[2*p+1];
4453d3d1a6afSToby Isaac       PetscInt bDof = 0;
4454d3d1a6afSToby Isaac 
4455d3d1a6afSToby Isaac       if (b >= aStart && b < aEnd) {
4456d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr);
4457d3d1a6afSToby Isaac       }
4458d3d1a6afSToby Isaac       if (bDof) {
4459d3d1a6afSToby Isaac         PetscInt bEnd = 0, bAnchorEnd = 0, bOff;
4460d3d1a6afSToby Isaac 
4461d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr);
4462d3d1a6afSToby Isaac         ierr = indicesPoint_private(cSec, b, bOff, &bEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr);
4463d3d1a6afSToby Isaac 
4464d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr);
4465d3d1a6afSToby Isaac         for (q = 0; q < bDof; q++) {
4466d3d1a6afSToby Isaac           PetscInt a = anchors[bOff + q], aOff;
4467d3d1a6afSToby Isaac 
4468d3d1a6afSToby Isaac           /* we take the orientation of ap into account in the order that we constructed the indices above: the newly added points have no orientation */
4469d3d1a6afSToby Isaac 
4470d3d1a6afSToby Isaac           newPoints[2*(newP + q)]     = a;
4471d3d1a6afSToby Isaac           newPoints[2*(newP + q) + 1] = 0;
4472d3d1a6afSToby Isaac           ierr = PetscSectionGetOffset(section, a, &aOff);
4473d3d1a6afSToby Isaac           ierr = indicesPoint_private(section, a, aOff, &bAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr);
4474d3d1a6afSToby Isaac         }
4475d3d1a6afSToby Isaac         newP += bDof;
4476d3d1a6afSToby Isaac 
4477d3d1a6afSToby Isaac         /* get the point-to-point submatrix */
4478d3d1a6afSToby Isaac         ierr = MatGetValues(cMat,bEnd,indices,bAnchorEnd,newIndices,pointMat[0] + pointMatOffsets[0][p]);CHKERRQ(ierr);
4479d3d1a6afSToby Isaac       }
4480d3d1a6afSToby Isaac       else {
4481d3d1a6afSToby Isaac         newPoints[2 * newP]     = b;
4482d3d1a6afSToby Isaac         newPoints[2 * newP + 1] = o;
4483d3d1a6afSToby Isaac         newP++;
4484d3d1a6afSToby Isaac       }
4485d3d1a6afSToby Isaac     }
4486d3d1a6afSToby Isaac   }
4487d3d1a6afSToby Isaac 
4488d3d1a6afSToby Isaac   ierr = PetscMemzero(tmpValues,newNumIndices*numIndices*sizeof(*tmpValues));CHKERRQ(ierr);
4489d3d1a6afSToby Isaac   /* multiply constraints on the right */
4490d3d1a6afSToby Isaac   if (numFields) {
4491d3d1a6afSToby Isaac     for (f = 0; f < numFields; f++) {
4492d3d1a6afSToby Isaac       PetscInt oldOff = offsets[f];
4493d3d1a6afSToby Isaac 
4494d3d1a6afSToby Isaac       for (p = 0; p < numPoints; p++) {
4495d3d1a6afSToby Isaac         PetscInt cStart = newPointOffsets[f][p];
4496d3d1a6afSToby Isaac         PetscInt b      = points[2 * p];
4497d3d1a6afSToby Isaac         PetscInt c, r, k;
4498d3d1a6afSToby Isaac         PetscInt dof;
4499d3d1a6afSToby Isaac 
4500d3d1a6afSToby Isaac         ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr);
4501d3d1a6afSToby Isaac         if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) {
4502d3d1a6afSToby Isaac           PetscInt nCols         = newPointOffsets[f][p+1]-cStart;
4503d3d1a6afSToby Isaac           const PetscScalar *mat = pointMat[f] + pointMatOffsets[f][p];
4504d3d1a6afSToby Isaac 
4505d3d1a6afSToby Isaac           for (r = 0; r < numIndices; r++) {
4506d3d1a6afSToby Isaac             for (c = 0; c < nCols; c++) {
4507d3d1a6afSToby Isaac               for (k = 0; k < dof; k++) {
4508d3d1a6afSToby Isaac                 tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k];
4509d3d1a6afSToby Isaac               }
4510d3d1a6afSToby Isaac             }
4511d3d1a6afSToby Isaac           }
4512d3d1a6afSToby Isaac         }
4513d3d1a6afSToby Isaac         else {
4514d3d1a6afSToby Isaac           /* copy this column as is */
4515d3d1a6afSToby Isaac           for (r = 0; r < numIndices; r++) {
4516d3d1a6afSToby Isaac             for (c = 0; c < dof; c++) {
4517d3d1a6afSToby Isaac               tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c];
4518d3d1a6afSToby Isaac             }
4519d3d1a6afSToby Isaac           }
4520d3d1a6afSToby Isaac         }
4521d3d1a6afSToby Isaac         oldOff += dof;
4522d3d1a6afSToby Isaac       }
4523d3d1a6afSToby Isaac     }
4524d3d1a6afSToby Isaac   }
4525d3d1a6afSToby Isaac   else {
4526d3d1a6afSToby Isaac     PetscInt oldOff = 0;
4527d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4528d3d1a6afSToby Isaac       PetscInt cStart = newPointOffsets[0][p];
4529d3d1a6afSToby Isaac       PetscInt b      = points[2 * p];
4530d3d1a6afSToby Isaac       PetscInt c, r, k;
4531d3d1a6afSToby Isaac       PetscInt dof;
4532d3d1a6afSToby Isaac 
4533d3d1a6afSToby Isaac       ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr);
4534d3d1a6afSToby Isaac       if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) {
4535d3d1a6afSToby Isaac         PetscInt nCols         = newPointOffsets[0][p+1]-cStart;
4536d3d1a6afSToby Isaac         const PetscScalar *mat = pointMat[0] + pointMatOffsets[0][p];
4537d3d1a6afSToby Isaac 
4538d3d1a6afSToby Isaac         for (r = 0; r < numIndices; r++) {
4539d3d1a6afSToby Isaac           for (c = 0; c < nCols; c++) {
4540d3d1a6afSToby Isaac             for (k = 0; k < dof; k++) {
4541d3d1a6afSToby Isaac               tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k];
4542d3d1a6afSToby Isaac             }
4543d3d1a6afSToby Isaac           }
4544d3d1a6afSToby Isaac         }
4545d3d1a6afSToby Isaac       }
4546d3d1a6afSToby Isaac       else {
4547d3d1a6afSToby Isaac         /* copy this column as is */
4548d3d1a6afSToby Isaac         for (r = 0; r < numIndices; r++) {
4549d3d1a6afSToby Isaac           for (c = 0; c < dof; c++) {
4550d3d1a6afSToby Isaac             tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c];
4551d3d1a6afSToby Isaac           }
4552d3d1a6afSToby Isaac         }
4553d3d1a6afSToby Isaac       }
4554d3d1a6afSToby Isaac       oldOff += dof;
4555d3d1a6afSToby Isaac     }
4556d3d1a6afSToby Isaac   }
4557d3d1a6afSToby Isaac 
4558d3d1a6afSToby Isaac   ierr = PetscMemzero(newValues,newNumIndices*newNumIndices*sizeof(*newValues));CHKERRQ(ierr);
4559d3d1a6afSToby Isaac   /* multiply constraints transpose on the left */
4560d3d1a6afSToby Isaac   if (numFields) {
4561d3d1a6afSToby Isaac     for (f = 0; f < numFields; f++) {
4562d3d1a6afSToby Isaac       PetscInt oldOff = offsets[f];
4563d3d1a6afSToby Isaac 
4564d3d1a6afSToby Isaac       for (p = 0; p < numPoints; p++) {
4565d3d1a6afSToby Isaac         PetscInt rStart = newPointOffsets[f][p];
4566d3d1a6afSToby Isaac         PetscInt b      = points[2 * p];
4567d3d1a6afSToby Isaac         PetscInt c, r, k;
4568d3d1a6afSToby Isaac         PetscInt dof;
4569d3d1a6afSToby Isaac 
4570d3d1a6afSToby Isaac         ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr);
4571d3d1a6afSToby Isaac         if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) {
4572d3d1a6afSToby Isaac           PetscInt nRows                        = newPointOffsets[f][p+1]-rStart;
4573d3d1a6afSToby Isaac           const PetscScalar *PETSC_RESTRICT mat = pointMat[f] + pointMatOffsets[f][p];
4574d3d1a6afSToby Isaac 
4575d3d1a6afSToby Isaac           for (r = 0; r < nRows; r++) {
4576d3d1a6afSToby Isaac             for (c = 0; c < newNumIndices; c++) {
4577d3d1a6afSToby Isaac               for (k = 0; k < dof; k++) {
4578d3d1a6afSToby Isaac                 newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c];
4579d3d1a6afSToby Isaac               }
4580d3d1a6afSToby Isaac             }
4581d3d1a6afSToby Isaac           }
4582d3d1a6afSToby Isaac         }
4583d3d1a6afSToby Isaac         else {
4584d3d1a6afSToby Isaac           /* copy this row as is */
4585d3d1a6afSToby Isaac           for (r = 0; r < dof; r++) {
4586d3d1a6afSToby Isaac             for (c = 0; c < newNumIndices; c++) {
4587d3d1a6afSToby Isaac               newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c];
4588d3d1a6afSToby Isaac             }
4589d3d1a6afSToby Isaac           }
4590d3d1a6afSToby Isaac         }
4591d3d1a6afSToby Isaac         oldOff += dof;
4592d3d1a6afSToby Isaac       }
4593d3d1a6afSToby Isaac     }
4594d3d1a6afSToby Isaac   }
4595d3d1a6afSToby Isaac   else {
4596d3d1a6afSToby Isaac     PetscInt oldOff = 0;
4597d3d1a6afSToby Isaac 
4598d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4599d3d1a6afSToby Isaac       PetscInt rStart = newPointOffsets[0][p];
4600d3d1a6afSToby Isaac       PetscInt b      = points[2 * p];
4601d3d1a6afSToby Isaac       PetscInt c, r, k;
4602d3d1a6afSToby Isaac       PetscInt dof;
4603d3d1a6afSToby Isaac 
4604d3d1a6afSToby Isaac       ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr);
4605d3d1a6afSToby Isaac       if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) {
4606d3d1a6afSToby Isaac         PetscInt nRows                        = newPointOffsets[0][p+1]-rStart;
4607d3d1a6afSToby Isaac         const PetscScalar *PETSC_RESTRICT mat = pointMat[0] + pointMatOffsets[0][p];
4608d3d1a6afSToby Isaac 
4609d3d1a6afSToby Isaac         for (r = 0; r < nRows; r++) {
4610d3d1a6afSToby Isaac           for (c = 0; c < newNumIndices; c++) {
4611d3d1a6afSToby Isaac             for (k = 0; k < dof; k++) {
4612d3d1a6afSToby Isaac               newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c];
4613d3d1a6afSToby Isaac             }
4614d3d1a6afSToby Isaac           }
4615d3d1a6afSToby Isaac         }
4616d3d1a6afSToby Isaac       }
4617d3d1a6afSToby Isaac       else {
4618d3d1a6afSToby Isaac         /* copy this row as is */
4619d3d1a6afSToby Isaac         for (r = 0; r < dof; c++) {
4620d3d1a6afSToby Isaac           for (c = 0; c < newNumIndices; c++) {
4621d3d1a6afSToby Isaac             newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c];
4622d3d1a6afSToby Isaac           }
4623d3d1a6afSToby Isaac         }
4624d3d1a6afSToby Isaac       }
4625d3d1a6afSToby Isaac       oldOff += dof;
4626d3d1a6afSToby Isaac     }
4627d3d1a6afSToby Isaac   }
4628d3d1a6afSToby Isaac 
4629d3d1a6afSToby Isaac   /* clean up */
4630d3d1a6afSToby Isaac   ierr = DMRestoreWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr);
4631d3d1a6afSToby Isaac   ierr = DMRestoreWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr);
4632d3d1a6afSToby Isaac   if (numFields) {
4633d3d1a6afSToby Isaac     for (f = 0; f < numFields; f++) {
4634d3d1a6afSToby Isaac       ierr = DMRestoreWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr);
4635d3d1a6afSToby Isaac       ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr);
4636d3d1a6afSToby Isaac       ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr);
4637d3d1a6afSToby Isaac     }
4638d3d1a6afSToby Isaac   }
4639d3d1a6afSToby Isaac   else {
4640d3d1a6afSToby Isaac     ierr = DMRestoreWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr);
4641d3d1a6afSToby Isaac     ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr);
4642d3d1a6afSToby Isaac     ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr);
4643d3d1a6afSToby Isaac   }
4644d3d1a6afSToby Isaac   ierr = DMRestoreWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr);
4645d3d1a6afSToby Isaac   ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr);
4646d3d1a6afSToby Isaac 
4647d3d1a6afSToby Isaac   /* output */
4648d3d1a6afSToby Isaac   *outNumPoints  = newNumPoints;
4649d3d1a6afSToby Isaac   *outNumIndices = newNumIndices;
4650d3d1a6afSToby Isaac   *outPoints     = newPoints;
4651d3d1a6afSToby Isaac   *outValues     = newValues;
4652d3d1a6afSToby Isaac   for (f = 0; f < numFields; f++) {
4653d3d1a6afSToby Isaac     offsets[f] = newOffsets[f];
4654d3d1a6afSToby Isaac   }
4655d3d1a6afSToby Isaac   PetscFunctionReturn(0);
4656d3d1a6afSToby Isaac }
4657d3d1a6afSToby Isaac 
4658d3d1a6afSToby Isaac #undef __FUNCT__
4659552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure"
46607f5d1fdeSMatthew G. Knepley /*@C
46617f5d1fdeSMatthew G. Knepley   DMPlexMatSetClosure - Set an array of the values on the closure of 'point'
46627f5d1fdeSMatthew G. Knepley 
46637f5d1fdeSMatthew G. Knepley   Not collective
46647f5d1fdeSMatthew G. Knepley 
46657f5d1fdeSMatthew G. Knepley   Input Parameters:
46667f5d1fdeSMatthew G. Knepley + dm - The DM
4667ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section
4668ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section
46697f5d1fdeSMatthew G. Knepley . A - The matrix
46707f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM
46717f5d1fdeSMatthew G. Knepley . values - The array of values
46727f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions
46737f5d1fdeSMatthew G. Knepley 
46747f5d1fdeSMatthew G. Knepley   Fortran Notes:
46757f5d1fdeSMatthew G. Knepley   This routine is only available in Fortran 90, and you must include petsc.h90 in your code.
46767f5d1fdeSMatthew G. Knepley 
46777f5d1fdeSMatthew G. Knepley   Level: intermediate
46787f5d1fdeSMatthew G. Knepley 
46797f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure()
46807f5d1fdeSMatthew G. Knepley @*/
46817c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode)
4682552f7358SJed Brown {
4683552f7358SJed Brown   DM_Plex        *mesh   = (DM_Plex*) dm->data;
46841b406b76SMatthew G. Knepley   PetscSection    clSection;
46851b406b76SMatthew G. Knepley   IS              clPoints;
4686d3d1a6afSToby Isaac   PetscInt       *points = NULL, *newPoints;
46871b406b76SMatthew G. Knepley   const PetscInt *clp;
4688552f7358SJed Brown   PetscInt       *indices;
4689552f7358SJed Brown   PetscInt        offsets[32];
4690d3d1a6afSToby Isaac   PetscInt        numFields, numPoints, newNumPoints, numIndices, newNumIndices, dof, off, globalOff, pStart, pEnd, p, q, f;
4691d3d1a6afSToby Isaac   PetscScalar    *newValues;
4692552f7358SJed Brown   PetscErrorCode  ierr;
4693552f7358SJed Brown 
4694552f7358SJed Brown   PetscFunctionBegin;
4695552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4696ebd6d717SJed Brown   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
46973dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
4698ebd6d717SJed Brown   if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);}
46993dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3);
47003dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(A, MAT_CLASSID, 4);
4701552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
470282f516ccSBarry Smith   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
4703552f7358SJed Brown   ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
47041b406b76SMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr);
47051b406b76SMatthew G. Knepley   if (!clPoints) {
4706552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
4707552f7358SJed Brown     /* Compress out points not in the section */
4708552f7358SJed Brown     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
4709552f7358SJed Brown     for (p = 0, q = 0; p < numPoints*2; p += 2) {
4710552f7358SJed Brown       if ((points[p] >= pStart) && (points[p] < pEnd)) {
4711552f7358SJed Brown         points[q*2]   = points[p];
4712552f7358SJed Brown         points[q*2+1] = points[p+1];
4713552f7358SJed Brown         ++q;
4714552f7358SJed Brown       }
4715552f7358SJed Brown     }
4716552f7358SJed Brown     numPoints = q;
47171b406b76SMatthew G. Knepley   } else {
47181b406b76SMatthew G. Knepley     PetscInt dof, off;
47191b406b76SMatthew G. Knepley 
47201b406b76SMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
47211b406b76SMatthew G. Knepley     numPoints = dof/2;
47221b406b76SMatthew G. Knepley     ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
47231b406b76SMatthew G. Knepley     ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr);
47241b406b76SMatthew G. Knepley     points = (PetscInt *) &clp[off];
47251b406b76SMatthew G. Knepley   }
4726552f7358SJed Brown   for (p = 0, numIndices = 0; p < numPoints*2; p += 2) {
4727552f7358SJed Brown     PetscInt fdof;
4728552f7358SJed Brown 
4729552f7358SJed Brown     ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
4730552f7358SJed Brown     for (f = 0; f < numFields; ++f) {
4731552f7358SJed Brown       ierr          = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
4732552f7358SJed Brown       offsets[f+1] += fdof;
4733552f7358SJed Brown     }
4734552f7358SJed Brown     numIndices += dof;
4735552f7358SJed Brown   }
47360d644c17SKarl Rupp   for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f];
47370d644c17SKarl Rupp 
473882f516ccSBarry Smith   if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices);
4739f7c74593SToby Isaac   ierr = DMPlexAnchorsModifyMat(dm,section,numPoints,numIndices,points,values,&newNumPoints,&newNumIndices,&newPoints,&newValues,offsets);CHKERRQ(ierr);
4740d3d1a6afSToby Isaac   if (newNumPoints) {
4741d3d1a6afSToby Isaac     if (!clPoints) {
4742d3d1a6afSToby Isaac       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
4743d3d1a6afSToby Isaac     } else {
4744d3d1a6afSToby Isaac       ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);
4745d3d1a6afSToby Isaac     }
4746d3d1a6afSToby Isaac     numPoints  = newNumPoints;
4747d3d1a6afSToby Isaac     numIndices = newNumIndices;
4748d3d1a6afSToby Isaac     points     = newPoints;
4749d3d1a6afSToby Isaac     values     = newValues;
4750d3d1a6afSToby Isaac   }
4751552f7358SJed Brown   ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr);
4752552f7358SJed Brown   if (numFields) {
4753552f7358SJed Brown     for (p = 0; p < numPoints*2; p += 2) {
4754552f7358SJed Brown       PetscInt o = points[p+1];
4755552f7358SJed Brown       ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr);
4756552f7358SJed Brown       indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices);
4757552f7358SJed Brown     }
4758552f7358SJed Brown   } else {
4759e6ccafaeSMatthew G Knepley     for (p = 0, off = 0; p < numPoints*2; p += 2) {
4760552f7358SJed Brown       PetscInt o = points[p+1];
4761552f7358SJed Brown       ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr);
4762e6ccafaeSMatthew G Knepley       indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices);
4763552f7358SJed Brown     }
4764552f7358SJed Brown   }
4765b0ecff45SMatthew G. Knepley   if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);}
4766552f7358SJed Brown   ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode);
4767552f7358SJed Brown   if (ierr) {
4768552f7358SJed Brown     PetscMPIInt    rank;
4769552f7358SJed Brown     PetscErrorCode ierr2;
4770552f7358SJed Brown 
477182f516ccSBarry Smith     ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2);
477277a6746dSMatthew G Knepley     ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2);
4773b0ecff45SMatthew G. Knepley     ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2);
47746a415b8fSMatthew G Knepley     ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2);
4775552f7358SJed Brown     CHKERRQ(ierr);
4776552f7358SJed Brown   }
4777d3d1a6afSToby Isaac   if (newNumPoints) {
4778d3d1a6afSToby Isaac     ierr = DMRestoreWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr);
4779d3d1a6afSToby Isaac     ierr = DMRestoreWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr);
4780d3d1a6afSToby Isaac   }
4781d3d1a6afSToby Isaac   else {
47821b406b76SMatthew G. Knepley     if (!clPoints) {
4783552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
47841b406b76SMatthew G. Knepley     } else {
47851b406b76SMatthew G. Knepley       ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);
47861b406b76SMatthew G. Knepley     }
4787d3d1a6afSToby Isaac   }
4788552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr);
4789552f7358SJed Brown   PetscFunctionReturn(0);
4790552f7358SJed Brown }
4791552f7358SJed Brown 
4792552f7358SJed Brown #undef __FUNCT__
4793de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined"
4794de41b84cSMatthew G. Knepley PetscErrorCode DMPlexMatSetClosureRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode)
4795de41b84cSMatthew G. Knepley {
4796de41b84cSMatthew G. Knepley   DM_Plex        *mesh   = (DM_Plex*) dmf->data;
4797de41b84cSMatthew G. Knepley   PetscInt       *fpoints = NULL, *ftotpoints = NULL;
4798de41b84cSMatthew G. Knepley   PetscInt       *cpoints = NULL;
4799de41b84cSMatthew G. Knepley   PetscInt       *findices, *cindices;
4800de41b84cSMatthew G. Knepley   PetscInt        foffsets[32], coffsets[32];
4801de41b84cSMatthew G. Knepley   CellRefiner     cellRefiner;
48024ca5e9f5SMatthew G. Knepley   PetscInt        numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f;
4803de41b84cSMatthew G. Knepley   PetscErrorCode  ierr;
4804de41b84cSMatthew G. Knepley 
4805de41b84cSMatthew G. Knepley   PetscFunctionBegin;
4806de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(dmf, DM_CLASSID, 1);
4807de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(dmc, DM_CLASSID, 4);
4808de41b84cSMatthew G. Knepley   if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);}
4809de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2);
4810de41b84cSMatthew G. Knepley   if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);}
4811de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5);
4812de41b84cSMatthew G. Knepley   if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);}
4813de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3);
4814de41b84cSMatthew G. Knepley   if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);}
4815de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6);
4816de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(A, MAT_CLASSID, 7);
4817de41b84cSMatthew G. Knepley   ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr);
4818de41b84cSMatthew G. Knepley   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
4819de41b84cSMatthew G. Knepley   ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
4820de41b84cSMatthew G. Knepley   ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
4821de41b84cSMatthew G. Knepley   /* Column indices */
4822de41b84cSMatthew G. Knepley   ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr);
48234ca5e9f5SMatthew G. Knepley   maxFPoints = numCPoints;
4824de41b84cSMatthew G. Knepley   /* Compress out points not in the section */
4825de41b84cSMatthew G. Knepley   /*   TODO: Squeeze out points with 0 dof as well */
4826de41b84cSMatthew G. Knepley   ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr);
4827de41b84cSMatthew G. Knepley   for (p = 0, q = 0; p < numCPoints*2; p += 2) {
4828de41b84cSMatthew G. Knepley     if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) {
4829de41b84cSMatthew G. Knepley       cpoints[q*2]   = cpoints[p];
4830de41b84cSMatthew G. Knepley       cpoints[q*2+1] = cpoints[p+1];
4831de41b84cSMatthew G. Knepley       ++q;
4832de41b84cSMatthew G. Knepley     }
4833de41b84cSMatthew G. Knepley   }
4834de41b84cSMatthew G. Knepley   numCPoints = q;
4835de41b84cSMatthew G. Knepley   for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) {
4836de41b84cSMatthew G. Knepley     PetscInt fdof;
4837de41b84cSMatthew G. Knepley 
4838de41b84cSMatthew G. Knepley     ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr);
48394ca5e9f5SMatthew G. Knepley     if (!dof) continue;
4840de41b84cSMatthew G. Knepley     for (f = 0; f < numFields; ++f) {
4841de41b84cSMatthew G. Knepley       ierr           = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr);
4842de41b84cSMatthew G. Knepley       coffsets[f+1] += fdof;
4843de41b84cSMatthew G. Knepley     }
4844de41b84cSMatthew G. Knepley     numCIndices += dof;
4845de41b84cSMatthew G. Knepley   }
4846de41b84cSMatthew G. Knepley   for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f];
4847de41b84cSMatthew G. Knepley   /* Row indices */
4848de41b84cSMatthew G. Knepley   ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr);
4849de41b84cSMatthew G. Knepley   ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr);
48501ba5f902SMatthew G. Knepley   ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr);
4851de41b84cSMatthew G. Knepley   for (r = 0, q = 0; r < numSubcells; ++r) {
4852de41b84cSMatthew G. Knepley     /* TODO Map from coarse to fine cells */
4853de41b84cSMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr);
4854de41b84cSMatthew G. Knepley     /* Compress out points not in the section */
4855de41b84cSMatthew G. Knepley     ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr);
4856de41b84cSMatthew G. Knepley     for (p = 0; p < numFPoints*2; p += 2) {
4857de41b84cSMatthew G. Knepley       if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) {
48584ca5e9f5SMatthew G. Knepley         ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr);
48594ca5e9f5SMatthew G. Knepley         if (!dof) continue;
48604ca5e9f5SMatthew G. Knepley         for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break;
48614ca5e9f5SMatthew G. Knepley         if (s < q) continue;
4862de41b84cSMatthew G. Knepley         ftotpoints[q*2]   = fpoints[p];
4863de41b84cSMatthew G. Knepley         ftotpoints[q*2+1] = fpoints[p+1];
4864de41b84cSMatthew G. Knepley         ++q;
4865de41b84cSMatthew G. Knepley       }
4866de41b84cSMatthew G. Knepley     }
4867de41b84cSMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr);
4868de41b84cSMatthew G. Knepley   }
4869de41b84cSMatthew G. Knepley   numFPoints = q;
4870de41b84cSMatthew G. Knepley   for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) {
4871de41b84cSMatthew G. Knepley     PetscInt fdof;
4872de41b84cSMatthew G. Knepley 
4873de41b84cSMatthew G. Knepley     ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr);
48744ca5e9f5SMatthew G. Knepley     if (!dof) continue;
4875de41b84cSMatthew G. Knepley     for (f = 0; f < numFields; ++f) {
4876de41b84cSMatthew G. Knepley       ierr           = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr);
4877de41b84cSMatthew G. Knepley       foffsets[f+1] += fdof;
4878de41b84cSMatthew G. Knepley     }
4879de41b84cSMatthew G. Knepley     numFIndices += dof;
4880de41b84cSMatthew G. Knepley   }
4881de41b84cSMatthew G. Knepley   for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f];
4882de41b84cSMatthew G. Knepley 
4883de41b84cSMatthew G. Knepley   if (numFields && foffsets[numFields] != numFIndices) SETERRQ2(PetscObjectComm((PetscObject)dmf), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", foffsets[numFields], numFIndices);
4884de41b84cSMatthew G. Knepley   if (numFields && coffsets[numFields] != numCIndices) SETERRQ2(PetscObjectComm((PetscObject)dmc), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", coffsets[numFields], numCIndices);
4885de41b84cSMatthew G. Knepley   ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr);
4886de41b84cSMatthew G. Knepley   ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr);
4887de41b84cSMatthew G. Knepley   if (numFields) {
4888de41b84cSMatthew G. Knepley     for (p = 0; p < numFPoints*2; p += 2) {
4889de41b84cSMatthew G. Knepley       PetscInt o = ftotpoints[p+1];
4890de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr);
4891de41b84cSMatthew G. Knepley       indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices);
4892de41b84cSMatthew G. Knepley     }
4893de41b84cSMatthew G. Knepley     for (p = 0; p < numCPoints*2; p += 2) {
4894de41b84cSMatthew G. Knepley       PetscInt o = cpoints[p+1];
4895de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr);
4896de41b84cSMatthew G. Knepley       indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices);
4897de41b84cSMatthew G. Knepley     }
4898de41b84cSMatthew G. Knepley   } else {
4899de41b84cSMatthew G. Knepley     for (p = 0, off = 0; p < numFPoints*2; p += 2) {
4900de41b84cSMatthew G. Knepley       PetscInt o = ftotpoints[p+1];
4901de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr);
4902de41b84cSMatthew G. Knepley       indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices);
4903de41b84cSMatthew G. Knepley     }
4904de41b84cSMatthew G. Knepley     for (p = 0, off = 0; p < numCPoints*2; p += 2) {
4905de41b84cSMatthew G. Knepley       PetscInt o = cpoints[p+1];
4906de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr);
4907de41b84cSMatthew G. Knepley       indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices);
4908de41b84cSMatthew G. Knepley     }
4909de41b84cSMatthew G. Knepley   }
4910de41b84cSMatthew G. Knepley   if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);}
4911de41b84cSMatthew G. Knepley   ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode);
4912de41b84cSMatthew G. Knepley   if (ierr) {
4913de41b84cSMatthew G. Knepley     PetscMPIInt    rank;
4914de41b84cSMatthew G. Knepley     PetscErrorCode ierr2;
4915de41b84cSMatthew G. Knepley 
4916de41b84cSMatthew G. Knepley     ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2);
4917de41b84cSMatthew G. Knepley     ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2);
4918de41b84cSMatthew G. Knepley     ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2);
4919de41b84cSMatthew G. Knepley     ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2);
4920de41b84cSMatthew G. Knepley     ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2);
4921de41b84cSMatthew G. Knepley     CHKERRQ(ierr);
4922de41b84cSMatthew G. Knepley   }
4923549a8adaSMatthew G. Knepley   ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr);
4924de41b84cSMatthew G. Knepley   ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr);
4925de41b84cSMatthew G. Knepley   ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr);
4926de41b84cSMatthew G. Knepley   ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr);
4927de41b84cSMatthew G. Knepley   PetscFunctionReturn(0);
4928de41b84cSMatthew G. Knepley }
4929de41b84cSMatthew G. Knepley 
4930de41b84cSMatthew G. Knepley #undef __FUNCT__
49317c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined"
49327c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[])
49337c927364SMatthew G. Knepley {
49347c927364SMatthew G. Knepley   PetscInt      *fpoints = NULL, *ftotpoints = NULL;
49357c927364SMatthew G. Knepley   PetscInt      *cpoints = NULL;
49367c927364SMatthew G. Knepley   PetscInt       foffsets[32], coffsets[32];
49377c927364SMatthew G. Knepley   CellRefiner    cellRefiner;
49387c927364SMatthew G. Knepley   PetscInt       numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f;
49397c927364SMatthew G. Knepley   PetscErrorCode ierr;
49407c927364SMatthew G. Knepley 
49417c927364SMatthew G. Knepley   PetscFunctionBegin;
49427c927364SMatthew G. Knepley   PetscValidHeaderSpecific(dmf, DM_CLASSID, 1);
49437c927364SMatthew G. Knepley   PetscValidHeaderSpecific(dmc, DM_CLASSID, 4);
49447c927364SMatthew G. Knepley   if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);}
49457c927364SMatthew G. Knepley   PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2);
49467c927364SMatthew G. Knepley   if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);}
49477c927364SMatthew G. Knepley   PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5);
49487c927364SMatthew G. Knepley   if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);}
49497c927364SMatthew G. Knepley   PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3);
49507c927364SMatthew G. Knepley   if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);}
49517c927364SMatthew G. Knepley   PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6);
49527c927364SMatthew G. Knepley   ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr);
49537c927364SMatthew G. Knepley   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
49547c927364SMatthew G. Knepley   ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
49557c927364SMatthew G. Knepley   ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
49567c927364SMatthew G. Knepley   /* Column indices */
49577c927364SMatthew G. Knepley   ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr);
49587c927364SMatthew G. Knepley   maxFPoints = numCPoints;
49597c927364SMatthew G. Knepley   /* Compress out points not in the section */
49607c927364SMatthew G. Knepley   /*   TODO: Squeeze out points with 0 dof as well */
49617c927364SMatthew G. Knepley   ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr);
49627c927364SMatthew G. Knepley   for (p = 0, q = 0; p < numCPoints*2; p += 2) {
49637c927364SMatthew G. Knepley     if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) {
49647c927364SMatthew G. Knepley       cpoints[q*2]   = cpoints[p];
49657c927364SMatthew G. Knepley       cpoints[q*2+1] = cpoints[p+1];
49667c927364SMatthew G. Knepley       ++q;
49677c927364SMatthew G. Knepley     }
49687c927364SMatthew G. Knepley   }
49697c927364SMatthew G. Knepley   numCPoints = q;
49707c927364SMatthew G. Knepley   for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) {
49717c927364SMatthew G. Knepley     PetscInt fdof;
49727c927364SMatthew G. Knepley 
49737c927364SMatthew G. Knepley     ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr);
49747c927364SMatthew G. Knepley     if (!dof) continue;
49757c927364SMatthew G. Knepley     for (f = 0; f < numFields; ++f) {
49767c927364SMatthew G. Knepley       ierr           = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr);
49777c927364SMatthew G. Knepley       coffsets[f+1] += fdof;
49787c927364SMatthew G. Knepley     }
49797c927364SMatthew G. Knepley     numCIndices += dof;
49807c927364SMatthew G. Knepley   }
49817c927364SMatthew G. Knepley   for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f];
49827c927364SMatthew G. Knepley   /* Row indices */
49837c927364SMatthew G. Knepley   ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr);
49847c927364SMatthew G. Knepley   ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr);
49857c927364SMatthew G. Knepley   ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr);
49867c927364SMatthew G. Knepley   for (r = 0, q = 0; r < numSubcells; ++r) {
49877c927364SMatthew G. Knepley     /* TODO Map from coarse to fine cells */
49887c927364SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr);
49897c927364SMatthew G. Knepley     /* Compress out points not in the section */
49907c927364SMatthew G. Knepley     ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr);
49917c927364SMatthew G. Knepley     for (p = 0; p < numFPoints*2; p += 2) {
49927c927364SMatthew G. Knepley       if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) {
49937c927364SMatthew G. Knepley         ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr);
49947c927364SMatthew G. Knepley         if (!dof) continue;
49957c927364SMatthew G. Knepley         for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break;
49967c927364SMatthew G. Knepley         if (s < q) continue;
49977c927364SMatthew G. Knepley         ftotpoints[q*2]   = fpoints[p];
49987c927364SMatthew G. Knepley         ftotpoints[q*2+1] = fpoints[p+1];
49997c927364SMatthew G. Knepley         ++q;
50007c927364SMatthew G. Knepley       }
50017c927364SMatthew G. Knepley     }
50027c927364SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr);
50037c927364SMatthew G. Knepley   }
50047c927364SMatthew G. Knepley   numFPoints = q;
50057c927364SMatthew G. Knepley   for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) {
50067c927364SMatthew G. Knepley     PetscInt fdof;
50077c927364SMatthew G. Knepley 
50087c927364SMatthew G. Knepley     ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr);
50097c927364SMatthew G. Knepley     if (!dof) continue;
50107c927364SMatthew G. Knepley     for (f = 0; f < numFields; ++f) {
50117c927364SMatthew G. Knepley       ierr           = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr);
50127c927364SMatthew G. Knepley       foffsets[f+1] += fdof;
50137c927364SMatthew G. Knepley     }
50147c927364SMatthew G. Knepley     numFIndices += dof;
50157c927364SMatthew G. Knepley   }
50167c927364SMatthew G. Knepley   for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f];
50177c927364SMatthew G. Knepley 
50187c927364SMatthew G. Knepley   if (numFields && foffsets[numFields] != numFIndices) SETERRQ2(PetscObjectComm((PetscObject)dmf), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", foffsets[numFields], numFIndices);
50197c927364SMatthew G. Knepley   if (numFields && coffsets[numFields] != numCIndices) SETERRQ2(PetscObjectComm((PetscObject)dmc), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", coffsets[numFields], numCIndices);
50207c927364SMatthew G. Knepley   if (numFields) {
50217c927364SMatthew G. Knepley     for (p = 0; p < numFPoints*2; p += 2) {
50227c927364SMatthew G. Knepley       PetscInt o = ftotpoints[p+1];
50237c927364SMatthew G. Knepley       ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr);
50247c927364SMatthew G. Knepley       indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices);
50257c927364SMatthew G. Knepley     }
50267c927364SMatthew G. Knepley     for (p = 0; p < numCPoints*2; p += 2) {
50277c927364SMatthew G. Knepley       PetscInt o = cpoints[p+1];
50287c927364SMatthew G. Knepley       ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr);
50297c927364SMatthew G. Knepley       indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices);
50307c927364SMatthew G. Knepley     }
50317c927364SMatthew G. Knepley   } else {
50327c927364SMatthew G. Knepley     for (p = 0, off = 0; p < numFPoints*2; p += 2) {
50337c927364SMatthew G. Knepley       PetscInt o = ftotpoints[p+1];
50347c927364SMatthew G. Knepley       ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr);
50357c927364SMatthew G. Knepley       indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices);
50367c927364SMatthew G. Knepley     }
50377c927364SMatthew G. Knepley     for (p = 0, off = 0; p < numCPoints*2; p += 2) {
50387c927364SMatthew G. Knepley       PetscInt o = cpoints[p+1];
50397c927364SMatthew G. Knepley       ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr);
50407c927364SMatthew G. Knepley       indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices);
50417c927364SMatthew G. Knepley     }
50427c927364SMatthew G. Knepley   }
50437c927364SMatthew G. Knepley   ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr);
50447c927364SMatthew G. Knepley   ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr);
50457c927364SMatthew G. Knepley   PetscFunctionReturn(0);
50467c927364SMatthew G. Knepley }
50477c927364SMatthew G. Knepley 
50487c927364SMatthew G. Knepley #undef __FUNCT__
5049770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds"
5050f96281f8SMatthew G. Knepley /*@
5051f96281f8SMatthew G. Knepley   DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid
5052f96281f8SMatthew G. Knepley 
5053f96281f8SMatthew G. Knepley   Input Parameter:
5054f96281f8SMatthew G. Knepley . dm - The DMPlex object
5055f96281f8SMatthew G. Knepley 
5056f96281f8SMatthew G. Knepley   Output Parameters:
5057f96281f8SMatthew G. Knepley + cMax - The first hybrid cell
5058dc5a3409SMatthew G. Knepley . fMax - The first hybrid face
5059dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge
5060dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex
5061f96281f8SMatthew G. Knepley 
5062f96281f8SMatthew G. Knepley   Level: developer
5063f96281f8SMatthew G. Knepley 
5064dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds()
5065f96281f8SMatthew G. Knepley @*/
5066770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax)
5067552f7358SJed Brown {
5068552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5069770b213bSMatthew G Knepley   PetscInt       dim;
5070770b213bSMatthew G Knepley   PetscErrorCode ierr;
5071552f7358SJed Brown 
5072552f7358SJed Brown   PetscFunctionBegin;
5073552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5074c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
5075770b213bSMatthew G Knepley   if (cMax) *cMax = mesh->hybridPointMax[dim];
5076770b213bSMatthew G Knepley   if (fMax) *fMax = mesh->hybridPointMax[dim-1];
5077770b213bSMatthew G Knepley   if (eMax) *eMax = mesh->hybridPointMax[1];
5078770b213bSMatthew G Knepley   if (vMax) *vMax = mesh->hybridPointMax[0];
5079552f7358SJed Brown   PetscFunctionReturn(0);
5080552f7358SJed Brown }
5081552f7358SJed Brown 
5082552f7358SJed Brown #undef __FUNCT__
5083770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds"
5084dc5a3409SMatthew G. Knepley /*@
5085dc5a3409SMatthew G. Knepley   DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid
5086dc5a3409SMatthew G. Knepley 
5087dc5a3409SMatthew G. Knepley   Input Parameters:
5088dc5a3409SMatthew G. Knepley . dm   - The DMPlex object
5089dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell
5090dc5a3409SMatthew G. Knepley . fMax - The first hybrid face
5091dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge
5092dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex
5093dc5a3409SMatthew G. Knepley 
5094dc5a3409SMatthew G. Knepley   Level: developer
5095dc5a3409SMatthew G. Knepley 
5096dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds()
5097dc5a3409SMatthew G. Knepley @*/
5098770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax)
5099552f7358SJed Brown {
5100552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5101770b213bSMatthew G Knepley   PetscInt       dim;
5102770b213bSMatthew G Knepley   PetscErrorCode ierr;
5103552f7358SJed Brown 
5104552f7358SJed Brown   PetscFunctionBegin;
5105552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5106c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
5107770b213bSMatthew G Knepley   if (cMax >= 0) mesh->hybridPointMax[dim]   = cMax;
5108770b213bSMatthew G Knepley   if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax;
5109770b213bSMatthew G Knepley   if (eMax >= 0) mesh->hybridPointMax[1]     = eMax;
5110770b213bSMatthew G Knepley   if (vMax >= 0) mesh->hybridPointMax[0]     = vMax;
5111552f7358SJed Brown   PetscFunctionReturn(0);
5112552f7358SJed Brown }
5113552f7358SJed Brown 
5114552f7358SJed Brown #undef __FUNCT__
5115552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight"
5116552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight)
5117552f7358SJed Brown {
5118552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
5119552f7358SJed Brown 
5120552f7358SJed Brown   PetscFunctionBegin;
5121552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5122552f7358SJed Brown   PetscValidPointer(cellHeight, 2);
5123552f7358SJed Brown   *cellHeight = mesh->vtkCellHeight;
5124552f7358SJed Brown   PetscFunctionReturn(0);
5125552f7358SJed Brown }
5126552f7358SJed Brown 
5127552f7358SJed Brown #undef __FUNCT__
5128552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight"
5129552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight)
5130552f7358SJed Brown {
5131552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
5132552f7358SJed Brown 
5133552f7358SJed Brown   PetscFunctionBegin;
5134552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5135552f7358SJed Brown   mesh->vtkCellHeight = cellHeight;
5136552f7358SJed Brown   PetscFunctionReturn(0);
5137552f7358SJed Brown }
5138552f7358SJed Brown 
5139552f7358SJed Brown #undef __FUNCT__
5140552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private"
5141552f7358SJed Brown /* We can easily have a form that takes an IS instead */
5142ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering)
5143552f7358SJed Brown {
5144552f7358SJed Brown   PetscSection   section, globalSection;
5145552f7358SJed Brown   PetscInt      *numbers, p;
5146552f7358SJed Brown   PetscErrorCode ierr;
5147552f7358SJed Brown 
5148552f7358SJed Brown   PetscFunctionBegin;
514982f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &section);CHKERRQ(ierr);
5150552f7358SJed Brown   ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr);
5151552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
5152552f7358SJed Brown     ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr);
5153552f7358SJed Brown   }
5154552f7358SJed Brown   ierr = PetscSectionSetUp(section);CHKERRQ(ierr);
5155552f7358SJed Brown   ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr);
5156785e854fSJed Brown   ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr);
5157552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
5158552f7358SJed Brown     ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr);
5159ef48cebcSMatthew G. Knepley     if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift;
5160ef48cebcSMatthew G. Knepley     else                       numbers[p-pStart] += shift;
5161552f7358SJed Brown   }
516282f516ccSBarry Smith   ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr);
5163ef48cebcSMatthew G. Knepley   if (globalSize) {
5164ef48cebcSMatthew G. Knepley     PetscLayout layout;
5165ef48cebcSMatthew G. Knepley     ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr);
5166ef48cebcSMatthew G. Knepley     ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr);
5167ef48cebcSMatthew G. Knepley     ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr);
5168ef48cebcSMatthew G. Knepley   }
5169552f7358SJed Brown   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
5170552f7358SJed Brown   ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr);
5171552f7358SJed Brown   PetscFunctionReturn(0);
5172552f7358SJed Brown }
5173552f7358SJed Brown 
5174552f7358SJed Brown #undef __FUNCT__
5175552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering"
5176552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers)
5177552f7358SJed Brown {
5178552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5179552f7358SJed Brown   PetscInt       cellHeight, cStart, cEnd, cMax;
5180552f7358SJed Brown   PetscErrorCode ierr;
5181552f7358SJed Brown 
5182552f7358SJed Brown   PetscFunctionBegin;
5183552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5184552f7358SJed Brown   if (!mesh->globalCellNumbers) {
5185552f7358SJed Brown     ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr);
5186552f7358SJed Brown     ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr);
51870298fd71SBarry Smith     ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
51880d644c17SKarl Rupp     if (cMax >= 0) cEnd = PetscMin(cEnd, cMax);
5189ef48cebcSMatthew G. Knepley     ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr);
5190552f7358SJed Brown   }
5191552f7358SJed Brown   *globalCellNumbers = mesh->globalCellNumbers;
5192552f7358SJed Brown   PetscFunctionReturn(0);
5193552f7358SJed Brown }
5194552f7358SJed Brown 
5195552f7358SJed Brown #undef __FUNCT__
5196552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering"
5197552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers)
5198552f7358SJed Brown {
5199552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5200552f7358SJed Brown   PetscInt       vStart, vEnd, vMax;
5201552f7358SJed Brown   PetscErrorCode ierr;
5202552f7358SJed Brown 
5203552f7358SJed Brown   PetscFunctionBegin;
5204552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5205552f7358SJed Brown   if (!mesh->globalVertexNumbers) {
5206552f7358SJed Brown     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
52070298fd71SBarry Smith     ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr);
52080d644c17SKarl Rupp     if (vMax >= 0) vEnd = PetscMin(vEnd, vMax);
5209ef48cebcSMatthew G. Knepley     ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr);
5210552f7358SJed Brown   }
5211552f7358SJed Brown   *globalVertexNumbers = mesh->globalVertexNumbers;
5212552f7358SJed Brown   PetscFunctionReturn(0);
5213552f7358SJed Brown }
5214552f7358SJed Brown 
5215ef48cebcSMatthew G. Knepley #undef __FUNCT__
5216ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering"
5217ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers)
5218ef48cebcSMatthew G. Knepley {
5219ef48cebcSMatthew G. Knepley   IS             nums[4];
5220ef48cebcSMatthew G. Knepley   PetscInt       depths[4];
5221ef48cebcSMatthew G. Knepley   PetscInt       depth, d, shift = 0;
5222ef48cebcSMatthew G. Knepley   PetscErrorCode ierr;
5223ef48cebcSMatthew G. Knepley 
5224ef48cebcSMatthew G. Knepley   PetscFunctionBegin;
5225ef48cebcSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5226ef48cebcSMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
5227*8abc87a0SMichael Lange   /* For unstratified meshes use dim instead of depth */
5228*8abc87a0SMichael Lange   if (depth < 0) {ierr = DMGetDimension(dm, &depth);CHKERRQ(ierr);}
5229ef48cebcSMatthew G. Knepley   depths[0] = depth; depths[1] = 0;
5230ef48cebcSMatthew G. Knepley   for (d = 2; d <= depth; ++d) depths[d] = depth-d+1;
5231ef48cebcSMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
5232ef48cebcSMatthew G. Knepley     PetscInt pStart, pEnd, gsize;
5233ef48cebcSMatthew G. Knepley 
5234ef48cebcSMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr);
5235ef48cebcSMatthew G. Knepley     ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr);
5236ef48cebcSMatthew G. Knepley     shift += gsize;
5237ef48cebcSMatthew G. Knepley   }
5238ef48cebcSMatthew G. Knepley   ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers);
5239ef48cebcSMatthew G. Knepley   for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);}
5240ef48cebcSMatthew G. Knepley   PetscFunctionReturn(0);
5241ef48cebcSMatthew G. Knepley }
5242ef48cebcSMatthew G. Knepley 
5243552f7358SJed Brown 
5244552f7358SJed Brown #undef __FUNCT__
5245552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel"
5246552f7358SJed Brown /*@C
5247552f7358SJed Brown   PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using
5248552f7358SJed Brown   the local section and an SF describing the section point overlap.
5249552f7358SJed Brown 
5250552f7358SJed Brown   Input Parameters:
5251552f7358SJed Brown   + s - The PetscSection for the local field layout
5252552f7358SJed Brown   . sf - The SF describing parallel layout of the section points
5253552f7358SJed Brown   . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs
5254552f7358SJed Brown   . label - The label specifying the points
5255552f7358SJed Brown   - labelValue - The label stratum specifying the points
5256552f7358SJed Brown 
5257552f7358SJed Brown   Output Parameter:
5258552f7358SJed Brown   . gsection - The PetscSection for the global field layout
5259552f7358SJed Brown 
5260552f7358SJed Brown   Note: This gives negative sizes and offsets to points not owned by this process
5261552f7358SJed Brown 
5262552f7358SJed Brown   Level: developer
5263552f7358SJed Brown 
5264552f7358SJed Brown .seealso: PetscSectionCreate()
5265552f7358SJed Brown @*/
5266552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection)
5267552f7358SJed Brown {
52687ec39499SMatthew G. Knepley   PetscInt      *neg = NULL, *tmpOff = NULL;
5269552f7358SJed Brown   PetscInt       pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots;
5270552f7358SJed Brown   PetscErrorCode ierr;
5271552f7358SJed Brown 
5272552f7358SJed Brown   PetscFunctionBegin;
52734c0d72c2SMatthew G. Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr);
5274552f7358SJed Brown   ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr);
5275552f7358SJed Brown   ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr);
52767ec39499SMatthew G. Knepley   ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr);
52777ec39499SMatthew G. Knepley   if (nroots >= 0) {
52787ec39499SMatthew G. Knepley     if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart);
52791795a4d1SJed Brown     ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr);
52807ec39499SMatthew G. Knepley     if (nroots > pEnd-pStart) {
52811795a4d1SJed Brown       ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr);
52827ec39499SMatthew G. Knepley     } else {
52837ec39499SMatthew G. Knepley       tmpOff = &(*gsection)->atlasDof[-pStart];
52847ec39499SMatthew G. Knepley     }
52857ec39499SMatthew G. Knepley   }
5286552f7358SJed Brown   /* Mark ghost points with negative dof */
5287552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
5288552f7358SJed Brown     PetscInt value;
5289552f7358SJed Brown 
5290552f7358SJed Brown     ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr);
5291552f7358SJed Brown     if (value != labelValue) continue;
5292552f7358SJed Brown     ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr);
5293552f7358SJed Brown     ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr);
5294552f7358SJed Brown     ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr);
5295552f7358SJed Brown     if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);}
52967ec39499SMatthew G. Knepley     if (neg) neg[p] = -(dof+1);
5297552f7358SJed Brown   }
5298552f7358SJed Brown   ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr);
5299552f7358SJed Brown   if (nroots >= 0) {
53007ec39499SMatthew G. Knepley     ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
53017ec39499SMatthew G. Knepley     ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
5302552f7358SJed Brown     if (nroots > pEnd-pStart) {
53037ec39499SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];}
5304552f7358SJed Brown     }
5305552f7358SJed Brown   }
5306552f7358SJed Brown   /* Calculate new sizes, get proccess offset, and calculate point offsets */
5307552f7358SJed Brown   for (p = 0, off = 0; p < pEnd-pStart; ++p) {
5308552f7358SJed Brown     cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0;
5309552f7358SJed Brown     (*gsection)->atlasOff[p] = off;
5310552f7358SJed Brown     off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0;
5311552f7358SJed Brown   }
53124c0d72c2SMatthew G. Knepley   ierr       = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr);
5313552f7358SJed Brown   globalOff -= off;
5314552f7358SJed Brown   for (p = 0, off = 0; p < pEnd-pStart; ++p) {
5315552f7358SJed Brown     (*gsection)->atlasOff[p] += globalOff;
53167ec39499SMatthew G. Knepley     if (neg) neg[p] = -((*gsection)->atlasOff[p]+1);
5317552f7358SJed Brown   }
5318552f7358SJed Brown   /* Put in negative offsets for ghost points */
5319552f7358SJed Brown   if (nroots >= 0) {
53207ec39499SMatthew G. Knepley     ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
53217ec39499SMatthew G. Knepley     ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
5322552f7358SJed Brown     if (nroots > pEnd-pStart) {
53237ec39499SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];}
5324552f7358SJed Brown     }
5325552f7358SJed Brown   }
53267ec39499SMatthew G. Knepley   if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);}
5327552f7358SJed Brown   ierr = PetscFree(neg);CHKERRQ(ierr);
5328552f7358SJed Brown   PetscFunctionReturn(0);
5329552f7358SJed Brown }
5330ca8062c8SMatthew G. Knepley 
5331ca8062c8SMatthew G. Knepley #undef __FUNCT__
5332ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry"
5333ca8062c8SMatthew G. Knepley /*@
5334ca8062c8SMatthew G. Knepley   DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric.
5335ca8062c8SMatthew G. Knepley 
5336ca8062c8SMatthew G. Knepley   Input Parameters:
5337ca8062c8SMatthew G. Knepley   + dm - The DMPlex object
5338ca8062c8SMatthew G. Knepley 
5339ca8062c8SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
5340ca8062c8SMatthew G. Knepley 
5341ca8062c8SMatthew G. Knepley   Level: developer
5342ca8062c8SMatthew G. Knepley 
53439bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces()
5344ca8062c8SMatthew G. Knepley @*/
5345ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm)
5346ca8062c8SMatthew G. Knepley {
5347ca8062c8SMatthew G. Knepley   PetscSection    coneSection, supportSection;
5348ca8062c8SMatthew G. Knepley   const PetscInt *cone, *support;
5349ca8062c8SMatthew G. Knepley   PetscInt        coneSize, c, supportSize, s;
5350ca8062c8SMatthew G. Knepley   PetscInt        pStart, pEnd, p, csize, ssize;
5351ca8062c8SMatthew G. Knepley   PetscErrorCode  ierr;
5352ca8062c8SMatthew G. Knepley 
5353ca8062c8SMatthew G. Knepley   PetscFunctionBegin;
5354ca8062c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5355ca8062c8SMatthew G. Knepley   ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr);
5356ca8062c8SMatthew G. Knepley   ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr);
5357ca8062c8SMatthew G. Knepley   /* Check that point p is found in the support of its cone points, and vice versa */
5358ca8062c8SMatthew G. Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
5359ca8062c8SMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {
5360ca8062c8SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
5361ca8062c8SMatthew G. Knepley     ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr);
5362ca8062c8SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
536342e66dfaSMatthew G. Knepley       PetscBool dup = PETSC_FALSE;
536442e66dfaSMatthew G. Knepley       PetscInt  d;
536542e66dfaSMatthew G. Knepley       for (d = c-1; d >= 0; --d) {
536642e66dfaSMatthew G. Knepley         if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;}
536742e66dfaSMatthew G. Knepley       }
5368ca8062c8SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr);
5369ca8062c8SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr);
5370ca8062c8SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
5371ca8062c8SMatthew G. Knepley         if (support[s] == p) break;
5372ca8062c8SMatthew G. Knepley       }
537342e66dfaSMatthew G. Knepley       if ((s >= supportSize) || (dup && (support[s+1] != p))) {
5374ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p);
5375ca8062c8SMatthew G. Knepley         for (s = 0; s < coneSize; ++s) {
5376ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]);
5377ca8062c8SMatthew G. Knepley         }
5378ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
5379ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]);
5380ca8062c8SMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
5381ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]);
5382ca8062c8SMatthew G. Knepley         }
5383ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
538442e66dfaSMatthew G. Knepley         if (dup) {
538542e66dfaSMatthew G. Knepley           SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]);
538642e66dfaSMatthew G. Knepley         } else {
5387ca8062c8SMatthew G. Knepley           SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]);
5388ca8062c8SMatthew G. Knepley         }
5389ca8062c8SMatthew G. Knepley       }
539042e66dfaSMatthew G. Knepley     }
5391ca8062c8SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
5392ca8062c8SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr);
5393ca8062c8SMatthew G. Knepley     for (s = 0; s < supportSize; ++s) {
5394ca8062c8SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
5395ca8062c8SMatthew G. Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
5396ca8062c8SMatthew G. Knepley       for (c = 0; c < coneSize; ++c) {
5397ca8062c8SMatthew G. Knepley         if (cone[c] == p) break;
5398ca8062c8SMatthew G. Knepley       }
5399ca8062c8SMatthew G. Knepley       if (c >= coneSize) {
5400ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p);
5401ca8062c8SMatthew G. Knepley         for (c = 0; c < supportSize; ++c) {
5402ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]);
5403ca8062c8SMatthew G. Knepley         }
5404ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
5405ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]);
5406ca8062c8SMatthew G. Knepley         for (c = 0; c < coneSize; ++c) {
5407ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]);
5408ca8062c8SMatthew G. Knepley         }
5409ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
5410ca8062c8SMatthew G. Knepley         SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]);
5411ca8062c8SMatthew G. Knepley       }
5412ca8062c8SMatthew G. Knepley     }
5413ca8062c8SMatthew G. Knepley   }
5414ca8062c8SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr);
5415ca8062c8SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr);
5416ca8062c8SMatthew G. Knepley   if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize);
5417ca8062c8SMatthew G. Knepley   PetscFunctionReturn(0);
5418ca8062c8SMatthew G. Knepley }
5419ca8062c8SMatthew G. Knepley 
5420ca8062c8SMatthew G. Knepley #undef __FUNCT__
5421ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton"
5422ca8062c8SMatthew G. Knepley /*@
5423ca8062c8SMatthew G. Knepley   DMPlexCheckSkeleton - Check that each cell has the correct number of vertices
5424ca8062c8SMatthew G. Knepley 
5425ca8062c8SMatthew G. Knepley   Input Parameters:
5426ca8062c8SMatthew G. Knepley + dm - The DMPlex object
542758723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products
542858723a97SMatthew G. Knepley - cellHeight - Normally 0
5429ca8062c8SMatthew G. Knepley 
5430ca8062c8SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
5431ca8062c8SMatthew G. Knepley 
5432ca8062c8SMatthew G. Knepley   Level: developer
5433ca8062c8SMatthew G. Knepley 
54349bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces()
5435ca8062c8SMatthew G. Knepley @*/
543658723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight)
5437ca8062c8SMatthew G. Knepley {
543842363296SMatthew G. Knepley   PetscInt       dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c;
5439ca8062c8SMatthew G. Knepley   PetscErrorCode ierr;
5440ca8062c8SMatthew G. Knepley 
5441ca8062c8SMatthew G. Knepley   PetscFunctionBegin;
5442ca8062c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5443c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
5444ca8062c8SMatthew G. Knepley   switch (dim) {
544542363296SMatthew G. Knepley   case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break;
544642363296SMatthew G. Knepley   case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break;
544742363296SMatthew G. Knepley   case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break;
5448ca8062c8SMatthew G. Knepley   default:
5449ca8062c8SMatthew G. Knepley     SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim);
5450ca8062c8SMatthew G. Knepley   }
545158723a97SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
545258723a97SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr);
5453ca8062c8SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
5454ca8062c8SMatthew G. Knepley   cMax = cMax >= 0 ? cMax : cEnd;
5455ca8062c8SMatthew G. Knepley   for (c = cStart; c < cMax; ++c) {
545658723a97SMatthew G. Knepley     PetscInt *closure = NULL, closureSize, cl, coneSize = 0;
545758723a97SMatthew G. Knepley 
545858723a97SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
545958723a97SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
546058723a97SMatthew G. Knepley       const PetscInt p = closure[cl];
546158723a97SMatthew G. Knepley       if ((p >= vStart) && (p < vEnd)) ++coneSize;
546258723a97SMatthew G. Knepley     }
546358723a97SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
5464ca8062c8SMatthew G. Knepley     if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has  %d vertices != %d", c, coneSize, numCorners);
5465ca8062c8SMatthew G. Knepley   }
546642363296SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
546742363296SMatthew G. Knepley     PetscInt *closure = NULL, closureSize, cl, coneSize = 0;
546842363296SMatthew G. Knepley 
546942363296SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
547042363296SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
547142363296SMatthew G. Knepley       const PetscInt p = closure[cl];
547242363296SMatthew G. Knepley       if ((p >= vStart) && (p < vEnd)) ++coneSize;
547342363296SMatthew G. Knepley     }
547442363296SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
547542363296SMatthew G. Knepley     if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has  %d vertices > %d", c, coneSize, numHybridCorners);
547642363296SMatthew G. Knepley   }
5477ca8062c8SMatthew G. Knepley   PetscFunctionReturn(0);
5478ca8062c8SMatthew G. Knepley }
54799bf0dad6SMatthew G. Knepley 
54809bf0dad6SMatthew G. Knepley #undef __FUNCT__
54819bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces"
54829bf0dad6SMatthew G. Knepley /*@
54839bf0dad6SMatthew G. Knepley   DMPlexCheckFaces - Check that the faces of each cell give a vertex order this is consistent with what we expect from the cell type
54849bf0dad6SMatthew G. Knepley 
54859bf0dad6SMatthew G. Knepley   Input Parameters:
54869bf0dad6SMatthew G. Knepley + dm - The DMPlex object
54879bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products
54889bf0dad6SMatthew G. Knepley - cellHeight - Normally 0
54899bf0dad6SMatthew G. Knepley 
54909bf0dad6SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
54919bf0dad6SMatthew G. Knepley 
54929bf0dad6SMatthew G. Knepley   Level: developer
54939bf0dad6SMatthew G. Knepley 
54949bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton()
54959bf0dad6SMatthew G. Knepley @*/
54969bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight)
54979bf0dad6SMatthew G. Knepley {
54983554e41dSMatthew G. Knepley   PetscInt       pMax[4];
54993554e41dSMatthew G. Knepley   PetscInt       dim, vStart, vEnd, cStart, cEnd, c, h;
55009bf0dad6SMatthew G. Knepley   PetscErrorCode ierr;
55019bf0dad6SMatthew G. Knepley 
55029bf0dad6SMatthew G. Knepley   PetscFunctionBegin;
55039bf0dad6SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5504c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
55059bf0dad6SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
550625abba81SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr);
55073554e41dSMatthew G. Knepley   for (h = cellHeight; h < dim; ++h) {
55083554e41dSMatthew G. Knepley     ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr);
55093554e41dSMatthew G. Knepley     for (c = cStart; c < cEnd; ++c) {
55109bf0dad6SMatthew G. Knepley       const PetscInt *cone, *ornt, *faces;
55119bf0dad6SMatthew G. Knepley       PetscInt        numFaces, faceSize, coneSize,f;
55129bf0dad6SMatthew G. Knepley       PetscInt       *closure = NULL, closureSize, cl, numCorners = 0;
55139bf0dad6SMatthew G. Knepley 
551425abba81SMatthew G. Knepley       if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue;
55159bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
55169bf0dad6SMatthew G. Knepley       ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
55179bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr);
55189bf0dad6SMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
55199bf0dad6SMatthew G. Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
55209bf0dad6SMatthew G. Knepley         const PetscInt p = closure[cl];
55219bf0dad6SMatthew G. Knepley         if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p;
55229bf0dad6SMatthew G. Knepley       }
55233554e41dSMatthew G. Knepley       ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr);
55249bf0dad6SMatthew G. Knepley       if (coneSize != numFaces) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d faces but should have %d", c, coneSize, numFaces);
55259bf0dad6SMatthew G. Knepley       for (f = 0; f < numFaces; ++f) {
55269bf0dad6SMatthew G. Knepley         PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v;
55279bf0dad6SMatthew G. Knepley 
55289bf0dad6SMatthew G. Knepley         ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr);
55299bf0dad6SMatthew G. Knepley         for (cl = 0; cl < fclosureSize*2; cl += 2) {
55309bf0dad6SMatthew G. Knepley           const PetscInt p = fclosure[cl];
55319bf0dad6SMatthew G. Knepley           if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p;
55329bf0dad6SMatthew G. Knepley         }
5533e003ed69SMatthew G. Knepley         if (fnumCorners != faceSize) SETERRQ5(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d (%d) of cell %d has %d vertices but should have %d", cone[f], f, c, fnumCorners, faceSize);
55349bf0dad6SMatthew G. Knepley         for (v = 0; v < fnumCorners; ++v) {
5535e003ed69SMatthew G. Knepley           if (fclosure[v] != faces[f*faceSize+v]) SETERRQ6(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d (%d) of cell %d vertex %d, %d != %d", cone[f], f, c, v, fclosure[v], faces[f*faceSize+v]);
55369bf0dad6SMatthew G. Knepley         }
55379bf0dad6SMatthew G. Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr);
55389bf0dad6SMatthew G. Knepley       }
55399bf0dad6SMatthew G. Knepley       ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr);
55409bf0dad6SMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
55419bf0dad6SMatthew G. Knepley     }
55423554e41dSMatthew G. Knepley   }
5543552f7358SJed Brown   PetscFunctionReturn(0);
5544552f7358SJed Brown }
55453913d7c8SMatthew G. Knepley 
55463913d7c8SMatthew G. Knepley #undef __FUNCT__
5547bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex"
5548bceba477SMatthew G. Knepley /* Pointwise interpolation
5549bceba477SMatthew G. Knepley      Just code FEM for now
5550bceba477SMatthew G. Knepley      u^f = I u^c
55514ca5e9f5SMatthew G. Knepley      sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j
55524ca5e9f5SMatthew G. Knepley      u^f_i = sum_j psi^f_i I phi^c_j u^c_j
55534ca5e9f5SMatthew G. Knepley      I_{ij} = psi^f_i phi^c_j
5554bceba477SMatthew G. Knepley */
5555bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling)
5556bceba477SMatthew G. Knepley {
5557bceba477SMatthew G. Knepley   PetscSection   gsc, gsf;
5558bceba477SMatthew G. Knepley   PetscInt       m, n;
5559a063dac3SMatthew G. Knepley   void          *ctx;
5560bceba477SMatthew G. Knepley   PetscErrorCode ierr;
5561bceba477SMatthew G. Knepley 
5562bceba477SMatthew G. Knepley   PetscFunctionBegin;
5563bceba477SMatthew G. Knepley   /*
5564bceba477SMatthew G. Knepley   Loop over coarse cells
5565bceba477SMatthew G. Knepley     Loop over coarse basis functions
5566bceba477SMatthew G. Knepley       Loop over fine cells in coarse cell
5567bceba477SMatthew G. Knepley         Loop over fine dual basis functions
5568bceba477SMatthew G. Knepley           Evaluate coarse basis on fine dual basis quad points
5569bceba477SMatthew G. Knepley           Sum
5570bceba477SMatthew G. Knepley           Update local element matrix
5571bceba477SMatthew G. Knepley     Accumulate to interpolation matrix
5572bceba477SMatthew G. Knepley 
5573bceba477SMatthew G. Knepley    Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop
5574bceba477SMatthew G. Knepley   */
5575bceba477SMatthew G. Knepley   ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr);
5576bceba477SMatthew G. Knepley   ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr);
5577bceba477SMatthew G. Knepley   ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr);
5578bceba477SMatthew G. Knepley   ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr);
5579bceba477SMatthew G. Knepley   /* We need to preallocate properly */
5580bceba477SMatthew G. Knepley   ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr);
5581bceba477SMatthew G. Knepley   ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
5582bceba477SMatthew G. Knepley   ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr);
5583a063dac3SMatthew G. Knepley   ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr);
5584a063dac3SMatthew G. Knepley   ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr);
55855d1c2e58SMatthew G. Knepley   /* Use naive scaling */
55865d1c2e58SMatthew G. Knepley   ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr);
5587a063dac3SMatthew G. Knepley   PetscFunctionReturn(0);
5588a063dac3SMatthew G. Knepley }
5589bceba477SMatthew G. Knepley 
5590a063dac3SMatthew G. Knepley #undef __FUNCT__
5591a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex"
5592a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx)
5593a063dac3SMatthew G. Knepley {
559490748bafSMatthew G. Knepley   PetscErrorCode ierr;
559590748bafSMatthew G. Knepley 
5596a063dac3SMatthew G. Knepley   PetscFunctionBegin;
55977c927364SMatthew G. Knepley   ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr);
5598bceba477SMatthew G. Knepley   PetscFunctionReturn(0);
5599bceba477SMatthew G. Knepley }
5600bceba477SMatthew G. Knepley 
5601bceba477SMatthew G. Knepley #undef __FUNCT__
5602fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex"
5603fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm)
5604fd59a867SMatthew G. Knepley {
5605fd59a867SMatthew G. Knepley   PetscSection   section;
5606fd59a867SMatthew G. Knepley   IS            *bcPoints;
5607ebb3236fSMatthew G. Knepley   PetscBool     *isFE;
5608286d8613SMatthew G. Knepley   PetscInt      *bcFields, *numComp, *numDof;
5609ebb3236fSMatthew G. Knepley   PetscInt       depth, dim, numBd, numBC = 0, numFields, bd, bc = 0, f;
5610ebb3236fSMatthew G. Knepley   PetscInt       cStart, cEnd, cEndInterior;
5611fd59a867SMatthew G. Knepley   PetscErrorCode ierr;
5612fd59a867SMatthew G. Knepley 
5613fd59a867SMatthew G. Knepley   PetscFunctionBegin;
5614ebb3236fSMatthew G. Knepley   ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr);
5615ebb3236fSMatthew G. Knepley   /* FE and FV boundary conditions are handled slightly differently */
5616ebb3236fSMatthew G. Knepley   ierr = PetscMalloc1(numFields, &isFE);CHKERRQ(ierr);
5617ebb3236fSMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
5618ebb3236fSMatthew G. Knepley     PetscObject  obj;
5619ebb3236fSMatthew G. Knepley     PetscClassId id;
5620ebb3236fSMatthew G. Knepley 
5621ebb3236fSMatthew G. Knepley     ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr);
5622ebb3236fSMatthew G. Knepley     ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr);
5623ebb3236fSMatthew G. Knepley     if (id == PETSCFE_CLASSID)      {isFE[f] = PETSC_TRUE;}
5624ebb3236fSMatthew G. Knepley     else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;}
5625ebb3236fSMatthew G. Knepley     else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Unknown discretization type for field %d", f);
5626ebb3236fSMatthew G. Knepley   }
5627ebb3236fSMatthew G. Knepley   /* Allocate boundary point storage */
5628286d8613SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
5629c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
5630ebb3236fSMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
5631ebb3236fSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr);
5632fd59a867SMatthew G. Knepley   ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr);
5633fd59a867SMatthew G. Knepley   for (bd = 0; bd < numBd; ++bd) {
5634fd59a867SMatthew G. Knepley     PetscBool isEssential;
563563d5297fSMatthew G. Knepley     ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr);
5636fd59a867SMatthew G. Knepley     if (isEssential) ++numBC;
5637fd59a867SMatthew G. Knepley   }
5638ebb3236fSMatthew G. Knepley   for (f = 0; f < numFields; ++f) if (!isFE[f] && cEndInterior >= 0) ++numBC;
5639fd59a867SMatthew G. Knepley   ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr);
5640ebb3236fSMatthew G. Knepley   /* Constrain ghost cells for FV */
5641ebb3236fSMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
5642ebb3236fSMatthew G. Knepley     PetscInt *newidx, c;
5643ebb3236fSMatthew G. Knepley 
5644ebb3236fSMatthew G. Knepley     if (isFE[f] || cEndInterior < 0) continue;
5645ebb3236fSMatthew G. Knepley     ierr = PetscMalloc1(cEnd-cEndInterior,&newidx);CHKERRQ(ierr);
5646ebb3236fSMatthew G. Knepley     for (c = cEndInterior; c < cEnd; ++c) newidx[c-cEndInterior] = c;
5647ebb3236fSMatthew G. Knepley     bcFields[bc] = f;
5648ebb3236fSMatthew G. Knepley     ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), cEnd-cEndInterior, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr);
5649ebb3236fSMatthew G. Knepley   }
5650ebb3236fSMatthew G. Knepley   /* Handle FEM Dirichlet boundaries */
5651ebb3236fSMatthew G. Knepley   for (bd = 0; bd < numBd; ++bd) {
5652fd59a867SMatthew G. Knepley     const char     *bdLabel;
5653fd59a867SMatthew G. Knepley     DMLabel         label;
5654fd59a867SMatthew G. Knepley     const PetscInt *values;
56557391c1cbSMatthew G. Knepley     PetscInt        bd2, field, numValues;
5656c945be8dSMatthew G. Knepley     PetscBool       isEssential, duplicate = PETSC_FALSE;
5657fd59a867SMatthew G. Knepley 
565863d5297fSMatthew G. Knepley     ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr);
5659fd59a867SMatthew G. Knepley     ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr);
5660ebb3236fSMatthew G. Knepley     /* Only want to modify label once */
56617391c1cbSMatthew G. Knepley     for (bd2 = 0; bd2 < bd; ++bd2) {
56627391c1cbSMatthew G. Knepley       const char *bdname;
56632f81efd2SMatthew G. Knepley       ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr);
56647391c1cbSMatthew G. Knepley       ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr);
56657391c1cbSMatthew G. Knepley       if (duplicate) break;
56667391c1cbSMatthew G. Knepley     }
5667ebb3236fSMatthew G. Knepley     if (!duplicate && (isFE[field])) {
5668fd59a867SMatthew G. Knepley       ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr);
566932720fa8SMatthew G. Knepley       ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr);
56707391c1cbSMatthew G. Knepley     }
5671ebb3236fSMatthew G. Knepley     /* Filter out cells, if you actually want to constrain cells you need to do things by hand right now */
5672fd59a867SMatthew G. Knepley     if (isEssential) {
567393a5981aSMatthew G. Knepley       PetscInt       *newidx;
5674ebb3236fSMatthew G. Knepley       PetscInt        n, newn = 0, p, v;
567593a5981aSMatthew G. Knepley 
5676fd59a867SMatthew G. Knepley       bcFields[bc] = field;
5677ebb3236fSMatthew G. Knepley       for (v = 0; v < numValues; ++v) {
5678ebb3236fSMatthew G. Knepley         IS              tmp;
5679ebb3236fSMatthew G. Knepley         const PetscInt *idx;
5680ebb3236fSMatthew G. Knepley 
5681ebb3236fSMatthew G. Knepley         ierr = DMPlexGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr);
5682ebb3236fSMatthew G. Knepley         if (!tmp) continue;
568393a5981aSMatthew G. Knepley         ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr);
568493a5981aSMatthew G. Knepley         ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr);
5685ebb3236fSMatthew G. Knepley         if (isFE[field]) {
568693a5981aSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn;
5687ebb3236fSMatthew G. Knepley         } else {
5688ebb3236fSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) ++newn;
5689ebb3236fSMatthew G. Knepley         }
569093a5981aSMatthew G. Knepley         ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr);
569193a5981aSMatthew G. Knepley         ierr = ISDestroy(&tmp);CHKERRQ(ierr);
5692fd59a867SMatthew G. Knepley       }
5693ebb3236fSMatthew G. Knepley       ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr);
5694ebb3236fSMatthew G. Knepley       newn = 0;
5695ebb3236fSMatthew G. Knepley       for (v = 0; v < numValues; ++v) {
5696ebb3236fSMatthew G. Knepley         IS              tmp;
5697ebb3236fSMatthew G. Knepley         const PetscInt *idx;
5698ebb3236fSMatthew G. Knepley 
5699ebb3236fSMatthew G. Knepley         ierr = DMPlexGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr);
5700ebb3236fSMatthew G. Knepley         if (!tmp) continue;
5701ebb3236fSMatthew G. Knepley         ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr);
5702ebb3236fSMatthew G. Knepley         ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr);
5703ebb3236fSMatthew G. Knepley         if (isFE[field]) {
5704ebb3236fSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p];
5705ebb3236fSMatthew G. Knepley         } else {
5706ebb3236fSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) newidx[newn++] = idx[p];
5707ebb3236fSMatthew G. Knepley         }
5708ebb3236fSMatthew G. Knepley         ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr);
5709ebb3236fSMatthew G. Knepley         ierr = ISDestroy(&tmp);CHKERRQ(ierr);
5710ebb3236fSMatthew G. Knepley       }
5711ebb3236fSMatthew G. Knepley       ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr);
5712ebb3236fSMatthew G. Knepley     }
5713fd59a867SMatthew G. Knepley   }
5714fd59a867SMatthew G. Knepley   /* Handle discretization */
5715ebb3236fSMatthew G. Knepley   ierr = PetscCalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr);
5716fd59a867SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
57170bacfa0aSMatthew G. Knepley     PetscObject obj;
57180bacfa0aSMatthew G. Knepley 
57190bacfa0aSMatthew G. Knepley     ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr);
5720ebb3236fSMatthew G. Knepley     if (isFE[f]) {
57210bacfa0aSMatthew G. Knepley       PetscFE         fe = (PetscFE) obj;
5722286d8613SMatthew G. Knepley       const PetscInt *numFieldDof;
5723fd59a867SMatthew G. Knepley       PetscInt        d;
5724fd59a867SMatthew G. Knepley 
5725fd59a867SMatthew G. Knepley       ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr);
5726286d8613SMatthew G. Knepley       ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr);
5727286d8613SMatthew G. Knepley       for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d];
5728ebb3236fSMatthew G. Knepley     } else {
57290bacfa0aSMatthew G. Knepley       PetscFV fv = (PetscFV) obj;
57300bacfa0aSMatthew G. Knepley 
57310bacfa0aSMatthew G. Knepley       ierr = PetscFVGetNumComponents(fv, &numComp[f]);CHKERRQ(ierr);
57320bacfa0aSMatthew G. Knepley       numDof[f*(dim+1)+dim] = numComp[f];
5733ebb3236fSMatthew G. Knepley     }
5734fd59a867SMatthew G. Knepley   }
5735286d8613SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
5736286d8613SMatthew G. Knepley     PetscInt d;
5737286d8613SMatthew G. Knepley     for (d = 1; d < dim; ++d) {
5738286d8613SMatthew G. Knepley       if ((numDof[f*(dim+1)+d] > 0) && (depth < dim)) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Mesh must be interpolated when unknowns are specified on edges or faces.");
5739286d8613SMatthew G. Knepley     }
5740286d8613SMatthew G. Knepley   }
5741f8f126e8SMatthew G. Knepley   ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, &section);CHKERRQ(ierr);
5742fd59a867SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
5743fd59a867SMatthew G. Knepley     PetscFE     fe;
5744fd59a867SMatthew G. Knepley     const char *name;
574518abd763SMatthew G. Knepley 
574618abd763SMatthew G. Knepley     ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr);
5747fd59a867SMatthew G. Knepley     ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr);
5748fd59a867SMatthew G. Knepley     ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr);
5749fd59a867SMatthew G. Knepley   }
5750fd59a867SMatthew G. Knepley   ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr);
5751fd59a867SMatthew G. Knepley   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
5752fd59a867SMatthew G. Knepley   for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);}
5753fd59a867SMatthew G. Knepley   ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr);
5754286d8613SMatthew G. Knepley   ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr);
5755ebb3236fSMatthew G. Knepley   ierr = PetscFree(isFE);CHKERRQ(ierr);
5756bceba477SMatthew G. Knepley   PetscFunctionReturn(0);
5757bceba477SMatthew G. Knepley }
5758bceba477SMatthew G. Knepley 
5759bceba477SMatthew G. Knepley #undef __FUNCT__
57603913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM"
57613913d7c8SMatthew G. Knepley /*@
57623913d7c8SMatthew G. Knepley   DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement
57633913d7c8SMatthew G. Knepley 
57643913d7c8SMatthew G. Knepley   Input Parameter:
57653913d7c8SMatthew G. Knepley . dm - The DMPlex object
57663913d7c8SMatthew G. Knepley 
57673913d7c8SMatthew G. Knepley   Output Parameter:
57683913d7c8SMatthew G. Knepley . cdm - The coarse DM
57693913d7c8SMatthew G. Knepley 
57703913d7c8SMatthew G. Knepley   Level: intermediate
57713913d7c8SMatthew G. Knepley 
57723913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM()
57733913d7c8SMatthew G. Knepley @*/
57743913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm)
57753913d7c8SMatthew G. Knepley {
57763913d7c8SMatthew G. Knepley   PetscFunctionBegin;
57773913d7c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
57783913d7c8SMatthew G. Knepley   PetscValidPointer(cdm, 2);
57793913d7c8SMatthew G. Knepley   *cdm = ((DM_Plex *) dm->data)->coarseMesh;
57803913d7c8SMatthew G. Knepley   PetscFunctionReturn(0);
57813913d7c8SMatthew G. Knepley }
57823913d7c8SMatthew G. Knepley 
57833913d7c8SMatthew G. Knepley #undef __FUNCT__
57843913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM"
57853913d7c8SMatthew G. Knepley /*@
57863913d7c8SMatthew G. Knepley   DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement
57873913d7c8SMatthew G. Knepley 
57883913d7c8SMatthew G. Knepley   Input Parameters:
57893913d7c8SMatthew G. Knepley + dm - The DMPlex object
57903913d7c8SMatthew G. Knepley - cdm - The coarse DM
57913913d7c8SMatthew G. Knepley 
57923913d7c8SMatthew G. Knepley   Level: intermediate
57933913d7c8SMatthew G. Knepley 
57943913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM()
57953913d7c8SMatthew G. Knepley @*/
57963913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm)
57973913d7c8SMatthew G. Knepley {
57983913d7c8SMatthew G. Knepley   DM_Plex       *mesh;
57993913d7c8SMatthew G. Knepley   PetscErrorCode ierr;
58003913d7c8SMatthew G. Knepley 
58013913d7c8SMatthew G. Knepley   PetscFunctionBegin;
58023913d7c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
58033913d7c8SMatthew G. Knepley   if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2);
58043913d7c8SMatthew G. Knepley   mesh = (DM_Plex *) dm->data;
58053913d7c8SMatthew G. Knepley   ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr);
58063913d7c8SMatthew G. Knepley   mesh->coarseMesh = cdm;
58073913d7c8SMatthew G. Knepley   ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr);
58083913d7c8SMatthew G. Knepley   PetscFunctionReturn(0);
58093913d7c8SMatthew G. Knepley }
5810a68b90caSToby Isaac 
5811f7c74593SToby Isaac /* anchors */
5812a68b90caSToby Isaac #undef __FUNCT__
5813a17985deSToby Isaac #define __FUNCT__ "DMPlexGetAnchors"
5814a68b90caSToby Isaac /*@
5815f7c74593SToby Isaac   DMPlexGetAnchors - Get the layout of the anchor (point-to-point) constraints.  Typically, the user will not have to
5816f7c74593SToby Isaac   call DMPlexGetAnchors() directly: if there are anchors, then DMPlexGetAnchors() is called during DMGetConstraints().
5817a68b90caSToby Isaac 
5818e228b242SToby Isaac   not collective
5819a68b90caSToby Isaac 
5820a68b90caSToby Isaac   Input Parameters:
5821a68b90caSToby Isaac . dm - The DMPlex object
5822a68b90caSToby Isaac 
5823a68b90caSToby Isaac   Output Parameters:
5824a68b90caSToby Isaac + anchorSection - If not NULL, set to the section describing which points anchor the constrained points.
5825a68b90caSToby Isaac - anchorIS - If not NULL, set to the list of anchors indexed by anchorSection
5826a68b90caSToby Isaac 
5827a68b90caSToby Isaac 
5828a68b90caSToby Isaac   Level: intermediate
5829a68b90caSToby Isaac 
5830f7c74593SToby Isaac .seealso: DMPlexSetAnchors(), DMGetConstraints(), DMSetConstraints()
5831a68b90caSToby Isaac @*/
5832a17985deSToby Isaac PetscErrorCode DMPlexGetAnchors(DM dm, PetscSection *anchorSection, IS *anchorIS)
5833a68b90caSToby Isaac {
5834a68b90caSToby Isaac   DM_Plex *plex = (DM_Plex *)dm->data;
583541e6d900SToby Isaac   PetscErrorCode ierr;
5836a68b90caSToby Isaac 
5837a68b90caSToby Isaac   PetscFunctionBegin;
5838a68b90caSToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
583941e6d900SToby Isaac   if (!plex->anchorSection && !plex->anchorIS && plex->createanchors) {ierr = (*plex->createanchors)(dm);CHKERRQ(ierr);}
5840a68b90caSToby Isaac   if (anchorSection) *anchorSection = plex->anchorSection;
5841a68b90caSToby Isaac   if (anchorIS) *anchorIS = plex->anchorIS;
5842a68b90caSToby Isaac   PetscFunctionReturn(0);
5843a68b90caSToby Isaac }
5844a68b90caSToby Isaac 
5845a68b90caSToby Isaac #undef __FUNCT__
5846a17985deSToby Isaac #define __FUNCT__ "DMPlexSetAnchors"
5847a68b90caSToby Isaac /*@
5848f7c74593SToby Isaac   DMPlexSetAnchors - Set the layout of the local anchor (point-to-point) constraints.  Unlike boundary conditions,
5849f7c74593SToby Isaac   when a point's degrees of freedom in a section are constrained to an outside value, the anchor constraints set a
5850a68b90caSToby Isaac   point's degrees of freedom to be a linear combination of other points' degrees of freedom.
5851a68b90caSToby Isaac 
5852a17985deSToby Isaac   After specifying the layout of constraints with DMPlexSetAnchors(), one specifies the constraints by calling
5853f7c74593SToby Isaac   DMGetConstraints() and filling in the entries in the constraint matrix.
5854a68b90caSToby Isaac 
5855e228b242SToby Isaac   collective on dm
5856a68b90caSToby Isaac 
5857a68b90caSToby Isaac   Input Parameters:
5858a68b90caSToby Isaac + dm - The DMPlex object
5859e228b242SToby Isaac . anchorSection - The section that describes the mapping from constrained points to the anchor points listed in anchorIS.  Must have a local communicator (PETSC_COMM_SELF or derivative).
5860e228b242SToby Isaac - anchorIS - The list of all anchor points.  Must have a local communicator (PETSC_COMM_SELF or derivative).
5861a68b90caSToby Isaac 
5862a68b90caSToby Isaac   The reference counts of anchorSection and anchorIS are incremented.
5863a68b90caSToby Isaac 
5864a68b90caSToby Isaac   Level: intermediate
5865a68b90caSToby Isaac 
5866f7c74593SToby Isaac .seealso: DMPlexGetAnchors(), DMGetConstraints(), DMSetConstraints()
5867a68b90caSToby Isaac @*/
5868a17985deSToby Isaac PetscErrorCode DMPlexSetAnchors(DM dm, PetscSection anchorSection, IS anchorIS)
5869a68b90caSToby Isaac {
5870a68b90caSToby Isaac   DM_Plex *plex = (DM_Plex *)dm->data;
5871e228b242SToby Isaac   PetscMPIInt result;
5872a68b90caSToby Isaac   PetscErrorCode ierr;
5873a68b90caSToby Isaac 
5874a68b90caSToby Isaac   PetscFunctionBegin;
5875a68b90caSToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5876e228b242SToby Isaac   if (anchorSection) {
5877e228b242SToby Isaac     PetscValidHeaderSpecific(anchorSection,PETSC_SECTION_CLASSID,2);
5878e228b242SToby Isaac     ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorSection),&result);CHKERRQ(ierr);
5879e228b242SToby Isaac     if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor section must have local communicator");
5880e228b242SToby Isaac   }
5881e228b242SToby Isaac   if (anchorIS) {
5882e228b242SToby Isaac     PetscValidHeaderSpecific(anchorIS,IS_CLASSID,3);
5883e228b242SToby Isaac     ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorIS),&result);CHKERRQ(ierr);
5884e228b242SToby Isaac     if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor IS must have local communicator");
5885e228b242SToby Isaac   }
5886a68b90caSToby Isaac 
5887a68b90caSToby Isaac   ierr = PetscObjectReference((PetscObject)anchorSection);CHKERRQ(ierr);
5888a68b90caSToby Isaac   ierr = PetscSectionDestroy(&plex->anchorSection);CHKERRQ(ierr);
5889a68b90caSToby Isaac   plex->anchorSection = anchorSection;
5890a68b90caSToby Isaac 
5891a68b90caSToby Isaac   ierr = PetscObjectReference((PetscObject)anchorIS);CHKERRQ(ierr);
5892a68b90caSToby Isaac   ierr = ISDestroy(&plex->anchorIS);CHKERRQ(ierr);
5893a68b90caSToby Isaac   plex->anchorIS = anchorIS;
5894a68b90caSToby Isaac 
5895a68b90caSToby Isaac #if defined(PETSC_USE_DEBUG)
5896a68b90caSToby Isaac   if (anchorIS && anchorSection) {
5897a68b90caSToby Isaac     PetscInt size, a, pStart, pEnd;
5898a68b90caSToby Isaac     const PetscInt *anchors;
5899a68b90caSToby Isaac 
5900a68b90caSToby Isaac     ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr);
5901a68b90caSToby Isaac     ierr = ISGetLocalSize(anchorIS,&size);CHKERRQ(ierr);
5902a68b90caSToby Isaac     ierr = ISGetIndices(anchorIS,&anchors);CHKERRQ(ierr);
5903a68b90caSToby Isaac     for (a = 0; a < size; a++) {
5904a68b90caSToby Isaac       PetscInt p;
5905a68b90caSToby Isaac 
5906a68b90caSToby Isaac       p = anchors[a];
5907a68b90caSToby Isaac       if (p >= pStart && p < pEnd) {
5908a68b90caSToby Isaac         PetscInt dof;
5909a68b90caSToby Isaac 
5910a68b90caSToby Isaac         ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr);
5911a68b90caSToby Isaac         if (dof) {
5912a68b90caSToby Isaac           PetscErrorCode ierr2;
5913a68b90caSToby Isaac 
5914a68b90caSToby Isaac           ierr2 = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr2);
5915a68b90caSToby Isaac           SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_INCOMP,"Point %d cannot be constrained and an anchor",p);
5916a68b90caSToby Isaac         }
5917a68b90caSToby Isaac       }
5918a68b90caSToby Isaac     }
5919a68b90caSToby Isaac     ierr = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr);
5920a68b90caSToby Isaac   }
5921a68b90caSToby Isaac #endif
5922f7c74593SToby Isaac   /* reset the generic constraints */
5923f7c74593SToby Isaac   ierr = DMSetDefaultConstraints(dm,NULL,NULL);CHKERRQ(ierr);
5924a68b90caSToby Isaac   PetscFunctionReturn(0);
5925a68b90caSToby Isaac }
5926a68b90caSToby Isaac 
5927a68b90caSToby Isaac #undef __FUNCT__
5928f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintSection_Anchors"
5929f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintSection_Anchors(DM dm, PetscSection section, PetscSection *cSec)
5930a68b90caSToby Isaac {
5931f7c74593SToby Isaac   PetscSection anchorSection;
5932a68b90caSToby Isaac   PetscInt pStart, pEnd, p, dof, numFields, f;
5933a68b90caSToby Isaac   PetscErrorCode ierr;
5934a68b90caSToby Isaac 
5935a68b90caSToby Isaac   PetscFunctionBegin;
5936a68b90caSToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5937a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr);
5938e228b242SToby Isaac   ierr = PetscSectionCreate(PETSC_COMM_SELF,cSec);CHKERRQ(ierr);
5939a68b90caSToby Isaac   ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr);
5940a68b90caSToby Isaac   ierr = PetscSectionSetNumFields(*cSec,numFields);CHKERRQ(ierr);
5941a68b90caSToby Isaac   ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr);
5942a68b90caSToby Isaac   ierr = PetscSectionSetChart(*cSec,pStart,pEnd);CHKERRQ(ierr);
5943a68b90caSToby Isaac   for (p = pStart; p < pEnd; p++) {
5944a68b90caSToby Isaac     ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr);
5945a68b90caSToby Isaac     if (dof) {
5946a68b90caSToby Isaac       ierr = PetscSectionGetDof(section,p,&dof);CHKERRQ(ierr);
5947a68b90caSToby Isaac       ierr = PetscSectionSetDof(*cSec,p,dof);CHKERRQ(ierr);
5948a68b90caSToby Isaac       for (f = 0; f < numFields; f++) {
5949a68b90caSToby Isaac         ierr = PetscSectionGetFieldDof(section,p,f,&dof);CHKERRQ(ierr);
5950a68b90caSToby Isaac         ierr = PetscSectionSetFieldDof(*cSec,p,f,dof);CHKERRQ(ierr);
5951a68b90caSToby Isaac       }
5952a68b90caSToby Isaac     }
5953a68b90caSToby Isaac   }
5954a68b90caSToby Isaac   ierr = PetscSectionSetUp(*cSec);CHKERRQ(ierr);
5955a68b90caSToby Isaac   PetscFunctionReturn(0);
5956a68b90caSToby Isaac }
5957a68b90caSToby Isaac 
5958a68b90caSToby Isaac #undef __FUNCT__
5959f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintMatrix_Anchors"
5960f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintMatrix_Anchors(DM dm, PetscSection section, PetscSection cSec, Mat *cMat)
5961a68b90caSToby Isaac {
5962f7c74593SToby Isaac   PetscSection aSec;
59630ac89760SToby Isaac   PetscInt pStart, pEnd, p, dof, aDof, aOff, off, nnz, annz, m, n, q, a, offset, *i, *j;
59640ac89760SToby Isaac   const PetscInt *anchors;
59650ac89760SToby Isaac   PetscInt numFields, f;
596666ad2231SToby Isaac   IS aIS;
59670ac89760SToby Isaac   PetscErrorCode ierr;
59680ac89760SToby Isaac 
59690ac89760SToby Isaac   PetscFunctionBegin;
59700ac89760SToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
59710ac89760SToby Isaac   ierr = PetscSectionGetStorageSize(cSec, &m);CHKERRQ(ierr);
59720ac89760SToby Isaac   ierr = PetscSectionGetStorageSize(section, &n);CHKERRQ(ierr);
59730ac89760SToby Isaac   ierr = MatCreate(PETSC_COMM_SELF,cMat);CHKERRQ(ierr);
59740ac89760SToby Isaac   ierr = MatSetSizes(*cMat,m,n,m,n);CHKERRQ(ierr);
59750ac89760SToby Isaac   ierr = MatSetType(*cMat,MATSEQAIJ);
5976a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr);
597766ad2231SToby Isaac   ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr);
59780ac89760SToby Isaac   ierr = PetscSectionGetChart(aSec,&pStart,&pEnd);CHKERRQ(ierr);
59790ac89760SToby Isaac   ierr = PetscMalloc1(m+1,&i);CHKERRQ(ierr);
59800ac89760SToby Isaac   i[0] = 0;
59810ac89760SToby Isaac   ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr);
59820ac89760SToby Isaac   for (p = pStart; p < pEnd; p++) {
59830ac89760SToby Isaac     ierr = PetscSectionGetDof(aSec,p,&dof);CHKERRQ(ierr);
59840ac89760SToby Isaac     if (!dof) continue;
59850ac89760SToby Isaac     ierr = PetscSectionGetOffset(aSec,p,&off);CHKERRQ(ierr);
59860ac89760SToby Isaac     if (numFields) {
59870ac89760SToby Isaac       for (f = 0; f < numFields; f++) {
59880ac89760SToby Isaac         annz = 0;
59890ac89760SToby Isaac         for (q = 0; q < dof; q++) {
59900ac89760SToby Isaac           a = anchors[off + q];
59910ac89760SToby Isaac           ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr);
59920ac89760SToby Isaac           annz += aDof;
59930ac89760SToby Isaac         }
59940ac89760SToby Isaac         ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr);
59950ac89760SToby Isaac         ierr = PetscSectionGetFieldOffset(cSec,p,f,&off);CHKERRQ(ierr);
59960ac89760SToby Isaac         for (q = 0; q < dof; q++) {
59970ac89760SToby Isaac           i[off + q + 1] = i[off + q] + annz;
59980ac89760SToby Isaac         }
59990ac89760SToby Isaac       }
60000ac89760SToby Isaac     }
60010ac89760SToby Isaac     else {
60020ac89760SToby Isaac       annz = 0;
60030ac89760SToby Isaac       for (q = 0; q < dof; q++) {
60040ac89760SToby Isaac         a = anchors[off + q];
60050ac89760SToby Isaac         ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr);
60060ac89760SToby Isaac         annz += aDof;
60070ac89760SToby Isaac       }
60080ac89760SToby Isaac       ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr);
60090ac89760SToby Isaac       ierr = PetscSectionGetOffset(cSec,p,&off);CHKERRQ(ierr);
60100ac89760SToby Isaac       for (q = 0; q < dof; q++) {
60110ac89760SToby Isaac         i[off + q + 1] = i[off + q] + annz;
60120ac89760SToby Isaac       }
60130ac89760SToby Isaac     }
60140ac89760SToby Isaac   }
60150ac89760SToby Isaac   nnz = i[m];
60160ac89760SToby Isaac   ierr = PetscMalloc1(nnz,&j);CHKERRQ(ierr);
60170ac89760SToby Isaac   offset = 0;
60180ac89760SToby Isaac   for (p = pStart; p < pEnd; p++) {
60190ac89760SToby Isaac     if (numFields) {
60200ac89760SToby Isaac       for (f = 0; f < numFields; f++) {
60210ac89760SToby Isaac         ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr);
60220ac89760SToby Isaac         for (q = 0; q < dof; q++) {
60230ac89760SToby Isaac           PetscInt rDof, rOff, r;
60240ac89760SToby Isaac           ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr);
60250ac89760SToby Isaac           ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr);
60260ac89760SToby Isaac           for (r = 0; r < rDof; r++) {
60270ac89760SToby Isaac             PetscInt s;
60280ac89760SToby Isaac 
60290ac89760SToby Isaac             a = anchors[rOff + r];
60300ac89760SToby Isaac 
60310ac89760SToby Isaac             ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr);
60320ac89760SToby Isaac             ierr = PetscSectionGetFieldOffset(section,a,f,&aOff);CHKERRQ(ierr);
60330ac89760SToby Isaac             for (s = 0; s < aDof; s++) {
60340ac89760SToby Isaac               j[offset++] = aOff + s;
60350ac89760SToby Isaac             }
60360ac89760SToby Isaac           }
60370ac89760SToby Isaac         }
60380ac89760SToby Isaac       }
60390ac89760SToby Isaac     }
60400ac89760SToby Isaac     else {
60410ac89760SToby Isaac       ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr);
60420ac89760SToby Isaac       for (q = 0; q < dof; q++) {
60430ac89760SToby Isaac         PetscInt rDof, rOff, r;
60440ac89760SToby Isaac         ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr);
60450ac89760SToby Isaac         ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr);
60460ac89760SToby Isaac         for (r = 0; r < rDof; r++) {
60470ac89760SToby Isaac           PetscInt s;
60480ac89760SToby Isaac 
60490ac89760SToby Isaac           a = anchors[rOff + r];
60500ac89760SToby Isaac 
60510ac89760SToby Isaac           ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr);
60520ac89760SToby Isaac           ierr = PetscSectionGetOffset(section,a,&aOff);CHKERRQ(ierr);
60530ac89760SToby Isaac           for (s = 0; s < aDof; s++) {
60540ac89760SToby Isaac             j[offset++] = aOff + s;
60550ac89760SToby Isaac           }
60560ac89760SToby Isaac         }
60570ac89760SToby Isaac       }
60580ac89760SToby Isaac     }
60590ac89760SToby Isaac   }
60600ac89760SToby Isaac   ierr = MatSeqAIJSetPreallocationCSR(*cMat,i,j,NULL);CHKERRQ(ierr);
60610ac89760SToby Isaac   ierr = PetscFree2(i,j);CHKERRQ(ierr);
606266ad2231SToby Isaac   ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr);
60630ac89760SToby Isaac   PetscFunctionReturn(0);
60640ac89760SToby Isaac }
60650ac89760SToby Isaac 
60660ac89760SToby Isaac #undef __FUNCT__
606766ad2231SToby Isaac #define __FUNCT__ "DMCreateDefaultConstraints_Plex"
606866ad2231SToby Isaac PetscErrorCode DMCreateDefaultConstraints_Plex(DM dm)
606966ad2231SToby Isaac {
6070f7c74593SToby Isaac   DM_Plex        *plex = (DM_Plex *)dm->data;
6071f7c74593SToby Isaac   PetscSection   anchorSection, section, cSec;
607266ad2231SToby Isaac   Mat            cMat;
607366ad2231SToby Isaac   PetscErrorCode ierr;
607466ad2231SToby Isaac 
607566ad2231SToby Isaac   PetscFunctionBegin;
607666ad2231SToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6077a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr);
607866ad2231SToby Isaac   if (anchorSection) {
6079e228b242SToby Isaac     PetscDS  ds;
6080e228b242SToby Isaac     PetscInt nf;
6081e228b242SToby Isaac 
6082f7c74593SToby Isaac     ierr = DMGetDefaultSection(dm,&section);CHKERRQ(ierr);
6083f7c74593SToby Isaac     ierr = DMPlexCreateConstraintSection_Anchors(dm,section,&cSec);CHKERRQ(ierr);
6084f7c74593SToby Isaac     ierr = DMPlexCreateConstraintMatrix_Anchors(dm,section,cSec,&cMat);CHKERRQ(ierr);
6085e228b242SToby Isaac     ierr = DMGetDS(dm,&ds);CHKERRQ(ierr);
6086e228b242SToby Isaac     ierr = PetscDSGetNumFields(ds,&nf);
6087e228b242SToby Isaac     if (nf && plex->computeanchormatrix) {ierr = (*plex->computeanchormatrix)(dm,section,cSec,cMat);CHKERRQ(ierr);}
608866ad2231SToby Isaac     ierr = DMSetDefaultConstraints(dm,cSec,cMat);CHKERRQ(ierr);
608966ad2231SToby Isaac     ierr = PetscSectionDestroy(&cSec);CHKERRQ(ierr);
609066ad2231SToby Isaac     ierr = MatDestroy(&cMat);CHKERRQ(ierr);
609166ad2231SToby Isaac   }
609266ad2231SToby Isaac   PetscFunctionReturn(0);
609366ad2231SToby Isaac }
6094