Lines Matching refs:iLevel
8050 int iLevel; /* Level of current node or entry */ member
12615 int iLevel; /* Nesting level */ member
12986 int iLevel; /* Which level of the tree we are on */ member
22575 p->iLevel++;
22578 if( p->iLevel<sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow;
22587 p->iLevel--;
22588 if( p->iLevel<0 ) sqlite3_free(p);
22602 for(i=0; i<p->iLevel && i<sizeof(p->bLine)-1; i++){
66086 if( x->iLevel>pParse->iCacheLevel || x->iReg==0 ) continue;
86477 p->iLevel = pParse->iCacheLevel;
86498 p->iLevel = pParse->iCacheLevel;
86555 if( p->iReg && p->iLevel>pParse->iCacheLevel ){
105693 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
105694 if( iLevel==0 ) iLevel = 1;
105695 pDb->safety_level = iLevel;
117336 int iLevel, /* Value for "level" column of output */
117355 int iLevel, /* Which level of pWInfo->a[] should be coded */
117502 int iLevel, /* Value for "level" column of output */
117595 ret = sqlite3VdbeAddOp4(v, OP_Explain, iId, iLevel, iFrom, zMsg,P4_DYNAMIC);
117996 int iLevel, /* Which level of pWInfo->a[] should be coded */
118021 pLevel = &pWInfo->a[iLevel];
118026 bRev = (pWInfo->revMask>>iLevel)&1;
118029 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
118575 nNotReady = pWInfo->nLevel - iLevel - 1;
118673 pParse, pOrTab, &pSubWInfo->a[0], iLevel, pLevel->iFrom, 0
137266 int iLevel, /* Level of segments to scan */
137283 if( iLevel<0 && p->aIndex ){
137291 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
137293 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
137340 int iLevel, /* Level of segments to scan */
137348 assert( iLevel==FTS3_SEGCURSOR_ALL
137349 || iLevel==FTS3_SEGCURSOR_PENDING
137350 || iLevel>=0
137352 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
137358 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
145017 int iLevel /* Level of segments */
145025 return iBase + iLevel;
145049 int iLevel, /* Level to select (relative level) */
145055 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
145056 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
145059 if( iLevel<0 ){
145072 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
145573 int iLevel,
145587 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
145602 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
145603 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
146380 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
146392 sqlite3_bind_int64(pStmt, 1, iLevel);
146785 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
146802 rc = fts3WriteSegdir(p, iLevel, iIdx,
146807 rc = fts3WriteSegdir(p, iLevel, iIdx,
146964 int iLevel, /* Level of %_segdir entries to delete */
146979 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
146980 if( iLevel==FTS3_SEGCURSOR_ALL ){
146992 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
147607 int iLevel /* Level to merge */
147618 assert( iLevel==FTS3_SEGCURSOR_ALL
147619 || iLevel==FTS3_SEGCURSOR_PENDING
147620 || iLevel>=0
147622 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
147625 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
147628 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
147633 if( iLevel==FTS3_SEGCURSOR_ALL ){
147651 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
147652 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
147653 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
147675 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
147677 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
147684 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
152777 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
153559 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
153573 pInfo->iLevel = pSearch->iLevel - 1;
153707 if( pA->iLevel<pB->iLevel ) return -1;
153708 if( pA->iLevel>pB->iLevel ) return +1;
153762 u8 iLevel /* Level for the new search point */
153776 pNew->iLevel = iLevel;
153777 assert( iLevel<=RTREE_MAX_DEPTH );
153797 u8 iLevel /* Level for the new search point */
153801 pCur->anQueue[iLevel]++;
153804 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
153808 pNew = rtreeEnqueue(pCur, rScore, iLevel);
153821 pCur->sPoint.iLevel = iLevel;
153825 return rtreeEnqueue(pCur, rScore, iLevel);
153834 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
153870 p->anQueue[p->sPoint.iLevel]--;
153873 p->anQueue[p->aPoint[0].iLevel]--;
153922 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
153937 }else if( p->iLevel==1 ){
153946 x.iLevel = p->iLevel - 1;
153947 if( x.iLevel ){
153959 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);