Home
last modified time | relevance | path

Searched refs:edgelocnbr (Results 1 – 25 of 27) sorted by relevance

12

/dports/cad/scotch/scotch-6.0.4/src/libscotch/
H A Ddgraph_build.c93 const Gnum edgelocnbr, /* Number of local edges */ in dgraphBuild() argument
157 const Gnum edgelocnbr, /* Number of local edges */ in dgraphBuild2() argument
170 (edgelocsiz < edgelocnbr)) { in dgraphBuild2()
260 const Gnum edgelocnbr, /* Number of local edges */ in dgraphBuild3() argument
304 reduloctab[13] = edgelocnbr; in dgraphBuild3()
311 reduloctab[19] = edgelocnbr; in dgraphBuild3()
348 grafptr->edgelocnbr = edgelocnbr; in dgraphBuild3()
401 for (edsolocptr = edsoloctab, edsoloctnd = edsoloctab + edgelocnbr, edgelocnum = baseval; in dgraphBuild3()
406 intSort2asc2 (edsoloctab, grafptr->edgelocnbr); in dgraphBuild3()
491 reduloctab[1] = grafptr->edgelocnbr; in dgraphBuild4()
[all …]
H A Ddgraph_io_load.c190 Gnum edgelocnbr; in dgraphLoadCent() local
464 edgelocnbr = edgerednum - baseval; in dgraphLoadCent()
470 edloredtax = edgeredtax + edgelocnbr; in dgraphLoadCent()
582 edgelocnbr = vertloctax[baseval]; /* edgelocnbr is first cell */ in dgraphLoadCent()
588 if ((edgeloctax = memAlloc ((edgelocnbr + edlolocnbr) * sizeof (Gnum))) == NULL) { in dgraphLoadCent()
599 edloloctax = edgeloctax + edgelocnbr; in dgraphLoadCent()
627 …edgelocnbr, edgelocnbr, edgeloctax, NULL, edloloctax, degrglbmax); /* Non-readers will have degrgl… in dgraphLoadCent()
660 Gnum edgelocnbr; in dgraphLoadDist() local
741 edgelocnbr = reduloctab[11]; in dgraphLoadDist()
775 if ((edgeloctax = memAlloc ((edgelocnbr + edlolocnbr) * sizeof (Gnum))) == NULL) { in dgraphLoadDist()
[all …]
H A Ddgraph_build_hcub.c95 Gnum edgelocnbr; in dgraphBuildHcub() local
107 edgelocnbr = vertlocnbr * hcubdim; /* Set local number of arcs */ in dgraphBuildHcub()
108 edlolocnbr = ((flagval & 2) != 0) ? edgelocnbr : 0; in dgraphBuildHcub()
127 &edgeloctax, (size_t) (edgelocnbr * sizeof (Gnum)), in dgraphBuildHcub()
190 if (edgelocnum != edgelocnbr + baseval) { in dgraphBuildHcub()
203 edgelocnbr, edgelocnbr, edgeloctax, NULL, edloloctax, hcubdim) != 0) { in dgraphBuildHcub()
H A Ddgraph_check.c106 Gnum edgelocnbr; /* Local number of edges */ in dgraphCheck() local
224 (grafptr->edgelocnbr < 0) || in dgraphCheck()
225 (grafptr->edgelocsiz < grafptr->edgelocnbr)) { in dgraphCheck()
243 reduloctab[13] = grafptr->edgelocnbr; in dgraphCheck()
275 reduloctab[5] = grafptr->edgelocnbr; in dgraphCheck()
293 …for (vertlocnum = grafptr->baseval, edgelocnbr = 0; vertlocnum < grafptr->vertlocnnd; vertlocnum +… in dgraphCheck()
299 edgelocnbr = grafptr->edgelocnbr; /* Avoid unwanted cascaded error messages */ in dgraphCheck()
303 edgelocnbr += vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphCheck()
310 edgelocnbr = grafptr->edgelocnbr; /* Avoid unwanted cascaded error messages */ in dgraphCheck()
319 edgelocnbr = grafptr->edgelocnbr; /* Avoid unwanted cascaded error messages */ in dgraphCheck()
[all …]
H A Ddgraph_scatter.c145 …Gnum edgelocnbr; /* Number of local edges … in dgraphScatter() local
307 edgelocnbr = vertloctax[vertlocnnd] - vertloctax[baseval]; in dgraphScatter()
308 edlolocnbr = (reduglbtab[8] != 0) ? edgelocnbr : 0; in dgraphScatter()
310 &edgeloctax, (size_t) (edgelocnbr * sizeof (Gnum)), in dgraphScatter()
334 … edgeloctax + baseval, edgelocnbr, GNUM_MPI, protnum, grafptr->proccomm) != MPI_SUCCESS) { in dgraphScatter()
340 … edloloctax + baseval, edgelocnbr, GNUM_MPI, protnum, grafptr->proccomm) != MPI_SUCCESS) { in dgraphScatter()
351 … edgeloctax + baseval , edgelocnbr, GNUM_MPI, protnum, grafptr->proccomm) != MPI_SUCCESS) { in dgraphScatter()
357 … edloloctax + baseval , edgelocnbr, GNUM_MPI, protnum, grafptr->proccomm) != MPI_SUCCESS) { in dgraphScatter()
366 edgelocnbr, edgelocnbr, edgeloctax, NULL, edloloctax) != 0) { in dgraphScatter()
H A Dlibrary_dgraph.c162 SCOTCH_Num * const edgelocnbr) in SCOTCH_dgraphSize() argument
174 if (edgelocnbr != NULL) in SCOTCH_dgraphSize()
175 *edgelocnbr = (SCOTCH_Num) srcgrafptr->edgelocnbr; in SCOTCH_dgraphSize()
231 *edgelocptr = srcgrafptr->edgelocnbr; in SCOTCH_dgraphData()
H A Ddgraph_gather_all.c118 …Gnum edgelocnbr; /* Size of temporary distributed edge array … in dgraphGatherAll2() local
181 edgelocnbr = 0; in dgraphGatherAll2()
185 edgelocnbr = dgrfptr->edgelocnbr; in dgraphGatherAll2()
193 &edgeloctab, (size_t) (edgelocnbr * sizeof (Gnum)), NULL) == NULL) { in dgraphGatherAll2()
363 …if (dgraphGatherAll3 (dgrfptr->edgeloctax + baseval, dgrfptr->edgelocnbr, /* Send global indices */ in dgraphGatherAll2()
371 if (dgraphGatherAll3 (dgrfptr->edloloctax + baseval, dgrfptr->edgelocnbr, in dgraphGatherAll2()
380 if (dgraphGatherAll3 (edgeloctab, dgrfptr->edgelocnbr, in dgraphGatherAll2()
399 if (dgraphGatherAll3 (edgeloctab, dgrfptr->edgelocnbr, /* Send compacted edge load array */ in dgraphGatherAll2()
H A Ddgraph_view.c125 (Gnum) grafptr->edgelocnbr); in dgraphView()
128 edgelocnum < grafptr->edgelocnbr + grafptr->baseval; in dgraphView()
135 edgelocnum < grafptr->edgelocnbr + grafptr->baseval; in dgraphView()
H A Dlibrary_dgraph_build.c86 const Gnum edgelocnbr, /* Number of local edges */ in SCOTCH_dgraphBuild() argument
124 edgelocnbr, edgelocsiz, edgeloctax, edgegsttax, edloloctax)); in SCOTCH_dgraphBuild()
H A Ddgraph_fold.c215 fldedgelocsiz += orggrafptr->edgelocnbr; /* Add local edges and vertices */ in dgraphFold2()
222 fldgrafptr->edgelocnbr = in dgraphFold2()
432 fldgrafptr->edgelocnbr = /* Get number of local edges */ in dgraphFold2()
445 …fldgrafptr->edloloctax = fldgrafptr->edgeloctax + fldgrafptr->edgelocnbr; /* Set start index of ed… in dgraphFold2()
510 …fldgrafptr->edloloctax = fldgrafptr->edgeloctax + fldgrafptr->edgelocnbr; /* Set start index of ed… in dgraphFold2()
577 …fldgrafptr->vertloctax[fldvertlocnbr + orggrafptr->baseval] = fldgrafptr->edgelocnbr + orggrafptr-… in dgraphFold2()
649 if (fldedgelocnum >= (fldgrafptr->edgelocnbr + orggrafptr->baseval)) { in dgraphFold2()
704 fldedgeloctmp = fldgrafptr->edgelocnbr; in dgraphFold2()
716 fldgrafptr->edloloctax = fldgrafptr->edgeloctax + fldgrafptr->edgelocnbr; in dgraphFold2()
H A Ddgraph_coarsen.c404 Gnum edgelocnbr; in dgraphCoarsenBuild() local
574 edgelocnbr = coarptr->edgekptnbr + coarptr->edgercvnbr; /* Upper bound on number of edges */ in dgraphCoarsenBuild()
605 else if ((coargrafptr->edgeloctax = memAlloc (edgelocnbr * sizeof (Gnum))) == NULL) { in dgraphCoarsenBuild()
609 else if ((coargrafptr->edloloctax = memAlloc (edgelocnbr * sizeof (Gnum))) == NULL) { in dgraphCoarsenBuild()
777 if (coaredgelocnum >= (edgelocnbr + coargrafptr->baseval)) { in dgraphCoarsenBuild()
829 if (coaredgelocnum >= (edgelocnbr + coargrafptr->baseval)) { in dgraphCoarsenBuild()
857 coargrafptr->edgelocnbr = in dgraphCoarsenBuild()
860 …tax = memRealloc (coaredgeloctax + coargrafptr->baseval, coargrafptr->edgelocnbr * sizeof (Gnum)); in dgraphCoarsenBuild()
862 …tax = memRealloc (coaredloloctax + coargrafptr->baseval, coargrafptr->edgelocnbr * sizeof (Gnum)); in dgraphCoarsenBuild()
866 reduloctab[1] = coargrafptr->edgelocnbr; in dgraphCoarsenBuild()
[all …]
H A Ddgraph_gather.c93 reduloctab[2] = dgrfptr->edgelocnbr; in dgraphGather()
H A Ddgraph_ghst.c142 … &procsidtab, (size_t) ((grafptr->edgelocnbr + grafptr->vertlocnbr) * sizeof (int)), in dgraphGhst2()
144 …&sortloctab, (size_t) ((grafptr->edgelocnbr + 1) * sizeof (DgraphGhstSort)), NUL… in dgraphGhst2()
H A Dlibrary_dgraph_gather.c96 reduloctab[2] = srcdgrfptr->edgelocnbr; in SCOTCH_dgraphGather()
H A Ddgraph_induce.c122 …indedgelocmax = orggrafptr->edgelocnbr; /* Choose best upper bound on number of edges (avo… in dgraphInduce2()
248 indgrafptr->edgelocnbr = indedgelocnbr; in dgraphInduce2()
H A Ddgraph_io_save.c127 (Gnum) grafptr->edgelocnbr, in dgraphSave()
H A Dhdgraph_induce.c132 …indedgelocmax = orggrafptr->s.edgelocnbr; /* Choose best upper bound on number of edges (avo… in hdgraphInduceList()
342 indgrafptr->s.edgelocnbr = indedgelocnbr; in hdgraphInduceList()
H A Ddgraph.h166 …Gnum edgelocnbr; /*+ Number of local edges … member
H A Dhdgraph_gather.c257 … (int) (dgrfptr->s.edgelocnbr + dgrfptr->ehallocnbr), GNUM_MPI, cgrfptr->s.edgetax, in hdgraphGather()
275 (int) (dgrfptr->s.edgelocnbr + dgrfptr->ehallocnbr), GNUM_MPI, in hdgraphGather()
H A Dlibrary_dgraph_band.c345 bandgrafptr->edgelocnbr = bandedgelocnum - bandgrafptr->baseval; in SCOTCH_dgraphBand()
/dports/cad/scotch/scotch-6.0.4/src/libscotchmetis/
H A Dparmetis_dgraph_order.c119 SCOTCH_Num edgelocnbr; in METISNAMEU() local
129 edgelocnbr = xadj[vertlocnbr] - baseval; in METISNAMEU()
136 edgelocnbr, edgelocnbr, adjncy, NULL, NULL) == 0) { in METISNAMEU()
H A Dparmetis_dgraph_part.c96 SCOTCH_Num edgelocnbr; in METISNAMEU() local
132 edgelocnbr = xadj[vertlocnbr] - baseval; in METISNAMEU()
138 edgelocnbr, edgelocnbr, adjncy, NULL, edloloctab) == 0) { in METISNAMEU()
/dports/cad/scotch/scotch-6.0.4/src/scotch/
H A Dgscat.c189 SCOTCH_Num edgelocnbr; in C_graphScat() local
217 for (vertlocnum = edgelocnbr = 0; vertlocnum < vertlocnbr; vertlocnum ++) { in C_graphScat()
246 edgelocnbr += degrval; in C_graphScat()
280 (long long) edgelocnbr, /* Now we know the exact number of edges */ in C_graphScat()
/dports/science/PETSc/petsc-3.14.1/src/mat/partition/impls/scotch/
H A Dscotch.c249 …SCOTCH_Num *locals,*velotab,*veloloctab,*edloloctab,vertlocnbr,edgelocnbr,nparts=par… in MatPartitioningApply_PTScotch_Private() local
323 edgelocnbr = adj->i[vertlocnbr]; in MatPartitioningApply_PTScotch_Private()
338 NULL,edgelocnbr,edgelocnbr,adj->j,NULL,edloloctab);CHKERRQ(ierr); in MatPartitioningApply_PTScotch_Private()
364 …ierr = SCOTCH_graphBuild(&grafdat,0,vertlocnbr,adj->i,adj->i+1,veloloctab,NULL,edgelocnbr,adj->j,e… in MatPartitioningApply_PTScotch_Private()
/dports/science/PETSc/petsc-3.14.1/src/dm/partitioner/impls/ptscotch/
H A Dpartptscotch.c95 SCOTCH_Num edgelocnbr; in PTScotch_PartGraph_MPI() local
112 edgelocnbr = xadj[vertlocnbr]; in PTScotch_PartGraph_MPI()
115 …at, 0, vertlocnbr, vertlocnbr, xadj, xadj + 1, veloloctab, NULL, edgelocnbr, edgelocnbr, adjncy, N… in PTScotch_PartGraph_MPI()

12