Home
last modified time | relevance | path

Searched refs:fldprocnbr (Results 1 – 7 of 7) sorted by relevance

/dports/cad/scotch/scotch-6.0.4/src/libscotch/
H A Ddgraph_fold_comm.c88 int fldprocnbr; in dgraphFoldComm() local
115 intSort2asc1 (procsrttab, fldprocnbr); /* Sort both parts of processor array */ in dgraphFoldComm()
116 intSort2asc1 (procsrttab + fldprocnbr, grafptr->procglbnbr - fldprocnbr); in dgraphFoldComm()
120 procrcvnnd = fldprocnbr; in dgraphFoldComm()
122 procsndmnd = fldprocnbr; in dgraphFoldComm()
125 …procrcvbas = fldprocnbr; /* Receive by ascending weight order in first part */ in dgraphFoldComm()
127 … procsndbas = fldprocnbr; /* Send by descending weight order in other part */ in dgraphFoldComm()
129 fldprocnbr = grafptr->procglbnbr - fldprocnbr; in dgraphFoldComm()
164 … &vertprmtab, (size_t) ((commmax + 1) * fldprocnbr * sizeof (int)), NULL) == NULL) { in dgraphFoldComm()
235 vertglbavg = DATASIZE (grafptr->vertglbnbr, fldprocnbr, 0); in dgraphFoldComm()
[all …]
H A Dhdgraph_order_nd.c103 …if (fldthrdptr->fldprocnbr > 1) { /* If subpart has several processes, fold a distri… in hdgraphOrderNdFold2()
132 int fldprocnbr; in hdgraphOrderNdFold() local
147 fldprocnbr = (orggrafptr->s.procglbnbr + 1) / 2; /* Median cut on number of processors */ in hdgraphOrderNdFold()
148 fldthrdtab[0].fldprocnbr = fldprocnbr; in hdgraphOrderNdFold()
149 fldthrdtab[1].fldprocnbr = orggrafptr->s.procglbnbr - fldprocnbr; in hdgraphOrderNdFold()
150 if (orggrafptr->s.proclocnum < fldprocnbr) { /* Compute color and rank in two subparts */ in hdgraphOrderNdFold()
159 fldprocnum = orggrafptr->s.proclocnum - fldprocnbr; in hdgraphOrderNdFold()
160 fldprocnbr = orggrafptr->s.procglbnbr - fldprocnbr; in hdgraphOrderNdFold()
167 if (fldprocnbr <= 1) { /* If our part will have only one processor */ in hdgraphOrderNdFold()
H A Ddgraph_fold_dup.c102 int fldprocnbr; in dgraphFoldDup() local
113 fldprocnbr = (orggrafptr->procglbnbr + 1) / 2; /* Median cut on number of processors */ in dgraphFoldDup()
114 if (orggrafptr->proclocnum < fldprocnbr) { /* Compute color and rank in two subparts */ in dgraphFoldDup()
121 fldprocnum = orggrafptr->proclocnum - fldprocnbr; in dgraphFoldDup()
H A Dkdgraph_map_rb_part.c175 …if (fldthrdptr->fldprocnbr == 0) /* If recursion stopped, build mapping of graph pa… in kdgraphMapRbPartFold2()
184 …if (fldthrdptr->fldprocnbr > 1) { /* If subpart has several processes, fold a distri… in kdgraphMapRbPartFold2()
209 int fldprocnbr; /* Number of processes in part of this process */ in kdgraphMapRbPartFold() local
264 …fldthrdtab[0].fldprocnbr = indflagtab[indpartmax] & fldprocnbr0; /* Stop if domain limited to one… in kdgraphMapRbPartFold()
273 …fldthrdtab[1].fldprocnbr = indflagtab[indpartmax ^ 1] & (actgrafptr->s.procglbnbr - fldprocnbr0);… in kdgraphMapRbPartFold()
278 fldprocnbr = fldprocnbr0; in kdgraphMapRbPartFold()
283 fldprocnbr = actgrafptr->s.procglbnbr - fldprocnbr0; in kdgraphMapRbPartFold()
287 fldgrafptr->procnbr = fldthrdtab[fldpartval].fldprocnbr; in kdgraphMapRbPartFold()
H A Ddgraph_fold.c88 int fldprocnbr; in dgraphFold() local
94 fldprocnbr = (orggrafptr->procglbnbr + 1) / 2; in dgraphFold()
97 fldprocnum = fldprocnum - fldprocnbr; in dgraphFold()
98 fldprocnbr = orggrafptr->procglbnbr - fldprocnbr; in dgraphFold()
100 fldproccol = ((fldprocnum >= 0) && (fldprocnum < fldprocnbr)) ? 0 : MPI_UNDEFINED; in dgraphFold()
H A Dkdgraph_map_rb_part.h74 …int fldprocnbr; /*+ Number of processes in folded communicator … member
H A Dhdgraph_order_nd.h87 …int fldprocnbr; /*+ Number of processes in folded communicator … member