Searched refs:iList (Results 1 – 1 of 1) sorted by relevance
1714 int iList; /* Index into input list */ in walMergesort() local1722 for(iList=0; iList<nList; iList++){ in walMergesort()1724 aMerge = &aList[iList]; in walMergesort()1725 for(iSub=0; iList & (1<<iSub); iSub++){ in walMergesort()1730 assert( p->aList==&aList[iList&~((2<<iSub)-1)] ); in walMergesort()