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++){
66890 if( x->iLevel>pParse->iCacheLevel || x->iReg==0 ) continue;
87334 p->iLevel = pParse->iCacheLevel;
87355 p->iLevel = pParse->iCacheLevel;
87412 if( p->iReg && p->iLevel>pParse->iCacheLevel ){
106777 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
106778 if( iLevel==0 ) iLevel = 1;
106779 pDb->safety_level = iLevel;
118472 int iLevel, /* Value for "level" column of output */
118491 int iLevel, /* Which level of pWInfo->a[] should be coded */
118643 int iLevel, /* Value for "level" column of output */
118735 ret = sqlite3VdbeAddOp4(v, OP_Explain, iId, iLevel, iFrom, zMsg,P4_DYNAMIC);
119131 ** Generate code for the start of the iLevel-th loop in the WHERE clause
119136 int iLevel, /* Which level of pWInfo->a[] should be coded */
119161 pLevel = &pWInfo->a[iLevel];
119166 bRev = (pWInfo->revMask>>iLevel)&1;
119169 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
119720 nNotReady = pWInfo->nLevel - iLevel - 1;
119818 pParse, pOrTab, &pSubWInfo->a[0], iLevel, pLevel->iFrom, 0
138692 int iLevel, /* Level of segments to scan */
138703 /* If iLevel is less than 0 and this is not a scan, include a seg-reader
138709 if( iLevel<0 && p->aIndex ){
138717 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
138719 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
138766 int iLevel, /* Level of segments to scan */
138774 assert( iLevel==FTS3_SEGCURSOR_ALL
138775 || iLevel==FTS3_SEGCURSOR_PENDING
138776 || iLevel>=0
138778 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
138784 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
146481 int iLevel /* Level of segments */
146489 return iBase + iLevel;
146513 int iLevel, /* Level to select (relative level) */
146519 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
146520 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
146523 if( iLevel<0 ){
146536 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
147024 ** This function allocates a new level iLevel index in the segdir table.
147029 ** SELECT max(idx) FROM %_segdir WHERE level = :iLevel
147032 ** level, they are merged into a single level (iLevel+1) segment and the
147042 int iLevel,
147046 sqlite3_stmt *pNextIdx; /* Query for next idx at level iLevel */
147052 /* Set variable iNext to the next available segdir index at level iLevel. */
147056 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
147065 /* If iNext is FTS3_MERGE_COUNT, indicating that level iLevel is already
147066 ** full, merge all segments in level iLevel into a single iLevel+1
147067 ** segment and allocate (newly freed) index 0 at level iLevel. Otherwise,
147071 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
147072 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
147856 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
147868 sqlite3_bind_int64(pStmt, 1, iLevel);
148261 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
148278 rc = fts3WriteSegdir(p, iLevel, iIdx,
148283 rc = fts3WriteSegdir(p, iLevel, iIdx,
148431 ** 2) deletes all %_segdir entries with level iLevel, or all %_segdir
148432 iLevel<0).
148440 int iLevel, /* Level of %_segdir entries to delete */
148455 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
148456 if( iLevel==FTS3_SEGCURSOR_ALL ){
148468 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
149069 ** Merge all level iLevel segments in the database into a single
149070 ** iLevel+1 segment. Or, if iLevel<0, merge all segments into a
149074 ** If this function is called with iLevel<0, but there is only one
149083 int iLevel /* Level to merge */
149094 assert( iLevel==FTS3_SEGCURSOR_ALL
149095 || iLevel==FTS3_SEGCURSOR_PENDING
149096 || iLevel>=0
149098 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
149101 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
149104 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
149109 if( iLevel==FTS3_SEGCURSOR_ALL ){
149122 /* This call is to merge all segments at level iLevel. find the next
149123 ** available segment index at level iLevel+1. The call to
149124 ** fts3AllocateSegdirIdx() will merge the segments at level iLevel+1 to
149125 ** a single iLevel+2 segment if necessary. */
149127 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
149128 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
149129 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
149151 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
149153 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
149160 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
154245 ** The id is always a node-id. For iLevel>=1 the id is the node-id of
154246 ** the node that the RtreeSearchPoint represents. When iLevel==0, however,
154253 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
154300 int mxLevel; /* iLevel value for root of the tree */
154304 u32 anQueue[RTREE_MAX_DEPTH+1]; /* Number of queued entries by iLevel */
155035 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
155049 pInfo->iLevel = pSearch->iLevel - 1;
155172 ** If the rScore is a tie, then use iLevel as the tie breaker with smaller
155173 ** iLevel values coming first. In this way, if rScore is the same for all
155174 ** SearchPoints, then iLevel becomes the deciding factor and the result
155183 if( pA->iLevel<pB->iLevel ) return -1;
155184 if( pA->iLevel>pB->iLevel ) return +1;
155238 u8 iLevel /* Level for the new search point */
155252 pNew->iLevel = iLevel;
155253 assert( iLevel<=RTREE_MAX_DEPTH );
155273 u8 iLevel /* Level for the new search point */
155277 pCur->anQueue[iLevel]++;
155280 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
155284 pNew = rtreeEnqueue(pCur, rScore, iLevel);
155297 pCur->sPoint.iLevel = iLevel;
155301 return rtreeEnqueue(pCur, rScore, iLevel);
155310 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
155346 p->anQueue[p->sPoint.iLevel]--;
155349 p->anQueue[p->aPoint[0].iLevel]--;
155398 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
155413 }else if( p->iLevel==1 ){
155422 x.iLevel = p->iLevel - 1;
155423 if( x.iLevel ){
155435 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
175122 ** If iLevel is -ve, then all data in all segments is merged. Or, if iLevel
175123 ** is zero or greater, data from the first nSegment segments on level iLevel
175135 int iLevel, /* Level to iterate (-1 for all) */
175136 int nSegment, /* Number of segments to merge (iLevel>=0) */
175146 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
175150 if( iLevel<0 ){
175155 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
175166 if( iLevel<0 ){
175185 pLvl = &pStruct->aLevel[iLevel];
