Lines Matching defs:iLevel
7587 int iLevel; /* Level of current node or entry */
7588 int mxLevel; /* The largest iLevel value in the tree */
11932 int iCacheLevel; /* ColCache valid when aColCache[].iLevel<=iCacheLevel */
11940 int iLevel; /* Nesting level */
62395 if( x->iLevel>pParse->iCacheLevel || x->iReg==0 ) continue;
80463 p->iLevel = pParse->iCacheLevel;
80484 p->iLevel = pParse->iCacheLevel;
80541 if( p->iReg && p->iLevel>pParse->iCacheLevel ){
113690 int iLevel, /* Value for "level" column of output */
113763 sqlite3VdbeAddOp4(v, OP_Explain, iId, iLevel, iFrom, zMsg, P4_DYNAMIC);
113772 ** Generate code for the start of the iLevel-th loop in the WHERE clause
113777 int iLevel, /* Which level of pWInfo->a[] should be coded */
113802 pLevel = &pWInfo->a[iLevel];
113807 bRev = (pWInfo->revMask>>iLevel)&1;
113810 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
114339 nNotReady = pWInfo->nLevel - iLevel - 1;
114435 pParse, pOrTab, &pSubWInfo->a[0], iLevel, pLevel->iFrom, 0
129578 int iLevel, /* Level of segments to scan */
129589 /* If iLevel is less than 0 and this is not a scan, include a seg-reader
129595 if( iLevel<0 && p->aIndex ){
129603 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
129605 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
129652 int iLevel, /* Level of segments to scan */
129660 assert( iLevel==FTS3_SEGCURSOR_ALL
129661 || iLevel==FTS3_SEGCURSOR_PENDING
129662 || iLevel>=0
129664 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
129670 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
137263 int iLevel /* Level of segments */
137271 return iBase + iLevel;
137295 int iLevel, /* Level to select (relative level) */
137301 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
137302 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
137305 if( iLevel<0 ){
137318 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
137801 ** This function allocates a new level iLevel index in the segdir table.
137806 ** SELECT max(idx) FROM %_segdir WHERE level = :iLevel
137809 ** level, they are merged into a single level (iLevel+1) segment and the
137819 int iLevel,
137823 sqlite3_stmt *pNextIdx; /* Query for next idx at level iLevel */
137829 /* Set variable iNext to the next available segdir index at level iLevel. */
137833 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
137842 /* If iNext is FTS3_MERGE_COUNT, indicating that level iLevel is already
137843 ** full, merge all segments in level iLevel into a single iLevel+1
137844 ** segment and allocate (newly freed) index 0 at level iLevel. Otherwise,
137848 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
137849 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
138623 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
138635 sqlite3_bind_int64(pStmt, 1, iLevel);
139028 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
139045 rc = fts3WriteSegdir(p, iLevel, iIdx,
139050 rc = fts3WriteSegdir(p, iLevel, iIdx,
139198 ** 2) deletes all %_segdir entries with level iLevel, or all %_segdir
139199 ** entries regardless of level if (iLevel<0).
139207 int iLevel, /* Level of %_segdir entries to delete */
139222 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
139223 if( iLevel==FTS3_SEGCURSOR_ALL ){
139235 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
139836 ** Merge all level iLevel segments in the database into a single
139837 ** iLevel+1 segment. Or, if iLevel<0, merge all segments into a
139841 ** If this function is called with iLevel<0, but there is only one
139850 int iLevel /* Level to merge */
139861 assert( iLevel==FTS3_SEGCURSOR_ALL
139862 || iLevel==FTS3_SEGCURSOR_PENDING
139863 || iLevel>=0
139865 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
139868 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
139871 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
139876 if( iLevel==FTS3_SEGCURSOR_ALL ){
139889 /* This call is to merge all segments at level iLevel. find the next
139890 ** available segment index at level iLevel+1. The call to
139891 ** fts3AllocateSegdirIdx() will merge the segments at level iLevel+1 to
139892 ** a single iLevel+2 segment if necessary. */
139894 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
139895 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
139896 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
139918 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
139920 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
139927 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
144821 ** The id is always a node-id. For iLevel>=1 the id is the node-id of
144822 ** the node that the RtreeSearchPoint represents. When iLevel==0, however,
144829 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
144876 int mxLevel; /* iLevel value for root of the tree */
144880 u32 anQueue[RTREE_MAX_DEPTH+1]; /* Number of queued entries by iLevel */
145612 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
145626 pInfo->iLevel = pSearch->iLevel - 1;
145749 ** If the rScore is a tie, then use iLevel as the tie breaker with smaller
145750 ** iLevel values coming first. In this way, if rScore is the same for all
145751 ** SearchPoints, then iLevel becomes the deciding factor and the result
145760 if( pA->iLevel<pB->iLevel ) return -1;
145761 if( pA->iLevel>pB->iLevel ) return +1;
145815 u8 iLevel /* Level for the new search point */
145829 pNew->iLevel = iLevel;
145830 assert( iLevel>=0 && iLevel<=RTREE_MAX_DEPTH );
145850 u8 iLevel /* Level for the new search point */
145854 pCur->anQueue[iLevel]++;
145857 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
145861 pNew = rtreeEnqueue(pCur, rScore, iLevel);
145874 pCur->sPoint.iLevel = iLevel;
145878 return rtreeEnqueue(pCur, rScore, iLevel);
145887 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
145923 p->anQueue[p->sPoint.iLevel]--;
145926 p->anQueue[p->aPoint[0].iLevel]--;
145975 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
145990 }else if( p->iLevel==1 ){
145999 x.iLevel = p->iLevel - 1;
146000 if( x.iLevel ){
146012 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
