Cross Reference: /external/sqlite/dist/orig/sqlite3.c

Lines Matching refs:nOrderBy
5528   int nOrderBy;              /* Number of terms in the ORDER BY clause */
103275   int nOrderBy = p->pOrderBy->nExpr;
103277   KeyInfo *pRet = sqlite3KeyInfoAlloc(db, nOrderBy+nExtra, 1);
103280     for(i=0; i<nOrderBy; i++){
104138   int nOrderBy;         /* Number of terms in the ORDER BY clause */
104161   nOrderBy = pOrderBy->nExpr;
104170       for(j=0, pItem=pOrderBy->a; j<nOrderBy; j++, pItem++){
104174       if( j==nOrderBy ){
104180         if( pOrderBy ) pOrderBy->a[nOrderBy++].u.x.iOrderByCol = (u16)i;
104192   aPermute = sqlite3DbMallocRaw(db, sizeof(int)*nOrderBy);
104195     for(i=0, pItem=pOrderBy->a; i<nOrderBy; i++, pItem++){
104218     assert( nOrderBy>=nExpr || db->mallocFailed );
104379   sqlite3VdbeAddOp4(v, OP_Compare, destA.iSdst, destB.iSdst, nOrderBy,
112412   for(i=0; i<p->nOrderBy; i++){
112638   int nOrderBy;
112658   nOrderBy = 0;
112666       nOrderBy = n;
112674                            + sizeof(*pIdxOrderBy)*nOrderBy );
112687   pUsage = (struct sqlite3_index_constraint_usage*)&pIdxOrderBy[nOrderBy];
112689   *(int*)&pIdxInfo->nOrderBy = nOrderBy;
112721   for(i=0; i<nOrderBy; i++){
115830                                       pIdxInfo->nOrderBy : 0);
116033   u16 nOrderBy;         /* Number terms in the ORDER BY clause */
116074   nOrderBy = pOrderBy->nExpr;
116075   testcase( nOrderBy==BMS-1 );
116076   if( nOrderBy>BMS-1 ) return 0;  /* Cannot optimize overly large ORDER BYs */
116078   obDone = MASKBIT(nOrderBy)-1;
116095     for(i=0; i<nOrderBy; i++){
116179         for(i=0; bOnce && i<nOrderBy; i++){
116231       for(i=0; i<nOrderBy; i++){
116244   if( obSat==obDone ) return (i8)nOrderBy;
116246     for(i=nOrderBy-1; i>0; i--){
116305   int nOrderBy,
116322   assert( nOrderBy>0 && 66==sqlite3LogEst(100) );
116323   rScale = sqlite3LogEst((nOrderBy-nSorted)*100/nOrderBy) - 66;
116356   int nOrderBy;             /* Number of ORDER BY clause terms */
116386     nOrderBy = 0;
116388     nOrderBy = pWInfo->pOrderBy->nExpr;
116393   nSpace += sizeof(LogEst) * nOrderBy;
116403   if( nOrderBy ){
116411     memset(aSortCost, 0, sizeof(LogEst) * nOrderBy);
116413   assert( aSortCost==0 || &pSpace[nSpace]==(char*)&aSortCost[nOrderBy] );
116424   if( nOrderBy ){
116427     ** are already in the requested order. Set isOrdered to nOrderBy to
116431     aFrom[0].isOrdered = nLoop>0 ? -1 : nOrderBy;
116463         if( isOrdered>=0 && isOrdered<nOrderBy ){
116466                 pWInfo, nRowEst, nOrderBy, isOrdered
116473                aSortCost[isOrdered], (nOrderBy-isOrdered), nOrderBy, 
128431   if( pInfo->nOrderBy==1 ){
132797   if( pInfo->nOrderBy==1