Lines Matching refs:iLevel
9926 int iLevel; /* Level of current node or entry */
9927 int mxLevel; /* The largest iLevel value in the tree */
16864 int iCacheLevel; /* ColCache valid when aColCache[].iLevel<=iCacheLevel */
16905 int iLevel; /* Nesting level */
17289 int iLevel; /* Which level of the tree we are on */
27011 p->iLevel++;
27014 if( p->iLevel<sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow;
27023 p->iLevel--;
27024 if( p->iLevel<0 ) sqlite3_free(p);
27038 for(i=0; i<p->iLevel && i<sizeof(p->bLine)-1; i++){
95879 p->iLevel = pParse->iCacheLevel;
95932 if( pParse->aColCache[i].iLevel>pParse->iCacheLevel ){
116316 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
116317 if( iLevel==0 ) iLevel = 1;
116318 pDb->safety_level = iLevel;
129097 int iLevel, /* Value for "level" column of output */
129116 int iLevel, /* Which level of pWInfo->a[] should be coded */
129293 int iLevel, /* Value for "level" column of output */
129385 ret = sqlite3VdbeAddOp4(v, OP_Explain, iId, iLevel, iFrom, zMsg,P4_DYNAMIC);
130326 ** Generate code for the start of the iLevel-th loop in the WHERE clause
130331 int iLevel, /* Which level of pWInfo->a[] should be coded */
130359 pLevel = &pWInfo->a[iLevel];
130364 bRev = (pWInfo->revMask>>iLevel)&1;
130367 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
130394 for(j=iLevel; j>0 && pWInfo->a[j].iLeftJoin==0; j--){}
131009 nNotReady = pWInfo->nLevel - iLevel - 1;
131106 pParse, pOrTab, &pSubWInfo->a[0], iLevel, pLevel->iFrom, 0
151656 int iLevel, /* Level of segments to scan */
151667 /* If iLevel is less than 0 and this is not a scan, include a seg-reader
151673 if( iLevel<0 && p->aIndex ){
151681 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
151683 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
151730 int iLevel, /* Level of segments to scan */
151738 assert( iLevel==FTS3_SEGCURSOR_ALL
151739 || iLevel==FTS3_SEGCURSOR_PENDING
151740 || iLevel>=0
151742 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
151748 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
159466 int iLevel /* Level of segments */
159474 return iBase + iLevel;
159498 int iLevel, /* Level to select (relative level) */
159504 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
159505 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
159508 if( iLevel<0 ){
159521 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
160009 ** This function allocates a new level iLevel index in the segdir table.
160014 ** SELECT max(idx) FROM %_segdir WHERE level = :iLevel
160017 ** level, they are merged into a single level (iLevel+1) segment and the
160027 int iLevel,
160031 sqlite3_stmt *pNextIdx; /* Query for next idx at level iLevel */
160037 /* Set variable iNext to the next available segdir index at level iLevel. */
160041 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
160050 /* If iNext is FTS3_MERGE_COUNT, indicating that level iLevel is already
160051 ** full, merge all segments in level iLevel into a single iLevel+1
160052 ** segment and allocate (newly freed) index 0 at level iLevel. Otherwise,
160056 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
160057 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
160841 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
160853 sqlite3_bind_int64(pStmt, 1, iLevel);
161246 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
161263 rc = fts3WriteSegdir(p, iLevel, iIdx,
161268 rc = fts3WriteSegdir(p, iLevel, iIdx,
161416 ** 2) deletes all %_segdir entries with level iLevel, or all %_segdir
161417 ** entries regardless of level if (iLevel<0).
161425 int iLevel, /* Level of %_segdir entries to delete */
161440 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
161441 if( iLevel==FTS3_SEGCURSOR_ALL ){
161453 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
162054 ** Merge all level iLevel segments in the database into a single
162055 ** iLevel+1 segment. Or, if iLevel<0, merge all segments into a
162059 ** If this function is called with iLevel<0, but there is only one
162068 int iLevel /* Level to merge */
162079 assert( iLevel==FTS3_SEGCURSOR_ALL
162080 || iLevel==FTS3_SEGCURSOR_PENDING
162081 || iLevel>=0
162083 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
162086 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
162089 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
162094 if( iLevel==FTS3_SEGCURSOR_ALL ){
162107 /* This call is to merge all segments at level iLevel. find the next
162108 ** available segment index at level iLevel+1. The call to
162109 ** fts3AllocateSegdirIdx() will merge the segments at level iLevel+1 to
162110 ** a single iLevel+2 segment if necessary. */
162112 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
162113 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
162114 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
162136 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
162138 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
162145 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
167240 ** The id is always a node-id. For iLevel>=1 the id is the node-id of
167241 ** the node that the RtreeSearchPoint represents. When iLevel==0, however,
167248 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
167295 int mxLevel; /* iLevel value for root of the tree */
167299 u32 anQueue[RTREE_MAX_DEPTH+1]; /* Number of queued entries by iLevel */
168163 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
168205 pInfo->iLevel = pSearch->iLevel - 1;
168330 ** If the rScore is a tie, then use iLevel as the tie breaker with smaller
168331 ** iLevel values coming first. In this way, if rScore is the same for all
168332 ** SearchPoints, then iLevel becomes the deciding factor and the result
168341 if( pA->iLevel<pB->iLevel ) return -1;
168342 if( pA->iLevel>pB->iLevel ) return +1;
168396 u8 iLevel /* Level for the new search point */
168410 pNew->iLevel = iLevel;
168411 assert( iLevel<=RTREE_MAX_DEPTH );
168431 u8 iLevel /* Level for the new search point */
168435 pCur->anQueue[iLevel]++;
168438 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
168442 pNew = rtreeEnqueue(pCur, rScore, iLevel);
168455 pCur->sPoint.iLevel = iLevel;
168459 return rtreeEnqueue(pCur, rScore, iLevel);
168468 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
168504 p->anQueue[p->sPoint.iLevel]--;
168507 p->anQueue[p->aPoint[0].iLevel]--;
168556 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
168571 }else if( p->iLevel==1 ){
168580 x.iLevel = p->iLevel - 1;
168581 if( x.iLevel ){
168593 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
197569 ** If iLevel is -ve, then all data in all segments is merged. Or, if iLevel
197570 ** is zero or greater, data from the first nSegment segments on level iLevel
197582 int iLevel, /* Level to iterate (-1 for all) */
197583 int nSegment, /* Number of segments to merge (iLevel>=0) */
197592 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
197596 if( iLevel<0 ){
197601 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
197617 if( iLevel<0 ){
197636 pLvl = &pStruct->aLevel[iLevel];
