Searched refs:n_faces (Results 1 – 2 of 2) sorted by relevance
| /petsc/src/ksp/pc/impls/bddc/ |
| H A D | bddcgraph.c | 159 PetscErrorCode PCBDDCGraphRestoreCandidatesIS(PCBDDCGraph graph, PetscInt *n_faces, IS *FacesIS[], … in PCBDDCGraphRestoreCandidatesIS() argument
167 if (n_faces) *n_faces = 0; in PCBDDCGraphRestoreCandidatesIS()
173 if (n_faces) { in PCBDDCGraphRestoreCandidatesIS()
175 for (i = 0; i < *n_faces; i++) PetscCall(ISDestroy(&(*FacesIS)[i])); in PCBDDCGraphRestoreCandidatesIS()
178 *n_faces = 0; in PCBDDCGraphRestoreCandidatesIS()
191 PetscErrorCode PCBDDCGraphGetCandidatesIS(PCBDDCGraph graph, PetscInt *n_faces, IS *FacesIS[], Pets… in PCBDDCGraphGetCandidatesIS() argument
203 if (n_faces) *n_faces = cand->nfc; in PCBDDCGraphGetCandidatesIS()
277 if (n_faces) *n_faces = nfc; in PCBDDCGraphGetCandidatesIS()
|
| H A D | bddcschurs.c | 2067 PetscInt s, i, n_faces, n_edges, n_all_cc; in PCBDDCSubSchursInit() local
2083 PetscCall(PCBDDCGraphGetCandidatesIS(graph, &n_faces, &faces, &n_edges, &edges, &vertices)); in PCBDDCSubSchursInit()
2084 n_all_cc = n_faces + n_edges; in PCBDDCSubSchursInit()
2088 for (i = 0; i < n_faces; i++) { in PCBDDCSubSchursInit()
2113 PetscCall(PCBDDCGraphRestoreCandidatesIS(graph, &n_faces, &faces, &n_edges, &edges, &vertices)); in PCBDDCSubSchursInit()
|