static paramValues_t g_params; /* Initialized at the beginning of main w/ emptyParams() function */
static UTIL_time_t g_time; /* to be used to compare solution finding speeds to compare to original */
static U32 g_memoTableLog = PARAM_UNSET;
-static U32 g_displayLevel = 3;
+static int g_displayLevel = 3;
typedef enum {
directMap,
goto _cleanUp;
}
- DISPLAY("Loading %s... \r", fileNamesTable[n]);
+ DISPLAYLEVEL(2, "Loading %s... \r", fileNamesTable[n]);
if (fileSize + pos > benchedSize) fileSize = benchedSize - pos, nbFiles=n; /* buffer too small - stop after this file */
{
better = 0;
DEBUGOUTPUT("Start\n");
cparam = winnerInfo.params;
- BMK_printWinnerOpt(stdout, CUSTOM_LEVEL, winnerInfo.result, winnerInfo.params, target, buf.srcSize);
candidateInfo.params = cparam;
/* all dist-1 candidates */
for(i = 0; i < varLen; i++) {
DEBUGOUTPUT("Res: %d\n", res);
if(res == BETTER_RESULT) { /* synonymous with better when called w/ infeasibleBM */
winnerInfo = candidateInfo;
- BMK_printWinnerOpt(stdout, CUSTOM_LEVEL, winnerInfo.result, sanitizeParams(winnerInfo.params), target, buf.srcSize);
better = 1;
if(compareResultLT(bestFeasible1.result, winnerInfo.result, target, buf.srcSize)) {
bestFeasible1 = winnerInfo;
DEBUGOUTPUT("Res: %d\n", res);
if(res == BETTER_RESULT) { /* synonymous with better in this case*/
winnerInfo = candidateInfo;
- BMK_printWinnerOpt(stdout, CUSTOM_LEVEL, winnerInfo.result, sanitizeParams(winnerInfo.params), target, buf.srcSize);
better = 1;
if(compareResultLT(bestFeasible1.result, winnerInfo.result, target, buf.srcSize)) {
bestFeasible1 = winnerInfo;
if(target.dSpeed != 0) { DISPLAYLEVEL(2, " - limit decompression speed %u MB/s", target.dSpeed >> 20); }
if(target.cMem != (U32)-1) { DISPLAYLEVEL(2, " - limit memory %u MB", target.cMem >> 20); }
- DISPLAY("\n");
+ DISPLAYLEVEL(2, "\n");
findClockGranularity();
{
winner.params = CParams;
}
- CHECKTIMEGT(ret, 0, _cleanUp); /* if pass time limit, stop */
+ CHECKTIMEGT(ret, 0, _displayCleanUp); /* if pass time limit, stop */
/* if the current params are too slow, just stop. */
if(target.cSpeed > candidate.cSpeed * 3 / 2) { break; }
}
if(compareResultLT(winner.result, w1.result, target, buf.srcSize)) {
winner = w1;
}
- CHECKTIMEGT(ret, 0, _cleanUp);
+ CHECKTIMEGT(ret, 0, _displayCleanUp);
}
while(st && tries > 0) {
st = nextStrategy(st, bestStrategy);
tries -= TRY_DECAY;
}
- CHECKTIMEGT(ret, 0, _cleanUp);
+ CHECKTIMEGT(ret, 0, _displayCleanUp);
}
} else {
winner = optimizeFixedStrategy(buf, ctx, target, paramBase, paramTarget.vals[strt_ind], allMT, g_maxTries);
goto _cleanUp;
}
/* end summary */
- BMK_displayOneResult(stdout, winner, buf.srcSize);
+_displayCleanUp:
+ if(g_displayLevel >= 0) { BMK_displayOneResult(stdout, winner, buf.srcSize); }
BMK_translateAdvancedParams(stdout, winner.params);
- DISPLAY("grillParams size - optimizer completed \n");
+ DISPLAYLEVEL(1, "grillParams size - optimizer completed \n");
}
-_cleanUp:
+_cleanUp:
freeContexts(ctx);
freeBuffers(buf);
freeMemoTableArray(allMT);
assert(argc>=1); /* for exename */
- /* Welcome message */
- DISPLAYLEVEL(2, WELCOME_MESSAGE);
-
for(i=1; i<argc; i++) {
const char* argument = argv[i];
DEBUGOUTPUT("%d: %s\n", i, argument);
if (!input_filename) { input_filename=argument; filenamesStart=i; continue; }
}
+ /* Welcome message */
+ DISPLAYLEVEL(2, WELCOME_MESSAGE);
+
if (filenamesStart==0) {
if (g_optimizer) {
DISPLAY("Optimizer Expects File\n");