Home
last modified time | relevance | path

Searched refs:neighbours_set (Results 1 – 4 of 4) sorted by relevance

/petsc/include/petsc/private/
H A Dpcbddcgraphhashmap.h11 … i = 0; i < node->count; i++) hash = PetscHashCombine(hash, PetscHashInt(node->neighbours_set[i])); in PCBDDCGraphNodeHash()
28 PetscCallContinue(PetscArraycmp(a->neighbours_set, b->neighbours_set, a->count, &same_set)); in PCBDDCGraphNodeEqual()
H A Dpcbddcstructsimpl.h21 PetscInt *neighbours_set; member
/petsc/src/ksp/pc/impls/bddc/
H A Dbddcfetidp.c141 PetscInt *count, **neighbours_set; in PCBDDCSetupFETIDPMatContext() local
251 PetscCall(PetscMalloc2(pcis->n, &count, pcis->n, &neighbours_set)); in PCBDDCSetupFETIDPMatContext()
253 if (pcis->n) PetscCall(PetscMalloc1(j, &neighbours_set[0])); in PCBDDCSetupFETIDPMatContext()
259 if (node->neighbours_set[j] == rank) continue; in PCBDDCSetupFETIDPMatContext()
260 neighbours_set[i][count[i]++] = node->neighbours_set[j]; in PCBDDCSetupFETIDPMatContext()
264 PetscCall(PetscSortRemoveDupsInt(count + i, neighbours_set[i])); in PCBDDCSetupFETIDPMatContext()
266 if (i != pcis->n - 1) neighbours_set[i + 1] = neighbours_set[i] + count[i]; in PCBDDCSetupFETIDPMatContext()
364 while (neighbours_set[k][neigh_position] != pcis->neigh[i]) neigh_position++; in PCBDDCSetupFETIDPMatContext()
397 …while (n_neg_values < j && neighbours_set[aux_local_numbering_1[i]][n_neg_values] < rank) n_neg_va… in PCBDDCSetupFETIDPMatContext()
454 if (pcis->n) PetscCall(PetscFree(neighbours_set[0])); in PCBDDCSetupFETIDPMatContext()
[all …]
H A Dbddcgraph.c100 …(PetscViewerASCIISynchronizedPrintf(viewer, " %" PetscInt_FMT, graph->nodes[i].neighbours_set[j])); in PCBDDCGraphASCIIView()
140 …iewerASCIISynchronizedPrintf(viewer, " %" PetscInt_FMT, graph->nodes[node_num].neighbours_set[j])); in PCBDDCGraphASCIIView()
775 PetscCall(PetscMalloc1(nodecount[i], &graph->nodes[i].neighbours_set)); in PCBDDCGraphSetUp()
776 PetscCall(PetscArraycpy(graph->nodes[i].neighbours_set, nodeneighs[i], nodecount[i])); in PCBDDCGraphSetUp()
781 if (graph->nodes[i].neighbours_set[j] == rank) nself++; in PCBDDCGraphSetUp()
785 PetscCall(PetscCalloc1(nodecount[i], &graph->nodes[i].neighbours_set)); in PCBDDCGraphSetUp()
827 if (graph->nodes[i].neighbours_set[j] == rank) c++; in PCBDDCGraphSetUp()
925 if (graph->nodes[i].neighbours_set[k] != rank) { in PCBDDCGraphSetUp()
1186 PetscCall(PetscFree(graph->nodes[i].neighbours_set)); in PCBDDCGraphReset()