Lines Matching refs:nOrderBy
7274 int nOrderBy; /* Number of terms in the ORDER BY clause */ member
120665 int nOrderBy = p->pOrderBy->nExpr;
120667 KeyInfo *pRet = sqlite3KeyInfoAlloc(db, nOrderBy+nExtra, 1);
120670 for(i=0; i<nOrderBy; i++){
121555 int nOrderBy; /* Number of terms in the ORDER BY clause */
121578 nOrderBy = pOrderBy->nExpr;
121587 for(j=0, pItem=pOrderBy->a; j<nOrderBy; j++, pItem++){
121591 if( j==nOrderBy ){
121597 if( pOrderBy ) pOrderBy->a[nOrderBy++].u.x.iOrderByCol = (u16)i;
121609 aPermute = sqlite3DbMallocRawNN(db, sizeof(int)*(nOrderBy + 1));
121612 aPermute[0] = nOrderBy;
121613 for(i=1, pItem=pOrderBy->a; i<=nOrderBy; i++, pItem++){
121636 assert( nOrderBy>=nExpr || db->mallocFailed );
121795 sqlite3VdbeAddOp4(v, OP_Compare, destA.iSdst, destB.iSdst, nOrderBy,
133493 for(i=0; i<p->nOrderBy; i++){
133781 int nOrderBy;
133805 nOrderBy = 0;
133813 nOrderBy = n;
133821 + sizeof(*pIdxOrderBy)*nOrderBy + sizeof(*pHidden) );
133835 pUsage = (struct sqlite3_index_constraint_usage*)&pIdxOrderBy[nOrderBy];
133837 *(int*)&pIdxInfo->nOrderBy = nOrderBy;
133892 for(i=0; i<nOrderBy; i++){
136044 pIdxInfo->nOrderBy : 0);
136445 u16 nOrderBy; /* Number terms in the ORDER BY clause */
136486 nOrderBy = pOrderBy->nExpr;
136487 testcase( nOrderBy==BMS-1 );
136488 if( nOrderBy>BMS-1 ) return 0; /* Cannot optimize overly large ORDER BYs */
136490 obDone = MASKBIT(nOrderBy)-1;
136516 for(i=0; i<nOrderBy; i++){
136629 for(i=0; bOnce && i<nOrderBy; i++){
136688 for(i=0; i<nOrderBy; i++){
136701 if( obSat==obDone ) return (i8)nOrderBy;
136703 for(i=nOrderBy-1; i>0; i--){
136762 int nOrderBy,
136779 assert( nOrderBy>0 && 66==sqlite3LogEst(100) );
136780 rScale = sqlite3LogEst((nOrderBy-nSorted)*100/nOrderBy) - 66;
136812 int nOrderBy; /* Number of ORDER BY clause terms */
136842 nOrderBy = 0;
136844 nOrderBy = pWInfo->pOrderBy->nExpr;
136849 nSpace += sizeof(LogEst) * nOrderBy;
136859 if( nOrderBy ){
136867 memset(aSortCost, 0, sizeof(LogEst) * nOrderBy);
136869 assert( aSortCost==0 || &pSpace[nSpace]==(char*)&aSortCost[nOrderBy] );
136880 if( nOrderBy ){
136887 aFrom[0].isOrdered = nLoop>0 ? -1 : nOrderBy;
136925 if( isOrdered>=0 && isOrdered<nOrderBy ){
136928 pWInfo, nRowEst, nOrderBy, isOrdered
136935 aSortCost[isOrdered], (nOrderBy-isOrdered), nOrderBy,
150451 if( pInfo->nOrderBy==1 ){
154922 if( pInfo->nOrderBy==1
177865 if( ( pIdxInfo->nOrderBy==1
177869 ( pIdxInfo->nOrderBy==2
178506 if( pIdxInfo->nOrderBy>=1
201330 if( pInfo->nOrderBy==1 ){
206900 if( pInfo->nOrderBy==1