int
SCOTCH_dgraphMapCompute (
SCOTCH_Dgraph * const grafptr, /*+ Graph to map +*/
SCOTCH_Dmapping * const mappptr, /*+ Mapping to compute +*/
SCOTCH_Strat * const stratptr) /*+ Mapping strategy +*/
{
Kdgraph mapgrafdat; /* Effective mapping graph */
Kdmapping mapmappdat; /* Initial mapping domain */
const Strat * mapstratptr; /* Pointer to mapping strategy */
LibDmapping * restrict srcmappptr;
Dgraph * srcgrafptr;
int o;
srcgrafptr = (Dgraph *) grafptr;
srcmappptr = (LibDmapping *) mappptr;
#ifdef SCOTCH_DEBUG_DGRAPH2
if (dgraphCheck (srcgrafptr) != 0) {
errorPrint ("SCOTCH_dgraphMapCompute: invalid input graph");
return (1);
}
#endif /* SCOTCH_DEBUG_DGRAPH2 */
if (*((Strat **) stratptr) == NULL) { /* Set default mapping strategy if necessary */
ArchDom archdomnorg;
archDomFrst (&srcmappptr->m.archdat, &archdomnorg);
SCOTCH_stratDgraphMapBuild (stratptr, SCOTCH_STRATQUALITY, srcgrafptr->procglbnbr, archDomSize (&srcmappptr->m.archdat, &archdomnorg), 0.01);
}
mapstratptr = *((Strat **) stratptr);
if (mapstratptr->tabl != &kdgraphmapststratab) {
errorPrint ("SCOTCH_dgraphMapCompute: not a parallel graph mapping strategy");
return (1);
}
if (kdgraphInit (&mapgrafdat, srcgrafptr, &srcmappptr->m) != 0)
return (1);
mapmappdat.mappptr = &srcmappptr->m;
if (((o = kdgraphMapSt (&mapgrafdat, &mapmappdat, mapstratptr)) == 0) && /* Perform mapping */
(srcmappptr->termloctab != NULL))
o = dmapTerm (&srcmappptr->m, &mapgrafdat.s, srcmappptr->termloctab); /* Use "&mapgrafdat.s" to take advantage of ghost arrays */
kdgraphExit (&mapgrafdat);
return (o);
}
int
SCOTCH_dgraphCheck (
const SCOTCH_Dgraph * const grafptr)
{
return (dgraphCheck ((const Dgraph * const) grafptr));
}
int
SCOTCH_dgraphOrderComputeList (
SCOTCH_Dgraph * const grafptr, /*+ Graph to order +*/
SCOTCH_Dordering * const ordeptr, /*+ Ordering to compute +*/
const SCOTCH_Num listnbr, /*+ Number of vertices in list +*/
const SCOTCH_Num * const listtab, /*+ List of vertex indices to order +*/
SCOTCH_Strat * const stratptr) /*+ Ordering strategy +*/
{
Dorder * srcordeptr; /* Pointer to ordering */
DorderCblk * srccblkptr; /* Initial column block */
Dgraph * restrict srcgrafptr; /* Pointer to scotch graph */
Hdgraph srcgrafdat; /* Halo source graph structure */
Gnum srclistnbr; /* Number of items in list */
Gnum * restrict srclisttab; /* Subgraph vertex list */
const Strat * ordstratptr; /* Pointer to ordering strategy */
srcgrafptr = (Dgraph *) grafptr;
#ifdef SCOTCH_DEBUG_DGRAPH2
if (dgraphCheck (srcgrafptr) != 0) {
errorPrint ("SCOTCH_dgraphOrderComputeList: invalid input graph");
return (1);
}
#endif /* SCOTCH_DEBUG_DGRAPH2 */
if (*((Strat **) stratptr) == NULL) /* Set default ordering strategy if necessary */
SCOTCH_stratDgraphOrderBuild (stratptr, SCOTCH_STRATQUALITY, srcgrafptr->procglbnbr, 0, 0.2);
ordstratptr = *((Strat **) stratptr);
if (ordstratptr->tabl != &hdgraphorderststratab) {
errorPrint ("SCOTCH_dgraphOrderComputeList: not a distributed ordering strategy");
return (1);
}
srcgrafdat.s = *srcgrafptr; /* Copy non-halo graph data */
srcgrafdat.s.edloloctax = NULL; /* Never mind about edge loads */
srcgrafdat.s.vlblloctax = NULL; /* Do not propagate vertex labels */
srcgrafdat.vhallocnbr = 0; /* No halo on graph */
srcgrafdat.vhndloctax = srcgrafdat.s.vendloctax;
srcgrafdat.ehallocnbr = 0;
srcgrafdat.levlnum = 0;
srcordeptr = (Dorder *) ordeptr; /* Get ordering */
srclistnbr = (Gnum) listnbr; /* Build vertex list */
srclisttab = (Gnum *) listtab;
intRandInit (); /* Check that random number generator is initialized */
/* TODO: Take list into account */
dorderFree (srcordeptr); /* Clean all existing ordering data */
if ((srccblkptr = dorderFrst (srcordeptr)) == NULL) {
errorPrint ("SCOTCH_dgraphOrderComputeList: cannot create root column block");
return (1);
}
hdgraphOrderSt (&srcgrafdat, srccblkptr, ordstratptr);
dorderDispose (srccblkptr);
srcgrafptr->flagval |= srcgrafdat.s.flagval & (DGRAPHFREEEDGEGST | DGRAPHHASEDGEGST);
srcgrafptr->edgegsttax = srcgrafdat.s.edgegsttax; /* Get edge ghost array from working graph if it gained one */
*srcgrafptr = srcgrafdat.s; /* Get back Dgraph structure, possibly updated (additional ghost data arrays) */
return (0);
}
