Lines Matching defs:nOrderBy
5528 int nOrderBy; /* Number of terms in the ORDER BY clause */
103295 int nOrderBy = p->pOrderBy->nExpr;
103297 KeyInfo *pRet = sqlite3KeyInfoAlloc(db, nOrderBy+nExtra, 1);
103300 for(i=0; i<nOrderBy; i++){
104158 int nOrderBy; /* Number of terms in the ORDER BY clause */
104181 nOrderBy = pOrderBy->nExpr;
104190 for(j=0, pItem=pOrderBy->a; j<nOrderBy; j++, pItem++){
104194 if( j==nOrderBy ){
104200 if( pOrderBy ) pOrderBy->a[nOrderBy++].u.x.iOrderByCol = (u16)i;
104212 aPermute = sqlite3DbMallocRaw(db, sizeof(int)*nOrderBy);
104215 for(i=0, pItem=pOrderBy->a; i<nOrderBy; i++, pItem++){
104238 assert( nOrderBy>=nExpr || db->mallocFailed );
104399 sqlite3VdbeAddOp4(v, OP_Compare, destA.iSdst, destB.iSdst, nOrderBy,
112432 for(i=0; i<p->nOrderBy; i++){
112658 int nOrderBy;
112678 nOrderBy = 0;
112686 nOrderBy = n;
112694 + sizeof(*pIdxOrderBy)*nOrderBy );
112707 pUsage = (struct sqlite3_index_constraint_usage*)&pIdxOrderBy[nOrderBy];
112709 *(int*)&pIdxInfo->nOrderBy = nOrderBy;
112741 for(i=0; i<nOrderBy; i++){
115850 pIdxInfo->nOrderBy : 0);
116053 u16 nOrderBy; /* Number terms in the ORDER BY clause */
116094 nOrderBy = pOrderBy->nExpr;
116095 testcase( nOrderBy==BMS-1 );
116096 if( nOrderBy>BMS-1 ) return 0; /* Cannot optimize overly large ORDER BYs */
116098 obDone = MASKBIT(nOrderBy)-1;
116115 for(i=0; i<nOrderBy; i++){
116199 for(i=0; bOnce && i<nOrderBy; i++){
116251 for(i=0; i<nOrderBy; i++){
116264 if( obSat==obDone ) return (i8)nOrderBy;
116266 for(i=nOrderBy-1; i>0; i--){
116319 ** nOrderby columns and that the first nSorted columns are already in
116325 int nOrderBy,
116342 assert( nOrderBy>0 && 66==sqlite3LogEst(100) );
116343 rScale = sqlite3LogEst((nOrderBy-nSorted)*100/nOrderBy) - 66;
116376 int nOrderBy; /* Number of ORDER BY clause terms */
116406 nOrderBy = 0;
116408 nOrderBy = pWInfo->pOrderBy->nExpr;
116413 nSpace += sizeof(LogEst) * nOrderBy;
116423 if( nOrderBy ){
116431 memset(aSortCost, 0, sizeof(LogEst) * nOrderBy);
116433 assert( aSortCost==0 || &pSpace[nSpace]==(char*)&aSortCost[nOrderBy] );
116444 if( nOrderBy ){
116447 ** are already in the requested order. Set isOrdered to nOrderBy to
116451 aFrom[0].isOrdered = nLoop>0 ? -1 : nOrderBy;
116483 if( isOrdered>=0 && isOrdered<nOrderBy ){
116486 pWInfo, nRowEst, nOrderBy, isOrdered
116493 aSortCost[isOrdered], (nOrderBy-isOrdered), nOrderBy,
128451 if( pInfo->nOrderBy==1 ){
132829 if( pInfo->nOrderBy==1
