Lines Matching defs:iLevel
11256 int iLevel; /* Level of current node or entry */
11257 int mxLevel; /* The largest iLevel value in the tree */
20422 int iLevel; /* Which level of the tree we are on */
32618 p->iLevel++;
32621 if( p->iLevel<(int)sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow;
32630 p->iLevel--;
32631 if( p->iLevel<0 ){
32648 for(i=0; i<p->iLevel && i<(int)sizeof(p->bLine)-1; i++){
139848 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
139849 if( iLevel==0 ) iLevel = 1;
139850 pDb->safety_level = iLevel;
157339 int iLevel, /* Which level of pWInfo->a[] should be coded */
157345 int iLevel,
158705 int iLevel, /* Which level of pWInfo->a[] should be coded */
158709 while( ++iLevel < pWInfo->nLevel ){
158710 WhereLevel *pLevel = &pWInfo->a[iLevel];
158773 ** Generate code for the start of the iLevel-th loop in the WHERE clause
158780 int iLevel, /* Which level of pWInfo->a[] should be coded */
158807 bRev = (pWInfo->revMask>>iLevel)&1;
158808 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
158812 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
158818 if( iLevel==0 ){
158855 for(j=iLevel; j>0; j--){
159018 filterPullDown(pParse, pWInfo, iLevel, addrNxt, notReady);
159276 if( iLevel>0 && (pLoop->wsFlags & WHERE_IN_SEEKSCAN)!=0 ){
159349 filterPullDown(pParse, pWInfo, iLevel, addrNxt, notReady);
159613 nNotReady = pWInfo->nLevel - iLevel - 1;
160130 iLevel);
160135 iLevel, (u64)pLevel->notReady);
160147 int iLevel,
160165 for(k=0; k<iLevel; k++){
163310 int iLevel, /* Index in pWInfo->a[] that is pLevel */
163403 while( ++iLevel < pWInfo->nLevel ){
163405 pLevel = &pWInfo->a[iLevel];
163421 }while( iLevel < pWInfo->nLevel );
189121 int iLevel, /* Level of segments to scan */
189132 /* If iLevel is less than 0 and this is not a scan, include a seg-reader
189138 if( iLevel<0 && p->aIndex && p->iPrevLangid==iLangid ){
189146 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
189148 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
189195 int iLevel, /* Level of segments to scan */
189203 assert( iLevel==FTS3_SEGCURSOR_ALL
189204 || iLevel==FTS3_SEGCURSOR_PENDING
189205 || iLevel>=0
189207 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
189213 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
197040 int iLevel /* Level of segments */
197048 return iBase + iLevel;
197072 int iLevel, /* Level to select (relative level) */
197078 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
197079 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
197082 if( iLevel<0 ){
197095 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
197583 ** This function allocates a new level iLevel index in the segdir table.
197588 ** SELECT max(idx) FROM %_segdir WHERE level = :iLevel
197591 ** level, they are merged into a single level (iLevel+1) segment and the
197601 int iLevel,
197605 sqlite3_stmt *pNextIdx; /* Query for next idx at level iLevel */
197611 /* Set variable iNext to the next available segdir index at level iLevel. */
197615 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
197624 /* If iNext is FTS3_MERGE_COUNT, indicating that level iLevel is already
197625 ** full, merge all segments in level iLevel into a single iLevel+1
197626 ** segment and allocate (newly freed) index 0 at level iLevel. Otherwise,
197630 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
197631 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
198439 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
198451 sqlite3_bind_int64(pStmt, 1, iLevel);
198859 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
198876 rc = fts3WriteSegdir(p, iLevel, iIdx,
198881 rc = fts3WriteSegdir(p, iLevel, iIdx,
199029 ** 2) deletes all %_segdir entries with level iLevel, or all %_segdir
199030 ** entries regardless of level if (iLevel<0).
199038 int iLevel, /* Level of %_segdir entries to delete */
199053 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
199054 if( iLevel==FTS3_SEGCURSOR_ALL ){
199066 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
199682 ** Merge all level iLevel segments in the database into a single
199683 ** iLevel+1 segment. Or, if iLevel<0, merge all segments into a
199687 ** If this function is called with iLevel<0, but there is only one
199696 int iLevel /* Level to merge */
199707 assert( iLevel==FTS3_SEGCURSOR_ALL
199708 || iLevel==FTS3_SEGCURSOR_PENDING
199709 || iLevel>=0
199711 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
199714 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
199717 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
199722 if( iLevel==FTS3_SEGCURSOR_ALL ){
199735 /* This call is to merge all segments at level iLevel. find the next
199736 ** available segment index at level iLevel+1. The call to
199737 ** fts3AllocateSegdirIdx() will merge the segments at level iLevel+1 to
199738 ** a single iLevel+2 segment if necessary. */
199740 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
199741 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
199742 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
199766 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
199768 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
199775 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
210551 ** The id is always a node-id. For iLevel>=1 the id is the node-id of
210552 ** the node that the RtreeSearchPoint represents. When iLevel==0, however,
210559 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
210607 int mxLevel; /* iLevel value for root of the tree */
210612 u32 anQueue[RTREE_MAX_DEPTH+1]; /* Number of queued entries by iLevel */
211534 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
211576 pInfo->iLevel = pSearch->iLevel - 1;
211718 ** If the rScore is a tie, then use iLevel as the tie breaker with smaller
211719 ** iLevel values coming first. In this way, if rScore is the same for all
211720 ** SearchPoints, then iLevel becomes the deciding factor and the result
211729 if( pA->iLevel<pB->iLevel ) return -1;
211730 if( pA->iLevel>pB->iLevel ) return +1;
211784 u8 iLevel /* Level for the new search point */
211798 pNew->iLevel = iLevel;
211799 assert( iLevel<=RTREE_MAX_DEPTH );
211819 u8 iLevel /* Level for the new search point */
211823 pCur->anQueue[iLevel]++;
211826 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
211830 pNew = rtreeEnqueue(pCur, rScore, iLevel);
211844 pCur->sPoint.iLevel = iLevel;
211848 return rtreeEnqueue(pCur, rScore, iLevel);
211857 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
211893 p->anQueue[p->sPoint.iLevel]--;
211896 p->anQueue[p->aPoint[0].iLevel]--;
211945 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
211961 }else if( p->iLevel==1 ){
211974 x.iLevel = p->iLevel - 1;
211975 if( x.iLevel ){
211993 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
244395 ** If iLevel is -ve, then all data in all segments is merged. Or, if iLevel
244396 ** is zero or greater, data from the first nSegment segments on level iLevel
244408 int iLevel, /* Level to iterate (-1 for all) */
244409 int nSegment, /* Number of segments to merge (iLevel>=0) */
244418 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
244422 if( iLevel<0 ){
244427 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
244444 if( iLevel<0 ){
244463 pLvl = &pStruct->aLevel[iLevel];
249305 int iLevel;
249406 while( pCsr->iLevel<p->nLevel && pCsr->iSeg>=p->aLevel[pCsr->iLevel].nSeg ){
249407 pCsr->iLevel++;
249410 if( pCsr->iLevel>=p->nLevel ){
249446 Fts5StructureSegment *pSeg = &p->aLevel[pCsr->iLevel].aSeg[pCsr->iSeg];
249450 sqlite3_result_int(ctx, pCsr->iLevel);
249456 sqlite3_result_int(ctx, pCsr->iSeg < p->aLevel[pCsr->iLevel].nMerge);
249511 pCsr->iLevel = 0;