Searched refs:nLeaves (Results 1 – 4 of 4) sorted by relevance
| /petsc/src/vec/is/sf/tests/ ! |
| H A D | ex18.c | 130 PetscInt nLeaves = ctx->nsfs * ctx->n * ctx->size; in CreateReferenceSF_Regular() local 136 if (ctx->sparseLeaves) PetscCall(PetscCalloc1(nLeaves + 1, &ilocal)); in CreateReferenceSF_Regular() 138 for (j = 0; j < nLeaves; j++) { in CreateReferenceSF_Regular() 148 PetscCall(PetscCalloc1(nLeaves, &iremote)); in CreateReferenceSF_Regular() 157 …PetscCall(PetscSFSetGraph(sf, nroots, nLeaves, ilocal, PETSC_OWN_POINTER, iremote, PETSC_OWN_POINT… in CreateReferenceSF_Regular() 164 PetscCall(PetscMalloc1(nLeaves, &gremote)); in CreateReferenceSF_Regular() 165 for (j = 0; j < nLeaves; j++) gremote[j] = j; in CreateReferenceSF_Regular() 166 PetscCall(PetscSFSetGraphLayout(sf, map, nLeaves, ilocal, PETSC_OWN_POINTER, gremote)); in CreateReferenceSF_Regular() 184 PetscInt nLeaves = ctx->n * ctx->size + (ctx->size - 1) * ctx->size / 2; in CreateSFs_Irregular() local 198 if (ctx->sparseLeaves) PetscCall(PetscCalloc1(nLeaves + 1, &ilocal)); in CreateSFs_Irregular() [all …]
|
| H A D | ex19.c | 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() [all …]
|
| /petsc/src/vec/is/sf/interface/ ! |
| H A D | sf.c | 2453 PetscInt i, s, nLeaves, nRoots; in PetscSFConcatenate() local 2495 nLeaves = leafArrayOffsets[nsfs]; in PetscSFConcatenate() 2529 PetscCall(PetscMalloc1(nLeaves, &gremote)); in PetscSFConcatenate() 2563 PetscCall(PetscMalloc1(nLeaves, &ilocal_new)); in PetscSFConcatenate() 2564 for (i = 0; i < nLeaves; i++) ilocal_new[i] = -1; in PetscSFConcatenate() 2579 PetscCall(PetscMalloc1(nLeaves, &iremote_new)); in PetscSFConcatenate() 2580 for (i = 0; i < nLeaves; i++) { in PetscSFConcatenate() 2618 …PetscCall(PetscSFSetGraph(*newsf, nRoots, nLeaves, ilocal_new, PETSC_OWN_POINTER, iremote_new, PET… in PetscSFConcatenate() 2622 …PetscCall(PetscSFSetGraphLayout(*newsf, glayout, nLeaves, ilocal_new, PETSC_OWN_POINTER, gremote)); in PetscSFConcatenate()
|
| /petsc/src/dm/impls/forest/p4est/ ! |
| H A D | pforest.h | 2165 PetscInt startF, endF, startC, endC, p, nLeaves; in DMPforestGetCellCoveringSF() local 2246 PetscCall(PetscSectionGetStorageSize(section, &nLeaves)); in DMPforestGetCellCoveringSF() 2247 PetscCall(PetscMalloc1(nLeaves, &leaves)); in DMPforestGetCellCoveringSF() 2260 …PetscCall(PetscSFSetGraph(sf, cEnd - cStart, nLeaves, NULL, PETSC_OWN_POINTER, leaves, PETSC_OWN_P… in DMPforestGetCellCoveringSF() 5036 PetscInt nRoots, nLeaves, *mine = NULL; in DMForestCreateCellSF_pforest() local 5047 nLeaves = 0; in DMForestCreateCellSF_pforest() 5058 nLeaves = nRoots - nSelf; in DMForestCreateCellSF_pforest() 5060 PetscCall(PetscMalloc1(nLeaves, &mine)); in DMForestCreateCellSF_pforest() 5061 PetscCall(PetscMalloc1(nLeaves, &remote)); in DMForestCreateCellSF_pforest() 5074 for (; q < nLeaves; q++) mine[q] = (q - nGhostPre) + cLocalEnd; in DMForestCreateCellSF_pforest() [all …]
|