xref: /petsc/src/dm/impls/plex/plex.c (revision 3d822a50fa56047d2c4e32398223829f215b291b)
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 */
11*3d822a50SMichael 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;
515552f7358SJed Brown   DMLabel        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) {
530552f7358SJed Brown     DMLabel tmp = next->next;
531552f7358SJed Brown 
532552f7358SJed Brown     ierr = DMLabelDestroy(&next);CHKERRQ(ierr);
533552f7358SJed Brown     next = tmp;
534552f7358SJed Brown   }
5353913d7c8SMatthew G. Knepley   ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr);
536a89082eeSMatthew G Knepley   ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr);
537552f7358SJed Brown   ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr);
538552f7358SJed Brown   ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr);
5396c73c22cSMatthew G. Knepley   ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr);
540a68b90caSToby Isaac   ierr = PetscSectionDestroy(&mesh->anchorSection);CHKERRQ(ierr);
541a68b90caSToby Isaac   ierr = ISDestroy(&mesh->anchorIS);CHKERRQ(ierr);
542d961a43aSToby Isaac   ierr = PetscSectionDestroy(&mesh->parentSection);CHKERRQ(ierr);
543d961a43aSToby Isaac   ierr = PetscFree(mesh->parents);CHKERRQ(ierr);
544d961a43aSToby Isaac   ierr = PetscFree(mesh->childIDs);CHKERRQ(ierr);
545d961a43aSToby Isaac   ierr = PetscSectionDestroy(&mesh->childSection);CHKERRQ(ierr);
546d961a43aSToby Isaac   ierr = PetscFree(mesh->children);CHKERRQ(ierr);
547d6a7ad0dSToby Isaac   ierr = DMDestroy(&mesh->referenceTree);CHKERRQ(ierr);
548552f7358SJed Brown   /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */
549552f7358SJed Brown   ierr = PetscFree(mesh);CHKERRQ(ierr);
550552f7358SJed Brown   PetscFunctionReturn(0);
551552f7358SJed Brown }
552552f7358SJed Brown 
553552f7358SJed Brown #undef __FUNCT__
554552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex"
555b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J)
556552f7358SJed Brown {
557552f7358SJed Brown   PetscSection   section, sectionGlobal;
558552f7358SJed Brown   PetscInt       bs = -1;
559552f7358SJed Brown   PetscInt       localSize;
56089545effSMatthew G. Knepley   PetscBool      isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock;
561552f7358SJed Brown   PetscErrorCode ierr;
562b412c318SBarry Smith   MatType        mtype;
563552f7358SJed Brown 
564552f7358SJed Brown   PetscFunctionBegin;
565607a6623SBarry Smith   ierr = MatInitializePackage();CHKERRQ(ierr);
566b412c318SBarry Smith   mtype = dm->mattype;
567552f7358SJed Brown   ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);
568552f7358SJed Brown   ierr = DMGetDefaultGlobalSection(dm, &sectionGlobal);CHKERRQ(ierr);
569552f7358SJed Brown   /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */
570552f7358SJed Brown   ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr);
57182f516ccSBarry Smith   ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr);
572552f7358SJed Brown   ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
573552f7358SJed Brown   ierr = MatSetType(*J, mtype);CHKERRQ(ierr);
574552f7358SJed Brown   ierr = MatSetFromOptions(*J);CHKERRQ(ierr);
575552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr);
576552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr);
577552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr);
578552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr);
579552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr);
580552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr);
581552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr);
582552f7358SJed Brown   if (!isShell) {
583552f7358SJed Brown     PetscBool fillMatrix = (PetscBool) !dm->prealloc_only;
5842a28c762SMatthew G Knepley     PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin;
585552f7358SJed Brown 
586552f7358SJed Brown     if (bs < 0) {
587552f7358SJed Brown       if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) {
588fad22124SMatthew G Knepley         PetscInt pStart, pEnd, p, dof, cdof;
589552f7358SJed Brown 
590552f7358SJed Brown         ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr);
591552f7358SJed Brown         for (p = pStart; p < pEnd; ++p) {
592552f7358SJed Brown           ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr);
593fad22124SMatthew G Knepley           ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr);
594fad22124SMatthew G Knepley           if (dof-cdof) {
5952a28c762SMatthew G Knepley             if (bs < 0) {
596fad22124SMatthew G Knepley               bs = dof-cdof;
597fad22124SMatthew G Knepley             } else if (bs != dof-cdof) {
5982a28c762SMatthew G Knepley               /* Layout does not admit a pointwise block size */
5992a28c762SMatthew G Knepley               bs = 1;
600552f7358SJed Brown               break;
601552f7358SJed Brown             }
602552f7358SJed Brown           }
6032a28c762SMatthew G Knepley         }
6042a28c762SMatthew G Knepley         /* Must have same blocksize on all procs (some might have no points) */
6052a28c762SMatthew G Knepley         bsLocal = bs;
60682f516ccSBarry Smith         ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr);
6072a28c762SMatthew G Knepley         bsLocal = bs < 0 ? bsMax : bs;
60882f516ccSBarry Smith         ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr);
6092a28c762SMatthew G Knepley         if (bsMin != bsMax) {
6102a28c762SMatthew G Knepley           bs = 1;
6112a28c762SMatthew G Knepley         } else {
6122a28c762SMatthew G Knepley           bs = bsMax;
6132a28c762SMatthew G Knepley         }
614552f7358SJed Brown       } else {
615552f7358SJed Brown         bs = 1;
616552f7358SJed Brown       }
617552f7358SJed Brown     }
6181795a4d1SJed Brown     ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr);
619552f7358SJed Brown     ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr);
620552f7358SJed Brown     ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr);
621552f7358SJed Brown   }
622552f7358SJed Brown   PetscFunctionReturn(0);
623552f7358SJed Brown }
624552f7358SJed Brown 
625552f7358SJed Brown #undef __FUNCT__
626552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart"
627552f7358SJed Brown /*@
628552f7358SJed Brown   DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd)
629552f7358SJed Brown 
630552f7358SJed Brown   Not collective
631552f7358SJed Brown 
632552f7358SJed Brown   Input Parameter:
633552f7358SJed Brown . mesh - The DMPlex
634552f7358SJed Brown 
635552f7358SJed Brown   Output Parameters:
636552f7358SJed Brown + pStart - The first mesh point
637552f7358SJed Brown - pEnd   - The upper bound for mesh points
638552f7358SJed Brown 
639552f7358SJed Brown   Level: beginner
640552f7358SJed Brown 
641552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart()
642552f7358SJed Brown @*/
643552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd)
644552f7358SJed Brown {
645552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
646552f7358SJed Brown   PetscErrorCode ierr;
647552f7358SJed Brown 
648552f7358SJed Brown   PetscFunctionBegin;
649552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
650552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr);
651552f7358SJed Brown   PetscFunctionReturn(0);
652552f7358SJed Brown }
653552f7358SJed Brown 
654552f7358SJed Brown #undef __FUNCT__
655552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart"
656552f7358SJed Brown /*@
657552f7358SJed Brown   DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd)
658552f7358SJed Brown 
659552f7358SJed Brown   Not collective
660552f7358SJed Brown 
661552f7358SJed Brown   Input Parameters:
662552f7358SJed Brown + mesh - The DMPlex
663552f7358SJed Brown . pStart - The first mesh point
664552f7358SJed Brown - pEnd   - The upper bound for mesh points
665552f7358SJed Brown 
666552f7358SJed Brown   Output Parameters:
667552f7358SJed Brown 
668552f7358SJed Brown   Level: beginner
669552f7358SJed Brown 
670552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart()
671552f7358SJed Brown @*/
672552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd)
673552f7358SJed Brown {
674552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
675552f7358SJed Brown   PetscErrorCode ierr;
676552f7358SJed Brown 
677552f7358SJed Brown   PetscFunctionBegin;
678552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
679552f7358SJed Brown   ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr);
680552f7358SJed Brown   ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr);
681552f7358SJed Brown   PetscFunctionReturn(0);
682552f7358SJed Brown }
683552f7358SJed Brown 
684552f7358SJed Brown #undef __FUNCT__
685552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize"
686552f7358SJed Brown /*@
687552f7358SJed Brown   DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG
688552f7358SJed Brown 
689552f7358SJed Brown   Not collective
690552f7358SJed Brown 
691552f7358SJed Brown   Input Parameters:
692552f7358SJed Brown + mesh - The DMPlex
693552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
694552f7358SJed Brown 
695552f7358SJed Brown   Output Parameter:
696552f7358SJed Brown . size - The cone size for point p
697552f7358SJed Brown 
698552f7358SJed Brown   Level: beginner
699552f7358SJed Brown 
700552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart()
701552f7358SJed Brown @*/
702552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size)
703552f7358SJed Brown {
704552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
705552f7358SJed Brown   PetscErrorCode ierr;
706552f7358SJed Brown 
707552f7358SJed Brown   PetscFunctionBegin;
708552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
709552f7358SJed Brown   PetscValidPointer(size, 3);
710552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr);
711552f7358SJed Brown   PetscFunctionReturn(0);
712552f7358SJed Brown }
713552f7358SJed Brown 
714552f7358SJed Brown #undef __FUNCT__
715552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize"
716552f7358SJed Brown /*@
717552f7358SJed Brown   DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG
718552f7358SJed Brown 
719552f7358SJed Brown   Not collective
720552f7358SJed Brown 
721552f7358SJed Brown   Input Parameters:
722552f7358SJed Brown + mesh - The DMPlex
723552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
724552f7358SJed Brown - size - The cone size for point p
725552f7358SJed Brown 
726552f7358SJed Brown   Output Parameter:
727552f7358SJed Brown 
728552f7358SJed Brown   Note:
729552f7358SJed Brown   This should be called after DMPlexSetChart().
730552f7358SJed Brown 
731552f7358SJed Brown   Level: beginner
732552f7358SJed Brown 
733552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart()
734552f7358SJed Brown @*/
735552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size)
736552f7358SJed Brown {
737552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
738552f7358SJed Brown   PetscErrorCode ierr;
739552f7358SJed Brown 
740552f7358SJed Brown   PetscFunctionBegin;
741552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
742552f7358SJed Brown   ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr);
7430d644c17SKarl Rupp 
744552f7358SJed Brown   mesh->maxConeSize = PetscMax(mesh->maxConeSize, size);
745552f7358SJed Brown   PetscFunctionReturn(0);
746552f7358SJed Brown }
747552f7358SJed Brown 
748552f7358SJed Brown #undef __FUNCT__
749f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize"
750f5a469b9SMatthew G. Knepley /*@
751f5a469b9SMatthew G. Knepley   DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG
752f5a469b9SMatthew G. Knepley 
753f5a469b9SMatthew G. Knepley   Not collective
754f5a469b9SMatthew G. Knepley 
755f5a469b9SMatthew G. Knepley   Input Parameters:
756f5a469b9SMatthew G. Knepley + mesh - The DMPlex
757f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
758f5a469b9SMatthew G. Knepley - size - The additional cone size for point p
759f5a469b9SMatthew G. Knepley 
760f5a469b9SMatthew G. Knepley   Output Parameter:
761f5a469b9SMatthew G. Knepley 
762f5a469b9SMatthew G. Knepley   Note:
763f5a469b9SMatthew G. Knepley   This should be called after DMPlexSetChart().
764f5a469b9SMatthew G. Knepley 
765f5a469b9SMatthew G. Knepley   Level: beginner
766f5a469b9SMatthew G. Knepley 
767f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart()
768f5a469b9SMatthew G. Knepley @*/
769f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size)
770f5a469b9SMatthew G. Knepley {
771f5a469b9SMatthew G. Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
772f5a469b9SMatthew G. Knepley   PetscInt       csize;
773f5a469b9SMatthew G. Knepley   PetscErrorCode ierr;
774f5a469b9SMatthew G. Knepley 
775f5a469b9SMatthew G. Knepley   PetscFunctionBegin;
776f5a469b9SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
777f5a469b9SMatthew G. Knepley   ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr);
778f5a469b9SMatthew G. Knepley   ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr);
779f5a469b9SMatthew G. Knepley 
780f5a469b9SMatthew G. Knepley   mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize);
781f5a469b9SMatthew G. Knepley   PetscFunctionReturn(0);
782f5a469b9SMatthew G. Knepley }
783f5a469b9SMatthew G. Knepley 
784f5a469b9SMatthew G. Knepley #undef __FUNCT__
785552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone"
786552f7358SJed Brown /*@C
787552f7358SJed Brown   DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG
788552f7358SJed Brown 
789552f7358SJed Brown   Not collective
790552f7358SJed Brown 
791552f7358SJed Brown   Input Parameters:
792552f7358SJed Brown + mesh - The DMPlex
793552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
794552f7358SJed Brown 
795552f7358SJed Brown   Output Parameter:
796552f7358SJed Brown . cone - An array of points which are on the in-edges for point p
797552f7358SJed Brown 
798552f7358SJed Brown   Level: beginner
799552f7358SJed Brown 
8003813dfbdSMatthew G Knepley   Fortran Notes:
8013813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
8023813dfbdSMatthew G Knepley   include petsc.h90 in your code.
8033813dfbdSMatthew G Knepley 
8043813dfbdSMatthew G Knepley   You must also call DMPlexRestoreCone() after you finish using the returned array.
805552f7358SJed Brown 
806552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart()
807552f7358SJed Brown @*/
808552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[])
809552f7358SJed Brown {
810552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
811552f7358SJed Brown   PetscInt       off;
812552f7358SJed Brown   PetscErrorCode ierr;
813552f7358SJed Brown 
814552f7358SJed Brown   PetscFunctionBegin;
815552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
816552f7358SJed Brown   PetscValidPointer(cone, 3);
817552f7358SJed Brown   ierr  = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
818552f7358SJed Brown   *cone = &mesh->cones[off];
819552f7358SJed Brown   PetscFunctionReturn(0);
820552f7358SJed Brown }
821552f7358SJed Brown 
822552f7358SJed Brown #undef __FUNCT__
823552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone"
824552f7358SJed Brown /*@
825552f7358SJed Brown   DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG
826552f7358SJed Brown 
827552f7358SJed Brown   Not collective
828552f7358SJed Brown 
829552f7358SJed Brown   Input Parameters:
830552f7358SJed Brown + mesh - The DMPlex
831552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
832552f7358SJed Brown - cone - An array of points which are on the in-edges for point p
833552f7358SJed Brown 
834552f7358SJed Brown   Output Parameter:
835552f7358SJed Brown 
836552f7358SJed Brown   Note:
837552f7358SJed Brown   This should be called after all calls to DMPlexSetConeSize() and DMSetUp().
838552f7358SJed Brown 
839552f7358SJed Brown   Level: beginner
840552f7358SJed Brown 
841552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp()
842552f7358SJed Brown @*/
843552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[])
844552f7358SJed Brown {
845552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
846552f7358SJed Brown   PetscInt       pStart, pEnd;
847552f7358SJed Brown   PetscInt       dof, off, c;
848552f7358SJed Brown   PetscErrorCode ierr;
849552f7358SJed Brown 
850552f7358SJed Brown   PetscFunctionBegin;
851552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
852552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
853552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
854552f7358SJed Brown   if (dof) PetscValidPointer(cone, 3);
855552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
85682f516ccSBarry 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);
857552f7358SJed Brown   for (c = 0; c < dof; ++c) {
85882f516ccSBarry 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);
859552f7358SJed Brown     mesh->cones[off+c] = cone[c];
860552f7358SJed Brown   }
861552f7358SJed Brown   PetscFunctionReturn(0);
862552f7358SJed Brown }
863552f7358SJed Brown 
864552f7358SJed Brown #undef __FUNCT__
865552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation"
866552f7358SJed Brown /*@C
867552f7358SJed Brown   DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG
868552f7358SJed Brown 
869552f7358SJed Brown   Not collective
870552f7358SJed Brown 
871552f7358SJed Brown   Input Parameters:
872552f7358SJed Brown + mesh - The DMPlex
873552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
874552f7358SJed Brown 
875552f7358SJed Brown   Output Parameter:
876552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an
877552f7358SJed Brown                     integer giving the prescription for cone traversal. If it is negative, the cone is
878552f7358SJed Brown                     traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives
879552f7358SJed Brown                     the index of the cone point on which to start.
880552f7358SJed Brown 
881552f7358SJed Brown   Level: beginner
882552f7358SJed Brown 
8833813dfbdSMatthew G Knepley   Fortran Notes:
8843813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
8853813dfbdSMatthew G Knepley   include petsc.h90 in your code.
8863813dfbdSMatthew G Knepley 
8873813dfbdSMatthew G Knepley   You must also call DMPlexRestoreConeOrientation() after you finish using the returned array.
888552f7358SJed Brown 
889552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart()
890552f7358SJed Brown @*/
891552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[])
892552f7358SJed Brown {
893552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
894552f7358SJed Brown   PetscInt       off;
895552f7358SJed Brown   PetscErrorCode ierr;
896552f7358SJed Brown 
897552f7358SJed Brown   PetscFunctionBegin;
898552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
899552f7358SJed Brown #if defined(PETSC_USE_DEBUG)
900552f7358SJed Brown   {
901552f7358SJed Brown     PetscInt dof;
902552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
903552f7358SJed Brown     if (dof) PetscValidPointer(coneOrientation, 3);
904552f7358SJed Brown   }
905552f7358SJed Brown #endif
906552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
9070d644c17SKarl Rupp 
908552f7358SJed Brown   *coneOrientation = &mesh->coneOrientations[off];
909552f7358SJed Brown   PetscFunctionReturn(0);
910552f7358SJed Brown }
911552f7358SJed Brown 
912552f7358SJed Brown #undef __FUNCT__
913552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation"
914552f7358SJed Brown /*@
915552f7358SJed Brown   DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG
916552f7358SJed Brown 
917552f7358SJed Brown   Not collective
918552f7358SJed Brown 
919552f7358SJed Brown   Input Parameters:
920552f7358SJed Brown + mesh - The DMPlex
921552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
922552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an
923552f7358SJed Brown                     integer giving the prescription for cone traversal. If it is negative, the cone is
924552f7358SJed Brown                     traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives
925552f7358SJed Brown                     the index of the cone point on which to start.
926552f7358SJed Brown 
927552f7358SJed Brown   Output Parameter:
928552f7358SJed Brown 
929552f7358SJed Brown   Note:
930552f7358SJed Brown   This should be called after all calls to DMPlexSetConeSize() and DMSetUp().
931552f7358SJed Brown 
932552f7358SJed Brown   Level: beginner
933552f7358SJed Brown 
934552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp()
935552f7358SJed Brown @*/
936552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[])
937552f7358SJed Brown {
938552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
939552f7358SJed Brown   PetscInt       pStart, pEnd;
940552f7358SJed Brown   PetscInt       dof, off, c;
941552f7358SJed Brown   PetscErrorCode ierr;
942552f7358SJed Brown 
943552f7358SJed Brown   PetscFunctionBegin;
944552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
945552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
946552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
947552f7358SJed Brown   if (dof) PetscValidPointer(coneOrientation, 3);
948552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
94982f516ccSBarry 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);
950552f7358SJed Brown   for (c = 0; c < dof; ++c) {
951552f7358SJed Brown     PetscInt cdof, o = coneOrientation[c];
952552f7358SJed Brown 
953552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr);
95482f516ccSBarry 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);
955552f7358SJed Brown     mesh->coneOrientations[off+c] = o;
956552f7358SJed Brown   }
957552f7358SJed Brown   PetscFunctionReturn(0);
958552f7358SJed Brown }
959552f7358SJed Brown 
960552f7358SJed Brown #undef __FUNCT__
961552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone"
962552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint)
963552f7358SJed Brown {
964552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
965552f7358SJed Brown   PetscInt       pStart, pEnd;
966552f7358SJed Brown   PetscInt       dof, off;
967552f7358SJed Brown   PetscErrorCode ierr;
968552f7358SJed Brown 
969552f7358SJed Brown   PetscFunctionBegin;
970552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
971552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
97282f516ccSBarry 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);
97382f516ccSBarry 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);
97477c88f5bSMatthew G Knepley   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
97577c88f5bSMatthew G Knepley   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
97677c88f5bSMatthew 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);
977552f7358SJed Brown   mesh->cones[off+conePos] = conePoint;
978552f7358SJed Brown   PetscFunctionReturn(0);
979552f7358SJed Brown }
980552f7358SJed Brown 
981552f7358SJed Brown #undef __FUNCT__
98277c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation"
98377c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation)
98477c88f5bSMatthew G Knepley {
98577c88f5bSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
98677c88f5bSMatthew G Knepley   PetscInt       pStart, pEnd;
98777c88f5bSMatthew G Knepley   PetscInt       dof, off;
98877c88f5bSMatthew G Knepley   PetscErrorCode ierr;
98977c88f5bSMatthew G Knepley 
99077c88f5bSMatthew G Knepley   PetscFunctionBegin;
99177c88f5bSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
99277c88f5bSMatthew G Knepley   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
99377c88f5bSMatthew 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);
99477c88f5bSMatthew G Knepley   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
99577c88f5bSMatthew G Knepley   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
99677c88f5bSMatthew 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);
99777c88f5bSMatthew G Knepley   mesh->coneOrientations[off+conePos] = coneOrientation;
99877c88f5bSMatthew G Knepley   PetscFunctionReturn(0);
99977c88f5bSMatthew G Knepley }
100077c88f5bSMatthew G Knepley 
100177c88f5bSMatthew G Knepley #undef __FUNCT__
1002552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize"
1003552f7358SJed Brown /*@
1004552f7358SJed Brown   DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG
1005552f7358SJed Brown 
1006552f7358SJed Brown   Not collective
1007552f7358SJed Brown 
1008552f7358SJed Brown   Input Parameters:
1009552f7358SJed Brown + mesh - The DMPlex
1010552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1011552f7358SJed Brown 
1012552f7358SJed Brown   Output Parameter:
1013552f7358SJed Brown . size - The support size for point p
1014552f7358SJed Brown 
1015552f7358SJed Brown   Level: beginner
1016552f7358SJed Brown 
1017552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize()
1018552f7358SJed Brown @*/
1019552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size)
1020552f7358SJed Brown {
1021552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1022552f7358SJed Brown   PetscErrorCode ierr;
1023552f7358SJed Brown 
1024552f7358SJed Brown   PetscFunctionBegin;
1025552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1026552f7358SJed Brown   PetscValidPointer(size, 3);
1027552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr);
1028552f7358SJed Brown   PetscFunctionReturn(0);
1029552f7358SJed Brown }
1030552f7358SJed Brown 
1031552f7358SJed Brown #undef __FUNCT__
1032552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize"
1033552f7358SJed Brown /*@
1034552f7358SJed Brown   DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG
1035552f7358SJed Brown 
1036552f7358SJed Brown   Not collective
1037552f7358SJed Brown 
1038552f7358SJed Brown   Input Parameters:
1039552f7358SJed Brown + mesh - The DMPlex
1040552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1041552f7358SJed Brown - size - The support size for point p
1042552f7358SJed Brown 
1043552f7358SJed Brown   Output Parameter:
1044552f7358SJed Brown 
1045552f7358SJed Brown   Note:
1046552f7358SJed Brown   This should be called after DMPlexSetChart().
1047552f7358SJed Brown 
1048552f7358SJed Brown   Level: beginner
1049552f7358SJed Brown 
1050552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart()
1051552f7358SJed Brown @*/
1052552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size)
1053552f7358SJed Brown {
1054552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1055552f7358SJed Brown   PetscErrorCode ierr;
1056552f7358SJed Brown 
1057552f7358SJed Brown   PetscFunctionBegin;
1058552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1059552f7358SJed Brown   ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr);
10600d644c17SKarl Rupp 
1061552f7358SJed Brown   mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size);
1062552f7358SJed Brown   PetscFunctionReturn(0);
1063552f7358SJed Brown }
1064552f7358SJed Brown 
1065552f7358SJed Brown #undef __FUNCT__
1066552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport"
1067552f7358SJed Brown /*@C
1068552f7358SJed Brown   DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG
1069552f7358SJed Brown 
1070552f7358SJed Brown   Not collective
1071552f7358SJed Brown 
1072552f7358SJed Brown   Input Parameters:
1073552f7358SJed Brown + mesh - The DMPlex
1074552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1075552f7358SJed Brown 
1076552f7358SJed Brown   Output Parameter:
1077552f7358SJed Brown . support - An array of points which are on the out-edges for point p
1078552f7358SJed Brown 
1079552f7358SJed Brown   Level: beginner
1080552f7358SJed Brown 
10813813dfbdSMatthew G Knepley   Fortran Notes:
10823813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
10833813dfbdSMatthew G Knepley   include petsc.h90 in your code.
10843813dfbdSMatthew G Knepley 
10853813dfbdSMatthew G Knepley   You must also call DMPlexRestoreSupport() after you finish using the returned array.
10863813dfbdSMatthew G Knepley 
1087552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1088552f7358SJed Brown @*/
1089552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[])
1090552f7358SJed Brown {
1091552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1092552f7358SJed Brown   PetscInt       off;
1093552f7358SJed Brown   PetscErrorCode ierr;
1094552f7358SJed Brown 
1095552f7358SJed Brown   PetscFunctionBegin;
1096552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1097552f7358SJed Brown   PetscValidPointer(support, 3);
1098552f7358SJed Brown   ierr     = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
1099552f7358SJed Brown   *support = &mesh->supports[off];
1100552f7358SJed Brown   PetscFunctionReturn(0);
1101552f7358SJed Brown }
1102552f7358SJed Brown 
1103552f7358SJed Brown #undef __FUNCT__
1104552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport"
1105552f7358SJed Brown /*@
1106552f7358SJed Brown   DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG
1107552f7358SJed Brown 
1108552f7358SJed Brown   Not collective
1109552f7358SJed Brown 
1110552f7358SJed Brown   Input Parameters:
1111552f7358SJed Brown + mesh - The DMPlex
1112552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1113552f7358SJed Brown - support - An array of points which are on the in-edges for point p
1114552f7358SJed Brown 
1115552f7358SJed Brown   Output Parameter:
1116552f7358SJed Brown 
1117552f7358SJed Brown   Note:
1118552f7358SJed Brown   This should be called after all calls to DMPlexSetSupportSize() and DMSetUp().
1119552f7358SJed Brown 
1120552f7358SJed Brown   Level: beginner
1121552f7358SJed Brown 
1122552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp()
1123552f7358SJed Brown @*/
1124552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[])
1125552f7358SJed Brown {
1126552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1127552f7358SJed Brown   PetscInt       pStart, pEnd;
1128552f7358SJed Brown   PetscInt       dof, off, c;
1129552f7358SJed Brown   PetscErrorCode ierr;
1130552f7358SJed Brown 
1131552f7358SJed Brown   PetscFunctionBegin;
1132552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1133552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr);
1134552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
1135552f7358SJed Brown   if (dof) PetscValidPointer(support, 3);
1136552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
113782f516ccSBarry 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);
1138552f7358SJed Brown   for (c = 0; c < dof; ++c) {
113982f516ccSBarry 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);
1140552f7358SJed Brown     mesh->supports[off+c] = support[c];
1141552f7358SJed Brown   }
1142552f7358SJed Brown   PetscFunctionReturn(0);
1143552f7358SJed Brown }
1144552f7358SJed Brown 
1145552f7358SJed Brown #undef __FUNCT__
1146552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport"
1147552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint)
1148552f7358SJed Brown {
1149552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1150552f7358SJed Brown   PetscInt       pStart, pEnd;
1151552f7358SJed Brown   PetscInt       dof, off;
1152552f7358SJed Brown   PetscErrorCode ierr;
1153552f7358SJed Brown 
1154552f7358SJed Brown   PetscFunctionBegin;
1155552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1156552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr);
1157552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
1158552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
115982f516ccSBarry 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);
116082f516ccSBarry 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);
116182f516ccSBarry 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);
1162552f7358SJed Brown   mesh->supports[off+supportPos] = supportPoint;
1163552f7358SJed Brown   PetscFunctionReturn(0);
1164552f7358SJed Brown }
1165552f7358SJed Brown 
1166552f7358SJed Brown #undef __FUNCT__
1167552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure"
1168552f7358SJed Brown /*@C
1169552f7358SJed Brown   DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG
1170552f7358SJed Brown 
1171552f7358SJed Brown   Not collective
1172552f7358SJed Brown 
1173552f7358SJed Brown   Input Parameters:
1174552f7358SJed Brown + mesh - The DMPlex
1175552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1176552f7358SJed Brown . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
11770298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used
1178552f7358SJed Brown 
1179552f7358SJed Brown   Output Parameters:
1180552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints
1181552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...]
1182552f7358SJed Brown 
1183552f7358SJed Brown   Note:
11840298fd71SBarry Smith   If using internal storage (points is NULL on input), each call overwrites the last output.
1185552f7358SJed Brown 
11863813dfbdSMatthew G Knepley   Fortran Notes:
11873813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
11883813dfbdSMatthew G Knepley   include petsc.h90 in your code.
11893813dfbdSMatthew G Knepley 
11903813dfbdSMatthew G Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
11913813dfbdSMatthew G Knepley 
1192552f7358SJed Brown   Level: beginner
1193552f7358SJed Brown 
1194552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1195552f7358SJed Brown @*/
1196552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
1197552f7358SJed Brown {
1198552f7358SJed Brown   DM_Plex        *mesh = (DM_Plex*) dm->data;
1199552f7358SJed Brown   PetscInt       *closure, *fifo;
12000298fd71SBarry Smith   const PetscInt *tmp = NULL, *tmpO = NULL;
1201552f7358SJed Brown   PetscInt        tmpSize, t;
1202552f7358SJed Brown   PetscInt        depth       = 0, maxSize;
1203552f7358SJed Brown   PetscInt        closureSize = 2, fifoSize = 0, fifoStart = 0;
1204552f7358SJed Brown   PetscErrorCode  ierr;
1205552f7358SJed Brown 
1206552f7358SJed Brown   PetscFunctionBegin;
1207552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1208552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1209552f7358SJed Brown   /* This is only 1-level */
1210552f7358SJed Brown   if (useCone) {
1211552f7358SJed Brown     ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr);
1212552f7358SJed Brown     ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr);
1213552f7358SJed Brown     ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr);
1214552f7358SJed Brown   } else {
1215552f7358SJed Brown     ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr);
1216552f7358SJed Brown     ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr);
1217552f7358SJed Brown   }
1218bfbcdd7aSMatthew G. Knepley   if (depth == 1) {
1219bfbcdd7aSMatthew G. Knepley     if (*points) {
1220bfbcdd7aSMatthew G. Knepley       closure = *points;
1221bfbcdd7aSMatthew G. Knepley     } else {
1222bfbcdd7aSMatthew G. Knepley       maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1);
1223bfbcdd7aSMatthew G. Knepley       ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
1224bfbcdd7aSMatthew G. Knepley     }
1225bfbcdd7aSMatthew G. Knepley     closure[0] = p; closure[1] = 0;
1226bfbcdd7aSMatthew G. Knepley     for (t = 0; t < tmpSize; ++t, closureSize += 2) {
1227bfbcdd7aSMatthew G. Knepley       closure[closureSize]   = tmp[t];
1228bfbcdd7aSMatthew G. Knepley       closure[closureSize+1] = tmpO ? tmpO[t] : 0;
1229bfbcdd7aSMatthew G. Knepley     }
1230bfbcdd7aSMatthew G. Knepley     if (numPoints) *numPoints = closureSize/2;
1231bfbcdd7aSMatthew G. Knepley     if (points)    *points    = closure;
1232bfbcdd7aSMatthew G. Knepley     PetscFunctionReturn(0);
1233bfbcdd7aSMatthew G. Knepley   }
123424c766afSToby Isaac   {
123524c766afSToby Isaac     PetscInt c, coneSeries, s,supportSeries;
123624c766afSToby Isaac 
123724c766afSToby Isaac     c = mesh->maxConeSize;
123824c766afSToby Isaac     coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1;
123924c766afSToby Isaac     s = mesh->maxSupportSize;
124024c766afSToby Isaac     supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1;
124124c766afSToby Isaac     maxSize = 2*PetscMax(coneSeries,supportSeries);
124224c766afSToby Isaac   }
1243bfbcdd7aSMatthew G. Knepley   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
1244bfbcdd7aSMatthew G. Knepley   if (*points) {
1245bfbcdd7aSMatthew G. Knepley     closure = *points;
1246bfbcdd7aSMatthew G. Knepley   } else {
1247bfbcdd7aSMatthew G. Knepley     ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
1248bfbcdd7aSMatthew G. Knepley   }
1249bfbcdd7aSMatthew G. Knepley   closure[0] = p; closure[1] = 0;
1250552f7358SJed Brown   for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) {
1251552f7358SJed Brown     const PetscInt cp = tmp[t];
1252552f7358SJed Brown     const PetscInt co = tmpO ? tmpO[t] : 0;
1253552f7358SJed Brown 
1254552f7358SJed Brown     closure[closureSize]   = cp;
1255552f7358SJed Brown     closure[closureSize+1] = co;
1256552f7358SJed Brown     fifo[fifoSize]         = cp;
1257552f7358SJed Brown     fifo[fifoSize+1]       = co;
1258552f7358SJed Brown   }
1259bfbcdd7aSMatthew G. Knepley   /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */
1260552f7358SJed Brown   while (fifoSize - fifoStart) {
1261552f7358SJed Brown     const PetscInt q   = fifo[fifoStart];
1262552f7358SJed Brown     const PetscInt o   = fifo[fifoStart+1];
1263552f7358SJed Brown     const PetscInt rev = o >= 0 ? 0 : 1;
1264552f7358SJed Brown     const PetscInt off = rev ? -(o+1) : o;
1265552f7358SJed Brown 
1266552f7358SJed Brown     if (useCone) {
1267552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr);
1268552f7358SJed Brown       ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr);
1269552f7358SJed Brown       ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr);
1270552f7358SJed Brown     } else {
1271552f7358SJed Brown       ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr);
1272552f7358SJed Brown       ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr);
12730298fd71SBarry Smith       tmpO = NULL;
1274552f7358SJed Brown     }
1275552f7358SJed Brown     for (t = 0; t < tmpSize; ++t) {
1276552f7358SJed Brown       const PetscInt i  = ((rev ? tmpSize-t : t) + off)%tmpSize;
1277552f7358SJed Brown       const PetscInt cp = tmp[i];
12782e1b13c2SMatthew 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. */
12792e1b13c2SMatthew G. Knepley       /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1)
12802e1b13c2SMatthew G. Knepley        const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */
12812e1b13c2SMatthew G. Knepley       PetscInt       co = tmpO ? tmpO[i] : 0;
1282552f7358SJed Brown       PetscInt       c;
1283552f7358SJed Brown 
12842e1b13c2SMatthew G. Knepley       if (rev) {
12852e1b13c2SMatthew G. Knepley         PetscInt childSize, coff;
12862e1b13c2SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
12872e1b13c2SMatthew G. Knepley         coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
12882e1b13c2SMatthew G. Knepley         co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
12892e1b13c2SMatthew G. Knepley       }
1290552f7358SJed Brown       /* Check for duplicate */
1291552f7358SJed Brown       for (c = 0; c < closureSize; c += 2) {
1292552f7358SJed Brown         if (closure[c] == cp) break;
1293552f7358SJed Brown       }
1294552f7358SJed Brown       if (c == closureSize) {
1295552f7358SJed Brown         closure[closureSize]   = cp;
1296552f7358SJed Brown         closure[closureSize+1] = co;
1297552f7358SJed Brown         fifo[fifoSize]         = cp;
1298552f7358SJed Brown         fifo[fifoSize+1]       = co;
1299552f7358SJed Brown         closureSize           += 2;
1300552f7358SJed Brown         fifoSize              += 2;
1301552f7358SJed Brown       }
1302552f7358SJed Brown     }
1303552f7358SJed Brown     fifoStart += 2;
1304552f7358SJed Brown   }
1305552f7358SJed Brown   if (numPoints) *numPoints = closureSize/2;
1306552f7358SJed Brown   if (points)    *points    = closure;
1307552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
1308552f7358SJed Brown   PetscFunctionReturn(0);
1309552f7358SJed Brown }
1310552f7358SJed Brown 
1311552f7358SJed Brown #undef __FUNCT__
13129bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal"
13139bf0dad6SMatthew G. Knepley /*@C
13149bf0dad6SMatthew 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
13159bf0dad6SMatthew G. Knepley 
13169bf0dad6SMatthew G. Knepley   Not collective
13179bf0dad6SMatthew G. Knepley 
13189bf0dad6SMatthew G. Knepley   Input Parameters:
13199bf0dad6SMatthew G. Knepley + mesh - The DMPlex
13209bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
13219bf0dad6SMatthew G. Knepley . orientation - The orientation of the point
13229bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
13239bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used
13249bf0dad6SMatthew G. Knepley 
13259bf0dad6SMatthew G. Knepley   Output Parameters:
13269bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints
13279bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...]
13289bf0dad6SMatthew G. Knepley 
13299bf0dad6SMatthew G. Knepley   Note:
13309bf0dad6SMatthew G. Knepley   If using internal storage (points is NULL on input), each call overwrites the last output.
13319bf0dad6SMatthew G. Knepley 
13329bf0dad6SMatthew G. Knepley   Fortran Notes:
13339bf0dad6SMatthew G. Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
13349bf0dad6SMatthew G. Knepley   include petsc.h90 in your code.
13359bf0dad6SMatthew G. Knepley 
13369bf0dad6SMatthew G. Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
13379bf0dad6SMatthew G. Knepley 
13389bf0dad6SMatthew G. Knepley   Level: beginner
13399bf0dad6SMatthew G. Knepley 
13409bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
13419bf0dad6SMatthew G. Knepley @*/
13429bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
13439bf0dad6SMatthew G. Knepley {
13449bf0dad6SMatthew G. Knepley   DM_Plex        *mesh = (DM_Plex*) dm->data;
13459bf0dad6SMatthew G. Knepley   PetscInt       *closure, *fifo;
13469bf0dad6SMatthew G. Knepley   const PetscInt *tmp = NULL, *tmpO = NULL;
13479bf0dad6SMatthew G. Knepley   PetscInt        tmpSize, t;
13489bf0dad6SMatthew G. Knepley   PetscInt        depth       = 0, maxSize;
13499bf0dad6SMatthew G. Knepley   PetscInt        closureSize = 2, fifoSize = 0, fifoStart = 0;
13509bf0dad6SMatthew G. Knepley   PetscErrorCode  ierr;
13519bf0dad6SMatthew G. Knepley 
13529bf0dad6SMatthew G. Knepley   PetscFunctionBegin;
13539bf0dad6SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
13549bf0dad6SMatthew G. Knepley   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
13559bf0dad6SMatthew G. Knepley   /* This is only 1-level */
13569bf0dad6SMatthew G. Knepley   if (useCone) {
13579bf0dad6SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr);
13589bf0dad6SMatthew G. Knepley     ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr);
13599bf0dad6SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr);
13609bf0dad6SMatthew G. Knepley   } else {
13619bf0dad6SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr);
13629bf0dad6SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr);
13639bf0dad6SMatthew G. Knepley   }
13649bf0dad6SMatthew G. Knepley   if (depth == 1) {
13659bf0dad6SMatthew G. Knepley     if (*points) {
13669bf0dad6SMatthew G. Knepley       closure = *points;
13679bf0dad6SMatthew G. Knepley     } else {
13689bf0dad6SMatthew G. Knepley       maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1);
13699bf0dad6SMatthew G. Knepley       ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
13709bf0dad6SMatthew G. Knepley     }
13719bf0dad6SMatthew G. Knepley     closure[0] = p; closure[1] = ornt;
13729bf0dad6SMatthew G. Knepley     for (t = 0; t < tmpSize; ++t, closureSize += 2) {
13739bf0dad6SMatthew G. Knepley       const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize;
13749bf0dad6SMatthew G. Knepley       closure[closureSize]   = tmp[i];
13759bf0dad6SMatthew G. Knepley       closure[closureSize+1] = tmpO ? tmpO[i] : 0;
13769bf0dad6SMatthew G. Knepley     }
13779bf0dad6SMatthew G. Knepley     if (numPoints) *numPoints = closureSize/2;
13789bf0dad6SMatthew G. Knepley     if (points)    *points    = closure;
13799bf0dad6SMatthew G. Knepley     PetscFunctionReturn(0);
13809bf0dad6SMatthew G. Knepley   }
138124c766afSToby Isaac   {
138224c766afSToby Isaac     PetscInt c, coneSeries, s,supportSeries;
138324c766afSToby Isaac 
138424c766afSToby Isaac     c = mesh->maxConeSize;
138524c766afSToby Isaac     coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1;
138624c766afSToby Isaac     s = mesh->maxSupportSize;
138724c766afSToby Isaac     supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1;
138824c766afSToby Isaac     maxSize = 2*PetscMax(coneSeries,supportSeries);
138924c766afSToby Isaac   }
13909bf0dad6SMatthew G. Knepley   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
13919bf0dad6SMatthew G. Knepley   if (*points) {
13929bf0dad6SMatthew G. Knepley     closure = *points;
13939bf0dad6SMatthew G. Knepley   } else {
13949bf0dad6SMatthew G. Knepley     ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
13959bf0dad6SMatthew G. Knepley   }
13969bf0dad6SMatthew G. Knepley   closure[0] = p; closure[1] = ornt;
13979bf0dad6SMatthew G. Knepley   for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) {
13989bf0dad6SMatthew G. Knepley     const PetscInt i  = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize;
13999bf0dad6SMatthew G. Knepley     const PetscInt cp = tmp[i];
14009bf0dad6SMatthew G. Knepley     PetscInt       co = tmpO ? tmpO[i] : 0;
14019bf0dad6SMatthew G. Knepley 
14029bf0dad6SMatthew G. Knepley     if (ornt < 0) {
14039bf0dad6SMatthew G. Knepley       PetscInt childSize, coff;
14049bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
14059bf0dad6SMatthew G. Knepley       coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
14069bf0dad6SMatthew G. Knepley       co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
14079bf0dad6SMatthew G. Knepley     }
14089bf0dad6SMatthew G. Knepley     closure[closureSize]   = cp;
14099bf0dad6SMatthew G. Knepley     closure[closureSize+1] = co;
14109bf0dad6SMatthew G. Knepley     fifo[fifoSize]         = cp;
14119bf0dad6SMatthew G. Knepley     fifo[fifoSize+1]       = co;
14129bf0dad6SMatthew G. Knepley   }
14139bf0dad6SMatthew G. Knepley   /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */
14149bf0dad6SMatthew G. Knepley   while (fifoSize - fifoStart) {
14159bf0dad6SMatthew G. Knepley     const PetscInt q   = fifo[fifoStart];
14169bf0dad6SMatthew G. Knepley     const PetscInt o   = fifo[fifoStart+1];
14179bf0dad6SMatthew G. Knepley     const PetscInt rev = o >= 0 ? 0 : 1;
14189bf0dad6SMatthew G. Knepley     const PetscInt off = rev ? -(o+1) : o;
14199bf0dad6SMatthew G. Knepley 
14209bf0dad6SMatthew G. Knepley     if (useCone) {
14219bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr);
14229bf0dad6SMatthew G. Knepley       ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr);
14239bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr);
14249bf0dad6SMatthew G. Knepley     } else {
14259bf0dad6SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr);
14269bf0dad6SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr);
14279bf0dad6SMatthew G. Knepley       tmpO = NULL;
14289bf0dad6SMatthew G. Knepley     }
14299bf0dad6SMatthew G. Knepley     for (t = 0; t < tmpSize; ++t) {
14309bf0dad6SMatthew G. Knepley       const PetscInt i  = ((rev ? tmpSize-t : t) + off)%tmpSize;
14319bf0dad6SMatthew G. Knepley       const PetscInt cp = tmp[i];
14329bf0dad6SMatthew 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. */
14339bf0dad6SMatthew G. Knepley       /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1)
14349bf0dad6SMatthew G. Knepley        const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */
14359bf0dad6SMatthew G. Knepley       PetscInt       co = tmpO ? tmpO[i] : 0;
14369bf0dad6SMatthew G. Knepley       PetscInt       c;
14379bf0dad6SMatthew G. Knepley 
14389bf0dad6SMatthew G. Knepley       if (rev) {
14399bf0dad6SMatthew G. Knepley         PetscInt childSize, coff;
14409bf0dad6SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
14419bf0dad6SMatthew G. Knepley         coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
14429bf0dad6SMatthew G. Knepley         co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
14439bf0dad6SMatthew G. Knepley       }
14449bf0dad6SMatthew G. Knepley       /* Check for duplicate */
14459bf0dad6SMatthew G. Knepley       for (c = 0; c < closureSize; c += 2) {
14469bf0dad6SMatthew G. Knepley         if (closure[c] == cp) break;
14479bf0dad6SMatthew G. Knepley       }
14489bf0dad6SMatthew G. Knepley       if (c == closureSize) {
14499bf0dad6SMatthew G. Knepley         closure[closureSize]   = cp;
14509bf0dad6SMatthew G. Knepley         closure[closureSize+1] = co;
14519bf0dad6SMatthew G. Knepley         fifo[fifoSize]         = cp;
14529bf0dad6SMatthew G. Knepley         fifo[fifoSize+1]       = co;
14539bf0dad6SMatthew G. Knepley         closureSize           += 2;
14549bf0dad6SMatthew G. Knepley         fifoSize              += 2;
14559bf0dad6SMatthew G. Knepley       }
14569bf0dad6SMatthew G. Knepley     }
14579bf0dad6SMatthew G. Knepley     fifoStart += 2;
14589bf0dad6SMatthew G. Knepley   }
14599bf0dad6SMatthew G. Knepley   if (numPoints) *numPoints = closureSize/2;
14609bf0dad6SMatthew G. Knepley   if (points)    *points    = closure;
14619bf0dad6SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
14629bf0dad6SMatthew G. Knepley   PetscFunctionReturn(0);
14639bf0dad6SMatthew G. Knepley }
14649bf0dad6SMatthew G. Knepley 
14659bf0dad6SMatthew G. Knepley #undef __FUNCT__
1466552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure"
1467552f7358SJed Brown /*@C
1468552f7358SJed 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
1469552f7358SJed Brown 
1470552f7358SJed Brown   Not collective
1471552f7358SJed Brown 
1472552f7358SJed Brown   Input Parameters:
1473552f7358SJed Brown + mesh - The DMPlex
1474552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1475552f7358SJed Brown . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
1476e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit
1477e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit
1478552f7358SJed Brown 
1479552f7358SJed Brown   Note:
14800298fd71SBarry Smith   If not using internal storage (points is not NULL on input), this call is unnecessary
1481552f7358SJed Brown 
14823813dfbdSMatthew G Knepley   Fortran Notes:
14833813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
14843813dfbdSMatthew G Knepley   include petsc.h90 in your code.
14853813dfbdSMatthew G Knepley 
14863813dfbdSMatthew G Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
14873813dfbdSMatthew G Knepley 
1488552f7358SJed Brown   Level: beginner
1489552f7358SJed Brown 
1490552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1491552f7358SJed Brown @*/
1492552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
1493552f7358SJed Brown {
1494552f7358SJed Brown   PetscErrorCode ierr;
1495552f7358SJed Brown 
1496552f7358SJed Brown   PetscFunctionBegin;
1497552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1498e5c84f05SJed Brown   if (numPoints) PetscValidIntPointer(numPoints,4);
1499e5c84f05SJed Brown   if (points) PetscValidPointer(points,5);
1500552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr);
15014ff43b2cSJed Brown   if (numPoints) *numPoints = 0;
1502552f7358SJed Brown   PetscFunctionReturn(0);
1503552f7358SJed Brown }
1504552f7358SJed Brown 
1505552f7358SJed Brown #undef __FUNCT__
1506552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes"
1507552f7358SJed Brown /*@
1508552f7358SJed Brown   DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG
1509552f7358SJed Brown 
1510552f7358SJed Brown   Not collective
1511552f7358SJed Brown 
1512552f7358SJed Brown   Input Parameter:
1513552f7358SJed Brown . mesh - The DMPlex
1514552f7358SJed Brown 
1515552f7358SJed Brown   Output Parameters:
1516552f7358SJed Brown + maxConeSize - The maximum number of in-edges
1517552f7358SJed Brown - maxSupportSize - The maximum number of out-edges
1518552f7358SJed Brown 
1519552f7358SJed Brown   Level: beginner
1520552f7358SJed Brown 
1521552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart()
1522552f7358SJed Brown @*/
1523552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize)
1524552f7358SJed Brown {
1525552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
1526552f7358SJed Brown 
1527552f7358SJed Brown   PetscFunctionBegin;
1528552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1529552f7358SJed Brown   if (maxConeSize)    *maxConeSize    = mesh->maxConeSize;
1530552f7358SJed Brown   if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize;
1531552f7358SJed Brown   PetscFunctionReturn(0);
1532552f7358SJed Brown }
1533552f7358SJed Brown 
1534552f7358SJed Brown #undef __FUNCT__
1535552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex"
1536552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm)
1537552f7358SJed Brown {
1538552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1539552f7358SJed Brown   PetscInt       size;
1540552f7358SJed Brown   PetscErrorCode ierr;
1541552f7358SJed Brown 
1542552f7358SJed Brown   PetscFunctionBegin;
1543552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1544552f7358SJed Brown   ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr);
1545552f7358SJed Brown   ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr);
15461795a4d1SJed Brown   ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr);
15471795a4d1SJed Brown   ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr);
1548552f7358SJed Brown   if (mesh->maxSupportSize) {
1549552f7358SJed Brown     ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr);
1550552f7358SJed Brown     ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr);
15511795a4d1SJed Brown     ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr);
1552552f7358SJed Brown   }
1553552f7358SJed Brown   PetscFunctionReturn(0);
1554552f7358SJed Brown }
1555552f7358SJed Brown 
1556552f7358SJed Brown #undef __FUNCT__
1557552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex"
1558552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm)
1559552f7358SJed Brown {
1560552f7358SJed Brown   PetscErrorCode ierr;
1561552f7358SJed Brown 
1562552f7358SJed Brown   PetscFunctionBegin;
15634d9407bcSMatthew G. Knepley   if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);}
15644d9407bcSMatthew G. Knepley   ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr);
1565552f7358SJed Brown   PetscFunctionReturn(0);
1566552f7358SJed Brown }
1567552f7358SJed Brown 
1568552f7358SJed Brown #undef __FUNCT__
1569552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize"
1570552f7358SJed Brown /*@
1571552f7358SJed Brown   DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation
1572552f7358SJed Brown 
1573552f7358SJed Brown   Not collective
1574552f7358SJed Brown 
1575552f7358SJed Brown   Input Parameter:
1576552f7358SJed Brown . mesh - The DMPlex
1577552f7358SJed Brown 
1578552f7358SJed Brown   Output Parameter:
1579552f7358SJed Brown 
1580552f7358SJed Brown   Note:
1581552f7358SJed Brown   This should be called after all calls to DMPlexSetCone()
1582552f7358SJed Brown 
1583552f7358SJed Brown   Level: beginner
1584552f7358SJed Brown 
1585552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone()
1586552f7358SJed Brown @*/
1587552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm)
1588552f7358SJed Brown {
1589552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1590552f7358SJed Brown   PetscInt      *offsets;
1591552f7358SJed Brown   PetscInt       supportSize;
1592552f7358SJed Brown   PetscInt       pStart, pEnd, p;
1593552f7358SJed Brown   PetscErrorCode ierr;
1594552f7358SJed Brown 
1595552f7358SJed Brown   PetscFunctionBegin;
1596552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
159782f516ccSBarry Smith   if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex");
1598552f7358SJed Brown   /* Calculate support sizes */
1599552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
1600552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1601552f7358SJed Brown     PetscInt dof, off, c;
1602552f7358SJed Brown 
1603552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
1604552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
1605552f7358SJed Brown     for (c = off; c < off+dof; ++c) {
1606552f7358SJed Brown       ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr);
1607552f7358SJed Brown     }
1608552f7358SJed Brown   }
1609552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1610552f7358SJed Brown     PetscInt dof;
1611552f7358SJed Brown 
1612552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
16130d644c17SKarl Rupp 
1614552f7358SJed Brown     mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof);
1615552f7358SJed Brown   }
1616552f7358SJed Brown   ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr);
1617552f7358SJed Brown   /* Calculate supports */
1618552f7358SJed Brown   ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr);
16191795a4d1SJed Brown   ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr);
16201795a4d1SJed Brown   ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr);
1621552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1622552f7358SJed Brown     PetscInt dof, off, c;
1623552f7358SJed Brown 
1624552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
1625552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
1626552f7358SJed Brown     for (c = off; c < off+dof; ++c) {
1627552f7358SJed Brown       const PetscInt q = mesh->cones[c];
1628552f7358SJed Brown       PetscInt       offS;
1629552f7358SJed Brown 
1630552f7358SJed Brown       ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr);
16310d644c17SKarl Rupp 
1632552f7358SJed Brown       mesh->supports[offS+offsets[q]] = p;
1633552f7358SJed Brown       ++offsets[q];
1634552f7358SJed Brown     }
1635552f7358SJed Brown   }
1636552f7358SJed Brown   ierr = PetscFree(offsets);CHKERRQ(ierr);
1637552f7358SJed Brown   PetscFunctionReturn(0);
1638552f7358SJed Brown }
1639552f7358SJed Brown 
1640552f7358SJed Brown #undef __FUNCT__
1641552f7358SJed Brown #define __FUNCT__ "DMPlexStratify"
1642552f7358SJed Brown /*@
1643552f7358SJed Brown   DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and
1644552f7358SJed Brown   can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the
1645552f7358SJed Brown   same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in
1646552f7358SJed Brown   the DAG.
1647552f7358SJed Brown 
1648552f7358SJed Brown   Not collective
1649552f7358SJed Brown 
1650552f7358SJed Brown   Input Parameter:
1651552f7358SJed Brown . mesh - The DMPlex
1652552f7358SJed Brown 
1653552f7358SJed Brown   Output Parameter:
1654552f7358SJed Brown 
1655552f7358SJed Brown   Notes:
1656150b719bSJed Brown   Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices,
1657150b719bSJed Brown   1 for edges, and so on.  The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or
1658150b719bSJed Brown   manually via DMPlexGetLabel().  The height is defined implicitly by height = maxDimension - depth, and can be accessed
1659150b719bSJed Brown   via DMPlexGetHeightStratum().  For example, cells have height 0 and faces have height 1.
1660552f7358SJed Brown 
1661150b719bSJed Brown   DMPlexStratify() should be called after all calls to DMPlexSymmetrize()
1662552f7358SJed Brown 
1663552f7358SJed Brown   Level: beginner
1664552f7358SJed Brown 
1665552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize()
1666552f7358SJed Brown @*/
1667552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm)
1668552f7358SJed Brown {
1669aa50250dSMatthew G. Knepley   DMLabel        label;
1670552f7358SJed Brown   PetscInt       pStart, pEnd, p;
1671552f7358SJed Brown   PetscInt       numRoots = 0, numLeaves = 0;
1672552f7358SJed Brown   PetscErrorCode ierr;
1673552f7358SJed Brown 
1674552f7358SJed Brown   PetscFunctionBegin;
1675552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1676552f7358SJed Brown   ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr);
1677552f7358SJed Brown   /* Calculate depth */
1678aa50250dSMatthew G. Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
1679aa50250dSMatthew G. Knepley   ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr);
1680aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
1681552f7358SJed Brown   /* Initialize roots and count leaves */
1682552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1683552f7358SJed Brown     PetscInt coneSize, supportSize;
1684552f7358SJed Brown 
1685552f7358SJed Brown     ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
1686552f7358SJed Brown     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
1687552f7358SJed Brown     if (!coneSize && supportSize) {
1688552f7358SJed Brown       ++numRoots;
1689aa50250dSMatthew G. Knepley       ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr);
1690552f7358SJed Brown     } else if (!supportSize && coneSize) {
1691552f7358SJed Brown       ++numLeaves;
1692552f7358SJed Brown     } else if (!supportSize && !coneSize) {
1693552f7358SJed Brown       /* Isolated points */
1694aa50250dSMatthew G. Knepley       ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr);
1695552f7358SJed Brown     }
1696552f7358SJed Brown   }
1697552f7358SJed Brown   if (numRoots + numLeaves == (pEnd - pStart)) {
1698552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
1699552f7358SJed Brown       PetscInt coneSize, supportSize;
1700552f7358SJed Brown 
1701552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
1702552f7358SJed Brown       ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
1703552f7358SJed Brown       if (!supportSize && coneSize) {
1704aa50250dSMatthew G. Knepley         ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr);
1705552f7358SJed Brown       }
1706552f7358SJed Brown     }
1707552f7358SJed Brown   } else {
170874ef644bSMatthew G. Knepley     IS       pointIS;
170974ef644bSMatthew G. Knepley     PetscInt numPoints = 0, level = 0;
1710552f7358SJed Brown 
171174ef644bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr);
171274ef644bSMatthew G. Knepley     if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);}
171374ef644bSMatthew G. Knepley     while (numPoints) {
171474ef644bSMatthew G. Knepley       const PetscInt *points;
171574ef644bSMatthew G. Knepley       const PetscInt  newLevel = level+1;
171674ef644bSMatthew G. Knepley 
171774ef644bSMatthew G. Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
171874ef644bSMatthew G. Knepley       for (p = 0; p < numPoints; ++p) {
171974ef644bSMatthew G. Knepley         const PetscInt  point = points[p];
172074ef644bSMatthew G. Knepley         const PetscInt *support;
172174ef644bSMatthew G. Knepley         PetscInt        supportSize, s;
172274ef644bSMatthew G. Knepley 
172374ef644bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
172474ef644bSMatthew G. Knepley         ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
172574ef644bSMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
172674ef644bSMatthew G. Knepley           ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr);
1727552f7358SJed Brown         }
1728552f7358SJed Brown       }
17295edfc765SMatthew G. Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
173074ef644bSMatthew G. Knepley       ++level;
173174ef644bSMatthew G. Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
173274ef644bSMatthew G. Knepley       ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr);
173374ef644bSMatthew G. Knepley       if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);}
173474ef644bSMatthew G. Knepley       else         {numPoints = 0;}
173574ef644bSMatthew G. Knepley     }
173674ef644bSMatthew G. Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
173774ef644bSMatthew G. Knepley   }
1738552f7358SJed Brown   ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr);
1739552f7358SJed Brown   PetscFunctionReturn(0);
1740552f7358SJed Brown }
1741552f7358SJed Brown 
1742552f7358SJed Brown #undef __FUNCT__
1743552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin"
1744552f7358SJed Brown /*@C
1745552f7358SJed Brown   DMPlexGetJoin - Get an array for the join of the set of points
1746552f7358SJed Brown 
1747552f7358SJed Brown   Not Collective
1748552f7358SJed Brown 
1749552f7358SJed Brown   Input Parameters:
1750552f7358SJed Brown + dm - The DMPlex object
1751552f7358SJed Brown . numPoints - The number of input points for the join
1752552f7358SJed Brown - points - The input points
1753552f7358SJed Brown 
1754552f7358SJed Brown   Output Parameters:
1755552f7358SJed Brown + numCoveredPoints - The number of points in the join
1756552f7358SJed Brown - coveredPoints - The points in the join
1757552f7358SJed Brown 
1758552f7358SJed Brown   Level: intermediate
1759552f7358SJed Brown 
1760552f7358SJed Brown   Note: Currently, this is restricted to a single level join
1761552f7358SJed Brown 
17623813dfbdSMatthew G Knepley   Fortran Notes:
17633813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
17643813dfbdSMatthew G Knepley   include petsc.h90 in your code.
17653813dfbdSMatthew G Knepley 
17663813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
17673813dfbdSMatthew G Knepley 
1768552f7358SJed Brown .keywords: mesh
1769552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet()
1770552f7358SJed Brown @*/
1771552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1772552f7358SJed Brown {
1773552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1774552f7358SJed Brown   PetscInt      *join[2];
1775552f7358SJed Brown   PetscInt       joinSize, i = 0;
1776552f7358SJed Brown   PetscInt       dof, off, p, c, m;
1777552f7358SJed Brown   PetscErrorCode ierr;
1778552f7358SJed Brown 
1779552f7358SJed Brown   PetscFunctionBegin;
1780552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1781552f7358SJed Brown   PetscValidPointer(points, 2);
1782552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1783552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1784552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr);
1785552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr);
1786552f7358SJed Brown   /* Copy in support of first point */
1787552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr);
1788552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr);
1789552f7358SJed Brown   for (joinSize = 0; joinSize < dof; ++joinSize) {
1790552f7358SJed Brown     join[i][joinSize] = mesh->supports[off+joinSize];
1791552f7358SJed Brown   }
1792552f7358SJed Brown   /* Check each successive support */
1793552f7358SJed Brown   for (p = 1; p < numPoints; ++p) {
1794552f7358SJed Brown     PetscInt newJoinSize = 0;
1795552f7358SJed Brown 
1796552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr);
1797552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr);
1798552f7358SJed Brown     for (c = 0; c < dof; ++c) {
1799552f7358SJed Brown       const PetscInt point = mesh->supports[off+c];
1800552f7358SJed Brown 
1801552f7358SJed Brown       for (m = 0; m < joinSize; ++m) {
1802552f7358SJed Brown         if (point == join[i][m]) {
1803552f7358SJed Brown           join[1-i][newJoinSize++] = point;
1804552f7358SJed Brown           break;
1805552f7358SJed Brown         }
1806552f7358SJed Brown       }
1807552f7358SJed Brown     }
1808552f7358SJed Brown     joinSize = newJoinSize;
1809552f7358SJed Brown     i        = 1-i;
1810552f7358SJed Brown   }
1811552f7358SJed Brown   *numCoveredPoints = joinSize;
1812552f7358SJed Brown   *coveredPoints    = join[i];
1813552f7358SJed Brown   ierr              = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr);
1814552f7358SJed Brown   PetscFunctionReturn(0);
1815552f7358SJed Brown }
1816552f7358SJed Brown 
1817552f7358SJed Brown #undef __FUNCT__
1818552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin"
1819552f7358SJed Brown /*@C
1820552f7358SJed Brown   DMPlexRestoreJoin - Restore an array for the join of the set of points
1821552f7358SJed Brown 
1822552f7358SJed Brown   Not Collective
1823552f7358SJed Brown 
1824552f7358SJed Brown   Input Parameters:
1825552f7358SJed Brown + dm - The DMPlex object
1826552f7358SJed Brown . numPoints - The number of input points for the join
1827552f7358SJed Brown - points - The input points
1828552f7358SJed Brown 
1829552f7358SJed Brown   Output Parameters:
1830552f7358SJed Brown + numCoveredPoints - The number of points in the join
1831552f7358SJed Brown - coveredPoints - The points in the join
1832552f7358SJed Brown 
18333813dfbdSMatthew G Knepley   Fortran Notes:
18343813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
18353813dfbdSMatthew G Knepley   include petsc.h90 in your code.
18363813dfbdSMatthew G Knepley 
18373813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
18383813dfbdSMatthew G Knepley 
1839552f7358SJed Brown   Level: intermediate
1840552f7358SJed Brown 
1841552f7358SJed Brown .keywords: mesh
1842552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet()
1843552f7358SJed Brown @*/
1844552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1845552f7358SJed Brown {
1846552f7358SJed Brown   PetscErrorCode ierr;
1847552f7358SJed Brown 
1848552f7358SJed Brown   PetscFunctionBegin;
1849552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1850d7902bd2SMatthew G. Knepley   if (points) PetscValidIntPointer(points,3);
1851d7902bd2SMatthew G. Knepley   if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4);
1852d7902bd2SMatthew G. Knepley   PetscValidPointer(coveredPoints, 5);
1853552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr);
1854d7902bd2SMatthew G. Knepley   if (numCoveredPoints) *numCoveredPoints = 0;
1855552f7358SJed Brown   PetscFunctionReturn(0);
1856552f7358SJed Brown }
1857552f7358SJed Brown 
1858552f7358SJed Brown #undef __FUNCT__
1859552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin"
1860552f7358SJed Brown /*@C
1861552f7358SJed Brown   DMPlexGetFullJoin - Get an array for the join of the set of points
1862552f7358SJed Brown 
1863552f7358SJed Brown   Not Collective
1864552f7358SJed Brown 
1865552f7358SJed Brown   Input Parameters:
1866552f7358SJed Brown + dm - The DMPlex object
1867552f7358SJed Brown . numPoints - The number of input points for the join
1868552f7358SJed Brown - points - The input points
1869552f7358SJed Brown 
1870552f7358SJed Brown   Output Parameters:
1871552f7358SJed Brown + numCoveredPoints - The number of points in the join
1872552f7358SJed Brown - coveredPoints - The points in the join
1873552f7358SJed Brown 
18743813dfbdSMatthew G Knepley   Fortran Notes:
18753813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
18763813dfbdSMatthew G Knepley   include petsc.h90 in your code.
18773813dfbdSMatthew G Knepley 
18783813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
18793813dfbdSMatthew G Knepley 
1880552f7358SJed Brown   Level: intermediate
1881552f7358SJed Brown 
1882552f7358SJed Brown .keywords: mesh
1883552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet()
1884552f7358SJed Brown @*/
1885552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1886552f7358SJed Brown {
1887552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1888552f7358SJed Brown   PetscInt      *offsets, **closures;
1889552f7358SJed Brown   PetscInt      *join[2];
1890552f7358SJed Brown   PetscInt       depth = 0, maxSize, joinSize = 0, i = 0;
189124c766afSToby Isaac   PetscInt       p, d, c, m, ms;
1892552f7358SJed Brown   PetscErrorCode ierr;
1893552f7358SJed Brown 
1894552f7358SJed Brown   PetscFunctionBegin;
1895552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1896552f7358SJed Brown   PetscValidPointer(points, 2);
1897552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1898552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1899552f7358SJed Brown 
1900552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
19011795a4d1SJed Brown   ierr    = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr);
1902552f7358SJed Brown   ierr    = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr);
190324c766afSToby Isaac   ms      = mesh->maxSupportSize;
190424c766afSToby Isaac   maxSize = (ms > 1) ? ((PetscPowInt(ms,depth+1)-1)/(ms-1)) : depth + 1;
1905552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr);
1906552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr);
1907552f7358SJed Brown 
1908552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
1909552f7358SJed Brown     PetscInt closureSize;
1910552f7358SJed Brown 
1911552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr);
19120d644c17SKarl Rupp 
1913552f7358SJed Brown     offsets[p*(depth+2)+0] = 0;
1914552f7358SJed Brown     for (d = 0; d < depth+1; ++d) {
1915552f7358SJed Brown       PetscInt pStart, pEnd, i;
1916552f7358SJed Brown 
1917552f7358SJed Brown       ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
1918552f7358SJed Brown       for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) {
1919552f7358SJed Brown         if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) {
1920552f7358SJed Brown           offsets[p*(depth+2)+d+1] = i;
1921552f7358SJed Brown           break;
1922552f7358SJed Brown         }
1923552f7358SJed Brown       }
1924552f7358SJed Brown       if (i == closureSize) offsets[p*(depth+2)+d+1] = i;
1925552f7358SJed Brown     }
192682f516ccSBarry 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);
1927552f7358SJed Brown   }
1928552f7358SJed Brown   for (d = 0; d < depth+1; ++d) {
1929552f7358SJed Brown     PetscInt dof;
1930552f7358SJed Brown 
1931552f7358SJed Brown     /* Copy in support of first point */
1932552f7358SJed Brown     dof = offsets[d+1] - offsets[d];
1933552f7358SJed Brown     for (joinSize = 0; joinSize < dof; ++joinSize) {
1934552f7358SJed Brown       join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2];
1935552f7358SJed Brown     }
1936552f7358SJed Brown     /* Check each successive cone */
1937552f7358SJed Brown     for (p = 1; p < numPoints && joinSize; ++p) {
1938552f7358SJed Brown       PetscInt newJoinSize = 0;
1939552f7358SJed Brown 
1940552f7358SJed Brown       dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d];
1941552f7358SJed Brown       for (c = 0; c < dof; ++c) {
1942552f7358SJed Brown         const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2];
1943552f7358SJed Brown 
1944552f7358SJed Brown         for (m = 0; m < joinSize; ++m) {
1945552f7358SJed Brown           if (point == join[i][m]) {
1946552f7358SJed Brown             join[1-i][newJoinSize++] = point;
1947552f7358SJed Brown             break;
1948552f7358SJed Brown           }
1949552f7358SJed Brown         }
1950552f7358SJed Brown       }
1951552f7358SJed Brown       joinSize = newJoinSize;
1952552f7358SJed Brown       i        = 1-i;
1953552f7358SJed Brown     }
1954552f7358SJed Brown     if (joinSize) break;
1955552f7358SJed Brown   }
1956552f7358SJed Brown   *numCoveredPoints = joinSize;
1957552f7358SJed Brown   *coveredPoints    = join[i];
1958552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
19590298fd71SBarry Smith     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr);
1960552f7358SJed Brown   }
1961552f7358SJed Brown   ierr = PetscFree(closures);CHKERRQ(ierr);
1962552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr);
1963552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr);
1964552f7358SJed Brown   PetscFunctionReturn(0);
1965552f7358SJed Brown }
1966552f7358SJed Brown 
1967552f7358SJed Brown #undef __FUNCT__
1968552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet"
1969552f7358SJed Brown /*@C
1970552f7358SJed Brown   DMPlexGetMeet - Get an array for the meet of the set of points
1971552f7358SJed Brown 
1972552f7358SJed Brown   Not Collective
1973552f7358SJed Brown 
1974552f7358SJed Brown   Input Parameters:
1975552f7358SJed Brown + dm - The DMPlex object
1976552f7358SJed Brown . numPoints - The number of input points for the meet
1977552f7358SJed Brown - points - The input points
1978552f7358SJed Brown 
1979552f7358SJed Brown   Output Parameters:
1980552f7358SJed Brown + numCoveredPoints - The number of points in the meet
1981552f7358SJed Brown - coveredPoints - The points in the meet
1982552f7358SJed Brown 
1983552f7358SJed Brown   Level: intermediate
1984552f7358SJed Brown 
1985552f7358SJed Brown   Note: Currently, this is restricted to a single level meet
1986552f7358SJed Brown 
19873813dfbdSMatthew G Knepley   Fortran Notes:
19883813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
19893813dfbdSMatthew G Knepley   include petsc.h90 in your code.
19903813dfbdSMatthew G Knepley 
19913813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
19923813dfbdSMatthew G Knepley 
1993552f7358SJed Brown .keywords: mesh
1994552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin()
1995552f7358SJed Brown @*/
1996552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints)
1997552f7358SJed Brown {
1998552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1999552f7358SJed Brown   PetscInt      *meet[2];
2000552f7358SJed Brown   PetscInt       meetSize, i = 0;
2001552f7358SJed Brown   PetscInt       dof, off, p, c, m;
2002552f7358SJed Brown   PetscErrorCode ierr;
2003552f7358SJed Brown 
2004552f7358SJed Brown   PetscFunctionBegin;
2005552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2006552f7358SJed Brown   PetscValidPointer(points, 2);
2007552f7358SJed Brown   PetscValidPointer(numCoveringPoints, 3);
2008552f7358SJed Brown   PetscValidPointer(coveringPoints, 4);
2009552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr);
2010552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr);
2011552f7358SJed Brown   /* Copy in cone of first point */
2012552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr);
2013552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr);
2014552f7358SJed Brown   for (meetSize = 0; meetSize < dof; ++meetSize) {
2015552f7358SJed Brown     meet[i][meetSize] = mesh->cones[off+meetSize];
2016552f7358SJed Brown   }
2017552f7358SJed Brown   /* Check each successive cone */
2018552f7358SJed Brown   for (p = 1; p < numPoints; ++p) {
2019552f7358SJed Brown     PetscInt newMeetSize = 0;
2020552f7358SJed Brown 
2021552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr);
2022552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr);
2023552f7358SJed Brown     for (c = 0; c < dof; ++c) {
2024552f7358SJed Brown       const PetscInt point = mesh->cones[off+c];
2025552f7358SJed Brown 
2026552f7358SJed Brown       for (m = 0; m < meetSize; ++m) {
2027552f7358SJed Brown         if (point == meet[i][m]) {
2028552f7358SJed Brown           meet[1-i][newMeetSize++] = point;
2029552f7358SJed Brown           break;
2030552f7358SJed Brown         }
2031552f7358SJed Brown       }
2032552f7358SJed Brown     }
2033552f7358SJed Brown     meetSize = newMeetSize;
2034552f7358SJed Brown     i        = 1-i;
2035552f7358SJed Brown   }
2036552f7358SJed Brown   *numCoveringPoints = meetSize;
2037552f7358SJed Brown   *coveringPoints    = meet[i];
2038552f7358SJed Brown   ierr               = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr);
2039552f7358SJed Brown   PetscFunctionReturn(0);
2040552f7358SJed Brown }
2041552f7358SJed Brown 
2042552f7358SJed Brown #undef __FUNCT__
2043552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet"
2044552f7358SJed Brown /*@C
2045552f7358SJed Brown   DMPlexRestoreMeet - Restore an array for the meet of the set of points
2046552f7358SJed Brown 
2047552f7358SJed Brown   Not Collective
2048552f7358SJed Brown 
2049552f7358SJed Brown   Input Parameters:
2050552f7358SJed Brown + dm - The DMPlex object
2051552f7358SJed Brown . numPoints - The number of input points for the meet
2052552f7358SJed Brown - points - The input points
2053552f7358SJed Brown 
2054552f7358SJed Brown   Output Parameters:
2055552f7358SJed Brown + numCoveredPoints - The number of points in the meet
2056552f7358SJed Brown - coveredPoints - The points in the meet
2057552f7358SJed Brown 
2058552f7358SJed Brown   Level: intermediate
2059552f7358SJed Brown 
20603813dfbdSMatthew G Knepley   Fortran Notes:
20613813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
20623813dfbdSMatthew G Knepley   include petsc.h90 in your code.
20633813dfbdSMatthew G Knepley 
20643813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
20653813dfbdSMatthew G Knepley 
2066552f7358SJed Brown .keywords: mesh
2067552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin()
2068552f7358SJed Brown @*/
2069552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
2070552f7358SJed Brown {
2071552f7358SJed Brown   PetscErrorCode ierr;
2072552f7358SJed Brown 
2073552f7358SJed Brown   PetscFunctionBegin;
2074552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2075d7902bd2SMatthew G. Knepley   if (points) PetscValidIntPointer(points,3);
2076d7902bd2SMatthew G. Knepley   if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4);
2077d7902bd2SMatthew G. Knepley   PetscValidPointer(coveredPoints,5);
2078552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr);
2079d7902bd2SMatthew G. Knepley   if (numCoveredPoints) *numCoveredPoints = 0;
2080552f7358SJed Brown   PetscFunctionReturn(0);
2081552f7358SJed Brown }
2082552f7358SJed Brown 
2083552f7358SJed Brown #undef __FUNCT__
2084552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet"
2085552f7358SJed Brown /*@C
2086552f7358SJed Brown   DMPlexGetFullMeet - Get an array for the meet of the set of points
2087552f7358SJed Brown 
2088552f7358SJed Brown   Not Collective
2089552f7358SJed Brown 
2090552f7358SJed Brown   Input Parameters:
2091552f7358SJed Brown + dm - The DMPlex object
2092552f7358SJed Brown . numPoints - The number of input points for the meet
2093552f7358SJed Brown - points - The input points
2094552f7358SJed Brown 
2095552f7358SJed Brown   Output Parameters:
2096552f7358SJed Brown + numCoveredPoints - The number of points in the meet
2097552f7358SJed Brown - coveredPoints - The points in the meet
2098552f7358SJed Brown 
2099552f7358SJed Brown   Level: intermediate
2100552f7358SJed Brown 
21013813dfbdSMatthew G Knepley   Fortran Notes:
21023813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
21033813dfbdSMatthew G Knepley   include petsc.h90 in your code.
21043813dfbdSMatthew G Knepley 
21053813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
21063813dfbdSMatthew G Knepley 
2107552f7358SJed Brown .keywords: mesh
2108552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin()
2109552f7358SJed Brown @*/
2110552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
2111552f7358SJed Brown {
2112552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
2113552f7358SJed Brown   PetscInt      *offsets, **closures;
2114552f7358SJed Brown   PetscInt      *meet[2];
2115552f7358SJed Brown   PetscInt       height = 0, maxSize, meetSize = 0, i = 0;
211624c766afSToby Isaac   PetscInt       p, h, c, m, mc;
2117552f7358SJed Brown   PetscErrorCode ierr;
2118552f7358SJed Brown 
2119552f7358SJed Brown   PetscFunctionBegin;
2120552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2121552f7358SJed Brown   PetscValidPointer(points, 2);
2122552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
2123552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
2124552f7358SJed Brown 
2125552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &height);CHKERRQ(ierr);
2126785e854fSJed Brown   ierr    = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr);
2127552f7358SJed Brown   ierr    = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr);
212824c766afSToby Isaac   mc      = mesh->maxConeSize;
212924c766afSToby Isaac   maxSize = (mc > 1) ? ((PetscPowInt(mc,height+1)-1)/(mc-1)) : height + 1;
2130552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr);
2131552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr);
2132552f7358SJed Brown 
2133552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
2134552f7358SJed Brown     PetscInt closureSize;
2135552f7358SJed Brown 
2136552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr);
21370d644c17SKarl Rupp 
2138552f7358SJed Brown     offsets[p*(height+2)+0] = 0;
2139552f7358SJed Brown     for (h = 0; h < height+1; ++h) {
2140552f7358SJed Brown       PetscInt pStart, pEnd, i;
2141552f7358SJed Brown 
2142552f7358SJed Brown       ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr);
2143552f7358SJed Brown       for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) {
2144552f7358SJed Brown         if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) {
2145552f7358SJed Brown           offsets[p*(height+2)+h+1] = i;
2146552f7358SJed Brown           break;
2147552f7358SJed Brown         }
2148552f7358SJed Brown       }
2149552f7358SJed Brown       if (i == closureSize) offsets[p*(height+2)+h+1] = i;
2150552f7358SJed Brown     }
215182f516ccSBarry 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);
2152552f7358SJed Brown   }
2153552f7358SJed Brown   for (h = 0; h < height+1; ++h) {
2154552f7358SJed Brown     PetscInt dof;
2155552f7358SJed Brown 
2156552f7358SJed Brown     /* Copy in cone of first point */
2157552f7358SJed Brown     dof = offsets[h+1] - offsets[h];
2158552f7358SJed Brown     for (meetSize = 0; meetSize < dof; ++meetSize) {
2159552f7358SJed Brown       meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2];
2160552f7358SJed Brown     }
2161552f7358SJed Brown     /* Check each successive cone */
2162552f7358SJed Brown     for (p = 1; p < numPoints && meetSize; ++p) {
2163552f7358SJed Brown       PetscInt newMeetSize = 0;
2164552f7358SJed Brown 
2165552f7358SJed Brown       dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h];
2166552f7358SJed Brown       for (c = 0; c < dof; ++c) {
2167552f7358SJed Brown         const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2];
2168552f7358SJed Brown 
2169552f7358SJed Brown         for (m = 0; m < meetSize; ++m) {
2170552f7358SJed Brown           if (point == meet[i][m]) {
2171552f7358SJed Brown             meet[1-i][newMeetSize++] = point;
2172552f7358SJed Brown             break;
2173552f7358SJed Brown           }
2174552f7358SJed Brown         }
2175552f7358SJed Brown       }
2176552f7358SJed Brown       meetSize = newMeetSize;
2177552f7358SJed Brown       i        = 1-i;
2178552f7358SJed Brown     }
2179552f7358SJed Brown     if (meetSize) break;
2180552f7358SJed Brown   }
2181552f7358SJed Brown   *numCoveredPoints = meetSize;
2182552f7358SJed Brown   *coveredPoints    = meet[i];
2183552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
21840298fd71SBarry Smith     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr);
2185552f7358SJed Brown   }
2186552f7358SJed Brown   ierr = PetscFree(closures);CHKERRQ(ierr);
2187552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr);
2188552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr);
2189552f7358SJed Brown   PetscFunctionReturn(0);
2190552f7358SJed Brown }
2191552f7358SJed Brown 
2192552f7358SJed Brown #undef __FUNCT__
21934e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual"
21944e3744c5SMatthew G. Knepley /*@C
21954e3744c5SMatthew G. Knepley   DMPlexEqual - Determine if two DMs have the same topology
21964e3744c5SMatthew G. Knepley 
21974e3744c5SMatthew G. Knepley   Not Collective
21984e3744c5SMatthew G. Knepley 
21994e3744c5SMatthew G. Knepley   Input Parameters:
22004e3744c5SMatthew G. Knepley + dmA - A DMPlex object
22014e3744c5SMatthew G. Knepley - dmB - A DMPlex object
22024e3744c5SMatthew G. Knepley 
22034e3744c5SMatthew G. Knepley   Output Parameters:
22044e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical
22054e3744c5SMatthew G. Knepley 
22064e3744c5SMatthew G. Knepley   Level: intermediate
22074e3744c5SMatthew G. Knepley 
22084e3744c5SMatthew G. Knepley   Notes:
22094e3744c5SMatthew G. Knepley   We are not solving graph isomorphism, so we do not permutation.
22104e3744c5SMatthew G. Knepley 
22114e3744c5SMatthew G. Knepley .keywords: mesh
22124e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone()
22134e3744c5SMatthew G. Knepley @*/
22144e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal)
22154e3744c5SMatthew G. Knepley {
22164e3744c5SMatthew G. Knepley   PetscInt       depth, depthB, pStart, pEnd, pStartB, pEndB, p;
22174e3744c5SMatthew G. Knepley   PetscErrorCode ierr;
22184e3744c5SMatthew G. Knepley 
22194e3744c5SMatthew G. Knepley   PetscFunctionBegin;
22204e3744c5SMatthew G. Knepley   PetscValidHeaderSpecific(dmA, DM_CLASSID, 1);
22214e3744c5SMatthew G. Knepley   PetscValidHeaderSpecific(dmB, DM_CLASSID, 2);
22224e3744c5SMatthew G. Knepley   PetscValidPointer(equal, 3);
22234e3744c5SMatthew G. Knepley 
22244e3744c5SMatthew G. Knepley   *equal = PETSC_FALSE;
22254e3744c5SMatthew G. Knepley   ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr);
22264e3744c5SMatthew G. Knepley   ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr);
22274e3744c5SMatthew G. Knepley   if (depth != depthB) PetscFunctionReturn(0);
22284e3744c5SMatthew G. Knepley   ierr = DMPlexGetChart(dmA, &pStart,  &pEnd);CHKERRQ(ierr);
22294e3744c5SMatthew G. Knepley   ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr);
22304e3744c5SMatthew G. Knepley   if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0);
22314e3744c5SMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {
22324e3744c5SMatthew G. Knepley     const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB;
22334e3744c5SMatthew G. Knepley     PetscInt        coneSize, coneSizeB, c, supportSize, supportSizeB, s;
22344e3744c5SMatthew G. Knepley 
22354e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr);
22364e3744c5SMatthew G. Knepley     ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr);
22374e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr);
22384e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr);
22394e3744c5SMatthew G. Knepley     ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr);
22404e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr);
22414e3744c5SMatthew G. Knepley     if (coneSize != coneSizeB) PetscFunctionReturn(0);
22424e3744c5SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
22434e3744c5SMatthew G. Knepley       if (cone[c] != coneB[c]) PetscFunctionReturn(0);
22444e3744c5SMatthew G. Knepley       if (ornt[c] != orntB[c]) PetscFunctionReturn(0);
22454e3744c5SMatthew G. Knepley     }
22464e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr);
22474e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr);
22484e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr);
22494e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr);
22504e3744c5SMatthew G. Knepley     if (supportSize != supportSizeB) PetscFunctionReturn(0);
22514e3744c5SMatthew G. Knepley     for (s = 0; s < supportSize; ++s) {
22524e3744c5SMatthew G. Knepley       if (support[s] != supportB[s]) PetscFunctionReturn(0);
22534e3744c5SMatthew G. Knepley     }
22544e3744c5SMatthew G. Knepley   }
22554e3744c5SMatthew G. Knepley   *equal = PETSC_TRUE;
22564e3744c5SMatthew G. Knepley   PetscFunctionReturn(0);
22574e3744c5SMatthew G. Knepley }
22584e3744c5SMatthew G. Knepley 
22594e3744c5SMatthew G. Knepley #undef __FUNCT__
226018ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices"
226118ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices)
2262a6dfd86eSKarl Rupp {
226382f516ccSBarry Smith   MPI_Comm       comm;
2264552f7358SJed Brown   PetscErrorCode ierr;
2265552f7358SJed Brown 
2266552f7358SJed Brown   PetscFunctionBegin;
226782f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2268552f7358SJed Brown   PetscValidPointer(numFaceVertices,3);
2269552f7358SJed Brown   switch (cellDim) {
2270552f7358SJed Brown   case 0:
2271552f7358SJed Brown     *numFaceVertices = 0;
2272552f7358SJed Brown     break;
2273552f7358SJed Brown   case 1:
2274552f7358SJed Brown     *numFaceVertices = 1;
2275552f7358SJed Brown     break;
2276552f7358SJed Brown   case 2:
2277552f7358SJed Brown     switch (numCorners) {
227819436ca2SJed Brown     case 3: /* triangle */
227919436ca2SJed Brown       *numFaceVertices = 2; /* Edge has 2 vertices */
2280552f7358SJed Brown       break;
228119436ca2SJed Brown     case 4: /* quadrilateral */
228219436ca2SJed Brown       *numFaceVertices = 2; /* Edge has 2 vertices */
2283552f7358SJed Brown       break;
228419436ca2SJed Brown     case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */
228519436ca2SJed Brown       *numFaceVertices = 3; /* Edge has 3 vertices */
2286552f7358SJed Brown       break;
228719436ca2SJed Brown     case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */
228819436ca2SJed Brown       *numFaceVertices = 3; /* Edge has 3 vertices */
2289552f7358SJed Brown       break;
2290552f7358SJed Brown     default:
2291552f7358SJed Brown       SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim);
2292552f7358SJed Brown     }
2293552f7358SJed Brown     break;
2294552f7358SJed Brown   case 3:
2295552f7358SJed Brown     switch (numCorners) {
229619436ca2SJed Brown     case 4: /* tetradehdron */
229719436ca2SJed Brown       *numFaceVertices = 3; /* Face has 3 vertices */
2298552f7358SJed Brown       break;
229919436ca2SJed Brown     case 6: /* tet cohesive cells */
230019436ca2SJed Brown       *numFaceVertices = 4; /* Face has 4 vertices */
2301552f7358SJed Brown       break;
230219436ca2SJed Brown     case 8: /* hexahedron */
230319436ca2SJed Brown       *numFaceVertices = 4; /* Face has 4 vertices */
2304552f7358SJed Brown       break;
230519436ca2SJed Brown     case 9: /* tet cohesive Lagrange cells */
230619436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2307552f7358SJed Brown       break;
230819436ca2SJed Brown     case 10: /* quadratic tetrahedron */
230919436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2310552f7358SJed Brown       break;
231119436ca2SJed Brown     case 12: /* hex cohesive Lagrange cells */
231219436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2313552f7358SJed Brown       break;
231419436ca2SJed Brown     case 18: /* quadratic tet cohesive Lagrange cells */
231519436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2316552f7358SJed Brown       break;
231719436ca2SJed Brown     case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */
231819436ca2SJed Brown       *numFaceVertices = 9; /* Face has 9 vertices */
2319552f7358SJed Brown       break;
2320552f7358SJed Brown     default:
2321552f7358SJed Brown       SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim);
2322552f7358SJed Brown     }
2323552f7358SJed Brown     break;
2324552f7358SJed Brown   default:
2325552f7358SJed Brown     SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim);
2326552f7358SJed Brown   }
2327552f7358SJed Brown   PetscFunctionReturn(0);
2328552f7358SJed Brown }
2329552f7358SJed Brown 
2330552f7358SJed Brown #undef __FUNCT__
2331d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient"
2332d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */
2333d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm)
2334d27a0f52SMatthew G. Knepley {
2335a1b4d4a2SMatthew G. Knepley   PetscBT        seenCells, flippedCells, seenFaces;
2336a1b4d4a2SMatthew G. Knepley   PetscInt      *faceFIFO, fTop, fBottom;
2337a1b4d4a2SMatthew G. Knepley   PetscInt       dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO;
2338d27a0f52SMatthew G. Knepley   PetscErrorCode ierr;
2339d27a0f52SMatthew G. Knepley 
2340d27a0f52SMatthew G. Knepley   PetscFunctionBegin;
2341d27a0f52SMatthew G. Knepley   /* Truth Table
2342d27a0f52SMatthew G. Knepley      mismatch    flips   do action   mismatch   flipA ^ flipB   action
2343d27a0f52SMatthew G. Knepley          F       0 flips     no         F             F           F
2344d27a0f52SMatthew G. Knepley          F       1 flip      yes        F             T           T
2345d27a0f52SMatthew G. Knepley          F       2 flips     no         T             F           T
2346d27a0f52SMatthew G. Knepley          T       0 flips     yes        T             T           F
2347d27a0f52SMatthew G. Knepley          T       1 flip      no
2348d27a0f52SMatthew G. Knepley          T       2 flips     yes
2349d27a0f52SMatthew G. Knepley   */
2350c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2351d27a0f52SMatthew G. Knepley   ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr);
2352a1b4d4a2SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, h,   &cStart, &cEnd);CHKERRQ(ierr);
2353d27a0f52SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr);
2354a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr);
2355a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr);
2356a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr);
2357a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr);
2358a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr);
2359a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr);
2360785e854fSJed Brown   ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr);
2361a1b4d4a2SMatthew G. Knepley   fTop = fBottom = 0;
2362a1b4d4a2SMatthew G. Knepley   /* Initialize FIFO with first cell */
2363defeeaeaSMatthew G. Knepley   if (cEnd > cStart) {
2364a1b4d4a2SMatthew G. Knepley     const PetscInt *cone;
2365a1b4d4a2SMatthew G. Knepley     PetscInt        coneSize;
2366a1b4d4a2SMatthew G. Knepley 
2367a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr);
2368a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr);
2369a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
2370a1b4d4a2SMatthew G. Knepley       faceFIFO[fBottom++] = cone[c];
2371a1b4d4a2SMatthew G. Knepley       ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr);
2372a1b4d4a2SMatthew G. Knepley     }
2373a1b4d4a2SMatthew G. Knepley   }
2374a1b4d4a2SMatthew G. Knepley   /* Consider each face in FIFO */
2375a1b4d4a2SMatthew G. Knepley   while (fTop < fBottom) {
2376d27a0f52SMatthew G. Knepley     const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB;
2377a1b4d4a2SMatthew G. Knepley     PetscInt        supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1;
2378d27a0f52SMatthew G. Knepley     PetscInt        seenA, flippedA, seenB, flippedB, mismatch;
2379d27a0f52SMatthew G. Knepley 
2380a1b4d4a2SMatthew G. Knepley     face = faceFIFO[fTop++];
2381a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2382a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
2383d27a0f52SMatthew G. Knepley     if (supportSize < 2) continue;
2384d27a0f52SMatthew G. Knepley     if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize);
2385a1b4d4a2SMatthew G. Knepley     seenA    = PetscBTLookup(seenCells,    support[0]-cStart);
238686cff514SMatthew G. Knepley     flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0;
2387a1b4d4a2SMatthew G. Knepley     seenB    = PetscBTLookup(seenCells,    support[1]-cStart);
238886cff514SMatthew G. Knepley     flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0;
2389d27a0f52SMatthew G. Knepley 
2390d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr);
2391d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr);
2392d27a0f52SMatthew G. Knepley     ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr);
2393d27a0f52SMatthew G. Knepley     ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr);
2394d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr);
2395d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr);
2396a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSizeA; ++c) {
2397a1b4d4a2SMatthew G. Knepley       if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) {
2398a1b4d4a2SMatthew G. Knepley         faceFIFO[fBottom++] = coneA[c];
2399a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr);
2400a1b4d4a2SMatthew G. Knepley       }
2401a1b4d4a2SMatthew G. Knepley       if (coneA[c] == face) posA = c;
2402a1b4d4a2SMatthew 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);
2403a1b4d4a2SMatthew G. Knepley     }
2404a1b4d4a2SMatthew 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]);
2405a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSizeB; ++c) {
2406a1b4d4a2SMatthew G. Knepley       if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) {
2407a1b4d4a2SMatthew G. Knepley         faceFIFO[fBottom++] = coneB[c];
2408a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr);
2409a1b4d4a2SMatthew G. Knepley       }
2410a1b4d4a2SMatthew G. Knepley       if (coneB[c] == face) posB = c;
2411a1b4d4a2SMatthew 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);
2412a1b4d4a2SMatthew G. Knepley     }
2413a1b4d4a2SMatthew 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]);
2414d27a0f52SMatthew G. Knepley 
2415d27a0f52SMatthew G. Knepley     if (dim == 1) {
2416d27a0f52SMatthew G. Knepley       mismatch = posA == posB;
2417d27a0f52SMatthew G. Knepley     } else {
2418d27a0f52SMatthew G. Knepley       mismatch = coneOA[posA] == coneOB[posB];
2419d27a0f52SMatthew G. Knepley     }
2420d27a0f52SMatthew G. Knepley 
2421d27a0f52SMatthew G. Knepley     if (mismatch ^ (flippedA ^ flippedB)) {
2422d27a0f52SMatthew 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]);
2423d27a0f52SMatthew G. Knepley       if (!seenA && !flippedA) {
2424a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr);
2425d27a0f52SMatthew G. Knepley       } else if (!seenB && !flippedB) {
2426a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr);
2427d27a0f52SMatthew G. Knepley       } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable");
242886cff514SMatthew 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");
2429a1b4d4a2SMatthew G. Knepley     ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr);
2430a1b4d4a2SMatthew G. Knepley     ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr);
2431d27a0f52SMatthew G. Knepley   }
2432fedde076SMatthew G. Knepley   /* Now all subdomains are oriented, but we need a consistent parallel orientation */
2433fedde076SMatthew G. Knepley   {
2434fedde076SMatthew G. Knepley     /* Find a representative face (edge) separating pairs of procs */
2435fedde076SMatthew G. Knepley     PetscSF            sf;
2436fedde076SMatthew G. Knepley     const PetscInt    *lpoints;
2437fedde076SMatthew G. Knepley     const PetscSFNode *rpoints;
243813048561SMatthew G. Knepley     PetscInt          *neighbors, *nranks;
2439fedde076SMatthew G. Knepley     PetscInt           numLeaves, numRoots, numNeighbors = 0, l, n;
2440a1b4d4a2SMatthew G. Knepley 
2441fedde076SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr);
2442fedde076SMatthew G. Knepley     ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr);
2443fedde076SMatthew G. Knepley     if (numLeaves >= 0) {
244462ad4a6aSMatthew G. Knepley       const PetscInt *cone, *ornt, *support;
244562ad4a6aSMatthew G. Knepley       PetscInt        coneSize, supportSize;
244662ad4a6aSMatthew G. Knepley       int            *rornt, *lornt; /* PetscSF cannot handle smaller than int */
244713048561SMatthew G. Knepley       PetscBool      *match, flipped = PETSC_FALSE;
244862ad4a6aSMatthew G. Knepley 
2449fedde076SMatthew G. Knepley       ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr);
2450fedde076SMatthew G. Knepley       /* I know this is p^2 time in general, but for bounded degree its alright */
2451fedde076SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
2452fedde076SMatthew G. Knepley         const PetscInt face = lpoints[l];
2453fedde076SMatthew G. Knepley         if ((face >= fStart) && (face < fEnd)) {
2454fedde076SMatthew G. Knepley           const PetscInt rank = rpoints[l].rank;
2455fedde076SMatthew G. Knepley           for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break;
2456fedde076SMatthew G. Knepley           if (n >= numNeighbors) {
2457fedde076SMatthew G. Knepley             PetscInt supportSize;
2458fedde076SMatthew G. Knepley             ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2459fedde076SMatthew G. Knepley             if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize);
2460fedde076SMatthew G. Knepley             neighbors[numNeighbors++] = l;
2461fedde076SMatthew G. Knepley           }
2462fedde076SMatthew G. Knepley         }
2463fedde076SMatthew G. Knepley       }
246413048561SMatthew G. Knepley       ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr);
2465fedde076SMatthew G. Knepley       for (face = fStart; face < fEnd; ++face) {
2466fedde076SMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2467fedde076SMatthew G. Knepley         if (supportSize != 1) continue;
2468fedde076SMatthew G. Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
2469fedde076SMatthew G. Knepley 
2470fedde076SMatthew G. Knepley         ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr);
247162ad4a6aSMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr);
2472fedde076SMatthew G. Knepley         ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr);
2473fedde076SMatthew G. Knepley         for (c = 0; c < coneSize; ++c) if (cone[c] == face) break;
24745b7033fcSMatthew G. Knepley         if (dim == 1) {
24755b7033fcSMatthew G. Knepley           /* Use cone position instead, shifted to -1 or 1 */
24765b7033fcSMatthew G. Knepley           rornt[face] = c*2-1;
24775b7033fcSMatthew G. Knepley         } else {
2478fedde076SMatthew G. Knepley           if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 :  1;
2479fedde076SMatthew G. Knepley           else                                                rornt[face] = ornt[c] < 0 ?  1 : -1;
2480fedde076SMatthew G. Knepley         }
24815b7033fcSMatthew G. Knepley       }
2482fedde076SMatthew G. Knepley       /* Mark each edge with match or nomatch */
2483fedde076SMatthew G. Knepley       ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr);
2484fedde076SMatthew G. Knepley       ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr);
2485fedde076SMatthew G. Knepley       for (n = 0; n < numNeighbors; ++n) {
2486fedde076SMatthew G. Knepley         const PetscInt face = lpoints[neighbors[n]];
2487fedde076SMatthew G. Knepley 
248813048561SMatthew G. Knepley         if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE;
248913048561SMatthew G. Knepley         else                             match[n] = PETSC_FALSE;
249013048561SMatthew G. Knepley         nranks[n] = rpoints[neighbors[n]].rank;
2491fedde076SMatthew G. Knepley       }
249213048561SMatthew G. Knepley       /* Collect the graph on 0 */
249313048561SMatthew G. Knepley       {
249413048561SMatthew G. Knepley         MPI_Comm     comm = PetscObjectComm((PetscObject) sf);
2495e8f90184SMatthew G. Knepley         Mat          G;
249613048561SMatthew G. Knepley         PetscBT      seenProcs, flippedProcs;
249713048561SMatthew G. Knepley         PetscInt    *procFIFO, pTop, pBottom;
249813048561SMatthew G. Knepley         PetscInt    *adj = NULL;
249913048561SMatthew G. Knepley         PetscBool   *val = NULL;
250013048561SMatthew G. Knepley         PetscMPIInt *recvcounts = NULL, *displs = NULL, p;
250113048561SMatthew G. Knepley         PetscMPIInt  N = numNeighbors, numProcs = 0, rank;
250213048561SMatthew G. Knepley         PetscInt     debug = 0;
250313048561SMatthew G. Knepley 
250413048561SMatthew G. Knepley         ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
250513048561SMatthew G. Knepley         if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);}
250613048561SMatthew G. Knepley         ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr);
250713048561SMatthew G. Knepley         ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr);
250813048561SMatthew G. Knepley         for (p = 0; p < numProcs; ++p) {
250913048561SMatthew G. Knepley           displs[p+1] = displs[p] + recvcounts[p];
251013048561SMatthew G. Knepley         }
251113048561SMatthew G. Knepley         if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);}
251213048561SMatthew G. Knepley         ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr);
251313048561SMatthew G. Knepley         ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr);
251413048561SMatthew G. Knepley         if (debug) {
251513048561SMatthew G. Knepley           for (p = 0; p < numProcs; ++p) {
251613048561SMatthew G. Knepley             ierr = PetscPrintf(comm, "Proc %d:\n", p);
251713048561SMatthew G. Knepley             for (n = 0; n < recvcounts[p]; ++n) {
251813048561SMatthew G. Knepley               ierr = PetscPrintf(comm, "  edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]);
251913048561SMatthew G. Knepley             }
252013048561SMatthew G. Knepley           }
252113048561SMatthew G. Knepley         }
2522e8f90184SMatthew G. Knepley         /* Symmetrize the graph */
2523e8f90184SMatthew G. Knepley         ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr);
2524e8f90184SMatthew G. Knepley         ierr = MatSetSizes(G, numProcs, numProcs, numProcs, numProcs);CHKERRQ(ierr);
2525e8f90184SMatthew G. Knepley         ierr = MatSetUp(G);CHKERRQ(ierr);
2526e8f90184SMatthew G. Knepley         for (p = 0; p < numProcs; ++p) {
2527e8f90184SMatthew G. Knepley           for (n = 0; n < recvcounts[p]; ++n) {
25289a4fe19dSMatthew G. Knepley             const PetscInt    r = p;
2529e8f90184SMatthew G. Knepley             const PetscInt    q = adj[displs[p]+n];
25307406edfbSMatthew G. Knepley             const PetscScalar o = val[displs[p]+n] ? 1.0 : 0.0;
2531e8f90184SMatthew G. Knepley 
25327406edfbSMatthew G. Knepley             ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr);
25337406edfbSMatthew G. Knepley             ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr);
2534e8f90184SMatthew G. Knepley           }
2535e8f90184SMatthew G. Knepley         }
2536e8f90184SMatthew G. Knepley         ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
2537e8f90184SMatthew G. Knepley         ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr);
2538e8f90184SMatthew G. Knepley 
253913048561SMatthew G. Knepley         ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr);
254013048561SMatthew G. Knepley         ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr);
254113048561SMatthew G. Knepley         ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr);
254213048561SMatthew G. Knepley         ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr);
254313048561SMatthew G. Knepley         ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr);
254413048561SMatthew G. Knepley         pTop = pBottom = 0;
254513048561SMatthew G. Knepley         for (p = 0; p < numProcs; ++p) {
254613048561SMatthew G. Knepley           if (PetscBTLookup(seenProcs, p)) continue;
254713048561SMatthew G. Knepley           /* Initialize FIFO with next proc */
254813048561SMatthew G. Knepley           procFIFO[pBottom++] = p;
254913048561SMatthew G. Knepley           ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr);
255013048561SMatthew G. Knepley           /* Consider each proc in FIFO */
255113048561SMatthew G. Knepley           while (pTop < pBottom) {
2552e8f90184SMatthew G. Knepley             const PetscScalar *ornt;
2553e8f90184SMatthew G. Knepley             const PetscInt    *neighbors;
2554e8f90184SMatthew G. Knepley             PetscInt           proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors;
255513048561SMatthew G. Knepley 
255613048561SMatthew G. Knepley             proc     = procFIFO[pTop++];
255713048561SMatthew G. Knepley             flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0;
2558e8f90184SMatthew G. Knepley             ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr);
255913048561SMatthew G. Knepley             /* Loop over neighboring procs */
2560e8f90184SMatthew G. Knepley             for (n = 0; n < numNeighbors; ++n) {
2561e8f90184SMatthew G. Knepley               nproc    = neighbors[n];
25627406edfbSMatthew G. Knepley               mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1;
256313048561SMatthew G. Knepley               seen     = PetscBTLookup(seenProcs, nproc);
256413048561SMatthew G. Knepley               flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0;
256513048561SMatthew G. Knepley 
256613048561SMatthew G. Knepley               if (mismatch ^ (flippedA ^ flippedB)) {
256713048561SMatthew 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);
256813048561SMatthew G. Knepley                 if (!flippedB) {
256913048561SMatthew G. Knepley                   ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr);
257013048561SMatthew G. Knepley               } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable");
257113048561SMatthew 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");
257213048561SMatthew G. Knepley               if (!seen) {
257313048561SMatthew G. Knepley                 procFIFO[pBottom++] = nproc;
257413048561SMatthew G. Knepley                 ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr);
257513048561SMatthew G. Knepley               }
257613048561SMatthew G. Knepley             }
257713048561SMatthew G. Knepley           }
257813048561SMatthew G. Knepley         }
257913048561SMatthew G. Knepley         ierr = PetscFree(procFIFO);CHKERRQ(ierr);
2580e8f90184SMatthew G. Knepley         ierr = MatDestroy(&G);CHKERRQ(ierr);
258113048561SMatthew G. Knepley 
258213048561SMatthew G. Knepley         ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr);
258313048561SMatthew G. Knepley         ierr = PetscFree2(adj,val);CHKERRQ(ierr);
258413048561SMatthew G. Knepley         {
258513048561SMatthew G. Knepley           PetscBool *flips;
258613048561SMatthew G. Knepley 
258713048561SMatthew G. Knepley           ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr);
258813048561SMatthew G. Knepley           for (p = 0; p < numProcs; ++p) {
258913048561SMatthew G. Knepley             flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE;
259013048561SMatthew G. Knepley             if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);}
259113048561SMatthew G. Knepley           }
259213048561SMatthew G. Knepley           ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr);
259313048561SMatthew G. Knepley           ierr = PetscFree(flips);CHKERRQ(ierr);
259413048561SMatthew G. Knepley         }
259513048561SMatthew G. Knepley         ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr);
259613048561SMatthew G. Knepley         ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr);
259713048561SMatthew G. Knepley       }
259813048561SMatthew G. Knepley       ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr);
2599fedde076SMatthew G. Knepley       ierr = PetscFree(neighbors);CHKERRQ(ierr);
260013048561SMatthew G. Knepley       if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}}
2601fedde076SMatthew G. Knepley     }
2602fedde076SMatthew G. Knepley   }
2603fedde076SMatthew G. Knepley   /* Reverse flipped cells in the mesh */
2604d27a0f52SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2605d27a0f52SMatthew G. Knepley   ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr);
2606d27a0f52SMatthew G. Knepley   ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr);
2607a1b4d4a2SMatthew G. Knepley   for (c = cStart; c < cEnd; ++c) {
2608f4e909fcSMatthew G. Knepley     const PetscInt *cone, *coneO, *support;
2609f4e909fcSMatthew G. Knepley     PetscInt        coneSize, supportSize, faceSize, cp, sp;
2610d27a0f52SMatthew G. Knepley 
2611a1b4d4a2SMatthew G. Knepley     if (!PetscBTLookup(flippedCells, c-cStart)) continue;
2612a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
2613a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2614a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr);
2615a1b4d4a2SMatthew G. Knepley     for (cp = 0; cp < coneSize; ++cp) {
2616a1b4d4a2SMatthew G. Knepley       const PetscInt rcp = coneSize-cp-1;
2617a1b4d4a2SMatthew G. Knepley 
2618a1b4d4a2SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr);
2619a1b4d4a2SMatthew G. Knepley       revcone[cp]  = cone[rcp];
2620a1b4d4a2SMatthew G. Knepley       revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp];
2621d27a0f52SMatthew G. Knepley     }
2622a1b4d4a2SMatthew G. Knepley     ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr);
2623a1b4d4a2SMatthew G. Knepley     ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr);
2624f4e909fcSMatthew G. Knepley     /* Reverse orientations of support */
2625f4e909fcSMatthew G. Knepley     faceSize = coneSize;
2626f4e909fcSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr);
2627f4e909fcSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr);
2628f4e909fcSMatthew G. Knepley     for (sp = 0; sp < supportSize; ++sp) {
2629f4e909fcSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr);
2630f4e909fcSMatthew G. Knepley       ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr);
2631f4e909fcSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr);
2632f4e909fcSMatthew G. Knepley       for (cp = 0; cp < coneSize; ++cp) {
2633f4e909fcSMatthew G. Knepley         if (cone[cp] != c) continue;
2634f4e909fcSMatthew G. Knepley         ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr);
2635f4e909fcSMatthew G. Knepley       }
2636f4e909fcSMatthew G. Knepley     }
2637d27a0f52SMatthew G. Knepley   }
2638d27a0f52SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr);
2639d27a0f52SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr);
2640d27a0f52SMatthew G. Knepley   ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr);
2641a1b4d4a2SMatthew G. Knepley   ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr);
2642a1b4d4a2SMatthew G. Knepley   ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr);
2643a1b4d4a2SMatthew G. Knepley   ierr = PetscFree(faceFIFO);CHKERRQ(ierr);
2644d27a0f52SMatthew G. Knepley   PetscFunctionReturn(0);
2645d27a0f52SMatthew G. Knepley }
2646d27a0f52SMatthew G. Knepley 
2647d27a0f52SMatthew G. Knepley #undef __FUNCT__
2648d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal"
2649d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[])
2650d49fcaecSMatthew G. Knepley {
2651d49fcaecSMatthew G. Knepley   PetscInt d;
2652d49fcaecSMatthew G. Knepley 
2653d49fcaecSMatthew G. Knepley   PetscFunctionBegin;
2654d49fcaecSMatthew G. Knepley   if (!dm->maxCell) {
2655d49fcaecSMatthew G. Knepley     for (d = 0; d < dim; ++d) out[d] = in[d];
2656d49fcaecSMatthew G. Knepley   } else {
2657d49fcaecSMatthew G. Knepley     for (d = 0; d < dim; ++d) {
2658d49fcaecSMatthew G. Knepley       if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) {
2659858aadebSMatthew G. Knepley         out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d];
2660d49fcaecSMatthew G. Knepley       } else {
2661d49fcaecSMatthew G. Knepley         out[d] = in[d];
2662d49fcaecSMatthew G. Knepley       }
2663d49fcaecSMatthew G. Knepley     }
2664d49fcaecSMatthew G. Knepley   }
2665d49fcaecSMatthew G. Knepley   PetscFunctionReturn(0);
2666d49fcaecSMatthew G. Knepley }
2667d49fcaecSMatthew G. Knepley 
2668d49fcaecSMatthew G. Knepley #undef __FUNCT__
2669d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal"
2670d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[])
2671d49fcaecSMatthew G. Knepley {
2672d49fcaecSMatthew G. Knepley   PetscInt d;
2673d49fcaecSMatthew G. Knepley 
2674d49fcaecSMatthew G. Knepley   PetscFunctionBegin;
2675d49fcaecSMatthew G. Knepley   if (!dm->maxCell) {
2676d49fcaecSMatthew G. Knepley     for (d = 0; d < dim; ++d) out[d] += in[d];
2677d49fcaecSMatthew G. Knepley   } else {
2678d49fcaecSMatthew G. Knepley     for (d = 0; d < dim; ++d) {
2679d49fcaecSMatthew G. Knepley       if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) {
2680858aadebSMatthew G. Knepley         out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d];
2681d49fcaecSMatthew G. Knepley       } else {
2682d49fcaecSMatthew G. Knepley         out[d] += in[d];
2683d49fcaecSMatthew G. Knepley       }
2684d49fcaecSMatthew G. Knepley     }
2685d49fcaecSMatthew G. Knepley   }
2686d49fcaecSMatthew G. Knepley   PetscFunctionReturn(0);
2687d49fcaecSMatthew G. Knepley }
2688d49fcaecSMatthew G. Knepley 
2689d49fcaecSMatthew G. Knepley #undef __FUNCT__
2690d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates"
2691d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm)
2692d49fcaecSMatthew G. Knepley {
2693d49fcaecSMatthew G. Knepley   PetscSection   coordSection, cSection;
2694d49fcaecSMatthew G. Knepley   Vec            coordinates,  cVec;
2695d49fcaecSMatthew G. Knepley   PetscScalar   *coords, *coords2, *anchor;
26968c7f9fc6SMatthew G. Knepley   PetscInt       Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize;
2697d49fcaecSMatthew G. Knepley   PetscErrorCode ierr;
2698d49fcaecSMatthew G. Knepley 
2699d49fcaecSMatthew G. Knepley   PetscFunctionBegin;
2700d49fcaecSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2701d49fcaecSMatthew G. Knepley   if (!dm->maxCell) PetscFunctionReturn(0);
2702d49fcaecSMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
2703d49fcaecSMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
2704d49fcaecSMatthew G. Knepley   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
2705d49fcaecSMatthew G. Knepley   ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2706d49fcaecSMatthew G. Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr);
27078c7f9fc6SMatthew G. Knepley   ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr);
27088c7f9fc6SMatthew G. Knepley   ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr);
27098c7f9fc6SMatthew G. Knepley   ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr);
2710d49fcaecSMatthew G. Knepley   ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr);
2711d49fcaecSMatthew G. Knepley   for (v = vStart; v < vEnd; ++v) {
2712d49fcaecSMatthew G. Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
2713d49fcaecSMatthew G. Knepley     ierr = PetscSectionSetDof(cSection,     v,  dof);CHKERRQ(ierr);
27148c7f9fc6SMatthew G. Knepley     ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr);
2715d49fcaecSMatthew G. Knepley   }
2716d49fcaecSMatthew G. Knepley   for (c = cStart; c < cEnd; ++c) {
2717d49fcaecSMatthew G. Knepley     ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr);
2718d49fcaecSMatthew G. Knepley     ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr);
27198c7f9fc6SMatthew G. Knepley     ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr);
2720d49fcaecSMatthew G. Knepley   }
2721d49fcaecSMatthew G. Knepley   ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr);
2722d49fcaecSMatthew G. Knepley   ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr);
2723d49fcaecSMatthew G. Knepley   ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr);
2724d49fcaecSMatthew G. Knepley   ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr);
2725d49fcaecSMatthew G. Knepley   ierr = VecSetBlockSize(cVec,         bs);CHKERRQ(ierr);
2726d49fcaecSMatthew G. Knepley   ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
2727d49fcaecSMatthew G. Knepley   ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr);
2728d49fcaecSMatthew G. Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
2729d49fcaecSMatthew G. Knepley   ierr = VecGetArray(cVec,        &coords2);CHKERRQ(ierr);
2730d49fcaecSMatthew G. Knepley   for (v = vStart; v < vEnd; ++v) {
2731d49fcaecSMatthew G. Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
2732d49fcaecSMatthew G. Knepley     ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
2733d49fcaecSMatthew G. Knepley     ierr = PetscSectionGetOffset(cSection,     v, &off2);CHKERRQ(ierr);
2734d49fcaecSMatthew G. Knepley     for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d];
2735d49fcaecSMatthew G. Knepley   }
2736d49fcaecSMatthew G. Knepley   ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr);
2737d49fcaecSMatthew G. Knepley   for (c = cStart; c < cEnd; ++c) {
2738d49fcaecSMatthew G. Knepley     PetscScalar *cellCoords = NULL;
2739d49fcaecSMatthew G. Knepley     PetscInt     b;
2740d49fcaecSMatthew G. Knepley 
2741d49fcaecSMatthew G. Knepley     ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr);
2742d49fcaecSMatthew G. Knepley     ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr);
2743d49fcaecSMatthew G. Knepley     for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b];
2744d49fcaecSMatthew G. Knepley     for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);}
2745d49fcaecSMatthew G. Knepley     ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr);
2746d49fcaecSMatthew G. Knepley   }
2747d49fcaecSMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr);
2748d49fcaecSMatthew G. Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
2749d49fcaecSMatthew G. Knepley   ierr = VecRestoreArray(cVec,        &coords2);CHKERRQ(ierr);
275046e270d4SMatthew G. Knepley   ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr);
2751d49fcaecSMatthew G. Knepley   ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr);
2752d49fcaecSMatthew G. Knepley   ierr = VecDestroy(&cVec);CHKERRQ(ierr);
2753d49fcaecSMatthew G. Knepley   ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr);
2754d49fcaecSMatthew G. Knepley   PetscFunctionReturn(0);
2755d49fcaecSMatthew G. Knepley }
2756d49fcaecSMatthew G. Knepley 
2757d49fcaecSMatthew G. Knepley #undef __FUNCT__
2758aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel"
2759552f7358SJed Brown /*@
2760aa50250dSMatthew G. Knepley   DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point
2761552f7358SJed Brown 
2762552f7358SJed Brown   Not Collective
2763552f7358SJed Brown 
2764aa50250dSMatthew G. Knepley   Input Parameter:
2765552f7358SJed Brown . dm    - The DMPlex object
2766552f7358SJed Brown 
2767aa50250dSMatthew G. Knepley   Output Parameter:
2768aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth
2769552f7358SJed Brown 
2770552f7358SJed Brown   Level: developer
2771552f7358SJed Brown 
2772aa50250dSMatthew G. Knepley .keywords: mesh, points
2773aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum()
2774aa50250dSMatthew G. Knepley @*/
2775aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel)
2776aa50250dSMatthew G. Knepley {
2777aa50250dSMatthew G. Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
2778aa50250dSMatthew G. Knepley   PetscErrorCode ierr;
2779aa50250dSMatthew G. Knepley 
2780aa50250dSMatthew G. Knepley   PetscFunctionBegin;
2781aa50250dSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2782aa50250dSMatthew G. Knepley   PetscValidPointer(depthLabel, 2);
278363d1a920SMatthew G. Knepley   if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);}
2784aa50250dSMatthew G. Knepley   *depthLabel = mesh->depthLabel;
2785aa50250dSMatthew G. Knepley   PetscFunctionReturn(0);
2786aa50250dSMatthew G. Knepley }
2787aa50250dSMatthew G. Knepley 
2788aa50250dSMatthew G. Knepley #undef __FUNCT__
2789aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth"
2790aa50250dSMatthew G. Knepley /*@
2791aa50250dSMatthew G. Knepley   DMPlexGetDepth - Get the depth of the DAG representing this mesh
2792aa50250dSMatthew G. Knepley 
2793aa50250dSMatthew G. Knepley   Not Collective
2794aa50250dSMatthew G. Knepley 
2795aa50250dSMatthew G. Knepley   Input Parameter:
2796aa50250dSMatthew G. Knepley . dm    - The DMPlex object
2797aa50250dSMatthew G. Knepley 
2798aa50250dSMatthew G. Knepley   Output Parameter:
2799aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG
2800aa50250dSMatthew G. Knepley 
2801aa50250dSMatthew G. Knepley   Level: developer
2802552f7358SJed Brown 
2803552f7358SJed Brown .keywords: mesh, points
2804aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum()
2805552f7358SJed Brown @*/
2806552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth)
2807552f7358SJed Brown {
2808aa50250dSMatthew G. Knepley   DMLabel        label;
2809aa50250dSMatthew G. Knepley   PetscInt       d = 0;
2810552f7358SJed Brown   PetscErrorCode ierr;
2811552f7358SJed Brown 
2812552f7358SJed Brown   PetscFunctionBegin;
2813552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2814552f7358SJed Brown   PetscValidPointer(depth, 2);
2815aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
2816aa50250dSMatthew G. Knepley   if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);}
2817552f7358SJed Brown   *depth = d-1;
2818552f7358SJed Brown   PetscFunctionReturn(0);
2819552f7358SJed Brown }
2820552f7358SJed Brown 
2821552f7358SJed Brown #undef __FUNCT__
2822552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum"
2823552f7358SJed Brown /*@
2824552f7358SJed Brown   DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth.
2825552f7358SJed Brown 
2826552f7358SJed Brown   Not Collective
2827552f7358SJed Brown 
2828552f7358SJed Brown   Input Parameters:
2829552f7358SJed Brown + dm           - The DMPlex object
2830552f7358SJed Brown - stratumValue - The requested depth
2831552f7358SJed Brown 
2832552f7358SJed Brown   Output Parameters:
2833552f7358SJed Brown + start - The first point at this depth
2834552f7358SJed Brown - end   - One beyond the last point at this depth
2835552f7358SJed Brown 
2836552f7358SJed Brown   Level: developer
2837552f7358SJed Brown 
2838552f7358SJed Brown .keywords: mesh, points
2839552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth()
2840552f7358SJed Brown @*/
28410adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end)
28420adebc6cSBarry Smith {
2843aa50250dSMatthew G. Knepley   DMLabel        label;
284463d1a920SMatthew G. Knepley   PetscInt       pStart, pEnd;
2845552f7358SJed Brown   PetscErrorCode ierr;
2846552f7358SJed Brown 
2847552f7358SJed Brown   PetscFunctionBegin;
2848552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
284963d1a920SMatthew G. Knepley   if (start) {PetscValidPointer(start, 3); *start = 0;}
285063d1a920SMatthew G. Knepley   if (end)   {PetscValidPointer(end,   4); *end   = 0;}
2851552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
28520d644c17SKarl Rupp   if (pStart == pEnd) PetscFunctionReturn(0);
285363d1a920SMatthew G. Knepley   if (stratumValue < 0) {
285463d1a920SMatthew G. Knepley     if (start) *start = pStart;
285563d1a920SMatthew G. Knepley     if (end)   *end   = pEnd;
285663d1a920SMatthew G. Knepley     PetscFunctionReturn(0);
2857552f7358SJed Brown   }
2858aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
285963d1a920SMatthew G. Knepley   if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");
286063d1a920SMatthew G. Knepley   ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr);
2861552f7358SJed Brown   PetscFunctionReturn(0);
2862552f7358SJed Brown }
2863552f7358SJed Brown 
2864552f7358SJed Brown #undef __FUNCT__
2865552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum"
2866552f7358SJed Brown /*@
2867552f7358SJed Brown   DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height.
2868552f7358SJed Brown 
2869552f7358SJed Brown   Not Collective
2870552f7358SJed Brown 
2871552f7358SJed Brown   Input Parameters:
2872552f7358SJed Brown + dm           - The DMPlex object
2873552f7358SJed Brown - stratumValue - The requested height
2874552f7358SJed Brown 
2875552f7358SJed Brown   Output Parameters:
2876552f7358SJed Brown + start - The first point at this height
2877552f7358SJed Brown - end   - One beyond the last point at this height
2878552f7358SJed Brown 
2879552f7358SJed Brown   Level: developer
2880552f7358SJed Brown 
2881552f7358SJed Brown .keywords: mesh, points
2882552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth()
2883552f7358SJed Brown @*/
28840adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end)
28850adebc6cSBarry Smith {
2886aa50250dSMatthew G. Knepley   DMLabel        label;
288763d1a920SMatthew G. Knepley   PetscInt       depth, pStart, pEnd;
2888552f7358SJed Brown   PetscErrorCode ierr;
2889552f7358SJed Brown 
2890552f7358SJed Brown   PetscFunctionBegin;
2891552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
289263d1a920SMatthew G. Knepley   if (start) {PetscValidPointer(start, 3); *start = 0;}
289363d1a920SMatthew G. Knepley   if (end)   {PetscValidPointer(end,   4); *end   = 0;}
2894552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
28950d644c17SKarl Rupp   if (pStart == pEnd) PetscFunctionReturn(0);
289663d1a920SMatthew G. Knepley   if (stratumValue < 0) {
289763d1a920SMatthew G. Knepley     if (start) *start = pStart;
289863d1a920SMatthew G. Knepley     if (end)   *end   = pEnd;
289963d1a920SMatthew G. Knepley     PetscFunctionReturn(0);
2900552f7358SJed Brown   }
2901aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
2902aa50250dSMatthew G. Knepley   if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr);
290363d1a920SMatthew G. Knepley   ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr);
290463d1a920SMatthew G. Knepley   ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr);
2905552f7358SJed Brown   PetscFunctionReturn(0);
2906552f7358SJed Brown }
2907552f7358SJed Brown 
2908552f7358SJed Brown #undef __FUNCT__
2909552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial"
2910552f7358SJed Brown /* Set the number of dof on each point and separate by fields */
2911a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section)
2912a6dfd86eSKarl Rupp {
2913552f7358SJed Brown   PetscInt      *numDofTot;
2914916f0f19SMatthew G. Knepley   PetscInt       depth, pStart = 0, pEnd = 0;
2915916f0f19SMatthew G. Knepley   PetscInt       p, d, dep, f;
2916552f7358SJed Brown   PetscErrorCode ierr;
2917552f7358SJed Brown 
2918552f7358SJed Brown   PetscFunctionBegin;
2919785e854fSJed Brown   ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr);
2920552f7358SJed Brown   for (d = 0; d <= dim; ++d) {
2921552f7358SJed Brown     numDofTot[d] = 0;
29220d644c17SKarl Rupp     for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d];
2923552f7358SJed Brown   }
292482f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr);
2925552f7358SJed Brown   if (numFields > 0) {
2926552f7358SJed Brown     ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr);
2927552f7358SJed Brown     if (numComp) {
2928552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
2929552f7358SJed Brown         ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr);
2930552f7358SJed Brown       }
2931552f7358SJed Brown     }
2932552f7358SJed Brown   }
2933552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
2934552f7358SJed Brown   ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr);
2935916f0f19SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
2936916f0f19SMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
2937916f0f19SMatthew G. Knepley     d    = dim == depth ? dep : (!dep ? 0 : dim);
2938916f0f19SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr);
2939552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
2940552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
2941552f7358SJed Brown         ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr);
2942552f7358SJed Brown       }
2943552f7358SJed Brown       ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr);
2944552f7358SJed Brown     }
2945552f7358SJed Brown   }
2946552f7358SJed Brown   ierr = PetscFree(numDofTot);CHKERRQ(ierr);
2947552f7358SJed Brown   PetscFunctionReturn(0);
2948552f7358SJed Brown }
2949552f7358SJed Brown 
2950552f7358SJed Brown #undef __FUNCT__
2951552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof"
2952552f7358SJed Brown /* Set the number of dof on each point and separate by fields
2953552f7358SJed Brown    If constDof is PETSC_DETERMINE, constrain every dof on the point
2954552f7358SJed Brown */
2955a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section)
2956a6dfd86eSKarl Rupp {
2957552f7358SJed Brown   PetscInt       numFields;
2958552f7358SJed Brown   PetscInt       bc;
2959a68b90caSToby Isaac   PetscSection   aSec;
2960552f7358SJed Brown   PetscErrorCode ierr;
2961552f7358SJed Brown 
2962552f7358SJed Brown   PetscFunctionBegin;
2963552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
2964552f7358SJed Brown   for (bc = 0; bc < numBC; ++bc) {
2965552f7358SJed Brown     PetscInt        field = 0;
2966552f7358SJed Brown     const PetscInt *idx;
2967552f7358SJed Brown     PetscInt        n, i;
2968552f7358SJed Brown 
29690d644c17SKarl Rupp     if (numFields) field = bcField[bc];
2970552f7358SJed Brown     ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr);
2971552f7358SJed Brown     ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
2972552f7358SJed Brown     for (i = 0; i < n; ++i) {
2973552f7358SJed Brown       const PetscInt p        = idx[i];
2974552f7358SJed Brown       PetscInt       numConst = constDof;
2975552f7358SJed Brown 
2976552f7358SJed Brown       /* Constrain every dof on the point */
2977552f7358SJed Brown       if (numConst < 0) {
2978552f7358SJed Brown         if (numFields) {
2979552f7358SJed Brown           ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr);
2980552f7358SJed Brown         } else {
2981552f7358SJed Brown           ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr);
2982552f7358SJed Brown         }
2983552f7358SJed Brown       }
2984552f7358SJed Brown       if (numFields) {
2985552f7358SJed Brown         ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr);
2986552f7358SJed Brown       }
2987552f7358SJed Brown       ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr);
2988552f7358SJed Brown     }
2989552f7358SJed Brown     ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
2990552f7358SJed Brown   }
2991a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr);
2992a68b90caSToby Isaac   if (aSec) {
2993a68b90caSToby Isaac     PetscInt aStart, aEnd, a;
2994a68b90caSToby Isaac 
2995a68b90caSToby Isaac     ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr);
2996a68b90caSToby Isaac     for (a = aStart; a < aEnd; a++) {
2997a68b90caSToby Isaac       PetscInt dof;
2998a68b90caSToby Isaac 
2999a68b90caSToby Isaac       ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr);
3000a68b90caSToby Isaac       if (dof) {
3001a68b90caSToby Isaac         /* if there are point-to-point constraints, then all dofs are constrained */
3002a68b90caSToby Isaac         ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr);
3003a68b90caSToby Isaac         ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr);
3004a68b90caSToby Isaac         if (numFields) {
3005a68b90caSToby Isaac           PetscInt f;
3006a68b90caSToby Isaac 
3007a68b90caSToby Isaac           for (f = 0; f < numFields; f++) {
3008a68b90caSToby Isaac             ierr = PetscSectionGetFieldDof(section, a, f, &dof);CHKERRQ(ierr);
3009a68b90caSToby Isaac             ierr = PetscSectionSetFieldConstraintDof(section, a, f, dof);CHKERRQ(ierr);
3010a68b90caSToby Isaac           }
3011a68b90caSToby Isaac         }
3012a68b90caSToby Isaac       }
3013a68b90caSToby Isaac     }
3014a68b90caSToby Isaac   }
3015552f7358SJed Brown   PetscFunctionReturn(0);
3016552f7358SJed Brown }
3017552f7358SJed Brown 
3018552f7358SJed Brown #undef __FUNCT__
3019552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll"
3020552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */
30210adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section)
30220adebc6cSBarry Smith {
3023552f7358SJed Brown   PetscInt      *maxConstraints;
3024552f7358SJed Brown   PetscInt       numFields, f, pStart = 0, pEnd = 0, p;
3025552f7358SJed Brown   PetscErrorCode ierr;
3026552f7358SJed Brown 
3027552f7358SJed Brown   PetscFunctionBegin;
3028552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
3029552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3030785e854fSJed Brown   ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr);
30310d644c17SKarl Rupp   for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0;
3032552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
3033552f7358SJed Brown     PetscInt cdof;
3034552f7358SJed Brown 
3035552f7358SJed Brown     if (numFields) {
3036552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
3037552f7358SJed Brown         ierr              = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr);
3038552f7358SJed Brown         maxConstraints[f] = PetscMax(maxConstraints[f], cdof);
3039552f7358SJed Brown       }
3040552f7358SJed Brown     } else {
3041552f7358SJed Brown       ierr              = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
3042552f7358SJed Brown       maxConstraints[0] = PetscMax(maxConstraints[0], cdof);
3043552f7358SJed Brown     }
3044552f7358SJed Brown   }
3045552f7358SJed Brown   for (f = 0; f < numFields; ++f) {
3046552f7358SJed Brown     maxConstraints[numFields] += maxConstraints[f];
3047552f7358SJed Brown   }
3048552f7358SJed Brown   if (maxConstraints[numFields]) {
3049552f7358SJed Brown     PetscInt *indices;
3050552f7358SJed Brown 
3051785e854fSJed Brown     ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr);
3052552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
3053552f7358SJed Brown       PetscInt cdof, d;
3054552f7358SJed Brown 
3055552f7358SJed Brown       ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
3056552f7358SJed Brown       if (cdof) {
3057552f7358SJed 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]);
3058552f7358SJed Brown         if (numFields) {
3059552f7358SJed Brown           PetscInt numConst = 0, foff = 0;
3060552f7358SJed Brown 
3061552f7358SJed Brown           for (f = 0; f < numFields; ++f) {
3062552f7358SJed Brown             PetscInt cfdof, fdof;
3063552f7358SJed Brown 
3064552f7358SJed Brown             ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr);
3065552f7358SJed Brown             ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr);
3066552f7358SJed Brown             /* Change constraint numbering from absolute local dof number to field relative local dof number */
30670d644c17SKarl Rupp             for (d = 0; d < cfdof; ++d) indices[numConst+d] = d;
3068552f7358SJed Brown             ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr);
30690d644c17SKarl Rupp             for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff;
3070552f7358SJed Brown             numConst += cfdof;
3071552f7358SJed Brown             foff     += fdof;
3072552f7358SJed Brown           }
3073552f7358SJed Brown           if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof);
3074552f7358SJed Brown         } else {
30750d644c17SKarl Rupp           for (d = 0; d < cdof; ++d) indices[d] = d;
3076552f7358SJed Brown         }
3077552f7358SJed Brown         ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr);
3078552f7358SJed Brown       }
3079552f7358SJed Brown     }
3080552f7358SJed Brown     ierr = PetscFree(indices);CHKERRQ(ierr);
3081552f7358SJed Brown   }
3082552f7358SJed Brown   ierr = PetscFree(maxConstraints);CHKERRQ(ierr);
3083552f7358SJed Brown   PetscFunctionReturn(0);
3084552f7358SJed Brown }
3085552f7358SJed Brown 
3086552f7358SJed Brown #undef __FUNCT__
3087552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField"
3088552f7358SJed Brown /* Set the constrained field indices on each point */
30890adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section)
30900adebc6cSBarry Smith {
3091552f7358SJed Brown   const PetscInt *points, *indices;
3092552f7358SJed Brown   PetscInt        numFields, maxDof, numPoints, p, numConstraints;
3093552f7358SJed Brown   PetscErrorCode  ierr;
3094552f7358SJed Brown 
3095552f7358SJed Brown   PetscFunctionBegin;
3096552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
3097552f7358SJed 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);
3098552f7358SJed Brown 
3099552f7358SJed Brown   ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr);
3100552f7358SJed Brown   ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr);
3101552f7358SJed Brown   if (!constraintIndices) {
3102552f7358SJed Brown     PetscInt *idx, i;
3103552f7358SJed Brown 
3104552f7358SJed Brown     ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
3105785e854fSJed Brown     ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr);
31060d644c17SKarl Rupp     for (i = 0; i < maxDof; ++i) idx[i] = i;
3107552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
3108552f7358SJed Brown       ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr);
3109552f7358SJed Brown     }
3110552f7358SJed Brown     ierr = PetscFree(idx);CHKERRQ(ierr);
3111552f7358SJed Brown   } else {
3112552f7358SJed Brown     ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr);
3113552f7358SJed Brown     ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr);
3114552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
3115552f7358SJed Brown       PetscInt fcdof;
3116552f7358SJed Brown 
3117552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr);
311882f516ccSBarry 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);
3119552f7358SJed Brown       ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr);
3120552f7358SJed Brown     }
3121552f7358SJed Brown     ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr);
3122552f7358SJed Brown   }
3123552f7358SJed Brown   ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr);
3124552f7358SJed Brown   PetscFunctionReturn(0);
3125552f7358SJed Brown }
3126552f7358SJed Brown 
3127552f7358SJed Brown #undef __FUNCT__
3128552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices"
3129552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */
31300adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section)
31310adebc6cSBarry Smith {
3132552f7358SJed Brown   PetscInt      *indices;
3133552f7358SJed Brown   PetscInt       numFields, maxDof, f, pStart = 0, pEnd = 0, p;
3134552f7358SJed Brown   PetscErrorCode ierr;
3135552f7358SJed Brown 
3136552f7358SJed Brown   PetscFunctionBegin;
3137552f7358SJed Brown   ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
3138785e854fSJed Brown   ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr);
3139552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
314082f516ccSBarry Smith   if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices.");
3141552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3142552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
3143552f7358SJed Brown     PetscInt cdof, d;
3144552f7358SJed Brown 
3145552f7358SJed Brown     ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
3146552f7358SJed Brown     if (cdof) {
3147552f7358SJed Brown       PetscInt numConst = 0, foff = 0;
3148552f7358SJed Brown 
3149552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
3150552f7358SJed Brown         const PetscInt *fcind;
3151552f7358SJed Brown         PetscInt        fdof, fcdof;
3152552f7358SJed Brown 
3153552f7358SJed Brown         ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr);
3154552f7358SJed Brown         ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr);
3155552f7358SJed Brown         if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);}
3156552f7358SJed Brown         /* Change constraint numbering from field relative local dof number to absolute local dof number */
31570d644c17SKarl Rupp         for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff;
3158552f7358SJed Brown         foff     += fdof;
3159552f7358SJed Brown         numConst += fcdof;
3160552f7358SJed Brown       }
316182f516ccSBarry Smith       if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof);
3162552f7358SJed Brown       ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr);
3163552f7358SJed Brown     }
3164552f7358SJed Brown   }
3165552f7358SJed Brown   ierr = PetscFree(indices);CHKERRQ(ierr);
3166552f7358SJed Brown   PetscFunctionReturn(0);
3167552f7358SJed Brown }
3168552f7358SJed Brown 
3169552f7358SJed Brown #undef __FUNCT__
3170552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection"
3171552f7358SJed Brown /*@C
3172552f7358SJed Brown   DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided.
3173552f7358SJed Brown 
3174552f7358SJed Brown   Not Collective
3175552f7358SJed Brown 
3176552f7358SJed Brown   Input Parameters:
3177552f7358SJed Brown + dm        - The DMPlex object
3178552f7358SJed Brown . dim       - The spatial dimension of the problem
3179552f7358SJed Brown . numFields - The number of fields in the problem
3180552f7358SJed Brown . numComp   - An array of size numFields that holds the number of components for each field
3181552f7358SJed 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
3182552f7358SJed Brown . numBC     - The number of boundary conditions
3183552f7358SJed Brown . bcField   - An array of size numBC giving the field number for each boundry condition
3184f8f126e8SMatthew G. Knepley . bcPoints  - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies
3185f8f126e8SMatthew G. Knepley - perm      - Optional permutation of the chart, or NULL
3186552f7358SJed Brown 
3187552f7358SJed Brown   Output Parameter:
3188552f7358SJed Brown . section - The PetscSection object
3189552f7358SJed Brown 
3190552f7358SJed 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
3191f8f126e8SMatthew G. Knepley   number of dof for field 0 on each edge.
3192f8f126e8SMatthew G. Knepley 
3193f8f126e8SMatthew G. Knepley   The chart permutation is the same one set using PetscSectionSetPermutation()
3194552f7358SJed Brown 
3195552f7358SJed Brown   Level: developer
3196552f7358SJed Brown 
31973813dfbdSMatthew G Knepley   Fortran Notes:
31983813dfbdSMatthew G Knepley   A Fortran 90 version is available as DMPlexCreateSectionF90()
31993813dfbdSMatthew G Knepley 
3200552f7358SJed Brown .keywords: mesh, elements
3201f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation()
3202552f7358SJed Brown @*/
3203f8f126e8SMatthew 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)
3204a6dfd86eSKarl Rupp {
3205a68b90caSToby Isaac   PetscSection   aSec;
3206552f7358SJed Brown   PetscErrorCode ierr;
3207552f7358SJed Brown 
3208552f7358SJed Brown   PetscFunctionBegin;
3209552f7358SJed Brown   ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr);
3210552f7358SJed Brown   ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr);
3211f8f126e8SMatthew G. Knepley   if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);}
3212552f7358SJed Brown   ierr = PetscSectionSetUp(*section);CHKERRQ(ierr);
3213a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm,&aSec,NULL);CHKERRQ(ierr);
3214a68b90caSToby Isaac   if (numBC || aSec) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);}
3215ce1779c8SBarry Smith   ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr);
3216552f7358SJed Brown   PetscFunctionReturn(0);
3217552f7358SJed Brown }
3218552f7358SJed Brown 
3219552f7358SJed Brown #undef __FUNCT__
3220552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex"
32210adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm)
32220adebc6cSBarry Smith {
3223552f7358SJed Brown   PetscSection   section;
3224552f7358SJed Brown   PetscErrorCode ierr;
3225552f7358SJed Brown 
3226552f7358SJed Brown   PetscFunctionBegin;
322738221697SMatthew G. Knepley   ierr = DMClone(dm, cdm);CHKERRQ(ierr);
322882f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &section);CHKERRQ(ierr);
3229552f7358SJed Brown   ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr);
32301d799100SJed Brown   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
3231552f7358SJed Brown   PetscFunctionReturn(0);
3232552f7358SJed Brown }
3233552f7358SJed Brown 
3234552f7358SJed Brown #undef __FUNCT__
3235552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection"
32360adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section)
32370adebc6cSBarry Smith {
3238552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
3239552f7358SJed Brown 
3240552f7358SJed Brown   PetscFunctionBegin;
3241552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3242552f7358SJed Brown   if (section) *section = mesh->coneSection;
3243552f7358SJed Brown   PetscFunctionReturn(0);
3244552f7358SJed Brown }
3245552f7358SJed Brown 
3246552f7358SJed Brown #undef __FUNCT__
32478cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection"
32488cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section)
32498cb4d582SMatthew G. Knepley {
32508cb4d582SMatthew G. Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
32518cb4d582SMatthew G. Knepley 
32528cb4d582SMatthew G. Knepley   PetscFunctionBegin;
32538cb4d582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
32548cb4d582SMatthew G. Knepley   if (section) *section = mesh->supportSection;
32558cb4d582SMatthew G. Knepley   PetscFunctionReturn(0);
32568cb4d582SMatthew G. Knepley }
32578cb4d582SMatthew G. Knepley 
32588cb4d582SMatthew G. Knepley #undef __FUNCT__
3259552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones"
3260a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[])
3261a6dfd86eSKarl Rupp {
3262552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
3263552f7358SJed Brown 
3264552f7358SJed Brown   PetscFunctionBegin;
3265552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3266552f7358SJed Brown   if (cones) *cones = mesh->cones;
3267552f7358SJed Brown   PetscFunctionReturn(0);
3268552f7358SJed Brown }
3269552f7358SJed Brown 
3270552f7358SJed Brown #undef __FUNCT__
3271552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations"
3272a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[])
3273a6dfd86eSKarl Rupp {
3274552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
3275552f7358SJed Brown 
3276552f7358SJed Brown   PetscFunctionBegin;
3277552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3278552f7358SJed Brown   if (coneOrientations) *coneOrientations = mesh->coneOrientations;
3279552f7358SJed Brown   PetscFunctionReturn(0);
3280552f7358SJed Brown }
3281552f7358SJed Brown 
3282552f7358SJed Brown /******************************** FEM Support **********************************/
3283552f7358SJed Brown 
3284552f7358SJed Brown #undef __FUNCT__
32851a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static"
32861a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
3287a6dfd86eSKarl Rupp {
3288552f7358SJed Brown   PetscScalar    *array, *vArray;
3289d9917b9dSMatthew G. Knepley   const PetscInt *cone, *coneO;
32901a271a75SMatthew G. Knepley   PetscInt        pStart, pEnd, p, numPoints, size = 0, offset = 0;
3291552f7358SJed Brown   PetscErrorCode  ierr;
3292552f7358SJed Brown 
32931b406b76SMatthew G. Knepley   PetscFunctionBeginHot;
32942a3aaacfSMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
32955a1bb5cfSMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr);
32965a1bb5cfSMatthew G. Knepley   ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
32975a1bb5cfSMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr);
32983f7cbbe7SMatthew G. Knepley   if (!values || !*values) {
32999df71ca4SMatthew G. Knepley     if ((point >= pStart) && (point < pEnd)) {
33009df71ca4SMatthew G. Knepley       PetscInt dof;
3301d9917b9dSMatthew G. Knepley 
33029df71ca4SMatthew G. Knepley       ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
33039df71ca4SMatthew G. Knepley       size += dof;
33049df71ca4SMatthew G. Knepley     }
33059df71ca4SMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
33069df71ca4SMatthew G. Knepley       const PetscInt cp = cone[p];
33072a3aaacfSMatthew G. Knepley       PetscInt       dof;
33085a1bb5cfSMatthew G. Knepley 
33095a1bb5cfSMatthew G. Knepley       if ((cp < pStart) || (cp >= pEnd)) continue;
33102a3aaacfSMatthew G. Knepley       ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
33115a1bb5cfSMatthew G. Knepley       size += dof;
33125a1bb5cfSMatthew G. Knepley     }
33133f7cbbe7SMatthew G. Knepley     if (!values) {
33143f7cbbe7SMatthew G. Knepley       if (csize) *csize = size;
33153f7cbbe7SMatthew G. Knepley       PetscFunctionReturn(0);
33163f7cbbe7SMatthew G. Knepley     }
33175a1bb5cfSMatthew G. Knepley     ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr);
3318982e9ed1SMatthew G. Knepley   } else {
3319982e9ed1SMatthew G. Knepley     array = *values;
3320982e9ed1SMatthew G. Knepley   }
33219df71ca4SMatthew G. Knepley   size = 0;
33225a1bb5cfSMatthew G. Knepley   ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
33239df71ca4SMatthew G. Knepley   if ((point >= pStart) && (point < pEnd)) {
33249df71ca4SMatthew G. Knepley     PetscInt     dof, off, d;
33259df71ca4SMatthew G. Knepley     PetscScalar *varr;
3326d9917b9dSMatthew G. Knepley 
33279df71ca4SMatthew G. Knepley     ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
33289df71ca4SMatthew G. Knepley     ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
33299df71ca4SMatthew G. Knepley     varr = &vArray[off];
33301a271a75SMatthew G. Knepley     for (d = 0; d < dof; ++d, ++offset) {
33311a271a75SMatthew G. Knepley       array[offset] = varr[d];
33329df71ca4SMatthew G. Knepley     }
33339df71ca4SMatthew G. Knepley     size += dof;
33349df71ca4SMatthew G. Knepley   }
33359df71ca4SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) {
33369df71ca4SMatthew G. Knepley     const PetscInt cp = cone[p];
33379df71ca4SMatthew G. Knepley     PetscInt       o  = coneO[p];
33385a1bb5cfSMatthew G. Knepley     PetscInt       dof, off, d;
33395a1bb5cfSMatthew G. Knepley     PetscScalar   *varr;
33405a1bb5cfSMatthew G. Knepley 
334152ed52e8SMatthew G. Knepley     if ((cp < pStart) || (cp >= pEnd)) continue;
33425a1bb5cfSMatthew G. Knepley     ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
33435a1bb5cfSMatthew G. Knepley     ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr);
33445a1bb5cfSMatthew G. Knepley     varr = &vArray[off];
33455a1bb5cfSMatthew G. Knepley     if (o >= 0) {
33461a271a75SMatthew G. Knepley       for (d = 0; d < dof; ++d, ++offset) {
33471a271a75SMatthew G. Knepley         array[offset] = varr[d];
33485a1bb5cfSMatthew G. Knepley       }
33495a1bb5cfSMatthew G. Knepley     } else {
33501a271a75SMatthew G. Knepley       for (d = dof-1; d >= 0; --d, ++offset) {
33511a271a75SMatthew G. Knepley         array[offset] = varr[d];
33525a1bb5cfSMatthew G. Knepley       }
33535a1bb5cfSMatthew G. Knepley     }
33549df71ca4SMatthew G. Knepley     size += dof;
33555a1bb5cfSMatthew G. Knepley   }
33565a1bb5cfSMatthew G. Knepley   ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
33579df71ca4SMatthew G. Knepley   if (!*values) {
33585a1bb5cfSMatthew G. Knepley     if (csize) *csize = size;
33595a1bb5cfSMatthew G. Knepley     *values = array;
33609df71ca4SMatthew G. Knepley   } else {
33619df71ca4SMatthew G. Knepley     if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size);
33628c312ff3SMatthew G. Knepley     *csize = size;
33639df71ca4SMatthew G. Knepley   }
33645a1bb5cfSMatthew G. Knepley   PetscFunctionReturn(0);
33655a1bb5cfSMatthew G. Knepley }
3366d9917b9dSMatthew G. Knepley 
3367d9917b9dSMatthew G. Knepley #undef __FUNCT__
33681a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static"
33691a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[])
33701a271a75SMatthew G. Knepley {
33711a271a75SMatthew G. Knepley   PetscInt       offset = 0, p;
33721a271a75SMatthew G. Knepley   PetscErrorCode ierr;
33731a271a75SMatthew G. Knepley 
33741a271a75SMatthew G. Knepley   PetscFunctionBeginHot;
3375fe02ba77SJed Brown   *size = 0;
33761a271a75SMatthew G. Knepley   for (p = 0; p < numPoints*2; p += 2) {
33771a271a75SMatthew G. Knepley     const PetscInt point = points[p];
33781a271a75SMatthew G. Knepley     const PetscInt o     = points[p+1];
33791a271a75SMatthew G. Knepley     PetscInt       dof, off, d;
33801a271a75SMatthew G. Knepley     const PetscScalar *varr;
33811a271a75SMatthew G. Knepley 
33821a271a75SMatthew G. Knepley     ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
33831a271a75SMatthew G. Knepley     ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
33841a271a75SMatthew G. Knepley     varr = &vArray[off];
33851a271a75SMatthew G. Knepley     if (o >= 0) {
33861a271a75SMatthew G. Knepley       for (d = 0; d < dof; ++d, ++offset)    array[offset] = varr[d];
33871a271a75SMatthew G. Knepley     } else {
33881a271a75SMatthew G. Knepley       for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d];
33891a271a75SMatthew G. Knepley     }
33901a271a75SMatthew G. Knepley   }
33911a271a75SMatthew G. Knepley   *size = offset;
33921a271a75SMatthew G. Knepley   PetscFunctionReturn(0);
33931a271a75SMatthew G. Knepley }
33941a271a75SMatthew G. Knepley 
33951a271a75SMatthew G. Knepley #undef __FUNCT__
33961a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static"
33971a271a75SMatthew 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[])
33981a271a75SMatthew G. Knepley {
33991a271a75SMatthew G. Knepley   PetscInt       offset = 0, f;
34001a271a75SMatthew G. Knepley   PetscErrorCode ierr;
34011a271a75SMatthew G. Knepley 
34021a271a75SMatthew G. Knepley   PetscFunctionBeginHot;
3403fe02ba77SJed Brown   *size = 0;
34041a271a75SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
34051a271a75SMatthew G. Knepley     PetscInt fcomp, p;
34061a271a75SMatthew G. Knepley 
34071a271a75SMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
34081a271a75SMatthew G. Knepley     for (p = 0; p < numPoints*2; p += 2) {
34091a271a75SMatthew G. Knepley       const PetscInt point = points[p];
34101a271a75SMatthew G. Knepley       const PetscInt o     = points[p+1];
34111a271a75SMatthew G. Knepley       PetscInt       fdof, foff, d, c;
34121a271a75SMatthew G. Knepley       const PetscScalar *varr;
34131a271a75SMatthew G. Knepley 
34141a271a75SMatthew G. Knepley       ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
34151a271a75SMatthew G. Knepley       ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr);
34161a271a75SMatthew G. Knepley       varr = &vArray[foff];
34171a271a75SMatthew G. Knepley       if (o >= 0) {
34181a271a75SMatthew G. Knepley         for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d];
34191a271a75SMatthew G. Knepley       } else {
34201a271a75SMatthew G. Knepley         for (d = fdof/fcomp-1; d >= 0; --d) {
34211a271a75SMatthew G. Knepley           for (c = 0; c < fcomp; ++c, ++offset) {
34221a271a75SMatthew G. Knepley             array[offset] = varr[d*fcomp+c];
34231a271a75SMatthew G. Knepley           }
34241a271a75SMatthew G. Knepley         }
34251a271a75SMatthew G. Knepley       }
34261a271a75SMatthew G. Knepley     }
34271a271a75SMatthew G. Knepley   }
34281a271a75SMatthew G. Knepley   *size = offset;
34291a271a75SMatthew G. Knepley   PetscFunctionReturn(0);
34301a271a75SMatthew G. Knepley }
34311a271a75SMatthew G. Knepley 
34321a271a75SMatthew G. Knepley #undef __FUNCT__
3433552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure"
3434552f7358SJed Brown /*@C
3435552f7358SJed Brown   DMPlexVecGetClosure - Get an array of the values on the closure of 'point'
3436552f7358SJed Brown 
3437552f7358SJed Brown   Not collective
3438552f7358SJed Brown 
3439552f7358SJed Brown   Input Parameters:
3440552f7358SJed Brown + dm - The DM
3441552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section
3442552f7358SJed Brown . v - The local vector
3443552f7358SJed Brown - point - The sieve point in the DM
3444552f7358SJed Brown 
3445552f7358SJed Brown   Output Parameters:
3446552f7358SJed Brown + csize - The number of values in the closure, or NULL
3447552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed
3448552f7358SJed Brown 
3449552f7358SJed Brown   Fortran Notes:
3450552f7358SJed Brown   Since it returns an array, this routine is only available in Fortran 90, and you must
3451552f7358SJed Brown   include petsc.h90 in your code.
3452552f7358SJed Brown 
3453552f7358SJed Brown   The csize argument is not present in the Fortran 90 binding since it is internal to the array.
3454552f7358SJed Brown 
3455552f7358SJed Brown   Level: intermediate
3456552f7358SJed Brown 
3457552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
3458552f7358SJed Brown @*/
3459552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
3460552f7358SJed Brown {
3461552f7358SJed Brown   PetscSection    clSection;
3462d9917b9dSMatthew G. Knepley   IS              clPoints;
3463552f7358SJed Brown   PetscScalar    *array, *vArray;
3464552f7358SJed Brown   PetscInt       *points = NULL;
3465d9917b9dSMatthew G. Knepley   const PetscInt *clp;
34661a271a75SMatthew G. Knepley   PetscInt        depth, numFields, numPoints, size;
3467552f7358SJed Brown   PetscErrorCode  ierr;
3468552f7358SJed Brown 
3469d9917b9dSMatthew G. Knepley   PetscFunctionBeginHot;
3470552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3471552f7358SJed Brown   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
34721a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
34731a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
3474552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3475552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
3476552f7358SJed Brown   if (depth == 1 && numFields < 2) {
34771a271a75SMatthew G. Knepley     ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr);
3478552f7358SJed Brown     PetscFunctionReturn(0);
3479552f7358SJed Brown   }
34801a271a75SMatthew G. Knepley   /* Get points */
3481d9917b9dSMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr);
3482d9917b9dSMatthew G. Knepley   if (!clPoints) {
34831a271a75SMatthew G. Knepley     PetscInt pStart, pEnd, p, q;
3484552f7358SJed Brown 
34851a271a75SMatthew G. Knepley     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3486552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3487552f7358SJed Brown     /* Compress out points not in the section */
3488552f7358SJed Brown     for (p = 0, q = 0; p < numPoints*2; p += 2) {
3489552f7358SJed Brown       if ((points[p] >= pStart) && (points[p] < pEnd)) {
3490552f7358SJed Brown         points[q*2]   = points[p];
3491552f7358SJed Brown         points[q*2+1] = points[p+1];
3492552f7358SJed Brown         ++q;
3493552f7358SJed Brown       }
3494552f7358SJed Brown     }
3495552f7358SJed Brown     numPoints = q;
3496d9917b9dSMatthew G. Knepley   } else {
3497d9917b9dSMatthew G. Knepley     PetscInt dof, off;
3498552f7358SJed Brown 
3499d9917b9dSMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
3500d9917b9dSMatthew G. Knepley     ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
3501d9917b9dSMatthew G. Knepley     ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr);
35021a271a75SMatthew G. Knepley     numPoints = dof/2;
3503d9917b9dSMatthew G. Knepley     points    = (PetscInt *) &clp[off];
3504552f7358SJed Brown   }
35051a271a75SMatthew G. Knepley   /* Get array */
3506552f7358SJed Brown   if (!values || !*values) {
35071a271a75SMatthew G. Knepley     PetscInt asize = 0, dof, p;
3508552f7358SJed Brown 
35091a271a75SMatthew G. Knepley     for (p = 0; p < numPoints*2; p += 2) {
3510552f7358SJed Brown       ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
35111a271a75SMatthew G. Knepley       asize += dof;
3512552f7358SJed Brown     }
3513bd6c0d32SMatthew G. Knepley     if (!values) {
3514d9917b9dSMatthew G. Knepley       if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);}
35151a271a75SMatthew G. Knepley       else           {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);}
35161a271a75SMatthew G. Knepley       if (csize) *csize = asize;
3517bd6c0d32SMatthew G. Knepley       PetscFunctionReturn(0);
3518bd6c0d32SMatthew G. Knepley     }
35191a271a75SMatthew G. Knepley     ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr);
3520d0f6b257SMatthew G. Knepley   } else {
3521d0f6b257SMatthew G. Knepley     array = *values;
3522d0f6b257SMatthew G. Knepley   }
3523552f7358SJed Brown   ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
35241a271a75SMatthew G. Knepley   /* Get values */
3525ef90cfe2SMatthew G. Knepley   if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);}
35261a271a75SMatthew G. Knepley   else               {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);}
35271a271a75SMatthew G. Knepley   /* Cleanup points */
35281a271a75SMatthew G. Knepley   if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);}
35291a271a75SMatthew G. Knepley   else           {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);}
35301a271a75SMatthew G. Knepley   /* Cleanup array */
3531552f7358SJed Brown   ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
3532d0f6b257SMatthew G. Knepley   if (!*values) {
3533552f7358SJed Brown     if (csize) *csize = size;
3534552f7358SJed Brown     *values = array;
3535d0f6b257SMatthew G. Knepley   } else {
3536d0f6b257SMatthew G. Knepley     if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size);
3537d0f6b257SMatthew G. Knepley     *csize = size;
3538d0f6b257SMatthew G. Knepley   }
3539552f7358SJed Brown   PetscFunctionReturn(0);
3540552f7358SJed Brown }
3541552f7358SJed Brown 
3542552f7358SJed Brown #undef __FUNCT__
3543552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure"
3544552f7358SJed Brown /*@C
3545552f7358SJed Brown   DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point'
3546552f7358SJed Brown 
3547552f7358SJed Brown   Not collective
3548552f7358SJed Brown 
3549552f7358SJed Brown   Input Parameters:
3550552f7358SJed Brown + dm - The DM
35510298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section
3552552f7358SJed Brown . v - The local vector
3553552f7358SJed Brown . point - The sieve point in the DM
35540298fd71SBarry Smith . csize - The number of values in the closure, or NULL
3555552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed
3556552f7358SJed Brown 
35573813dfbdSMatthew G Knepley   Fortran Notes:
35583813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
35593813dfbdSMatthew G Knepley   include petsc.h90 in your code.
35603813dfbdSMatthew G Knepley 
35613813dfbdSMatthew G Knepley   The csize argument is not present in the Fortran 90 binding since it is internal to the array.
35623813dfbdSMatthew G Knepley 
3563552f7358SJed Brown   Level: intermediate
3564552f7358SJed Brown 
3565552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
3566552f7358SJed Brown @*/
35677c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
3568a6dfd86eSKarl Rupp {
3569552f7358SJed Brown   PetscInt       size = 0;
3570552f7358SJed Brown   PetscErrorCode ierr;
3571552f7358SJed Brown 
3572552f7358SJed Brown   PetscFunctionBegin;
3573552f7358SJed Brown   /* Should work without recalculating size */
3574552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr);
3575552f7358SJed Brown   PetscFunctionReturn(0);
3576552f7358SJed Brown }
3577552f7358SJed Brown 
3578552f7358SJed Brown PETSC_STATIC_INLINE void add   (PetscScalar *x, PetscScalar y) {*x += y;}
3579552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x  = y;}
3580552f7358SJed Brown 
3581552f7358SJed Brown #undef __FUNCT__
3582552f7358SJed Brown #define __FUNCT__ "updatePoint_private"
35831a271a75SMatthew 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[])
3584552f7358SJed Brown {
3585552f7358SJed Brown   PetscInt        cdof;   /* The number of constraints on this point */
3586552f7358SJed Brown   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
3587552f7358SJed Brown   PetscScalar    *a;
3588552f7358SJed Brown   PetscInt        off, cind = 0, k;
3589552f7358SJed Brown   PetscErrorCode  ierr;
3590552f7358SJed Brown 
3591552f7358SJed Brown   PetscFunctionBegin;
3592552f7358SJed Brown   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
3593552f7358SJed Brown   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
3594552f7358SJed Brown   a    = &array[off];
3595552f7358SJed Brown   if (!cdof || setBC) {
3596552f7358SJed Brown     if (orientation >= 0) {
3597552f7358SJed Brown       for (k = 0; k < dof; ++k) {
3598552f7358SJed Brown         fuse(&a[k], values[k]);
3599552f7358SJed Brown       }
3600552f7358SJed Brown     } else {
3601552f7358SJed Brown       for (k = 0; k < dof; ++k) {
3602552f7358SJed Brown         fuse(&a[k], values[dof-k-1]);
3603552f7358SJed Brown       }
3604552f7358SJed Brown     }
3605552f7358SJed Brown   } else {
3606552f7358SJed Brown     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
3607552f7358SJed Brown     if (orientation >= 0) {
3608552f7358SJed Brown       for (k = 0; k < dof; ++k) {
3609552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
3610552f7358SJed Brown         fuse(&a[k], values[k]);
3611552f7358SJed Brown       }
3612552f7358SJed Brown     } else {
3613552f7358SJed Brown       for (k = 0; k < dof; ++k) {
3614552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
3615552f7358SJed Brown         fuse(&a[k], values[dof-k-1]);
3616552f7358SJed Brown       }
3617552f7358SJed Brown     }
3618552f7358SJed Brown   }
3619552f7358SJed Brown   PetscFunctionReturn(0);
3620552f7358SJed Brown }
3621552f7358SJed Brown 
3622552f7358SJed Brown #undef __FUNCT__
3623a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private"
36241a271a75SMatthew 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[])
3625a5e93ea8SMatthew G. Knepley {
3626a5e93ea8SMatthew G. Knepley   PetscInt        cdof;   /* The number of constraints on this point */
3627a5e93ea8SMatthew G. Knepley   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
3628a5e93ea8SMatthew G. Knepley   PetscScalar    *a;
3629a5e93ea8SMatthew G. Knepley   PetscInt        off, cind = 0, k;
3630a5e93ea8SMatthew G. Knepley   PetscErrorCode  ierr;
3631a5e93ea8SMatthew G. Knepley 
3632a5e93ea8SMatthew G. Knepley   PetscFunctionBegin;
3633a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
3634a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
3635a5e93ea8SMatthew G. Knepley   a    = &array[off];
3636a5e93ea8SMatthew G. Knepley   if (cdof) {
3637a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
3638a5e93ea8SMatthew G. Knepley     if (orientation >= 0) {
3639a5e93ea8SMatthew G. Knepley       for (k = 0; k < dof; ++k) {
3640a5e93ea8SMatthew G. Knepley         if ((cind < cdof) && (k == cdofs[cind])) {
3641a5e93ea8SMatthew G. Knepley           fuse(&a[k], values[k]);
3642a5e93ea8SMatthew G. Knepley           ++cind;
3643a5e93ea8SMatthew G. Knepley         }
3644a5e93ea8SMatthew G. Knepley       }
3645a5e93ea8SMatthew G. Knepley     } else {
3646a5e93ea8SMatthew G. Knepley       for (k = 0; k < dof; ++k) {
3647a5e93ea8SMatthew G. Knepley         if ((cind < cdof) && (k == cdofs[cind])) {
3648a5e93ea8SMatthew G. Knepley           fuse(&a[k], values[dof-k-1]);
3649a5e93ea8SMatthew G. Knepley           ++cind;
3650a5e93ea8SMatthew G. Knepley         }
3651a5e93ea8SMatthew G. Knepley       }
3652a5e93ea8SMatthew G. Knepley     }
3653a5e93ea8SMatthew G. Knepley   }
3654a5e93ea8SMatthew G. Knepley   PetscFunctionReturn(0);
3655a5e93ea8SMatthew G. Knepley }
3656a5e93ea8SMatthew G. Knepley 
3657a5e93ea8SMatthew G. Knepley #undef __FUNCT__
3658552f7358SJed Brown #define __FUNCT__ "updatePointFields_private"
36591a271a75SMatthew 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[])
3660a6dfd86eSKarl Rupp {
3661552f7358SJed Brown   PetscScalar    *a;
36621a271a75SMatthew G. Knepley   PetscInt        fdof, foff, fcdof, foffset = *offset;
36631a271a75SMatthew G. Knepley   const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
36641a271a75SMatthew G. Knepley   PetscInt        cind = 0, k, c;
3665552f7358SJed Brown   PetscErrorCode  ierr;
3666552f7358SJed Brown 
3667552f7358SJed Brown   PetscFunctionBegin;
3668552f7358SJed Brown   ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
3669552f7358SJed Brown   ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr);
36701a271a75SMatthew G. Knepley   ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr);
36711a271a75SMatthew G. Knepley   a    = &array[foff];
3672552f7358SJed Brown   if (!fcdof || setBC) {
36731a271a75SMatthew G. Knepley     if (o >= 0) {
36741a271a75SMatthew G. Knepley       for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]);
3675552f7358SJed Brown     } else {
3676552f7358SJed Brown       for (k = fdof/fcomp-1; k >= 0; --k) {
3677552f7358SJed Brown         for (c = 0; c < fcomp; ++c) {
36781a271a75SMatthew G. Knepley           fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]);
3679552f7358SJed Brown         }
3680552f7358SJed Brown       }
3681552f7358SJed Brown     }
3682552f7358SJed Brown   } else {
3683552f7358SJed Brown     ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
36841a271a75SMatthew G. Knepley     if (o >= 0) {
3685552f7358SJed Brown       for (k = 0; k < fdof; ++k) {
3686552f7358SJed Brown         if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;}
36871a271a75SMatthew G. Knepley         fuse(&a[k], values[foffset+k]);
3688552f7358SJed Brown       }
3689552f7358SJed Brown     } else {
3690552f7358SJed Brown       for (k = fdof/fcomp-1; k >= 0; --k) {
3691552f7358SJed Brown         for (c = 0; c < fcomp; ++c) {
3692552f7358SJed Brown           if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;}
36931a271a75SMatthew G. Knepley           fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]);
3694552f7358SJed Brown         }
3695552f7358SJed Brown       }
3696552f7358SJed Brown     }
3697552f7358SJed Brown   }
36981a271a75SMatthew G. Knepley   *offset += fdof;
3699552f7358SJed Brown   PetscFunctionReturn(0);
3700552f7358SJed Brown }
3701552f7358SJed Brown 
3702552f7358SJed Brown #undef __FUNCT__
3703a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private"
37041a271a75SMatthew 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[])
3705a5e93ea8SMatthew G. Knepley {
3706a5e93ea8SMatthew G. Knepley   PetscScalar    *a;
37071a271a75SMatthew G. Knepley   PetscInt        fdof, foff, fcdof, foffset = *offset;
37081a271a75SMatthew G. Knepley   const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
37091a271a75SMatthew G. Knepley   PetscInt        cind = 0, k, c;
3710a5e93ea8SMatthew G. Knepley   PetscErrorCode  ierr;
3711a5e93ea8SMatthew G. Knepley 
3712a5e93ea8SMatthew G. Knepley   PetscFunctionBegin;
3713a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
3714a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr);
37151a271a75SMatthew G. Knepley   ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr);
37161a271a75SMatthew G. Knepley   a    = &array[foff];
3717a5e93ea8SMatthew G. Knepley   if (fcdof) {
3718a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
37191a271a75SMatthew G. Knepley     if (o >= 0) {
3720a5e93ea8SMatthew G. Knepley       for (k = 0; k < fdof; ++k) {
3721a5e93ea8SMatthew G. Knepley         if ((cind < fcdof) && (k == fcdofs[cind])) {
37221a271a75SMatthew G. Knepley           fuse(&a[k], values[foffset+k]);
3723a5e93ea8SMatthew G. Knepley           ++cind;
3724a5e93ea8SMatthew G. Knepley         }
3725a5e93ea8SMatthew G. Knepley       }
3726a5e93ea8SMatthew G. Knepley     } else {
3727a5e93ea8SMatthew G. Knepley       for (k = fdof/fcomp-1; k >= 0; --k) {
3728a5e93ea8SMatthew G. Knepley         for (c = 0; c < fcomp; ++c) {
3729a5e93ea8SMatthew G. Knepley           if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {
37301a271a75SMatthew G. Knepley             fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]);
3731a5e93ea8SMatthew G. Knepley             ++cind;
3732a5e93ea8SMatthew G. Knepley           }
3733a5e93ea8SMatthew G. Knepley         }
3734a5e93ea8SMatthew G. Knepley       }
3735a5e93ea8SMatthew G. Knepley     }
3736a5e93ea8SMatthew G. Knepley   }
37371a271a75SMatthew G. Knepley   *offset += fdof;
3738a5e93ea8SMatthew G. Knepley   PetscFunctionReturn(0);
3739a5e93ea8SMatthew G. Knepley }
3740a5e93ea8SMatthew G. Knepley 
3741a5e93ea8SMatthew G. Knepley #undef __FUNCT__
37421b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static"
37431a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode)
3744a6dfd86eSKarl Rupp {
3745552f7358SJed Brown   PetscScalar    *array;
37461b406b76SMatthew G. Knepley   const PetscInt *cone, *coneO;
37471b406b76SMatthew G. Knepley   PetscInt        pStart, pEnd, p, numPoints, off, dof;
3748552f7358SJed Brown   PetscErrorCode  ierr;
3749552f7358SJed Brown 
37501b406b76SMatthew G. Knepley   PetscFunctionBeginHot;
3751b6ebb6e6SMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3752b6ebb6e6SMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr);
3753b6ebb6e6SMatthew G. Knepley   ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
3754b6ebb6e6SMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr);
3755b6ebb6e6SMatthew G. Knepley   ierr = VecGetArray(v, &array);CHKERRQ(ierr);
3756b6ebb6e6SMatthew G. Knepley   for (p = 0, off = 0; p <= numPoints; ++p, off += dof) {
3757b6ebb6e6SMatthew G. Knepley     const PetscInt cp = !p ? point : cone[p-1];
3758b6ebb6e6SMatthew G. Knepley     const PetscInt o  = !p ? 0     : coneO[p-1];
3759b6ebb6e6SMatthew G. Knepley 
3760b6ebb6e6SMatthew G. Knepley     if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;}
3761b6ebb6e6SMatthew G. Knepley     ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
3762b6ebb6e6SMatthew G. Knepley     /* ADD_VALUES */
3763b6ebb6e6SMatthew G. Knepley     {
3764b6ebb6e6SMatthew G. Knepley       const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
3765b6ebb6e6SMatthew G. Knepley       PetscScalar    *a;
3766b6ebb6e6SMatthew G. Knepley       PetscInt        cdof, coff, cind = 0, k;
3767b6ebb6e6SMatthew G. Knepley 
3768b6ebb6e6SMatthew G. Knepley       ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr);
3769b6ebb6e6SMatthew G. Knepley       ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr);
3770b6ebb6e6SMatthew G. Knepley       a    = &array[coff];
3771b6ebb6e6SMatthew G. Knepley       if (!cdof) {
3772b6ebb6e6SMatthew G. Knepley         if (o >= 0) {
3773b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
3774b6ebb6e6SMatthew G. Knepley             a[k] += values[off+k];
3775b6ebb6e6SMatthew G. Knepley           }
3776b6ebb6e6SMatthew G. Knepley         } else {
3777b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
3778b6ebb6e6SMatthew G. Knepley             a[k] += values[off+dof-k-1];
3779b6ebb6e6SMatthew G. Knepley           }
3780b6ebb6e6SMatthew G. Knepley         }
3781b6ebb6e6SMatthew G. Knepley       } else {
3782b6ebb6e6SMatthew G. Knepley         ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr);
3783b6ebb6e6SMatthew G. Knepley         if (o >= 0) {
3784b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
3785b6ebb6e6SMatthew G. Knepley             if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
3786b6ebb6e6SMatthew G. Knepley             a[k] += values[off+k];
3787b6ebb6e6SMatthew G. Knepley           }
3788b6ebb6e6SMatthew G. Knepley         } else {
3789b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
3790b6ebb6e6SMatthew G. Knepley             if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
3791b6ebb6e6SMatthew G. Knepley             a[k] += values[off+dof-k-1];
3792b6ebb6e6SMatthew G. Knepley           }
3793b6ebb6e6SMatthew G. Knepley         }
3794b6ebb6e6SMatthew G. Knepley       }
3795b6ebb6e6SMatthew G. Knepley     }
3796b6ebb6e6SMatthew G. Knepley   }
3797b6ebb6e6SMatthew G. Knepley   ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
3798b6ebb6e6SMatthew G. Knepley   PetscFunctionReturn(0);
3799b6ebb6e6SMatthew G. Knepley }
38001b406b76SMatthew G. Knepley 
38011b406b76SMatthew G. Knepley #undef __FUNCT__
38021b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure"
38031b406b76SMatthew G. Knepley /*@C
38041b406b76SMatthew G. Knepley   DMPlexVecSetClosure - Set an array of the values on the closure of 'point'
38051b406b76SMatthew G. Knepley 
38061b406b76SMatthew G. Knepley   Not collective
38071b406b76SMatthew G. Knepley 
38081b406b76SMatthew G. Knepley   Input Parameters:
38091b406b76SMatthew G. Knepley + dm - The DM
38101b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section
38111b406b76SMatthew G. Knepley . v - The local vector
38121b406b76SMatthew G. Knepley . point - The sieve point in the DM
38131b406b76SMatthew G. Knepley . values - The array of values
38141b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions
38151b406b76SMatthew G. Knepley 
38161b406b76SMatthew G. Knepley   Fortran Notes:
38171b406b76SMatthew G. Knepley   This routine is only available in Fortran 90, and you must include petsc.h90 in your code.
38181b406b76SMatthew G. Knepley 
38191b406b76SMatthew G. Knepley   Level: intermediate
38201b406b76SMatthew G. Knepley 
38211b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure()
38221b406b76SMatthew G. Knepley @*/
38231b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode)
38241b406b76SMatthew G. Knepley {
38251b406b76SMatthew G. Knepley   PetscSection    clSection;
38261b406b76SMatthew G. Knepley   IS              clPoints;
38271b406b76SMatthew G. Knepley   PetscScalar    *array;
38281b406b76SMatthew G. Knepley   PetscInt       *points = NULL;
38291b406b76SMatthew G. Knepley   const PetscInt *clp;
38301a271a75SMatthew G. Knepley   PetscInt        depth, numFields, numPoints, p;
38311b406b76SMatthew G. Knepley   PetscErrorCode  ierr;
38321b406b76SMatthew G. Knepley 
38331a271a75SMatthew G. Knepley   PetscFunctionBeginHot;
38341b406b76SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
38351b406b76SMatthew G. Knepley   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
38361a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
38371a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
38381b406b76SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
38391b406b76SMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
38401b406b76SMatthew G. Knepley   if (depth == 1 && numFields < 2 && mode == ADD_VALUES) {
38411a271a75SMatthew G. Knepley     ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr);
38421b406b76SMatthew G. Knepley     PetscFunctionReturn(0);
38431b406b76SMatthew G. Knepley   }
38441a271a75SMatthew G. Knepley   /* Get points */
38451b406b76SMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr);
38461b406b76SMatthew G. Knepley   if (!clPoints) {
38471a271a75SMatthew G. Knepley     PetscInt pStart, pEnd, q;
38481a271a75SMatthew G. Knepley 
38491a271a75SMatthew G. Knepley     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3850552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3851552f7358SJed Brown     /* Compress out points not in the section */
3852552f7358SJed Brown     for (p = 0, q = 0; p < numPoints*2; p += 2) {
3853552f7358SJed Brown       if ((points[p] >= pStart) && (points[p] < pEnd)) {
3854552f7358SJed Brown         points[q*2]   = points[p];
3855552f7358SJed Brown         points[q*2+1] = points[p+1];
3856552f7358SJed Brown         ++q;
3857552f7358SJed Brown       }
3858552f7358SJed Brown     }
3859552f7358SJed Brown     numPoints = q;
38601b406b76SMatthew G. Knepley   } else {
38611b406b76SMatthew G. Knepley     PetscInt dof, off;
3862552f7358SJed Brown 
38631b406b76SMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
38641b406b76SMatthew G. Knepley     ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
38651b406b76SMatthew G. Knepley     ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr);
38661a271a75SMatthew G. Knepley     numPoints = dof/2;
38671b406b76SMatthew G. Knepley     points    = (PetscInt *) &clp[off];
3868552f7358SJed Brown   }
38691a271a75SMatthew G. Knepley   /* Get array */
3870552f7358SJed Brown   ierr = VecGetArray(v, &array);CHKERRQ(ierr);
38711a271a75SMatthew G. Knepley   /* Get values */
3872ef90cfe2SMatthew G. Knepley   if (numFields > 0) {
38731a271a75SMatthew G. Knepley     PetscInt offset = 0, fcomp, f;
3874552f7358SJed Brown     for (f = 0; f < numFields; ++f) {
38751a271a75SMatthew G. Knepley       ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
3876552f7358SJed Brown       switch (mode) {
3877552f7358SJed Brown       case INSERT_VALUES:
3878552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
38791a271a75SMatthew G. Knepley           const PetscInt point = points[p];
38801a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
38811a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array);
3882552f7358SJed Brown         } break;
3883552f7358SJed Brown       case INSERT_ALL_VALUES:
3884552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
38851a271a75SMatthew G. Knepley           const PetscInt point = points[p];
38861a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
38871a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array);
3888552f7358SJed Brown         } break;
3889a5e93ea8SMatthew G. Knepley       case INSERT_BC_VALUES:
3890a5e93ea8SMatthew G. Knepley         for (p = 0; p < numPoints*2; p += 2) {
38911a271a75SMatthew G. Knepley           const PetscInt point = points[p];
38921a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
38931a271a75SMatthew G. Knepley           updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array);
3894a5e93ea8SMatthew G. Knepley         } break;
3895552f7358SJed Brown       case ADD_VALUES:
3896552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
38971a271a75SMatthew G. Knepley           const PetscInt point = points[p];
38981a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
38991a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array);
3900552f7358SJed Brown         } break;
3901552f7358SJed Brown       case ADD_ALL_VALUES:
3902552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
39031a271a75SMatthew G. Knepley           const PetscInt point = points[p];
39041a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
39051a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array);
3906552f7358SJed Brown         } break;
3907552f7358SJed Brown       default:
390882f516ccSBarry Smith         SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
3909552f7358SJed Brown       }
39101a271a75SMatthew G. Knepley     }
3911552f7358SJed Brown   } else {
39121a271a75SMatthew G. Knepley     PetscInt dof, off;
39131a271a75SMatthew G. Knepley 
3914552f7358SJed Brown     switch (mode) {
3915552f7358SJed Brown     case INSERT_VALUES:
3916552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
3917552f7358SJed Brown         PetscInt o = points[p+1];
3918552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
3919552f7358SJed Brown         updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array);
3920552f7358SJed Brown       } break;
3921552f7358SJed Brown     case INSERT_ALL_VALUES:
3922552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
3923552f7358SJed Brown         PetscInt o = points[p+1];
3924552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
3925552f7358SJed Brown         updatePoint_private(section, points[p], dof, insert, PETSC_TRUE,  o, &values[off], array);
3926552f7358SJed Brown       } break;
3927a5e93ea8SMatthew G. Knepley     case INSERT_BC_VALUES:
3928a5e93ea8SMatthew G. Knepley       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
3929a5e93ea8SMatthew G. Knepley         PetscInt o = points[p+1];
3930a5e93ea8SMatthew G. Knepley         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
3931a5e93ea8SMatthew G. Knepley         updatePointBC_private(section, points[p], dof, insert,  o, &values[off], array);
3932a5e93ea8SMatthew G. Knepley       } break;
3933552f7358SJed Brown     case ADD_VALUES:
3934552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
3935552f7358SJed Brown         PetscInt o = points[p+1];
3936552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
3937552f7358SJed Brown         updatePoint_private(section, points[p], dof, add,    PETSC_FALSE, o, &values[off], array);
3938552f7358SJed Brown       } break;
3939552f7358SJed Brown     case ADD_ALL_VALUES:
3940552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
3941552f7358SJed Brown         PetscInt o = points[p+1];
3942552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
3943552f7358SJed Brown         updatePoint_private(section, points[p], dof, add,    PETSC_TRUE,  o, &values[off], array);
3944552f7358SJed Brown       } break;
3945552f7358SJed Brown     default:
394682f516ccSBarry Smith       SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
3947552f7358SJed Brown     }
3948552f7358SJed Brown   }
39491a271a75SMatthew G. Knepley   /* Cleanup points */
39501a271a75SMatthew G. Knepley   if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);}
39511a271a75SMatthew G. Knepley   else           {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);}
39521a271a75SMatthew G. Knepley   /* Cleanup array */
3953552f7358SJed Brown   ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
3954552f7358SJed Brown   PetscFunctionReturn(0);
3955552f7358SJed Brown }
3956552f7358SJed Brown 
3957552f7358SJed Brown #undef __FUNCT__
3958e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal"
3959e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode)
3960e07394fbSMatthew G. Knepley {
3961e07394fbSMatthew G. Knepley   PetscSection    clSection;
3962e07394fbSMatthew G. Knepley   IS              clPoints;
3963e07394fbSMatthew G. Knepley   PetscScalar    *array;
3964e07394fbSMatthew G. Knepley   PetscInt       *points = NULL;
3965e07394fbSMatthew G. Knepley   const PetscInt *clp;
3966e07394fbSMatthew G. Knepley   PetscInt        numFields, numPoints, p;
3967e07394fbSMatthew G. Knepley   PetscInt        offset = 0, fcomp, f;
3968e07394fbSMatthew G. Knepley   PetscErrorCode  ierr;
3969e07394fbSMatthew G. Knepley 
3970e07394fbSMatthew G. Knepley   PetscFunctionBeginHot;
3971e07394fbSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3972e07394fbSMatthew G. Knepley   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
3973e07394fbSMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
3974e07394fbSMatthew G. Knepley   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
3975e07394fbSMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
3976e07394fbSMatthew G. Knepley   /* Get points */
3977e07394fbSMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr);
3978e07394fbSMatthew G. Knepley   if (!clPoints) {
3979e07394fbSMatthew G. Knepley     PetscInt pStart, pEnd, q;
3980e07394fbSMatthew G. Knepley 
3981e07394fbSMatthew G. Knepley     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3982e07394fbSMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3983e07394fbSMatthew G. Knepley     /* Compress out points not in the section */
3984e07394fbSMatthew G. Knepley     for (p = 0, q = 0; p < numPoints*2; p += 2) {
3985e07394fbSMatthew G. Knepley       if ((points[p] >= pStart) && (points[p] < pEnd)) {
3986e07394fbSMatthew G. Knepley         points[q*2]   = points[p];
3987e07394fbSMatthew G. Knepley         points[q*2+1] = points[p+1];
3988e07394fbSMatthew G. Knepley         ++q;
3989e07394fbSMatthew G. Knepley       }
3990e07394fbSMatthew G. Knepley     }
3991e07394fbSMatthew G. Knepley     numPoints = q;
3992e07394fbSMatthew G. Knepley   } else {
3993e07394fbSMatthew G. Knepley     PetscInt dof, off;
3994e07394fbSMatthew G. Knepley 
3995e07394fbSMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
3996e07394fbSMatthew G. Knepley     ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
3997e07394fbSMatthew G. Knepley     ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr);
3998e07394fbSMatthew G. Knepley     numPoints = dof/2;
3999e07394fbSMatthew G. Knepley     points    = (PetscInt *) &clp[off];
4000e07394fbSMatthew G. Knepley   }
4001e07394fbSMatthew G. Knepley   /* Get array */
4002e07394fbSMatthew G. Knepley   ierr = VecGetArray(v, &array);CHKERRQ(ierr);
4003e07394fbSMatthew G. Knepley   /* Get values */
4004e07394fbSMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
4005e07394fbSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
4006e07394fbSMatthew G. Knepley     if (!fieldActive[f]) {
4007e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4008e07394fbSMatthew G. Knepley         PetscInt fdof;
4009e07394fbSMatthew G. Knepley         ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
4010e07394fbSMatthew G. Knepley         offset += fdof;
4011e07394fbSMatthew G. Knepley       }
4012e07394fbSMatthew G. Knepley       continue;
4013e07394fbSMatthew G. Knepley     }
4014e07394fbSMatthew G. Knepley     switch (mode) {
4015e07394fbSMatthew G. Knepley     case INSERT_VALUES:
4016e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4017e07394fbSMatthew G. Knepley         const PetscInt point = points[p];
4018e07394fbSMatthew G. Knepley         const PetscInt o     = points[p+1];
4019e07394fbSMatthew G. Knepley         updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array);
4020e07394fbSMatthew G. Knepley       } break;
4021e07394fbSMatthew G. Knepley     case INSERT_ALL_VALUES:
4022e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4023e07394fbSMatthew G. Knepley         const PetscInt point = points[p];
4024e07394fbSMatthew G. Knepley         const PetscInt o     = points[p+1];
4025e07394fbSMatthew G. Knepley         updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array);
4026e07394fbSMatthew G. Knepley         } break;
4027e07394fbSMatthew G. Knepley     case INSERT_BC_VALUES:
4028e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4029e07394fbSMatthew G. Knepley         const PetscInt point = points[p];
4030e07394fbSMatthew G. Knepley         const PetscInt o     = points[p+1];
4031e07394fbSMatthew G. Knepley         updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array);
4032e07394fbSMatthew G. Knepley       } break;
4033e07394fbSMatthew G. Knepley     case ADD_VALUES:
4034e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4035e07394fbSMatthew G. Knepley         const PetscInt point = points[p];
4036e07394fbSMatthew G. Knepley         const PetscInt o     = points[p+1];
4037e07394fbSMatthew G. Knepley         updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array);
4038e07394fbSMatthew G. Knepley       } break;
4039e07394fbSMatthew G. Knepley     case ADD_ALL_VALUES:
4040e07394fbSMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
4041e07394fbSMatthew G. Knepley         const PetscInt point = points[p];
4042e07394fbSMatthew G. Knepley         const PetscInt o     = points[p+1];
4043e07394fbSMatthew G. Knepley         updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array);
4044e07394fbSMatthew G. Knepley       } break;
4045e07394fbSMatthew G. Knepley     default:
4046e07394fbSMatthew G. Knepley       SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
4047e07394fbSMatthew G. Knepley     }
4048e07394fbSMatthew G. Knepley   }
4049e07394fbSMatthew G. Knepley   /* Cleanup points */
4050e07394fbSMatthew G. Knepley   if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);}
4051e07394fbSMatthew G. Knepley   else           {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);}
4052e07394fbSMatthew G. Knepley   /* Cleanup array */
4053e07394fbSMatthew G. Knepley   ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
4054e07394fbSMatthew G. Knepley   PetscFunctionReturn(0);
4055e07394fbSMatthew G. Knepley }
4056e07394fbSMatthew G. Knepley 
4057e07394fbSMatthew G. Knepley #undef __FUNCT__
4058552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues"
4059b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[])
4060552f7358SJed Brown {
4061552f7358SJed Brown   PetscMPIInt    rank;
4062552f7358SJed Brown   PetscInt       i, j;
4063552f7358SJed Brown   PetscErrorCode ierr;
4064552f7358SJed Brown 
4065552f7358SJed Brown   PetscFunctionBegin;
406682f516ccSBarry Smith   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr);
406777a6746dSMatthew G Knepley   ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr);
4068b0ecff45SMatthew G. Knepley   for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);}
4069b0ecff45SMatthew G. Knepley   for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);}
4070b0ecff45SMatthew G. Knepley   numCIndices = numCIndices ? numCIndices : numRIndices;
4071b0ecff45SMatthew G. Knepley   for (i = 0; i < numRIndices; i++) {
407277a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr);
4073b0ecff45SMatthew G. Knepley     for (j = 0; j < numCIndices; j++) {
4074519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX)
40757eba1a17SMatthew G. Knepley       ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr);
4076552f7358SJed Brown #else
4077b0ecff45SMatthew G. Knepley       ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr);
4078552f7358SJed Brown #endif
4079552f7358SJed Brown     }
408077a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
4081552f7358SJed Brown   }
4082552f7358SJed Brown   PetscFunctionReturn(0);
4083552f7358SJed Brown }
4084552f7358SJed Brown 
4085552f7358SJed Brown #undef __FUNCT__
4086552f7358SJed Brown #define __FUNCT__ "indicesPoint_private"
4087552f7358SJed Brown /* . off - The global offset of this point */
4088e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[])
4089a6dfd86eSKarl Rupp {
4090e6ccafaeSMatthew G Knepley   PetscInt        dof;    /* The number of unknowns on this point */
4091552f7358SJed Brown   PetscInt        cdof;   /* The number of constraints on this point */
4092552f7358SJed Brown   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
4093552f7358SJed Brown   PetscInt        cind = 0, k;
4094552f7358SJed Brown   PetscErrorCode  ierr;
4095552f7358SJed Brown 
4096552f7358SJed Brown   PetscFunctionBegin;
4097552f7358SJed Brown   ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
4098552f7358SJed Brown   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
4099552f7358SJed Brown   if (!cdof || setBC) {
4100552f7358SJed Brown     if (orientation >= 0) {
4101e6ccafaeSMatthew G Knepley       for (k = 0; k < dof; ++k) indices[*loff+k] = off+k;
4102552f7358SJed Brown     } else {
4103e6ccafaeSMatthew G Knepley       for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k;
4104552f7358SJed Brown     }
4105552f7358SJed Brown   } else {
4106552f7358SJed Brown     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
4107552f7358SJed Brown     if (orientation >= 0) {
4108552f7358SJed Brown       for (k = 0; k < dof; ++k) {
4109552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {
4110552f7358SJed Brown           /* Insert check for returning constrained indices */
4111e6ccafaeSMatthew G Knepley           indices[*loff+k] = -(off+k+1);
4112552f7358SJed Brown           ++cind;
4113552f7358SJed Brown         } else {
4114e6ccafaeSMatthew G Knepley           indices[*loff+k] = off+k-cind;
4115552f7358SJed Brown         }
4116552f7358SJed Brown       }
4117552f7358SJed Brown     } else {
4118552f7358SJed Brown       for (k = 0; k < dof; ++k) {
4119552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {
4120552f7358SJed Brown           /* Insert check for returning constrained indices */
4121e6ccafaeSMatthew G Knepley           indices[*loff+dof-k-1] = -(off+k+1);
4122552f7358SJed Brown           ++cind;
4123552f7358SJed Brown         } else {
4124e6ccafaeSMatthew G Knepley           indices[*loff+dof-k-1] = off+k-cind;
4125552f7358SJed Brown         }
4126552f7358SJed Brown       }
4127552f7358SJed Brown     }
4128552f7358SJed Brown   }
4129e6ccafaeSMatthew G Knepley   *loff += dof;
4130552f7358SJed Brown   PetscFunctionReturn(0);
4131552f7358SJed Brown }
4132552f7358SJed Brown 
4133552f7358SJed Brown #undef __FUNCT__
4134552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private"
4135552f7358SJed Brown /* . off - The global offset of this point */
4136a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[])
4137a6dfd86eSKarl Rupp {
4138552f7358SJed Brown   PetscInt       numFields, foff, f;
4139552f7358SJed Brown   PetscErrorCode ierr;
4140552f7358SJed Brown 
4141552f7358SJed Brown   PetscFunctionBegin;
4142552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4143552f7358SJed Brown   for (f = 0, foff = 0; f < numFields; ++f) {
4144552f7358SJed Brown     PetscInt        fdof, fcomp, cfdof;
4145552f7358SJed Brown     const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
4146552f7358SJed Brown     PetscInt        cind = 0, k, c;
4147552f7358SJed Brown 
4148552f7358SJed Brown     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
4149552f7358SJed Brown     ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
4150552f7358SJed Brown     ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr);
4151552f7358SJed Brown     if (!cfdof || setBC) {
4152552f7358SJed Brown       if (orientation >= 0) {
41530d644c17SKarl Rupp         for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k;
4154552f7358SJed Brown       } else {
4155552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
4156552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
4157552f7358SJed Brown             indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c;
4158552f7358SJed Brown           }
4159552f7358SJed Brown         }
4160552f7358SJed Brown       }
4161552f7358SJed Brown     } else {
4162552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
4163552f7358SJed Brown       if (orientation >= 0) {
4164552f7358SJed Brown         for (k = 0; k < fdof; ++k) {
4165552f7358SJed Brown           if ((cind < cfdof) && (k == fcdofs[cind])) {
4166552f7358SJed Brown             indices[foffs[f]+k] = -(off+foff+k+1);
4167552f7358SJed Brown             ++cind;
4168552f7358SJed Brown           } else {
4169552f7358SJed Brown             indices[foffs[f]+k] = off+foff+k-cind;
4170552f7358SJed Brown           }
4171552f7358SJed Brown         }
4172552f7358SJed Brown       } else {
4173552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
4174552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
4175552f7358SJed Brown             if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) {
4176552f7358SJed Brown               indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1);
4177552f7358SJed Brown               ++cind;
4178552f7358SJed Brown             } else {
4179552f7358SJed Brown               indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind;
4180552f7358SJed Brown             }
4181552f7358SJed Brown           }
4182552f7358SJed Brown         }
4183552f7358SJed Brown       }
4184552f7358SJed Brown     }
4185552f7358SJed Brown     foff     += fdof - cfdof;
4186552f7358SJed Brown     foffs[f] += fdof;
4187552f7358SJed Brown   }
4188552f7358SJed Brown   PetscFunctionReturn(0);
4189552f7358SJed Brown }
4190552f7358SJed Brown 
4191552f7358SJed Brown #undef __FUNCT__
4192f7c74593SToby Isaac #define __FUNCT__ "DMPlexAnchorsModifyMat"
4193f7c74593SToby 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[])
4194d3d1a6afSToby Isaac {
4195d3d1a6afSToby Isaac   Mat             cMat;
4196d3d1a6afSToby Isaac   PetscSection    aSec, cSec;
4197d3d1a6afSToby Isaac   IS              aIS;
4198d3d1a6afSToby Isaac   PetscInt        aStart = -1, aEnd = -1;
4199d3d1a6afSToby Isaac   const PetscInt  *anchors;
4200e17c06e0SMatthew G. Knepley   PetscInt        numFields, f, p, q, newP = 0;
4201d3d1a6afSToby Isaac   PetscInt        newNumPoints = 0, newNumIndices = 0;
4202d3d1a6afSToby Isaac   PetscInt        *newPoints, *indices, *newIndices;
4203d3d1a6afSToby Isaac   PetscInt        maxAnchor, maxDof;
4204d3d1a6afSToby Isaac   PetscInt        newOffsets[32];
4205d3d1a6afSToby Isaac   PetscInt        *pointMatOffsets[32];
4206d3d1a6afSToby Isaac   PetscInt        *newPointOffsets[32];
4207d3d1a6afSToby Isaac   PetscScalar     *pointMat[32];
4208d3d1a6afSToby Isaac   PetscScalar     *newValues,*tmpValues;
4209d3d1a6afSToby Isaac   PetscBool       anyConstrained = PETSC_FALSE;
4210d3d1a6afSToby Isaac   PetscErrorCode  ierr;
4211d3d1a6afSToby Isaac 
4212d3d1a6afSToby Isaac   PetscFunctionBegin;
4213d3d1a6afSToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4214d3d1a6afSToby Isaac   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
4215d3d1a6afSToby Isaac   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4216d3d1a6afSToby Isaac 
4217a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr);
4218d3d1a6afSToby Isaac   /* if there are point-to-point constraints */
4219d3d1a6afSToby Isaac   if (aSec) {
4220d3d1a6afSToby Isaac     ierr = PetscMemzero(newOffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
4221d3d1a6afSToby Isaac     ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr);
4222d3d1a6afSToby Isaac     ierr = PetscSectionGetChart(aSec,&aStart,&aEnd);CHKERRQ(ierr);
4223d3d1a6afSToby Isaac     /* figure out how many points are going to be in the new element matrix
4224d3d1a6afSToby Isaac      * (we allow double counting, because it's all just going to be summed
4225d3d1a6afSToby Isaac      * into the global matrix anyway) */
4226d3d1a6afSToby Isaac     for (p = 0; p < 2*numPoints; p+=2) {
4227d3d1a6afSToby Isaac       PetscInt b    = points[p];
4228d3d1a6afSToby Isaac       PetscInt bDof = 0;
4229d3d1a6afSToby Isaac 
4230d3d1a6afSToby Isaac       if (b >= aStart && b < aEnd) {
4231d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(aSec,b,&bDof);CHKERRQ(ierr);
4232d3d1a6afSToby Isaac       }
4233d3d1a6afSToby Isaac       if (bDof) {
4234d3d1a6afSToby Isaac         /* this point is constrained */
4235d3d1a6afSToby Isaac         /* it is going to be replaced by its anchors */
4236d3d1a6afSToby Isaac         PetscInt bOff, q;
4237d3d1a6afSToby Isaac 
4238d3d1a6afSToby Isaac         anyConstrained = PETSC_TRUE;
4239d3d1a6afSToby Isaac         newNumPoints  += bDof;
4240d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset(aSec,b,&bOff);CHKERRQ(ierr);
4241d3d1a6afSToby Isaac         for (q = 0; q < bDof; q++) {
4242d3d1a6afSToby Isaac           PetscInt a = anchors[bOff + q];
4243d3d1a6afSToby Isaac           PetscInt aDof;
4244d3d1a6afSToby Isaac 
4245d3d1a6afSToby Isaac           ierr           = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr);
4246d3d1a6afSToby Isaac           newNumIndices += aDof;
4247d3d1a6afSToby Isaac           for (f = 0; f < numFields; ++f) {
4248d3d1a6afSToby Isaac             PetscInt fDof;
4249d3d1a6afSToby Isaac 
4250d3d1a6afSToby Isaac             ierr             = PetscSectionGetFieldDof(section, a, f, &fDof);CHKERRQ(ierr);
4251d3d1a6afSToby Isaac             newOffsets[f+1] += fDof;
4252d3d1a6afSToby Isaac           }
4253d3d1a6afSToby Isaac         }
4254d3d1a6afSToby Isaac       }
4255d3d1a6afSToby Isaac       else {
4256d3d1a6afSToby Isaac         /* this point is not constrained */
4257d3d1a6afSToby Isaac         newNumPoints++;
4258d3d1a6afSToby Isaac         ierr           = PetscSectionGetDof(section,b,&bDof);CHKERRQ(ierr);
4259d3d1a6afSToby Isaac         newNumIndices += bDof;
4260d3d1a6afSToby Isaac         for (f = 0; f < numFields; ++f) {
4261d3d1a6afSToby Isaac           PetscInt fDof;
4262d3d1a6afSToby Isaac 
4263d3d1a6afSToby Isaac           ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr);
4264d3d1a6afSToby Isaac           newOffsets[f+1] += fDof;
4265d3d1a6afSToby Isaac         }
4266d3d1a6afSToby Isaac       }
4267d3d1a6afSToby Isaac     }
4268d3d1a6afSToby Isaac   }
4269d3d1a6afSToby Isaac   if (!anyConstrained) {
4270d3d1a6afSToby Isaac     *outNumPoints  = 0;
4271d3d1a6afSToby Isaac     *outNumIndices = 0;
4272d3d1a6afSToby Isaac     *outPoints     = NULL;
4273d3d1a6afSToby Isaac     *outValues     = NULL;
4274d3d1a6afSToby Isaac     if (aSec) {
4275d3d1a6afSToby Isaac       ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr);
4276d3d1a6afSToby Isaac     }
4277d3d1a6afSToby Isaac     PetscFunctionReturn(0);
4278d3d1a6afSToby Isaac   }
4279d3d1a6afSToby Isaac 
4280d3d1a6afSToby Isaac   for (f = 1; f < numFields; ++f) newOffsets[f+1] += newOffsets[f];
4281d3d1a6afSToby Isaac 
4282d3d1a6afSToby Isaac   if (numFields && newOffsets[numFields] != newNumIndices) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", newOffsets[numFields], newNumIndices);
4283d3d1a6afSToby Isaac 
4284f7c74593SToby Isaac   ierr = DMGetDefaultConstraints(dm, &cSec, &cMat);CHKERRQ(ierr);
4285d3d1a6afSToby Isaac 
4286d3d1a6afSToby Isaac   /* output arrays */
4287d3d1a6afSToby Isaac   ierr = DMGetWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr);
4288d3d1a6afSToby Isaac   ierr = DMGetWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr);
4289d3d1a6afSToby Isaac 
4290d3d1a6afSToby Isaac   /* workspaces */
4291d3d1a6afSToby Isaac   ierr = DMGetWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr);
4292d3d1a6afSToby Isaac   if (numFields) {
4293d3d1a6afSToby Isaac     for (f = 0; f < numFields; f++) {
4294d3d1a6afSToby Isaac       ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr);
4295d3d1a6afSToby Isaac       ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr);
4296d3d1a6afSToby Isaac     }
4297d3d1a6afSToby Isaac   }
4298d3d1a6afSToby Isaac   else {
4299d3d1a6afSToby Isaac     ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr);
4300d3d1a6afSToby Isaac     ierr = DMGetWorkArray(dm,numPoints,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr);
4301d3d1a6afSToby Isaac   }
4302d3d1a6afSToby Isaac 
4303d3d1a6afSToby Isaac   /* get workspaces for the point-to-point matrices */
4304d3d1a6afSToby Isaac   if (numFields) {
4305d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4306d3d1a6afSToby Isaac       PetscInt b    = points[2*p];
4307d3d1a6afSToby Isaac       PetscInt bDof = 0;
4308d3d1a6afSToby Isaac 
4309d3d1a6afSToby Isaac       if (b >= aStart && b < aEnd) {
4310d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr);
4311d3d1a6afSToby Isaac       }
4312d3d1a6afSToby Isaac       if (bDof) {
4313d3d1a6afSToby Isaac         for (f = 0; f < numFields; f++) {
4314d3d1a6afSToby Isaac           PetscInt fDof, q, bOff, allFDof = 0;
4315d3d1a6afSToby Isaac 
4316d3d1a6afSToby Isaac           ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr);
4317d3d1a6afSToby Isaac           ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr);
4318d3d1a6afSToby Isaac           for (q = 0; q < bDof; q++) {
4319d3d1a6afSToby Isaac             PetscInt a = anchors[bOff + q];
4320d3d1a6afSToby Isaac             PetscInt aFDof;
4321d3d1a6afSToby Isaac 
4322d3d1a6afSToby Isaac             ierr     = PetscSectionGetFieldDof(section, a, f, &aFDof);CHKERRQ(ierr);
4323d3d1a6afSToby Isaac             allFDof += aFDof;
4324d3d1a6afSToby Isaac           }
4325d3d1a6afSToby Isaac           newPointOffsets[f][p+1] = allFDof;
4326d3d1a6afSToby Isaac           pointMatOffsets[f][p+1] = fDof * allFDof;
4327d3d1a6afSToby Isaac         }
4328d3d1a6afSToby Isaac       }
4329d3d1a6afSToby Isaac       else {
4330d3d1a6afSToby Isaac         for (f = 0; f < numFields; f++) {
4331d3d1a6afSToby Isaac           PetscInt fDof;
4332d3d1a6afSToby Isaac 
4333d3d1a6afSToby Isaac           ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr);
4334d3d1a6afSToby Isaac           newPointOffsets[f][p+1] = fDof;
4335d3d1a6afSToby Isaac           pointMatOffsets[f][p+1] = 0;
4336d3d1a6afSToby Isaac         }
4337d3d1a6afSToby Isaac       }
4338d3d1a6afSToby Isaac     }
4339d3d1a6afSToby Isaac     for (f = 0; f < numFields; f++) {
4340d3d1a6afSToby Isaac       newPointOffsets[f][0] = 0;
4341d3d1a6afSToby Isaac       pointMatOffsets[f][0] = 0;
4342d3d1a6afSToby Isaac       for (p = 0; p < numPoints; p++) {
4343d3d1a6afSToby Isaac         newPointOffsets[f][p+1] += newPointOffsets[f][p];
4344d3d1a6afSToby Isaac         pointMatOffsets[f][p+1] += pointMatOffsets[f][p];
4345d3d1a6afSToby Isaac       }
4346d3d1a6afSToby Isaac       ierr = DMGetWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr);
4347d3d1a6afSToby Isaac     }
4348d3d1a6afSToby Isaac   }
4349d3d1a6afSToby Isaac   else {
4350d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4351d3d1a6afSToby Isaac       PetscInt b    = points[2*p];
4352d3d1a6afSToby Isaac       PetscInt bDof = 0;
4353d3d1a6afSToby Isaac 
4354d3d1a6afSToby Isaac       if (b >= aStart && b < aEnd) {
4355d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr);
4356d3d1a6afSToby Isaac       }
4357d3d1a6afSToby Isaac       if (bDof) {
4358d3d1a6afSToby Isaac         PetscInt dof, bOff, q, allDof = 0;
4359d3d1a6afSToby Isaac 
4360d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr);
4361d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr);
4362d3d1a6afSToby Isaac         for (q = 0; q < bDof; q++) {
4363d3d1a6afSToby Isaac           PetscInt a = anchors[bOff + q], aDof;
4364d3d1a6afSToby Isaac 
4365d3d1a6afSToby Isaac           ierr    = PetscSectionGetDof(section, a, &aDof);CHKERRQ(ierr);
4366d3d1a6afSToby Isaac           allDof += aDof;
4367d3d1a6afSToby Isaac         }
4368d3d1a6afSToby Isaac         newPointOffsets[0][p+1] = allDof;
4369d3d1a6afSToby Isaac         pointMatOffsets[0][p+1] = dof * allDof;
4370d3d1a6afSToby Isaac       }
4371d3d1a6afSToby Isaac       else {
4372d3d1a6afSToby Isaac         PetscInt dof;
4373d3d1a6afSToby Isaac 
4374d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr);
4375d3d1a6afSToby Isaac         newPointOffsets[0][p+1] = dof;
4376d3d1a6afSToby Isaac         pointMatOffsets[0][p+1] = 0;
4377d3d1a6afSToby Isaac       }
4378d3d1a6afSToby Isaac     }
4379d3d1a6afSToby Isaac     newPointOffsets[0][0] = 0;
4380d3d1a6afSToby Isaac     pointMatOffsets[0][0] = 0;
4381d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4382d3d1a6afSToby Isaac       newPointOffsets[0][p+1] += newPointOffsets[0][p];
4383d3d1a6afSToby Isaac       pointMatOffsets[0][p+1] += pointMatOffsets[0][p];
4384d3d1a6afSToby Isaac     }
4385d3d1a6afSToby Isaac     ierr = DMGetWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr);
4386d3d1a6afSToby Isaac   }
4387d3d1a6afSToby Isaac 
4388d3d1a6afSToby Isaac   /* get the point-to-point matrices; construct newPoints */
4389d3d1a6afSToby Isaac   ierr = PetscSectionGetMaxDof(aSec, &maxAnchor);CHKERRQ(ierr);
4390d3d1a6afSToby Isaac   ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
4391d3d1a6afSToby Isaac   ierr = DMGetWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr);
4392d3d1a6afSToby Isaac   ierr = DMGetWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr);
4393d3d1a6afSToby Isaac   if (numFields) {
4394d3d1a6afSToby Isaac     for (p = 0, newP = 0; p < numPoints; p++) {
4395d3d1a6afSToby Isaac       PetscInt b    = points[2*p];
4396d3d1a6afSToby Isaac       PetscInt o    = points[2*p+1];
4397d3d1a6afSToby Isaac       PetscInt bDof = 0;
4398d3d1a6afSToby Isaac 
4399d3d1a6afSToby Isaac       if (b >= aStart && b < aEnd) {
4400d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr);
4401d3d1a6afSToby Isaac       }
4402d3d1a6afSToby Isaac       if (bDof) {
4403d3d1a6afSToby Isaac         PetscInt fStart[32], fEnd[32], fAnchorStart[32], fAnchorEnd[32], bOff, q;
4404d3d1a6afSToby Isaac 
4405d3d1a6afSToby Isaac         fStart[0] = 0;
4406d3d1a6afSToby Isaac         fEnd[0]   = 0;
4407d3d1a6afSToby Isaac         for (f = 0; f < numFields; f++) {
4408d3d1a6afSToby Isaac           PetscInt fDof;
4409d3d1a6afSToby Isaac 
4410d3d1a6afSToby Isaac           ierr        = PetscSectionGetFieldDof(cSec, b, f, &fDof);CHKERRQ(ierr);
4411d3d1a6afSToby Isaac           fStart[f+1] = fStart[f] + fDof;
4412d3d1a6afSToby Isaac           fEnd[f+1]   = fStart[f+1];
4413d3d1a6afSToby Isaac         }
4414d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr);
4415d3d1a6afSToby Isaac         ierr = indicesPointFields_private(cSec, b, bOff, fEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr);
4416d3d1a6afSToby Isaac 
4417d3d1a6afSToby Isaac         fAnchorStart[0] = 0;
4418d3d1a6afSToby Isaac         fAnchorEnd[0]   = 0;
4419d3d1a6afSToby Isaac         for (f = 0; f < numFields; f++) {
4420d3d1a6afSToby Isaac           PetscInt fDof = newPointOffsets[f][p + 1] - newPointOffsets[f][p];
4421d3d1a6afSToby Isaac 
4422d3d1a6afSToby Isaac           fAnchorStart[f+1] = fAnchorStart[f] + fDof;
4423d3d1a6afSToby Isaac           fAnchorEnd[f+1]   = fAnchorStart[f + 1];
4424d3d1a6afSToby Isaac         }
4425d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr);
4426d3d1a6afSToby Isaac         for (q = 0; q < bDof; q++) {
4427d3d1a6afSToby Isaac           PetscInt a = anchors[bOff + q], aOff;
4428d3d1a6afSToby Isaac 
4429d3d1a6afSToby 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 */
4430d3d1a6afSToby Isaac           newPoints[2*(newP + q)]     = a;
4431d3d1a6afSToby Isaac           newPoints[2*(newP + q) + 1] = 0;
4432d3d1a6afSToby Isaac           ierr = PetscSectionGetOffset(section, a, &aOff);
4433d3d1a6afSToby Isaac           ierr = indicesPointFields_private(section, a, aOff, fAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr);
4434d3d1a6afSToby Isaac         }
4435d3d1a6afSToby Isaac         newP += bDof;
4436d3d1a6afSToby Isaac 
4437d3d1a6afSToby Isaac         /* get the point-to-point submatrix */
4438d3d1a6afSToby Isaac         for (f = 0; f < numFields; f++) {
4439d3d1a6afSToby 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);
4440d3d1a6afSToby Isaac         }
4441d3d1a6afSToby Isaac       }
4442d3d1a6afSToby Isaac       else {
4443d3d1a6afSToby Isaac         newPoints[2 * newP]     = b;
4444d3d1a6afSToby Isaac         newPoints[2 * newP + 1] = o;
4445d3d1a6afSToby Isaac         newP++;
4446d3d1a6afSToby Isaac       }
4447d3d1a6afSToby Isaac     }
4448d3d1a6afSToby Isaac   } else {
4449d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4450d3d1a6afSToby Isaac       PetscInt b    = points[2*p];
4451d3d1a6afSToby Isaac       PetscInt o    = points[2*p+1];
4452d3d1a6afSToby Isaac       PetscInt bDof = 0;
4453d3d1a6afSToby Isaac 
4454d3d1a6afSToby Isaac       if (b >= aStart && b < aEnd) {
4455d3d1a6afSToby Isaac         ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr);
4456d3d1a6afSToby Isaac       }
4457d3d1a6afSToby Isaac       if (bDof) {
4458d3d1a6afSToby Isaac         PetscInt bEnd = 0, bAnchorEnd = 0, bOff;
4459d3d1a6afSToby Isaac 
4460d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr);
4461d3d1a6afSToby Isaac         ierr = indicesPoint_private(cSec, b, bOff, &bEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr);
4462d3d1a6afSToby Isaac 
4463d3d1a6afSToby Isaac         ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr);
4464d3d1a6afSToby Isaac         for (q = 0; q < bDof; q++) {
4465d3d1a6afSToby Isaac           PetscInt a = anchors[bOff + q], aOff;
4466d3d1a6afSToby Isaac 
4467d3d1a6afSToby 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 */
4468d3d1a6afSToby Isaac 
4469d3d1a6afSToby Isaac           newPoints[2*(newP + q)]     = a;
4470d3d1a6afSToby Isaac           newPoints[2*(newP + q) + 1] = 0;
4471d3d1a6afSToby Isaac           ierr = PetscSectionGetOffset(section, a, &aOff);
4472d3d1a6afSToby Isaac           ierr = indicesPoint_private(section, a, aOff, &bAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr);
4473d3d1a6afSToby Isaac         }
4474d3d1a6afSToby Isaac         newP += bDof;
4475d3d1a6afSToby Isaac 
4476d3d1a6afSToby Isaac         /* get the point-to-point submatrix */
4477d3d1a6afSToby Isaac         ierr = MatGetValues(cMat,bEnd,indices,bAnchorEnd,newIndices,pointMat[0] + pointMatOffsets[0][p]);CHKERRQ(ierr);
4478d3d1a6afSToby Isaac       }
4479d3d1a6afSToby Isaac       else {
4480d3d1a6afSToby Isaac         newPoints[2 * newP]     = b;
4481d3d1a6afSToby Isaac         newPoints[2 * newP + 1] = o;
4482d3d1a6afSToby Isaac         newP++;
4483d3d1a6afSToby Isaac       }
4484d3d1a6afSToby Isaac     }
4485d3d1a6afSToby Isaac   }
4486d3d1a6afSToby Isaac 
4487d3d1a6afSToby Isaac   ierr = PetscMemzero(tmpValues,newNumIndices*numIndices*sizeof(*tmpValues));CHKERRQ(ierr);
4488d3d1a6afSToby Isaac   /* multiply constraints on the right */
4489d3d1a6afSToby Isaac   if (numFields) {
4490d3d1a6afSToby Isaac     for (f = 0; f < numFields; f++) {
4491d3d1a6afSToby Isaac       PetscInt oldOff = offsets[f];
4492d3d1a6afSToby Isaac 
4493d3d1a6afSToby Isaac       for (p = 0; p < numPoints; p++) {
4494d3d1a6afSToby Isaac         PetscInt cStart = newPointOffsets[f][p];
4495d3d1a6afSToby Isaac         PetscInt b      = points[2 * p];
4496d3d1a6afSToby Isaac         PetscInt c, r, k;
4497d3d1a6afSToby Isaac         PetscInt dof;
4498d3d1a6afSToby Isaac 
4499d3d1a6afSToby Isaac         ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr);
4500d3d1a6afSToby Isaac         if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) {
4501d3d1a6afSToby Isaac           PetscInt nCols         = newPointOffsets[f][p+1]-cStart;
4502d3d1a6afSToby Isaac           const PetscScalar *mat = pointMat[f] + pointMatOffsets[f][p];
4503d3d1a6afSToby Isaac 
4504d3d1a6afSToby Isaac           for (r = 0; r < numIndices; r++) {
4505d3d1a6afSToby Isaac             for (c = 0; c < nCols; c++) {
4506d3d1a6afSToby Isaac               for (k = 0; k < dof; k++) {
4507d3d1a6afSToby Isaac                 tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k];
4508d3d1a6afSToby Isaac               }
4509d3d1a6afSToby Isaac             }
4510d3d1a6afSToby Isaac           }
4511d3d1a6afSToby Isaac         }
4512d3d1a6afSToby Isaac         else {
4513d3d1a6afSToby Isaac           /* copy this column as is */
4514d3d1a6afSToby Isaac           for (r = 0; r < numIndices; r++) {
4515d3d1a6afSToby Isaac             for (c = 0; c < dof; c++) {
4516d3d1a6afSToby Isaac               tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c];
4517d3d1a6afSToby Isaac             }
4518d3d1a6afSToby Isaac           }
4519d3d1a6afSToby Isaac         }
4520d3d1a6afSToby Isaac         oldOff += dof;
4521d3d1a6afSToby Isaac       }
4522d3d1a6afSToby Isaac     }
4523d3d1a6afSToby Isaac   }
4524d3d1a6afSToby Isaac   else {
4525d3d1a6afSToby Isaac     PetscInt oldOff = 0;
4526d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4527d3d1a6afSToby Isaac       PetscInt cStart = newPointOffsets[0][p];
4528d3d1a6afSToby Isaac       PetscInt b      = points[2 * p];
4529d3d1a6afSToby Isaac       PetscInt c, r, k;
4530d3d1a6afSToby Isaac       PetscInt dof;
4531d3d1a6afSToby Isaac 
4532d3d1a6afSToby Isaac       ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr);
4533d3d1a6afSToby Isaac       if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) {
4534d3d1a6afSToby Isaac         PetscInt nCols         = newPointOffsets[0][p+1]-cStart;
4535d3d1a6afSToby Isaac         const PetscScalar *mat = pointMat[0] + pointMatOffsets[0][p];
4536d3d1a6afSToby Isaac 
4537d3d1a6afSToby Isaac         for (r = 0; r < numIndices; r++) {
4538d3d1a6afSToby Isaac           for (c = 0; c < nCols; c++) {
4539d3d1a6afSToby Isaac             for (k = 0; k < dof; k++) {
4540d3d1a6afSToby Isaac               tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k];
4541d3d1a6afSToby Isaac             }
4542d3d1a6afSToby Isaac           }
4543d3d1a6afSToby Isaac         }
4544d3d1a6afSToby Isaac       }
4545d3d1a6afSToby Isaac       else {
4546d3d1a6afSToby Isaac         /* copy this column as is */
4547d3d1a6afSToby Isaac         for (r = 0; r < numIndices; r++) {
4548d3d1a6afSToby Isaac           for (c = 0; c < dof; c++) {
4549d3d1a6afSToby Isaac             tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c];
4550d3d1a6afSToby Isaac           }
4551d3d1a6afSToby Isaac         }
4552d3d1a6afSToby Isaac       }
4553d3d1a6afSToby Isaac       oldOff += dof;
4554d3d1a6afSToby Isaac     }
4555d3d1a6afSToby Isaac   }
4556d3d1a6afSToby Isaac 
4557d3d1a6afSToby Isaac   ierr = PetscMemzero(newValues,newNumIndices*newNumIndices*sizeof(*newValues));CHKERRQ(ierr);
4558d3d1a6afSToby Isaac   /* multiply constraints transpose on the left */
4559d3d1a6afSToby Isaac   if (numFields) {
4560d3d1a6afSToby Isaac     for (f = 0; f < numFields; f++) {
4561d3d1a6afSToby Isaac       PetscInt oldOff = offsets[f];
4562d3d1a6afSToby Isaac 
4563d3d1a6afSToby Isaac       for (p = 0; p < numPoints; p++) {
4564d3d1a6afSToby Isaac         PetscInt rStart = newPointOffsets[f][p];
4565d3d1a6afSToby Isaac         PetscInt b      = points[2 * p];
4566d3d1a6afSToby Isaac         PetscInt c, r, k;
4567d3d1a6afSToby Isaac         PetscInt dof;
4568d3d1a6afSToby Isaac 
4569d3d1a6afSToby Isaac         ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr);
4570d3d1a6afSToby Isaac         if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) {
4571d3d1a6afSToby Isaac           PetscInt nRows                        = newPointOffsets[f][p+1]-rStart;
4572d3d1a6afSToby Isaac           const PetscScalar *PETSC_RESTRICT mat = pointMat[f] + pointMatOffsets[f][p];
4573d3d1a6afSToby Isaac 
4574d3d1a6afSToby Isaac           for (r = 0; r < nRows; r++) {
4575d3d1a6afSToby Isaac             for (c = 0; c < newNumIndices; c++) {
4576d3d1a6afSToby Isaac               for (k = 0; k < dof; k++) {
4577d3d1a6afSToby Isaac                 newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c];
4578d3d1a6afSToby Isaac               }
4579d3d1a6afSToby Isaac             }
4580d3d1a6afSToby Isaac           }
4581d3d1a6afSToby Isaac         }
4582d3d1a6afSToby Isaac         else {
4583d3d1a6afSToby Isaac           /* copy this row as is */
4584d3d1a6afSToby Isaac           for (r = 0; r < dof; r++) {
4585d3d1a6afSToby Isaac             for (c = 0; c < newNumIndices; c++) {
4586d3d1a6afSToby Isaac               newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c];
4587d3d1a6afSToby Isaac             }
4588d3d1a6afSToby Isaac           }
4589d3d1a6afSToby Isaac         }
4590d3d1a6afSToby Isaac         oldOff += dof;
4591d3d1a6afSToby Isaac       }
4592d3d1a6afSToby Isaac     }
4593d3d1a6afSToby Isaac   }
4594d3d1a6afSToby Isaac   else {
4595d3d1a6afSToby Isaac     PetscInt oldOff = 0;
4596d3d1a6afSToby Isaac 
4597d3d1a6afSToby Isaac     for (p = 0; p < numPoints; p++) {
4598d3d1a6afSToby Isaac       PetscInt rStart = newPointOffsets[0][p];
4599d3d1a6afSToby Isaac       PetscInt b      = points[2 * p];
4600d3d1a6afSToby Isaac       PetscInt c, r, k;
4601d3d1a6afSToby Isaac       PetscInt dof;
4602d3d1a6afSToby Isaac 
4603d3d1a6afSToby Isaac       ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr);
4604d3d1a6afSToby Isaac       if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) {
4605d3d1a6afSToby Isaac         PetscInt nRows                        = newPointOffsets[0][p+1]-rStart;
4606d3d1a6afSToby Isaac         const PetscScalar *PETSC_RESTRICT mat = pointMat[0] + pointMatOffsets[0][p];
4607d3d1a6afSToby Isaac 
4608d3d1a6afSToby Isaac         for (r = 0; r < nRows; r++) {
4609d3d1a6afSToby Isaac           for (c = 0; c < newNumIndices; c++) {
4610d3d1a6afSToby Isaac             for (k = 0; k < dof; k++) {
4611d3d1a6afSToby Isaac               newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c];
4612d3d1a6afSToby Isaac             }
4613d3d1a6afSToby Isaac           }
4614d3d1a6afSToby Isaac         }
4615d3d1a6afSToby Isaac       }
4616d3d1a6afSToby Isaac       else {
4617d3d1a6afSToby Isaac         /* copy this row as is */
4618d3d1a6afSToby Isaac         for (r = 0; r < dof; c++) {
4619d3d1a6afSToby Isaac           for (c = 0; c < newNumIndices; c++) {
4620d3d1a6afSToby Isaac             newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c];
4621d3d1a6afSToby Isaac           }
4622d3d1a6afSToby Isaac         }
4623d3d1a6afSToby Isaac       }
4624d3d1a6afSToby Isaac       oldOff += dof;
4625d3d1a6afSToby Isaac     }
4626d3d1a6afSToby Isaac   }
4627d3d1a6afSToby Isaac 
4628d3d1a6afSToby Isaac   /* clean up */
4629d3d1a6afSToby Isaac   ierr = DMRestoreWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr);
4630d3d1a6afSToby Isaac   ierr = DMRestoreWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr);
4631d3d1a6afSToby Isaac   if (numFields) {
4632d3d1a6afSToby Isaac     for (f = 0; f < numFields; f++) {
4633d3d1a6afSToby Isaac       ierr = DMRestoreWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr);
4634d3d1a6afSToby Isaac       ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr);
4635d3d1a6afSToby Isaac       ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr);
4636d3d1a6afSToby Isaac     }
4637d3d1a6afSToby Isaac   }
4638d3d1a6afSToby Isaac   else {
4639d3d1a6afSToby Isaac     ierr = DMRestoreWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr);
4640d3d1a6afSToby Isaac     ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr);
4641d3d1a6afSToby Isaac     ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr);
4642d3d1a6afSToby Isaac   }
4643d3d1a6afSToby Isaac   ierr = DMRestoreWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr);
4644d3d1a6afSToby Isaac   ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr);
4645d3d1a6afSToby Isaac 
4646d3d1a6afSToby Isaac   /* output */
4647d3d1a6afSToby Isaac   *outNumPoints  = newNumPoints;
4648d3d1a6afSToby Isaac   *outNumIndices = newNumIndices;
4649d3d1a6afSToby Isaac   *outPoints     = newPoints;
4650d3d1a6afSToby Isaac   *outValues     = newValues;
4651d3d1a6afSToby Isaac   for (f = 0; f < numFields; f++) {
4652d3d1a6afSToby Isaac     offsets[f] = newOffsets[f];
4653d3d1a6afSToby Isaac   }
4654d3d1a6afSToby Isaac   PetscFunctionReturn(0);
4655d3d1a6afSToby Isaac }
4656d3d1a6afSToby Isaac 
4657d3d1a6afSToby Isaac #undef __FUNCT__
4658552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure"
46597f5d1fdeSMatthew G. Knepley /*@C
46607f5d1fdeSMatthew G. Knepley   DMPlexMatSetClosure - Set an array of the values on the closure of 'point'
46617f5d1fdeSMatthew G. Knepley 
46627f5d1fdeSMatthew G. Knepley   Not collective
46637f5d1fdeSMatthew G. Knepley 
46647f5d1fdeSMatthew G. Knepley   Input Parameters:
46657f5d1fdeSMatthew G. Knepley + dm - The DM
4666ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section
4667ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section
46687f5d1fdeSMatthew G. Knepley . A - The matrix
46697f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM
46707f5d1fdeSMatthew G. Knepley . values - The array of values
46717f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions
46727f5d1fdeSMatthew G. Knepley 
46737f5d1fdeSMatthew G. Knepley   Fortran Notes:
46747f5d1fdeSMatthew G. Knepley   This routine is only available in Fortran 90, and you must include petsc.h90 in your code.
46757f5d1fdeSMatthew G. Knepley 
46767f5d1fdeSMatthew G. Knepley   Level: intermediate
46777f5d1fdeSMatthew G. Knepley 
46787f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure()
46797f5d1fdeSMatthew G. Knepley @*/
46807c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode)
4681552f7358SJed Brown {
4682552f7358SJed Brown   DM_Plex        *mesh   = (DM_Plex*) dm->data;
46831b406b76SMatthew G. Knepley   PetscSection    clSection;
46841b406b76SMatthew G. Knepley   IS              clPoints;
4685d3d1a6afSToby Isaac   PetscInt       *points = NULL, *newPoints;
46861b406b76SMatthew G. Knepley   const PetscInt *clp;
4687552f7358SJed Brown   PetscInt       *indices;
4688552f7358SJed Brown   PetscInt        offsets[32];
4689d3d1a6afSToby Isaac   PetscInt        numFields, numPoints, newNumPoints, numIndices, newNumIndices, dof, off, globalOff, pStart, pEnd, p, q, f;
4690d3d1a6afSToby Isaac   PetscScalar    *newValues;
4691552f7358SJed Brown   PetscErrorCode  ierr;
4692552f7358SJed Brown 
4693552f7358SJed Brown   PetscFunctionBegin;
4694552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4695ebd6d717SJed Brown   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
46963dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
4697ebd6d717SJed Brown   if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);}
46983dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3);
46993dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(A, MAT_CLASSID, 4);
4700552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
470182f516ccSBarry Smith   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
4702552f7358SJed Brown   ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
47031b406b76SMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr);
47041b406b76SMatthew G. Knepley   if (!clPoints) {
4705552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
4706552f7358SJed Brown     /* Compress out points not in the section */
4707552f7358SJed Brown     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
4708552f7358SJed Brown     for (p = 0, q = 0; p < numPoints*2; p += 2) {
4709552f7358SJed Brown       if ((points[p] >= pStart) && (points[p] < pEnd)) {
4710552f7358SJed Brown         points[q*2]   = points[p];
4711552f7358SJed Brown         points[q*2+1] = points[p+1];
4712552f7358SJed Brown         ++q;
4713552f7358SJed Brown       }
4714552f7358SJed Brown     }
4715552f7358SJed Brown     numPoints = q;
47161b406b76SMatthew G. Knepley   } else {
47171b406b76SMatthew G. Knepley     PetscInt dof, off;
47181b406b76SMatthew G. Knepley 
47191b406b76SMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
47201b406b76SMatthew G. Knepley     numPoints = dof/2;
47211b406b76SMatthew G. Knepley     ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
47221b406b76SMatthew G. Knepley     ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr);
47231b406b76SMatthew G. Knepley     points = (PetscInt *) &clp[off];
47241b406b76SMatthew G. Knepley   }
4725552f7358SJed Brown   for (p = 0, numIndices = 0; p < numPoints*2; p += 2) {
4726552f7358SJed Brown     PetscInt fdof;
4727552f7358SJed Brown 
4728552f7358SJed Brown     ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
4729552f7358SJed Brown     for (f = 0; f < numFields; ++f) {
4730552f7358SJed Brown       ierr          = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
4731552f7358SJed Brown       offsets[f+1] += fdof;
4732552f7358SJed Brown     }
4733552f7358SJed Brown     numIndices += dof;
4734552f7358SJed Brown   }
47350d644c17SKarl Rupp   for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f];
47360d644c17SKarl Rupp 
473782f516ccSBarry Smith   if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices);
4738f7c74593SToby Isaac   ierr = DMPlexAnchorsModifyMat(dm,section,numPoints,numIndices,points,values,&newNumPoints,&newNumIndices,&newPoints,&newValues,offsets);CHKERRQ(ierr);
4739d3d1a6afSToby Isaac   if (newNumPoints) {
4740d3d1a6afSToby Isaac     if (!clPoints) {
4741d3d1a6afSToby Isaac       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
4742d3d1a6afSToby Isaac     } else {
4743d3d1a6afSToby Isaac       ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);
4744d3d1a6afSToby Isaac     }
4745d3d1a6afSToby Isaac     numPoints  = newNumPoints;
4746d3d1a6afSToby Isaac     numIndices = newNumIndices;
4747d3d1a6afSToby Isaac     points     = newPoints;
4748d3d1a6afSToby Isaac     values     = newValues;
4749d3d1a6afSToby Isaac   }
4750552f7358SJed Brown   ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr);
4751552f7358SJed Brown   if (numFields) {
4752552f7358SJed Brown     for (p = 0; p < numPoints*2; p += 2) {
4753552f7358SJed Brown       PetscInt o = points[p+1];
4754552f7358SJed Brown       ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr);
4755552f7358SJed Brown       indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices);
4756552f7358SJed Brown     }
4757552f7358SJed Brown   } else {
4758e6ccafaeSMatthew G Knepley     for (p = 0, off = 0; p < numPoints*2; p += 2) {
4759552f7358SJed Brown       PetscInt o = points[p+1];
4760552f7358SJed Brown       ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr);
4761e6ccafaeSMatthew G Knepley       indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices);
4762552f7358SJed Brown     }
4763552f7358SJed Brown   }
4764b0ecff45SMatthew G. Knepley   if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);}
4765552f7358SJed Brown   ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode);
4766552f7358SJed Brown   if (ierr) {
4767552f7358SJed Brown     PetscMPIInt    rank;
4768552f7358SJed Brown     PetscErrorCode ierr2;
4769552f7358SJed Brown 
477082f516ccSBarry Smith     ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2);
477177a6746dSMatthew G Knepley     ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2);
4772b0ecff45SMatthew G. Knepley     ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2);
47736a415b8fSMatthew G Knepley     ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2);
4774552f7358SJed Brown     CHKERRQ(ierr);
4775552f7358SJed Brown   }
4776d3d1a6afSToby Isaac   if (newNumPoints) {
4777d3d1a6afSToby Isaac     ierr = DMRestoreWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr);
4778d3d1a6afSToby Isaac     ierr = DMRestoreWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr);
4779d3d1a6afSToby Isaac   }
4780d3d1a6afSToby Isaac   else {
47811b406b76SMatthew G. Knepley     if (!clPoints) {
4782552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
47831b406b76SMatthew G. Knepley     } else {
47841b406b76SMatthew G. Knepley       ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);
47851b406b76SMatthew G. Knepley     }
4786d3d1a6afSToby Isaac   }
4787552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr);
4788552f7358SJed Brown   PetscFunctionReturn(0);
4789552f7358SJed Brown }
4790552f7358SJed Brown 
4791552f7358SJed Brown #undef __FUNCT__
4792de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined"
4793de41b84cSMatthew 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)
4794de41b84cSMatthew G. Knepley {
4795de41b84cSMatthew G. Knepley   DM_Plex        *mesh   = (DM_Plex*) dmf->data;
4796de41b84cSMatthew G. Knepley   PetscInt       *fpoints = NULL, *ftotpoints = NULL;
4797de41b84cSMatthew G. Knepley   PetscInt       *cpoints = NULL;
4798de41b84cSMatthew G. Knepley   PetscInt       *findices, *cindices;
4799de41b84cSMatthew G. Knepley   PetscInt        foffsets[32], coffsets[32];
4800de41b84cSMatthew G. Knepley   CellRefiner     cellRefiner;
48014ca5e9f5SMatthew G. Knepley   PetscInt        numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f;
4802de41b84cSMatthew G. Knepley   PetscErrorCode  ierr;
4803de41b84cSMatthew G. Knepley 
4804de41b84cSMatthew G. Knepley   PetscFunctionBegin;
4805de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(dmf, DM_CLASSID, 1);
4806de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(dmc, DM_CLASSID, 4);
4807de41b84cSMatthew G. Knepley   if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);}
4808de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2);
4809de41b84cSMatthew G. Knepley   if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);}
4810de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5);
4811de41b84cSMatthew G. Knepley   if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);}
4812de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3);
4813de41b84cSMatthew G. Knepley   if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);}
4814de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6);
4815de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(A, MAT_CLASSID, 7);
4816de41b84cSMatthew G. Knepley   ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr);
4817de41b84cSMatthew G. Knepley   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
4818de41b84cSMatthew G. Knepley   ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
4819de41b84cSMatthew G. Knepley   ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
4820de41b84cSMatthew G. Knepley   /* Column indices */
4821de41b84cSMatthew G. Knepley   ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr);
48224ca5e9f5SMatthew G. Knepley   maxFPoints = numCPoints;
4823de41b84cSMatthew G. Knepley   /* Compress out points not in the section */
4824de41b84cSMatthew G. Knepley   /*   TODO: Squeeze out points with 0 dof as well */
4825de41b84cSMatthew G. Knepley   ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr);
4826de41b84cSMatthew G. Knepley   for (p = 0, q = 0; p < numCPoints*2; p += 2) {
4827de41b84cSMatthew G. Knepley     if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) {
4828de41b84cSMatthew G. Knepley       cpoints[q*2]   = cpoints[p];
4829de41b84cSMatthew G. Knepley       cpoints[q*2+1] = cpoints[p+1];
4830de41b84cSMatthew G. Knepley       ++q;
4831de41b84cSMatthew G. Knepley     }
4832de41b84cSMatthew G. Knepley   }
4833de41b84cSMatthew G. Knepley   numCPoints = q;
4834de41b84cSMatthew G. Knepley   for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) {
4835de41b84cSMatthew G. Knepley     PetscInt fdof;
4836de41b84cSMatthew G. Knepley 
4837de41b84cSMatthew G. Knepley     ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr);
48384ca5e9f5SMatthew G. Knepley     if (!dof) continue;
4839de41b84cSMatthew G. Knepley     for (f = 0; f < numFields; ++f) {
4840de41b84cSMatthew G. Knepley       ierr           = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr);
4841de41b84cSMatthew G. Knepley       coffsets[f+1] += fdof;
4842de41b84cSMatthew G. Knepley     }
4843de41b84cSMatthew G. Knepley     numCIndices += dof;
4844de41b84cSMatthew G. Knepley   }
4845de41b84cSMatthew G. Knepley   for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f];
4846de41b84cSMatthew G. Knepley   /* Row indices */
4847de41b84cSMatthew G. Knepley   ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr);
4848de41b84cSMatthew G. Knepley   ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr);
48491ba5f902SMatthew G. Knepley   ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr);
4850de41b84cSMatthew G. Knepley   for (r = 0, q = 0; r < numSubcells; ++r) {
4851de41b84cSMatthew G. Knepley     /* TODO Map from coarse to fine cells */
4852de41b84cSMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr);
4853de41b84cSMatthew G. Knepley     /* Compress out points not in the section */
4854de41b84cSMatthew G. Knepley     ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr);
4855de41b84cSMatthew G. Knepley     for (p = 0; p < numFPoints*2; p += 2) {
4856de41b84cSMatthew G. Knepley       if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) {
48574ca5e9f5SMatthew G. Knepley         ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr);
48584ca5e9f5SMatthew G. Knepley         if (!dof) continue;
48594ca5e9f5SMatthew G. Knepley         for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break;
48604ca5e9f5SMatthew G. Knepley         if (s < q) continue;
4861de41b84cSMatthew G. Knepley         ftotpoints[q*2]   = fpoints[p];
4862de41b84cSMatthew G. Knepley         ftotpoints[q*2+1] = fpoints[p+1];
4863de41b84cSMatthew G. Knepley         ++q;
4864de41b84cSMatthew G. Knepley       }
4865de41b84cSMatthew G. Knepley     }
4866de41b84cSMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr);
4867de41b84cSMatthew G. Knepley   }
4868de41b84cSMatthew G. Knepley   numFPoints = q;
4869de41b84cSMatthew G. Knepley   for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) {
4870de41b84cSMatthew G. Knepley     PetscInt fdof;
4871de41b84cSMatthew G. Knepley 
4872de41b84cSMatthew G. Knepley     ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr);
48734ca5e9f5SMatthew G. Knepley     if (!dof) continue;
4874de41b84cSMatthew G. Knepley     for (f = 0; f < numFields; ++f) {
4875de41b84cSMatthew G. Knepley       ierr           = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr);
4876de41b84cSMatthew G. Knepley       foffsets[f+1] += fdof;
4877de41b84cSMatthew G. Knepley     }
4878de41b84cSMatthew G. Knepley     numFIndices += dof;
4879de41b84cSMatthew G. Knepley   }
4880de41b84cSMatthew G. Knepley   for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f];
4881de41b84cSMatthew G. Knepley 
4882de41b84cSMatthew 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);
4883de41b84cSMatthew 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);
4884de41b84cSMatthew G. Knepley   ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr);
4885de41b84cSMatthew G. Knepley   ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr);
4886de41b84cSMatthew G. Knepley   if (numFields) {
4887de41b84cSMatthew G. Knepley     for (p = 0; p < numFPoints*2; p += 2) {
4888de41b84cSMatthew G. Knepley       PetscInt o = ftotpoints[p+1];
4889de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr);
4890de41b84cSMatthew G. Knepley       indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices);
4891de41b84cSMatthew G. Knepley     }
4892de41b84cSMatthew G. Knepley     for (p = 0; p < numCPoints*2; p += 2) {
4893de41b84cSMatthew G. Knepley       PetscInt o = cpoints[p+1];
4894de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr);
4895de41b84cSMatthew G. Knepley       indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices);
4896de41b84cSMatthew G. Knepley     }
4897de41b84cSMatthew G. Knepley   } else {
4898de41b84cSMatthew G. Knepley     for (p = 0, off = 0; p < numFPoints*2; p += 2) {
4899de41b84cSMatthew G. Knepley       PetscInt o = ftotpoints[p+1];
4900de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr);
4901de41b84cSMatthew G. Knepley       indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices);
4902de41b84cSMatthew G. Knepley     }
4903de41b84cSMatthew G. Knepley     for (p = 0, off = 0; p < numCPoints*2; p += 2) {
4904de41b84cSMatthew G. Knepley       PetscInt o = cpoints[p+1];
4905de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr);
4906de41b84cSMatthew G. Knepley       indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices);
4907de41b84cSMatthew G. Knepley     }
4908de41b84cSMatthew G. Knepley   }
4909de41b84cSMatthew G. Knepley   if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);}
4910de41b84cSMatthew G. Knepley   ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode);
4911de41b84cSMatthew G. Knepley   if (ierr) {
4912de41b84cSMatthew G. Knepley     PetscMPIInt    rank;
4913de41b84cSMatthew G. Knepley     PetscErrorCode ierr2;
4914de41b84cSMatthew G. Knepley 
4915de41b84cSMatthew G. Knepley     ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2);
4916de41b84cSMatthew G. Knepley     ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2);
4917de41b84cSMatthew G. Knepley     ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2);
4918de41b84cSMatthew G. Knepley     ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2);
4919de41b84cSMatthew G. Knepley     ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2);
4920de41b84cSMatthew G. Knepley     CHKERRQ(ierr);
4921de41b84cSMatthew G. Knepley   }
4922549a8adaSMatthew G. Knepley   ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr);
4923de41b84cSMatthew G. Knepley   ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr);
4924de41b84cSMatthew G. Knepley   ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr);
4925de41b84cSMatthew G. Knepley   ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr);
4926de41b84cSMatthew G. Knepley   PetscFunctionReturn(0);
4927de41b84cSMatthew G. Knepley }
4928de41b84cSMatthew G. Knepley 
4929de41b84cSMatthew G. Knepley #undef __FUNCT__
49307c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined"
49317c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[])
49327c927364SMatthew G. Knepley {
49337c927364SMatthew G. Knepley   PetscInt      *fpoints = NULL, *ftotpoints = NULL;
49347c927364SMatthew G. Knepley   PetscInt      *cpoints = NULL;
49357c927364SMatthew G. Knepley   PetscInt       foffsets[32], coffsets[32];
49367c927364SMatthew G. Knepley   CellRefiner    cellRefiner;
49377c927364SMatthew G. Knepley   PetscInt       numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f;
49387c927364SMatthew G. Knepley   PetscErrorCode ierr;
49397c927364SMatthew G. Knepley 
49407c927364SMatthew G. Knepley   PetscFunctionBegin;
49417c927364SMatthew G. Knepley   PetscValidHeaderSpecific(dmf, DM_CLASSID, 1);
49427c927364SMatthew G. Knepley   PetscValidHeaderSpecific(dmc, DM_CLASSID, 4);
49437c927364SMatthew G. Knepley   if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);}
49447c927364SMatthew G. Knepley   PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2);
49457c927364SMatthew G. Knepley   if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);}
49467c927364SMatthew G. Knepley   PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5);
49477c927364SMatthew G. Knepley   if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);}
49487c927364SMatthew G. Knepley   PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3);
49497c927364SMatthew G. Knepley   if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);}
49507c927364SMatthew G. Knepley   PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6);
49517c927364SMatthew G. Knepley   ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr);
49527c927364SMatthew G. Knepley   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
49537c927364SMatthew G. Knepley   ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
49547c927364SMatthew G. Knepley   ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
49557c927364SMatthew G. Knepley   /* Column indices */
49567c927364SMatthew G. Knepley   ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr);
49577c927364SMatthew G. Knepley   maxFPoints = numCPoints;
49587c927364SMatthew G. Knepley   /* Compress out points not in the section */
49597c927364SMatthew G. Knepley   /*   TODO: Squeeze out points with 0 dof as well */
49607c927364SMatthew G. Knepley   ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr);
49617c927364SMatthew G. Knepley   for (p = 0, q = 0; p < numCPoints*2; p += 2) {
49627c927364SMatthew G. Knepley     if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) {
49637c927364SMatthew G. Knepley       cpoints[q*2]   = cpoints[p];
49647c927364SMatthew G. Knepley       cpoints[q*2+1] = cpoints[p+1];
49657c927364SMatthew G. Knepley       ++q;
49667c927364SMatthew G. Knepley     }
49677c927364SMatthew G. Knepley   }
49687c927364SMatthew G. Knepley   numCPoints = q;
49697c927364SMatthew G. Knepley   for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) {
49707c927364SMatthew G. Knepley     PetscInt fdof;
49717c927364SMatthew G. Knepley 
49727c927364SMatthew G. Knepley     ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr);
49737c927364SMatthew G. Knepley     if (!dof) continue;
49747c927364SMatthew G. Knepley     for (f = 0; f < numFields; ++f) {
49757c927364SMatthew G. Knepley       ierr           = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr);
49767c927364SMatthew G. Knepley       coffsets[f+1] += fdof;
49777c927364SMatthew G. Knepley     }
49787c927364SMatthew G. Knepley     numCIndices += dof;
49797c927364SMatthew G. Knepley   }
49807c927364SMatthew G. Knepley   for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f];
49817c927364SMatthew G. Knepley   /* Row indices */
49827c927364SMatthew G. Knepley   ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr);
49837c927364SMatthew G. Knepley   ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr);
49847c927364SMatthew G. Knepley   ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr);
49857c927364SMatthew G. Knepley   for (r = 0, q = 0; r < numSubcells; ++r) {
49867c927364SMatthew G. Knepley     /* TODO Map from coarse to fine cells */
49877c927364SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr);
49887c927364SMatthew G. Knepley     /* Compress out points not in the section */
49897c927364SMatthew G. Knepley     ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr);
49907c927364SMatthew G. Knepley     for (p = 0; p < numFPoints*2; p += 2) {
49917c927364SMatthew G. Knepley       if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) {
49927c927364SMatthew G. Knepley         ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr);
49937c927364SMatthew G. Knepley         if (!dof) continue;
49947c927364SMatthew G. Knepley         for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break;
49957c927364SMatthew G. Knepley         if (s < q) continue;
49967c927364SMatthew G. Knepley         ftotpoints[q*2]   = fpoints[p];
49977c927364SMatthew G. Knepley         ftotpoints[q*2+1] = fpoints[p+1];
49987c927364SMatthew G. Knepley         ++q;
49997c927364SMatthew G. Knepley       }
50007c927364SMatthew G. Knepley     }
50017c927364SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr);
50027c927364SMatthew G. Knepley   }
50037c927364SMatthew G. Knepley   numFPoints = q;
50047c927364SMatthew G. Knepley   for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) {
50057c927364SMatthew G. Knepley     PetscInt fdof;
50067c927364SMatthew G. Knepley 
50077c927364SMatthew G. Knepley     ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr);
50087c927364SMatthew G. Knepley     if (!dof) continue;
50097c927364SMatthew G. Knepley     for (f = 0; f < numFields; ++f) {
50107c927364SMatthew G. Knepley       ierr           = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr);
50117c927364SMatthew G. Knepley       foffsets[f+1] += fdof;
50127c927364SMatthew G. Knepley     }
50137c927364SMatthew G. Knepley     numFIndices += dof;
50147c927364SMatthew G. Knepley   }
50157c927364SMatthew G. Knepley   for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f];
50167c927364SMatthew G. Knepley 
50177c927364SMatthew 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);
50187c927364SMatthew 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);
50197c927364SMatthew G. Knepley   if (numFields) {
50207c927364SMatthew G. Knepley     for (p = 0; p < numFPoints*2; p += 2) {
50217c927364SMatthew G. Knepley       PetscInt o = ftotpoints[p+1];
50227c927364SMatthew G. Knepley       ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr);
50237c927364SMatthew G. Knepley       indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices);
50247c927364SMatthew G. Knepley     }
50257c927364SMatthew G. Knepley     for (p = 0; p < numCPoints*2; p += 2) {
50267c927364SMatthew G. Knepley       PetscInt o = cpoints[p+1];
50277c927364SMatthew G. Knepley       ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr);
50287c927364SMatthew G. Knepley       indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices);
50297c927364SMatthew G. Knepley     }
50307c927364SMatthew G. Knepley   } else {
50317c927364SMatthew G. Knepley     for (p = 0, off = 0; p < numFPoints*2; p += 2) {
50327c927364SMatthew G. Knepley       PetscInt o = ftotpoints[p+1];
50337c927364SMatthew G. Knepley       ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr);
50347c927364SMatthew G. Knepley       indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices);
50357c927364SMatthew G. Knepley     }
50367c927364SMatthew G. Knepley     for (p = 0, off = 0; p < numCPoints*2; p += 2) {
50377c927364SMatthew G. Knepley       PetscInt o = cpoints[p+1];
50387c927364SMatthew G. Knepley       ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr);
50397c927364SMatthew G. Knepley       indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices);
50407c927364SMatthew G. Knepley     }
50417c927364SMatthew G. Knepley   }
50427c927364SMatthew G. Knepley   ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr);
50437c927364SMatthew G. Knepley   ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr);
50447c927364SMatthew G. Knepley   PetscFunctionReturn(0);
50457c927364SMatthew G. Knepley }
50467c927364SMatthew G. Knepley 
50477c927364SMatthew G. Knepley #undef __FUNCT__
5048770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds"
5049f96281f8SMatthew G. Knepley /*@
5050f96281f8SMatthew G. Knepley   DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid
5051f96281f8SMatthew G. Knepley 
5052f96281f8SMatthew G. Knepley   Input Parameter:
5053f96281f8SMatthew G. Knepley . dm - The DMPlex object
5054f96281f8SMatthew G. Knepley 
5055f96281f8SMatthew G. Knepley   Output Parameters:
5056f96281f8SMatthew G. Knepley + cMax - The first hybrid cell
5057dc5a3409SMatthew G. Knepley . fMax - The first hybrid face
5058dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge
5059dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex
5060f96281f8SMatthew G. Knepley 
5061f96281f8SMatthew G. Knepley   Level: developer
5062f96281f8SMatthew G. Knepley 
5063dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds()
5064f96281f8SMatthew G. Knepley @*/
5065770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax)
5066552f7358SJed Brown {
5067552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5068770b213bSMatthew G Knepley   PetscInt       dim;
5069770b213bSMatthew G Knepley   PetscErrorCode ierr;
5070552f7358SJed Brown 
5071552f7358SJed Brown   PetscFunctionBegin;
5072552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5073c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
5074770b213bSMatthew G Knepley   if (cMax) *cMax = mesh->hybridPointMax[dim];
5075770b213bSMatthew G Knepley   if (fMax) *fMax = mesh->hybridPointMax[dim-1];
5076770b213bSMatthew G Knepley   if (eMax) *eMax = mesh->hybridPointMax[1];
5077770b213bSMatthew G Knepley   if (vMax) *vMax = mesh->hybridPointMax[0];
5078552f7358SJed Brown   PetscFunctionReturn(0);
5079552f7358SJed Brown }
5080552f7358SJed Brown 
5081552f7358SJed Brown #undef __FUNCT__
5082770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds"
5083dc5a3409SMatthew G. Knepley /*@
5084dc5a3409SMatthew G. Knepley   DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid
5085dc5a3409SMatthew G. Knepley 
5086dc5a3409SMatthew G. Knepley   Input Parameters:
5087dc5a3409SMatthew G. Knepley . dm   - The DMPlex object
5088dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell
5089dc5a3409SMatthew G. Knepley . fMax - The first hybrid face
5090dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge
5091dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex
5092dc5a3409SMatthew G. Knepley 
5093dc5a3409SMatthew G. Knepley   Level: developer
5094dc5a3409SMatthew G. Knepley 
5095dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds()
5096dc5a3409SMatthew G. Knepley @*/
5097770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax)
5098552f7358SJed Brown {
5099552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5100770b213bSMatthew G Knepley   PetscInt       dim;
5101770b213bSMatthew G Knepley   PetscErrorCode ierr;
5102552f7358SJed Brown 
5103552f7358SJed Brown   PetscFunctionBegin;
5104552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5105c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
5106770b213bSMatthew G Knepley   if (cMax >= 0) mesh->hybridPointMax[dim]   = cMax;
5107770b213bSMatthew G Knepley   if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax;
5108770b213bSMatthew G Knepley   if (eMax >= 0) mesh->hybridPointMax[1]     = eMax;
5109770b213bSMatthew G Knepley   if (vMax >= 0) mesh->hybridPointMax[0]     = vMax;
5110552f7358SJed Brown   PetscFunctionReturn(0);
5111552f7358SJed Brown }
5112552f7358SJed Brown 
5113552f7358SJed Brown #undef __FUNCT__
5114552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight"
5115552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight)
5116552f7358SJed Brown {
5117552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
5118552f7358SJed Brown 
5119552f7358SJed Brown   PetscFunctionBegin;
5120552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5121552f7358SJed Brown   PetscValidPointer(cellHeight, 2);
5122552f7358SJed Brown   *cellHeight = mesh->vtkCellHeight;
5123552f7358SJed Brown   PetscFunctionReturn(0);
5124552f7358SJed Brown }
5125552f7358SJed Brown 
5126552f7358SJed Brown #undef __FUNCT__
5127552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight"
5128552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight)
5129552f7358SJed Brown {
5130552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
5131552f7358SJed Brown 
5132552f7358SJed Brown   PetscFunctionBegin;
5133552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5134552f7358SJed Brown   mesh->vtkCellHeight = cellHeight;
5135552f7358SJed Brown   PetscFunctionReturn(0);
5136552f7358SJed Brown }
5137552f7358SJed Brown 
5138552f7358SJed Brown #undef __FUNCT__
5139552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private"
5140552f7358SJed Brown /* We can easily have a form that takes an IS instead */
5141ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering)
5142552f7358SJed Brown {
5143552f7358SJed Brown   PetscSection   section, globalSection;
5144552f7358SJed Brown   PetscInt      *numbers, p;
5145552f7358SJed Brown   PetscErrorCode ierr;
5146552f7358SJed Brown 
5147552f7358SJed Brown   PetscFunctionBegin;
514882f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &section);CHKERRQ(ierr);
5149552f7358SJed Brown   ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr);
5150552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
5151552f7358SJed Brown     ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr);
5152552f7358SJed Brown   }
5153552f7358SJed Brown   ierr = PetscSectionSetUp(section);CHKERRQ(ierr);
5154552f7358SJed Brown   ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr);
5155785e854fSJed Brown   ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr);
5156552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
5157552f7358SJed Brown     ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr);
5158ef48cebcSMatthew G. Knepley     if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift;
5159ef48cebcSMatthew G. Knepley     else                       numbers[p-pStart] += shift;
5160552f7358SJed Brown   }
516182f516ccSBarry Smith   ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr);
5162ef48cebcSMatthew G. Knepley   if (globalSize) {
5163ef48cebcSMatthew G. Knepley     PetscLayout layout;
5164ef48cebcSMatthew G. Knepley     ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr);
5165ef48cebcSMatthew G. Knepley     ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr);
5166ef48cebcSMatthew G. Knepley     ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr);
5167ef48cebcSMatthew G. Knepley   }
5168552f7358SJed Brown   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
5169552f7358SJed Brown   ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr);
5170552f7358SJed Brown   PetscFunctionReturn(0);
5171552f7358SJed Brown }
5172552f7358SJed Brown 
5173552f7358SJed Brown #undef __FUNCT__
5174552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering"
5175552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers)
5176552f7358SJed Brown {
5177552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5178552f7358SJed Brown   PetscInt       cellHeight, cStart, cEnd, cMax;
5179552f7358SJed Brown   PetscErrorCode ierr;
5180552f7358SJed Brown 
5181552f7358SJed Brown   PetscFunctionBegin;
5182552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5183552f7358SJed Brown   if (!mesh->globalCellNumbers) {
5184552f7358SJed Brown     ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr);
5185552f7358SJed Brown     ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr);
51860298fd71SBarry Smith     ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
51870d644c17SKarl Rupp     if (cMax >= 0) cEnd = PetscMin(cEnd, cMax);
5188ef48cebcSMatthew G. Knepley     ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr);
5189552f7358SJed Brown   }
5190552f7358SJed Brown   *globalCellNumbers = mesh->globalCellNumbers;
5191552f7358SJed Brown   PetscFunctionReturn(0);
5192552f7358SJed Brown }
5193552f7358SJed Brown 
5194552f7358SJed Brown #undef __FUNCT__
5195552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering"
5196552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers)
5197552f7358SJed Brown {
5198552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5199552f7358SJed Brown   PetscInt       vStart, vEnd, vMax;
5200552f7358SJed Brown   PetscErrorCode ierr;
5201552f7358SJed Brown 
5202552f7358SJed Brown   PetscFunctionBegin;
5203552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5204552f7358SJed Brown   if (!mesh->globalVertexNumbers) {
5205552f7358SJed Brown     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
52060298fd71SBarry Smith     ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr);
52070d644c17SKarl Rupp     if (vMax >= 0) vEnd = PetscMin(vEnd, vMax);
5208ef48cebcSMatthew G. Knepley     ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr);
5209552f7358SJed Brown   }
5210552f7358SJed Brown   *globalVertexNumbers = mesh->globalVertexNumbers;
5211552f7358SJed Brown   PetscFunctionReturn(0);
5212552f7358SJed Brown }
5213552f7358SJed Brown 
5214ef48cebcSMatthew G. Knepley #undef __FUNCT__
5215ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering"
5216ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers)
5217ef48cebcSMatthew G. Knepley {
5218ef48cebcSMatthew G. Knepley   IS             nums[4];
5219ef48cebcSMatthew G. Knepley   PetscInt       depths[4];
5220ef48cebcSMatthew G. Knepley   PetscInt       depth, d, shift = 0;
5221ef48cebcSMatthew G. Knepley   PetscErrorCode ierr;
5222ef48cebcSMatthew G. Knepley 
5223ef48cebcSMatthew G. Knepley   PetscFunctionBegin;
5224ef48cebcSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5225ef48cebcSMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
5226ef48cebcSMatthew G. Knepley   depths[0] = depth; depths[1] = 0;
5227ef48cebcSMatthew G. Knepley   for (d = 2; d <= depth; ++d) depths[d] = depth-d+1;
5228ef48cebcSMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
5229ef48cebcSMatthew G. Knepley     PetscInt pStart, pEnd, gsize;
5230ef48cebcSMatthew G. Knepley 
5231ef48cebcSMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr);
5232ef48cebcSMatthew G. Knepley     ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr);
5233ef48cebcSMatthew G. Knepley     shift += gsize;
5234ef48cebcSMatthew G. Knepley   }
5235ef48cebcSMatthew G. Knepley   ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers);
5236ef48cebcSMatthew G. Knepley   for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);}
5237ef48cebcSMatthew G. Knepley   PetscFunctionReturn(0);
5238ef48cebcSMatthew G. Knepley }
5239ef48cebcSMatthew G. Knepley 
5240552f7358SJed Brown 
5241552f7358SJed Brown #undef __FUNCT__
5242552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel"
5243552f7358SJed Brown /*@C
5244552f7358SJed Brown   PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using
5245552f7358SJed Brown   the local section and an SF describing the section point overlap.
5246552f7358SJed Brown 
5247552f7358SJed Brown   Input Parameters:
5248552f7358SJed Brown   + s - The PetscSection for the local field layout
5249552f7358SJed Brown   . sf - The SF describing parallel layout of the section points
5250552f7358SJed Brown   . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs
5251552f7358SJed Brown   . label - The label specifying the points
5252552f7358SJed Brown   - labelValue - The label stratum specifying the points
5253552f7358SJed Brown 
5254552f7358SJed Brown   Output Parameter:
5255552f7358SJed Brown   . gsection - The PetscSection for the global field layout
5256552f7358SJed Brown 
5257552f7358SJed Brown   Note: This gives negative sizes and offsets to points not owned by this process
5258552f7358SJed Brown 
5259552f7358SJed Brown   Level: developer
5260552f7358SJed Brown 
5261552f7358SJed Brown .seealso: PetscSectionCreate()
5262552f7358SJed Brown @*/
5263552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection)
5264552f7358SJed Brown {
52657ec39499SMatthew G. Knepley   PetscInt      *neg = NULL, *tmpOff = NULL;
5266552f7358SJed Brown   PetscInt       pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots;
5267552f7358SJed Brown   PetscErrorCode ierr;
5268552f7358SJed Brown 
5269552f7358SJed Brown   PetscFunctionBegin;
52704c0d72c2SMatthew G. Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr);
5271552f7358SJed Brown   ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr);
5272552f7358SJed Brown   ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr);
52737ec39499SMatthew G. Knepley   ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr);
52747ec39499SMatthew G. Knepley   if (nroots >= 0) {
52757ec39499SMatthew G. Knepley     if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart);
52761795a4d1SJed Brown     ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr);
52777ec39499SMatthew G. Knepley     if (nroots > pEnd-pStart) {
52781795a4d1SJed Brown       ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr);
52797ec39499SMatthew G. Knepley     } else {
52807ec39499SMatthew G. Knepley       tmpOff = &(*gsection)->atlasDof[-pStart];
52817ec39499SMatthew G. Knepley     }
52827ec39499SMatthew G. Knepley   }
5283552f7358SJed Brown   /* Mark ghost points with negative dof */
5284552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
5285552f7358SJed Brown     PetscInt value;
5286552f7358SJed Brown 
5287552f7358SJed Brown     ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr);
5288552f7358SJed Brown     if (value != labelValue) continue;
5289552f7358SJed Brown     ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr);
5290552f7358SJed Brown     ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr);
5291552f7358SJed Brown     ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr);
5292552f7358SJed Brown     if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);}
52937ec39499SMatthew G. Knepley     if (neg) neg[p] = -(dof+1);
5294552f7358SJed Brown   }
5295552f7358SJed Brown   ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr);
5296552f7358SJed Brown   if (nroots >= 0) {
52977ec39499SMatthew G. Knepley     ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
52987ec39499SMatthew G. Knepley     ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
5299552f7358SJed Brown     if (nroots > pEnd-pStart) {
53007ec39499SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];}
5301552f7358SJed Brown     }
5302552f7358SJed Brown   }
5303552f7358SJed Brown   /* Calculate new sizes, get proccess offset, and calculate point offsets */
5304552f7358SJed Brown   for (p = 0, off = 0; p < pEnd-pStart; ++p) {
5305552f7358SJed Brown     cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0;
5306552f7358SJed Brown     (*gsection)->atlasOff[p] = off;
5307552f7358SJed Brown     off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0;
5308552f7358SJed Brown   }
53094c0d72c2SMatthew G. Knepley   ierr       = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr);
5310552f7358SJed Brown   globalOff -= off;
5311552f7358SJed Brown   for (p = 0, off = 0; p < pEnd-pStart; ++p) {
5312552f7358SJed Brown     (*gsection)->atlasOff[p] += globalOff;
53137ec39499SMatthew G. Knepley     if (neg) neg[p] = -((*gsection)->atlasOff[p]+1);
5314552f7358SJed Brown   }
5315552f7358SJed Brown   /* Put in negative offsets for ghost points */
5316552f7358SJed Brown   if (nroots >= 0) {
53177ec39499SMatthew G. Knepley     ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
53187ec39499SMatthew G. Knepley     ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
5319552f7358SJed Brown     if (nroots > pEnd-pStart) {
53207ec39499SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];}
5321552f7358SJed Brown     }
5322552f7358SJed Brown   }
53237ec39499SMatthew G. Knepley   if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);}
5324552f7358SJed Brown   ierr = PetscFree(neg);CHKERRQ(ierr);
5325552f7358SJed Brown   PetscFunctionReturn(0);
5326552f7358SJed Brown }
5327ca8062c8SMatthew G. Knepley 
5328ca8062c8SMatthew G. Knepley #undef __FUNCT__
5329ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry"
5330ca8062c8SMatthew G. Knepley /*@
5331ca8062c8SMatthew G. Knepley   DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric.
5332ca8062c8SMatthew G. Knepley 
5333ca8062c8SMatthew G. Knepley   Input Parameters:
5334ca8062c8SMatthew G. Knepley   + dm - The DMPlex object
5335ca8062c8SMatthew G. Knepley 
5336ca8062c8SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
5337ca8062c8SMatthew G. Knepley 
5338ca8062c8SMatthew G. Knepley   Level: developer
5339ca8062c8SMatthew G. Knepley 
53409bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces()
5341ca8062c8SMatthew G. Knepley @*/
5342ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm)
5343ca8062c8SMatthew G. Knepley {
5344ca8062c8SMatthew G. Knepley   PetscSection    coneSection, supportSection;
5345ca8062c8SMatthew G. Knepley   const PetscInt *cone, *support;
5346ca8062c8SMatthew G. Knepley   PetscInt        coneSize, c, supportSize, s;
5347ca8062c8SMatthew G. Knepley   PetscInt        pStart, pEnd, p, csize, ssize;
5348ca8062c8SMatthew G. Knepley   PetscErrorCode  ierr;
5349ca8062c8SMatthew G. Knepley 
5350ca8062c8SMatthew G. Knepley   PetscFunctionBegin;
5351ca8062c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5352ca8062c8SMatthew G. Knepley   ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr);
5353ca8062c8SMatthew G. Knepley   ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr);
5354ca8062c8SMatthew G. Knepley   /* Check that point p is found in the support of its cone points, and vice versa */
5355ca8062c8SMatthew G. Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
5356ca8062c8SMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {
5357ca8062c8SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
5358ca8062c8SMatthew G. Knepley     ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr);
5359ca8062c8SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
536042e66dfaSMatthew G. Knepley       PetscBool dup = PETSC_FALSE;
536142e66dfaSMatthew G. Knepley       PetscInt  d;
536242e66dfaSMatthew G. Knepley       for (d = c-1; d >= 0; --d) {
536342e66dfaSMatthew G. Knepley         if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;}
536442e66dfaSMatthew G. Knepley       }
5365ca8062c8SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr);
5366ca8062c8SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr);
5367ca8062c8SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
5368ca8062c8SMatthew G. Knepley         if (support[s] == p) break;
5369ca8062c8SMatthew G. Knepley       }
537042e66dfaSMatthew G. Knepley       if ((s >= supportSize) || (dup && (support[s+1] != p))) {
5371ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p);
5372ca8062c8SMatthew G. Knepley         for (s = 0; s < coneSize; ++s) {
5373ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]);
5374ca8062c8SMatthew G. Knepley         }
5375ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
5376ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]);
5377ca8062c8SMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
5378ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]);
5379ca8062c8SMatthew G. Knepley         }
5380ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
538142e66dfaSMatthew G. Knepley         if (dup) {
538242e66dfaSMatthew G. Knepley           SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]);
538342e66dfaSMatthew G. Knepley         } else {
5384ca8062c8SMatthew G. Knepley           SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]);
5385ca8062c8SMatthew G. Knepley         }
5386ca8062c8SMatthew G. Knepley       }
538742e66dfaSMatthew G. Knepley     }
5388ca8062c8SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
5389ca8062c8SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr);
5390ca8062c8SMatthew G. Knepley     for (s = 0; s < supportSize; ++s) {
5391ca8062c8SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
5392ca8062c8SMatthew G. Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
5393ca8062c8SMatthew G. Knepley       for (c = 0; c < coneSize; ++c) {
5394ca8062c8SMatthew G. Knepley         if (cone[c] == p) break;
5395ca8062c8SMatthew G. Knepley       }
5396ca8062c8SMatthew G. Knepley       if (c >= coneSize) {
5397ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p);
5398ca8062c8SMatthew G. Knepley         for (c = 0; c < supportSize; ++c) {
5399ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]);
5400ca8062c8SMatthew G. Knepley         }
5401ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
5402ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]);
5403ca8062c8SMatthew G. Knepley         for (c = 0; c < coneSize; ++c) {
5404ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]);
5405ca8062c8SMatthew G. Knepley         }
5406ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
5407ca8062c8SMatthew G. Knepley         SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]);
5408ca8062c8SMatthew G. Knepley       }
5409ca8062c8SMatthew G. Knepley     }
5410ca8062c8SMatthew G. Knepley   }
5411ca8062c8SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr);
5412ca8062c8SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr);
5413ca8062c8SMatthew G. Knepley   if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize);
5414ca8062c8SMatthew G. Knepley   PetscFunctionReturn(0);
5415ca8062c8SMatthew G. Knepley }
5416ca8062c8SMatthew G. Knepley 
5417ca8062c8SMatthew G. Knepley #undef __FUNCT__
5418ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton"
5419ca8062c8SMatthew G. Knepley /*@
5420ca8062c8SMatthew G. Knepley   DMPlexCheckSkeleton - Check that each cell has the correct number of vertices
5421ca8062c8SMatthew G. Knepley 
5422ca8062c8SMatthew G. Knepley   Input Parameters:
5423ca8062c8SMatthew G. Knepley + dm - The DMPlex object
542458723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products
542558723a97SMatthew G. Knepley - cellHeight - Normally 0
5426ca8062c8SMatthew G. Knepley 
5427ca8062c8SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
5428ca8062c8SMatthew G. Knepley 
5429ca8062c8SMatthew G. Knepley   Level: developer
5430ca8062c8SMatthew G. Knepley 
54319bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces()
5432ca8062c8SMatthew G. Knepley @*/
543358723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight)
5434ca8062c8SMatthew G. Knepley {
543542363296SMatthew G. Knepley   PetscInt       dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c;
5436ca8062c8SMatthew G. Knepley   PetscErrorCode ierr;
5437ca8062c8SMatthew G. Knepley 
5438ca8062c8SMatthew G. Knepley   PetscFunctionBegin;
5439ca8062c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5440c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
5441ca8062c8SMatthew G. Knepley   switch (dim) {
544242363296SMatthew G. Knepley   case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break;
544342363296SMatthew G. Knepley   case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break;
544442363296SMatthew G. Knepley   case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break;
5445ca8062c8SMatthew G. Knepley   default:
5446ca8062c8SMatthew G. Knepley     SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim);
5447ca8062c8SMatthew G. Knepley   }
544858723a97SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
544958723a97SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr);
5450ca8062c8SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
5451ca8062c8SMatthew G. Knepley   cMax = cMax >= 0 ? cMax : cEnd;
5452ca8062c8SMatthew G. Knepley   for (c = cStart; c < cMax; ++c) {
545358723a97SMatthew G. Knepley     PetscInt *closure = NULL, closureSize, cl, coneSize = 0;
545458723a97SMatthew G. Knepley 
545558723a97SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
545658723a97SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
545758723a97SMatthew G. Knepley       const PetscInt p = closure[cl];
545858723a97SMatthew G. Knepley       if ((p >= vStart) && (p < vEnd)) ++coneSize;
545958723a97SMatthew G. Knepley     }
546058723a97SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
5461ca8062c8SMatthew G. Knepley     if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has  %d vertices != %d", c, coneSize, numCorners);
5462ca8062c8SMatthew G. Knepley   }
546342363296SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
546442363296SMatthew G. Knepley     PetscInt *closure = NULL, closureSize, cl, coneSize = 0;
546542363296SMatthew G. Knepley 
546642363296SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
546742363296SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
546842363296SMatthew G. Knepley       const PetscInt p = closure[cl];
546942363296SMatthew G. Knepley       if ((p >= vStart) && (p < vEnd)) ++coneSize;
547042363296SMatthew G. Knepley     }
547142363296SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
547242363296SMatthew G. Knepley     if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has  %d vertices > %d", c, coneSize, numHybridCorners);
547342363296SMatthew G. Knepley   }
5474ca8062c8SMatthew G. Knepley   PetscFunctionReturn(0);
5475ca8062c8SMatthew G. Knepley }
54769bf0dad6SMatthew G. Knepley 
54779bf0dad6SMatthew G. Knepley #undef __FUNCT__
54789bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces"
54799bf0dad6SMatthew G. Knepley /*@
54809bf0dad6SMatthew 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
54819bf0dad6SMatthew G. Knepley 
54829bf0dad6SMatthew G. Knepley   Input Parameters:
54839bf0dad6SMatthew G. Knepley + dm - The DMPlex object
54849bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products
54859bf0dad6SMatthew G. Knepley - cellHeight - Normally 0
54869bf0dad6SMatthew G. Knepley 
54879bf0dad6SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
54889bf0dad6SMatthew G. Knepley 
54899bf0dad6SMatthew G. Knepley   Level: developer
54909bf0dad6SMatthew G. Knepley 
54919bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton()
54929bf0dad6SMatthew G. Knepley @*/
54939bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight)
54949bf0dad6SMatthew G. Knepley {
54953554e41dSMatthew G. Knepley   PetscInt       pMax[4];
54963554e41dSMatthew G. Knepley   PetscInt       dim, vStart, vEnd, cStart, cEnd, c, h;
54979bf0dad6SMatthew G. Knepley   PetscErrorCode ierr;
54989bf0dad6SMatthew G. Knepley 
54999bf0dad6SMatthew G. Knepley   PetscFunctionBegin;
55009bf0dad6SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5501c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
55029bf0dad6SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
550325abba81SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr);
55043554e41dSMatthew G. Knepley   for (h = cellHeight; h < dim; ++h) {
55053554e41dSMatthew G. Knepley     ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr);
55063554e41dSMatthew G. Knepley     for (c = cStart; c < cEnd; ++c) {
55079bf0dad6SMatthew G. Knepley       const PetscInt *cone, *ornt, *faces;
55089bf0dad6SMatthew G. Knepley       PetscInt        numFaces, faceSize, coneSize,f;
55099bf0dad6SMatthew G. Knepley       PetscInt       *closure = NULL, closureSize, cl, numCorners = 0;
55109bf0dad6SMatthew G. Knepley 
551125abba81SMatthew G. Knepley       if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue;
55129bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
55139bf0dad6SMatthew G. Knepley       ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
55149bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr);
55159bf0dad6SMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
55169bf0dad6SMatthew G. Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
55179bf0dad6SMatthew G. Knepley         const PetscInt p = closure[cl];
55189bf0dad6SMatthew G. Knepley         if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p;
55199bf0dad6SMatthew G. Knepley       }
55203554e41dSMatthew G. Knepley       ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr);
55219bf0dad6SMatthew 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);
55229bf0dad6SMatthew G. Knepley       for (f = 0; f < numFaces; ++f) {
55239bf0dad6SMatthew G. Knepley         PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v;
55249bf0dad6SMatthew G. Knepley 
55259bf0dad6SMatthew G. Knepley         ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr);
55269bf0dad6SMatthew G. Knepley         for (cl = 0; cl < fclosureSize*2; cl += 2) {
55279bf0dad6SMatthew G. Knepley           const PetscInt p = fclosure[cl];
55289bf0dad6SMatthew G. Knepley           if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p;
55299bf0dad6SMatthew G. Knepley         }
5530e003ed69SMatthew 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);
55319bf0dad6SMatthew G. Knepley         for (v = 0; v < fnumCorners; ++v) {
5532e003ed69SMatthew 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]);
55339bf0dad6SMatthew G. Knepley         }
55349bf0dad6SMatthew G. Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr);
55359bf0dad6SMatthew G. Knepley       }
55369bf0dad6SMatthew G. Knepley       ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr);
55379bf0dad6SMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
55389bf0dad6SMatthew G. Knepley     }
55393554e41dSMatthew G. Knepley   }
5540552f7358SJed Brown   PetscFunctionReturn(0);
5541552f7358SJed Brown }
55423913d7c8SMatthew G. Knepley 
55433913d7c8SMatthew G. Knepley #undef __FUNCT__
5544bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex"
5545bceba477SMatthew G. Knepley /* Pointwise interpolation
5546bceba477SMatthew G. Knepley      Just code FEM for now
5547bceba477SMatthew G. Knepley      u^f = I u^c
55484ca5e9f5SMatthew G. Knepley      sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j
55494ca5e9f5SMatthew G. Knepley      u^f_i = sum_j psi^f_i I phi^c_j u^c_j
55504ca5e9f5SMatthew G. Knepley      I_{ij} = psi^f_i phi^c_j
5551bceba477SMatthew G. Knepley */
5552bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling)
5553bceba477SMatthew G. Knepley {
5554bceba477SMatthew G. Knepley   PetscSection   gsc, gsf;
5555bceba477SMatthew G. Knepley   PetscInt       m, n;
5556a063dac3SMatthew G. Knepley   void          *ctx;
5557bceba477SMatthew G. Knepley   PetscErrorCode ierr;
5558bceba477SMatthew G. Knepley 
5559bceba477SMatthew G. Knepley   PetscFunctionBegin;
5560bceba477SMatthew G. Knepley   /*
5561bceba477SMatthew G. Knepley   Loop over coarse cells
5562bceba477SMatthew G. Knepley     Loop over coarse basis functions
5563bceba477SMatthew G. Knepley       Loop over fine cells in coarse cell
5564bceba477SMatthew G. Knepley         Loop over fine dual basis functions
5565bceba477SMatthew G. Knepley           Evaluate coarse basis on fine dual basis quad points
5566bceba477SMatthew G. Knepley           Sum
5567bceba477SMatthew G. Knepley           Update local element matrix
5568bceba477SMatthew G. Knepley     Accumulate to interpolation matrix
5569bceba477SMatthew G. Knepley 
5570bceba477SMatthew G. Knepley    Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop
5571bceba477SMatthew G. Knepley   */
5572bceba477SMatthew G. Knepley   ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr);
5573bceba477SMatthew G. Knepley   ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr);
5574bceba477SMatthew G. Knepley   ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr);
5575bceba477SMatthew G. Knepley   ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr);
5576bceba477SMatthew G. Knepley   /* We need to preallocate properly */
5577bceba477SMatthew G. Knepley   ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr);
5578bceba477SMatthew G. Knepley   ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
5579bceba477SMatthew G. Knepley   ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr);
5580a063dac3SMatthew G. Knepley   ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr);
5581a063dac3SMatthew G. Knepley   ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr);
55825d1c2e58SMatthew G. Knepley   /* Use naive scaling */
55835d1c2e58SMatthew G. Knepley   ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr);
5584a063dac3SMatthew G. Knepley   PetscFunctionReturn(0);
5585a063dac3SMatthew G. Knepley }
5586bceba477SMatthew G. Knepley 
5587a063dac3SMatthew G. Knepley #undef __FUNCT__
5588a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex"
5589a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx)
5590a063dac3SMatthew G. Knepley {
559190748bafSMatthew G. Knepley   PetscErrorCode ierr;
559290748bafSMatthew G. Knepley 
5593a063dac3SMatthew G. Knepley   PetscFunctionBegin;
55947c927364SMatthew G. Knepley   ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr);
5595bceba477SMatthew G. Knepley   PetscFunctionReturn(0);
5596bceba477SMatthew G. Knepley }
5597bceba477SMatthew G. Knepley 
5598bceba477SMatthew G. Knepley #undef __FUNCT__
5599fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex"
5600fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm)
5601fd59a867SMatthew G. Knepley {
5602fd59a867SMatthew G. Knepley   PetscSection   section;
5603fd59a867SMatthew G. Knepley   IS            *bcPoints;
5604ebb3236fSMatthew G. Knepley   PetscBool     *isFE;
5605286d8613SMatthew G. Knepley   PetscInt      *bcFields, *numComp, *numDof;
5606ebb3236fSMatthew G. Knepley   PetscInt       depth, dim, numBd, numBC = 0, numFields, bd, bc = 0, f;
5607ebb3236fSMatthew G. Knepley   PetscInt       cStart, cEnd, cEndInterior;
5608fd59a867SMatthew G. Knepley   PetscErrorCode ierr;
5609fd59a867SMatthew G. Knepley 
5610fd59a867SMatthew G. Knepley   PetscFunctionBegin;
5611ebb3236fSMatthew G. Knepley   ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr);
5612ebb3236fSMatthew G. Knepley   /* FE and FV boundary conditions are handled slightly differently */
5613ebb3236fSMatthew G. Knepley   ierr = PetscMalloc1(numFields, &isFE);CHKERRQ(ierr);
5614ebb3236fSMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
5615ebb3236fSMatthew G. Knepley     PetscObject  obj;
5616ebb3236fSMatthew G. Knepley     PetscClassId id;
5617ebb3236fSMatthew G. Knepley 
5618ebb3236fSMatthew G. Knepley     ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr);
5619ebb3236fSMatthew G. Knepley     ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr);
5620ebb3236fSMatthew G. Knepley     if (id == PETSCFE_CLASSID)      {isFE[f] = PETSC_TRUE;}
5621ebb3236fSMatthew G. Knepley     else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;}
5622ebb3236fSMatthew G. Knepley     else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Unknown discretization type for field %d", f);
5623ebb3236fSMatthew G. Knepley   }
5624ebb3236fSMatthew G. Knepley   /* Allocate boundary point storage */
5625286d8613SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
5626c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
5627ebb3236fSMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
5628ebb3236fSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr);
5629fd59a867SMatthew G. Knepley   ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr);
5630fd59a867SMatthew G. Knepley   for (bd = 0; bd < numBd; ++bd) {
5631fd59a867SMatthew G. Knepley     PetscBool isEssential;
563263d5297fSMatthew G. Knepley     ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr);
5633fd59a867SMatthew G. Knepley     if (isEssential) ++numBC;
5634fd59a867SMatthew G. Knepley   }
5635ebb3236fSMatthew G. Knepley   for (f = 0; f < numFields; ++f) if (!isFE[f] && cEndInterior >= 0) ++numBC;
5636fd59a867SMatthew G. Knepley   ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr);
5637ebb3236fSMatthew G. Knepley   /* Constrain ghost cells for FV */
5638ebb3236fSMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
5639ebb3236fSMatthew G. Knepley     PetscInt *newidx, c;
5640ebb3236fSMatthew G. Knepley 
5641ebb3236fSMatthew G. Knepley     if (isFE[f] || cEndInterior < 0) continue;
5642ebb3236fSMatthew G. Knepley     ierr = PetscMalloc1(cEnd-cEndInterior,&newidx);CHKERRQ(ierr);
5643ebb3236fSMatthew G. Knepley     for (c = cEndInterior; c < cEnd; ++c) newidx[c-cEndInterior] = c;
5644ebb3236fSMatthew G. Knepley     bcFields[bc] = f;
5645ebb3236fSMatthew G. Knepley     ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), cEnd-cEndInterior, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr);
5646ebb3236fSMatthew G. Knepley   }
5647ebb3236fSMatthew G. Knepley   /* Handle FEM Dirichlet boundaries */
5648ebb3236fSMatthew G. Knepley   for (bd = 0; bd < numBd; ++bd) {
5649fd59a867SMatthew G. Knepley     const char     *bdLabel;
5650fd59a867SMatthew G. Knepley     DMLabel         label;
5651fd59a867SMatthew G. Knepley     const PetscInt *values;
56527391c1cbSMatthew G. Knepley     PetscInt        bd2, field, numValues;
5653c945be8dSMatthew G. Knepley     PetscBool       isEssential, duplicate = PETSC_FALSE;
5654fd59a867SMatthew G. Knepley 
565563d5297fSMatthew G. Knepley     ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr);
5656fd59a867SMatthew G. Knepley     ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr);
5657ebb3236fSMatthew G. Knepley     /* Only want to modify label once */
56587391c1cbSMatthew G. Knepley     for (bd2 = 0; bd2 < bd; ++bd2) {
56597391c1cbSMatthew G. Knepley       const char *bdname;
56602f81efd2SMatthew G. Knepley       ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr);
56617391c1cbSMatthew G. Knepley       ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr);
56627391c1cbSMatthew G. Knepley       if (duplicate) break;
56637391c1cbSMatthew G. Knepley     }
5664ebb3236fSMatthew G. Knepley     if (!duplicate && (isFE[field])) {
5665fd59a867SMatthew G. Knepley       ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr);
566632720fa8SMatthew G. Knepley       ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr);
56677391c1cbSMatthew G. Knepley     }
5668ebb3236fSMatthew G. Knepley     /* Filter out cells, if you actually want to constrain cells you need to do things by hand right now */
5669fd59a867SMatthew G. Knepley     if (isEssential) {
567093a5981aSMatthew G. Knepley       PetscInt       *newidx;
5671ebb3236fSMatthew G. Knepley       PetscInt        n, newn = 0, p, v;
567293a5981aSMatthew G. Knepley 
5673fd59a867SMatthew G. Knepley       bcFields[bc] = field;
5674ebb3236fSMatthew G. Knepley       for (v = 0; v < numValues; ++v) {
5675ebb3236fSMatthew G. Knepley         IS              tmp;
5676ebb3236fSMatthew G. Knepley         const PetscInt *idx;
5677ebb3236fSMatthew G. Knepley 
5678ebb3236fSMatthew G. Knepley         ierr = DMPlexGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr);
5679ebb3236fSMatthew G. Knepley         if (!tmp) continue;
568093a5981aSMatthew G. Knepley         ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr);
568193a5981aSMatthew G. Knepley         ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr);
5682ebb3236fSMatthew G. Knepley         if (isFE[field]) {
568393a5981aSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn;
5684ebb3236fSMatthew G. Knepley         } else {
5685ebb3236fSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) ++newn;
5686ebb3236fSMatthew G. Knepley         }
568793a5981aSMatthew G. Knepley         ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr);
568893a5981aSMatthew G. Knepley         ierr = ISDestroy(&tmp);CHKERRQ(ierr);
5689fd59a867SMatthew G. Knepley       }
5690ebb3236fSMatthew G. Knepley       ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr);
5691ebb3236fSMatthew G. Knepley       newn = 0;
5692ebb3236fSMatthew G. Knepley       for (v = 0; v < numValues; ++v) {
5693ebb3236fSMatthew G. Knepley         IS              tmp;
5694ebb3236fSMatthew G. Knepley         const PetscInt *idx;
5695ebb3236fSMatthew G. Knepley 
5696ebb3236fSMatthew G. Knepley         ierr = DMPlexGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr);
5697ebb3236fSMatthew G. Knepley         if (!tmp) continue;
5698ebb3236fSMatthew G. Knepley         ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr);
5699ebb3236fSMatthew G. Knepley         ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr);
5700ebb3236fSMatthew G. Knepley         if (isFE[field]) {
5701ebb3236fSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p];
5702ebb3236fSMatthew G. Knepley         } else {
5703ebb3236fSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) newidx[newn++] = idx[p];
5704ebb3236fSMatthew G. Knepley         }
5705ebb3236fSMatthew G. Knepley         ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr);
5706ebb3236fSMatthew G. Knepley         ierr = ISDestroy(&tmp);CHKERRQ(ierr);
5707ebb3236fSMatthew G. Knepley       }
5708ebb3236fSMatthew G. Knepley       ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr);
5709ebb3236fSMatthew G. Knepley     }
5710fd59a867SMatthew G. Knepley   }
5711fd59a867SMatthew G. Knepley   /* Handle discretization */
5712ebb3236fSMatthew G. Knepley   ierr = PetscCalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr);
5713fd59a867SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
57140bacfa0aSMatthew G. Knepley     PetscObject obj;
57150bacfa0aSMatthew G. Knepley 
57160bacfa0aSMatthew G. Knepley     ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr);
5717ebb3236fSMatthew G. Knepley     if (isFE[f]) {
57180bacfa0aSMatthew G. Knepley       PetscFE         fe = (PetscFE) obj;
5719286d8613SMatthew G. Knepley       const PetscInt *numFieldDof;
5720fd59a867SMatthew G. Knepley       PetscInt        d;
5721fd59a867SMatthew G. Knepley 
5722fd59a867SMatthew G. Knepley       ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr);
5723286d8613SMatthew G. Knepley       ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr);
5724286d8613SMatthew G. Knepley       for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d];
5725ebb3236fSMatthew G. Knepley     } else {
57260bacfa0aSMatthew G. Knepley       PetscFV fv = (PetscFV) obj;
57270bacfa0aSMatthew G. Knepley 
57280bacfa0aSMatthew G. Knepley       ierr = PetscFVGetNumComponents(fv, &numComp[f]);CHKERRQ(ierr);
57290bacfa0aSMatthew G. Knepley       numDof[f*(dim+1)+dim] = numComp[f];
5730ebb3236fSMatthew G. Knepley     }
5731fd59a867SMatthew G. Knepley   }
5732286d8613SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
5733286d8613SMatthew G. Knepley     PetscInt d;
5734286d8613SMatthew G. Knepley     for (d = 1; d < dim; ++d) {
5735286d8613SMatthew 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.");
5736286d8613SMatthew G. Knepley     }
5737286d8613SMatthew G. Knepley   }
5738f8f126e8SMatthew G. Knepley   ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, &section);CHKERRQ(ierr);
5739fd59a867SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
5740fd59a867SMatthew G. Knepley     PetscFE     fe;
5741fd59a867SMatthew G. Knepley     const char *name;
574218abd763SMatthew G. Knepley 
574318abd763SMatthew G. Knepley     ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr);
5744fd59a867SMatthew G. Knepley     ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr);
5745fd59a867SMatthew G. Knepley     ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr);
5746fd59a867SMatthew G. Knepley   }
5747fd59a867SMatthew G. Knepley   ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr);
5748fd59a867SMatthew G. Knepley   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
5749fd59a867SMatthew G. Knepley   for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);}
5750fd59a867SMatthew G. Knepley   ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr);
5751286d8613SMatthew G. Knepley   ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr);
5752ebb3236fSMatthew G. Knepley   ierr = PetscFree(isFE);CHKERRQ(ierr);
5753bceba477SMatthew G. Knepley   PetscFunctionReturn(0);
5754bceba477SMatthew G. Knepley }
5755bceba477SMatthew G. Knepley 
5756bceba477SMatthew G. Knepley #undef __FUNCT__
57573913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM"
57583913d7c8SMatthew G. Knepley /*@
57593913d7c8SMatthew G. Knepley   DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement
57603913d7c8SMatthew G. Knepley 
57613913d7c8SMatthew G. Knepley   Input Parameter:
57623913d7c8SMatthew G. Knepley . dm - The DMPlex object
57633913d7c8SMatthew G. Knepley 
57643913d7c8SMatthew G. Knepley   Output Parameter:
57653913d7c8SMatthew G. Knepley . cdm - The coarse DM
57663913d7c8SMatthew G. Knepley 
57673913d7c8SMatthew G. Knepley   Level: intermediate
57683913d7c8SMatthew G. Knepley 
57693913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM()
57703913d7c8SMatthew G. Knepley @*/
57713913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm)
57723913d7c8SMatthew G. Knepley {
57733913d7c8SMatthew G. Knepley   PetscFunctionBegin;
57743913d7c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
57753913d7c8SMatthew G. Knepley   PetscValidPointer(cdm, 2);
57763913d7c8SMatthew G. Knepley   *cdm = ((DM_Plex *) dm->data)->coarseMesh;
57773913d7c8SMatthew G. Knepley   PetscFunctionReturn(0);
57783913d7c8SMatthew G. Knepley }
57793913d7c8SMatthew G. Knepley 
57803913d7c8SMatthew G. Knepley #undef __FUNCT__
57813913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM"
57823913d7c8SMatthew G. Knepley /*@
57833913d7c8SMatthew G. Knepley   DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement
57843913d7c8SMatthew G. Knepley 
57853913d7c8SMatthew G. Knepley   Input Parameters:
57863913d7c8SMatthew G. Knepley + dm - The DMPlex object
57873913d7c8SMatthew G. Knepley - cdm - The coarse DM
57883913d7c8SMatthew G. Knepley 
57893913d7c8SMatthew G. Knepley   Level: intermediate
57903913d7c8SMatthew G. Knepley 
57913913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM()
57923913d7c8SMatthew G. Knepley @*/
57933913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm)
57943913d7c8SMatthew G. Knepley {
57953913d7c8SMatthew G. Knepley   DM_Plex       *mesh;
57963913d7c8SMatthew G. Knepley   PetscErrorCode ierr;
57973913d7c8SMatthew G. Knepley 
57983913d7c8SMatthew G. Knepley   PetscFunctionBegin;
57993913d7c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
58003913d7c8SMatthew G. Knepley   if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2);
58013913d7c8SMatthew G. Knepley   mesh = (DM_Plex *) dm->data;
58023913d7c8SMatthew G. Knepley   ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr);
58033913d7c8SMatthew G. Knepley   mesh->coarseMesh = cdm;
58043913d7c8SMatthew G. Knepley   ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr);
58053913d7c8SMatthew G. Knepley   PetscFunctionReturn(0);
58063913d7c8SMatthew G. Knepley }
5807a68b90caSToby Isaac 
5808f7c74593SToby Isaac /* anchors */
5809a68b90caSToby Isaac #undef __FUNCT__
5810a17985deSToby Isaac #define __FUNCT__ "DMPlexGetAnchors"
5811a68b90caSToby Isaac /*@
5812f7c74593SToby Isaac   DMPlexGetAnchors - Get the layout of the anchor (point-to-point) constraints.  Typically, the user will not have to
5813f7c74593SToby Isaac   call DMPlexGetAnchors() directly: if there are anchors, then DMPlexGetAnchors() is called during DMGetConstraints().
5814a68b90caSToby Isaac 
5815e228b242SToby Isaac   not collective
5816a68b90caSToby Isaac 
5817a68b90caSToby Isaac   Input Parameters:
5818a68b90caSToby Isaac . dm - The DMPlex object
5819a68b90caSToby Isaac 
5820a68b90caSToby Isaac   Output Parameters:
5821a68b90caSToby Isaac + anchorSection - If not NULL, set to the section describing which points anchor the constrained points.
5822a68b90caSToby Isaac - anchorIS - If not NULL, set to the list of anchors indexed by anchorSection
5823a68b90caSToby Isaac 
5824a68b90caSToby Isaac 
5825a68b90caSToby Isaac   Level: intermediate
5826a68b90caSToby Isaac 
5827f7c74593SToby Isaac .seealso: DMPlexSetAnchors(), DMGetConstraints(), DMSetConstraints()
5828a68b90caSToby Isaac @*/
5829a17985deSToby Isaac PetscErrorCode DMPlexGetAnchors(DM dm, PetscSection *anchorSection, IS *anchorIS)
5830a68b90caSToby Isaac {
5831a68b90caSToby Isaac   DM_Plex *plex = (DM_Plex *)dm->data;
583241e6d900SToby Isaac   PetscErrorCode ierr;
5833a68b90caSToby Isaac 
5834a68b90caSToby Isaac   PetscFunctionBegin;
5835a68b90caSToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
583641e6d900SToby Isaac   if (!plex->anchorSection && !plex->anchorIS && plex->createanchors) {ierr = (*plex->createanchors)(dm);CHKERRQ(ierr);}
5837a68b90caSToby Isaac   if (anchorSection) *anchorSection = plex->anchorSection;
5838a68b90caSToby Isaac   if (anchorIS) *anchorIS = plex->anchorIS;
5839a68b90caSToby Isaac   PetscFunctionReturn(0);
5840a68b90caSToby Isaac }
5841a68b90caSToby Isaac 
5842a68b90caSToby Isaac #undef __FUNCT__
5843a17985deSToby Isaac #define __FUNCT__ "DMPlexSetAnchors"
5844a68b90caSToby Isaac /*@
5845f7c74593SToby Isaac   DMPlexSetAnchors - Set the layout of the local anchor (point-to-point) constraints.  Unlike boundary conditions,
5846f7c74593SToby Isaac   when a point's degrees of freedom in a section are constrained to an outside value, the anchor constraints set a
5847a68b90caSToby Isaac   point's degrees of freedom to be a linear combination of other points' degrees of freedom.
5848a68b90caSToby Isaac 
5849a17985deSToby Isaac   After specifying the layout of constraints with DMPlexSetAnchors(), one specifies the constraints by calling
5850f7c74593SToby Isaac   DMGetConstraints() and filling in the entries in the constraint matrix.
5851a68b90caSToby Isaac 
5852e228b242SToby Isaac   collective on dm
5853a68b90caSToby Isaac 
5854a68b90caSToby Isaac   Input Parameters:
5855a68b90caSToby Isaac + dm - The DMPlex object
5856e228b242SToby 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).
5857e228b242SToby Isaac - anchorIS - The list of all anchor points.  Must have a local communicator (PETSC_COMM_SELF or derivative).
5858a68b90caSToby Isaac 
5859a68b90caSToby Isaac   The reference counts of anchorSection and anchorIS are incremented.
5860a68b90caSToby Isaac 
5861a68b90caSToby Isaac   Level: intermediate
5862a68b90caSToby Isaac 
5863f7c74593SToby Isaac .seealso: DMPlexGetAnchors(), DMGetConstraints(), DMSetConstraints()
5864a68b90caSToby Isaac @*/
5865a17985deSToby Isaac PetscErrorCode DMPlexSetAnchors(DM dm, PetscSection anchorSection, IS anchorIS)
5866a68b90caSToby Isaac {
5867a68b90caSToby Isaac   DM_Plex *plex = (DM_Plex *)dm->data;
5868e228b242SToby Isaac   PetscMPIInt result;
5869a68b90caSToby Isaac   PetscErrorCode ierr;
5870a68b90caSToby Isaac 
5871a68b90caSToby Isaac   PetscFunctionBegin;
5872a68b90caSToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5873e228b242SToby Isaac   if (anchorSection) {
5874e228b242SToby Isaac     PetscValidHeaderSpecific(anchorSection,PETSC_SECTION_CLASSID,2);
5875e228b242SToby Isaac     ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorSection),&result);CHKERRQ(ierr);
5876e228b242SToby Isaac     if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor section must have local communicator");
5877e228b242SToby Isaac   }
5878e228b242SToby Isaac   if (anchorIS) {
5879e228b242SToby Isaac     PetscValidHeaderSpecific(anchorIS,IS_CLASSID,3);
5880e228b242SToby Isaac     ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorIS),&result);CHKERRQ(ierr);
5881e228b242SToby Isaac     if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor IS must have local communicator");
5882e228b242SToby Isaac   }
5883a68b90caSToby Isaac 
5884a68b90caSToby Isaac   ierr = PetscObjectReference((PetscObject)anchorSection);CHKERRQ(ierr);
5885a68b90caSToby Isaac   ierr = PetscSectionDestroy(&plex->anchorSection);CHKERRQ(ierr);
5886a68b90caSToby Isaac   plex->anchorSection = anchorSection;
5887a68b90caSToby Isaac 
5888a68b90caSToby Isaac   ierr = PetscObjectReference((PetscObject)anchorIS);CHKERRQ(ierr);
5889a68b90caSToby Isaac   ierr = ISDestroy(&plex->anchorIS);CHKERRQ(ierr);
5890a68b90caSToby Isaac   plex->anchorIS = anchorIS;
5891a68b90caSToby Isaac 
5892a68b90caSToby Isaac #if defined(PETSC_USE_DEBUG)
5893a68b90caSToby Isaac   if (anchorIS && anchorSection) {
5894a68b90caSToby Isaac     PetscInt size, a, pStart, pEnd;
5895a68b90caSToby Isaac     const PetscInt *anchors;
5896a68b90caSToby Isaac 
5897a68b90caSToby Isaac     ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr);
5898a68b90caSToby Isaac     ierr = ISGetLocalSize(anchorIS,&size);CHKERRQ(ierr);
5899a68b90caSToby Isaac     ierr = ISGetIndices(anchorIS,&anchors);CHKERRQ(ierr);
5900a68b90caSToby Isaac     for (a = 0; a < size; a++) {
5901a68b90caSToby Isaac       PetscInt p;
5902a68b90caSToby Isaac 
5903a68b90caSToby Isaac       p = anchors[a];
5904a68b90caSToby Isaac       if (p >= pStart && p < pEnd) {
5905a68b90caSToby Isaac         PetscInt dof;
5906a68b90caSToby Isaac 
5907a68b90caSToby Isaac         ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr);
5908a68b90caSToby Isaac         if (dof) {
5909a68b90caSToby Isaac           PetscErrorCode ierr2;
5910a68b90caSToby Isaac 
5911a68b90caSToby Isaac           ierr2 = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr2);
5912a68b90caSToby Isaac           SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_INCOMP,"Point %d cannot be constrained and an anchor",p);
5913a68b90caSToby Isaac         }
5914a68b90caSToby Isaac       }
5915a68b90caSToby Isaac     }
5916a68b90caSToby Isaac     ierr = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr);
5917a68b90caSToby Isaac   }
5918a68b90caSToby Isaac #endif
5919f7c74593SToby Isaac   /* reset the generic constraints */
5920f7c74593SToby Isaac   ierr = DMSetDefaultConstraints(dm,NULL,NULL);CHKERRQ(ierr);
5921a68b90caSToby Isaac   PetscFunctionReturn(0);
5922a68b90caSToby Isaac }
5923a68b90caSToby Isaac 
5924a68b90caSToby Isaac #undef __FUNCT__
5925f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintSection_Anchors"
5926f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintSection_Anchors(DM dm, PetscSection section, PetscSection *cSec)
5927a68b90caSToby Isaac {
5928f7c74593SToby Isaac   PetscSection anchorSection;
5929a68b90caSToby Isaac   PetscInt pStart, pEnd, p, dof, numFields, f;
5930a68b90caSToby Isaac   PetscErrorCode ierr;
5931a68b90caSToby Isaac 
5932a68b90caSToby Isaac   PetscFunctionBegin;
5933a68b90caSToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5934a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr);
5935e228b242SToby Isaac   ierr = PetscSectionCreate(PETSC_COMM_SELF,cSec);CHKERRQ(ierr);
5936a68b90caSToby Isaac   ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr);
5937a68b90caSToby Isaac   ierr = PetscSectionSetNumFields(*cSec,numFields);CHKERRQ(ierr);
5938a68b90caSToby Isaac   ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr);
5939a68b90caSToby Isaac   ierr = PetscSectionSetChart(*cSec,pStart,pEnd);CHKERRQ(ierr);
5940a68b90caSToby Isaac   for (p = pStart; p < pEnd; p++) {
5941a68b90caSToby Isaac     ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr);
5942a68b90caSToby Isaac     if (dof) {
5943a68b90caSToby Isaac       ierr = PetscSectionGetDof(section,p,&dof);CHKERRQ(ierr);
5944a68b90caSToby Isaac       ierr = PetscSectionSetDof(*cSec,p,dof);CHKERRQ(ierr);
5945a68b90caSToby Isaac       for (f = 0; f < numFields; f++) {
5946a68b90caSToby Isaac         ierr = PetscSectionGetFieldDof(section,p,f,&dof);CHKERRQ(ierr);
5947a68b90caSToby Isaac         ierr = PetscSectionSetFieldDof(*cSec,p,f,dof);CHKERRQ(ierr);
5948a68b90caSToby Isaac       }
5949a68b90caSToby Isaac     }
5950a68b90caSToby Isaac   }
5951a68b90caSToby Isaac   ierr = PetscSectionSetUp(*cSec);CHKERRQ(ierr);
5952a68b90caSToby Isaac   PetscFunctionReturn(0);
5953a68b90caSToby Isaac }
5954a68b90caSToby Isaac 
5955a68b90caSToby Isaac #undef __FUNCT__
5956f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintMatrix_Anchors"
5957f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintMatrix_Anchors(DM dm, PetscSection section, PetscSection cSec, Mat *cMat)
5958a68b90caSToby Isaac {
5959f7c74593SToby Isaac   PetscSection aSec;
59600ac89760SToby Isaac   PetscInt pStart, pEnd, p, dof, aDof, aOff, off, nnz, annz, m, n, q, a, offset, *i, *j;
59610ac89760SToby Isaac   const PetscInt *anchors;
59620ac89760SToby Isaac   PetscInt numFields, f;
596366ad2231SToby Isaac   IS aIS;
59640ac89760SToby Isaac   PetscErrorCode ierr;
59650ac89760SToby Isaac 
59660ac89760SToby Isaac   PetscFunctionBegin;
59670ac89760SToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
59680ac89760SToby Isaac   ierr = PetscSectionGetStorageSize(cSec, &m);CHKERRQ(ierr);
59690ac89760SToby Isaac   ierr = PetscSectionGetStorageSize(section, &n);CHKERRQ(ierr);
59700ac89760SToby Isaac   ierr = MatCreate(PETSC_COMM_SELF,cMat);CHKERRQ(ierr);
59710ac89760SToby Isaac   ierr = MatSetSizes(*cMat,m,n,m,n);CHKERRQ(ierr);
59720ac89760SToby Isaac   ierr = MatSetType(*cMat,MATSEQAIJ);
5973a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr);
597466ad2231SToby Isaac   ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr);
59750ac89760SToby Isaac   ierr = PetscSectionGetChart(aSec,&pStart,&pEnd);CHKERRQ(ierr);
59760ac89760SToby Isaac   ierr = PetscMalloc1(m+1,&i);CHKERRQ(ierr);
59770ac89760SToby Isaac   i[0] = 0;
59780ac89760SToby Isaac   ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr);
59790ac89760SToby Isaac   for (p = pStart; p < pEnd; p++) {
59800ac89760SToby Isaac     ierr = PetscSectionGetDof(aSec,p,&dof);CHKERRQ(ierr);
59810ac89760SToby Isaac     if (!dof) continue;
59820ac89760SToby Isaac     ierr = PetscSectionGetOffset(aSec,p,&off);CHKERRQ(ierr);
59830ac89760SToby Isaac     if (numFields) {
59840ac89760SToby Isaac       for (f = 0; f < numFields; f++) {
59850ac89760SToby Isaac         annz = 0;
59860ac89760SToby Isaac         for (q = 0; q < dof; q++) {
59870ac89760SToby Isaac           a = anchors[off + q];
59880ac89760SToby Isaac           ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr);
59890ac89760SToby Isaac           annz += aDof;
59900ac89760SToby Isaac         }
59910ac89760SToby Isaac         ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr);
59920ac89760SToby Isaac         ierr = PetscSectionGetFieldOffset(cSec,p,f,&off);CHKERRQ(ierr);
59930ac89760SToby Isaac         for (q = 0; q < dof; q++) {
59940ac89760SToby Isaac           i[off + q + 1] = i[off + q] + annz;
59950ac89760SToby Isaac         }
59960ac89760SToby Isaac       }
59970ac89760SToby Isaac     }
59980ac89760SToby Isaac     else {
59990ac89760SToby Isaac       annz = 0;
60000ac89760SToby Isaac       for (q = 0; q < dof; q++) {
60010ac89760SToby Isaac         a = anchors[off + q];
60020ac89760SToby Isaac         ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr);
60030ac89760SToby Isaac         annz += aDof;
60040ac89760SToby Isaac       }
60050ac89760SToby Isaac       ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr);
60060ac89760SToby Isaac       ierr = PetscSectionGetOffset(cSec,p,&off);CHKERRQ(ierr);
60070ac89760SToby Isaac       for (q = 0; q < dof; q++) {
60080ac89760SToby Isaac         i[off + q + 1] = i[off + q] + annz;
60090ac89760SToby Isaac       }
60100ac89760SToby Isaac     }
60110ac89760SToby Isaac   }
60120ac89760SToby Isaac   nnz = i[m];
60130ac89760SToby Isaac   ierr = PetscMalloc1(nnz,&j);CHKERRQ(ierr);
60140ac89760SToby Isaac   offset = 0;
60150ac89760SToby Isaac   for (p = pStart; p < pEnd; p++) {
60160ac89760SToby Isaac     if (numFields) {
60170ac89760SToby Isaac       for (f = 0; f < numFields; f++) {
60180ac89760SToby Isaac         ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr);
60190ac89760SToby Isaac         for (q = 0; q < dof; q++) {
60200ac89760SToby Isaac           PetscInt rDof, rOff, r;
60210ac89760SToby Isaac           ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr);
60220ac89760SToby Isaac           ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr);
60230ac89760SToby Isaac           for (r = 0; r < rDof; r++) {
60240ac89760SToby Isaac             PetscInt s;
60250ac89760SToby Isaac 
60260ac89760SToby Isaac             a = anchors[rOff + r];
60270ac89760SToby Isaac 
60280ac89760SToby Isaac             ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr);
60290ac89760SToby Isaac             ierr = PetscSectionGetFieldOffset(section,a,f,&aOff);CHKERRQ(ierr);
60300ac89760SToby Isaac             for (s = 0; s < aDof; s++) {
60310ac89760SToby Isaac               j[offset++] = aOff + s;
60320ac89760SToby Isaac             }
60330ac89760SToby Isaac           }
60340ac89760SToby Isaac         }
60350ac89760SToby Isaac       }
60360ac89760SToby Isaac     }
60370ac89760SToby Isaac     else {
60380ac89760SToby Isaac       ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr);
60390ac89760SToby Isaac       for (q = 0; q < dof; q++) {
60400ac89760SToby Isaac         PetscInt rDof, rOff, r;
60410ac89760SToby Isaac         ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr);
60420ac89760SToby Isaac         ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr);
60430ac89760SToby Isaac         for (r = 0; r < rDof; r++) {
60440ac89760SToby Isaac           PetscInt s;
60450ac89760SToby Isaac 
60460ac89760SToby Isaac           a = anchors[rOff + r];
60470ac89760SToby Isaac 
60480ac89760SToby Isaac           ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr);
60490ac89760SToby Isaac           ierr = PetscSectionGetOffset(section,a,&aOff);CHKERRQ(ierr);
60500ac89760SToby Isaac           for (s = 0; s < aDof; s++) {
60510ac89760SToby Isaac             j[offset++] = aOff + s;
60520ac89760SToby Isaac           }
60530ac89760SToby Isaac         }
60540ac89760SToby Isaac       }
60550ac89760SToby Isaac     }
60560ac89760SToby Isaac   }
60570ac89760SToby Isaac   ierr = MatSeqAIJSetPreallocationCSR(*cMat,i,j,NULL);CHKERRQ(ierr);
60580ac89760SToby Isaac   ierr = PetscFree2(i,j);CHKERRQ(ierr);
605966ad2231SToby Isaac   ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr);
60600ac89760SToby Isaac   PetscFunctionReturn(0);
60610ac89760SToby Isaac }
60620ac89760SToby Isaac 
60630ac89760SToby Isaac #undef __FUNCT__
606466ad2231SToby Isaac #define __FUNCT__ "DMCreateDefaultConstraints_Plex"
606566ad2231SToby Isaac PetscErrorCode DMCreateDefaultConstraints_Plex(DM dm)
606666ad2231SToby Isaac {
6067f7c74593SToby Isaac   DM_Plex        *plex = (DM_Plex *)dm->data;
6068f7c74593SToby Isaac   PetscSection   anchorSection, section, cSec;
606966ad2231SToby Isaac   Mat            cMat;
607066ad2231SToby Isaac   PetscErrorCode ierr;
607166ad2231SToby Isaac 
607266ad2231SToby Isaac   PetscFunctionBegin;
607366ad2231SToby Isaac   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6074a17985deSToby Isaac   ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr);
607566ad2231SToby Isaac   if (anchorSection) {
6076e228b242SToby Isaac     PetscDS  ds;
6077e228b242SToby Isaac     PetscInt nf;
6078e228b242SToby Isaac 
6079f7c74593SToby Isaac     ierr = DMGetDefaultSection(dm,&section);CHKERRQ(ierr);
6080f7c74593SToby Isaac     ierr = DMPlexCreateConstraintSection_Anchors(dm,section,&cSec);CHKERRQ(ierr);
6081f7c74593SToby Isaac     ierr = DMPlexCreateConstraintMatrix_Anchors(dm,section,cSec,&cMat);CHKERRQ(ierr);
6082e228b242SToby Isaac     ierr = DMGetDS(dm,&ds);CHKERRQ(ierr);
6083e228b242SToby Isaac     ierr = PetscDSGetNumFields(ds,&nf);
6084e228b242SToby Isaac     if (nf && plex->computeanchormatrix) {ierr = (*plex->computeanchormatrix)(dm,section,cSec,cMat);CHKERRQ(ierr);}
608566ad2231SToby Isaac     ierr = DMSetDefaultConstraints(dm,cSec,cMat);CHKERRQ(ierr);
608666ad2231SToby Isaac     ierr = PetscSectionDestroy(&cSec);CHKERRQ(ierr);
608766ad2231SToby Isaac     ierr = MatDestroy(&cMat);CHKERRQ(ierr);
608866ad2231SToby Isaac   }
608966ad2231SToby Isaac   PetscFunctionReturn(0);
609066ad2231SToby Isaac }
6091