Lines Matching refs:nLevel
151377 ** WhereInfo.a[WhereInfo.nLevel-1] being the inner loop.
151783 u8 nLevel; /* Number of nested loop */
153196 while( ++iLevel < pWInfo->nLevel ){
153278 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
154081 if( pWInfo->nLevel>1 ){
154084 nNotReady = pWInfo->nLevel - iLevel - 1;
154338 if( pWInfo->nLevel>1 ){ sqlite3DbFreeNN(db, pOrTab); }
156653 pInner = &pWInfo->a[pWInfo->nLevel-1];
156674 for(i=pWInfo->nLevel-1; i>=0; i--){
157688 while( ++iLevel < pWInfo->nLevel ){
157706 }while( iLevel < pWInfo->nLevel );
160812 SrcItem *pEnd = &pTabList->a[pWInfo->nLevel];
161351 nLoop = pWInfo->nLevel;
161640 assert( pWInfo->nLevel==nLoop );
161905 assert( pWInfo->nLevel>=2 );
161917 for(i=pWInfo->nLevel-1; i>=1; i--){
161948 if( i!=pWInfo->nLevel-1 ){
161949 int nByte = (pWInfo->nLevel-1-i) * sizeof(WhereLevel);
161952 pWInfo->nLevel--;
161953 assert( pWInfo->nLevel>0 );
161982 assert( pWInfo->nLevel>=2 );
161985 for(i=1; i<pWInfo->nLevel; i++){
162251 pWInfo->nLevel = nTabList;
162452 for(ii=0; ii<pWInfo->nLevel; ii++){
162469 if( pWInfo->nLevel>=2
162475 nTabList = pWInfo->nLevel;
162482 if( pWInfo->nLevel>=2
162516 assert( (wctrlFlags & WHERE_ONEPASS_DESIRED)==0 || pWInfo->nLevel==1 );
162819 for(i=pWInfo->nLevel-1; i>=0; i--){
162840 && i==pWInfo->nLevel-1 /* Ticket [ef9318757b152e3] 2017-10-21 */
162972 assert( pWInfo->nLevel<=pTabList->nSrc );
162973 for(i=0, pLevel=pWInfo->a; i<pWInfo->nLevel; i++, pLevel++){
230342 int nLevel; /* Number of levels in this index */
230343 Fts5StructureLevel aLevel[1]; /* Array of nLevel level objects */
230822 for(i=0; i<pStruct->nLevel; i++){
230858 i64 nByte = sizeof(Fts5Structure)+(p->nLevel-1)*sizeof(Fts5StructureLevel);
230864 for(i=0; i<p->nLevel; i++) pNew->aLevel[i].aSeg = 0;
230865 for(i=0; i<p->nLevel; i++){
230870 for(i=0; i<p->nLevel; i++){
230906 int nLevel = 0;
230917 i += fts5GetVarint32(&pData[i], nLevel);
230919 if( nLevel>FTS5_MAX_SEGMENT || nLevel<0
230926 sizeof(Fts5StructureLevel) * (nLevel-1) /* aLevel[] array */
230932 pRet->nLevel = nLevel;
230936 for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
230970 if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT;
230993 int nLevel = pStruct->nLevel;
230996 sizeof(Fts5StructureLevel) * (nLevel+1) /* aLevel[] array */
231001 memset(&pStruct->aLevel[nLevel], 0, sizeof(Fts5StructureLevel));
231002 pStruct->nLevel++;
231113 assert_nc( p->pStruct->nLevel==pTest->nLevel );
231114 for(i=0; i<pTest->nLevel; i++){
231153 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
231196 fts5BufferSafeAppendVarint(&buf, pStruct->nLevel);
231201 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
231254 for(il=iPromote+1; il<pStruct->nLevel; il++){
233494 Fts5StructureLevel *pEnd = &pStruct->aLevel[pStruct->nLevel];
233666 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
233681 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
234312 assert( iLvl<pStruct->nLevel );
234331 if( iLvl==pStruct->nLevel-1 ){
234352 bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
234457 assert( pStruct->nLevel>0 );
234458 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
234475 for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){
234516 nRem = (int)(p->nWorkUnit * nWork * pStruct->nLevel);
234530 assert( p->rc!=SQLITE_OK || pStruct->nLevel>0 );
234533 assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
234709 if( pStruct->nLevel==0 ){
234761 for(i=0; i<pStruct->nLevel; i++){
234770 nByte += (pStruct->nLevel+1) * sizeof(Fts5StructureLevel);
234776 pNew->nLevel = pStruct->nLevel+1;
234779 pLvl = &pNew->aLevel[pStruct->nLevel];
234787 for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
234849 if( pStruct && pStruct->nLevel ){
236254 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
236375 for(iLvl=0; iLvl<p->nLevel; iLvl++){