Lines Matching defs:nOrderBy
7542 int nOrderBy; /* Number of terms in the ORDER BY clause */
10023 ** sort order defined by the "nOrderBy" and "aOrderBy" fields of the
140739 int nOrderBy = ALWAYS(pOrderBy!=0) ? pOrderBy->nExpr : 0;
140741 KeyInfo *pRet = sqlite3KeyInfoAlloc(db, nOrderBy+nExtra, 1);
140744 for(i=0; i<nOrderBy; i++){
141685 int nOrderBy; /* Number of terms in the ORDER BY clause */
141703 nOrderBy = pOrderBy->nExpr;
141712 for(j=0, pItem=pOrderBy->a; j<nOrderBy; j++, pItem++){
141717 if( j==nOrderBy ){
141723 if( pOrderBy ) pOrderBy->a[nOrderBy++].u.x.iOrderByCol = (u16)i;
141735 aPermute = sqlite3DbMallocRawNN(db, sizeof(u32)*(nOrderBy + 1));
141738 aPermute[0] = nOrderBy;
141739 for(i=1, pItem=pOrderBy->a; i<=nOrderBy; i++, pItem++){
141758 assert( nOrderBy>=nExpr || db->mallocFailed );
141937 sqlite3VdbeAddOp4(v, OP_Compare, destA.iSdst, destB.iSdst, nOrderBy,
157269 for(i=0; i<p->nOrderBy; i++){
157732 int nOrderBy;
157776 nOrderBy = 0;
157818 nOrderBy = n;
157831 + sizeof(*pIdxOrderBy)*nOrderBy + sizeof(*pHidden)
157840 pUsage = (struct sqlite3_index_constraint_usage*)&pIdxOrderBy[nOrderBy];
157894 for(i=j=0; i<nOrderBy; i++){
157904 pIdxInfo->nOrderBy = j;
160375 pIdxInfo->nOrderBy : 0);
160922 u16 nOrderBy; /* Number terms in the ORDER BY clause */
160963 nOrderBy = pOrderBy->nExpr;
160964 testcase( nOrderBy==BMS-1 );
160965 if( nOrderBy>BMS-1 ) return 0; /* Cannot optimize overly large ORDER BYs */
160967 obDone = MASKBIT(nOrderBy)-1;
160999 for(i=0; i<nOrderBy; i++){
161132 for(i=0; bOnce && i<nOrderBy; i++){
161205 for(i=0; i<nOrderBy; i++){
161218 if( obSat==obDone ) return (i8)nOrderBy;
161220 for(i=nOrderBy-1; i>0; i--){
161279 int nOrderBy,
161297 assert( nOrderBy>0 && 66==sqlite3LogEst(100) );
161298 rScale = sqlite3LogEst((nOrderBy-nSorted)*100/nOrderBy) - 66;
161336 int nOrderBy; /* Number of ORDER BY clause terms */
161365 nOrderBy = 0;
161367 nOrderBy = pWInfo->pOrderBy->nExpr;
161372 nSpace += sizeof(LogEst) * nOrderBy;
161382 if( nOrderBy ){
161390 memset(aSortCost, 0, sizeof(LogEst) * nOrderBy);
161392 assert( aSortCost==0 || &pSpace[nSpace]==(char*)&aSortCost[nOrderBy] );
161403 if( nOrderBy ){
161406 ** are already in the requested order. Set isOrdered to nOrderBy to
161410 aFrom[0].isOrdered = nLoop>0 ? -1 : nOrderBy;
161453 if( isOrdered>=0 && isOrdered<nOrderBy ){
161456 pWInfo, nRowEst, nOrderBy, isOrdered
161467 aSortCost[isOrdered], (nOrderBy-isOrdered), nOrderBy,
181362 if( pInfo->nOrderBy==1 ){
185923 if( pInfo->nOrderBy==1
214450 if( ( pIdxInfo->nOrderBy==1
214454 ( pIdxInfo->nOrderBy==2
215240 if( pIdxInfo->nOrderBy>=1
237479 if( pInfo->nOrderBy==1 ){
243776 if( pInfo->nOrderBy==1