• Home
  • Raw
  • Download

Lines Matching refs:nLevel

140741   u8 nLevel;                /* Number of nested loop */
142172 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
142927 if( pWInfo->nLevel>1 ){
142930 nNotReady = pWInfo->nLevel - iLevel - 1;
143147 if( pWInfo->nLevel>1 ){ sqlite3StackFree(db, pOrTab); }
145050 pInner = &pWInfo->a[pWInfo->nLevel-1];
146884 for(i=0; i<pWInfo->nLevel; i++){
148554 struct SrcList_item *pEnd = &pTabList->a[pWInfo->nLevel];
149049 nLoop = pWInfo->nLevel;
149329 assert( pWInfo->nLevel==nLoop );
149711 pWInfo->nLevel = nTabList;
149897 for(ii=0; ii<pWInfo->nLevel; ii++){
149933 if( pWInfo->nLevel>=2
149942 for(i=pWInfo->nLevel-1; i>=1; i--){
149972 if( i!=pWInfo->nLevel-1 ){
149973 int nByte = (pWInfo->nLevel-1-i) * sizeof(WhereLevel);
149976 pWInfo->nLevel--;
150008 assert( (wctrlFlags & WHERE_ONEPASS_DESIRED)==0 || pWInfo->nLevel==1 );
150233 for(i=pWInfo->nLevel-1; i>=0; i--){
150243 && i==pWInfo->nLevel-1 /* Ticket [ef9318757b152e3] 2017-10-21 */
150363 assert( pWInfo->nLevel<=pTabList->nSrc );
150364 for(i=0, pLevel=pWInfo->a; i<pWInfo->nLevel; i++, pLevel++){
215920 int nLevel; /* Number of levels in this index */
216396 for(i=0; i<pStruct->nLevel; i++){
216428 int nLevel = 0;
216439 i += fts5GetVarint32(&pData[i], nLevel);
216441 if( nLevel>FTS5_MAX_SEGMENT || nLevel<0
216448 sizeof(Fts5StructureLevel) * (nLevel-1) /* aLevel[] array */
216454 pRet->nLevel = nLevel;
216458 for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
216492 if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT;
216513 int nLevel = pStruct->nLevel;
216516 sizeof(Fts5StructureLevel) * (nLevel+1) /* aLevel[] array */
216521 memset(&pStruct->aLevel[nLevel], 0, sizeof(Fts5StructureLevel));
216522 pStruct->nLevel++;
216633 assert_nc( p->pStruct->nLevel==pTest->nLevel );
216634 for(i=0; i<pTest->nLevel; i++){
216673 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
216716 fts5BufferSafeAppendVarint(&buf, pStruct->nLevel);
216721 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
216774 for(il=iPromote+1; il<pStruct->nLevel; il++){
219002 Fts5StructureLevel *pEnd = &pStruct->aLevel[pStruct->nLevel];
219169 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
219184 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
219813 assert( iLvl<pStruct->nLevel );
219832 if( iLvl==pStruct->nLevel-1 ){
219853 bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
219957 assert( pStruct->nLevel>0 );
219958 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
219975 for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){
220016 nRem = (int)(p->nWorkUnit * nWork * pStruct->nLevel);
220030 assert( p->rc!=SQLITE_OK || pStruct->nLevel>0 );
220033 assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
220209 if( pStruct->nLevel==0 ){
220261 for(i=0; i<pStruct->nLevel; i++){
220270 nByte += (pStruct->nLevel+1) * sizeof(Fts5StructureLevel);
220276 pNew->nLevel = pStruct->nLevel+1;
220279 pLvl = &pNew->aLevel[pStruct->nLevel];
220287 for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
220349 if( pStruct && pStruct->nLevel ){
221665 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
221780 for(iLvl=0; iLvl<p->nLevel; iLvl++){