Lines Matching defs:iFirst
61005 int iFirst, /* Index of first cell to add */
61012 int iEnd = iFirst + nCell;
61014 for(i=iFirst; i<iEnd; i++){
61048 int iFirst, /* First cell to delete */
61057 int iEnd = iFirst + nCell;
61061 for(i=iFirst; i<iEnd; i++){
63398 int iFirst = iPage;
63405 N+1, expected, iFirst);
108413 int iFirst, mx;
108416 iFirst = 8;
108420 iFirst = 0;
108423 for(i=iFirst; i<mx; i++){
108424 sqlite3VdbeSetColName(pParse->pVdbe, i-iFirst, COLNAME_NAME,
146104 sqlite3_int64 iFirst; /* First slot in %_segments written */
148151 pWriter->iFirst = pWriter->iFree;
148275 pWriter->iFirst, pWriter->iFree, &iLast, &zRoot, &nRoot);
148279 pWriter->iFirst, iLastLeaf, iLast, pWriter->nLeafData, zRoot, nRoot);
152071 int iFirst = 0;
152073 fts3GetDeltaPosition(&pCsr, &iFirst);
152074 assert( iFirst>=0 );
152077 pPhrase->iHead = iFirst;
152078 pPhrase->iTail = iFirst;
171061 ** to parameter iFirst. Or, if iterating in ascending order (bDesc==1),
171063 ** equal to iFirst.
171068 iFirst, int bDesc){
171076 /* If not at EOF but the current rowid occurs earlier than iFirst in
171077 ** the iteration order, move to document iFirst or later. */
171078 if( pRoot->bEof==0 && fts5RowidCmp(p, pRoot->iRowid, iFirst)<0 ){
171079 rc = fts5ExprNodeNext(p, pRoot, 1, iFirst);
172902 u16 iFirst; /* aSeg[] index of firstest iterator */
173260 ** DELETE FROM %_data WHERE id BETWEEN $iFirst AND $iLast
173262 static void fts5DataDelete(Fts5Index *p, i64 iFirst, i64 iLast){
173284 sqlite3_bind_int64(p->pDeleter, 1, iFirst);
173294 i64 iFirst = FTS5_SEGMENT_ROWID(iSegid, 0);
173296 fts5DataDelete(p, iFirst, iLast);
174202 Fts5SegIter *pSeg = &pIter->aSeg[pIter->aFirst[1].iFirst];
174750 assert( pRes->iFirst==i2 );
174752 assert( pRes->iFirst==i1 );
174767 assert( pRes->iFirst==i1 );
174769 assert( pRes->iFirst==i2 );
174783 Fts5SegIter *pFirst = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
174807 Fts5SegIter *p1 = &pIter->aSeg[ pIter->aFirst[i*2].iFirst ];
174808 Fts5SegIter *p2 = &pIter->aSeg[ pIter->aFirst[i*2+1].iFirst ];
174841 i1 = pIter->aFirst[iOut*2].iFirst;
174842 i2 = pIter->aFirst[iOut*2+1].iFirst;
174872 pRes->iFirst = iRes;
175039 pRes->iFirst = (pNew - pIter->aSeg);
175042 pOther = &pIter->aSeg[ pIter->aFirst[i ^ 0x0001].iFirst ];
175053 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
175074 int iFirst = pIter->aFirst[1].iFirst;
175076 Fts5SegIter *pSeg = &pIter->aSeg[iFirst];
175085 || fts5MultiIterAdvanceRowid(p, pIter, iFirst)
175087 fts5MultiIterAdvanced(p, pIter, iFirst, 1);
175238 pNew->aFirst[1].iFirst = 1;
175263 || (pIter->aSeg[ pIter->aFirst[1].iFirst ].pLeaf==0)==pIter->bEof
175274 assert( pIter->aSeg[ pIter->aFirst[1].iFirst ].pLeaf );
175275 return pIter->aSeg[ pIter->aFirst[1].iFirst ].iRowid;
175301 Fts5SegIter *p = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
175581 i64 iFirst = fts5DlidxExtractFirstRowid(&pDlidx->buf);
175587 sqlite3Fts5BufferAppendVarint(&p->rc, &pDlidx[1].buf, iFirst);
175589 pDlidx[1].iPrev = iFirst;
176012 Fts5SegIter *pSegIter = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
176607 Fts5SegIter *pSeg = &pMulti->aSeg[ pMulti->aFirst[1].iFirst ];
177177 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
177251 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
177284 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
177564 ** 1) All leaves of pSeg between iFirst and iLast (inclusive) exist and
177572 int iFirst,
177580 for(i=iFirst; p->rc==SQLITE_OK && i<=iLast; i++){
177836 fts5SegiterPoslist(p, &pIter->aSeg[pIter->aFirst[1].iFirst] , 0, &poslist);
