/* testOrderViaBestOfNDandMS.c */ #include "../misc.h" #include "../../timings.h" /*--------------------------------------------------------------------*/ int main ( int argc, char *argv[] ) /* -------------------------------------- order a graph via the best of a nested dissection and a multisection ordering created -- 98aug26, cca -------------------------------------- */ { char *inGraphFileName, *outETreeFileName ; double cputotal, t1, t2 ; ETree *frontETree ; int maxdomainsize, maxsize, maxzeros, msglvl, nvtx, rc, seed ; Graph *graph ; FILE *msgFile ; if ( argc != 9 ) { fprintf(stdout, "\n\n usage : %s msglvl msgFile GraphFile maxdomainsize " "\n maxzeros maxsize seed ETreeFile" "\n msglvl -- message level" "\n msgFile -- message file" "\n GraphFile -- input graph file, must be *.graphf or *.graphb" "\n maxdomainsize -- maximum size for a subgraph not to be split" "\n maxzeros -- maximum # of zeros in a front" "\n maxsize -- maximum # of internal columns in a front" "\n seed -- random number seed" "\n ETreeFile -- output ETree file, must be *.etreef or *.etreeb" "\n", argv[0]) ; return(0) ; } msglvl = atoi(argv[1]) ; if ( strcmp(argv[2], "stdout") == 0 ) { msgFile = stdout ; } else if ( (msgFile = fopen(argv[2], "a")) == NULL ) { fprintf(stderr, "\n fatal error in %s" "\n unable to open file %s\n", argv[0], argv[2]) ; return(-1) ; } inGraphFileName = argv[3] ; maxdomainsize = atoi(argv[4]) ; maxzeros = atoi(argv[5]) ; maxsize = atoi(argv[6]) ; seed = atoi(argv[7]) ; outETreeFileName = argv[8] ; fprintf(msgFile, "\n %s " "\n msglvl -- %d" "\n msgFile -- %s" "\n GraphFile -- %s" "\n maxdomainsize -- %d" "\n maxzeros -- %d" "\n maxsize -- %d" "\n seed -- %d" "\n ETreeFile -- %s" "\n", argv[0], msglvl, argv[2], inGraphFileName, maxdomainsize, maxzeros, maxsize, seed, outETreeFileName) ; fflush(msgFile) ; /* ------------------------ read in the Graph object ------------------------ */ graph = Graph_new() ; if ( strcmp(inGraphFileName, "none") == 0 ) { fprintf(msgFile, "\n no file to read from") ; exit(0) ; } MARKTIME(t1) ; rc = Graph_readFromFile(graph, inGraphFileName) ; MARKTIME(t2) ; fprintf(msgFile, "\n CPU %8.3f : read in graph from file %s", t2 - t1, inGraphFileName) ; nvtx = graph->nvtx ; if ( rc != 1 ) { fprintf(msgFile, "\n return value %d from Graph_readFromFile(%p,%s)", rc, graph, inGraphFileName) ; exit(-1) ; } if ( msglvl > 2 ) { fprintf(msgFile, "\n\n after reading Graph object from file %s", inGraphFileName) ; Graph_writeForHumanEye(graph, msgFile) ; fflush(msgFile) ; } /* -------------------------------------------------------- order the graph using nested dissection and multisection -------------------------------------------------------- */ MARKTIME(t1) ; frontETree = orderViaBestOfNDandMS(graph, maxdomainsize, maxzeros, maxsize, seed, msglvl, msgFile) ; MARKTIME(t2) ; fprintf(msgFile, "\n\n CPU %8.3f : order the graph via best of ND and MS", t2 - t1) ; if ( msglvl > 2 ) { ETree_writeForHumanEye(frontETree, msgFile) ; fflush(msgFile) ; } fprintf(msgFile, "\n\n %d fronts, %d indices, %d entries, %.0f operations", frontETree->nfront, ETree_nFactorIndices(frontETree), ETree_nFactorEntries(frontETree, SPOOLES_SYMMETRIC), ETree_nFactorOps(frontETree, SPOOLES_REAL, SPOOLES_SYMMETRIC)) ; /* ------------------------------------- optionally write out the ETree object ------------------------------------- */ if ( strcmp(outETreeFileName, "none") != 0 ) { fprintf(msgFile, "\n\n writing out ETree to file %s", outETreeFileName) ; MARKTIME(t1) ; ETree_writeToFile(frontETree, outETreeFileName) ; MARKTIME(t2) ; fprintf(msgFile, "\n CPU %8.3f : write front tree to file %s", t2 - t1, outETreeFileName) ; } /* ------------------------ free the working storage ------------------------ */ Graph_free(graph) ; ETree_free(frontETree) ; fprintf(msgFile, "\n") ; fclose(msgFile) ; return(1) ; } /*--------------------------------------------------------------------*/