Lines Matching refs:iLast
57205 u32 iLast; /* Last frame in log */
57215 iLast = pWal->hdr.mxFrame;
57218 nSegment = walFramePage(iLast) + 1;
57221 + iLast*sizeof(ht_slot);
57233 sizeof(ht_slot) * (iLast>HASHTABLE_NPAGE?HASHTABLE_NPAGE:iLast)
57252 nEntry = (int)(iLast - iZero);
58444 u32 iLast = pWal->hdr.mxFrame; /* Last page in WAL for this reader */
58457 if( iLast==0 || (pWal->readLock==0 && pWal->bShmUnreliable==0) ){
58483 ** (iFrame<=iLast):
58488 for(iHash=walFramePage(iLast); iHash>=iMinHash && iRead==0; iHash--){
58503 if( iFrame<=iLast && iFrame>=pWal->minFrame && aPgno[aHash[iKey]]==pgno ){
58521 for(iTest=iLast; iTest>=pWal->minFrame && iTest>0; iTest--){
58850 static int walRewriteChecksums(Wal *pWal, u32 iLast){
58878 for(; rc==SQLITE_OK && iRead<=iLast; iRead++){
98013 ** iFirst..iLast, inclusive. This routine is only call from within assert()
98017 SQLITE_PRIVATE int sqlite3NoTempsInRange(Parse *pParse, int iFirst, int iLast){
98021 && pParse->iRangeReg <= iLast
98026 if( pParse->aTempReg[i]>=iFirst && pParse->aTempReg[i]<=iLast ){
161271 sqlite3_int64 iLast = 0; /* Largest block id written to database */
161280 pWriter->iFirst, pWriter->iFree, &iLast, &zRoot, &nRoot);
161284 pWriter->iFirst, iLastLeaf, iLast, pWriter->nLeafData, zRoot, nRoot);
161994 i64 iLast = (iAbsLevel/FTS3_SEGDIR_MAXLEVEL + 1) * FTS3_SEGDIR_MAXLEVEL - 1;
162003 sqlite3_bind_int64(pRange, 2, iLast);
189171 int iLast = 0;
189180 iLast = iOff + pApi->xPhraseSize(pFts, ip);
189186 int iAdj = iFirst - (nToken - (iLast-iFirst)) / 2;
191572 i64 iLast = *piLast;
191576 if( (bDesc==0 && iLast>iRowid) || (bDesc && iLast<iRowid) ){
191577 int rc = sqlite3Fts5IterNextFrom(pIter, iLast);
191584 assert( (bDesc==0 && iRowid>=iLast) || (bDesc==1 && iRowid<=iLast) );
191598 i64 iLast = *piLast;
191605 if( (bDesc==0 && iLast>iRowid) || (bDesc && iLast<iRowid) ){
191606 rc = sqlite3Fts5IterNextFrom(p->pIter, iLast);
191824 i64 iLast; /* Lastest rowid any iterator points to */
191836 /* Initialize iLast, the "lastest" rowid any iterator points to. If the
191841 iLast = fts5ExprSynonymRowid(&pLeft->aTerm[0], bDesc, 0);
191843 iLast = pLeft->aTerm[0].pIter->iRowid;
191854 if( iRowid==iLast ) continue;
191856 if( fts5ExprSynonymAdvanceto(pTerm, bDesc, &iLast, &rc) ){
191863 if( pIter->iRowid==iLast || pIter->bEof ) continue;
191865 if( fts5ExprAdvanceto(pIter, bDesc, &iLast, &rc, &pNode->bEof) ){
191873 pNode->iRowid = iLast;
192030 i64 iLast = pNode->iRowid;
192034 assert( p1->bEof || fts5RowidCmp(pExpr, p1->iRowid, iLast)>=0 );
192036 if( (p1->iRowid==iLast)
192060 i64 iLast = pAnd->iRowid;
192070 int cmp = fts5RowidCmp(pExpr, iLast, pChild->iRowid);
192072 /* Advance pChild until it points to iLast or laster */
192073 rc = fts5ExprNodeNext(pExpr, pChild, 1, iLast);
192082 ** rowid iLast. So if it is not at exactly iLast, pChild->iRowid is the
192084 assert( pChild->bEof || fts5RowidCmp(pExpr, iLast, pChild->iRowid)<=0 );
192089 }else if( iLast!=pChild->iRowid ){
192091 iLast = pChild->iRowid;
192103 pAnd->iRowid = iLast;
192306 static int sqlite3Fts5ExprNext(Fts5Expr *p, i64 iLast){
192314 if( fts5RowidCmp(p, pRoot->iRowid, iLast)>0 ){
195053 iLast
195055 static void fts5DataDelete(Fts5Index *p, i64 iFirst, i64 iLast){
195079 sqlite3_bind_int64(p->pDeleter, 2, iLast);
195089 i64 iLast = FTS5_SEGMENT_ROWID(iSegid+1, 0)-1;
195090 fts5DataDelete(p, iFirst, iLast);
200023 ** 1) All leaves of pSeg between iFirst and iLast (inclusive) exist and
200025 ** 2) All leaves of pSeg between iNoRowid and iLast (inclusive) exist and
200033 int iLast
200039 for(i=iFirst; p->rc==SQLITE_OK && i<=iLast; i++){
