Lines Matching refs:iLevel
10473 int iLevel; /* Level of current node or entry */ member
19034 int iLevel; /* Which level of the tree we are on */ member
30282 p->iLevel++;
30285 if( p->iLevel<sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow;
30294 p->iLevel--;
30295 if( p->iLevel<0 ) sqlite3_free(p);
30309 for(i=0; i<p->iLevel && i<sizeof(p->bLine)-1; i++){
130598 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
130599 if( iLevel==0 ) iLevel = 1;
130600 pDb->safety_level = iLevel;
146372 int iLevel, /* Which level of pWInfo->a[] should be coded */
147744 int iLevel, /* Which level of pWInfo->a[] should be coded */
147771 bRev = (pWInfo->revMask>>iLevel)&1;
147772 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
147776 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
147780 if( iLevel==0 ){
147817 for(j=iLevel; j>0 && pWInfo->a[j].iLeftJoin==0; j--){}
148202 if( iLevel>0 && (pLoop->wsFlags & WHERE_IN_SEEKSCAN)!=0 ){
148556 nNotReady = pWInfo->nLevel - iLevel - 1;
148964 iLevel);
148969 iLevel, (u64)pLevel->notReady);
175604 int iLevel, /* Level of segments to scan */
175621 if( iLevel<0 && p->aIndex && p->iPrevLangid==iLangid ){
175629 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
175631 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
175678 int iLevel, /* Level of segments to scan */
175686 assert( iLevel==FTS3_SEGCURSOR_ALL
175687 || iLevel==FTS3_SEGCURSOR_PENDING
175688 || iLevel>=0
175690 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
175696 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
183438 int iLevel /* Level of segments */
183446 return iBase + iLevel;
183470 int iLevel, /* Level to select (relative level) */
183476 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
183477 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
183480 if( iLevel<0 ){
183493 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
183999 int iLevel,
184013 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
184028 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
184029 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
184837 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
184849 sqlite3_bind_int64(pStmt, 1, iLevel);
185257 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
185274 rc = fts3WriteSegdir(p, iLevel, iIdx,
185279 rc = fts3WriteSegdir(p, iLevel, iIdx,
185436 int iLevel, /* Level of %_segdir entries to delete */
185451 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
185452 if( iLevel==FTS3_SEGCURSOR_ALL ){
185464 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
186090 int iLevel /* Level to merge */
186101 assert( iLevel==FTS3_SEGCURSOR_ALL
186102 || iLevel==FTS3_SEGCURSOR_PENDING
186103 || iLevel>=0
186105 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
186108 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
186111 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
186116 if( iLevel==FTS3_SEGCURSOR_ALL ){
186134 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
186135 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
186136 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
186160 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
186162 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
186169 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
194186 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
195156 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
195198 pInfo->iLevel = pSearch->iLevel - 1;
195351 if( pA->iLevel<pB->iLevel ) return -1;
195352 if( pA->iLevel>pB->iLevel ) return +1;
195406 u8 iLevel /* Level for the new search point */
195420 pNew->iLevel = iLevel;
195421 assert( iLevel<=RTREE_MAX_DEPTH );
195441 u8 iLevel /* Level for the new search point */
195445 pCur->anQueue[iLevel]++;
195448 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
195452 pNew = rtreeEnqueue(pCur, rScore, iLevel);
195466 pCur->sPoint.iLevel = iLevel;
195470 return rtreeEnqueue(pCur, rScore, iLevel);
195479 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
195515 p->anQueue[p->sPoint.iLevel]--;
195518 p->anQueue[p->aPoint[0].iLevel]--;
195567 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
195583 }else if( p->iLevel==1 ){
195596 x.iLevel = p->iLevel - 1;
195597 if( x.iLevel ){
195615 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
226372 int iLevel, /* Level to iterate (-1 for all) */
226382 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
226386 if( iLevel<0 ){
226391 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
226408 if( iLevel<0 ){
226427 pLvl = &pStruct->aLevel[iLevel];