Home
last modified time | relevance | path

Searched refs:indgrafptr (Results 1 – 11 of 11) sorted by relevance

/dports/cad/scotch/scotch-6.0.4/src/libscotch/
H A Dgraph_induce.c133 indgrafptr->velotax -= indgrafptr->baseval; in graphInduceList()
143 indgrafptr->verttax -= indgrafptr->baseval; /* Adjust base of arrays */ in graphInduceList()
144 indgrafptr->vnumtax -= indgrafptr->baseval; in graphInduceList()
146 indgrafptr->vertnnd = indvertnbr + indgrafptr->baseval; in graphInduceList()
224 indgrafptr->velotax -= indgrafptr->baseval; in graphInducePart()
234 indgrafptr->verttax -= indgrafptr->baseval; /* Adjust base of arrays */ in graphInducePart()
235 indgrafptr->vnumtax -= indgrafptr->baseval; in graphInducePart()
237 indgrafptr->vertnnd = indvertnbr + indgrafptr->baseval; in graphInducePart()
361 indgrafptr->vertnbr = indvertnum - indgrafptr->baseval; in graphInduce2()
365 indgrafptr->edlosum = (indedlotax != NULL) ? indedlosum : indgrafptr->edgenbr; in graphInduce2()
[all …]
H A Ddgraph_induce.c109 indgrafptr->baseval = baseval; in dgraphInduce2()
149 … indgrafptr->veloloctax = (orgveloloctax != NULL) ? indgrafptr->veloloctax - baseval : NULL, in dgraphInduce2()
176 … &indgrafptr->proccnttab[0], 1, GNUM_MPI, indgrafptr->proccomm) != MPI_SUCCESS) { in dgraphInduce2()
189 …indgrafptr->procdsptab[procngbnum + 1] = indgrafptr->procdsptab[procngbnum] + indgrafptr->proccntt… in dgraphInduce2()
192 indgrafptr->procvrttab = indgrafptr->procdsptab; /* Graph does not have holes */ in dgraphInduce2()
195 dgraphFree (indgrafptr); in dgraphInduce2()
206 dgraphFree (indgrafptr); in dgraphInduce2()
246 indgrafptr->vendloctax = indgrafptr->vertloctax + 1; /* Induced graph is compact */ in dgraphInduce2()
251 indgrafptr->vlblloctax = indgrafptr->vnumloctax; in dgraphInduce2()
289 dgraphFree (indgrafptr); in dgraphInduce2()
[all …]
H A Dhgraph_induce.c114 …indgrafptr->s.velotax = (orggrafptr->s.velotax != NULL) ? (indgrafptr->s.velotax - indgrafptr->s.… in hgraphInduceList()
115 indgrafptr->s.verttax -= indgrafptr->s.baseval; in hgraphInduceList()
116 indgrafptr->s.vnumtax -= indgrafptr->s.baseval; in hgraphInduceList()
117 indgrafptr->vnhdtax -= indgrafptr->s.baseval; in hgraphInduceList()
119 indgrafptr->vnohnnd = orglistptr->vnumnbr + indgrafptr->s.baseval; in hgraphInduceList()
172 indgrafptr->s.edgetax = indedgetab - indgrafptr->s.baseval; in hgraphInduce2()
176 hgraphExit (indgrafptr); in hgraphInduce2()
184 indgrafptr->s.edlotax -= indgrafptr->s.baseval; in hgraphInduce2()
194 indedlooftval = indgrafptr->s.edlotax - indgrafptr->s.edgetax; in hgraphInduce2()
199 indgrafptr->s.edgetax -= indgrafptr->s.baseval; in hgraphInduce2()
[all …]
H A Dhdgraph_induce.c84 Hdgraph * restrict const indgrafptr) in hdgraphInduceList() argument
184 indgrafptr->s.procvrttab = indgrafptr->s.procdsptab; /* Graph does not have holes */ in hdgraphInduceList()
187 … &indgrafptr->s.proccnttab[0], 1, GNUM_MPI, indgrafptr->s.proccomm) != MPI_SUCCESS) { in hdgraphInduceList()
200 …indgrafptr->s.procdsptab[procngbnum + 1] = indgrafptr->s.procdsptab[procngbnum] + indgrafptr->s.pr… in hdgraphInduceList()
205 hdgraphExit (indgrafptr); in hdgraphInduceList()
222 hdgraphExit (indgrafptr); in hdgraphInduceList()
301 hdgraphExit (indgrafptr); in hdgraphInduceList()
318 indgrafptr->s.edgeloctax = memRealloc (indgrafptr->s.edgeloctax + orggrafptr->s.baseval, in hdgraphInduceList()
334 …indgrafptr->vhndloctax = indgrafptr->s.vertloctax + 1; /* Compact edge array with halo vertices … in hdgraphInduceList()
339 indgrafptr->s.vertlocnbr = indlistnbr; in hdgraphInduceList()
[all …]
H A Dhgraph_induce_edge.c94 indvertnum < indgrafptr->vnohnnd; indvertnum ++) { in HGRAPHINDUCE2NAME()
146 indgrafptr->vnlosum = (indvelotax != NULL) ? indvelosum : indgrafptr->vnohnbr; in HGRAPHINDUCE2NAME()
147 indgrafptr->enohnbr = indenohnbr; in HGRAPHINDUCE2NAME()
168 indedlotax -= indgrafptr->s.baseval; in HGRAPHINDUCE2NAME()
208 indgrafptr->s.vertnbr = indvertnnd - indgrafptr->s.baseval; in HGRAPHINDUCE2NAME()
209 indgrafptr->s.vertnnd = indvertnnd; in HGRAPHINDUCE2NAME()
210 indgrafptr->s.velosum = (indvelotax != NULL) ? indvelosum : indgrafptr->s.vertnbr; in HGRAPHINDUCE2NAME()
211 indgrafptr->s.edgenbr = indedgenum - indgrafptr->s.baseval; /* Set actual number of edges */ in HGRAPHINDUCE2NAME()
212 indgrafptr->s.edlosum = HGRAPHINDUCE2EDLOSUM; in HGRAPHINDUCE2NAME()
213 indgrafptr->s.degrmax = inddegrmax; in HGRAPHINDUCE2NAME()
[all …]
H A Dlibrary_dgraph_induce.c88 Dgraph * restrict const indgrafptr, in _SCOTCHdgraphInducePart2() argument
103 Gnum * restrict const indvnumloctax = indgrafptr->vnumloctax; in _SCOTCHdgraphInducePart2()
105 …cnum = indvertlocnum = orggrafptr->baseval, indvertglbnum = indgrafptr->procvrttab[indgrafptr->pro… in _SCOTCHdgraphInducePart2()
118 if ((indvertlocnum - orggrafptr->baseval) != indgrafptr->vertlocnbr) { in _SCOTCHdgraphInducePart2()
120 dgraphExit (indgrafptr); in _SCOTCHdgraphInducePart2()
134 SCOTCH_Dgraph * const indgrafptr) /* Induced subgraph */ in SCOTCH_dgraphInducePart() argument
142 ((Dgraph * restrict const) indgrafptr)->proccomm, &o); in SCOTCH_dgraphInducePart()
165 … *) orggrafptr, _SCOTCHdgraphInducePart2, &orgdatadat, indvertloctmp, NULL, (Dgraph *) indgrafptr); in SCOTCH_dgraphInducePart()
166 ((Dgraph *) indgrafptr)->vnumloctax = NULL; /* Do not impact subsequent inductions */ in SCOTCH_dgraphInducePart()
H A Dlibrary_dgraph_induce_f.c75 SCOTCH_Dgraph * const indgrafptr, \
77 (orggrafptr, orgpartloctab, indpartval, indvertlocnbr, indgrafptr, revaptr))
79 …ptr = SCOTCH_dgraphInducePart (orggrafptr, orgpartloctab, *indpartval, *indvertlocnbr, indgrafptr);
H A Dkgraph_map_rb_part.c187 const Graph * indgrafptr; in kgraphMapRbPart2() local
217 indgrafptr = srcgrafptr; /* Assume we will work on the original graph */ in kgraphMapRbPart2()
220 indgrafptr = &indgrafdat; in kgraphMapRbPart2()
229 …if (kgraphMapRbBgraph (dataptr, &actgrafdat, indgrafptr, mappptr, domnsubtab, vflowgttab) != 0) { … in kgraphMapRbPart2()
259 …if (indgrafptr == &indgrafdat) /* If an induced subgraph had been created … in kgraphMapRbPart2()
294 … if ((o = kgraphMapRbPart2 (dataptr, indgrafptr, actgrafdat.parttax, (GraphPart) i, vertnbrtab[i], in kgraphMapRbPart2()
301 if (indgrafptr == &indgrafdat) /* If an induced subgraph had been created */ in kgraphMapRbPart2()
H A Dwgraph_part_rb.c142 Graph * indgrafptr; in wgraphPartRb2() local
165 indgrafptr = orggrafptr; /* Assume we will work on the original graph */ in wgraphPartRb2()
167 indgrafptr = &indgrafdat; in wgraphPartRb2()
174 actgrafdat.s = *indgrafptr; in wgraphPartRb2()
232 …if ((o = wgraphPartRb2 (dataptr, indgrafptr, actgrafdat.parttax, (GraphPart) i, grafsubsiz[i], dom… in wgraphPartRb2()
239 …if (indgrafptr == &indgrafdat) /* If an induced subgraph had been created … in wgraphPartRb2()
240 …graphExit (indgrafptr); /* Free it … in wgraphPartRb2()
H A Dkgraph_map_rb.c115 …Graph * restrict indgrafptr; /* Pointer to top-level graph without fixed vertic… in kgraphMapRb() local
142 indgrafptr = &grafptr->s; /* Work on the original graph */ in kgraphMapRb()
152 indgrafptr = &indgrafdat; in kgraphMapRb()
155 …afptr->m.archptr) != 0) ? kgraphMapRbPart : kgraphMapRbMap) (&datadat, indgrafptr, vflonbr, vflota… in kgraphMapRb()
208 Graph * restrict const indgrafptr, /*+ Induced subgraph without fixed vertices… in kgraphMapRbVfloBuild() argument
276 …if (graphInducePart (orggrafptr, orgparttax, orggrafptr->vertnbr - orgvfixnbr, 0, indgrafptr) != 0… in kgraphMapRbVfloBuild()
H A Dbdgraph.c81 const Dgraph * restrict const indgrafptr, /* Induced source subdgraph */ in bdgraphInit() argument
93 …actgrafptr->s = *indgrafptr; /* Get source graph data … in bdgraphInit()