Home
last modified time | relevance | path

Searched refs:procngbnum (Results 1 – 21 of 21) sorted by relevance

/dports/cad/scotch/scotch-6.0.4/src/libscotch/
H A Ddgraph_band_grow.c166 procngbnum < procngbnbr; procngbnum ++) { in DGRAPHBANDGROWNAMECOLL()
195 …for (procngbnum = 0; procngbnum < procngbnbr; procngbnum ++) /* Build communication index arrays */ in DGRAPHBANDGROWNAMECOLL()
196 nsndidxtab[procngbnum] = vsnddsptab[grafptr->procngbtab[procngbnum]]; in DGRAPHBANDGROWNAMECOLL()
224 procngbnum = 0; in DGRAPHBANDGROWNAMECOLL()
251 for (procngbnum = 0; procngbnum < procngbnbr; procngbnum ++) { in DGRAPHBANDGROWNAMECOLL()
268 for (procngbnum = 0; procngbnum < procngbnbr; procngbnum ++) { /* For all receive buffers */ in DGRAPHBANDGROWNAMECOLL()
403 procngbnum < procngbnbr; procngbnum ++) { in DGRAPHBANDGROWNAMEPTOP()
423 … (MPI_Recv_init (vrcvdattab + nrcvdsptab[procngbnum], (int) (nrcvdsptab[procngbnum + 1] - nrcvdspt… in DGRAPHBANDGROWNAMEPTOP()
496 (nsndidxtab[procngbnum] >= nsnddsptab[procngbnum + 1])) { in DGRAPHBANDGROWNAMEPTOP()
516 …if (MPI_Isend (vsnddattab + nsnddsptab[procngbnum], nsndidxtab[procngbnum] - nsnddsptab[procngbnum… in DGRAPHBANDGROWNAMEPTOP()
[all …]
H A Ddgraph_match_sync_ptop.c89 int procngbnum; in dgraphMatchSyncPtop() local
119 …for (procngbnum = 0; procngbnum < procngbnbr; procngbnum ++) /* Reset indices for sending messages… in dgraphMatchSyncPtop()
120 nsndidxtab[procngbnum] = mateptr->c.vsnddsptab[procngbtab[procngbnum]]; in dgraphMatchSyncPtop()
129 int procngbnum; in dgraphMatchSyncPtop() local
154 procngbnum = 0; in dgraphMatchSyncPtop()
163 procngbnum = procngbmed; in dgraphMatchSyncPtop()
187 int procngbnum; in dgraphMatchSyncPtop() local
201 int procngbnum; in dgraphMatchSyncPtop() local
220 int procngbnum; in dgraphMatchSyncPtop() local
229 procngbnum = vrcvreqnbr - 1; in dgraphMatchSyncPtop()
[all …]
H A Ddgraph_match_sync_coll.c86 int procngbnum; in dgraphMatchSyncColl() local
127 …for (procngbnum = 0; procngbnum < procngbnbr; procngbnum ++) /* Reset indices for sending messages… in dgraphMatchSyncColl()
128 nsndidxtab[procngbnum] = mateptr->c.vsnddsptab[procngbtab[procngbnum]]; in dgraphMatchSyncColl()
137 int procngbnum; in dgraphMatchSyncColl() local
162 procngbnum = 0; in dgraphMatchSyncColl()
171 procngbnum = procngbmed; in dgraphMatchSyncColl()
195 for (procngbnum = 0; procngbnum < procngbnbr; procngbnum ++) { in dgraphMatchSyncColl()
198 procglbnum = procngbtab[procngbnum]; in dgraphMatchSyncColl()
219 int procngbnum; in dgraphMatchSyncColl() local
319 int procngbnum; in dgraphMatchSyncColl() local
[all …]
H A Ddgraph_view.c86 int procngbnum; in dgraphView() local
141 for (procngbnum = 0; procngbnum <= procglbnbr ; procngbnum ++) in dgraphView()
143 (Gnum) grafptr->procdsptab[procngbnum]); in dgraphView()
147 for (procngbnum = 0; procngbnum < grafptr->procngbnbr; procngbnum ++) in dgraphView()
149 grafptr->procngbtab[procngbnum]); in dgraphView()
151 for (procngbnum = 0; procngbnum < grafptr->procglbnbr; procngbnum ++) in dgraphView()
153 grafptr->procrcvtab[procngbnum]); in dgraphView()
157 for (procngbnum = 0; procngbnum < grafptr->procglbnbr; procngbnum ++) in dgraphView()
159 grafptr->procsndtab[procngbnum]); in dgraphView()
H A Ddgraph_ghst.c190 int procngbnum; in dgraphGhst2() local
197 for (procngbnum = 0, procngbmax = grafptr->procglbnbr; in dgraphGhst2()
198 procngbmax - procngbnum > 1; ) { in dgraphGhst2()
201 procngbmed = (procngbmax + procngbnum) / 2; in dgraphGhst2()
203 procngbnum = procngbmed; in dgraphGhst2()
208 if (vertsidtab[procngbnum] != vertlocnum) { /* If vertex not already sent to process */ in dgraphGhst2()
220 procsidtab[procsidnbr ++] = procngbnum; /* Send this vertex data to this processor */ in dgraphGhst2()
232 int procngbnum; in dgraphGhst2() local
244 (procsndtab[procngbnum] != 0)) { in dgraphGhst2()
261 procsndnbr += procsndtab[procngbnum]; /* Sum-up vertices to send */ in dgraphGhst2()
[all …]
H A Ddgraph_coarsen.c79 int procngbnum; in dgraphCoarsenInit() local
164 for (procngbnum = procngbnxt = 0; procngbnum < procngbnbr; procngbnum ++) { in dgraphCoarsenInit()
166 procngbnxt = procngbnum; in dgraphCoarsenInit()
226 for (procngbnum = 0; procngbnum < procngbnbr; procngbnum ++) { in dgraphCoarsenBuildColl()
245 for (procngbnum = 0; procngbnum < procngbnbr; procngbnum ++) { /* For all received data chunks */ in dgraphCoarsenBuildColl()
325 procngbnum = (procngbnum + 1) % procngbnbr; /* Post-increment neighbor rank */ in dgraphCoarsenBuildPtop()
466 …for (procngbnum = 0; procngbnum < procngbnbr; procngbnum ++) /* Reset indices for sending messages… in dgraphCoarsenBuild()
467 nsndidxtab[procngbnum] = coarptr->vsnddsptab[procngbtab[procngbnum]]; in dgraphCoarsenBuild()
648 for (procngbnum = procnum = 0, esnddspval = 0; procngbnum < procngbnbr; procngbnum ++) { in dgraphCoarsenBuild()
728 for (procngbnum = 0; procngbnum < procngbnbr; procngbnum ++) in dgraphCoarsenBuild()
[all …]
H A Ddgraph_match_check.c79 int procngbnum; in dgraphMatchCheck() local
136 …for (procngbnum = 0; procngbnum < grafptr->procngbnbr; procngbnum ++) /* Reset indices for sending… in dgraphMatchCheck()
137 nsndidxtab[procngbnum] = mateptr->c.vsnddsptab[procngbtab[procngbnum]]; in dgraphMatchCheck()
167 int procngbnum; in dgraphMatchCheck() local
196 …procngbnum = procgsttax[vertgstend]; /* Find neighbor owner process … in dgraphMatchCheck()
197 …if ((procngbnum < 0) || (procngbnum >= grafptr->procngbnbr)) { /* If neighbor had not been compute… in dgraphMatchCheck()
201 if ((grafptr->procvrttab[procngbtab[procngbnum]] > vertglbend) || in dgraphMatchCheck()
202 (grafptr->procvrttab[procngbtab[procngbnum] + 1] <= vertglbend)) { in dgraphMatchCheck()
207 vsndidxnum = nsndidxtab[procngbnum] ++; /* Get position of message in send array */ in dgraphMatchCheck()
208 if (vsndidxnum >= mateptr->c.vsnddsptab[procngbtab[procngbnum] + 1]) { in dgraphMatchCheck()
H A Ddgraph_band.c143 int procngbnum; in dgraphBand() local
252 …for (procngbnum = 1; procngbnum <= grafptr->procglbnbr; procngbnum ++) { /* Process potential erro… in dgraphBand()
262 bandgrafptr->procdsptab[procngbnum] += bandgrafptr->procdsptab[procngbnum - 1]; in dgraphBand()
263 …bandgrafptr->proccnttab[procngbnum - 1] = bandgrafptr->procdsptab[procngbnum] - bandgrafptr->procd… in dgraphBand()
392 …for (procngbnum = 0; procngbnum < grafptr->proclocnum; procngbnum ++) /* Build clique with anchors… in dgraphBand()
393 bandedgeloctax[bandedgelocnum ++] = bandgrafptr->procdsptab[procngbnum + 1] - 2; in dgraphBand()
394 …for (procngbnum ++; procngbnum < grafptr->procglbnbr; procngbnum ++) /* Build clique with anchors … in dgraphBand()
395 bandedgeloctax[bandedgelocnum ++] = bandgrafptr->procdsptab[procngbnum + 1] - 2; in dgraphBand()
397 …for (procngbnum = 0; procngbnum < grafptr->proclocnum; procngbnum ++) /* Build clique with anchors… in dgraphBand()
398 bandedgeloctax[bandedgeloctmp ++] = bandgrafptr->procdsptab[procngbnum + 1] - 1; in dgraphBand()
[all …]
H A Ddgraph_halo.c203 int procngbnum; in dgraphHaloSync2() local
233 for (procngbnum = 1; procngbnum < grafptr->procglbnbr; procngbnum ++) in dgraphHaloSync2()
234 recvdsptab[procngbnum] = recvdsptab[procngbnum - 1] + procrcvtab[procngbnum - 1]; in dgraphHaloSync2()
271 int procngbnum; in dgraphHaloSync() local
284 …for (procngbnum = procngbnbr - 1, requnbr = 0; procngbnum >= 0; procngbnum --, requnbr ++) { /* Po… in dgraphHaloSync()
287 procglbnum = procngbtab[procngbnum]; in dgraphHaloSync()
297 …for (procngbnum = 0; procngbnum < procngbnbr; procngbnum ++, requnbr ++) { /* Post sends afterward… in dgraphHaloSync()
300 procglbnum = procngbtab[procngbnum]; in dgraphHaloSync()
H A Ddgraph_induce.c161 Gnum procngbnum; in dgraphInduce2() local
170 …for (procngbnum = 1; procngbnum <= orggrafptr->procglbnbr; procngbnum ++) /* Rebuild proccnttab of… in dgraphInduce2()
171 …orggrafptr->proccnttab[procngbnum - 1] = orggrafptr->procdsptab[procngbnum] - orggrafptr->procdspt… in dgraphInduce2()
181 Gnum procngbnum; in dgraphInduce2() local
184 …for (procngbnum = 0; procngbnum < indgrafptr->procglbnbr; procngbnum ++) { /* Process potential er… in dgraphInduce2()
185 …if (indgrafptr->procdsptab[procngbnum] < 0) { /* If error notified by another process … in dgraphInduce2()
189 …indgrafptr->procdsptab[procngbnum + 1] = indgrafptr->procdsptab[procngbnum] + indgrafptr->proccntt… in dgraphInduce2()
H A Dhdgraph_induce.c171 Gnum procngbnum; in hdgraphInduceList() local
180 …for (procngbnum = 1; procngbnum <= orggrafptr->s.procglbnbr; procngbnum ++) /* Rebuild proccnttab … in hdgraphInduceList()
181 …orggrafptr->s.proccnttab[procngbnum - 1] = orggrafptr->s.procdsptab[procngbnum] - orggrafptr->s.pr… in hdgraphInduceList()
192 Gnum procngbnum; in hdgraphInduceList() local
195 …for (procngbnum = 0; procngbnum < indgrafptr->s.procglbnbr; procngbnum ++) { /* Process potential … in hdgraphInduceList()
196 …if (indgrafptr->s.proccnttab[procngbnum] < 0) { /* If error notified by another process … in hdgraphInduceList()
200 …indgrafptr->s.procdsptab[procngbnum + 1] = indgrafptr->s.procdsptab[procngbnum] + indgrafptr->s.pr… in hdgraphInduceList()
H A Ddgraph_check.c95 int procngbnum; /* Number of current neighbor process */ in dgraphCheck() local
197 for (procngbnum = 0; procngbnum <= procglbnbr; procngbnum ++) { in dgraphCheck()
198 if (grafptr->procdsptab[procngbnum] != procngbtab[procngbnum]) { in dgraphCheck()
208 for (procngbnum = 0; procngbnum <= procglbnbr; procngbnum ++) { in dgraphCheck()
209 if (grafptr->procvrttab[procngbnum] != procngbtab[procngbnum]) { in dgraphCheck()
411 Gnum procngbnum; in dgraphCheck() local
415 procngbnum = (proclocnum + procnum) % procglbnbr; /* Compute neighbor process number */ in dgraphCheck()
416 vertngbmin = grafptr->procvrttab[procngbnum]; /* Get neighbor vertex number range */ in dgraphCheck()
417 vertngbmax = grafptr->procvrttab[procngbnum + 1]; in dgraphCheck()
420 if ((vertngbnbr[procngbsel] != grafptr->proccnttab[procngbnum]) || in dgraphCheck()
H A Dbdgraph_bipart_ml.c456 int procngbnum; in bdgraphBipartMlUncoarsen() local
459 procngbnum = 0; in bdgraphBipartMlUncoarsen()
468 procngbnum = procngbmed; in bdgraphBipartMlUncoarsen()
552 Gnum procngbnum; in bdgraphBipartMlUncoarsen() local
556 procngbnum = sortloctab[sortlocnum].procnum; in bdgraphBipartMlUncoarsen()
559 if (procngbnum < 0) { in bdgraphBipartMlUncoarsen()
561 procngbnum ^= (Gnum) -1; in bdgraphBipartMlUncoarsen()
563 if (procngbnum >= fineprocglbnbr) { in bdgraphBipartMlUncoarsen()
565 procngbnum -= fineprocglbnbr; in bdgraphBipartMlUncoarsen()
569 …if (((partval < 3) && (vsndidxtab[4 * procngbnum + partval] >= vsndidxtab[4 * procngbnum + partval… in bdgraphBipartMlUncoarsen()
[all …]
H A Ddgraph_match.c88 int procngbnum; in dgraphMatchInit() local
114 …for (procngbnum = 0, procvgbtab = mateptr->procvgbtab; procngbnum < grafptr->procngbnbr; procngbnu… in dgraphMatchInit()
115 procvgbtab[procngbnum] = (Gnum) procvrttab[procngbtab[procngbnum]]; in dgraphMatchInit()
116 procvgbtab[procngbnum] = (Gnum) procvrttab[grafptr->procglbnbr]; /* Mark end */ in dgraphMatchInit()
H A Dlibrary_dgraph_band.c112 int procngbnum; in SCOTCH_dgraphBand() local
223 …for (procngbnum = 1; procngbnum <= grafptr->procglbnbr; procngbnum ++) { /* Process potential erro… in SCOTCH_dgraphBand()
224 …if (bandgrafptr->procdsptab[procngbnum] < 0) { /* If error notified by another process … in SCOTCH_dgraphBand()
229 bandgrafptr->procdsptab[procngbnum] += bandgrafptr->procdsptab[procngbnum - 1]; in SCOTCH_dgraphBand()
230 …bandgrafptr->proccnttab[procngbnum - 1] = bandgrafptr->procdsptab[procngbnum] - bandgrafptr->procd… in SCOTCH_dgraphBand()
H A Ddgraph_fold.c537 int procngbnum; in dgraphFold2() local
541 procngbmax - procngbnum > 1; ) { in dgraphFold2()
546 procngbnum = procngbmed; in dgraphFold2()
616 int procngbnum; in dgraphFold2() local
632 procngbmax - procngbnum > 1; ) { in dgraphFold2()
637 procngbnum = procngbmed; in dgraphFold2()
641 orgvertlocmin = fldvertadjtab[procngbnum]; in dgraphFold2()
643 fldvertlocadj = fldvertdlttab[procngbnum]; in dgraphFold2()
661 int procngbnum; in dgraphFold2() local
665 procngbmax - procngbnum > 1; ) { in dgraphFold2()
[all …]
H A Ddgraph_build_hcub.c83 Gnum procngbnum; in dgraphBuildHcub() local
110 for (procngbnum = 0, vertglbnum = 0; /* Compute index of first local vertex */ in dgraphBuildHcub()
111 procngbnum < grafptr->proclocnum; procngbnum ++) in dgraphBuildHcub()
112 vertglbnum += DATASIZE (vertglbnbr, grafptr->procglbnbr, procngbnum); in dgraphBuildHcub()
H A Dhdgraph_fold.c500 int procngbnum; in hdgraphFold2() local
502 procngbnum = (procngbmax + procngbmin) / 2; in hdgraphFold2()
504 procngbmin = procngbnum; in hdgraphFold2()
506 procngbmax = procngbnum; in hdgraphFold2()
580 int procngbnum; in hdgraphFold2() local
584 procngbmax - procngbnum > 1; ) { in hdgraphFold2()
587 procngbmed = (procngbmax + procngbnum) / 2; in hdgraphFold2()
589 procngbnum = procngbmed; in hdgraphFold2()
767 int procngbnum; in hdgraphFold2() local
771 procngbmax - procngbnum > 1; ) { in hdgraphFold2()
[all …]
H A Ddgraph_redist.c289 Gnum procngbnum; in dgraphRedist2() local
291 procngbnum = srcpartloctax[srcvertlocnum]; in dgraphRedist2()
292 dsndcnttab[2 * procngbnum] ++; /* One more vertex */ in dgraphRedist2()
293 …dsndcnttab[2 * procngbnum + 1] += (int) (srcvendloctax[srcvertlocnum] - srcvertloctax[srcvertlocnu… in dgraphRedist2()
378 Gnum procngbnum; in dgraphRedist2() local
384 procngbnum = srcpartloctax[srcvertlocnum]; /* Retrieve destination process number */ in dgraphRedist2()
385 dsnddatidx = dsnddsptab[procngbnum]; in dgraphRedist2()
407 dsnddsptab[procngbnum] = dsnddatidx; in dgraphRedist2()
H A Ddgraph_gather_all.c439 int procngbnum; in dgraphGatherAll2() local
441 procngbnum = (procngbmax + procngbmin) / 2; in dgraphGatherAll2()
442 if (dgrfptr->procvrttab[procngbnum] <= vertlocend) in dgraphGatherAll2()
443 procngbmin = procngbnum; in dgraphGatherAll2()
445 procngbmax = procngbnum; in dgraphGatherAll2()
H A Ddgraph_build.c271 int procngbnum; /* Number of current neighbor process */ in dgraphBuild3() local
414 procngbnum = (grafptr->proclocnum + procngbnbr) % procglbnbr; /* Get neighbor process */ in dgraphBuild3()
415 vertngbmin = grafptr->procvrttab[procngbnum]; /* Get neighbor vertex number range */ in dgraphBuild3()