• Home
  • Raw
  • Download

Lines Matching refs:nLevel

140757   u8 nLevel;                /* Number of nested loop */
142188 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
142943 if( pWInfo->nLevel>1 ){
142946 nNotReady = pWInfo->nLevel - iLevel - 1;
143163 if( pWInfo->nLevel>1 ){ sqlite3StackFree(db, pOrTab); }
145066 pInner = &pWInfo->a[pWInfo->nLevel-1];
146900 for(i=0; i<pWInfo->nLevel; i++){
148570 struct SrcList_item *pEnd = &pTabList->a[pWInfo->nLevel];
149065 nLoop = pWInfo->nLevel;
149345 assert( pWInfo->nLevel==nLoop );
149727 pWInfo->nLevel = nTabList;
149913 for(ii=0; ii<pWInfo->nLevel; ii++){
149949 if( pWInfo->nLevel>=2
149958 for(i=pWInfo->nLevel-1; i>=1; i--){
149988 if( i!=pWInfo->nLevel-1 ){
149989 int nByte = (pWInfo->nLevel-1-i) * sizeof(WhereLevel);
149992 pWInfo->nLevel--;
150024 assert( (wctrlFlags & WHERE_ONEPASS_DESIRED)==0 || pWInfo->nLevel==1 );
150249 for(i=pWInfo->nLevel-1; i>=0; i--){
150259 && i==pWInfo->nLevel-1 /* Ticket [ef9318757b152e3] 2017-10-21 */
150379 assert( pWInfo->nLevel<=pTabList->nSrc );
150380 for(i=0, pLevel=pWInfo->a; i<pWInfo->nLevel; i++, pLevel++){
215948 int nLevel; /* Number of levels in this index */
216424 for(i=0; i<pStruct->nLevel; i++){
216456 int nLevel = 0;
216467 i += fts5GetVarint32(&pData[i], nLevel);
216469 if( nLevel>FTS5_MAX_SEGMENT || nLevel<0
216476 sizeof(Fts5StructureLevel) * (nLevel-1) /* aLevel[] array */
216482 pRet->nLevel = nLevel;
216486 for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
216520 if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT;
216541 int nLevel = pStruct->nLevel;
216544 sizeof(Fts5StructureLevel) * (nLevel+1) /* aLevel[] array */
216549 memset(&pStruct->aLevel[nLevel], 0, sizeof(Fts5StructureLevel));
216550 pStruct->nLevel++;
216661 assert_nc( p->pStruct->nLevel==pTest->nLevel );
216662 for(i=0; i<pTest->nLevel; i++){
216701 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
216744 fts5BufferSafeAppendVarint(&buf, pStruct->nLevel);
216749 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
216802 for(il=iPromote+1; il<pStruct->nLevel; il++){
219030 Fts5StructureLevel *pEnd = &pStruct->aLevel[pStruct->nLevel];
219197 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
219212 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
219841 assert( iLvl<pStruct->nLevel );
219860 if( iLvl==pStruct->nLevel-1 ){
219881 bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
219985 assert( pStruct->nLevel>0 );
219986 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
220003 for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){
220044 nRem = (int)(p->nWorkUnit * nWork * pStruct->nLevel);
220058 assert( p->rc!=SQLITE_OK || pStruct->nLevel>0 );
220061 assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
220237 if( pStruct->nLevel==0 ){
220289 for(i=0; i<pStruct->nLevel; i++){
220298 nByte += (pStruct->nLevel+1) * sizeof(Fts5StructureLevel);
220304 pNew->nLevel = pStruct->nLevel+1;
220307 pLvl = &pNew->aLevel[pStruct->nLevel];
220315 for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
220377 if( pStruct && pStruct->nLevel ){
221693 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
221808 for(iLvl=0; iLvl<p->nLevel; iLvl++){