Lines Matching refs:iLevel
10943 int iLevel; /* Level of current node or entry */ member
19121 int iLevel; /* Which level of the tree we are on */ member
29432 p->iLevel++;
29435 if( p->iLevel<sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow;
29444 p->iLevel--;
29445 if( p->iLevel<0 ) sqlite3_free(p);
29459 for(i=0; i<p->iLevel && i<sizeof(p->bLine)-1; i++){
126418 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
126419 if( iLevel==0 ) iLevel = 1;
126420 pDb->safety_level = iLevel;
140676 int iLevel, /* Which level of pWInfo->a[] should be coded */
142012 int iLevel, /* Which level of pWInfo->a[] should be coded */
142039 bRev = (pWInfo->revMask>>iLevel)&1;
142040 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
142044 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
142048 if( iLevel==0 ){
142085 for(j=iLevel; j>0 && pWInfo->a[j].iLeftJoin==0; j--){}
142802 nNotReady = pWInfo->nLevel - iLevel - 1;
143196 iLevel);
143201 iLevel, (u64)pLevel->notReady);
169001 int iLevel, /* Level of segments to scan */
169018 if( iLevel<0 && p->aIndex && p->iPrevLangid==iLangid ){
169026 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
169028 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
169075 int iLevel, /* Level of segments to scan */
169083 assert( iLevel==FTS3_SEGCURSOR_ALL
169084 || iLevel==FTS3_SEGCURSOR_PENDING
169085 || iLevel>=0
169087 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
169093 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
176804 int iLevel /* Level of segments */
176812 return iBase + iLevel;
176836 int iLevel, /* Level to select (relative level) */
176842 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
176843 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
176846 if( iLevel<0 ){
176859 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
177365 int iLevel,
177379 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
177394 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
177395 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
178195 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
178207 sqlite3_bind_int64(pStmt, 1, iLevel);
178615 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
178632 rc = fts3WriteSegdir(p, iLevel, iIdx,
178637 rc = fts3WriteSegdir(p, iLevel, iIdx,
178794 int iLevel, /* Level of %_segdir entries to delete */
178809 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
178810 if( iLevel==FTS3_SEGCURSOR_ALL ){
178822 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
179438 int iLevel /* Level to merge */
179449 assert( iLevel==FTS3_SEGCURSOR_ALL
179450 || iLevel==FTS3_SEGCURSOR_PENDING
179451 || iLevel>=0
179453 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
179456 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
179459 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
179464 if( iLevel==FTS3_SEGCURSOR_ALL ){
179482 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
179483 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
179484 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
179508 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
179510 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
179517 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
187408 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
188375 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
188417 pInfo->iLevel = pSearch->iLevel - 1;
188560 if( pA->iLevel<pB->iLevel ) return -1;
188561 if( pA->iLevel>pB->iLevel ) return +1;
188615 u8 iLevel /* Level for the new search point */
188629 pNew->iLevel = iLevel;
188630 assert( iLevel<=RTREE_MAX_DEPTH );
188650 u8 iLevel /* Level for the new search point */
188654 pCur->anQueue[iLevel]++;
188657 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
188661 pNew = rtreeEnqueue(pCur, rScore, iLevel);
188674 pCur->sPoint.iLevel = iLevel;
188678 return rtreeEnqueue(pCur, rScore, iLevel);
188687 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
188723 p->anQueue[p->sPoint.iLevel]--;
188726 p->anQueue[p->aPoint[0].iLevel]--;
188775 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
188791 }else if( p->iLevel==1 ){
188804 x.iLevel = p->iLevel - 1;
188805 if( x.iLevel ){
188823 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
218837 int iLevel, /* Level to iterate (-1 for all) */
218847 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
218851 if( iLevel<0 ){
218856 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
218870 if( iLevel<0 ){
218889 pLvl = &pStruct->aLevel[iLevel];