Lines Matching defs:nOrderBy

7779   int nOrderBy;              /* Number of terms in the ORDER BY clause */
10244 ** sort order defined by the "nOrderBy" and "aOrderBy" fields of the
145450   int nOrderBy = ALWAYS(pOrderBy!=0) ? pOrderBy->nExpr : 0;
145452   KeyInfo *pRet = sqlite3KeyInfoAlloc(db, nOrderBy+nExtra, 1);
145455     for(i=0; i<nOrderBy; i++){
146394   int nOrderBy;         /* Number of terms in the ORDER BY clause */
146412   nOrderBy = pOrderBy->nExpr;
146421       for(j=0, pItem=pOrderBy->a; j<nOrderBy; j++, pItem++){
146426       if( j==nOrderBy ){
146432         if( pOrderBy ) pOrderBy->a[nOrderBy++].u.x.iOrderByCol = (u16)i;
146444   aPermute = sqlite3DbMallocRawNN(db, sizeof(u32)*(nOrderBy + 1));
146447     aPermute[0] = nOrderBy;
146448     for(i=1, pItem=pOrderBy->a; i<=nOrderBy; i++, pItem++){
146467     assert( nOrderBy>=nExpr || db->mallocFailed );
146646   sqlite3VdbeAddOp4(v, OP_Compare, destA.iSdst, destB.iSdst, nOrderBy,
162894   for(i=0; i<p->nOrderBy; i++){
163449   int nOrderBy;
163493   nOrderBy = 0;
163535       nOrderBy = n;
163548                            + sizeof(*pIdxOrderBy)*nOrderBy + sizeof(*pHidden)
163557   pUsage = (struct sqlite3_index_constraint_usage*)&pIdxOrderBy[nOrderBy];
163611   for(i=j=0; i<nOrderBy; i++){
163621   pIdxInfo->nOrderBy = j;
166375       pIdxInfo->nOrderBy : 0);
166915   u16 nOrderBy;         /* Number terms in the ORDER BY clause */
166956   nOrderBy = pOrderBy->nExpr;
166957   testcase( nOrderBy==BMS-1 );
166958   if( nOrderBy>BMS-1 ) return 0;  /* Cannot optimize overly large ORDER BYs */
166960   obDone = MASKBIT(nOrderBy)-1;
166992     for(i=0; i<nOrderBy; i++){
167125         for(i=0; bOnce && i<nOrderBy; i++){
167198       for(i=0; i<nOrderBy; i++){
167211   if( obSat==obDone ) return (i8)nOrderBy;
167213     for(i=nOrderBy-1; i>0; i--){
167272   int nOrderBy,      /* Number of ORDER BY clause terms */
167304     rSortCost += sqlite3LogEst((nOrderBy-nSorted)*100/nOrderBy) - 66;
167348   int nOrderBy;             /* Number of ORDER BY clause terms */
167378     nOrderBy = 0;
167380     nOrderBy = pWInfo->pOrderBy->nExpr;
167385   nSpace += sizeof(LogEst) * nOrderBy;
167395   if( nOrderBy ){
167403     memset(aSortCost, 0, sizeof(LogEst) * nOrderBy);
167405   assert( aSortCost==0 || &pSpace[nSpace]==(char*)&aSortCost[nOrderBy] );
167416   if( nOrderBy ){
167419     ** are already in the requested order. Set isOrdered to nOrderBy to
167423     aFrom[0].isOrdered = nLoop>0 ? -1 : nOrderBy;
167466         if( isOrdered>=0 && isOrdered<nOrderBy ){
167469                 pWInfo, nRowEst, nOrderBy, isOrdered
167480                aSortCost[isOrdered], (nOrderBy-isOrdered), nOrderBy,
187872   if( pInfo->nOrderBy==1 ){
192505   if( pInfo->nOrderBy==1
210033   if( pIdxInfo->nOrderBy>0
223807   if( ( pIdxInfo->nOrderBy==1
223811       ( pIdxInfo->nOrderBy==2
224606   if( pIdxInfo->nOrderBy>=1
250257   if( pInfo->nOrderBy==1 ){
256840   if( pInfo->nOrderBy==1