4791   WherePath *aTo;           /* The nTo best paths at the current level */  in wherePathSolver()  local
4825   aTo = (WherePath*)pSpace;  in wherePathSolver()
4826   aFrom = aTo+mxChoice;  in wherePathSolver()
4829   for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){  in wherePathSolver()
4942         for(jj=0, pTo=aTo; jj<nTo; jj++, pTo++){  in wherePathSolver()
4976           pTo = &aTo[jj];  in wherePathSolver()
5041           mxCost = aTo[0].rCost;  in wherePathSolver()
5042           mxUnsorted = aTo[0].nRow;  in wherePathSolver()
5043           for(jj=1, pTo=&aTo[1]; jj<mxChoice; jj++, pTo++){  in wherePathSolver()
5059       for(ii=0, pTo=aTo; ii<nTo; ii++, pTo++){  in wherePathSolver()
5073     pFrom = aTo;  in wherePathSolver()
5074     aTo = aFrom;  in wherePathSolver()