Lines Matching defs:OP_Next
8687 #define OP_Next 95
59944 }else if( opcode==OP_Next || opcode==OP_SorterNext ){
64396 ** moves, either by the OP_SeekXX, OP_Next, or OP_Prev opcodes. The test
69122 ** OP_Rewind/Op_Next with no intervening instructions that might invalidate
69363 pOp->opcode = OP_Next;
69366 case OP_Next: { /* jump */
69387 assert( pOp->opcode!=OP_Next || pOp->p4.xAdvance==sqlite3BtreeNext );
79871 sqlite3VdbeAddOp2(v, OP_Next, iIdxCur, topOfLoop);
83592 sqlite3VdbeAddOp2(v, OP_Next, iTab, addr1+1);
89214 sqlite3VdbeAddOp2(v, OP_Next, 0, addr+2);
89260 sqlite3VdbeAddOp2(v, OP_Next, 0, j3);
89968 sqlite3VdbeAddOp2(v, OP_Next
90768 sqlite3VdbeAddOp2(v, OP_Next, iSrc, addr1);
90787 sqlite3VdbeAddOp2(v, OP_Next, iSrc, addr1+1);
93286 sqlite3VdbeAddOp2(v, OP_Next, 1, loopTop+1);
93293 { OP_Next, 0, 0, 0}, /* 3 */
95477 sqlite3VdbeAddOp2(v, OP_Next, iTab, addr);
96266 sqlite3VdbeAddOp2(v, OP_Next, unionTab, iStart);
96344 sqlite3VdbeAddOp2(v, OP_Next, tab1, iStart);
99894 { OP_Next, 0, ADDR(1), 0}, /* 8 */
101106 sqlite3VdbeAddOp2(v, OP_Next, ephemTab, addr+1);
104662 sqlite3VdbeAddOp2(v, OP_Next, pLevel->iTabCur, addrTop+1);
106514 pLevel->op = bRev ? OP_Prev : OP_Next;
106766 pLevel->op = OP_Next;
106862 ** fall through to the next instruction, just as an OP_Next does if
106953 static const u8 aStep[] = { OP_Next, OP_Prev };
107690 sqlite3VdbeAddOp2(v, OP_Next, pIn->iCur, pIn->addrInTop);
