289 } winnerInfo_t;  typedef
299     winnerInfo_t res;
462 static winnerInfo_t initWinnerInfo(const paramValues_t p)  in initWinnerInfo()
464     winnerInfo_t w1;  in initWinnerInfo()
747 insertWinner(const winnerInfo_t w, const constraint_t targetConstraints)  in insertWinner()
843 BMK_displayOneResult(FILE* f, winnerInfo_t res, const size_t srcSize)  in BMK_displayOneResult()
872     winnerInfo_t w;  in BMK_printWinner()
901     static winnerInfo_t g_winner = { { (size_t)-1LL, 0, 0, (size_t)-1LL },  in BMK_printWinnerOpt()
924         winnerInfo_t w;  in BMK_printWinnerOpt()
997 BMK_print_cLevelTable(FILE* f, const winnerInfo_t* winners, const size_t srcSize)  in BMK_print_cLevelTable()
1020                        const winnerInfo_t* winners,  in BMK_saveAndPrint_cLevelTable()
1821 static int BMK_seed(winnerInfo_t* winners,  in BMK_seed()
1940                        winnerInfo_t* winners,  in playAround()
1978                        winnerInfo_t* winners,  in BMK_selectRandomStart()
2003     winnerInfo_t winners[NB_LEVELS_TRACKED+1];  in BMK_generate_cLevelTable()
2172 static winnerInfo_t climbOnce(const constraint_t target,  in climbOnce()
2183     winnerInfo_t candidateInfo, winnerInfo;  in climbOnce()
2190     {   winnerInfo_t bestFeasible1 = initWinnerInfo(cparam);  in climbOnce()
2277 static winnerInfo_t
2286     winnerInfo_t winnerInfo, candidateInfo;  in optimizeFixedStrategy()
2372     winnerInfo_t winner = initWinnerInfo(emptyParams());  in optimizeForSize()
2507                 {   winnerInfo_t const w1 = climbOnce(target, allMT, buf, ctx, winner.params);  in optimizeForSize()
2515                     winnerInfo_t wc;  in optimizeForSize()