Lines Matching defs:iFirst
64686 u32 iFirst = 1 + (iPg==0?0:HASHTABLE_NPAGE_ONE+(iPg-1)*HASHTABLE_NPAGE);
64693 for(iFrame=iFirst; iFrame<=iLast; iFrame++){
66997 u32 iFirst = 0; /* First frame that may be overwritten */
67016 iFirst = pLive->mxFrame+1;
67088 if( iFirst && (p->pDirty || isCommit==0) ){
67092 if( iWrite>=iFirst ){
75921 int iFirst, /* First cell in pCArray to use */
75929 int i = iFirst; /* Which cell to copy from pCArray*/
76014 int iFirst, /* Index of first cell to add */
76018 int i = iFirst; /* Loop counter - cell index to insert */
76021 int iEnd = iFirst + nCell; /* End of loop. One past last cell to ins */
76025 if( iEnd<=iFirst ) return 0;
76076 int iFirst, /* First cell to delete */
76085 int iEnd = iFirst + nCell;
76089 for(i=iFirst; i<iEnd; i++){
83437 ** The subroutine consists of opcodes between iFirst and iLast. Jumps to
83439 ** that contains the return address. Jumps to outside the range of iFirst
83454 int iFirst, /* First opcode of the subroutine */
83466 assert( iLast>=iFirst );
83468 pOp = &v->aOp[iFirst];
83469 for(i=iFirst; i<=iLast; i++, pOp++){
83482 if( iDest<iFirst || iDest>iLast ){
83500 i, iDest, iFirst, iLast);
83880 int iFirst, /* Index of first register to be released */
83887 assert( iFirst>=1 );
83888 assert( iFirst+N-1<=pParse->nMem );
83892 iFirst++;
83901 sqlite3VdbeAddOp3(pParse->pVdbe, OP_ReleaseReg, iFirst, N, *(int*)&mask);
85066 int iFirst, mx, i;
85071 iFirst = 8;
85075 iFirst = 0;
85078 for(i=iFirst; i<mx; i++){
85079 sqlite3VdbeSetColName(p, i-iFirst, COLNAME_NAME,
107683 int iFirst = pList ? pList->nExpr : 0;
107706 assert( pList->nExpr==iFirst+i+1 );
107713 Expr *pFirst = pList->a[iFirst].pExpr;
112304 ** iFirst..iLast, inclusive. This routine is only call from within assert()
112308 SQLITE_PRIVATE int sqlite3NoTempsInRange(Parse *pParse, int iFirst, int iLast){
112311 && pParse->iRangeReg+pParse->nRangeReg > iFirst
112317 if( pParse->aTempReg[i]>=iFirst && pParse->aTempReg[i]<=iLast ){
190074 sqlite3_int64 iFirst; /* First slot in %_segments written */
192156 pWriter->iFirst = pWriter->iFree;
192289 pWriter->iFirst, pWriter->iFree, &iLast, &zRoot, &nRoot);
192293 pWriter->iFirst, iLastLeaf, iLast, pWriter->nLeafData, zRoot, nRoot);
196185 i64 iFirst = 0;
196187 fts3GetDeltaPosition(&pCsr, &iFirst);
196188 if( iFirst<0 ){
196193 pPhrase->iHead = iFirst;
196194 pPhrase->iTail = iFirst;
224616 int iFirst = -1;
224628 if( iFirst<0 ) iFirst = iOff;
224635 sqlite3_int64 iAdj = iFirst - (nToken - (iLast-iFirst)) / 2;
226685 int iFirst = 0;
226701 if( i-iFirst>=3 ){
226704 for(jj=iFirst; jj<i; jj++){
226716 iFirst = i+1;
227852 ** to parameter iFirst. Or, if iterating in ascending order (bDesc==1),
227854 ** equal to iFirst.
227859 static int sqlite3Fts5ExprFirst(Fts5Expr *p, Fts5Index *pIdx, i64 iFirst, int bDesc){
227867 /* If not at EOF but the current rowid occurs earlier than iFirst in
227868 ** the iteration order, move to document iFirst or later. */
227871 && fts5RowidCmp(p, pRoot->iRowid, iFirst)<0
227873 rc = fts5ExprNodeNext(p, pRoot, 1, iFirst);
230383 u16 iFirst; /* aSeg[] index of firstest iterator */
230773 ** DELETE FROM %_data WHERE id BETWEEN $iFirst AND $iLast
230775 static void fts5DataDelete(Fts5Index *p, i64 iFirst, i64 iLast){
230787 sqlite3_bind_int64(p->pDeleter, 1, iFirst);
230797 i64 iFirst = FTS5_SEGMENT_ROWID(iSegid, 0);
230799 fts5DataDelete(p, iFirst, iLast);
231918 Fts5SegIter *pSeg = &pIter->aSeg[pIter->aFirst[1].iFirst];
232602 assert( pRes->iFirst==i2 );
232604 assert( pRes->iFirst==i1 );
232619 assert( pRes->iFirst==i1 );
232621 assert( pRes->iFirst==i2 );
232635 Fts5SegIter *pFirst = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
232659 Fts5SegIter *p1 = &pIter->aSeg[ pIter->aFirst[i*2].iFirst ];
232660 Fts5SegIter *p2 = &pIter->aSeg[ pIter->aFirst[i*2+1].iFirst ];
232693 i1 = pIter->aFirst[iOut*2].iFirst;
232694 i2 = pIter->aFirst[iOut*2+1].iFirst;
232724 pRes->iFirst = (u16)iRes;
232892 pRes->iFirst = (u16)(pNew - pIter->aSeg);
232895 pOther = &pIter->aSeg[ pIter->aFirst[i ^ 0x0001].iFirst ];
232907 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
232928 int iFirst = pIter->aFirst[1].iFirst;
232930 Fts5SegIter *pSeg = &pIter->aSeg[iFirst];
232939 || fts5MultiIterAdvanceRowid(pIter, iFirst, &pSeg)
232941 fts5MultiIterAdvanced(p, pIter, iFirst, 1);
232943 pSeg = &pIter->aSeg[pIter->aFirst[1].iFirst];
232948 assert( pSeg==&pIter->aSeg[pIter->aFirst[1].iFirst] && pSeg->pLeaf );
232966 int iFirst = pIter->aFirst[1].iFirst;
232967 Fts5SegIter *pSeg = &pIter->aSeg[iFirst];
232973 || fts5MultiIterAdvanceRowid(pIter, iFirst, &pSeg)
232975 fts5MultiIterAdvanced(p, pIter, iFirst, 1);
233539 Fts5SegIter *pSeg = &pNew->aSeg[pNew->aFirst[1].iFirst];
233573 pNew->aFirst[1].iFirst = 1;
233600 || (pIter->aSeg[ pIter->aFirst[1].iFirst ].pLeaf==0)==pIter->base.bEof
233611 assert( pIter->aSeg[ pIter->aFirst[1].iFirst ].pLeaf );
233612 return pIter->aSeg[ pIter->aFirst[1].iFirst ].iRowid;
233638 Fts5SegIter *p = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
233909 i64 iFirst = fts5DlidxExtractFirstRowid(&pDlidx->buf);
233915 sqlite3Fts5BufferAppendVarint(&p->rc, &pDlidx[1].buf, iFirst);
233917 pDlidx[1].iPrev = iFirst;
234359 Fts5SegIter *pSegIter = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
235256 Fts5SegIter *pSeg = &p1->aSeg[ p1->aFirst[1].iFirst ];
235273 Fts5SegIter *pSeg = &p1->aSeg[ p1->aFirst[1].iFirst ];
235622 Fts5SegIter *pSeg = &pRet->aSeg[pRet->aFirst[1].iFirst];
235664 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
236010 ** 1) All leaves of pSeg between iFirst and iLast (inclusive) exist and
236018 int iFirst,
236026 for(i=iFirst; p->rc==SQLITE_OK && i<=iLast; i++){
236294 fts5SegiterPoslist(p, &pIter->aSeg[pIter->aFirst[1].iFirst], 0, &poslist);