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 */ 4*baef929fSMatthew G. Knepley static PetscErrorCode DMPlexCreateSectionFields(DM dm, const PetscInt numComp[], PetscSection *section) 59cbb8f0dSMatthew G. Knepley { 6*baef929fSMatthew G. Knepley DMLabel depthLabel; 7*baef929fSMatthew 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; 12*baef929fSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13*baef929fSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm,&depthLabel);CHKERRQ(ierr); 149cbb8f0dSMatthew G. Knepley ierr = DMGetNumFields(dm, &Nf);CHKERRQ(ierr); 15*baef929fSMatthew G. Knepley ierr = PetscCalloc1(Nf, &isFE);CHKERRQ(ierr); 16*baef929fSMatthew G. Knepley for (f = 0; f < Nf; ++f) { 179cbb8f0dSMatthew G. Knepley PetscObject obj; 189cbb8f0dSMatthew G. Knepley PetscClassId id; 199cbb8f0dSMatthew G. Knepley 209cbb8f0dSMatthew G. Knepley ierr = DMGetField(dm, f, &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 } 25*baef929fSMatthew G. Knepley 269cbb8f0dSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 27*baef929fSMatthew G. Knepley if (Nf > 0) { 28*baef929fSMatthew G. Knepley ierr = PetscSectionSetNumFields(*section, Nf);CHKERRQ(ierr); 299cbb8f0dSMatthew G. Knepley if (numComp) { 30*baef929fSMatthew 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 399cbb8f0dSMatthew G. Knepley ierr = DMGetField(dm,f,(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; 45*baef929fSMatthew 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); 76*baef929fSMatthew G. Knepley ierr = PetscFree(isFE);CHKERRQ(ierr); 77*baef929fSMatthew G. Knepley PetscFunctionReturn(0); 78*baef929fSMatthew G. Knepley } 79*baef929fSMatthew G. Knepley 80*baef929fSMatthew G. Knepley /* Set the number of dof on each point and separate by fields */ 81*baef929fSMatthew G. Knepley static PetscErrorCode DMPlexCreateSectionDof(DM dm, DMLabel label[],const PetscInt numDof[], PetscSection section) 82*baef929fSMatthew G. Knepley { 83*baef929fSMatthew G. Knepley DMLabel depthLabel; 84*baef929fSMatthew G. Knepley PetscInt *pMax; 85*baef929fSMatthew G. Knepley PetscInt depth, cellHeight, pStart = 0, pEnd = 0; 86*baef929fSMatthew G. Knepley PetscInt Nf, f, dim, d, dep, p; 87*baef929fSMatthew G. Knepley PetscBool *isFE; 88*baef929fSMatthew G. Knepley PetscErrorCode ierr; 89*baef929fSMatthew G. Knepley 90*baef929fSMatthew G. Knepley PetscFunctionBegin; 91*baef929fSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 929cbb8f0dSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 93*baef929fSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm,&depthLabel);CHKERRQ(ierr); 94*baef929fSMatthew G. Knepley ierr = DMGetNumFields(dm, &Nf);CHKERRQ(ierr); 95*baef929fSMatthew G. Knepley ierr = PetscMalloc1(Nf, &isFE);CHKERRQ(ierr); 96*baef929fSMatthew G. Knepley for (f = 0; f < Nf; ++f) { 97*baef929fSMatthew G. Knepley PetscObject obj; 98*baef929fSMatthew G. Knepley PetscClassId id; 99*baef929fSMatthew G. Knepley 100*baef929fSMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 101*baef929fSMatthew G. Knepley ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr); 102*baef929fSMatthew G. Knepley if (id == PETSCFE_CLASSID) {isFE[f] = PETSC_TRUE;} 103*baef929fSMatthew G. Knepley else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;} 104*baef929fSMatthew G. Knepley } 105*baef929fSMatthew 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); 109*baef929fSMatthew G. Knepley for (f = 0; f < Nf; ++f) { 110*baef929fSMatthew G. Knepley if (label && label[f]) { 111*baef929fSMatthew G. Knepley IS pointIS; 112*baef929fSMatthew G. Knepley const PetscInt *points; 113*baef929fSMatthew G. Knepley PetscInt n; 114*baef929fSMatthew G. Knepley 115*baef929fSMatthew G. Knepley ierr = DMLabelGetStratumIS(label[f], 1, &pointIS);CHKERRQ(ierr); 116*baef929fSMatthew G. Knepley if (!pointIS) continue; 117*baef929fSMatthew G. Knepley ierr = ISGetLocalSize(pointIS, &n);CHKERRQ(ierr); 118*baef929fSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 119*baef929fSMatthew G. Knepley for (p = 0; p < n; ++p) { 120*baef929fSMatthew G. Knepley const PetscInt point = points[p]; 121*baef929fSMatthew G. Knepley PetscInt dof, d; 122*baef929fSMatthew G. Knepley 123*baef929fSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &d);CHKERRQ(ierr); 124*baef929fSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d, NULL, &pEnd);CHKERRQ(ierr); 125*baef929fSMatthew G. Knepley /* If this is a hybrid point, use dof for one dimension lower */ 126*baef929fSMatthew G. Knepley if ((point >= pMax[d]) && (point < pEnd)) --d; 127*baef929fSMatthew G. Knepley dof = d < 0 ? 0 : numDof[f*(dim+1)+d]; 128*baef929fSMatthew G. Knepley ierr = PetscSectionSetFieldDof(section, point, f, dof);CHKERRQ(ierr); 129*baef929fSMatthew G. Knepley ierr = PetscSectionAddDof(section, point, dof);CHKERRQ(ierr); 130*baef929fSMatthew G. Knepley } 131*baef929fSMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 132*baef929fSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 133*baef929fSMatthew G. Knepley } else { 1349cbb8f0dSMatthew G. Knepley for (dep = 0; dep <= depth - cellHeight; ++dep) { 1359cbb8f0dSMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 1369cbb8f0dSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 1379cbb8f0dSMatthew G. Knepley pMax[dep] = pMax[dep] < 0 ? pEnd : pMax[dep]; 1389cbb8f0dSMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 139*baef929fSMatthew G. Knepley const PetscInt dof = numDof[f*(dim+1)+d]; 1409cbb8f0dSMatthew G. Knepley 1419cbb8f0dSMatthew G. Knepley if (isFE[f] && p >= pMax[dep]) continue; 142*baef929fSMatthew G. Knepley ierr = PetscSectionSetFieldDof(section, p, f, dof);CHKERRQ(ierr); 143*baef929fSMatthew G. Knepley ierr = PetscSectionAddDof(section, p, dof);CHKERRQ(ierr); 1449cbb8f0dSMatthew G. Knepley } 145*baef929fSMatthew G. Knepley } 1469cbb8f0dSMatthew G. Knepley } 1479cbb8f0dSMatthew G. Knepley } 1489cbb8f0dSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 1499cbb8f0dSMatthew G. Knepley ierr = PetscFree(isFE);CHKERRQ(ierr); 1509cbb8f0dSMatthew G. Knepley PetscFunctionReturn(0); 1519cbb8f0dSMatthew G. Knepley } 1529cbb8f0dSMatthew G. Knepley 1539cbb8f0dSMatthew G. Knepley /* Set the number of dof on each point and separate by fields 1549cbb8f0dSMatthew G. Knepley If bcComps is NULL or the IS is NULL, constrain every dof on the point 1559cbb8f0dSMatthew G. Knepley */ 1569cbb8f0dSMatthew G. Knepley static PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC, const PetscInt bcField[], const IS bcComps[], const IS bcPoints[], PetscSection section) 1579cbb8f0dSMatthew G. Knepley { 158*baef929fSMatthew G. Knepley PetscInt Nf; 1599cbb8f0dSMatthew G. Knepley PetscInt bc; 1609cbb8f0dSMatthew G. Knepley PetscSection aSec; 1619cbb8f0dSMatthew G. Knepley PetscErrorCode ierr; 1629cbb8f0dSMatthew G. Knepley 1639cbb8f0dSMatthew G. Knepley PetscFunctionBegin; 164*baef929fSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &Nf);CHKERRQ(ierr); 1659cbb8f0dSMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) { 1669cbb8f0dSMatthew G. Knepley PetscInt field = 0; 1679cbb8f0dSMatthew G. Knepley const PetscInt *comp; 1689cbb8f0dSMatthew G. Knepley const PetscInt *idx; 1699cbb8f0dSMatthew G. Knepley PetscInt Nc = -1, n, i; 1709cbb8f0dSMatthew G. Knepley 171*baef929fSMatthew G. Knepley if (Nf) field = bcField[bc]; 1729cbb8f0dSMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISGetLocalSize(bcComps[bc], &Nc);CHKERRQ(ierr);} 1739cbb8f0dSMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISGetIndices(bcComps[bc], &comp);CHKERRQ(ierr);} 1749cbb8f0dSMatthew G. Knepley ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 1759cbb8f0dSMatthew G. Knepley ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 1769cbb8f0dSMatthew G. Knepley for (i = 0; i < n; ++i) { 1779cbb8f0dSMatthew G. Knepley const PetscInt p = idx[i]; 1789cbb8f0dSMatthew G. Knepley PetscInt numConst; 1799cbb8f0dSMatthew G. Knepley 180*baef929fSMatthew G. Knepley if (Nf) { 1819cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 1829cbb8f0dSMatthew G. Knepley } else { 1839cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 1849cbb8f0dSMatthew G. Knepley } 1859cbb8f0dSMatthew G. Knepley /* If Nc < 0, constrain every dof on the point */ 1869cbb8f0dSMatthew G. Knepley /* TODO: Matt, this only works if there is one node on the point. We need to handle numDofs > NumComponents */ 1879cbb8f0dSMatthew G. Knepley if (Nc > 0) numConst = PetscMin(numConst, Nc); 188*baef929fSMatthew G. Knepley if (Nf) {ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr);} 1899cbb8f0dSMatthew G. Knepley ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 1909cbb8f0dSMatthew G. Knepley } 1919cbb8f0dSMatthew G. Knepley ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 1929cbb8f0dSMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISRestoreIndices(bcComps[bc], &comp);CHKERRQ(ierr);} 1939cbb8f0dSMatthew G. Knepley } 1949cbb8f0dSMatthew G. Knepley ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr); 1959cbb8f0dSMatthew G. Knepley if (aSec) { 1969cbb8f0dSMatthew G. Knepley PetscInt aStart, aEnd, a; 1979cbb8f0dSMatthew G. Knepley 1989cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr); 1999cbb8f0dSMatthew G. Knepley for (a = aStart; a < aEnd; a++) { 2009cbb8f0dSMatthew G. Knepley PetscInt dof, f; 2019cbb8f0dSMatthew G. Knepley 2029cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr); 2039cbb8f0dSMatthew G. Knepley if (dof) { 2049cbb8f0dSMatthew G. Knepley /* if there are point-to-point constraints, then all dofs are constrained */ 2059cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr); 2069cbb8f0dSMatthew G. Knepley ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr); 207*baef929fSMatthew G. Knepley for (f = 0; f < Nf; f++) { 2089cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, a, f, &dof);CHKERRQ(ierr); 2099cbb8f0dSMatthew G. Knepley ierr = PetscSectionSetFieldConstraintDof(section, a, f, dof);CHKERRQ(ierr); 2109cbb8f0dSMatthew G. Knepley } 2119cbb8f0dSMatthew G. Knepley } 2129cbb8f0dSMatthew G. Knepley } 2139cbb8f0dSMatthew G. Knepley } 2149cbb8f0dSMatthew G. Knepley PetscFunctionReturn(0); 2159cbb8f0dSMatthew G. Knepley } 2169cbb8f0dSMatthew G. Knepley 2179cbb8f0dSMatthew G. Knepley /* Set the constrained field indices on each point 2189cbb8f0dSMatthew G. Knepley If bcComps is NULL or the IS is NULL, constrain every dof on the point 2199cbb8f0dSMatthew G. Knepley */ 2209cbb8f0dSMatthew G. Knepley static PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt numBC,const PetscInt bcField[], const IS bcComps[], const IS bcPoints[], PetscSection section) 2219cbb8f0dSMatthew G. Knepley { 2229cbb8f0dSMatthew G. Knepley PetscSection aSec; 2239cbb8f0dSMatthew G. Knepley PetscInt *indices; 224*baef929fSMatthew G. Knepley PetscInt Nf, cdof, maxDof = 0, pStart, pEnd, p, bc, f, d; 2259cbb8f0dSMatthew G. Knepley PetscErrorCode ierr; 2269cbb8f0dSMatthew G. Knepley 2279cbb8f0dSMatthew G. Knepley PetscFunctionBegin; 228*baef929fSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &Nf);CHKERRQ(ierr); 229*baef929fSMatthew G. Knepley if (!Nf) PetscFunctionReturn(0); 2309cbb8f0dSMatthew G. Knepley /* Initialize all field indices to -1 */ 2319cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 2329cbb8f0dSMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); maxDof = PetscMax(maxDof, cdof);} 2339cbb8f0dSMatthew G. Knepley ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 2349cbb8f0dSMatthew G. Knepley for (d = 0; d < maxDof; ++d) indices[d] = -1; 235*baef929fSMatthew G. Knepley for (p = pStart; p < pEnd; ++p) for (f = 0; f < Nf; ++f) {ierr = PetscSectionSetFieldConstraintIndices(section, p, f, indices);CHKERRQ(ierr);} 2369cbb8f0dSMatthew G. Knepley /* Handle BC constraints */ 2379cbb8f0dSMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) { 2389cbb8f0dSMatthew G. Knepley const PetscInt field = bcField[bc]; 2399cbb8f0dSMatthew G. Knepley const PetscInt *comp, *idx; 2409cbb8f0dSMatthew G. Knepley PetscInt Nc = -1, n, i; 2419cbb8f0dSMatthew G. Knepley 2429cbb8f0dSMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISGetLocalSize(bcComps[bc], &Nc);CHKERRQ(ierr);} 2439cbb8f0dSMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISGetIndices(bcComps[bc], &comp);CHKERRQ(ierr);} 2449cbb8f0dSMatthew G. Knepley ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 2459cbb8f0dSMatthew G. Knepley ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2469cbb8f0dSMatthew G. Knepley for (i = 0; i < n; ++i) { 2479cbb8f0dSMatthew G. Knepley const PetscInt p = idx[i]; 2489cbb8f0dSMatthew G. Knepley const PetscInt *find; 2499cbb8f0dSMatthew G. Knepley PetscInt fdof, fcdof, c; 2509cbb8f0dSMatthew G. Knepley 2519cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, p, field, &fdof);CHKERRQ(ierr); 2529cbb8f0dSMatthew G. Knepley if (!fdof) continue; 2539cbb8f0dSMatthew G. Knepley if (Nc < 0) { 2549cbb8f0dSMatthew G. Knepley for (d = 0; d < fdof; ++d) indices[d] = d; 2559cbb8f0dSMatthew G. Knepley fcdof = fdof; 2569cbb8f0dSMatthew G. Knepley } else { 2579cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, p, field, &fcdof);CHKERRQ(ierr); 2589cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, p, field, &find);CHKERRQ(ierr); 2599cbb8f0dSMatthew G. Knepley for (d = 0; d < fcdof; ++d) {if (find[d] < 0) break; indices[d] = find[d];} 2609cbb8f0dSMatthew G. Knepley for (c = 0; c < Nc; ++c) indices[d++] = comp[c]; 2619cbb8f0dSMatthew G. Knepley ierr = PetscSortRemoveDupsInt(&d, indices);CHKERRQ(ierr); 2629cbb8f0dSMatthew G. Knepley for (c = d; c < fcdof; ++c) indices[c] = -1; 2639cbb8f0dSMatthew G. Knepley fcdof = d; 2649cbb8f0dSMatthew G. Knepley } 2659cbb8f0dSMatthew G. Knepley ierr = PetscSectionSetFieldConstraintDof(section, p, field, fcdof);CHKERRQ(ierr); 2669cbb8f0dSMatthew G. Knepley ierr = PetscSectionSetFieldConstraintIndices(section, p, field, indices);CHKERRQ(ierr); 2679cbb8f0dSMatthew G. Knepley } 2689cbb8f0dSMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISRestoreIndices(bcComps[bc], &comp);CHKERRQ(ierr);} 2699cbb8f0dSMatthew G. Knepley ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2709cbb8f0dSMatthew G. Knepley } 2719cbb8f0dSMatthew G. Knepley /* Handle anchors */ 2729cbb8f0dSMatthew G. Knepley ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr); 2739cbb8f0dSMatthew G. Knepley if (aSec) { 2749cbb8f0dSMatthew G. Knepley PetscInt aStart, aEnd, a; 2759cbb8f0dSMatthew G. Knepley 2769cbb8f0dSMatthew G. Knepley for (d = 0; d < maxDof; ++d) indices[d] = d; 2779cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr); 2789cbb8f0dSMatthew G. Knepley for (a = aStart; a < aEnd; a++) { 2799cbb8f0dSMatthew G. Knepley PetscInt dof, f; 2809cbb8f0dSMatthew G. Knepley 2819cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr); 2829cbb8f0dSMatthew G. Knepley if (dof) { 2839cbb8f0dSMatthew G. Knepley /* if there are point-to-point constraints, then all dofs are constrained */ 284*baef929fSMatthew G. Knepley for (f = 0; f < Nf; f++) { 2859cbb8f0dSMatthew G. Knepley ierr = PetscSectionSetFieldConstraintIndices(section, a, f, indices);CHKERRQ(ierr); 2869cbb8f0dSMatthew G. Knepley } 2879cbb8f0dSMatthew G. Knepley } 2889cbb8f0dSMatthew G. Knepley } 2899cbb8f0dSMatthew G. Knepley } 2909cbb8f0dSMatthew G. Knepley ierr = PetscFree(indices);CHKERRQ(ierr); 2919cbb8f0dSMatthew G. Knepley PetscFunctionReturn(0); 2929cbb8f0dSMatthew G. Knepley } 2939cbb8f0dSMatthew G. Knepley 2949cbb8f0dSMatthew G. Knepley /* Set the constrained indices on each point */ 2959cbb8f0dSMatthew G. Knepley static PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 2969cbb8f0dSMatthew G. Knepley { 2979cbb8f0dSMatthew G. Knepley PetscInt *indices; 298*baef929fSMatthew G. Knepley PetscInt Nf, maxDof, pStart, pEnd, p, f, d; 2999cbb8f0dSMatthew G. Knepley PetscErrorCode ierr; 3009cbb8f0dSMatthew G. Knepley 3019cbb8f0dSMatthew G. Knepley PetscFunctionBegin; 302*baef929fSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &Nf);CHKERRQ(ierr); 3039cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 3049cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3059cbb8f0dSMatthew G. Knepley ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 3069cbb8f0dSMatthew G. Knepley for (d = 0; d < maxDof; ++d) indices[d] = -1; 3079cbb8f0dSMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 3089cbb8f0dSMatthew G. Knepley PetscInt cdof, d; 3099cbb8f0dSMatthew G. Knepley 3109cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 3119cbb8f0dSMatthew G. Knepley if (cdof) { 312*baef929fSMatthew G. Knepley if (Nf) { 3139cbb8f0dSMatthew G. Knepley PetscInt numConst = 0, foff = 0; 3149cbb8f0dSMatthew G. Knepley 315*baef929fSMatthew G. Knepley for (f = 0; f < Nf; ++f) { 3169cbb8f0dSMatthew G. Knepley const PetscInt *find; 3179cbb8f0dSMatthew G. Knepley PetscInt fcdof, fdof; 3189cbb8f0dSMatthew G. Knepley 3199cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 3209cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 3219cbb8f0dSMatthew G. Knepley /* Change constraint numbering from field component to local dof number */ 3229cbb8f0dSMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &find);CHKERRQ(ierr); 3239cbb8f0dSMatthew G. Knepley for (d = 0; d < fcdof; ++d) indices[numConst+d] = find[d] + foff; 3249cbb8f0dSMatthew G. Knepley numConst += fcdof; 3259cbb8f0dSMatthew G. Knepley foff += fdof; 3269cbb8f0dSMatthew G. Knepley } 3279cbb8f0dSMatthew G. Knepley if (cdof != numConst) {ierr = PetscSectionSetConstraintDof(section, p, numConst);CHKERRQ(ierr);} 3289cbb8f0dSMatthew G. Knepley } else { 3299cbb8f0dSMatthew G. Knepley for (d = 0; d < cdof; ++d) indices[d] = d; 3309cbb8f0dSMatthew G. Knepley } 3319cbb8f0dSMatthew G. Knepley ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 3329cbb8f0dSMatthew G. Knepley } 3339cbb8f0dSMatthew G. Knepley } 3349cbb8f0dSMatthew G. Knepley ierr = PetscFree(indices);CHKERRQ(ierr); 3359cbb8f0dSMatthew G. Knepley PetscFunctionReturn(0); 3369cbb8f0dSMatthew G. Knepley } 3379cbb8f0dSMatthew G. Knepley 3389cbb8f0dSMatthew G. Knepley /*@C 3399cbb8f0dSMatthew G. Knepley DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 3409cbb8f0dSMatthew G. Knepley 3419cbb8f0dSMatthew G. Knepley Not Collective 3429cbb8f0dSMatthew G. Knepley 3439cbb8f0dSMatthew G. Knepley Input Parameters: 3449cbb8f0dSMatthew G. Knepley + dm - The DMPlex object 3459cbb8f0dSMatthew G. Knepley . numComp - An array of size numFields that holds the number of components for each field 3469cbb8f0dSMatthew 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 347*baef929fSMatthew G. Knepley . label - The label indicating the mesh support of each field, or NULL for the whole mesh 3489cbb8f0dSMatthew G. Knepley . numBC - The number of boundary conditions 3499cbb8f0dSMatthew G. Knepley . bcField - An array of size numBC giving the field number for each boundry condition 3509cbb8f0dSMatthew G. Knepley . bcComps - [Optional] An array of size numBC giving an IS holding the field components to which each boundary condition applies 3519cbb8f0dSMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the Plex points to which each boundary condition applies 3529cbb8f0dSMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 3539cbb8f0dSMatthew G. Knepley 3549cbb8f0dSMatthew G. Knepley Output Parameter: 3559cbb8f0dSMatthew G. Knepley . section - The PetscSection object 3569cbb8f0dSMatthew G. Knepley 3579cbb8f0dSMatthew G. Knepley Notes: 3589cbb8f0dSMatthew 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 3599cbb8f0dSMatthew G. Knepley number of dof for field 0 on each edge. 3609cbb8f0dSMatthew G. Knepley 3619cbb8f0dSMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 3629cbb8f0dSMatthew G. Knepley 3639cbb8f0dSMatthew G. Knepley Level: developer 3649cbb8f0dSMatthew G. Knepley 3659cbb8f0dSMatthew G. Knepley Fortran Notes: 3669cbb8f0dSMatthew G. Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 3679cbb8f0dSMatthew G. Knepley 3689cbb8f0dSMatthew G. Knepley .keywords: mesh, elements 3699cbb8f0dSMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 3709cbb8f0dSMatthew G. Knepley @*/ 371*baef929fSMatthew 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) 3729cbb8f0dSMatthew G. Knepley { 3739cbb8f0dSMatthew G. Knepley PetscSection aSec; 3749cbb8f0dSMatthew G. Knepley PetscErrorCode ierr; 3759cbb8f0dSMatthew G. Knepley 3769cbb8f0dSMatthew G. Knepley PetscFunctionBegin; 377*baef929fSMatthew G. Knepley ierr = DMPlexCreateSectionFields(dm, numComp, section);CHKERRQ(ierr); 378*baef929fSMatthew G. Knepley ierr = DMPlexCreateSectionDof(dm, label, numDof, *section);CHKERRQ(ierr); 3799cbb8f0dSMatthew G. Knepley ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcComps, bcPoints, *section);CHKERRQ(ierr); 3809cbb8f0dSMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 3819cbb8f0dSMatthew G. Knepley ierr = PetscSectionSetFromOptions(*section);CHKERRQ(ierr); 3829cbb8f0dSMatthew G. Knepley ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 3839cbb8f0dSMatthew G. Knepley ierr = DMPlexGetAnchors(dm,&aSec,NULL);CHKERRQ(ierr); 3849cbb8f0dSMatthew G. Knepley if (numBC || aSec) { 3859cbb8f0dSMatthew G. Knepley ierr = DMPlexCreateSectionBCIndicesField(dm, numBC, bcField, bcComps, bcPoints, *section);CHKERRQ(ierr); 3869cbb8f0dSMatthew G. Knepley ierr = DMPlexCreateSectionBCIndices(dm, *section);CHKERRQ(ierr); 3879cbb8f0dSMatthew G. Knepley } 3889cbb8f0dSMatthew G. Knepley ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 3899cbb8f0dSMatthew G. Knepley PetscFunctionReturn(0); 3909cbb8f0dSMatthew G. Knepley } 3919cbb8f0dSMatthew G. Knepley 3929cbb8f0dSMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 3939cbb8f0dSMatthew G. Knepley { 3949cbb8f0dSMatthew G. Knepley PetscSection section; 395*baef929fSMatthew G. Knepley DMLabel *labels; 3969cbb8f0dSMatthew G. Knepley IS *bcPoints, *bcComps; 3979cbb8f0dSMatthew G. Knepley PetscBool *isFE; 3989cbb8f0dSMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 399*baef929fSMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, Nf, bd, bc = 0, f; 4009cbb8f0dSMatthew G. Knepley PetscInt cStart, cEnd, cEndInterior; 4019cbb8f0dSMatthew G. Knepley PetscErrorCode ierr; 4029cbb8f0dSMatthew G. Knepley 4039cbb8f0dSMatthew G. Knepley PetscFunctionBegin; 404*baef929fSMatthew G. Knepley ierr = DMGetNumFields(dm, &Nf);CHKERRQ(ierr); 4059cbb8f0dSMatthew G. Knepley /* FE and FV boundary conditions are handled slightly differently */ 406*baef929fSMatthew G. Knepley ierr = PetscMalloc1(Nf, &isFE);CHKERRQ(ierr); 407*baef929fSMatthew G. Knepley for (f = 0; f < Nf; ++f) { 4089cbb8f0dSMatthew G. Knepley PetscObject obj; 4099cbb8f0dSMatthew G. Knepley PetscClassId id; 4109cbb8f0dSMatthew G. Knepley 4119cbb8f0dSMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 4129cbb8f0dSMatthew G. Knepley ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr); 4139cbb8f0dSMatthew G. Knepley if (id == PETSCFE_CLASSID) {isFE[f] = PETSC_TRUE;} 4149cbb8f0dSMatthew G. Knepley else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;} 4159cbb8f0dSMatthew G. Knepley else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Unknown discretization type for field %D", f); 4169cbb8f0dSMatthew G. Knepley } 4179cbb8f0dSMatthew G. Knepley /* Allocate boundary point storage for FEM boundaries */ 4189cbb8f0dSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4199cbb8f0dSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 4209cbb8f0dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 4219cbb8f0dSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 4229cbb8f0dSMatthew G. Knepley ierr = PetscDSGetNumBoundary(dm->prob, &numBd);CHKERRQ(ierr); 423*baef929fSMatthew 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)"); 4249cbb8f0dSMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 4259cbb8f0dSMatthew G. Knepley PetscInt field; 4269cbb8f0dSMatthew G. Knepley DMBoundaryConditionType type; 4279cbb8f0dSMatthew G. Knepley const char *labelName; 4289cbb8f0dSMatthew G. Knepley DMLabel label; 4299cbb8f0dSMatthew G. Knepley 4309cbb8f0dSMatthew G. Knepley ierr = PetscDSGetBoundary(dm->prob, bd, &type, NULL, &labelName, &field, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 4319cbb8f0dSMatthew G. Knepley ierr = DMGetLabel(dm,labelName,&label);CHKERRQ(ierr); 4329cbb8f0dSMatthew G. Knepley if (label && isFE[field] && (type & DM_BC_ESSENTIAL)) ++numBC; 4339cbb8f0dSMatthew G. Knepley } 4349cbb8f0dSMatthew G. Knepley /* Add ghost cell boundaries for FVM */ 435*baef929fSMatthew G. Knepley for (f = 0; f < Nf; ++f) if (!isFE[f] && cEndInterior >= 0) ++numBC; 4369cbb8f0dSMatthew G. Knepley ierr = PetscCalloc3(numBC,&bcFields,numBC,&bcPoints,numBC,&bcComps);CHKERRQ(ierr); 4379cbb8f0dSMatthew G. Knepley /* Constrain ghost cells for FV */ 438*baef929fSMatthew G. Knepley for (f = 0; f < Nf; ++f) { 4399cbb8f0dSMatthew G. Knepley PetscInt *newidx, c; 4409cbb8f0dSMatthew G. Knepley 4419cbb8f0dSMatthew G. Knepley if (isFE[f] || cEndInterior < 0) continue; 4429cbb8f0dSMatthew G. Knepley ierr = PetscMalloc1(cEnd-cEndInterior,&newidx);CHKERRQ(ierr); 4439cbb8f0dSMatthew G. Knepley for (c = cEndInterior; c < cEnd; ++c) newidx[c-cEndInterior] = c; 4449cbb8f0dSMatthew G. Knepley bcFields[bc] = f; 4459cbb8f0dSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), cEnd-cEndInterior, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 4469cbb8f0dSMatthew G. Knepley } 4479cbb8f0dSMatthew G. Knepley /* Handle FEM Dirichlet boundaries */ 4489cbb8f0dSMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 4499cbb8f0dSMatthew G. Knepley const char *bdLabel; 4509cbb8f0dSMatthew G. Knepley DMLabel label; 4519cbb8f0dSMatthew G. Knepley const PetscInt *comps; 4529cbb8f0dSMatthew G. Knepley const PetscInt *values; 4539cbb8f0dSMatthew G. Knepley PetscInt bd2, field, numComps, numValues; 4549cbb8f0dSMatthew G. Knepley DMBoundaryConditionType type; 4559cbb8f0dSMatthew G. Knepley PetscBool duplicate = PETSC_FALSE; 4569cbb8f0dSMatthew G. Knepley 4579cbb8f0dSMatthew G. Knepley ierr = PetscDSGetBoundary(dm->prob, bd, &type, NULL, &bdLabel, &field, &numComps, &comps, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 4589cbb8f0dSMatthew G. Knepley ierr = DMGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 4599cbb8f0dSMatthew G. Knepley if (!isFE[field] || !label) continue; 4609cbb8f0dSMatthew G. Knepley /* Only want to modify label once */ 4619cbb8f0dSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 4629cbb8f0dSMatthew G. Knepley const char *bdname; 4639cbb8f0dSMatthew G. Knepley ierr = PetscDSGetBoundary(dm->prob, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 4649cbb8f0dSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 4659cbb8f0dSMatthew G. Knepley if (duplicate) break; 4669cbb8f0dSMatthew G. Knepley } 4679cbb8f0dSMatthew G. Knepley if (!duplicate && (isFE[field])) { 4689cbb8f0dSMatthew G. Knepley /* don't complete cells, which are just present to give orientation to the boundary */ 4699cbb8f0dSMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 4709cbb8f0dSMatthew G. Knepley } 4719cbb8f0dSMatthew G. Knepley /* Filter out cells, if you actually want to constrain cells you need to do things by hand right now */ 4729cbb8f0dSMatthew G. Knepley if (type & DM_BC_ESSENTIAL) { 4739cbb8f0dSMatthew G. Knepley PetscInt *newidx; 4749cbb8f0dSMatthew G. Knepley PetscInt n, newn = 0, p, v; 4759cbb8f0dSMatthew G. Knepley 4769cbb8f0dSMatthew G. Knepley bcFields[bc] = field; 4779cbb8f0dSMatthew G. Knepley if (numComps) {ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), numComps, comps, PETSC_COPY_VALUES, &bcComps[bc]);CHKERRQ(ierr);} 4789cbb8f0dSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 4799cbb8f0dSMatthew G. Knepley IS tmp; 4809cbb8f0dSMatthew G. Knepley const PetscInt *idx; 4819cbb8f0dSMatthew G. Knepley 4829cbb8f0dSMatthew G. Knepley ierr = DMGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr); 4839cbb8f0dSMatthew G. Knepley if (!tmp) continue; 4849cbb8f0dSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 4859cbb8f0dSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 4869cbb8f0dSMatthew G. Knepley if (isFE[field]) { 4879cbb8f0dSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 4889cbb8f0dSMatthew G. Knepley } else { 4899cbb8f0dSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) ++newn; 4909cbb8f0dSMatthew G. Knepley } 4919cbb8f0dSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 4929cbb8f0dSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 4939cbb8f0dSMatthew G. Knepley } 4949cbb8f0dSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 4959cbb8f0dSMatthew G. Knepley newn = 0; 4969cbb8f0dSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 4979cbb8f0dSMatthew G. Knepley IS tmp; 4989cbb8f0dSMatthew G. Knepley const PetscInt *idx; 4999cbb8f0dSMatthew G. Knepley 5009cbb8f0dSMatthew G. Knepley ierr = DMGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr); 5019cbb8f0dSMatthew G. Knepley if (!tmp) continue; 5029cbb8f0dSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 5039cbb8f0dSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 5049cbb8f0dSMatthew G. Knepley if (isFE[field]) { 5059cbb8f0dSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 5069cbb8f0dSMatthew G. Knepley } else { 5079cbb8f0dSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) newidx[newn++] = idx[p]; 5089cbb8f0dSMatthew G. Knepley } 5099cbb8f0dSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 5109cbb8f0dSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 5119cbb8f0dSMatthew G. Knepley } 5129cbb8f0dSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 5139cbb8f0dSMatthew G. Knepley } 5149cbb8f0dSMatthew G. Knepley } 5159cbb8f0dSMatthew G. Knepley /* Handle discretization */ 5169cbb8f0dSMatthew G. Knepley PetscObject obj; 5179cbb8f0dSMatthew G. Knepley 5189cbb8f0dSMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 519*baef929fSMatthew G. Knepley ierr = PetscCalloc3(Nf,&labels,Nf,&numComp,Nf*(dim+1),&numDof);CHKERRQ(ierr); 520*baef929fSMatthew G. Knepley for (f = 0; f < Nf; ++f) { 521*baef929fSMatthew G. Knepley labels[f] = NULL; 5229cbb8f0dSMatthew G. Knepley if (isFE[f]) { 5239cbb8f0dSMatthew G. Knepley PetscFE fe = (PetscFE) obj; 5249cbb8f0dSMatthew G. Knepley const PetscInt *numFieldDof; 5259cbb8f0dSMatthew G. Knepley PetscInt d; 5269cbb8f0dSMatthew G. Knepley 5279cbb8f0dSMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 5289cbb8f0dSMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 5299cbb8f0dSMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 5309cbb8f0dSMatthew G. Knepley } else { 5319cbb8f0dSMatthew G. Knepley PetscFV fv = (PetscFV) obj; 5329cbb8f0dSMatthew G. Knepley 5339cbb8f0dSMatthew G. Knepley ierr = PetscFVGetNumComponents(fv, &numComp[f]);CHKERRQ(ierr); 5349cbb8f0dSMatthew G. Knepley numDof[f*(dim+1)+dim] = numComp[f]; 5359cbb8f0dSMatthew G. Knepley } 5369cbb8f0dSMatthew G. Knepley } 537*baef929fSMatthew G. Knepley for (f = 0; f < Nf; ++f) { 5389cbb8f0dSMatthew G. Knepley PetscInt d; 5399cbb8f0dSMatthew G. Knepley for (d = 1; d < dim; ++d) { 5409cbb8f0dSMatthew 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."); 5419cbb8f0dSMatthew G. Knepley } 5429cbb8f0dSMatthew G. Knepley } 543*baef929fSMatthew G. Knepley ierr = DMPlexCreateSection(dm, labels, numComp, numDof, numBC, bcFields, bcComps, bcPoints, NULL, §ion);CHKERRQ(ierr); 544*baef929fSMatthew G. Knepley for (f = 0; f < Nf; ++f) { 5459cbb8f0dSMatthew G. Knepley PetscFE fe; 5469cbb8f0dSMatthew G. Knepley const char *name; 5479cbb8f0dSMatthew G. Knepley 5489cbb8f0dSMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 5499cbb8f0dSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 5509cbb8f0dSMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 5519cbb8f0dSMatthew G. Knepley } 5529cbb8f0dSMatthew G. Knepley ierr = DMSetSection(dm, section);CHKERRQ(ierr); 5539cbb8f0dSMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5549cbb8f0dSMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);ierr = ISDestroy(&bcComps[bc]);CHKERRQ(ierr);} 5559cbb8f0dSMatthew G. Knepley ierr = PetscFree3(bcFields,bcPoints,bcComps);CHKERRQ(ierr); 556*baef929fSMatthew G. Knepley ierr = PetscFree3(labels,numComp,numDof);CHKERRQ(ierr); 5579cbb8f0dSMatthew G. Knepley ierr = PetscFree(isFE);CHKERRQ(ierr); 5589cbb8f0dSMatthew G. Knepley PetscFunctionReturn(0); 5599cbb8f0dSMatthew G. Knepley } 560