88   PetscInt     nLeaves = ctx->nLeavesPerRank * ctx->size;  in CreateSF0()  local
95   PetscCall(PetscMalloc1(nLeaves + 1, &ctx->ilocal));  in CreateSF0()
96   PetscCall(PetscMalloc1(nLeaves, &ctx->iremote));  in CreateSF0()
99   ilocal[nLeaves] = -ctx->leaveStep;  in CreateSF0()
101   j = nLeaves - 1;  in CreateSF0()
109   PetscCall(PetscSFSetGraph(sf, nroots, nLeaves, ilocal, ctx->localmode, iremote, ctx->remotemode));  in CreateSF0()
117       PetscCall(PetscSortedInt(nLeaves, tlocal, &sorted));  in CreateSF0()
130   PetscInt     nLeaves = ctx->nLeavesPerRank * ctx->size;  in CreateSF1()  local
136   if (!ctx->contiguousLeaves) PetscCall(PetscCalloc1(nLeaves + 1, &ilocal));  in CreateSF1()
137   PetscCall(PetscMalloc1(nLeaves, &iremote));  in CreateSF1()
147   PetscCheck(j == nLeaves, PETSC_COMM_SELF, PETSC_ERR_PLIB, "j != nLeaves");  in CreateSF1()
148 …PetscCall(PetscSFSetGraph(sf, nroots, nLeaves, ilocal, PETSC_OWN_POINTER, iremote, PETSC_OWN_POINT…  in CreateSF1()