Searched refs:n_edges (Results 1 – 2 of 2) sorted by relevance
| /petsc/src/ksp/pc/impls/bddc/ |
| H A D | bddcgraph.c | 159 …didatesIS(PCBDDCGraph graph, PetscInt *n_faces, IS *FacesIS[], PetscInt *n_edges, IS *EdgesIS[], I… in PCBDDCGraphRestoreCandidatesIS() argument
168 if (n_edges) *n_edges = 0; in PCBDDCGraphRestoreCandidatesIS()
180 if (n_edges) { in PCBDDCGraphRestoreCandidatesIS()
182 for (i = 0; i < *n_edges; i++) PetscCall(ISDestroy(&(*EdgesIS)[i])); in PCBDDCGraphRestoreCandidatesIS()
185 *n_edges = 0; in PCBDDCGraphRestoreCandidatesIS()
191 …didatesIS(PCBDDCGraph graph, PetscInt *n_faces, IS *FacesIS[], PetscInt *n_edges, IS *EdgesIS[], I… in PCBDDCGraphGetCandidatesIS() argument
205 if (n_edges) *n_edges = cand->nec; in PCBDDCGraphGetCandidatesIS()
279 if (n_edges) *n_edges = nec; 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()
2099 for (i = 0; i < n_edges; i++) { in PCBDDCSubSchursInit()
2113 PetscCall(PCBDDCGraphRestoreCandidatesIS(graph, &n_faces, &faces, &n_edges, &edges, &vertices)); in PCBDDCSubSchursInit()
|