Lines Matching refs:iLevel
11210 int iLevel; /* Level of current node or entry */ member
20347 int iLevel; /* Which level of the tree we are on */ member
32313 p->iLevel++; in sqlite3TreeViewPush()
32316 if( p->iLevel<(int)sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow; in sqlite3TreeViewPush()
32325 p->iLevel--; in sqlite3TreeViewPop()
32326 if( p->iLevel<0 ){ in sqlite3TreeViewPop()
32343 for(i=0; i<p->iLevel && i<(int)sizeof(p->bLine)-1; i++){ in sqlite3TreeViewLine()
138859 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
138860 if( iLevel==0 ) iLevel = 1;
138861 pDb->safety_level = iLevel;
156083 int iLevel, /* Which level of pWInfo->a[] should be coded */
156089 int iLevel,
157449 int iLevel, /* Which level of pWInfo->a[] should be coded */
157453 while( ++iLevel < pWInfo->nLevel ){
157454 WhereLevel *pLevel = &pWInfo->a[iLevel];
157503 int iLevel, /* Which level of pWInfo->a[] should be coded */
157530 bRev = (pWInfo->revMask>>iLevel)&1;
157531 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
157535 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
157541 if( iLevel==0 ){
157578 for(j=iLevel; j>0; j--){
157741 filterPullDown(pParse, pWInfo, iLevel, addrNxt, notReady);
157999 if( iLevel>0 && (pLoop->wsFlags & WHERE_IN_SEEKSCAN)!=0 ){
158072 filterPullDown(pParse, pWInfo, iLevel, addrNxt, notReady);
158334 nNotReady = pWInfo->nLevel - iLevel - 1;
158845 iLevel);
158850 iLevel, (u64)pLevel->notReady);
158862 int iLevel,
158880 for(k=0; k<iLevel; k++){
161961 int iLevel, /* Index in pWInfo->a[] that is pLevel */
162054 while( ++iLevel < pWInfo->nLevel ){
162056 pLevel = &pWInfo->a[iLevel];
162072 }while( iLevel < pWInfo->nLevel );
187505 int iLevel, /* Level of segments to scan */
187522 if( iLevel<0 && p->aIndex && p->iPrevLangid==iLangid ){
187530 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
187532 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
187579 int iLevel, /* Level of segments to scan */
187587 assert( iLevel==FTS3_SEGCURSOR_ALL
187588 || iLevel==FTS3_SEGCURSOR_PENDING
187589 || iLevel>=0
187591 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
187597 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
195422 int iLevel /* Level of segments */
195430 return iBase + iLevel;
195454 int iLevel, /* Level to select (relative level) */
195460 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
195461 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
195464 if( iLevel<0 ){
195477 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
195983 int iLevel,
195997 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
196012 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
196013 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
196821 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
196833 sqlite3_bind_int64(pStmt, 1, iLevel);
197241 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
197258 rc = fts3WriteSegdir(p, iLevel, iIdx,
197263 rc = fts3WriteSegdir(p, iLevel, iIdx,
197420 int iLevel, /* Level of %_segdir entries to delete */
197435 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
197436 if( iLevel==FTS3_SEGCURSOR_ALL ){
197448 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
198078 int iLevel /* Level to merge */
198089 assert( iLevel==FTS3_SEGCURSOR_ALL
198090 || iLevel==FTS3_SEGCURSOR_PENDING
198091 || iLevel>=0
198093 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
198096 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
198099 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
198104 if( iLevel==FTS3_SEGCURSOR_ALL ){
198122 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
198123 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
198124 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
198148 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
198150 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
198157 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
208763 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
209737 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
209779 pInfo->iLevel = pSearch->iLevel - 1;
209932 if( pA->iLevel<pB->iLevel ) return -1;
209933 if( pA->iLevel>pB->iLevel ) return +1;
209987 u8 iLevel /* Level for the new search point */
210001 pNew->iLevel = iLevel;
210002 assert( iLevel<=RTREE_MAX_DEPTH );
210022 u8 iLevel /* Level for the new search point */
210026 pCur->anQueue[iLevel]++;
210029 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
210033 pNew = rtreeEnqueue(pCur, rScore, iLevel);
210047 pCur->sPoint.iLevel = iLevel;
210051 return rtreeEnqueue(pCur, rScore, iLevel);
210060 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
210096 p->anQueue[p->sPoint.iLevel]--;
210099 p->anQueue[p->aPoint[0].iLevel]--;
210148 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
210164 }else if( p->iLevel==1 ){
210177 x.iLevel = p->iLevel - 1;
210178 if( x.iLevel ){
210196 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
242475 int iLevel, /* Level to iterate (-1 for all) */
242485 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
242489 if( iLevel<0 ){
242494 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
242511 if( iLevel<0 ){
242530 pLvl = &pStruct->aLevel[iLevel];
247369 int iLevel;
247470 while( pCsr->iLevel<p->nLevel && pCsr->iSeg>=p->aLevel[pCsr->iLevel].nSeg ){
247471 pCsr->iLevel++;
247474 if( pCsr->iLevel>=p->nLevel ){
247510 Fts5StructureSegment *pSeg = &p->aLevel[pCsr->iLevel].aSeg[pCsr->iSeg];
247514 sqlite3_result_int(ctx, pCsr->iLevel);
247520 sqlite3_result_int(ctx, pCsr->iSeg < p->aLevel[pCsr->iLevel].nMerge);
247575 pCsr->iLevel = 0;