1715   u32 iSub = 0;                   /* Index into aSub array */  in walMergesort()  local
1725     for(iSub=0; iList & (1<<iSub); iSub++){  in walMergesort()
1727       assert( iSub<ArraySize(aSub) );  in walMergesort()
1728       p = &aSub[iSub];  in walMergesort()
1729       assert( p->aList && p->nList<=(1<<iSub) );  in walMergesort()
1730       assert( p->aList==&aList[iList&~((2<<iSub)-1)] );  in walMergesort()
1733     aSub[iSub].aList = aMerge;  in walMergesort()
1734     aSub[iSub].nList = nMerge;  in walMergesort()
1737   for(iSub++; iSub<ArraySize(aSub); iSub++){  in walMergesort()
1738     if( nList & (1<<iSub) ){  in walMergesort()
1740       assert( iSub<ArraySize(aSub) );  in walMergesort()
1741       p = &aSub[iSub];  in walMergesort()
1742       assert( p->nList<=(1<<iSub) );  in walMergesort()
1743       assert( p->aList==&aList[nList&~((2<<iSub)-1)] );  in walMergesort()