Lines Matching refs:nLevel

129057   u8 nLevel;                /* Number of nested loop */
131006     if( pWInfo->nLevel>1 ){
131009       nNotReady = pWInfo->nLevel - iLevel - 1;
131215     if( pWInfo->nLevel>1 ) sqlite3StackFree(db, pOrTab);
134795   for(i=0; i<pWInfo->nLevel; i++){
136366   struct SrcList_item *pEnd = &pTabList->a[pWInfo->nLevel];
136828   nLoop = pWInfo->nLevel;
137101   assert( pWInfo->nLevel==nLoop );
137460   pWInfo->nLevel = nTabList;
137624     for(ii=0; ii<pWInfo->nLevel; ii++){
137660   if( pWInfo->nLevel>=2
137669     for(i=pWInfo->nLevel-1; i>=1; i--){
137699       if( i!=pWInfo->nLevel-1 ){
137700         int nByte = (pWInfo->nLevel-1-i) * sizeof(WhereLevel);
137703       pWInfo->nLevel--;
137729   assert( (wctrlFlags & WHERE_ONEPASS_DESIRED)==0 || pWInfo->nLevel==1 );
137927   for(i=pWInfo->nLevel-1; i>=0; i--){
137937        && i==pWInfo->nLevel-1  /* Ticket [ef9318757b152e3] 2017-10-21 */
138028   assert( pWInfo->nLevel<=pTabList->nSrc );
138029   for(i=0, pLevel=pWInfo->a; i<pWInfo->nLevel; i++, pLevel++){
194620   int nLevel;                     /* Number of levels in this index */
195104     for(i=0; i<pStruct->nLevel; i++){
195136   int nLevel = 0;
195147   i += fts5GetVarint32(&pData[i], nLevel);
195151       sizeof(Fts5StructureLevel) * (nLevel-1)    /* aLevel[] array */
195157     pRet->nLevel = nLevel;
195161     for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
195206     int nLevel = pStruct->nLevel;
195209         sizeof(Fts5StructureLevel) * (nLevel+1)  /* aLevel[] array */
195214       memset(&pStruct->aLevel[nLevel], 0, sizeof(Fts5StructureLevel));
195215       pStruct->nLevel++;
195326       assert_nc( p->pStruct->nLevel==pTest->nLevel );
195327       for(i=0; i<pTest->nLevel; i++){
195366     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
195409       fts5BufferSafeAppendVarint(&buf, pStruct->nLevel);
195414     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
195467     for(il=iPromote+1; il<pStruct->nLevel; il++){
197682       Fts5StructureLevel *pEnd = &pStruct->aLevel[pStruct->nLevel];
197849       for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
197864       for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
198477   assert( iLvl<pStruct->nLevel );
198496     if( iLvl==pStruct->nLevel-1 ){
198517   bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
198621     assert( pStruct->nLevel>0 );
198622     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
198639     for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){
198680     nRem = (int)(p->nWorkUnit * nWork * pStruct->nLevel);
198694   assert( p->rc!=SQLITE_OK || pStruct->nLevel>0 );
198697     assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
198871     if( pStruct->nLevel==0 ){
198923   for(i=0; i<pStruct->nLevel; i++){
198932   nByte += (pStruct->nLevel+1) * sizeof(Fts5StructureLevel);
198938     pNew->nLevel = pStruct->nLevel+1;
198941     pLvl = &pNew->aLevel[pStruct->nLevel];
198949       for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
199011     if( pStruct && pStruct->nLevel ){
200254     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
200369   for(iLvl=0; iLvl<p->nLevel; iLvl++){