Lines Matching refs:nOrderBy
6174 int nOrderBy; /* Number of terms in the ORDER BY clause */ member
115433 int nOrderBy = p->pOrderBy->nExpr;
115435 KeyInfo *pRet = sqlite3KeyInfoAlloc(db, nOrderBy+nExtra, 1);
115438 for(i=0; i<nOrderBy; i++){
116347 int nOrderBy; /* Number of terms in the ORDER BY clause */
116370 nOrderBy = pOrderBy->nExpr;
116379 for(j=0, pItem=pOrderBy->a; j<nOrderBy; j++, pItem++){
116383 if( j==nOrderBy ){
116389 if( pOrderBy ) pOrderBy->a[nOrderBy++].u.x.iOrderByCol = (u16)i;
116401 aPermute = sqlite3DbMallocRawNN(db, sizeof(int)*(nOrderBy + 1));
116404 aPermute[0] = nOrderBy;
116405 for(i=1, pItem=pOrderBy->a; i<=nOrderBy; i++, pItem++){
116428 assert( nOrderBy>=nExpr || db->mallocFailed );
116589 sqlite3VdbeAddOp4(v, OP_Compare, destA.iSdst, destB.iSdst, nOrderBy,
127283 for(i=0; i<p->nOrderBy; i++){
127558 int nOrderBy;
127581 nOrderBy = 0;
127589 nOrderBy = n;
127597 + sizeof(*pIdxOrderBy)*nOrderBy );
127610 pUsage = (struct sqlite3_index_constraint_usage*)&pIdxOrderBy[nOrderBy];
127612 *(int*)&pIdxInfo->nOrderBy = nOrderBy;
127650 for(i=0; i<nOrderBy; i++){
129674 pIdxInfo->nOrderBy : 0);
130048 u16 nOrderBy; /* Number terms in the ORDER BY clause */
130089 nOrderBy = pOrderBy->nExpr;
130090 testcase( nOrderBy==BMS-1 );
130091 if( nOrderBy>BMS-1 ) return 0; /* Cannot optimize overly large ORDER BYs */
130093 obDone = MASKBIT(nOrderBy)-1;
130117 for(i=0; i<nOrderBy; i++){
130213 for(i=0; bOnce && i<nOrderBy; i++){
130271 for(i=0; i<nOrderBy; i++){
130284 if( obSat==obDone ) return (i8)nOrderBy;
130286 for(i=nOrderBy-1; i>0; i--){
130345 int nOrderBy,
130362 assert( nOrderBy>0 && 66==sqlite3LogEst(100) );
130363 rScale = sqlite3LogEst((nOrderBy-nSorted)*100/nOrderBy) - 66;
130395 int nOrderBy; /* Number of ORDER BY clause terms */
130425 nOrderBy = 0;
130427 nOrderBy = pWInfo->pOrderBy->nExpr;
130432 nSpace += sizeof(LogEst) * nOrderBy;
130442 if( nOrderBy ){
130450 memset(aSortCost, 0, sizeof(LogEst) * nOrderBy);
130452 assert( aSortCost==0 || &pSpace[nSpace]==(char*)&aSortCost[nOrderBy] );
130463 if( nOrderBy ){
130470 aFrom[0].isOrdered = nLoop>0 ? -1 : nOrderBy;
130508 if( isOrdered>=0 && isOrdered<nOrderBy ){
130511 pWInfo, nRowEst, nOrderBy, isOrdered
130518 aSortCost[isOrdered], (nOrderBy-isOrdered), nOrderBy,
143425 if( pInfo->nOrderBy==1 ){
147868 if( pInfo->nOrderBy==1
169884 if( ( pIdxInfo->nOrderBy==1
169888 ( pIdxInfo->nOrderBy==2
191989 if( pInfo->nOrderBy==1 ){
