Home
last modified time | relevance | path

Searched refs:degrval (Results 1 – 17 of 17) sorted by relevance

/dports/cad/scotch/scotch-6.0.4/src/libscotch/
H A Dfibo.c130 int degrval; in fiboTreeConsolidate() local
141 if (degrval >= (sizeof (INT) << 3)) in fiboTreeConsolidate()
146 degrmax = degrval; in fiboTreeConsolidate()
182 for (degrval = 0; degrval <= degrmax; degrval ++) { in fiboTreeConsolidate()
183 if (degrtab[degrval] != NULL) { /* If some tree is found */ in fiboTreeConsolidate()
184 bestptr = degrtab[degrval]; /* Record it as potential best */ in fiboTreeConsolidate()
190 …for ( ; degrval <= degrmax; degrval ++) { /* For remaining roots once a potential best root … in fiboTreeConsolidate()
191 if (degrtab[degrval] != NULL) { in fiboTreeConsolidate()
298 int degrval; in fiboTreeCheck2() local
300 degrval = 0; in fiboTreeCheck2()
[all …]
H A Dlibrary_mesh.c253 if (degrval > degrmax) in SCOTCH_meshBuild()
254 degrmax = degrval; in SCOTCH_meshBuild()
265 if (degrval > degrmax) in SCOTCH_meshBuild()
266 degrmax = degrval; in SCOTCH_meshBuild()
461 if (degrval < degrmin) in SCOTCH_meshStat()
462 degrmin = degrval; in SCOTCH_meshStat()
463 if (degrval > degrmax) in SCOTCH_meshStat()
464 degrmax = degrval; in SCOTCH_meshStat()
494 if (degrval < degrmin) in SCOTCH_meshStat()
495 degrmin = degrval; in SCOTCH_meshStat()
[all …]
H A Dhgraph_order_hx.c97 Gnum degrval; in hgraphOrderHxFill() local
100 degrval = grafptr->s.vendtax[vertnum] - grafptr->s.verttax[vertnum]; in hgraphOrderHxFill()
102 lentax[vertnew] = degrval; in hgraphOrderHxFill()
103 elentax[vertnew] = degrval; in hgraphOrderHxFill()
110 Gnum degrval; in hgraphOrderHxFill() local
113 degrval = grafptr->s.verttax[vertnum] - grafptr->s.vendtax[vertnum]; in hgraphOrderHxFill()
115 lentax[vertnew] = (degrval != 0) ? degrval : (-1 - grafptr->s.vertnbr); in hgraphOrderHxFill()
H A Dlibrary_graph.c260 degrval = srcgrafptr->vendtax[vertnum] - srcgrafptr->verttax[vertnum]; in SCOTCH_graphBuild()
261 if (degrval > degrmax) in SCOTCH_graphBuild()
262 degrmax = degrval; in SCOTCH_graphBuild()
274 if (degrval > degrmax) in SCOTCH_graphBuild()
275 degrmax = degrval; in SCOTCH_graphBuild()
385 Gnum degrval; in SCOTCH_graphStat() local
447 if (degrval < degrmin) in SCOTCH_graphStat()
448 degrmin = degrval; in SCOTCH_graphStat()
449 if (degrval > degrmax) in SCOTCH_graphStat()
450 degrmax = degrval; in SCOTCH_graphStat()
[all …]
H A Ddgraph_band.c137 Gnum degrval; in dgraphBand() local
303 Gnum degrval; in dgraphBand() local
327 if (banddegrlocmax < degrval) in dgraphBand()
328 banddegrlocmax = degrval; in dgraphBand()
344 Gnum degrval; in dgraphBand() local
383 if (banddegrlocmax < degrval) in dgraphBand()
384 banddegrlocmax = degrval; in dgraphBand()
412 if (banddegrlocmax < degrval) in dgraphBand()
413 banddegrlocmax = degrval; in dgraphBand()
415 if (banddegrlocmax < degrval) in dgraphBand()
[all …]
H A Dkgraph_band.c347 Gnum degrval; in kgraphBand() local
372 if (banddegrmax < degrval) in kgraphBand()
373 banddegrmax = degrval; in kgraphBand()
429 Gnum degrval; in kgraphBand() local
438 banddegrmax = degrval; in kgraphBand()
532 banddegrmax = degrval; in kgraphBand()
538 Gnum degrval; in kgraphBand() local
546 if (banddegrmax < degrval) in kgraphBand()
547 banddegrmax = degrval; in kgraphBand()
585 degrval = bandedgetab[domnnum]; in kgraphBand()
[all …]
H A Dhmesh_order_hx.c93 Gnum degrval; in hmeshOrderHxFill() local
98 …for (hashsiz = 16, degrval = meshptr->m.degrmax * (meshptr->m.degrmax - 1); /* Compute hash table … in hmeshOrderHxFill()
99 hashsiz < degrval; hashsiz <<= 1) ; in hmeshOrderHxFill()
152 Gnum degrval; in hmeshOrderHxFill() local
155 degrval = meshptr->m.verttax[vnodnum] - meshptr->m.vendtax[vnodnum]; in hmeshOrderHxFill()
157 lentax[vertnum] = (degrval != 0) ? degrval : - (n + 1); in hmeshOrderHxFill()
H A Dlibrary_dgraph_band.c104 Gnum degrval; in SCOTCH_dgraphBand() local
261 Gnum degrval; in SCOTCH_dgraphBand() local
271 degrval = vendloctax[vertlocnum] - vertloctax[vertlocnum]; in SCOTCH_dgraphBand()
272 if (banddegrlocmax < degrval) in SCOTCH_dgraphBand()
273 banddegrlocmax = degrval; in SCOTCH_dgraphBand()
289 Gnum degrval; in SCOTCH_dgraphBand() local
311 degrval = bandedgelocnum - bandvertloctax[bandvertlocnum]; in SCOTCH_dgraphBand()
312 if (banddegrlocmax < degrval) in SCOTCH_dgraphBand()
313 banddegrlocmax = degrval; in SCOTCH_dgraphBand()
H A Dmesh_check.c93 Gnum degrval; in meshCheck() local
102 degrval = meshptr->vendtax[vertnum] - meshptr->verttax[vertnum]; in meshCheck()
103 if (degrval > degrmax) in meshCheck()
104 degrmax = degrval; in meshCheck()
105 else if (degrval == 0) in meshCheck()
H A Dgraph_io.c178 Gnum degrval; in graphLoad() local
204 if (intLoad (stream, &degrval) != 1) { /* Read vertex degree */ in graphLoad()
209 if (degrmax < degrval) /* Set maximum degree */ in graphLoad()
210 degrmax = degrval; in graphLoad()
213 degrval += edgenum; in graphLoad()
214 if (degrval > edgennd) { /* Check if edge array overflows */ in graphLoad()
220 for ( ; edgenum < degrval; edgenum ++) { in graphLoad()
H A Dmesh_io_habo.c244 Gnum degrval; in meshGeomLoadHabo() local
246 degrval = meshptr->verttax[vnodnum]; in meshGeomLoadHabo()
247 if (degrval > degrmax) in meshGeomLoadHabo()
248 degrmax = degrval; in meshGeomLoadHabo()
251 edgesum += degrval; in meshGeomLoadHabo()
H A Dmesh_io.c213 Gnum degrval; in meshLoad() local
237 if (intLoad (stream, &degrval) != 1) { /* Read vertex degree */ in meshLoad()
242 if (degrmax < degrval) /* Set maximum degree */ in meshLoad()
243 degrmax = degrval; in meshLoad()
246 degrval += edgenum; in meshLoad()
247 if (degrval > edgennd) { /* Check if edge array overflows */ in meshLoad()
253 for ( ; edgenum < degrval; edgenum ++) { in meshLoad()
H A Ddgraph_build.c106 Gnum degrval; in dgraphBuild() local
108 degrval = vendloctax[vertlocnum] - vertloctax[vertlocnum]; in dgraphBuild()
109 if (degrlocmax < degrval) in dgraphBuild()
110 degrlocmax = degrval; in dgraphBuild()
H A Dhdgraph_gather.c409 Gnum degrval; in hdgraphGather() local
411 degrval = cgrfptr->s.verttax[vertnum]; in hdgraphGather()
412 if (degrmax < degrval) /* Account for halo edges in maximum degree */ in hdgraphGather()
413 degrmax = degrval; in hdgraphGather()
414 edgeadj += degrval; in hdgraphGather()
/dports/net/openmpi3/openmpi-3.1.6/ompi/mca/topo/treematch/treematch/
H A Dfibo.c147 int degrval; in fiboTreeConsolidate() local
158 if (degrval >= (sizeof (INT) << 3)) in fiboTreeConsolidate()
163 degrmax = degrval; in fiboTreeConsolidate()
199 for (degrval = 0; degrval <= degrmax; degrval ++) { in fiboTreeConsolidate()
200 if (degrtab[degrval] != NULL) { /* If some tree is found */ in fiboTreeConsolidate()
201 bestptr = degrtab[degrval]; /* Record it as potential best */ in fiboTreeConsolidate()
207 …for ( ; degrval <= degrmax; degrval ++) { /* For remaining roots once a potential best root … in fiboTreeConsolidate()
208 if (degrtab[degrval] != NULL) { in fiboTreeConsolidate()
315 int degrval; in fiboTreeCheck2() local
317 degrval = 0; in fiboTreeCheck2()
[all …]
/dports/net/openmpi/openmpi-4.1.1/ompi/mca/topo/treematch/treematch/
H A Dfibo.c147 int degrval; in fiboTreeConsolidate() local
158 if (degrval >= (sizeof (INT) << 3)) in fiboTreeConsolidate()
163 degrmax = degrval; in fiboTreeConsolidate()
199 for (degrval = 0; degrval <= degrmax; degrval ++) { in fiboTreeConsolidate()
200 if (degrtab[degrval] != NULL) { /* If some tree is found */ in fiboTreeConsolidate()
201 bestptr = degrtab[degrval]; /* Record it as potential best */ in fiboTreeConsolidate()
207 …for ( ; degrval <= degrmax; degrval ++) { /* For remaining roots once a potential best root … in fiboTreeConsolidate()
208 if (degrtab[degrval] != NULL) { in fiboTreeConsolidate()
315 int degrval; in fiboTreeCheck2() local
317 degrval = 0; in fiboTreeCheck2()
[all …]
/dports/cad/scotch/scotch-6.0.4/src/scotch/
H A Dgscat.c218 SCOTCH_Num degrval; in C_graphScat() local
240 if (intLoad (stream, &degrval) != 1) { /* Read vertex degree */ in C_graphScat()
244 intSave (ostream, degrval); in C_graphScat()
246 edgelocnbr += degrval; in C_graphScat()
248 for ( ; degrval > 0; degrval --) { in C_graphScat()