Lines Matching refs:iLast
57189 u32 iLast; /* Last frame in log */
57199 iLast = pWal->hdr.mxFrame;
57202 nSegment = walFramePage(iLast) + 1;
57205 + iLast*sizeof(ht_slot);
57217 sizeof(ht_slot) * (iLast>HASHTABLE_NPAGE?HASHTABLE_NPAGE:iLast)
57236 nEntry = (int)(iLast - iZero);
58428 u32 iLast = pWal->hdr.mxFrame; /* Last page in WAL for this reader */
58441 if( iLast==0 || (pWal->readLock==0 && pWal->bShmUnreliable==0) ){
58467 ** (iFrame<=iLast):
58472 for(iHash=walFramePage(iLast); iHash>=iMinHash && iRead==0; iHash--){
58487 if( iFrame<=iLast && iFrame>=pWal->minFrame && aPgno[aHash[iKey]]==pgno ){
58505 for(iTest=iLast; iTest>=pWal->minFrame && iTest>0; iTest--){
58834 static int walRewriteChecksums(Wal *pWal, u32 iLast){
58862 for(; rc==SQLITE_OK && iRead<=iLast; iRead++){
97997 ** iFirst..iLast, inclusive. This routine is only call from within assert()
98001 SQLITE_PRIVATE int sqlite3NoTempsInRange(Parse *pParse, int iFirst, int iLast){
98005 && pParse->iRangeReg <= iLast
98010 if( pParse->aTempReg[i]>=iFirst && pParse->aTempReg[i]<=iLast ){
161243 sqlite3_int64 iLast = 0; /* Largest block id written to database */
161252 pWriter->iFirst, pWriter->iFree, &iLast, &zRoot, &nRoot);
161256 pWriter->iFirst, iLastLeaf, iLast, pWriter->nLeafData, zRoot, nRoot);
161966 i64 iLast = (iAbsLevel/FTS3_SEGDIR_MAXLEVEL + 1) * FTS3_SEGDIR_MAXLEVEL - 1;
161975 sqlite3_bind_int64(pRange, 2, iLast);
189143 int iLast = 0;
189152 iLast = iOff + pApi->xPhraseSize(pFts, ip);
189158 int iAdj = iFirst - (nToken - (iLast-iFirst)) / 2;
191544 i64 iLast = *piLast;
191548 if( (bDesc==0 && iLast>iRowid) || (bDesc && iLast<iRowid) ){
191549 int rc = sqlite3Fts5IterNextFrom(pIter, iLast);
191556 assert( (bDesc==0 && iRowid>=iLast) || (bDesc==1 && iRowid<=iLast) );
191570 i64 iLast = *piLast;
191577 if( (bDesc==0 && iLast>iRowid) || (bDesc && iLast<iRowid) ){
191578 rc = sqlite3Fts5IterNextFrom(p->pIter, iLast);
191796 i64 iLast; /* Lastest rowid any iterator points to */
191808 /* Initialize iLast, the "lastest" rowid any iterator points to. If the
191813 iLast = fts5ExprSynonymRowid(&pLeft->aTerm[0], bDesc, 0);
191815 iLast = pLeft->aTerm[0].pIter->iRowid;
191826 if( iRowid==iLast ) continue;
191828 if( fts5ExprSynonymAdvanceto(pTerm, bDesc, &iLast, &rc) ){
191835 if( pIter->iRowid==iLast || pIter->bEof ) continue;
191837 if( fts5ExprAdvanceto(pIter, bDesc, &iLast, &rc, &pNode->bEof) ){
191845 pNode->iRowid = iLast;
192002 i64 iLast = pNode->iRowid;
192006 assert( p1->bEof || fts5RowidCmp(pExpr, p1->iRowid, iLast)>=0 );
192008 if( (p1->iRowid==iLast)
192032 i64 iLast = pAnd->iRowid;
192042 int cmp = fts5RowidCmp(pExpr, iLast, pChild->iRowid);
192044 /* Advance pChild until it points to iLast or laster */
192045 rc = fts5ExprNodeNext(pExpr, pChild, 1, iLast);
192054 ** rowid iLast. So if it is not at exactly iLast, pChild->iRowid is the
192056 assert( pChild->bEof || fts5RowidCmp(pExpr, iLast, pChild->iRowid)<=0 );
192061 }else if( iLast!=pChild->iRowid ){
192063 iLast = pChild->iRowid;
192075 pAnd->iRowid = iLast;
192278 static int sqlite3Fts5ExprNext(Fts5Expr *p, i64 iLast){
192286 if( fts5RowidCmp(p, pRoot->iRowid, iLast)>0 ){
195025 ** DELETE FROM %_data WHERE id BETWEEN $iFirst AND $iLast
195027 static void fts5DataDelete(Fts5Index *p, i64 iFirst, i64 iLast){
195051 sqlite3_bind_int64(p->pDeleter, 2, iLast);
195061 i64 iLast = FTS5_SEGMENT_ROWID(iSegid+1, 0)-1;
195062 fts5DataDelete(p, iFirst, iLast);
199995 ** 1) All leaves of pSeg between iFirst and iLast (inclusive) exist and
199997 ** 2) All leaves of pSeg between iNoRowid and iLast (inclusive) exist and
200005 int iLast
200011 for(i=iFirst; p->rc==SQLITE_OK && i<=iLast; i++){
