354   PetscBT            neighbors;  in DMPlexCreateTwoSidedProcessSF()  local
366   PetscCall(PetscBTCreate(size, &neighbors));  in DMPlexCreateTwoSidedProcessSF()
367   PetscCall(PetscBTMemzero(size, neighbors));  in DMPlexCreateTwoSidedProcessSF()
376     for (n = 0; n < ndof; ++n) PetscCall(PetscBTSet(neighbors, nranks[noff + n]));  in DMPlexCreateTwoSidedProcessSF()
387     for (n = 0; n < ndof; ++n) PetscCall(PetscBTSet(neighbors, nranks[noff + n]));  in DMPlexCreateTwoSidedProcessSF()
391   for (l = 0; l < numLeaves; ++l) PetscCall(PetscBTSet(neighbors, remotePoints[l].rank));  in DMPlexCreateTwoSidedProcessSF()
393   PetscCall(PetscBTClear(neighbors, rank));  in DMPlexCreateTwoSidedProcessSF()
395     if (PetscBTLookup(neighbors, proc)) ++numNeighbors;  in DMPlexCreateTwoSidedProcessSF()
401     if (PetscBTLookup(neighbors, proc)) {  in DMPlexCreateTwoSidedProcessSF()
409   PetscCall(PetscBTDestroy(&neighbors));  in DMPlexCreateTwoSidedProcessSF()
536     PetscInt adjSize = PETSC_DETERMINE, neighbors = 0, noff, n, a;  in DMPlexCreateOverlapLabel()  local
540       PetscCall(PetscSectionGetDof(leafSection, p, &neighbors));  in DMPlexCreateOverlapLabel()
541       if (neighbors) {  in DMPlexCreateOverlapLabel()
544         for (n = 0; n < neighbors; ++n) {  in DMPlexCreateOverlapLabel()
553     PetscCall(PetscSectionGetDof(rootSection, p, &neighbors));  in DMPlexCreateOverlapLabel()
554     if (!neighbors) continue;  in DMPlexCreateOverlapLabel()
557     for (n = 0; n < neighbors; ++n) {  in DMPlexCreateOverlapLabel()
598   PetscInt neighbors, el;  in HandlePoint_Private()  local
601   PetscCall(PetscSectionGetDof(section, p, &neighbors));  in HandlePoint_Private()
602   if (neighbors) {  in HandlePoint_Private()
610     for (n = 0; n < neighbors; ++n) {  in HandlePoint_Private()