65   b->nleaves   = -1;  in PetscSFCreate()
119   sf->nleaves  = -1;  in PetscSFReset()
253   PetscInt           i, nleaves;  in PetscSFCheckGraphValid_Private()  local
260   PetscCall(PetscSFGetGraph(sf, NULL, &nleaves, &ilocal, &iremote));  in PetscSFCheckGraphValid_Private()
262   for (i = 0; i < nleaves; i++) {  in PetscSFCheckGraphValid_Private()
456 PetscErrorCode PetscSFSetGraph(PetscSF sf, PetscInt nroots, PetscInt nleaves, PetscInt ilocal[], Pe…  in PetscSFSetGraph()  argument
462   if (nleaves > 0 && ilocal) PetscAssertPointer(ilocal, 4);  in PetscSFSetGraph()
463   if (nleaves > 0) PetscAssertPointer(iremote, 6);  in PetscSFSetGraph()
465 …PetscCheck(nleaves >= 0, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "nleaves %" PetscInt_FMT ", ca…  in PetscSFSetGraph()
480 …for (PetscInt i = 0; i < nleaves; i++) PetscCheck(iremote[i].rank >= -1 && iremote[i].rank < size,…  in PetscSFSetGraph()
484   sf->nleaves = nleaves;  in PetscSFSetGraph()
489     PetscCall(PetscMalloc1(nleaves, &tlocal));  in PetscSFSetGraph()
490     PetscCall(PetscArraycpy(tlocal, ilocal, nleaves));  in PetscSFSetGraph()
496     PetscCall(PetscMalloc1(nleaves, &tremote));  in PetscSFSetGraph()
497     PetscCall(PetscArraycpy(tremote, iremote, nleaves));  in PetscSFSetGraph()
501   if (nleaves && ilocal) {  in PetscSFSetGraph()
504     PetscCall(PetscSortIntWithDataArray(nleaves, ilocal, iremote, sizeof(PetscSFNode), &work));  in PetscSFSetGraph()
505     PetscCall(PetscSortedCheckDupsInt(nleaves, ilocal, &unique));  in PetscSFSetGraph()
509     sf->maxleaf = ilocal[nleaves - 1];  in PetscSFSetGraph()
510     contiguous  = (PetscBool)(unique && ilocal[0] == 0 && ilocal[nleaves - 1] == nleaves - 1);  in PetscSFSetGraph()
513     sf->maxleaf = nleaves - 1;  in PetscSFSetGraph()
535 …for (PetscInt i = 0; i < nleaves; i++) PetscCheck(iremote[i].rank >= -1 && iremote[i].rank < size,…  in PetscSFSetGraph()
625     sf->nleaves = N;  in PetscSFSetGraphWithPattern()
631     sf->nleaves = rank ? 0 : N;  in PetscSFSetGraphWithPattern()
637     sf->nleaves = size;  in PetscSFSetGraphWithPattern()
671   PetscInt        i, nroots, nleaves, maxlocal, count, *newilocal;  in PetscSFCreateInverseSF()  local
680   PetscCall(PetscSFGetGraph(sf, &nroots, &nleaves, &ilocal, NULL));  in PetscSFCreateInverseSF()
750       PetscInt           nroots, nleaves;  in PetscSFDuplicate()  local
753       PetscCall(PetscSFGetGraph(sf, &nroots, &nleaves, &ilocal, &iremote));  in PetscSFDuplicate()
754 …PetscCall(PetscSFSetGraph(*newsf, nroots, nleaves, (PetscInt *)ilocal, PETSC_COPY_VALUES, (PetscSF…  in PetscSFDuplicate()
804 PetscErrorCode PetscSFGetGraph(PetscSF sf, PetscInt *nroots, PetscInt *nleaves, const PetscInt *ilo…  in PetscSFGetGraph()  argument
809     PetscCall(sf->ops->GetGraph(sf, nroots, nleaves, ilocal, iremote));  in PetscSFGetGraph()
812     if (nleaves) *nleaves = sf->nleaves;  in PetscSFGetGraph()
909 …t_FMT ", leaves=%" PetscInt_FMT ", remote ranks=%d\n", rank, sf->nroots, sf->nleaves, sf->nranks));  in PetscSFView()
910 …for (PetscInt i = 0; i < sf->nleaves; i++) PetscCall(PetscViewerASCIISynchronizedPrintf(viewer, "[…  in PetscSFView()
1044   for (i = 0; i < sf->nleaves; i++) {  in PetscSFSetUpRanks()
1050 …4(sf->nranks, &sf->ranks, sf->nranks + 1, &sf->roffset, sf->nleaves, &sf->rmine, sf->nleaves, &sf-…  in PetscSFSetUpRanks()
1107   for (i = 0, irank = -1, orank = -1; i < sf->nleaves; i++) {  in PetscSFSetUpRanks()
1277     PetscCall(PetscMalloc1(sf->nleaves, &remote));  in PetscSFGetMultiSF()
1278     for (i = 0; i < sf->nleaves; i++) {  in PetscSFGetMultiSF()
1284 …PetscCall(PetscSFSetGraph(sf->multi, inoffset[sf->nroots], sf->nleaves, sf->mine, PETSC_COPY_VALUE…  in PetscSFGetMultiSF()
1304       PetscCall(PetscMalloc1(sf->nleaves, &newremote));  in PetscSFGetMultiSF()
1305       for (i = 0; i < sf->nleaves; i++) {  in PetscSFGetMultiSF()
1309 …PetscCall(PetscSFSetGraph(sf->multi, inoffset[sf->nroots], sf->nleaves, sf->mine, PETSC_COPY_VALUE…  in PetscSFGetMultiSF()
1341   PetscInt           i, j, n, nroots, nleaves, esf_nleaves, *new_ilocal, minleaf, maxleaf, maxlocal;  in PetscSFCreateEmbeddedRootSF()  local
1357   PetscCall(PetscSFGetGraph(sf, &nroots, &nleaves, &ilocal, &iremote));  in PetscSFCreateEmbeddedRootSF()
1380     for (i = 0; i < nleaves; i++) {  in PetscSFCreateEmbeddedRootSF()
1389     for (i = n = 0; i < nleaves; i++) {  in PetscSFCreateEmbeddedRootSF()
1443 …nleaves), comm, PETSC_ERR_ARG_OUTOFRANGE, "Min/Max leaf indices %" PetscInt_FMT "/%" PetscInt_FMT …  in PetscSFCreateEmbeddedLeafSF()
2002   PetscInt        i, n, nleaves;  in PetscSFCheckLeavesUnique_Private()  local
2008     PetscCall(PetscSFGetGraph(sf, NULL, &nleaves, &ilocal, NULL));  in PetscSFCheckLeavesUnique_Private()
2010     for (i = 0; i < nleaves; i++) {  in PetscSFCheckLeavesUnique_Private()
2015 …PetscCheck(n == nleaves, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Provided leaves have repeated…  in PetscSFCheckLeavesUnique_Private()
2245   PetscInt           i, j, nroots, nleaves, lnleaves, *lilocal;  in PetscSFCreateLocalSF_Private()  local
2260     PetscCall(PetscSFGetGraph(sf, &nroots, &nleaves, &ilocal, &iremote));  in PetscSFCreateLocalSF_Private()
2261     for (i = lnleaves = 0; i < nleaves; i++) {  in PetscSFCreateLocalSF_Private()
2268     for (i = j = 0; i < nleaves; i++) {  in PetscSFCreateLocalSF_Private()