Lines Matching refs:nLevel
143773 u8 nLevel; /* Number of nested loop */
145216 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
145982 if( pWInfo->nLevel>1 ){
145985 nNotReady = pWInfo->nLevel - iLevel - 1;
146204 if( pWInfo->nLevel>1 ){ sqlite3StackFree(db, pOrTab); }
148393 pInner = &pWInfo->a[pWInfo->nLevel-1];
148414 for(i=pWInfo->nLevel-1; i>=0; i--){
150264 for(i=0; i<pWInfo->nLevel; i++){
151953 SrcItem *pEnd = &pTabList->a[pWInfo->nLevel];
152461 nLoop = pWInfo->nLevel;
152741 assert( pWInfo->nLevel==nLoop );
153128 pWInfo->nLevel = nTabList;
153314 for(ii=0; ii<pWInfo->nLevel; ii++){
153350 if( pWInfo->nLevel>=2
153359 for(i=pWInfo->nLevel-1; i>=1; i--){
153389 if( i!=pWInfo->nLevel-1 ){
153390 int nByte = (pWInfo->nLevel-1-i) * sizeof(WhereLevel);
153393 pWInfo->nLevel--;
153425 assert( (wctrlFlags & WHERE_ONEPASS_DESIRED)==0 || pWInfo->nLevel==1 );
153653 for(i=pWInfo->nLevel-1; i>=0; i--){
153663 && i==pWInfo->nLevel-1 /* Ticket [ef9318757b152e3] 2017-10-21 */
153783 assert( pWInfo->nLevel<=pTabList->nSrc );
153784 for(i=0, pLevel=pWInfo->a; i<pWInfo->nLevel; i++, pLevel++){
220133 int nLevel; /* Number of levels in this index */
220609 for(i=0; i<pStruct->nLevel; i++){
220641 int nLevel = 0;
220652 i += fts5GetVarint32(&pData[i], nLevel);
220654 if( nLevel>FTS5_MAX_SEGMENT || nLevel<0
220661 sizeof(Fts5StructureLevel) * (nLevel-1) /* aLevel[] array */
220667 pRet->nLevel = nLevel;
220671 for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
220705 if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT;
220726 int nLevel = pStruct->nLevel;
220729 sizeof(Fts5StructureLevel) * (nLevel+1) /* aLevel[] array */
220734 memset(&pStruct->aLevel[nLevel], 0, sizeof(Fts5StructureLevel));
220735 pStruct->nLevel++;
220846 assert_nc( p->pStruct->nLevel==pTest->nLevel );
220847 for(i=0; i<pTest->nLevel; i++){
220886 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
220929 fts5BufferSafeAppendVarint(&buf, pStruct->nLevel);
220934 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
220987 for(il=iPromote+1; il<pStruct->nLevel; il++){
223213 Fts5StructureLevel *pEnd = &pStruct->aLevel[pStruct->nLevel];
223380 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
223395 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
224024 assert( iLvl<pStruct->nLevel );
224043 if( iLvl==pStruct->nLevel-1 ){
224064 bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
224168 assert( pStruct->nLevel>0 );
224169 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
224186 for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){
224227 nRem = (int)(p->nWorkUnit * nWork * pStruct->nLevel);
224241 assert( p->rc!=SQLITE_OK || pStruct->nLevel>0 );
224244 assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
224420 if( pStruct->nLevel==0 ){
224472 for(i=0; i<pStruct->nLevel; i++){
224481 nByte += (pStruct->nLevel+1) * sizeof(Fts5StructureLevel);
224487 pNew->nLevel = pStruct->nLevel+1;
224490 pLvl = &pNew->aLevel[pStruct->nLevel];
224498 for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
224560 if( pStruct && pStruct->nLevel ){
225957 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
226073 for(iLvl=0; iLvl<p->nLevel; iLvl++){