Lines Matching refs:nLevel

136112   u8 nLevel;                /* Number of nested loop */
138124     if( pWInfo->nLevel>1 ){
138127       nNotReady = pWInfo->nLevel - iLevel - 1;
138344     if( pWInfo->nLevel>1 ) sqlite3StackFree(db, pOrTab);
140218   pInner = &pWInfo->a[pWInfo->nLevel-1];
142046   for(i=0; i<pWInfo->nLevel; i++){
143667   struct SrcList_item *pEnd = &pTabList->a[pWInfo->nLevel];
144139   nLoop = pWInfo->nLevel;
144419   assert( pWInfo->nLevel==nLoop );
144779   pWInfo->nLevel = nTabList;
144945     for(ii=0; ii<pWInfo->nLevel; ii++){
144981   if( pWInfo->nLevel>=2
144990     for(i=pWInfo->nLevel-1; i>=1; i--){
145020       if( i!=pWInfo->nLevel-1 ){
145021         int nByte = (pWInfo->nLevel-1-i) * sizeof(WhereLevel);
145024       pWInfo->nLevel--;
145050   assert( (wctrlFlags & WHERE_ONEPASS_DESIRED)==0 || pWInfo->nLevel==1 );
145268   for(i=pWInfo->nLevel-1; i>=0; i--){
145278        && i==pWInfo->nLevel-1  /* Ticket [ef9318757b152e3] 2017-10-21 */
145376   assert( pWInfo->nLevel<=pTabList->nSrc );
145377   for(i=0, pLevel=pWInfo->a; i<pWInfo->nLevel; i++, pLevel++){
209482   int nLevel;                     /* Number of levels in this index */
209957     for(i=0; i<pStruct->nLevel; i++){
209989   int nLevel = 0;
210000   i += fts5GetVarint32(&pData[i], nLevel);
210002   if( nLevel>FTS5_MAX_SEGMENT   || nLevel<0
210009       sizeof(Fts5StructureLevel) * (nLevel-1)    /* aLevel[] array */
210015     pRet->nLevel = nLevel;
210019     for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
210053         if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT;
210074     int nLevel = pStruct->nLevel;
210077         sizeof(Fts5StructureLevel) * (nLevel+1)  /* aLevel[] array */
210082       memset(&pStruct->aLevel[nLevel], 0, sizeof(Fts5StructureLevel));
210083       pStruct->nLevel++;
210194       assert_nc( p->pStruct->nLevel==pTest->nLevel );
210195       for(i=0; i<pTest->nLevel; i++){
210234     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
210277       fts5BufferSafeAppendVarint(&buf, pStruct->nLevel);
210282     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
210335     for(il=iPromote+1; il<pStruct->nLevel; il++){
212563       Fts5StructureLevel *pEnd = &pStruct->aLevel[pStruct->nLevel];
212730       for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
212745       for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
213374   assert( iLvl<pStruct->nLevel );
213393     if( iLvl==pStruct->nLevel-1 ){
213414   bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
213518     assert( pStruct->nLevel>0 );
213519     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
213536     for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){
213577     nRem = (int)(p->nWorkUnit * nWork * pStruct->nLevel);
213591   assert( p->rc!=SQLITE_OK || pStruct->nLevel>0 );
213594     assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
213770     if( pStruct->nLevel==0 ){
213822   for(i=0; i<pStruct->nLevel; i++){
213831   nByte += (pStruct->nLevel+1) * sizeof(Fts5StructureLevel);
213837     pNew->nLevel = pStruct->nLevel+1;
213840     pLvl = &pNew->aLevel[pStruct->nLevel];
213848       for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
213910     if( pStruct && pStruct->nLevel ){
215166     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
215281   for(iLvl=0; iLvl<p->nLevel; iLvl++){