Searched refs:mxCost (Results 1 – 1 of 1) sorted by relevance
4787 LogEst mxCost = 0; /* Maximum cost of a set of paths */ in wherePathSolver() local4953 && (rCost>mxCost || (rCost==mxCost && rUnsorted>=mxUnsorted)) in wherePathSolver()5041 mxCost = aTo[0].rCost; in wherePathSolver()5044 if( pTo->rCost>mxCost in wherePathSolver()5045 || (pTo->rCost==mxCost && pTo->rUnsorted>mxUnsorted) in wherePathSolver()5047 mxCost = pTo->rCost; in wherePathSolver()