Searched refs:aSortCost (Results 1 – 1 of 1) sorted by relevance
4796 LogEst *aSortCost = 0; /* Sorting and partial sorting costs */ in wherePathSolver() local4839 aSortCost = (LogEst*)pX; in wherePathSolver()4840 memset(aSortCost, 0, sizeof(LogEst) * nOrderBy); in wherePathSolver()4842 assert( aSortCost==0 || &pSpace[nSpace]==(char*)&aSortCost[nOrderBy] ); in wherePathSolver()4843 assert( aSortCost!=0 || &pSpace[nSpace]==(char*)pX ); in wherePathSolver()4904 if( aSortCost[isOrdered]==0 ){ in wherePathSolver()4905 aSortCost[isOrdered] = whereSortingCost( in wherePathSolver()4913 rCost = sqlite3LogEstAdd(rUnsorted, aSortCost[isOrdered]) + 5; in wherePathSolver()4917 aSortCost[isOrdered], (nOrderBy-isOrdered), nOrderBy, in wherePathSolver()