1707     int nList;                    /* Number of elements in aList */  in walMergesort()  member
1711   const int nList = *pnList;      /* Size of input list */  in walMergesort()  local
1719   assert( nList<=HASHTABLE_NPAGE && nList>0 );  in walMergesort()
1722   for(iList=0; iList<nList; iList++){  in walMergesort()
1729       assert( p->aList && p->nList<=(1<<iSub) );  in walMergesort()
1731       walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);  in walMergesort()
1734     aSub[iSub].nList = nMerge;  in walMergesort()
1738     if( nList & (1<<iSub) ){  in walMergesort()
1742       assert( p->nList<=(1<<iSub) );  in walMergesort()
1743       assert( p->aList==&aList[nList&~((2<<iSub)-1)] );  in walMergesort()
1744       walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);  in walMergesort()