xref: /petsc/src/dm/impls/plex/plexsection.c (revision 69293d4b4cd7887b0a3e1b6cb8802ca0cef8d901)
19cbb8f0dSMatthew G. Knepley #include <petsc/private/dmpleximpl.h>   /*I      "petscdmplex.h"   I*/
29cbb8f0dSMatthew G. Knepley 
39cbb8f0dSMatthew G. Knepley /* Set the number of dof on each point and separate by fields */
4baef929fSMatthew G. Knepley static PetscErrorCode DMPlexCreateSectionFields(DM dm, const PetscInt numComp[], PetscSection *section)
59cbb8f0dSMatthew G. Knepley {
6baef929fSMatthew G. Knepley   DMLabel        depthLabel;
7baef929fSMatthew G. Knepley   PetscInt       depth, Nf, f, pStart, pEnd;
89cbb8f0dSMatthew G. Knepley   PetscBool     *isFE;
99cbb8f0dSMatthew G. Knepley   PetscErrorCode ierr;
109cbb8f0dSMatthew G. Knepley 
119cbb8f0dSMatthew G. Knepley   PetscFunctionBegin;
12baef929fSMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
13baef929fSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm,&depthLabel);CHKERRQ(ierr);
149cbb8f0dSMatthew G. Knepley   ierr = DMGetNumFields(dm, &Nf);CHKERRQ(ierr);
15baef929fSMatthew G. Knepley   ierr = PetscCalloc1(Nf, &isFE);CHKERRQ(ierr);
16baef929fSMatthew G. Knepley   for (f = 0; f < Nf; ++f) {
179cbb8f0dSMatthew G. Knepley     PetscObject  obj;
189cbb8f0dSMatthew G. Knepley     PetscClassId id;
199cbb8f0dSMatthew G. Knepley 
2044a7f3ddSMatthew G. Knepley     ierr = DMGetField(dm, f, NULL, &obj);CHKERRQ(ierr);
219cbb8f0dSMatthew G. Knepley     ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr);
229cbb8f0dSMatthew G. Knepley     if (id == PETSCFE_CLASSID)      {isFE[f] = PETSC_TRUE;}
239cbb8f0dSMatthew G. Knepley     else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;}
249cbb8f0dSMatthew G. Knepley   }
25baef929fSMatthew G. Knepley 
269cbb8f0dSMatthew G. Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr);
27baef929fSMatthew G. Knepley   if (Nf > 0) {
28baef929fSMatthew G. Knepley     ierr = PetscSectionSetNumFields(*section, Nf);CHKERRQ(ierr);
299cbb8f0dSMatthew G. Knepley     if (numComp) {
30baef929fSMatthew G. Knepley       for (f = 0; f < Nf; ++f) {
319cbb8f0dSMatthew G. Knepley         ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr);
329cbb8f0dSMatthew G. Knepley         if (isFE[f]) {
339cbb8f0dSMatthew G. Knepley           PetscFE           fe;
349cbb8f0dSMatthew G. Knepley           PetscDualSpace    dspace;
359cbb8f0dSMatthew G. Knepley           const PetscInt    ***perms;
369cbb8f0dSMatthew G. Knepley           const PetscScalar ***flips;
379cbb8f0dSMatthew G. Knepley           const PetscInt    *numDof;
389cbb8f0dSMatthew G. Knepley 
3944a7f3ddSMatthew G. Knepley           ierr = DMGetField(dm,f,NULL,(PetscObject *) &fe);CHKERRQ(ierr);
409cbb8f0dSMatthew G. Knepley           ierr = PetscFEGetDualSpace(fe,&dspace);CHKERRQ(ierr);
419cbb8f0dSMatthew G. Knepley           ierr = PetscDualSpaceGetSymmetries(dspace,&perms,&flips);CHKERRQ(ierr);
429cbb8f0dSMatthew G. Knepley           ierr = PetscDualSpaceGetNumDof(dspace,&numDof);CHKERRQ(ierr);
439cbb8f0dSMatthew G. Knepley           if (perms || flips) {
449cbb8f0dSMatthew G. Knepley             DM              K;
45baef929fSMatthew G. Knepley             PetscInt        h;
469cbb8f0dSMatthew G. Knepley             PetscSectionSym sym;
479cbb8f0dSMatthew G. Knepley 
489cbb8f0dSMatthew G. Knepley             ierr = PetscDualSpaceGetDM(dspace,&K);CHKERRQ(ierr);
499cbb8f0dSMatthew G. Knepley             ierr = PetscSectionSymCreateLabel(PetscObjectComm((PetscObject)*section),depthLabel,&sym);CHKERRQ(ierr);
509cbb8f0dSMatthew G. Knepley             for (h = 0; h <= depth; h++) {
519cbb8f0dSMatthew G. Knepley               PetscDualSpace    hspace;
529cbb8f0dSMatthew G. Knepley               PetscInt          kStart, kEnd;
539cbb8f0dSMatthew G. Knepley               PetscInt          kConeSize;
549cbb8f0dSMatthew G. Knepley               const PetscInt    **perms0 = NULL;
559cbb8f0dSMatthew G. Knepley               const PetscScalar **flips0 = NULL;
569cbb8f0dSMatthew G. Knepley 
579cbb8f0dSMatthew G. Knepley               ierr = PetscDualSpaceGetHeightSubspace(dspace,h,&hspace);CHKERRQ(ierr);
589cbb8f0dSMatthew G. Knepley               ierr = DMPlexGetHeightStratum(K,h,&kStart,&kEnd);CHKERRQ(ierr);
599cbb8f0dSMatthew G. Knepley               if (!hspace) continue;
609cbb8f0dSMatthew G. Knepley               ierr = PetscDualSpaceGetSymmetries(hspace,&perms,&flips);CHKERRQ(ierr);
619cbb8f0dSMatthew G. Knepley               if (perms) perms0 = perms[0];
629cbb8f0dSMatthew G. Knepley               if (flips) flips0 = flips[0];
639cbb8f0dSMatthew G. Knepley               if (!(perms0 || flips0)) continue;
649cbb8f0dSMatthew G. Knepley               ierr = DMPlexGetConeSize(K,kStart,&kConeSize);CHKERRQ(ierr);
659cbb8f0dSMatthew G. Knepley               ierr = PetscSectionSymLabelSetStratum(sym,depth - h,numDof[depth - h],-kConeSize,kConeSize,PETSC_USE_POINTER,perms0 ? &perms0[-kConeSize] : NULL,flips0 ? &flips0[-kConeSize] : NULL);CHKERRQ(ierr);
669cbb8f0dSMatthew G. Knepley             }
679cbb8f0dSMatthew G. Knepley             ierr = PetscSectionSetFieldSym(*section,f,sym);CHKERRQ(ierr);
689cbb8f0dSMatthew G. Knepley             ierr = PetscSectionSymDestroy(&sym);CHKERRQ(ierr);
699cbb8f0dSMatthew G. Knepley           }
709cbb8f0dSMatthew G. Knepley         }
719cbb8f0dSMatthew G. Knepley       }
729cbb8f0dSMatthew G. Knepley     }
739cbb8f0dSMatthew G. Knepley   }
749cbb8f0dSMatthew G. Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
759cbb8f0dSMatthew G. Knepley   ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr);
76baef929fSMatthew G. Knepley   ierr = PetscFree(isFE);CHKERRQ(ierr);
77baef929fSMatthew G. Knepley   PetscFunctionReturn(0);
78baef929fSMatthew G. Knepley }
79baef929fSMatthew G. Knepley 
80baef929fSMatthew G. Knepley /* Set the number of dof on each point and separate by fields */
81baef929fSMatthew G. Knepley static PetscErrorCode DMPlexCreateSectionDof(DM dm, DMLabel label[],const PetscInt numDof[], PetscSection section)
82baef929fSMatthew G. Knepley {
83baef929fSMatthew G. Knepley   DMLabel        depthLabel;
84baef929fSMatthew G. Knepley   PetscInt      *pMax;
85baef929fSMatthew G. Knepley   PetscInt       depth, cellHeight, pStart = 0, pEnd = 0;
86baef929fSMatthew G. Knepley   PetscInt       Nf, f, dim, d, dep, p;
87baef929fSMatthew G. Knepley   PetscBool     *isFE;
88baef929fSMatthew G. Knepley   PetscErrorCode ierr;
89baef929fSMatthew G. Knepley 
90baef929fSMatthew G. Knepley   PetscFunctionBegin;
91baef929fSMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
929cbb8f0dSMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
93baef929fSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm,&depthLabel);CHKERRQ(ierr);
94baef929fSMatthew G. Knepley   ierr = DMGetNumFields(dm, &Nf);CHKERRQ(ierr);
95baef929fSMatthew G. Knepley   ierr = PetscMalloc1(Nf, &isFE);CHKERRQ(ierr);
96baef929fSMatthew G. Knepley   for (f = 0; f < Nf; ++f) {
97baef929fSMatthew G. Knepley     PetscObject  obj;
98baef929fSMatthew G. Knepley     PetscClassId id;
99baef929fSMatthew G. Knepley 
10044a7f3ddSMatthew G. Knepley     ierr = DMGetField(dm, f, NULL, &obj);CHKERRQ(ierr);
101baef929fSMatthew G. Knepley     ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr);
1021274e1a1SLawrence Mitchell     /* User is allowed to put a "placeholder" field in (c.f. DMCreateDS) */
1031274e1a1SLawrence Mitchell     isFE[f] = id == PETSCFE_CLASSID ? PETSC_TRUE : PETSC_FALSE;
104baef929fSMatthew G. Knepley   }
105baef929fSMatthew G. Knepley 
1069cbb8f0dSMatthew G. Knepley   ierr = PetscMalloc1(depth+1, &pMax);CHKERRQ(ierr);
1079cbb8f0dSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &pMax[depth] : NULL, depth>1 ? &pMax[depth-1] : NULL, depth>2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1089cbb8f0dSMatthew G. Knepley   ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr);
109baef929fSMatthew G. Knepley   for (f = 0; f < Nf; ++f) {
110baef929fSMatthew G. Knepley     if (label && label[f]) {
111baef929fSMatthew G. Knepley       IS              pointIS;
112baef929fSMatthew G. Knepley       const PetscInt *points;
113baef929fSMatthew G. Knepley       PetscInt        n;
114baef929fSMatthew G. Knepley 
115baef929fSMatthew G. Knepley       ierr = DMLabelGetStratumIS(label[f], 1, &pointIS);CHKERRQ(ierr);
116baef929fSMatthew G. Knepley       if (!pointIS) continue;
117baef929fSMatthew G. Knepley       ierr = ISGetLocalSize(pointIS, &n);CHKERRQ(ierr);
118baef929fSMatthew G. Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
119baef929fSMatthew G. Knepley       for (p = 0; p < n; ++p) {
120baef929fSMatthew G. Knepley         const PetscInt point = points[p];
121baef929fSMatthew G. Knepley         PetscInt       dof, d;
122baef929fSMatthew G. Knepley 
123baef929fSMatthew G. Knepley         ierr = DMLabelGetValue(depthLabel, point, &d);CHKERRQ(ierr);
124baef929fSMatthew G. Knepley         ierr = DMPlexGetDepthStratum(dm, d, NULL, &pEnd);CHKERRQ(ierr);
125baef929fSMatthew G. Knepley         /* If this is a hybrid point, use dof for one dimension lower */
126baef929fSMatthew G. Knepley         if ((point >= pMax[d]) && (point < pEnd)) --d;
127baef929fSMatthew G. Knepley         dof  = d < 0 ? 0 : numDof[f*(dim+1)+d];
128baef929fSMatthew G. Knepley         ierr = PetscSectionSetFieldDof(section, point, f, dof);CHKERRQ(ierr);
129baef929fSMatthew G. Knepley         ierr = PetscSectionAddDof(section, point, dof);CHKERRQ(ierr);
130baef929fSMatthew G. Knepley       }
131baef929fSMatthew G. Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
132baef929fSMatthew G. Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
133baef929fSMatthew G. Knepley     } else {
1349cbb8f0dSMatthew G. Knepley       for (dep = 0; dep <= depth - cellHeight; ++dep) {
1353fd2e703SMatthew G. Knepley         /* Cases: dim > depth (cell-vertex mesh), dim == depth (fully interpolated), dim < depth (interpolated submesh) */
1363fd2e703SMatthew G. Knepley         d    = dim <= depth ? dep : (!dep ? 0 : dim);
1379cbb8f0dSMatthew G. Knepley         ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr);
1389cbb8f0dSMatthew G. Knepley         pMax[dep] = pMax[dep] < 0 ? pEnd : pMax[dep];
1399cbb8f0dSMatthew G. Knepley         for (p = pStart; p < pEnd; ++p) {
140baef929fSMatthew G. Knepley           const PetscInt dof = numDof[f*(dim+1)+d];
1419cbb8f0dSMatthew G. Knepley 
1429cbb8f0dSMatthew G. Knepley           if (isFE[f] && p >= pMax[dep]) continue;
143baef929fSMatthew G. Knepley           ierr = PetscSectionSetFieldDof(section, p, f, dof);CHKERRQ(ierr);
144baef929fSMatthew G. Knepley           ierr = PetscSectionAddDof(section, p, dof);CHKERRQ(ierr);
1459cbb8f0dSMatthew G. Knepley         }
146baef929fSMatthew G. Knepley       }
1479cbb8f0dSMatthew G. Knepley     }
1489cbb8f0dSMatthew G. Knepley   }
1499cbb8f0dSMatthew G. Knepley   ierr = PetscFree(pMax);CHKERRQ(ierr);
1509cbb8f0dSMatthew G. Knepley   ierr = PetscFree(isFE);CHKERRQ(ierr);
1519cbb8f0dSMatthew G. Knepley   PetscFunctionReturn(0);
1529cbb8f0dSMatthew G. Knepley }
1539cbb8f0dSMatthew G. Knepley 
1549cbb8f0dSMatthew G. Knepley /* Set the number of dof on each point and separate by fields
1559cbb8f0dSMatthew G. Knepley    If bcComps is NULL or the IS is NULL, constrain every dof on the point
1569cbb8f0dSMatthew G. Knepley */
1579cbb8f0dSMatthew G. Knepley static PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC, const PetscInt bcField[], const IS bcComps[], const IS bcPoints[], PetscSection section)
1589cbb8f0dSMatthew G. Knepley {
159baef929fSMatthew G. Knepley   PetscInt       Nf;
1609cbb8f0dSMatthew G. Knepley   PetscInt       bc;
1619cbb8f0dSMatthew G. Knepley   PetscSection   aSec;
1629cbb8f0dSMatthew G. Knepley   PetscErrorCode ierr;
1639cbb8f0dSMatthew G. Knepley 
1649cbb8f0dSMatthew G. Knepley   PetscFunctionBegin;
165baef929fSMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &Nf);CHKERRQ(ierr);
1669cbb8f0dSMatthew G. Knepley   for (bc = 0; bc < numBC; ++bc) {
1679cbb8f0dSMatthew G. Knepley     PetscInt        field = 0;
1689cbb8f0dSMatthew G. Knepley     const PetscInt *comp;
1699cbb8f0dSMatthew G. Knepley     const PetscInt *idx;
170ce093827SMatthew G. Knepley     PetscInt        Nc = 0, cNc = -1, n, i;
1719cbb8f0dSMatthew G. Knepley 
172ce093827SMatthew G. Knepley     if (Nf) {
173ce093827SMatthew G. Knepley       field = bcField[bc];
174ce093827SMatthew G. Knepley       ierr = PetscSectionGetFieldComponents(section, field, &Nc);CHKERRQ(ierr);
175ce093827SMatthew G. Knepley     }
176ce093827SMatthew G. Knepley     if (bcComps && bcComps[bc]) {ierr = ISGetLocalSize(bcComps[bc], &cNc);CHKERRQ(ierr);}
1779cbb8f0dSMatthew G. Knepley     if (bcComps && bcComps[bc]) {ierr = ISGetIndices(bcComps[bc], &comp);CHKERRQ(ierr);}
1789cbb8f0dSMatthew G. Knepley     ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr);
1799cbb8f0dSMatthew G. Knepley     ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
1809cbb8f0dSMatthew G. Knepley     for (i = 0; i < n; ++i) {
1819cbb8f0dSMatthew G. Knepley       const PetscInt p = idx[i];
1829cbb8f0dSMatthew G. Knepley       PetscInt       numConst;
1839cbb8f0dSMatthew G. Knepley 
184baef929fSMatthew G. Knepley       if (Nf) {
1859cbb8f0dSMatthew G. Knepley         ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr);
1869cbb8f0dSMatthew G. Knepley       } else {
1879cbb8f0dSMatthew G. Knepley         ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr);
1889cbb8f0dSMatthew G. Knepley       }
189ce093827SMatthew G. Knepley       /* If Nc <= 0, constrain every dof on the point */
190ce093827SMatthew G. Knepley       if (cNc > 0) {
191ce093827SMatthew G. Knepley         /* We assume that a point may have multiple "nodes", which are collections of Nc dofs,
192ce093827SMatthew G. Knepley            and that those dofs are numbered n*Nc+c */
193ce093827SMatthew G. Knepley         if (Nf) {
194ce093827SMatthew G. Knepley           if (numConst % Nc) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Point %D has %D dof which is not divisible by %D field components", p, numConst, Nc);
195ce093827SMatthew G. Knepley           numConst = (numConst/Nc) * cNc;
196ce093827SMatthew G. Knepley         } else {
197ce093827SMatthew G. Knepley           numConst = PetscMin(numConst, cNc);
198ce093827SMatthew G. Knepley         }
199ce093827SMatthew G. Knepley       }
200baef929fSMatthew G. Knepley       if (Nf) {ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr);}
2019cbb8f0dSMatthew G. Knepley       ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr);
2029cbb8f0dSMatthew G. Knepley     }
2039cbb8f0dSMatthew G. Knepley     ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
2049cbb8f0dSMatthew G. Knepley     if (bcComps && bcComps[bc]) {ierr = ISRestoreIndices(bcComps[bc], &comp);CHKERRQ(ierr);}
2059cbb8f0dSMatthew G. Knepley   }
2069cbb8f0dSMatthew G. Knepley   ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr);
2079cbb8f0dSMatthew G. Knepley   if (aSec) {
2089cbb8f0dSMatthew G. Knepley     PetscInt aStart, aEnd, a;
2099cbb8f0dSMatthew G. Knepley 
2109cbb8f0dSMatthew G. Knepley     ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr);
2119cbb8f0dSMatthew G. Knepley     for (a = aStart; a < aEnd; a++) {
2129cbb8f0dSMatthew G. Knepley       PetscInt dof, f;
2139cbb8f0dSMatthew G. Knepley 
2149cbb8f0dSMatthew G. Knepley       ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr);
2159cbb8f0dSMatthew G. Knepley       if (dof) {
2169cbb8f0dSMatthew G. Knepley         /* if there are point-to-point constraints, then all dofs are constrained */
2179cbb8f0dSMatthew G. Knepley         ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr);
2189cbb8f0dSMatthew G. Knepley         ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr);
219baef929fSMatthew G. Knepley         for (f = 0; f < Nf; f++) {
2209cbb8f0dSMatthew G. Knepley           ierr = PetscSectionGetFieldDof(section, a, f, &dof);CHKERRQ(ierr);
2219cbb8f0dSMatthew G. Knepley           ierr = PetscSectionSetFieldConstraintDof(section, a, f, dof);CHKERRQ(ierr);
2229cbb8f0dSMatthew G. Knepley         }
2239cbb8f0dSMatthew G. Knepley       }
2249cbb8f0dSMatthew G. Knepley     }
2259cbb8f0dSMatthew G. Knepley   }
2269cbb8f0dSMatthew G. Knepley   PetscFunctionReturn(0);
2279cbb8f0dSMatthew G. Knepley }
2289cbb8f0dSMatthew G. Knepley 
2299cbb8f0dSMatthew G. Knepley /* Set the constrained field indices on each point
2309cbb8f0dSMatthew G. Knepley    If bcComps is NULL or the IS is NULL, constrain every dof on the point
2319cbb8f0dSMatthew G. Knepley */
2329cbb8f0dSMatthew G. Knepley static PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt numBC,const PetscInt bcField[], const IS bcComps[], const IS bcPoints[], PetscSection section)
2339cbb8f0dSMatthew G. Knepley {
2349cbb8f0dSMatthew G. Knepley   PetscSection   aSec;
2359cbb8f0dSMatthew G. Knepley   PetscInt      *indices;
236baef929fSMatthew G. Knepley   PetscInt       Nf, cdof, maxDof = 0, pStart, pEnd, p, bc, f, d;
2379cbb8f0dSMatthew G. Knepley   PetscErrorCode ierr;
2389cbb8f0dSMatthew G. Knepley 
2399cbb8f0dSMatthew G. Knepley   PetscFunctionBegin;
240baef929fSMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &Nf);CHKERRQ(ierr);
241baef929fSMatthew G. Knepley   if (!Nf) PetscFunctionReturn(0);
2429cbb8f0dSMatthew G. Knepley   /* Initialize all field indices to -1 */
2439cbb8f0dSMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
2449cbb8f0dSMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); maxDof = PetscMax(maxDof, cdof);}
2459cbb8f0dSMatthew G. Knepley   ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr);
2469cbb8f0dSMatthew G. Knepley   for (d = 0; d < maxDof; ++d) indices[d] = -1;
247baef929fSMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) for (f = 0; f < Nf; ++f) {ierr = PetscSectionSetFieldConstraintIndices(section, p, f, indices);CHKERRQ(ierr);}
2489cbb8f0dSMatthew G. Knepley   /* Handle BC constraints */
2499cbb8f0dSMatthew G. Knepley   for (bc = 0; bc < numBC; ++bc) {
2509cbb8f0dSMatthew G. Knepley     const PetscInt  field = bcField[bc];
2519cbb8f0dSMatthew G. Knepley     const PetscInt *comp, *idx;
252ce093827SMatthew G. Knepley     PetscInt        Nc, cNc = -1, n, i;
2539cbb8f0dSMatthew G. Knepley 
254ce093827SMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(section, field, &Nc);CHKERRQ(ierr);
255ce093827SMatthew G. Knepley     if (bcComps && bcComps[bc]) {ierr = ISGetLocalSize(bcComps[bc], &cNc);CHKERRQ(ierr);}
2569cbb8f0dSMatthew G. Knepley     if (bcComps && bcComps[bc]) {ierr = ISGetIndices(bcComps[bc], &comp);CHKERRQ(ierr);}
2579cbb8f0dSMatthew G. Knepley     ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr);
2589cbb8f0dSMatthew G. Knepley     ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
2599cbb8f0dSMatthew G. Knepley     for (i = 0; i < n; ++i) {
2609cbb8f0dSMatthew G. Knepley       const PetscInt  p = idx[i];
2619cbb8f0dSMatthew G. Knepley       const PetscInt *find;
262ce093827SMatthew G. Knepley       PetscInt        fdof, fcdof, c, j;
2639cbb8f0dSMatthew G. Knepley 
2649cbb8f0dSMatthew G. Knepley       ierr = PetscSectionGetFieldDof(section, p, field, &fdof);CHKERRQ(ierr);
2659cbb8f0dSMatthew G. Knepley       if (!fdof) continue;
266ce093827SMatthew G. Knepley       if (cNc < 0) {
2679cbb8f0dSMatthew G. Knepley         for (d = 0; d < fdof; ++d) indices[d] = d;
2689cbb8f0dSMatthew G. Knepley         fcdof = fdof;
2699cbb8f0dSMatthew G. Knepley       } else {
270ce093827SMatthew G. Knepley         /* We assume that a point may have multiple "nodes", which are collections of Nc dofs,
271ce093827SMatthew G. Knepley            and that those dofs are numbered n*Nc+c */
2729cbb8f0dSMatthew G. Knepley         ierr = PetscSectionGetFieldConstraintDof(section, p, field, &fcdof);CHKERRQ(ierr);
2739cbb8f0dSMatthew G. Knepley         ierr = PetscSectionGetFieldConstraintIndices(section, p, field, &find);CHKERRQ(ierr);
274ce093827SMatthew G. Knepley         /* Get indices constrained by previous bcs */
2759cbb8f0dSMatthew G. Knepley         for (d = 0; d < fcdof; ++d) {if (find[d] < 0) break; indices[d] = find[d];}
276ce093827SMatthew G. Knepley         for (j = 0; j < fdof/Nc; ++j) for (c = 0; c < cNc; ++c) indices[d++] = j*Nc + comp[c];
2779cbb8f0dSMatthew G. Knepley         ierr = PetscSortRemoveDupsInt(&d, indices);CHKERRQ(ierr);
2789cbb8f0dSMatthew G. Knepley         for (c = d; c < fcdof; ++c) indices[c] = -1;
2799cbb8f0dSMatthew G. Knepley         fcdof = d;
2809cbb8f0dSMatthew G. Knepley       }
2819cbb8f0dSMatthew G. Knepley       ierr = PetscSectionSetFieldConstraintDof(section, p, field, fcdof);CHKERRQ(ierr);
2829cbb8f0dSMatthew G. Knepley       ierr = PetscSectionSetFieldConstraintIndices(section, p, field, indices);CHKERRQ(ierr);
2839cbb8f0dSMatthew G. Knepley     }
2849cbb8f0dSMatthew G. Knepley     if (bcComps && bcComps[bc]) {ierr = ISRestoreIndices(bcComps[bc], &comp);CHKERRQ(ierr);}
2859cbb8f0dSMatthew G. Knepley     ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
2869cbb8f0dSMatthew G. Knepley   }
2879cbb8f0dSMatthew G. Knepley   /* Handle anchors */
2889cbb8f0dSMatthew G. Knepley   ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr);
2899cbb8f0dSMatthew G. Knepley   if (aSec) {
2909cbb8f0dSMatthew G. Knepley     PetscInt aStart, aEnd, a;
2919cbb8f0dSMatthew G. Knepley 
2929cbb8f0dSMatthew G. Knepley     for (d = 0; d < maxDof; ++d) indices[d] = d;
2939cbb8f0dSMatthew G. Knepley     ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr);
2949cbb8f0dSMatthew G. Knepley     for (a = aStart; a < aEnd; a++) {
2959cbb8f0dSMatthew G. Knepley       PetscInt dof, f;
2969cbb8f0dSMatthew G. Knepley 
2979cbb8f0dSMatthew G. Knepley       ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr);
2989cbb8f0dSMatthew G. Knepley       if (dof) {
2999cbb8f0dSMatthew G. Knepley         /* if there are point-to-point constraints, then all dofs are constrained */
300baef929fSMatthew G. Knepley         for (f = 0; f < Nf; f++) {
3019cbb8f0dSMatthew G. Knepley           ierr = PetscSectionSetFieldConstraintIndices(section, a, f, indices);CHKERRQ(ierr);
3029cbb8f0dSMatthew G. Knepley         }
3039cbb8f0dSMatthew G. Knepley       }
3049cbb8f0dSMatthew G. Knepley     }
3059cbb8f0dSMatthew G. Knepley   }
3069cbb8f0dSMatthew G. Knepley   ierr = PetscFree(indices);CHKERRQ(ierr);
3079cbb8f0dSMatthew G. Knepley   PetscFunctionReturn(0);
3089cbb8f0dSMatthew G. Knepley }
3099cbb8f0dSMatthew G. Knepley 
3109cbb8f0dSMatthew G. Knepley /* Set the constrained indices on each point */
3119cbb8f0dSMatthew G. Knepley static PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section)
3129cbb8f0dSMatthew G. Knepley {
3139cbb8f0dSMatthew G. Knepley   PetscInt      *indices;
314baef929fSMatthew G. Knepley   PetscInt       Nf, maxDof, pStart, pEnd, p, f, d;
3159cbb8f0dSMatthew G. Knepley   PetscErrorCode ierr;
3169cbb8f0dSMatthew G. Knepley 
3179cbb8f0dSMatthew G. Knepley   PetscFunctionBegin;
318baef929fSMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &Nf);CHKERRQ(ierr);
3199cbb8f0dSMatthew G. Knepley   ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
3209cbb8f0dSMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3219cbb8f0dSMatthew G. Knepley   ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr);
3229cbb8f0dSMatthew G. Knepley   for (d = 0; d < maxDof; ++d) indices[d] = -1;
3239cbb8f0dSMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {
3249cbb8f0dSMatthew G. Knepley     PetscInt cdof, d;
3259cbb8f0dSMatthew G. Knepley 
3269cbb8f0dSMatthew G. Knepley     ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
3279cbb8f0dSMatthew G. Knepley     if (cdof) {
328baef929fSMatthew G. Knepley       if (Nf) {
3299cbb8f0dSMatthew G. Knepley         PetscInt numConst = 0, foff = 0;
3309cbb8f0dSMatthew G. Knepley 
331baef929fSMatthew G. Knepley         for (f = 0; f < Nf; ++f) {
3329cbb8f0dSMatthew G. Knepley           const PetscInt *find;
3339cbb8f0dSMatthew G. Knepley           PetscInt        fcdof, fdof;
3349cbb8f0dSMatthew G. Knepley 
3359cbb8f0dSMatthew G. Knepley           ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr);
3369cbb8f0dSMatthew G. Knepley           ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr);
3379cbb8f0dSMatthew G. Knepley           /* Change constraint numbering from field component to local dof number */
3389cbb8f0dSMatthew G. Knepley           ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &find);CHKERRQ(ierr);
3399cbb8f0dSMatthew G. Knepley           for (d = 0; d < fcdof; ++d) indices[numConst+d] = find[d] + foff;
3409cbb8f0dSMatthew G. Knepley           numConst += fcdof;
3419cbb8f0dSMatthew G. Knepley           foff     += fdof;
3429cbb8f0dSMatthew G. Knepley         }
3439cbb8f0dSMatthew G. Knepley         if (cdof != numConst) {ierr = PetscSectionSetConstraintDof(section, p, numConst);CHKERRQ(ierr);}
3449cbb8f0dSMatthew G. Knepley       } else {
3459cbb8f0dSMatthew G. Knepley         for (d = 0; d < cdof; ++d) indices[d] = d;
3469cbb8f0dSMatthew G. Knepley       }
3479cbb8f0dSMatthew G. Knepley       ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr);
3489cbb8f0dSMatthew G. Knepley     }
3499cbb8f0dSMatthew G. Knepley   }
3509cbb8f0dSMatthew G. Knepley   ierr = PetscFree(indices);CHKERRQ(ierr);
3519cbb8f0dSMatthew G. Knepley   PetscFunctionReturn(0);
3529cbb8f0dSMatthew G. Knepley }
3539cbb8f0dSMatthew G. Knepley 
3549cbb8f0dSMatthew G. Knepley /*@C
3559cbb8f0dSMatthew G. Knepley   DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided.
3569cbb8f0dSMatthew G. Knepley 
3579cbb8f0dSMatthew G. Knepley   Not Collective
3589cbb8f0dSMatthew G. Knepley 
3599cbb8f0dSMatthew G. Knepley   Input Parameters:
3609cbb8f0dSMatthew G. Knepley + dm        - The DMPlex object
36192cfd99aSMartin Diehl . label     - The label indicating the mesh support of each field, or NULL for the whole mesh
3629cbb8f0dSMatthew G. Knepley . numComp   - An array of size numFields that holds the number of components for each field
3639cbb8f0dSMatthew G. Knepley . numDof    - An array of size numFields*(dim+1) which holds the number of dof for each field on a mesh piece of dimension d
3649cbb8f0dSMatthew G. Knepley . numBC     - The number of boundary conditions
3659cbb8f0dSMatthew G. Knepley . bcField   - An array of size numBC giving the field number for each boundry condition
3669cbb8f0dSMatthew G. Knepley . bcComps   - [Optional] An array of size numBC giving an IS holding the field components to which each boundary condition applies
3679cbb8f0dSMatthew G. Knepley . bcPoints  - An array of size numBC giving an IS holding the Plex points to which each boundary condition applies
3689cbb8f0dSMatthew G. Knepley - perm      - Optional permutation of the chart, or NULL
3699cbb8f0dSMatthew G. Knepley 
3709cbb8f0dSMatthew G. Knepley   Output Parameter:
3719cbb8f0dSMatthew G. Knepley . section - The PetscSection object
3729cbb8f0dSMatthew G. Knepley 
3739cbb8f0dSMatthew G. Knepley   Notes:
3749cbb8f0dSMatthew G. Knepley     numDof[f*(dim+1)+d] gives the number of dof for field f on points of dimension d. For instance, numDof[1] is the
3759cbb8f0dSMatthew G. Knepley   number of dof for field 0 on each edge.
3769cbb8f0dSMatthew G. Knepley 
3779cbb8f0dSMatthew G. Knepley   The chart permutation is the same one set using PetscSectionSetPermutation()
3789cbb8f0dSMatthew G. Knepley 
3799cbb8f0dSMatthew G. Knepley   Level: developer
3809cbb8f0dSMatthew G. Knepley 
3811bb6d2a8SBarry Smith   TODO: How is this related to DMCreateLocalSection()
3821bb6d2a8SBarry Smith 
3839cbb8f0dSMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation()
3849cbb8f0dSMatthew G. Knepley @*/
385baef929fSMatthew G. Knepley PetscErrorCode DMPlexCreateSection(DM dm, DMLabel label[], const PetscInt numComp[],const PetscInt numDof[], PetscInt numBC, const PetscInt bcField[], const IS bcComps[], const IS bcPoints[], IS perm, PetscSection *section)
3869cbb8f0dSMatthew G. Knepley {
3879cbb8f0dSMatthew G. Knepley   PetscSection   aSec;
3889cbb8f0dSMatthew G. Knepley   PetscErrorCode ierr;
3899cbb8f0dSMatthew G. Knepley 
3909cbb8f0dSMatthew G. Knepley   PetscFunctionBegin;
391baef929fSMatthew G. Knepley   ierr = DMPlexCreateSectionFields(dm, numComp, section);CHKERRQ(ierr);
392baef929fSMatthew G. Knepley   ierr = DMPlexCreateSectionDof(dm, label, numDof, *section);CHKERRQ(ierr);
3939cbb8f0dSMatthew G. Knepley   ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcComps, bcPoints, *section);CHKERRQ(ierr);
3949cbb8f0dSMatthew G. Knepley   if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);}
3959cbb8f0dSMatthew G. Knepley   ierr = PetscSectionSetFromOptions(*section);CHKERRQ(ierr);
3969cbb8f0dSMatthew G. Knepley   ierr = PetscSectionSetUp(*section);CHKERRQ(ierr);
3979cbb8f0dSMatthew G. Knepley   ierr = DMPlexGetAnchors(dm,&aSec,NULL);CHKERRQ(ierr);
3989cbb8f0dSMatthew G. Knepley   if (numBC || aSec) {
3999cbb8f0dSMatthew G. Knepley     ierr = DMPlexCreateSectionBCIndicesField(dm, numBC, bcField, bcComps, bcPoints, *section);CHKERRQ(ierr);
4009cbb8f0dSMatthew G. Knepley     ierr = DMPlexCreateSectionBCIndices(dm, *section);CHKERRQ(ierr);
4019cbb8f0dSMatthew G. Knepley   }
4029cbb8f0dSMatthew G. Knepley   ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr);
4039cbb8f0dSMatthew G. Knepley   PetscFunctionReturn(0);
4049cbb8f0dSMatthew G. Knepley }
4059cbb8f0dSMatthew G. Knepley 
4061bb6d2a8SBarry Smith PetscErrorCode DMCreateLocalSection_Plex(DM dm)
4079cbb8f0dSMatthew G. Knepley {
408e5e52638SMatthew G. Knepley   PetscDS        probBC;
4099cbb8f0dSMatthew G. Knepley   PetscSection   section;
410baef929fSMatthew G. Knepley   DMLabel       *labels;
4119cbb8f0dSMatthew G. Knepley   IS            *bcPoints, *bcComps;
4129cbb8f0dSMatthew G. Knepley   PetscBool     *isFE;
4139cbb8f0dSMatthew G. Knepley   PetscInt      *bcFields, *numComp, *numDof;
414baef929fSMatthew G. Knepley   PetscInt       depth, dim, numBd, numBC = 0, Nf, bd, bc = 0, f;
4159cbb8f0dSMatthew G. Knepley   PetscInt       cStart, cEnd, cEndInterior;
4169cbb8f0dSMatthew G. Knepley   PetscErrorCode ierr;
4179cbb8f0dSMatthew G. Knepley 
4189cbb8f0dSMatthew G. Knepley   PetscFunctionBegin;
419baef929fSMatthew G. Knepley   ierr = DMGetNumFields(dm, &Nf);CHKERRQ(ierr);
4209cbb8f0dSMatthew G. Knepley   /* FE and FV boundary conditions are handled slightly differently */
421baef929fSMatthew G. Knepley   ierr = PetscMalloc1(Nf, &isFE);CHKERRQ(ierr);
422baef929fSMatthew G. Knepley   for (f = 0; f < Nf; ++f) {
4239cbb8f0dSMatthew G. Knepley     PetscObject  obj;
4249cbb8f0dSMatthew G. Knepley     PetscClassId id;
4259cbb8f0dSMatthew G. Knepley 
42644a7f3ddSMatthew G. Knepley     ierr = DMGetField(dm, f, NULL, &obj);CHKERRQ(ierr);
4279cbb8f0dSMatthew G. Knepley     ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr);
4289cbb8f0dSMatthew G. Knepley     if (id == PETSCFE_CLASSID)      {isFE[f] = PETSC_TRUE;}
4299cbb8f0dSMatthew G. Knepley     else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;}
4309cbb8f0dSMatthew G. Knepley     else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Unknown discretization type for field %D", f);
4319cbb8f0dSMatthew G. Knepley   }
4329cbb8f0dSMatthew G. Knepley   /* Allocate boundary point storage for FEM boundaries */
4339cbb8f0dSMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
4349cbb8f0dSMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
4359cbb8f0dSMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
436485ad865SMatthew G. Knepley   ierr = DMPlexGetGhostCellStratum(dm, &cEndInterior, NULL);CHKERRQ(ierr);
437e5e52638SMatthew G. Knepley   ierr = DMGetDS(dm, &probBC);CHKERRQ(ierr);
438e5e52638SMatthew G. Knepley   ierr = PetscDSGetNumBoundary(probBC, &numBd);CHKERRQ(ierr);
439baef929fSMatthew G. Knepley   if (!Nf && numBd) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "number of fields is zero and number of boundary conditions is nonzero (this should never happen)");
4409cbb8f0dSMatthew G. Knepley   for (bd = 0; bd < numBd; ++bd) {
4419cbb8f0dSMatthew G. Knepley     PetscInt                field;
4429cbb8f0dSMatthew G. Knepley     DMBoundaryConditionType type;
4439cbb8f0dSMatthew G. Knepley     const char             *labelName;
4449cbb8f0dSMatthew G. Knepley     DMLabel                 label;
4459cbb8f0dSMatthew G. Knepley 
446e5e52638SMatthew G. Knepley     ierr = PetscDSGetBoundary(probBC, bd, &type, NULL, &labelName, &field, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr);
4479cbb8f0dSMatthew G. Knepley     ierr = DMGetLabel(dm,labelName,&label);CHKERRQ(ierr);
4489cbb8f0dSMatthew G. Knepley     if (label && isFE[field] && (type & DM_BC_ESSENTIAL)) ++numBC;
4499cbb8f0dSMatthew G. Knepley   }
4509cbb8f0dSMatthew G. Knepley   /* Add ghost cell boundaries for FVM */
451baef929fSMatthew G. Knepley   for (f = 0; f < Nf; ++f) if (!isFE[f] && cEndInterior >= 0) ++numBC;
4529cbb8f0dSMatthew G. Knepley   ierr = PetscCalloc3(numBC,&bcFields,numBC,&bcPoints,numBC,&bcComps);CHKERRQ(ierr);
4539cbb8f0dSMatthew G. Knepley   /* Constrain ghost cells for FV */
454baef929fSMatthew G. Knepley   for (f = 0; f < Nf; ++f) {
4559cbb8f0dSMatthew G. Knepley     PetscInt *newidx, c;
4569cbb8f0dSMatthew G. Knepley 
4579cbb8f0dSMatthew G. Knepley     if (isFE[f] || cEndInterior < 0) continue;
4589cbb8f0dSMatthew G. Knepley     ierr = PetscMalloc1(cEnd-cEndInterior,&newidx);CHKERRQ(ierr);
4599cbb8f0dSMatthew G. Knepley     for (c = cEndInterior; c < cEnd; ++c) newidx[c-cEndInterior] = c;
4609cbb8f0dSMatthew G. Knepley     bcFields[bc] = f;
461*69293d4bSJed Brown     ierr = ISCreateGeneral(PETSC_COMM_SELF, cEnd-cEndInterior, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr);
4629cbb8f0dSMatthew G. Knepley   }
4639cbb8f0dSMatthew G. Knepley   /* Handle FEM Dirichlet boundaries */
4649cbb8f0dSMatthew G. Knepley   for (bd = 0; bd < numBd; ++bd) {
4659cbb8f0dSMatthew G. Knepley     const char             *bdLabel;
4669cbb8f0dSMatthew G. Knepley     DMLabel                 label;
4679cbb8f0dSMatthew G. Knepley     const PetscInt         *comps;
4689cbb8f0dSMatthew G. Knepley     const PetscInt         *values;
4699cbb8f0dSMatthew G. Knepley     PetscInt                bd2, field, numComps, numValues;
4709cbb8f0dSMatthew G. Knepley     DMBoundaryConditionType type;
4719cbb8f0dSMatthew G. Knepley     PetscBool               duplicate = PETSC_FALSE;
4729cbb8f0dSMatthew G. Knepley 
473e5e52638SMatthew G. Knepley     ierr = PetscDSGetBoundary(probBC, bd, &type, NULL, &bdLabel, &field, &numComps, &comps, NULL, &numValues, &values, NULL);CHKERRQ(ierr);
4749cbb8f0dSMatthew G. Knepley     ierr = DMGetLabel(dm, bdLabel, &label);CHKERRQ(ierr);
4759cbb8f0dSMatthew G. Knepley     if (!isFE[field] || !label) continue;
4769cbb8f0dSMatthew G. Knepley     /* Only want to modify label once */
4779cbb8f0dSMatthew G. Knepley     for (bd2 = 0; bd2 < bd; ++bd2) {
4789cbb8f0dSMatthew G. Knepley       const char *bdname;
479e5e52638SMatthew G. Knepley       ierr = PetscDSGetBoundary(probBC, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr);
4809cbb8f0dSMatthew G. Knepley       ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr);
4819cbb8f0dSMatthew G. Knepley       if (duplicate) break;
4829cbb8f0dSMatthew G. Knepley     }
4839cbb8f0dSMatthew G. Knepley     if (!duplicate && (isFE[field])) {
4849cbb8f0dSMatthew G. Knepley       /* don't complete cells, which are just present to give orientation to the boundary */
4859cbb8f0dSMatthew G. Knepley       ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr);
4869cbb8f0dSMatthew G. Knepley     }
4879cbb8f0dSMatthew G. Knepley     /* Filter out cells, if you actually want to constrain cells you need to do things by hand right now */
4889cbb8f0dSMatthew G. Knepley     if (type & DM_BC_ESSENTIAL) {
4899cbb8f0dSMatthew G. Knepley       PetscInt       *newidx;
4909cbb8f0dSMatthew G. Knepley       PetscInt        n, newn = 0, p, v;
4919cbb8f0dSMatthew G. Knepley 
4929cbb8f0dSMatthew G. Knepley       bcFields[bc] = field;
493*69293d4bSJed Brown       if (numComps) {ierr = ISCreateGeneral(PETSC_COMM_SELF, numComps, comps, PETSC_COPY_VALUES, &bcComps[bc]);CHKERRQ(ierr);}
4949cbb8f0dSMatthew G. Knepley       for (v = 0; v < numValues; ++v) {
4959cbb8f0dSMatthew G. Knepley         IS              tmp;
4969cbb8f0dSMatthew G. Knepley         const PetscInt *idx;
4979cbb8f0dSMatthew G. Knepley 
4989cbb8f0dSMatthew G. Knepley         ierr = DMGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr);
4999cbb8f0dSMatthew G. Knepley         if (!tmp) continue;
5009cbb8f0dSMatthew G. Knepley         ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr);
5019cbb8f0dSMatthew G. Knepley         ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr);
5029cbb8f0dSMatthew G. Knepley         if (isFE[field]) {
5039cbb8f0dSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn;
5049cbb8f0dSMatthew G. Knepley         } else {
5059cbb8f0dSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) ++newn;
5069cbb8f0dSMatthew G. Knepley         }
5079cbb8f0dSMatthew G. Knepley         ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr);
5089cbb8f0dSMatthew G. Knepley         ierr = ISDestroy(&tmp);CHKERRQ(ierr);
5099cbb8f0dSMatthew G. Knepley       }
5109cbb8f0dSMatthew G. Knepley       ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr);
5119cbb8f0dSMatthew G. Knepley       newn = 0;
5129cbb8f0dSMatthew G. Knepley       for (v = 0; v < numValues; ++v) {
5139cbb8f0dSMatthew G. Knepley         IS              tmp;
5149cbb8f0dSMatthew G. Knepley         const PetscInt *idx;
5159cbb8f0dSMatthew G. Knepley 
5169cbb8f0dSMatthew G. Knepley         ierr = DMGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr);
5179cbb8f0dSMatthew G. Knepley         if (!tmp) continue;
5189cbb8f0dSMatthew G. Knepley         ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr);
5199cbb8f0dSMatthew G. Knepley         ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr);
5209cbb8f0dSMatthew G. Knepley         if (isFE[field]) {
5219cbb8f0dSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p];
5229cbb8f0dSMatthew G. Knepley         } else {
5239cbb8f0dSMatthew G. Knepley           for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) newidx[newn++] = idx[p];
5249cbb8f0dSMatthew G. Knepley         }
5259cbb8f0dSMatthew G. Knepley         ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr);
5269cbb8f0dSMatthew G. Knepley         ierr = ISDestroy(&tmp);CHKERRQ(ierr);
5279cbb8f0dSMatthew G. Knepley       }
528*69293d4bSJed Brown       ierr = ISCreateGeneral(PETSC_COMM_SELF, newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr);
5299cbb8f0dSMatthew G. Knepley     }
5309cbb8f0dSMatthew G. Knepley   }
5319cbb8f0dSMatthew G. Knepley   /* Handle discretization */
532baef929fSMatthew G. Knepley   ierr = PetscCalloc3(Nf,&labels,Nf,&numComp,Nf*(dim+1),&numDof);CHKERRQ(ierr);
533baef929fSMatthew G. Knepley   for (f = 0; f < Nf; ++f) {
53444a7f3ddSMatthew G. Knepley     labels[f] = dm->fields[f].label;
5359cbb8f0dSMatthew G. Knepley     if (isFE[f]) {
53644a7f3ddSMatthew G. Knepley       PetscFE         fe = (PetscFE) dm->fields[f].disc;
5379cbb8f0dSMatthew G. Knepley       const PetscInt *numFieldDof;
538a3254110SMatthew Knepley       PetscInt        fedim, d;
5399cbb8f0dSMatthew G. Knepley 
5409cbb8f0dSMatthew G. Knepley       ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr);
5419cbb8f0dSMatthew G. Knepley       ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr);
542a3254110SMatthew Knepley       ierr = PetscFEGetSpatialDimension(fe, &fedim);CHKERRQ(ierr);
543a3254110SMatthew Knepley       for (d = 0; d < PetscMin(dim, fedim)+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d];
5449cbb8f0dSMatthew G. Knepley     } else {
54544a7f3ddSMatthew G. Knepley       PetscFV fv = (PetscFV) dm->fields[f].disc;
5469cbb8f0dSMatthew G. Knepley 
5479cbb8f0dSMatthew G. Knepley       ierr = PetscFVGetNumComponents(fv, &numComp[f]);CHKERRQ(ierr);
5489cbb8f0dSMatthew G. Knepley       numDof[f*(dim+1)+dim] = numComp[f];
5499cbb8f0dSMatthew G. Knepley     }
5509cbb8f0dSMatthew G. Knepley   }
551baef929fSMatthew G. Knepley   for (f = 0; f < Nf; ++f) {
5529cbb8f0dSMatthew G. Knepley     PetscInt d;
5539cbb8f0dSMatthew G. Knepley     for (d = 1; d < dim; ++d) {
5549cbb8f0dSMatthew 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.");
5559cbb8f0dSMatthew G. Knepley     }
5569cbb8f0dSMatthew G. Knepley   }
557baef929fSMatthew G. Knepley   ierr = DMPlexCreateSection(dm, labels, numComp, numDof, numBC, bcFields, bcComps, bcPoints, NULL, &section);CHKERRQ(ierr);
558baef929fSMatthew G. Knepley   for (f = 0; f < Nf; ++f) {
5599cbb8f0dSMatthew G. Knepley     PetscFE     fe;
5609cbb8f0dSMatthew G. Knepley     const char *name;
5619cbb8f0dSMatthew G. Knepley 
56244a7f3ddSMatthew G. Knepley     if (isFE[f]) {
56344a7f3ddSMatthew G. Knepley       ierr = DMGetField(dm, f, NULL, (PetscObject *) &fe);CHKERRQ(ierr);
5649cbb8f0dSMatthew G. Knepley       ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr);
5659cbb8f0dSMatthew G. Knepley       ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr);
5669cbb8f0dSMatthew G. Knepley     }
56744a7f3ddSMatthew G. Knepley   }
56892fd8e1eSJed Brown   ierr = DMSetLocalSection(dm, section);CHKERRQ(ierr);
5699cbb8f0dSMatthew G. Knepley   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
5709cbb8f0dSMatthew G. Knepley   for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);ierr = ISDestroy(&bcComps[bc]);CHKERRQ(ierr);}
5719cbb8f0dSMatthew G. Knepley   ierr = PetscFree3(bcFields,bcPoints,bcComps);CHKERRQ(ierr);
572baef929fSMatthew G. Knepley   ierr = PetscFree3(labels,numComp,numDof);CHKERRQ(ierr);
5739cbb8f0dSMatthew G. Knepley   ierr = PetscFree(isFE);CHKERRQ(ierr);
5749cbb8f0dSMatthew G. Knepley   PetscFunctionReturn(0);
5759cbb8f0dSMatthew G. Knepley }
576