Lines Matching defs:iFirst
60987 int iFirst, /* Index of first cell to add */
60994 int iEnd = iFirst + nCell;
60996 for(i=iFirst; i<iEnd; i++){
61030 int iFirst, /* First cell to delete */
61039 int iEnd = iFirst + nCell;
61043 for(i=iFirst; i<iEnd; i++){
63380 int iFirst = iPage;
63387 N+1, expected, iFirst);
108395 int iFirst, mx;
108398 iFirst = 8;
108402 iFirst = 0;
108405 for(i=iFirst; i<mx; i++){
108406 sqlite3VdbeSetColName(pParse->pVdbe, i-iFirst, COLNAME_NAME,
146074 sqlite3_int64 iFirst; /* First slot in %_segments written */
148121 pWriter->iFirst = pWriter->iFree;
148245 pWriter->iFirst, pWriter->iFree, &iLast, &zRoot, &nRoot);
148249 pWriter->iFirst, iLastLeaf, iLast, pWriter->nLeafData, zRoot, nRoot);
152041 int iFirst = 0;
152043 fts3GetDeltaPosition(&pCsr, &iFirst);
152044 assert( iFirst>=0 );
152047 pPhrase->iHead = iFirst;
152048 pPhrase->iTail = iFirst;
171031 ** to parameter iFirst. Or, if iterating in ascending order (bDesc==1),
171033 ** equal to iFirst.
171038 static int sqlite3Fts5ExprFirst(Fts5Expr *p, Fts5Index *pIdx, i64 iFirst, int bDesc){
171046 /* If not at EOF but the current rowid occurs earlier than iFirst in
171047 ** the iteration order, move to document iFirst or later. */
171048 if( pRoot->bEof==0 && fts5RowidCmp(p, pRoot->iRowid, iFirst)<0 ){
171049 rc = fts5ExprNodeNext(p, pRoot, 1, iFirst);
172872 u16 iFirst; /* aSeg[] index of firstest iterator */
173230 ** DELETE FROM %_data WHERE id BETWEEN $iFirst AND $iLast
173232 static void fts5DataDelete(Fts5Index *p, i64 iFirst, i64 iLast){
173254 sqlite3_bind_int64(p->pDeleter, 1, iFirst);
173264 i64 iFirst = FTS5_SEGMENT_ROWID(iSegid, 0);
173266 fts5DataDelete(p, iFirst, iLast);
174172 Fts5SegIter *pSeg = &pIter->aSeg[pIter->aFirst[1].iFirst];
174720 assert( pRes->iFirst==i2 );
174722 assert( pRes->iFirst==i1 );
174737 assert( pRes->iFirst==i1 );
174739 assert( pRes->iFirst==i2 );
174753 Fts5SegIter *pFirst = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
174777 Fts5SegIter *p1 = &pIter->aSeg[ pIter->aFirst[i*2].iFirst ];
174778 Fts5SegIter *p2 = &pIter->aSeg[ pIter->aFirst[i*2+1].iFirst ];
174811 i1 = pIter->aFirst[iOut*2].iFirst;
174812 i2 = pIter->aFirst[iOut*2+1].iFirst;
174842 pRes->iFirst = iRes;
175009 pRes->iFirst = (pNew - pIter->aSeg);
175012 pOther = &pIter->aSeg[ pIter->aFirst[i ^ 0x0001].iFirst ];
175023 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
175044 int iFirst = pIter->aFirst[1].iFirst;
175046 Fts5SegIter *pSeg = &pIter->aSeg[iFirst];
175055 || fts5MultiIterAdvanceRowid(p, pIter, iFirst)
175057 fts5MultiIterAdvanced(p, pIter, iFirst, 1);
175208 pNew->aFirst[1].iFirst = 1;
175233 || (pIter->aSeg[ pIter->aFirst[1].iFirst ].pLeaf==0)==pIter->bEof
175244 assert( pIter->aSeg[ pIter->aFirst[1].iFirst ].pLeaf );
175245 return pIter->aSeg[ pIter->aFirst[1].iFirst ].iRowid;
175271 Fts5SegIter *p = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
175551 i64 iFirst = fts5DlidxExtractFirstRowid(&pDlidx->buf);
175557 sqlite3Fts5BufferAppendVarint(&p->rc, &pDlidx[1].buf, iFirst);
175559 pDlidx[1].iPrev = iFirst;
175982 Fts5SegIter *pSegIter = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
176577 Fts5SegIter *pSeg = &pMulti->aSeg[ pMulti->aFirst[1].iFirst ];
177147 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
177221 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
177254 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
177534 ** 1) All leaves of pSeg between iFirst and iLast (inclusive) exist and
177542 int iFirst,
177550 for(i=iFirst; p->rc==SQLITE_OK && i<=iLast; i++){
177806 fts5SegiterPoslist(p, &pIter->aSeg[pIter->aFirst[1].iFirst] , 0, &poslist);
