Lines Matching refs:iLevel
10944 int iLevel; /* Level of current node or entry */
10945 int mxLevel; /* The largest iLevel value in the tree */
19688 int iLevel; /* Which level of the tree we are on */
31365 p->iLevel++;
31368 if( p->iLevel<(int)sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow;
31377 p->iLevel--;
31378 if( p->iLevel<0 ){
31395 for(i=0; i<p->iLevel && i<(int)sizeof(p->bLine)-1; i++){
135349 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
135350 if( iLevel==0 ) iLevel = 1;
135351 pDb->safety_level = iLevel;
151855 int iLevel, /* Which level of pWInfo->a[] should be coded */
151861 int iLevel,
153192 int iLevel, /* Which level of pWInfo->a[] should be coded */
153196 while( ++iLevel < pWInfo->nLevel ){
153197 WhereLevel *pLevel = &pWInfo->a[iLevel];
153239 ** Generate code for the start of the iLevel-th loop in the WHERE clause
153246 int iLevel, /* Which level of pWInfo->a[] should be coded */
153273 bRev = (pWInfo->revMask>>iLevel)&1;
153274 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
153278 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
153282 if( iLevel==0 ){
153319 for(j=iLevel; j>0; j--){
153482 filterPullDown(pParse, pWInfo, iLevel, addrNxt, notReady);
153740 if( iLevel>0 && (pLoop->wsFlags & WHERE_IN_SEEKSCAN)!=0 ){
153813 filterPullDown(pParse, pWInfo, iLevel, addrNxt, notReady);
154084 nNotReady = pWInfo->nLevel - iLevel - 1;
154595 iLevel);
154600 iLevel, (u64)pLevel->notReady);
154612 int iLevel,
154630 for(k=0; k<iLevel; k++){
157606 int iLevel, /* Index in pWInfo->a[] that is pLevel */
157688 while( ++iLevel < pWInfo->nLevel ){
157690 pLevel = &pWInfo->a[iLevel];
157706 }while( iLevel < pWInfo->nLevel );
182611 int iLevel, /* Level of segments to scan */
182622 /* If iLevel is less than 0 and this is not a scan, include a seg-reader
182628 if( iLevel<0 && p->aIndex && p->iPrevLangid==iLangid ){
182636 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
182638 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
182685 int iLevel, /* Level of segments to scan */
182693 assert( iLevel==FTS3_SEGCURSOR_ALL
182694 || iLevel==FTS3_SEGCURSOR_PENDING
182695 || iLevel>=0
182697 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
182703 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
190456 int iLevel /* Level of segments */
190464 return iBase + iLevel;
190488 int iLevel, /* Level to select (relative level) */
190494 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
190495 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
190498 if( iLevel<0 ){
190511 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
190999 ** This function allocates a new level iLevel index in the segdir table.
191004 ** SELECT max(idx) FROM %_segdir WHERE level = :iLevel
191007 ** level, they are merged into a single level (iLevel+1) segment and the
191017 int iLevel,
191021 sqlite3_stmt *pNextIdx; /* Query for next idx at level iLevel */
191027 /* Set variable iNext to the next available segdir index at level iLevel. */
191031 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
191040 /* If iNext is FTS3_MERGE_COUNT, indicating that level iLevel is already
191041 ** full, merge all segments in level iLevel into a single iLevel+1
191042 ** segment and allocate (newly freed) index 0 at level iLevel. Otherwise,
191046 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
191047 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
191855 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
191867 sqlite3_bind_int64(pStmt, 1, iLevel);
192275 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
192292 rc = fts3WriteSegdir(p, iLevel, iIdx,
192297 rc = fts3WriteSegdir(p, iLevel, iIdx,
192445 ** 2) deletes all %_segdir entries with level iLevel, or all %_segdir
192446 ** entries regardless of level if (iLevel<0).
192454 int iLevel, /* Level of %_segdir entries to delete */
192469 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
192470 if( iLevel==FTS3_SEGCURSOR_ALL ){
192482 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
193096 ** Merge all level iLevel segments in the database into a single
193097 ** iLevel+1 segment. Or, if iLevel<0, merge all segments into a
193101 ** If this function is called with iLevel<0, but there is only one
193110 int iLevel /* Level to merge */
193121 assert( iLevel==FTS3_SEGCURSOR_ALL
193122 || iLevel==FTS3_SEGCURSOR_PENDING
193123 || iLevel>=0
193125 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
193128 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
193131 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
193136 if( iLevel==FTS3_SEGCURSOR_ALL ){
193149 /* This call is to merge all segments at level iLevel. find the next
193150 ** available segment index at level iLevel+1. The call to
193151 ** fts3AllocateSegdirIdx() will merge the segments at level iLevel+1 to
193152 ** a single iLevel+2 segment if necessary. */
193154 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
193155 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
193156 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
193180 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
193182 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
193189 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
201179 ** The id is always a node-id. For iLevel>=1 the id is the node-id of
201180 ** the node that the RtreeSearchPoint represents. When iLevel==0, however,
201187 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
201235 int mxLevel; /* iLevel value for root of the tree */
201240 u32 anQueue[RTREE_MAX_DEPTH+1]; /* Number of queued entries by iLevel */
202157 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
202199 pInfo->iLevel = pSearch->iLevel - 1;
202341 ** If the rScore is a tie, then use iLevel as the tie breaker with smaller
202342 ** iLevel values coming first. In this way, if rScore is the same for all
202343 ** SearchPoints, then iLevel becomes the deciding factor and the result
202352 if( pA->iLevel<pB->iLevel ) return -1;
202353 if( pA->iLevel>pB->iLevel ) return +1;
202407 u8 iLevel /* Level for the new search point */
202421 pNew->iLevel = iLevel;
202422 assert( iLevel<=RTREE_MAX_DEPTH );
202442 u8 iLevel /* Level for the new search point */
202446 pCur->anQueue[iLevel]++;
202449 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
202453 pNew = rtreeEnqueue(pCur, rScore, iLevel);
202467 pCur->sPoint.iLevel = iLevel;
202471 return rtreeEnqueue(pCur, rScore, iLevel);
202480 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
202516 p->anQueue[p->sPoint.iLevel]--;
202519 p->anQueue[p->aPoint[0].iLevel]--;
202568 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
202584 }else if( p->iLevel==1 ){
202597 x.iLevel = p->iLevel - 1;
202598 if( x.iLevel ){
202616 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
233444 ** If iLevel is -ve, then all data in all segments is merged. Or, if iLevel
233445 ** is zero or greater, data from the first nSegment segments on level iLevel
233457 int iLevel, /* Level to iterate (-1 for all) */
233458 int nSegment, /* Number of segments to merge (iLevel>=0) */
233467 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
233471 if( iLevel<0 ){
233476 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
233493 if( iLevel<0 ){
233512 pLvl = &pStruct->aLevel[iLevel];