lib/sqlite/sqlite3.c

70964 SQLITE_PRIVATE int sqlite3VdbeSorterRewind(sqlite3 *db, VdbeCursor *pCsr, int *pbEof){
70979     *pbEof = !pSorter->pRecord;
71065   *pbEof = (pSorter->aIter[pSorter->aTree[1]].pFile==0);
71072 SQLITE_PRIVATE int sqlite3VdbeSorterNext(sqlite3 *db, VdbeCursor *pCsr, int *pbEof){
71085     *pbEof = (pSorter->aIter[pSorter->aTree[1]].pFile==0);
71091     *pbEof = !pSorter->pRecord;
117810   u8 *pbEof                       /* OUT: End-of-file flag */
117815   assert( *pbEof==0 );
117846       *pbEof = 1;
117861 ** If there is no "next" entry and no error occurs, then *pbEof is set to
117863 ** successfully advanced, *pbEof is set to 0.
117868   u8 *pbEof                       /* OUT: Set to 1 if EOF */
117881       *pbEof = 1;
117885         &pDL->pNextDocid, &pDL->iDocid, &pDL->nList, pbEof
117899       *pbEof = 1;
117922       *pbEof = 0;
127914 ** Set *pbEof to true if the sub-tree headed by the cell is filtered
127921 static int testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof){
127959   *pbEof = bRes;
127966 ** pCursor->aConstraint[] array. If so, set *pbEof to true before
127968 ** set pbEof to zero.
127975 static int testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof){
127978   *pbEof = 0;
128006       *pbEof = 1;