| /dports/cad/scotch/scotch-6.0.4/src/libscotch/ |
| H A D | dgraph_build_hcub.c | 90 Gnum * restrict vertloctax; in dgraphBuildHcub() local
115 vertloctax = in dgraphBuildHcub()
145 if (vertloctax != NULL) { in dgraphBuildHcub()
148 memFree (vertloctax); in dgraphBuildHcub()
158 vertloctax -= baseval; in dgraphBuildHcub()
175 vertloctax[vertlocnum] = edgelocnum; in dgraphBuildHcub()
187 vertloctax[vertlocnum] = edgelocnum; /* Mark end of local vertex array */ in dgraphBuildHcub()
192 memFree (vertloctax + baseval); /* Free memory group leader */ in dgraphBuildHcub()
199 … vertlocnbr, vertlocnbr, vertloctax, vertloctax + 1, NULL, vertlocnbr, NULL, vlblloctax, in dgraphBuildHcub()
201 … vertlocnbr, vertlocnbr, vertloctax, vertloctax + 1, NULL, vertlocnbr, NULL, NULL, in dgraphBuildHcub()
[all …]
|
| H A D | dgraph_match_scan.c | 61 const Gnum * restrict const vertloctax = grafptr->vertloctax; in DGRAPHMATCHSCANNAME() local
108 edgelocnum = vertloctax[vertlocnum]; in DGRAPHMATCHSCANNAME()
119 …edgekptnbr += vendloctax[vertlocnnt] - vertloctax[vertlocnnt]; /* Add edges of other vertex only … in DGRAPHMATCHSCANNAME()
139 edgekptnbr += edgelocnnd - vertloctax[vertlocnum]; in DGRAPHMATCHSCANNAME()
148 for (edgelocnum = vertloctax[vertlocnum]; ; edgelocnum ++) { /* Loop again on edges */ in DGRAPHMATCHSCANNAME()
172 …edgekptnbr += (edgelocnnd - vertloctax[vertlocnum]) + (vendloctax[vertgstend] - vertloctax[vertgst… in DGRAPHMATCHSCANNAME()
222 edgelocnum = vertloctax[vertlocnum]; in DGRAPHMATCHSCANNAME()
241 edgekptnbr += edgelocnnd - vertloctax[vertlocnum]; in DGRAPHMATCHSCANNAME()
250 for (edgelocnum = vertloctax[vertlocnum]; ; edgelocnum ++) { /* Loop again on edges */ in DGRAPHMATCHSCANNAME()
272 …edgekptnbr += (edgelocnnd - vertloctax[vertlocnum]) + (vendloctax[vertgstend] - vertloctax[vertgst… in DGRAPHMATCHSCANNAME()
|
| H A D | dgraph_scatter.c | 140 …Gnum * restrict vertloctax; /* Array of local vertices … in dgraphScatter() local
215 &vertloctax, (size_t) ((vertlocnbr + 1) * sizeof (Gnum)), in dgraphScatter()
223 vertloctax -= baseval; in dgraphScatter()
236 memFree (vertloctax + baseval); in dgraphScatter()
252 … vertloctax + baseval, vertlocnbr, GNUM_MPI, protnum, grafptr->proccomm) != MPI_SUCCESS) { in dgraphScatter()
302 vertlocadj = vertloctax[baseval] - baseval; /* Compute local indices */ in dgraphScatter()
305 vertloctax[vertlocnum] -= vertlocadj; in dgraphScatter()
307 edgelocnbr = vertloctax[vertlocnnd] - vertloctax[baseval]; in dgraphScatter()
318 memFree (vertloctax + baseval); in dgraphScatter()
365 vertlocnbr, vertlocnbr, vertloctax, vertloctax + 1, veloloctax, NULL, NULL, in dgraphScatter()
[all …]
|
| H A D | dgraph_io_load.c | 256 vertloctax = in dgraphLoadCent()
265 vertloctax = in dgraphLoadCent()
308 if (vertloctax != NULL) in dgraphLoadCent()
309 memFree (vertloctax + baseval); in dgraphLoadCent()
621 memFree (vertloctax + baseval); in dgraphLoadCent()
653 Gnum * restrict vertloctax; in dgraphLoadDist() local
752 vertloctax = in dgraphLoadDist()
762 vertloctax = in dgraphLoadDist()
792 if (vertloctax != NULL) in dgraphLoadDist()
793 memFree (vertloctax + baseval); in dgraphLoadDist()
[all …]
|
| H A D | dgraph_gather_all.c | 117 …Gnum * restrict vertloctax; /* Temporary vertex array if graph is not compact … in dgraphGatherAll2() local
179 if (dgrfptr->vendloctax == (dgrfptr->vertloctax + 1)) { /* If distributed graph is compact */ in dgraphGatherAll2()
192 &vertloctax, (size_t) (vertlocnbr * sizeof (Gnum)), in dgraphGatherAll2()
252 …if (dgrfptr->vendloctax == (dgrfptr->vertloctax + 1)) { /* If distributed graph is compact … in dgraphGatherAll2()
253 …if (dgraphGatherAll3 (dgrfptr->vertloctax + baseval + 1, dgrfptr->vertlocnbr, /* Do not send first… in dgraphGatherAll2()
281 vertloctax -= baseval; /* Base temporary vertex array */ in dgraphGatherAll2()
286 …vertloctax[vertlocnum] = dgrfptr->vendloctax[vertlocnum] - dgrfptr->vertloctax[vertlocnum]; /* Get… in dgraphGatherAll2()
288 …for (edgelocnum = dgrfptr->vertloctax[vertlocnum]; edgelocnum < dgrfptr->vendloctax[vertlocnum]; e… in dgraphGatherAll2()
292 if (dgraphGatherAll3 (vertloctax + baseval, dgrfptr->vertlocnbr, in dgraphGatherAll2()
362 …if (dgrfptr->vendloctax == (dgrfptr->vertloctax + 1)) { /* If distributed graph is compact … in dgraphGatherAll2()
[all …]
|
| H A D | dgraph_fold.c | 147 if (orggrafptr->vendloctax != (orggrafptr->vertloctax + 1)) { in dgraphFold2()
228 &fldgrafptr->vertloctax, (size_t) ((fldvertlocnbr + 1) * sizeof (Gnum)), in dgraphFold2()
234 else if (fldgrafptr->vertloctax -= orggrafptr->baseval, in dgraphFold2()
236 fldgrafptr->vendloctax = fldgrafptr->vertloctax + 1, /* Folded graph is compact */ in dgraphFold2()
313 fldedgeidxtab[i] = orggrafptr->vertloctax[vertsndbas]; in dgraphFold2()
315 …fldedgecnttab[i] = orggrafptr->vertloctax[vertsndbas + vertsndnbr] - orggrafptr->vertloctax[vertsn… in dgraphFold2()
494 fldedgelocnnd = orggrafptr->vertloctax[orggrafptr->vertlocnnd]; in dgraphFold2()
508 …fldedgelocnnd = orggrafptr->vertloctax[orgvertlocnnd]; /* Reorder remaining local part of edge arr… in dgraphFold2()
561 (orggrafptr->vertloctax[orgvertlocnnd] - orggrafptr->baseval) * sizeof (Gnum)); in dgraphFold2()
594 Gnum * restrict const fldvertloctax = fldgrafptr->vertloctax; in dgraphFold2()
[all …]
|
| H A D | dgraph_induce.c | 95 const Gnum * restrict const orgvertloctax = orggrafptr->vertloctax; in dgraphInduce2()
140 …&indgrafptr->vertloctax, (size_t) ((indvertlocnbr + 1) * sizeof (Gnum)), /* Compact vertex array */ in dgraphInduce2()
147 else if (indgrafptr->vertloctax -= baseval, in dgraphInduce2()
221 indgrafptr->vertloctax[indvertlocnum] = indedgelocnum; in dgraphInduce2()
241 if (inddegrlocmax < (indedgelocnum - indgrafptr->vertloctax[indvertlocnum])) in dgraphInduce2()
242 inddegrlocmax = (indedgelocnum - indgrafptr->vertloctax[indvertlocnum]); in dgraphInduce2()
245 indgrafptr->vertloctax[indvertlocnum] = indedgelocnum; /* Mark end of edge array */ in dgraphInduce2()
246 indgrafptr->vendloctax = indgrafptr->vertloctax + 1; /* Induced graph is compact */ in dgraphInduce2()
323 const Gnum * restrict const orgvertloctax = orggrafptr->vertloctax; in dgraphInduceList2()
382 const Gnum * restrict const orgvertloctax = orggrafptr->vertloctax; in dgraphInducePart2()
|
| H A D | library_dgraph_build.c | 93 Gnum * vertloctax; in SCOTCH_dgraphBuild() local
114 vertloctax = (Gnum *) vertloctab - baseval; in SCOTCH_dgraphBuild()
115 …vendloctax = ((vendloctab == NULL) || (vendloctab == vertloctab + 1)) ? vertloctax + 1 : (Gnum *) … in SCOTCH_dgraphBuild()
123 vertlocnbr, vertlocmax, vertloctax, vendloctax, veloloctax, NULL, vlblloctax, in SCOTCH_dgraphBuild()
|
| H A D | library_dgraph_band.c | 116 const Gnum * restrict const vertloctax = grafptr->vertloctax; in SCOTCH_dgraphBand() local
179 …&bandgrafptr->vertloctax, (size_t) ((bandvertlocnbr + 1) * sizeof (Gnum)), /* Compact vertex array… in SCOTCH_dgraphBand()
185 else if (bandgrafptr->vertloctax -= bandgrafptr->baseval, in SCOTCH_dgraphBand()
254 bandvertloctax = bandgrafptr->vertloctax; in SCOTCH_dgraphBand()
271 degrval = vendloctax[vertlocnum] - vertloctax[vertlocnum]; in SCOTCH_dgraphBand()
275 for (edgelocnum = vertloctax[vertlocnum]; /* For all original edges */ in SCOTCH_dgraphBand()
299 for (edgelocnum = vertloctax[vertlocnum]; /* For all original edges */ in SCOTCH_dgraphBand()
331 &edloloctax[vertloctax[vertlocnum]], in SCOTCH_dgraphBand()
|
| H A D | dgraph_build_grid3d.c | 287 Gnum * vertloctax; in dgraphBuildGrid3D() local
339 … &vertloctax, (size_t) ((vertlocnbr + 1) * sizeof (Gnum)), /* +1 to indicate end of array */ in dgraphBuildGrid3D()
348 memFree (vertloctax); in dgraphBuildGrid3D()
359 vertloctax = vertloctax - baseval; in dgraphBuildGrid3D()
404 vertloctax[vertlocnum] = edgelocnum; in dgraphBuildGrid3D()
438 vertloctax[vertlocnum] = edgelocnum; in dgraphBuildGrid3D()
468 vertloctax[vertlocnum] = edgelocnum; /* Mark end of local vertex array */ in dgraphBuildGrid3D()
473 … vertlocnbr, vertlocnbr, vertloctax, vertloctax + 1, veloloctax, velolocsum, NULL, vlblloctax, in dgraphBuildGrid3D()
476 memFree (vertloctax + baseval); in dgraphBuildGrid3D()
|
| H A D | bdgraph_bipart_df.c | 114 …reduloctab[0] = grafptr->s.vendloctax[grafptr->s.vertlocnnd - 2] - grafptr->s.vertloctax[grafptr->… in bdgraphBipartDf()
115 …reduloctab[1] = grafptr->s.vendloctax[grafptr->s.vertlocnnd - 1] - grafptr->s.vertloctax[grafptr->… in bdgraphBipartDf()
177 if ((grafptr->s.vendloctax[vertlocnum] - grafptr->s.vertloctax[vertlocnum]) == 0) { in bdgraphBipartDf()
183 …for (edgelocnum = grafptr->s.vertloctax[vertlocnum], edgelocnnd = grafptr->s.vendloctax[vertlocnum… in bdgraphBipartDf()
193 if ((grafptr->s.vendloctax[vertlocnum] - grafptr->s.vertloctax[vertlocnum]) == 0) { in bdgraphBipartDf()
198 …rtlocnum] = 1.0F / (float) (grafptr->s.vendloctax[vertlocnum] - grafptr->s.vertloctax[vertlocnum]); in bdgraphBipartDf()
232 edgelocnum = grafptr->s.vertloctax[vertlocnum]; in bdgraphBipartDf()
268 …edgelocnum = grafptr->s.vertloctax[vertlocnum] + grafptr->s.procglbnbr - 1; /* Skip links to other… in bdgraphBipartDf()
349 …for (edgelocnum = grafptr->s.vertloctax[vertlocnum], edgelocnnd = grafptr->s.vendloctax[vertlocnum… in bdgraphBipartDf()
|
| H A D | hdgraph_fold.c | 136 if (orggrafptr->vhndloctax != (orggrafptr->s.vertloctax + 1)) { in hdgraphFold2()
213 &fldgrafptr->s.vertloctax, (size_t) ((fldvertlocnbr + 1) * sizeof (Gnum)), in hdgraphFold2()
220 else if (fldgrafptr->s.vertloctax -= orggrafptr->s.baseval, in hdgraphFold2()
295 …edgelocsiz = orggrafptr->s.vertloctax[vertsndbas + vertsndnbr] - orggrafptr->s.vertloctax[vertsnd… in hdgraphFold2()
298 fldedgeidxtab[i] = orggrafptr->s.vertloctax[vertsndbas]; in hdgraphFold2()
363 const Gnum * restrict const orgvertloctax = orggrafptr->s.vertloctax; in hdgraphFold2()
653 …fldgrafptr->s.vertloctax[fldvertlocnbr + orggrafptr->s.baseval] = fldgrafptr->s.edgelocsiz + orggr… in hdgraphFold2()
669 Gnum * restrict const fldvertloctax = fldgrafptr->s.vertloctax; in hdgraphFold2()
672 fldvertlocadj = fldedgeidxtab[j] - fldgrafptr->s.vertloctax[fldvertlocnum]; in hdgraphFold2()
720 Gnum * restrict const fldvertloctax = fldgrafptr->s.vertloctax; in hdgraphFold2()
[all …]
|
| H A D | dgraph_build.c | 88 Gnum * const vertloctax, /* Local vertex begin array */ in dgraphBuild() argument
108 degrval = vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphBuild()
124 … vertlocnbr, vertlocmax, vertloctax, vendloctax, veloloctax, velolocsum, vnumloctax, vlblloctax, in dgraphBuild()
151 Gnum * const vertloctax, /* Local vertex begin array */ in dgraphBuild2() argument
228 … vertlocnbr, vertloctax, vendloctax, veloloctax, velolocsum, vnumloctax, vlblloctax, in dgraphBuild2()
254 Gnum * const vertloctax, /* Local vertex begin array */ in dgraphBuild3() argument
342 grafptr->vertloctax = vertloctax; in dgraphBuild3()
|
| H A D | dgraph_match_sync_coll.c | 96 const Gnum * restrict const vertloctax = grafptr->vertloctax; in dgraphMatchSyncColl() local
258 … for (edgelocnum = vertloctax[vertlocnum]; edgeloctax[edgelocnum] != vmatglbnum; edgelocnum ++) { in dgraphMatchSyncColl()
270 edgesndnbr += vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphMatchSyncColl()
289 edgekptnbr += vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphMatchSyncColl()
293 edgesndnbr += vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphMatchSyncColl()
410 edgekptnbr += vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphMatchSyncColl()
|
| H A D | vdgraph_separate_df.c | 113 …reduloctab[0] = grafptr->s.vendloctax[grafptr->s.vertlocnnd - 2] - grafptr->s.vertloctax[grafptr->… in vdgraphSeparateDf()
114 …reduloctab[1] = grafptr->s.vendloctax[grafptr->s.vertlocnnd - 1] - grafptr->s.vertloctax[grafptr->… in vdgraphSeparateDf()
172 if ((grafptr->s.vendloctax[vertlocnum] - grafptr->s.vertloctax[vertlocnum]) == 0) { in vdgraphSeparateDf()
177 …rtlocnum] = 1.0F / (float) (grafptr->s.vendloctax[vertlocnum] - grafptr->s.vertloctax[vertlocnum]); in vdgraphSeparateDf()
210 …for (edgelocnum = grafptr->s.vertloctax[vertlocnum], edgelocnnd = grafptr->s.vendloctax[vertlocnum… in vdgraphSeparateDf()
241 …edgelocnum = grafptr->s.vertloctax[vertlocnum] + grafptr->s.procglbnbr - 1; /* Skip links to other… in vdgraphSeparateDf()
324 for (edgelocnum = grafptr->s.vertloctax[vertlocnum]; in vdgraphSeparateDf()
|
| H A D | dgraph.c | 125 if (grafptr->vertloctax != NULL) in dgraphFree2()
126 memFree (grafptr->vertloctax + grafptr->baseval); in dgraphFree2()
128 if (grafptr->vendloctax != (grafptr->vertloctax + 1)) in dgraphFree2()
|
| H A D | dgraph_band.c | 68 #define DGRAPHBANDGROWEDGE(n) bandedgelocnbr += vendloctax[n] - vertloctax[n]
195 …&bandgrafptr->vertloctax, (size_t) ((bandvertlocnbr + 1) * sizeof (Gnum)), /* Compact vertex array… in dgraphBand()
201 else if (bandgrafptr->vertloctax -= bandgrafptr->baseval, in dgraphBand()
294 bandvertloctax = bandgrafptr->vertloctax; in dgraphBand()
326 degrval = grafptr->vendloctax[vertlocnum] - grafptr->vertloctax[vertlocnum]; in dgraphBand()
330 for (edgelocnum = grafptr->vertloctax[vertlocnum]; /* For all original edges */ in dgraphBand()
367 for (edgelocnum = grafptr->vertloctax[vertlocnum]; /* For all original edges */ in dgraphBand()
430 &grafptr->edloloctax[grafptr->vertloctax[vertlocnum]], in dgraphBand()
|
| H A D | dgraph_match_sync_ptop.c | 96 const Gnum * restrict const vertloctax = grafptr->vertloctax; in dgraphMatchSyncPtop() local
282 … for (edgelocnum = vertloctax[vertlocnum]; edgeloctax[edgelocnum] != vmatglbnum; edgelocnum ++) { in dgraphMatchSyncPtop()
294 edgesndnbr += vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphMatchSyncPtop()
313 edgekptnbr += vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphMatchSyncPtop()
317 edgesndnbr += vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphMatchSyncPtop()
486 edgekptnbr += vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphMatchSyncPtop()
|
| H A D | dgraph_check.c | 120 Gnum * restrict const vertloctax = grafptr->vertloctax; in dgraphCheck() local
296 if ((vendloctax[vertlocnum] < vertloctax[vertlocnum]) || in dgraphCheck()
303 edgelocnbr += vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphCheck()
306 … for (edgelocnum = vertloctax[vertlocnum]; edgelocnum < vendloctax[vertlocnum]; edgelocnum ++) { in dgraphCheck()
404 vertngbptr = vertloctax + grafptr->baseval; /* Start working on self arrays */ in dgraphCheck()
450 for (edgelocnum = vertloctax[vertlocnum]; in dgraphCheck()
|
| H A D | dgraph_view.c | 108 if (grafptr->vendloctax == grafptr->vertloctax + 1) { in dgraphView()
111 (Gnum) grafptr->vertloctax[vertlocnum]); in dgraphView()
117 (Gnum) grafptr->vertloctax[vertlocnum]); in dgraphView()
|
| H A D | bdgraph_bipart_bd.c | 164 …reduloctab[1] = bndgrafdat.s.vendloctax[bndvertancnnd] - bndgrafdat.s.vertloctax[bndvertancnnd… in bdgraphBipartBd()
165 …reduloctab[2] = bndgrafdat.s.vendloctax[bndvertancnnd + 1] - bndgrafdat.s.vertloctax[bndvertancnnd… in bdgraphBipartBd()
293 …for (bndedgelocnum = bndgrafdat.s.vertloctax[bndvertlocnum], bndedgelocnnd = bndgrafdat.s.vendloct… in bdgraphBipartBd()
316 …for (bndedgelocnum = bndgrafdat.s.vertloctax[bndvertlocnum], bndedgelocnnd = bndgrafdat.s.vendloct… in bdgraphBipartBd()
363 …for (orgedgelocnum = orggrafptr->s.vertloctax[orgvertlocnum], orgedgelocnnd = orggrafptr->s.vendlo… in bdgraphBipartBd()
412 …for (orgedgelocnum = orggrafptr->s.vertloctax[orgvertlocnum], orgedgelocnnd = orggrafptr->s.vendlo… in bdgraphBipartBd()
|
| H A D | dgraph_band_grow.c | 118 const Gnum * restrict const vertloctax = grafptr->vertloctax; in DGRAPHBANDGROWNAMECOLL() local
203 … for (edgelocnum = vertloctax[vertlocnum]; edgelocnum < vendloctax[vertlocnum]; edgelocnum ++) { in DGRAPHBANDGROWNAMECOLL()
357 const Gnum * restrict const vertloctax = grafptr->vertloctax; in DGRAPHBANDGROWNAMEPTOP() local
461 … for (edgelocnum = vertloctax[vertlocnum]; edgelocnum < vendloctax[vertlocnum]; edgelocnum ++) { in DGRAPHBANDGROWNAMEPTOP()
|
| H A D | hdgraph_induce.c | 149 …&indgrafptr->s.vertloctax, (size_t) ((indlistnbr + 1) * sizeof (Gnum)), /* Compact vertex arrays … in hdgraphInduceList()
156 else if (indgrafptr->s.vertloctax -= orggrafptr->s.baseval, in hdgraphInduceList()
226 orgvertloctax = orggrafptr->s.vertloctax; in hdgraphInduceList()
231 indvertloctax = indgrafptr->s.vertloctax; in hdgraphInduceList()
334 …indgrafptr->vhndloctax = indgrafptr->s.vertloctax + 1; /* Compact edge array with halo vertices … in hdgraphInduceList()
|
| H A D | dgraph_match_check.c | 98 const Gnum * restrict const vertloctax = grafptr->vertloctax; in dgraphMatchCheck() local
234 edgelocnum = vertloctax[vertlocnum]; in dgraphMatchCheck()
|
| H A D | dgraph_ghst.c | 114 const Gnum * restrict const vertloctax = grafptr->vertloctax; in dgraphGhst2() local
172 for (edgelocnum = vertloctax[vertlocnum]; in dgraphGhst2()
|