Lines Matching refs:iLevel
8113 int iLevel; /* Level of current node or entry */
8114 int mxLevel; /* The largest iLevel value in the tree */
13230 int iCacheLevel; /* ColCache valid when aColCache[].iLevel<=iCacheLevel */
13238 int iLevel; /* Nesting level */
13609 int iLevel; /* Which level of the tree we are on */
23219 p->iLevel++;
23222 if( p->iLevel<sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow;
23231 p->iLevel--;
23232 if( p->iLevel<0 ) sqlite3_free(p);
23246 for(i=0; i<p->iLevel && i<sizeof(p->bLine)-1; i++){
66872 if( x->iLevel>pParse->iCacheLevel || x->iReg==0 ) continue;
87316 p->iLevel = pParse->iCacheLevel;
87337 p->iLevel = pParse->iCacheLevel;
87394 if( p->iReg && p->iLevel>pParse->iCacheLevel ){
106759 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
106760 if( iLevel==0 ) iLevel = 1;
106761 pDb->safety_level = iLevel;
118454 int iLevel, /* Value for "level" column of output */
118473 int iLevel, /* Which level of pWInfo->a[] should be coded */
118625 int iLevel, /* Value for "level" column of output */
118717 ret = sqlite3VdbeAddOp4(v, OP_Explain, iId, iLevel, iFrom, zMsg,P4_DYNAMIC);
119113 ** Generate code for the start of the iLevel-th loop in the WHERE clause
119118 int iLevel, /* Which level of pWInfo->a[] should be coded */
119143 pLevel = &pWInfo->a[iLevel];
119148 bRev = (pWInfo->revMask>>iLevel)&1;
119151 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
119702 nNotReady = pWInfo->nLevel - iLevel - 1;
119800 pParse, pOrTab, &pSubWInfo->a[0], iLevel, pLevel->iFrom, 0
138674 int iLevel, /* Level of segments to scan */
138685 /* If iLevel is less than 0 and this is not a scan, include a seg-reader
138691 if( iLevel<0 && p->aIndex ){
138699 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
138701 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
138748 int iLevel, /* Level of segments to scan */
138756 assert( iLevel==FTS3_SEGCURSOR_ALL
138757 || iLevel==FTS3_SEGCURSOR_PENDING
138758 || iLevel>=0
138760 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
138766 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
146451 int iLevel /* Level of segments */
146459 return iBase + iLevel;
146483 int iLevel, /* Level to select (relative level) */
146489 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
146490 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
146493 if( iLevel<0 ){
146506 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
146994 ** This function allocates a new level iLevel index in the segdir table.
146999 ** SELECT max(idx) FROM %_segdir WHERE level = :iLevel
147002 ** level, they are merged into a single level (iLevel+1) segment and the
147012 int iLevel,
147016 sqlite3_stmt *pNextIdx; /* Query for next idx at level iLevel */
147022 /* Set variable iNext to the next available segdir index at level iLevel. */
147026 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
147035 /* If iNext is FTS3_MERGE_COUNT, indicating that level iLevel is already
147036 ** full, merge all segments in level iLevel into a single iLevel+1
147037 ** segment and allocate (newly freed) index 0 at level iLevel. Otherwise,
147041 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
147042 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
147826 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
147838 sqlite3_bind_int64(pStmt, 1, iLevel);
148231 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
148248 rc = fts3WriteSegdir(p, iLevel, iIdx,
148253 rc = fts3WriteSegdir(p, iLevel, iIdx,
148401 ** 2) deletes all %_segdir entries with level iLevel, or all %_segdir
148402 ** entries regardless of level if (iLevel<0).
148410 int iLevel, /* Level of %_segdir entries to delete */
148425 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
148426 if( iLevel==FTS3_SEGCURSOR_ALL ){
148438 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
149039 ** Merge all level iLevel segments in the database into a single
149040 ** iLevel+1 segment. Or, if iLevel<0, merge all segments into a
149044 ** If this function is called with iLevel<0, but there is only one
149053 int iLevel /* Level to merge */
149064 assert( iLevel==FTS3_SEGCURSOR_ALL
149065 || iLevel==FTS3_SEGCURSOR_PENDING
149066 || iLevel>=0
149068 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
149071 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
149074 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
149079 if( iLevel==FTS3_SEGCURSOR_ALL ){
149092 /* This call is to merge all segments at level iLevel. find the next
149093 ** available segment index at level iLevel+1. The call to
149094 ** fts3AllocateSegdirIdx() will merge the segments at level iLevel+1 to
149095 ** a single iLevel+2 segment if necessary. */
149097 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
149098 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
149099 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
149121 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
149123 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
149130 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
154215 ** The id is always a node-id. For iLevel>=1 the id is the node-id of
154216 ** the node that the RtreeSearchPoint represents. When iLevel==0, however,
154223 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
154270 int mxLevel; /* iLevel value for root of the tree */
154274 u32 anQueue[RTREE_MAX_DEPTH+1]; /* Number of queued entries by iLevel */
155005 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
155019 pInfo->iLevel = pSearch->iLevel - 1;
155142 ** If the rScore is a tie, then use iLevel as the tie breaker with smaller
155143 ** iLevel values coming first. In this way, if rScore is the same for all
155144 ** SearchPoints, then iLevel becomes the deciding factor and the result
155153 if( pA->iLevel<pB->iLevel ) return -1;
155154 if( pA->iLevel>pB->iLevel ) return +1;
155208 u8 iLevel /* Level for the new search point */
155222 pNew->iLevel = iLevel;
155223 assert( iLevel<=RTREE_MAX_DEPTH );
155243 u8 iLevel /* Level for the new search point */
155247 pCur->anQueue[iLevel]++;
155250 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
155254 pNew = rtreeEnqueue(pCur, rScore, iLevel);
155267 pCur->sPoint.iLevel = iLevel;
155271 return rtreeEnqueue(pCur, rScore, iLevel);
155280 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
155316 p->anQueue[p->sPoint.iLevel]--;
155319 p->anQueue[p->aPoint[0].iLevel]--;
155368 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
155383 }else if( p->iLevel==1 ){
155392 x.iLevel = p->iLevel - 1;
155393 if( x.iLevel ){
155405 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
175092 ** If iLevel is -ve, then all data in all segments is merged. Or, if iLevel
175093 ** is zero or greater, data from the first nSegment segments on level iLevel
175105 int iLevel, /* Level to iterate (-1 for all) */
175106 int nSegment, /* Number of segments to merge (iLevel>=0) */
175116 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
175120 if( iLevel<0 ){
175125 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
175136 if( iLevel<0 ){
175155 pLvl = &pStruct->aLevel[iLevel];
