Lines Matching refs:iLevel

8717   int iLevel;                       /* Level of current node or entry */  member
15509 int iLevel; /* Nesting level */ member
15908 int iLevel; /* Which level of the tree we are on */ member
25787 p->iLevel++;
25790 if( p->iLevel<sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow;
25799 p->iLevel--;
25800 if( p->iLevel<0 ) sqlite3_free(p);
25814 for(i=0; i<p->iLevel && i<sizeof(p->bLine)-1; i++){
70547 if( x->iLevel>pParse->iCacheLevel || x->iReg==0 ) continue;
91874 p->iLevel = pParse->iCacheLevel;
91897 p->iLevel = pParse->iCacheLevel;
91953 if( p->iReg && p->iLevel>pParse->iCacheLevel ){
111638 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK;
111639 if( iLevel==0 ) iLevel = 1;
111640 pDb->safety_level = iLevel;
123431 int iLevel, /* Value for "level" column of output */
123450 int iLevel, /* Which level of pWInfo->a[] should be coded */
123610 int iLevel, /* Value for "level" column of output */
123702 ret = sqlite3VdbeAddOp4(v, OP_Explain, iId, iLevel, iFrom, zMsg,P4_DYNAMIC);
124379 int iLevel, /* Which level of pWInfo->a[] should be coded */
124404 pLevel = &pWInfo->a[iLevel];
124409 bRev = (pWInfo->revMask>>iLevel)&1;
124412 VdbeModuleComment((v, "Begin WHERE-loop%d: %s",iLevel,pTabItem->pTab->zName));
125019 nNotReady = pWInfo->nLevel - iLevel - 1;
125116 pParse, pOrTab, &pSubWInfo->a[0], iLevel, pLevel->iFrom, 0
144599 int iLevel, /* Level of segments to scan */
144616 if( iLevel<0 && p->aIndex ){
144624 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
144626 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt);
144673 int iLevel, /* Level of segments to scan */
144681 assert( iLevel==FTS3_SEGCURSOR_ALL
144682 || iLevel==FTS3_SEGCURSOR_PENDING
144683 || iLevel>=0
144685 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
144691 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr
152399 int iLevel /* Level of segments */
152407 return iBase + iLevel;
152431 int iLevel, /* Level to select (relative level) */
152437 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 );
152438 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
152441 if( iLevel<0 ){
152454 sqlite3_bind_int64(pStmt, 1, getAbsoluteLevel(p, iLangid, iIndex,iLevel));
152960 int iLevel,
152974 pNextIdx, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
152989 fts3LogMerge(16, getAbsoluteLevel(p, iLangid, iIndex, iLevel));
152990 rc = fts3SegmentMerge(p, iLangid, iIndex, iLevel);
153774 sqlite3_int64 iLevel, /* Value for "level" field (absolute level) */
153786 sqlite3_bind_int64(pStmt, 1, iLevel);
154179 sqlite3_int64 iLevel, /* Value for 'level' column of %_segdir */
154196 rc = fts3WriteSegdir(p, iLevel, iIdx,
154201 rc = fts3WriteSegdir(p, iLevel, iIdx,
154358 int iLevel, /* Level of %_segdir entries to delete */
154373 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL );
154374 if( iLevel==FTS3_SEGCURSOR_ALL ){
154386 pDelete, 1, getAbsoluteLevel(p, iLangid, iIndex, iLevel)
155001 int iLevel /* Level to merge */
155012 assert( iLevel==FTS3_SEGCURSOR_ALL
155013 || iLevel==FTS3_SEGCURSOR_PENDING
155014 || iLevel>=0
155016 assert( iLevel<FTS3_SEGDIR_MAXLEVEL );
155019 rc = sqlite3Fts3SegReaderCursor(p, iLangid, iIndex, iLevel, 0, 0, 1, 0, &csr);
155022 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
155027 if( iLevel==FTS3_SEGCURSOR_ALL ){
155045 iNewLevel = getAbsoluteLevel(p, iLangid, iIndex, iLevel+1);
155046 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
155047 bIgnoreEmpty = (iLevel!=FTS3_SEGCURSOR_PENDING) && (iNewLevel>iMaxLevel);
155069 if( iLevel!=FTS3_SEGCURSOR_PENDING ){
155071 p, iLangid, iIndex, iLevel, csr.apSegment, csr.nSegment
155078 if( iLevel==FTS3_SEGCURSOR_PENDING || iNewLevel<iMaxLevel ){
160172 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */
160954 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){
160968 pInfo->iLevel = pSearch->iLevel - 1;
161102 if( pA->iLevel<pB->iLevel ) return -1;
161103 if( pA->iLevel>pB->iLevel ) return +1;
161157 u8 iLevel /* Level for the new search point */
161171 pNew->iLevel = iLevel;
161172 assert( iLevel<=RTREE_MAX_DEPTH );
161192 u8 iLevel /* Level for the new search point */
161196 pCur->anQueue[iLevel]++;
161199 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
161203 pNew = rtreeEnqueue(pCur, rScore, iLevel);
161216 pCur->sPoint.iLevel = iLevel;
161220 return rtreeEnqueue(pCur, rScore, iLevel);
161229 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
161265 p->anQueue[p->sPoint.iLevel]--;
161268 p->anQueue[p->aPoint[0].iLevel]--;
161317 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){
161332 }else if( p->iLevel==1 ){
161341 x.iLevel = p->iLevel - 1;
161342 if( x.iLevel ){
161354 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);
188306 int iLevel, /* Level to iterate (-1 for all) */
188316 assert( (pTerm==0 && nTerm==0) || iLevel<0 );
188320 if( iLevel<0 ){
188325 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment);
188341 if( iLevel<0 ){
188360 pLvl = &pStruct->aLevel[iLevel];