Lines Matching defs:bRev
59702 int bRev; /* True for DESCENDING sort order */
61310 int bRev; /* True for DESCENDING sort order */
61336 u.aj.bRev = u.aj.pKeyInfo->aSortOrder[u.aj.i];
61339 if( u.aj.bRev ) iCompare = -iCompare;
97347 int bRev; /* True if we need to scan in reverse order */
97365 bRev = (pLevel->plan.wsFlags & WHERE_REVERSE)!=0;
97467 if( bRev ){
97500 sqlite3VdbeAddOp2(v, bRev ? OP_Last : OP_Rewind, iCur, addrBrk);
97511 testOp = bRev ? OP_Le : OP_Ge;
97513 testOp = bRev ? OP_Lt : OP_Gt;
97518 pLevel->op = bRev ? OP_Prev : OP_Next;
97568 OP_Rewind, /* 2: (!start_constraints && startEq && !bRev) */
97569 OP_Last, /* 3: (!start_constraints && startEq && bRev) */
97570 OP_SeekGt, /* 4: (start_constraints && !startEq && !bRev) */
97571 OP_SeekLt, /* 5: (start_constraints && !startEq && bRev) */
97572 OP_SeekGe, /* 6: (start_constraints && startEq && !bRev) */
97573 OP_SeekLe /* 7: (start_constraints && startEq && bRev) */
97577 OP_IdxGE, /* 1: (end_constraints && !bRev) */
97578 OP_IdxLT /* 2: (end_constraints && bRev) */
97645 if( nEq<pIdx->nColumn && bRev==(pIdx->aSortOrder[nEq]==SQLITE_SO_ASC) ){
97683 op = aStartOp[(start_constraints<<2) + (startEq<<1) + bRev];
97724 op = aEndOp[(pRangeEnd || nEq) * (1 + bRev)];
97730 sqlite3VdbeChangeP5(v, endEq!=bRev ?1:0);
97759 pLevel->op = bRev ? OP_Prev : OP_Next;
97911 assert( bRev==0 || bRev==1 );
97913 pLevel->op = aStep[bRev];
97915 pLevel->p2 = 1 + sqlite3VdbeAddOp2(v, aStart[bRev], iCur, addrBrk);