Lines Matching refs:nLevel
140613 u8 nLevel; /* Number of nested loop */
142044 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
142799 if( pWInfo->nLevel>1 ){
142802 nNotReady = pWInfo->nLevel - iLevel - 1;
143019 if( pWInfo->nLevel>1 ){ sqlite3StackFree(db, pOrTab); }
144922 pInner = &pWInfo->a[pWInfo->nLevel-1];
146756 for(i=0; i<pWInfo->nLevel; i++){
148426 struct SrcList_item *pEnd = &pTabList->a[pWInfo->nLevel];
148921 nLoop = pWInfo->nLevel;
149201 assert( pWInfo->nLevel==nLoop );
149583 pWInfo->nLevel = nTabList;
149769 for(ii=0; ii<pWInfo->nLevel; ii++){
149805 if( pWInfo->nLevel>=2
149814 for(i=pWInfo->nLevel-1; i>=1; i--){
149844 if( i!=pWInfo->nLevel-1 ){
149845 int nByte = (pWInfo->nLevel-1-i) * sizeof(WhereLevel);
149848 pWInfo->nLevel--;
149880 assert( (wctrlFlags & WHERE_ONEPASS_DESIRED)==0 || pWInfo->nLevel==1 );
150105 for(i=pWInfo->nLevel-1; i>=0; i--){
150115 && i==pWInfo->nLevel-1 /* Ticket [ef9318757b152e3] 2017-10-21 */
150235 assert( pWInfo->nLevel<=pTabList->nSrc );
150236 for(i=0, pLevel=pWInfo->a; i<pWInfo->nLevel; i++, pLevel++){
215789 int nLevel; /* Number of levels in this index */
216265 for(i=0; i<pStruct->nLevel; i++){
216297 int nLevel = 0;
216308 i += fts5GetVarint32(&pData[i], nLevel);
216310 if( nLevel>FTS5_MAX_SEGMENT || nLevel<0
216317 sizeof(Fts5StructureLevel) * (nLevel-1) /* aLevel[] array */
216323 pRet->nLevel = nLevel;
216327 for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
216361 if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT;
216382 int nLevel = pStruct->nLevel;
216385 sizeof(Fts5StructureLevel) * (nLevel+1) /* aLevel[] array */
216390 memset(&pStruct->aLevel[nLevel], 0, sizeof(Fts5StructureLevel));
216391 pStruct->nLevel++;
216502 assert_nc( p->pStruct->nLevel==pTest->nLevel );
216503 for(i=0; i<pTest->nLevel; i++){
216542 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
216585 fts5BufferSafeAppendVarint(&buf, pStruct->nLevel);
216590 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
216643 for(il=iPromote+1; il<pStruct->nLevel; il++){
218871 Fts5StructureLevel *pEnd = &pStruct->aLevel[pStruct->nLevel];
219038 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
219053 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
219682 assert( iLvl<pStruct->nLevel );
219701 if( iLvl==pStruct->nLevel-1 ){
219722 bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
219826 assert( pStruct->nLevel>0 );
219827 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
219844 for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){
219885 nRem = (int)(p->nWorkUnit * nWork * pStruct->nLevel);
219899 assert( p->rc!=SQLITE_OK || pStruct->nLevel>0 );
219902 assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
220078 if( pStruct->nLevel==0 ){
220130 for(i=0; i<pStruct->nLevel; i++){
220139 nByte += (pStruct->nLevel+1) * sizeof(Fts5StructureLevel);
220145 pNew->nLevel = pStruct->nLevel+1;
220148 pLvl = &pNew->aLevel[pStruct->nLevel];
220156 for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
220218 if( pStruct && pStruct->nLevel ){
221534 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
221649 for(iLvl=0; iLvl<p->nLevel; iLvl++){