Lines Matching refs:iLevel
10528 int iLevel; /* Level of current node or entry */ member
18463 int iLevel; /* Which level of the tree we are on */ member
28549 p->iLevel++;
28552 if( p->iLevel<sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow;
28561 p->iLevel--;
28562 if( p->iLevel<0 ) sqlite3_free(p);
28576 for(i=0; i<p->iLevel && i<sizeof(p->bLine)-1; i++){
122214 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
122215 if( iLevel==0 ) iLevel = 1;
122216 pDb->safety_level = iLevel;
136087 int iLevel, /* Which level of pWInfo->a[] should be coded */
137340 int iLevel, /* Which level of pWInfo->a[] should be coded */
137367 bRev = (pWInfo->revMask>>iLevel)&1;
137368 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
137398 for(j=iLevel; j>0 && pWInfo->a[j].iLeftJoin==0; j--){}
138043 nNotReady = pWInfo->nLevel - iLevel - 1;
163143 int iLevel, /* Level of segments to scan */
163160 if( iLevel<0 && p->aIndex ){
163168 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
163170 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
163217 int iLevel, /* Level of segments to scan */
163225 assert( iLevel==FTS3_SEGCURSOR_ALL
163226 || iLevel==FTS3_SEGCURSOR_PENDING
163227 || iLevel>=0
163229 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
163235 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
170945 int iLevel /* Level of segments */
170953 return iBase + iLevel;
170977 int iLevel, /* Level to select (relative level) */
170983 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
170984 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
170987 if( iLevel<0 ){
171000 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
171506 int iLevel,
171520 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
171535 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
171536 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
172333 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
172345 sqlite3_bind_int64(pStmt, 1, iLevel);
172744 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
172761 rc = fts3WriteSegdir(p, iLevel, iIdx,
172766 rc = fts3WriteSegdir(p, iLevel, iIdx,
172923 int iLevel, /* Level of %_segdir entries to delete */
172938 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
172939 if( iLevel==FTS3_SEGCURSOR_ALL ){
172951 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
173568 int iLevel /* Level to merge */
173579 assert( iLevel==FTS3_SEGCURSOR_ALL
173580 || iLevel==FTS3_SEGCURSOR_PENDING
173581 || iLevel>=0
173583 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
173586 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
173589 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
173594 if( iLevel==FTS3_SEGCURSOR_ALL ){
173612 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
173613 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
173614 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
173638 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
173640 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
173647 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
181367 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
182319 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
182361 pInfo->iLevel = pSearch->iLevel - 1;
182498 if( pA->iLevel<pB->iLevel ) return -1;
182499 if( pA->iLevel>pB->iLevel ) return +1;
182553 u8 iLevel /* Level for the new search point */
182567 pNew->iLevel = iLevel;
182568 assert( iLevel<=RTREE_MAX_DEPTH );
182588 u8 iLevel /* Level for the new search point */
182592 pCur->anQueue[iLevel]++;
182595 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
182599 pNew = rtreeEnqueue(pCur, rScore, iLevel);
182612 pCur->sPoint.iLevel = iLevel;
182616 return rtreeEnqueue(pCur, rScore, iLevel);
182625 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
182661 p->anQueue[p->sPoint.iLevel]--;
182664 p->anQueue[p->aPoint[0].iLevel]--;
182713 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
182728 }else if( p->iLevel==1 ){
182737 x.iLevel = p->iLevel - 1;
182738 if( x.iLevel ){
182750 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
212270 int iLevel, /* Level to iterate (-1 for all) */
212280 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
212284 if( iLevel<0 ){
212289 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
212303 if( iLevel<0 ){
212322 pLvl = &pStruct->aLevel[iLevel];
