Searched refs:nLvl (Results 1 – 4 of 4) sorted by relevance
2458 int nLvl; /* Number of entries in aLvl[] array */ member2579 if( iNew>=pCur->nLvl ){ in fsdirNext()2584 memset(&aNew[pCur->nLvl], 0, sizeof(FsdirLevel)*(nNew-pCur->nLvl)); in fsdirNext()2586 pCur->nLvl = nNew; in fsdirNext()
194822 int nLvl;195574 assert( iLvl<pIter->nLvl );195576 if( (iLvl+1) < pIter->nLvl ){195608 for(i=0; i<pIter->nLvl; i++){195623 for(i=pIter->nLvl-1; p->rc==SQLITE_OK && i>=0; i--){195694 assert( iLvl<pIter->nLvl );195696 if( (iLvl+1) < pIter->nLvl ){195724 for(i=0; i<pIter->nLvl; i++){195757 pIter->nLvl = i+1;197931 int nLvl[all …]
2464 int nLvl; /* Number of entries in aLvl[] array */ member2585 if( iNew>=pCur->nLvl ){ in fsdirNext()2590 memset(&aNew[pCur->nLvl], 0, sizeof(FsdirLevel)*(nNew-pCur->nLvl)); in fsdirNext()2592 pCur->nLvl = nNew; in fsdirNext()
194850 int nLvl;195602 assert( iLvl<pIter->nLvl );195604 if( (iLvl+1) < pIter->nLvl ){195636 for(i=0; i<pIter->nLvl; i++){195651 for(i=pIter->nLvl-1; p->rc==SQLITE_OK && i>=0; i--){195722 assert( iLvl<pIter->nLvl );195724 if( (iLvl+1) < pIter->nLvl ){195752 for(i=0; i<pIter->nLvl; i++){195785 pIter->nLvl = i+1;197959 int nLvl[all …]