Lines Matching defs:bEof
100177 int bEof; /* Set to true when merge is finished */
100414 assert( pReadr->pIncr==0 || pReadr->pIncr->bEof==0 );
100460 int bEof = 1;
100463 if( rc==SQLITE_OK && pIncr->bEof==0 ){
100467 bEof = 0;
100471 if( bEof ){
101663 assert( pIncr->bEof==0 );
101746 pIncr->bEof = 1;
101757 pIncr->bEof = 1;
179742 u8 bEof; /* True this expression is at EOF already */
184337 u8 bEof = 0;
184347 if( pDL->pList==0 ) bEof = 1;
184356 while( bEof==0 ){
184362 for(i=0; rc==SQLITE_OK && i<p->nToken && bEof==0; i++){
184363 rc = incrPhraseTokenNext(pTab, p, i, &a[i], &bEof);
184374 while( rc==SQLITE_OK && bEof==0
184377 rc = incrPhraseTokenNext(pTab, p, i, &a[i], &bEof);
184386 if( bEof==0 ){
184417 *pbEof = bEof;
184766 ** if( pCsr->bEof ) break;
184895 ** Fts3Expr.bEof (non-zero if EOF - there is no next row)
184896 ** Fts3Expr.iDocid (valid if bEof==0. The docid of the next row)
184933 assert( pExpr->bEof==0 );
184948 pExpr->bEof = pRight->bEof;
184954 pExpr->bEof = pLeft->bEof;
184959 while( !pLeft->bEof && !pRight->bEof && *pRc==SQLITE_OK ){
184969 pExpr->bEof = (pLeft->bEof || pRight->bEof);
184970 if( pExpr->eType==FTSQUERY_NEAR && pExpr->bEof ){
184974 while( *pRc==SQLITE_OK && pRight->bEof==0 ){
184981 while( *pRc==SQLITE_OK && pLeft->bEof==0 ){
184986 pRight->bEof = pLeft->bEof = 1;
185000 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
185002 }else if( pLeft->bEof || iCmp>0 ){
185009 pExpr->bEof = (pLeft->bEof && pRight->bEof);
185011 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
185030 if( pLeft->bEof==0 ){
185032 && !pRight->bEof
185039 pExpr->bEof = pLeft->bEof;
185046 *pRc = fts3EvalPhraseNext(pCsr, pPhrase, &pExpr->bEof);
185229 pExpr->bEof==0 && pExpr->iDocid==pCsr->iPrevId
185307 pCsr->isEof = pExpr->bEof;
185362 pExpr->bEof = 0;
185434 u8 bEof;
185442 bEof = pRoot->bEof;
185465 pCsr->isEof = pRoot->bEof;
185482 if( bEof ){
185483 pRoot->bEof = bEof;
185494 assert_fts3_nc( pRoot->bEof==0 );
185495 if( pRoot->bEof ) rc = FTS_CORRUPT_VTAB;
185602 if( iDocid!=pCsr->iPrevId || pExpr->bEof ){
185620 if( p->bEof ) bTreeEof = 1;
185628 int bEofSave = pNear->bEof;
185630 while( rc==SQLITE_OK && !pNear->bEof ){
185635 if( rc==SQLITE_OK && pNear->bEof!=bEofSave ){
185640 while( rc==SQLITE_OK && !pNear->bEof ){
185648 u8 bEof = 0;
185659 bEof = !pPh->doclist.nAll ||
185661 while( (pIter==0 || DOCID_CMP(iDocid, pCsr->iPrevId)<0 ) && bEof==0 ){
185664 &pIter, &iDocid, &bEof
185668 bEof = !pPh->doclist.nAll || (pIter && pIter<=pPh->doclist.aAll);
185669 while( (pIter==0 || DOCID_CMP(iDocid, pCsr->iPrevId)>0 ) && bEof==0 ){
185673 &pIter, &iDocid, &dummy, &bEof
185679 if( bEof || iDocid!=pCsr->iPrevId ) bMatch = 0;
191333 u8 bEof = 0;
191338 &pReader->iDocid, &pReader->nOffsetList, &bEof
191376 u8 bEof = 0;
191383 &pReader->nOffsetList, &bEof
191385 if( bEof ){
196612 if( pExpr->bEof==0 && pExpr->iDocid==p->pCursor->iPrevId ){
215600 int bEof; /* Set to true after xInput finished */
218353 pRet->in.bEof = (xInput ? 0 : 1);
218429 while( !pIn->bEof && (pIn->iNext+nByte)>=pIn->nData && rc==SQLITE_OK ){
218436 pIn->bEof = 1;
222245 u8 bEof; /* Set to true at EOF */
222297 u8 bEof;
222300 #define sqlite3Fts5IterEof(x) ((x)->bEof)
225208 pIter->bEof = 1;
225210 return pIter->bEof;
225221 return pIter->bEof;
226435 int bEof; /* True at EOF */
226643 pNew->pRoot->bEof = 1;
226860 assert( aIter[nIter].bEof==0 );
226876 if( aIter[i].bEof==0 ){
226955 if( aIter[i].bEof ) goto ismatch_out;
227184 int bEof = 0;
227197 bEof = 1;
227199 *piLast = fts5ExprSynonymRowid(pTerm, bDesc, &bEof);
227201 return bEof;
227275 pNode->bEof = 1;
227305 pNode->bEof = 1;
227312 pNode->bEof = 0;
227343 pNode->bEof = 1;
227385 if( p2->bEof ) return -1;
227386 if( p1->bEof ) return +1;
227442 pNode->bEof = 1;
227447 if( pIter->iRowid==iLast || pIter->bEof ) continue;
227449 if( fts5ExprAdvanceto(pIter, bDesc, &iLast, &rc, &pNode->bEof) ){
227459 assert( pNode->bEof==0 || pNode->bNomatch==0 );
227482 int bEof = 1;
227503 bEof = 0;
227506 bEof = 0;
227513 pNode->bEof = (rc || bEof);
227524 pNode->bEof = (rc || sqlite3Fts5IterEof(pIter));
227527 if( pNode->bEof==0 ){
227573 assert( pNode->bEof==0 );
227582 pNode->bEof = 1;
227603 pNode->bEof = pNext->bEof;
227618 assert( p1->bEof || fts5RowidCmp(pExpr, p1->iRowid, iLast)>=0 );
227619 if( p1->bEof==0 ){
227648 assert( pAnd->bEof==0 );
227668 assert( pChild->bEof || fts5RowidCmp(pExpr, iLast, pChild->iRowid)<=0 );
227669 if( pChild->bEof ){
227715 while( rc==SQLITE_OK && p1->bEof==0 ){
227725 pNode->bEof = p1->bEof;
227728 if( p1->bEof ){
227760 if( pNode->bEof==0 ){
227795 ** match. If there are no matches, set the Node.bEof flag to indicate EOF.
227802 pNode->bEof = 0;
227809 pNode->bEof = 1;
227816 assert( pChild->bEof==0 || pChild->bEof==1 );
227817 nEof += pChild->bEof;
227832 pNode->bEof = pNode->apChild[0]->bEof;
227870 && 0==pRoot->bEof
227878 assert( pRoot->bEof==0 );
227893 assert( pRoot->bEof==0 && pRoot->bNomatch==0 );
227896 assert( pRoot->bNomatch==0 || (rc==SQLITE_OK && pRoot->bEof==0) );
227899 pRoot->bEof = 1;
227905 return p->pRoot->bEof;
229218 if( pNode->bEof==0 && pNode->iRowid==pExpr->pRoot->iRowid ){
229254 (pBuf->n==0 || pNode->iRowid!=pExpr->pRoot->iRowid || pNode->bEof)
229361 pNode->bEof = 0;
229423 if( pNode->bEof==0
230538 ** bEof:
230547 int bEof; /* At EOF already */
231342 assert( pLvl->bEof==0 );
231360 pLvl->bEof = 1;
231364 return pLvl->bEof;
231377 if( pLvl[1].bEof==0 ){
231388 return pIter->aLvl[0].bEof;
231410 return pIter->aLvl[0].bEof;
231415 return p->rc!=SQLITE_OK || pIter->aLvl[0].bEof;
231425 pLvl->bEof = 0;
231444 assert( pLvl->bEof==0 );
231446 pLvl->bEof = 1;
231487 return pLvl->bEof;
231497 if( pLvl[1].bEof==0 ){
231505 pLvl->bEof = 0;
231511 return pIter->aLvl[0].bEof;
232638 assert( (pFirst->pLeaf==0)==pIter->base.bEof );
232904 ** Set the pIter->bEof variable based on the state of the sub-iterators.
232908 pIter->base.bEof = pSeg->pLeaf==0;
232926 assert( pIter->base.bEof==0 );
233538 }else if( pNew->base.bEof==0 ){
233583 pNew->base.bEof = 1;
233600 || (pIter->aSeg[ pIter->aFirst[1].iFirst ].pLeaf==0)==pIter->base.bEof
233602 return (p->rc || pIter->base.bEof);
235668 pIter->base.bEof = 1;
235880 sReader.bEof==0;
236587 for(fts5DlidxLvlNext(&lvl); lvl.bEof==0; fts5DlidxLvlNext(&lvl)){
238771 if( (aIter[i].bEof==0)
243525 int bEof; /* True if this cursor is at EOF */
243867 pCsr->bEof = 0;
243887 pCsr->bEof = 1;
243896 pCsr->bEof = 1;
243913 assert( pCsr->bEof==0 );
243923 if( pCsr->bEof || eDetail==FTS5_DETAIL_NONE ) break;
243926 pCsr->bEof = 1;
243959 pCsr->bEof = 1;
243970 pCsr->bEof = 1;
244053 if( rc==SQLITE_OK && pCsr->bEof==0 && pTab->eType==FTS5_VOCAB_COL ){
244125 if( rc==SQLITE_OK && !pCsr->bEof
244141 return pCsr->bEof;