Lines Matching refs:iLevel
11493 int iLevel; /* Level of current node or entry */ member
20897 int iLevel; /* Which level of the tree we are on */ member
33187 p->iLevel++; in sqlite3TreeViewPush()
33190 if( p->iLevel<(int)sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow; in sqlite3TreeViewPush()
33199 p->iLevel--; in sqlite3TreeViewPop()
33200 if( p->iLevel<0 ){ in sqlite3TreeViewPop()
33217 for(i=0; i<p->iLevel && i<(int)sizeof(p->bLine)-1; i++){ in sqlite3TreeViewLine()
141792 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
141793 if( iLevel==0 ) iLevel = 1;
141794 pDb->safety_level = iLevel;
159528 int iLevel, /* Which level of pWInfo->a[] should be coded */
159534 int iLevel,
160993 int iLevel, /* Which level of pWInfo->a[] should be coded */
160997 while( ++iLevel < pWInfo->nLevel ){
160998 WhereLevel *pLevel = &pWInfo->a[iLevel];
161068 int iLevel, /* Which level of pWInfo->a[] should be coded */
161095 bRev = (pWInfo->revMask>>iLevel)&1;
161097 iLevel, pTabItem->pSTab->zName));
161101 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
161107 if( iLevel==0 ){
161144 for(j=iLevel; j>0; j--){
161314 filterPullDown(pParse, pWInfo, iLevel, addrNxt, notReady);
161572 if( iLevel>0 && (pLoop->wsFlags & WHERE_IN_SEEKSCAN)!=0 ){
161645 filterPullDown(pParse, pWInfo, iLevel, addrNxt, notReady);
161910 nNotReady = pWInfo->nLevel - iLevel - 1;
162426 iLevel);
162431 iLevel, (u64)pLevel->notReady);
162443 int iLevel,
162462 for(k=0; k<iLevel; k++){
165738 int iLevel, /* Index in pWInfo->a[] that is pLevel */
165831 while( ++iLevel < pWInfo->nLevel ){
165833 pLevel = &pWInfo->a[iLevel];
165849 }while( iLevel < pWInfo->nLevel );
192051 int iLevel, /* Level of segments to scan */
192068 if( iLevel<0 && p->aIndex && p->iPrevLangid==iLangid ){
192076 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
192078 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
192125 int iLevel, /* Level of segments to scan */
192133 assert( iLevel==FTS3_SEGCURSOR_ALL
192134 || iLevel==FTS3_SEGCURSOR_PENDING
192135 || iLevel>=0
192137 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
192143 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
200007 int iLevel /* Level of segments */
200015 return iBase + iLevel;
200039 int iLevel, /* Level to select (relative level) */
200045 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
200046 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
200049 if( iLevel<0 ){
200062 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
200568 int iLevel,
200582 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
200597 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
200598 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
201406 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
201418 sqlite3_bind_int64(pStmt, 1, iLevel);
201826 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
201843 rc = fts3WriteSegdir(p, iLevel, iIdx,
201848 rc = fts3WriteSegdir(p, iLevel, iIdx,
202005 int iLevel, /* Level of %_segdir entries to delete */
202020 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
202021 if( iLevel==FTS3_SEGCURSOR_ALL ){
202033 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
202663 int iLevel /* Level to merge */
202674 assert( iLevel==FTS3_SEGCURSOR_ALL
202675 || iLevel==FTS3_SEGCURSOR_PENDING
202676 || iLevel>=0
202678 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
202681 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
202684 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
202689 if( iLevel==FTS3_SEGCURSOR_ALL ){
202707 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
202708 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
202709 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
202733 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
202735 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
202742 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
213711 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
214690 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
214732 pInfo->iLevel = pSearch->iLevel - 1;
214885 if( pA->iLevel<pB->iLevel ) return -1;
214886 if( pA->iLevel>pB->iLevel ) return +1;
214940 u8 iLevel /* Level for the new search point */
214954 pNew->iLevel = iLevel;
214955 assert( iLevel<=RTREE_MAX_DEPTH );
214975 u8 iLevel /* Level for the new search point */
214979 pCur->anQueue[iLevel]++;
214982 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
214986 pNew = rtreeEnqueue(pCur, rScore, iLevel);
215000 pCur->sPoint.iLevel = iLevel;
215004 return rtreeEnqueue(pCur, rScore, iLevel);
215013 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
215049 p->anQueue[p->sPoint.iLevel]--;
215052 p->anQueue[p->aPoint[0].iLevel]--;
215101 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
215117 }else if( p->iLevel==1 ){
215130 x.iLevel = p->iLevel - 1;
215131 if( x.iLevel ){
215149 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
248154 int iLevel, /* Level to iterate (-1 for all) */
248164 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
248168 if( iLevel<0 ){
248173 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
248190 if( iLevel<0 ){
248209 pLvl = &pStruct->aLevel[iLevel];
253440 int iLevel;
253541 while( pCsr->iLevel<p->nLevel && pCsr->iSeg>=p->aLevel[pCsr->iLevel].nSeg ){
253542 pCsr->iLevel++;
253545 if( pCsr->iLevel>=p->nLevel ){
253581 Fts5StructureSegment *pSeg = &p->aLevel[pCsr->iLevel].aSeg[pCsr->iSeg];
253585 sqlite3_result_int(ctx, pCsr->iLevel);
253591 sqlite3_result_int(ctx, pCsr->iSeg < p->aLevel[pCsr->iLevel].nMerge);
253646 pCsr->iLevel = 0;