Home
last modified time | relevance | path

Searched refs:numNeighbors (Results 1 – 6 of 6) sorted by relevance

/petsc/src/ts/characteristic/impls/da/
H A Dslda.c60numNeighbors > 0, PETSC_COMM_SELF, PETSC_ERR_ARG_WRONGSTATE, "Invalid number of neighbors %d. Call… in CharacteristicSetUp_DA()
61 PetscCall(PetscMalloc1(c->numNeighbors, &c->needCount)); in CharacteristicSetUp_DA()
62 PetscCall(PetscMalloc1(c->numNeighbors, &c->localOffsets)); in CharacteristicSetUp_DA()
63 PetscCall(PetscMalloc1(c->numNeighbors, &c->fillCount)); in CharacteristicSetUp_DA()
64 PetscCall(PetscMalloc1(c->numNeighbors, &c->remoteOffsets)); in CharacteristicSetUp_DA()
65 PetscCall(PetscMalloc1(c->numNeighbors - 1, &c->request)); in CharacteristicSetUp_DA()
66 PetscCall(PetscMalloc1(c->numNeighbors - 1, &c->status)); in CharacteristicSetUp_DA()
/petsc/src/dm/impls/plex/
H A Dplexorient.c345 PetscInt *numNeighbors, **neighbors, *locSupport = NULL; in DMPlexOrient() local
493 PetscCall(PetscMalloc2(numComponents, &numNeighbors, numComponents, &neighbors)); in DMPlexOrient()
500 numNeighbors[comp] = 0; in DMPlexOrient()
511 for (n = 0; n < numNeighbors[comp]; ++n) in DMPlexOrient()
513 if (n >= numNeighbors[comp]) { in DMPlexOrient()
522 neighbors[comp][numNeighbors[comp]++] = l; in DMPlexOrient()
526 totNeighbors += numNeighbors[comp]; in DMPlexOrient()
534 for (n = 0; n < numNeighbors[comp]; ++n, ++off) { in DMPlexOrient()
563 …PetscCallMPI(MPI_Gatherv(numNeighbors, numComponents, MPIU_INT, N, Nc, displs, MPIU_INT, 0, comm)); in DMPlexOrient()
573 PetscCall(PetscFree2(numNeighbors, neighbors)); in DMPlexOrient()
[all …]
H A Dplexpartition.c643 PetscInt numNeighbors = PETSC_DETERMINE, n; in DMPlexCreateNeighborCSR() local
645 …etAdjacency_Internal(dm, cell, PETSC_TRUE, PETSC_FALSE, PETSC_FALSE, &numNeighbors, &neighborCells… in DMPlexCreateNeighborCSR()
647 for (n = 0; n < numNeighbors; ++n) { in DMPlexCreateNeighborCSR()
680 PetscInt numNeighbors = PETSC_DETERMINE, n; in DMPlexCreateNeighborCSR() local
683 …etAdjacency_Internal(dm, cell, PETSC_TRUE, PETSC_FALSE, PETSC_FALSE, &numNeighbors, &neighborCells… in DMPlexCreateNeighborCSR()
685 for (n = 0; n < numNeighbors; ++n) { in DMPlexCreateNeighborCSR()
1251 PetscInt p, n, numNeighbors, numPoints, dof, off, rootSize, l, nleaves, leafSize; in DMPlexPartitionLabelInvert() local
1271 PetscCall(ISGetLocalSize(valueIS, &numNeighbors)); in DMPlexPartitionLabelInvert()
1273 for (n = 0; n < numNeighbors; ++n) { in DMPlexPartitionLabelInvert()
1281 for (n = 0; n < numNeighbors; ++n) { in DMPlexPartitionLabelInvert()
[all …]
H A Dplexdistribute.c355 PetscInt pStart, pEnd, p, numLeaves, l, numNeighbors, n; in DMPlexCreateTwoSidedProcessSF() local
394 for (proc = 0, numNeighbors = 0; proc < size; ++proc) { in DMPlexCreateTwoSidedProcessSF()
395 if (PetscBTLookup(neighbors, proc)) ++numNeighbors; in DMPlexCreateTwoSidedProcessSF()
397 PetscCall(PetscMalloc1(numNeighbors, &ranksNew)); in DMPlexCreateTwoSidedProcessSF()
398 PetscCall(PetscMalloc1(numNeighbors, &localPointsNew)); in DMPlexCreateTwoSidedProcessSF()
399 PetscCall(PetscMalloc1(numNeighbors, &remotePointsNew)); in DMPlexCreateTwoSidedProcessSF()
410 …if (processRanks) PetscCall(ISCreateGeneral(PetscObjectComm((PetscObject)dm), numNeighbors, ranksN… in DMPlexCreateTwoSidedProcessSF()
416 …PetscCall(PetscSFSetGraph(*sfProcess, size, numNeighbors, localPointsNew, PETSC_OWN_POINTER, remot… in DMPlexCreateTwoSidedProcessSF()
/petsc/src/ts/characteristic/interface/
H A Dcharacteristic.c125 newC->numNeighbors = 0; in CharacteristicCreate()
557 PetscErrorCode CharacteristicSetNeighbors(Characteristic c, PetscInt numNeighbors, PetscMPIInt neig… in CharacteristicSetNeighbors() argument
560 PetscCall(PetscMPIIntCast(numNeighbors, &c->numNeighbors)); in CharacteristicSetNeighbors()
562 PetscCall(PetscMalloc1(numNeighbors, &c->neighbors)); in CharacteristicSetNeighbors()
563 PetscCall(PetscArraycpy(c->neighbors, neighbors, numNeighbors)); in CharacteristicSetNeighbors()
583 PetscCall(PetscArrayzero(c->needCount, c->numNeighbors)); in CharacteristicSendCoordinatesBegin()
586 …for (n = 1; n < c->numNeighbors; n++) PetscCallMPI(MPIU_Irecv(&c->fillCount[n], 1, MPIU_INT, c->ne… in CharacteristicSendCoordinatesBegin()
587 …for (n = 1; n < c->numNeighbors; n++) PetscCallMPI(MPIU_Send(&c->needCount[n], 1, MPIU_INT, c->nei… in CharacteristicSendCoordinatesBegin()
588 PetscCallMPI(MPI_Waitall(c->numNeighbors - 1, c->request, c->status)); in CharacteristicSendCoordinatesBegin()
592 for (n = 1; n < c->numNeighbors; n++) { in CharacteristicSendCoordinatesBegin()
[all …]
/petsc/include/petsc/private/
H A Dcharacteristicimpl.h73 PetscMPIInt numNeighbors; /* Number of neighboring processes */ member