Searched refs:EdgesIS (Results 1 – 1 of 1) sorted by relevance
| /petsc/src/ksp/pc/impls/bddc/ |
| H A D | bddcgraph.c | 159 …DDCGraph graph, PetscInt *n_faces, IS *FacesIS[], PetscInt *n_edges, IS *EdgesIS[], IS *VerticesIS) in PCBDDCGraphRestoreCandidatesIS() argument
170 if (EdgesIS) *EdgesIS = NULL; in PCBDDCGraphRestoreCandidatesIS()
181 if (EdgesIS) { in PCBDDCGraphRestoreCandidatesIS()
182 for (i = 0; i < *n_edges; i++) PetscCall(ISDestroy(&(*EdgesIS)[i])); in PCBDDCGraphRestoreCandidatesIS()
183 PetscCall(PetscFree(*EdgesIS)); in PCBDDCGraphRestoreCandidatesIS()
191 …DDCGraph graph, PetscInt *n_faces, IS *FacesIS[], PetscInt *n_edges, IS *EdgesIS[], IS *VerticesIS) in PCBDDCGraphGetCandidatesIS() argument
206 if (EdgesIS) *EdgesIS = cand->Edges; in PCBDDCGraphGetCandidatesIS()
232 if (EdgesIS) PetscCall(PetscMalloc1(nec, &ISForEdges)); in PCBDDCGraphGetCandidatesIS()
252 …if (EdgesIS) PetscCall(ISCreateGeneral(PETSC_COMM_SELF, graph->cptr[i + 1] - graph->cptr[i], &grap… in PCBDDCGraphGetCandidatesIS()
280 if (EdgesIS) *EdgesIS = ISForEdges; in PCBDDCGraphGetCandidatesIS()
|