Lines Matching refs:iLevel
8016 int iLevel; /* Level of current node or entry */ member
12532 int iLevel; /* Nesting level */ member
12904 int iLevel; /* Which level of the tree we are on */ member
22442 p->iLevel++;
22445 if( p->iLevel<sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow;
22451 p->iLevel--;
22452 if( p->iLevel<0 ) sqlite3_free(p);
22463 for(i=0; i<p->iLevel && i<sizeof(p->bLine)-1; i++){
64961 if( x->iLevel>pParse->iCacheLevel || x->iReg==0 ) continue;
85136 p->iLevel = pParse->iCacheLevel;
85157 p->iLevel = pParse->iCacheLevel;
85214 if( p->iReg && p->iLevel>pParse->iCacheLevel ){
104539 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
104540 if( iLevel==0 ) iLevel = 1;
104541 pDb->safety_level = iLevel;
119252 int iLevel, /* Value for "level" column of output */
119345 ret = sqlite3VdbeAddOp4(v, OP_Explain, iId, iLevel, iFrom, zMsg,P4_DYNAMIC);
119419 int iLevel, /* Which level of pWInfo->a[] should be coded */
119444 pLevel = &pWInfo->a[iLevel];
119449 bRev = (pWInfo->revMask>>iLevel)&1;
119452 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
119998 nNotReady = pWInfo->nLevel - iLevel - 1;
120096 pParse, pOrTab, &pSubWInfo->a[0], iLevel, pLevel->iFrom, 0
135798 int iLevel, /* Level of segments to scan */
135815 if( iLevel<0 && p->aIndex ){
135823 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
135825 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
135872 int iLevel, /* Level of segments to scan */
135880 assert( iLevel==FTS3_SEGCURSOR_ALL
135881 || iLevel==FTS3_SEGCURSOR_PENDING
135882 || iLevel>=0
135884 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
135890 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
143523 int iLevel /* Level of segments */
143531 return iBase + iLevel;
143555 int iLevel, /* Level to select (relative level) */
143561 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
143562 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
143565 if( iLevel<0 ){
143578 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
144079 int iLevel,
144093 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
144108 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
144109 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
144886 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
144898 sqlite3_bind_int64(pStmt, 1, iLevel);
145291 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
145308 rc = fts3WriteSegdir(p, iLevel, iIdx,
145313 rc = fts3WriteSegdir(p, iLevel, iIdx,
145470 int iLevel, /* Level of %_segdir entries to delete */
145485 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
145486 if( iLevel==FTS3_SEGCURSOR_ALL ){
145498 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
146113 int iLevel /* Level to merge */
146124 assert( iLevel==FTS3_SEGCURSOR_ALL
146125 || iLevel==FTS3_SEGCURSOR_PENDING
146126 || iLevel>=0
146128 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
146131 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
146134 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
146139 if( iLevel==FTS3_SEGCURSOR_ALL ){
146157 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
146158 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
146159 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
146181 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
146183 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
146190 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
151154 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
151935 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
151949 pInfo->iLevel = pSearch->iLevel - 1;
152083 if( pA->iLevel<pB->iLevel ) return -1;
152084 if( pA->iLevel>pB->iLevel ) return +1;
152138 u8 iLevel /* Level for the new search point */
152152 pNew->iLevel = iLevel;
152153 assert( iLevel<=RTREE_MAX_DEPTH );
152173 u8 iLevel /* Level for the new search point */
152177 pCur->anQueue[iLevel]++;
152180 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
152184 pNew = rtreeEnqueue(pCur, rScore, iLevel);
152197 pCur->sPoint.iLevel = iLevel;
152201 return rtreeEnqueue(pCur, rScore, iLevel);
152210 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
152246 p->anQueue[p->sPoint.iLevel]--;
152249 p->anQueue[p->aPoint[0].iLevel]--;
152298 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
152313 }else if( p->iLevel==1 ){
152322 x.iLevel = p->iLevel - 1;
152323 if( x.iLevel ){
152335 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
