Lines Matching refs:nOrderBy
7535 int nOrderBy; /* Number of terms in the ORDER BY clause */ member
126861 int nOrderBy = p->pOrderBy->nExpr;
126863 KeyInfo *pRet = sqlite3KeyInfoAlloc(db, nOrderBy+nExtra, 1);
126866 for(i=0; i<nOrderBy; i++){
127766 int nOrderBy; /* Number of terms in the ORDER BY clause */
127785 nOrderBy = pOrderBy->nExpr;
127794 for(j=0, pItem=pOrderBy->a; j<nOrderBy; j++, pItem++){
127798 if( j==nOrderBy ){
127804 if( pOrderBy ) pOrderBy->a[nOrderBy++].u.x.iOrderByCol = (u16)i;
127816 aPermute = sqlite3DbMallocRawNN(db, sizeof(int)*(nOrderBy + 1));
127819 aPermute[0] = nOrderBy;
127820 for(i=1, pItem=pOrderBy->a; i<=nOrderBy; i++, pItem++){
127843 assert( nOrderBy>=nExpr || db->mallocFailed );
128004 sqlite3VdbeAddOp4(v, OP_Compare, destA.iSdst, destB.iSdst, nOrderBy,
140656 for(i=0; i<p->nOrderBy; i++){
140942 int nOrderBy;
140966 nOrderBy = 0;
140974 nOrderBy = n;
140982 + sizeof(*pIdxOrderBy)*nOrderBy + sizeof(*pHidden) );
140996 pUsage = (struct sqlite3_index_constraint_usage*)&pIdxOrderBy[nOrderBy];
140998 *(int*)&pIdxInfo->nOrderBy = nOrderBy;
141067 for(i=0; i<nOrderBy; i++){
143259 pIdxInfo->nOrderBy : 0);
143672 u16 nOrderBy; /* Number terms in the ORDER BY clause */
143713 nOrderBy = pOrderBy->nExpr;
143714 testcase( nOrderBy==BMS-1 );
143715 if( nOrderBy>BMS-1 ) return 0; /* Cannot optimize overly large ORDER BYs */
143717 obDone = MASKBIT(nOrderBy)-1;
143743 for(i=0; i<nOrderBy; i++){
143856 for(i=0; bOnce && i<nOrderBy; i++){
143915 for(i=0; i<nOrderBy; i++){
143928 if( obSat==obDone ) return (i8)nOrderBy;
143930 for(i=nOrderBy-1; i>0; i--){
143989 int nOrderBy,
144006 assert( nOrderBy>0 && 66==sqlite3LogEst(100) );
144007 rScale = sqlite3LogEst((nOrderBy-nSorted)*100/nOrderBy) - 66;
144039 int nOrderBy; /* Number of ORDER BY clause terms */
144069 nOrderBy = 0;
144071 nOrderBy = pWInfo->pOrderBy->nExpr;
144076 nSpace += sizeof(LogEst) * nOrderBy;
144086 if( nOrderBy ){
144094 memset(aSortCost, 0, sizeof(LogEst) * nOrderBy);
144096 assert( aSortCost==0 || &pSpace[nSpace]==(char*)&aSortCost[nOrderBy] );
144107 if( nOrderBy ){
144114 aFrom[0].isOrdered = nLoop>0 ? -1 : nOrderBy;
144155 if( isOrdered>=0 && isOrdered<nOrderBy ){
144158 pWInfo, nRowEst, nOrderBy, isOrdered
144169 aSortCost[isOrdered], (nOrderBy-isOrdered), nOrderBy,
161923 if( pInfo->nOrderBy==1 ){
166426 if( pInfo->nOrderBy==1
194099 if( ( pIdxInfo->nOrderBy==1
194103 ( pIdxInfo->nOrderBy==2
194766 if( pIdxInfo->nOrderBy>=1
216025 if( pInfo->nOrderBy==1 ){
222099 if( pInfo->nOrderBy==1
