Lines Matching refs:nTo
4789 int nTo, nFrom; /* Number of valid entries in aTo[] and aFrom[] */ in wherePathSolver() local
4867 nTo = 0; in wherePathSolver()
4942 for(jj=0, pTo=aTo; jj<nTo; jj++, pTo++){ in wherePathSolver()
4946 testcase( jj==nTo-1 ); in wherePathSolver()
4950 if( jj>=nTo ){ in wherePathSolver()
4952 if( nTo>=mxChoice in wherePathSolver()
4969 if( nTo<mxChoice ){ in wherePathSolver()
4971 jj = nTo++; in wherePathSolver()
5039 if( nTo>=mxChoice ){ in wherePathSolver()
5059 for(ii=0, pTo=aTo; ii<nTo; ii++, pTo++){ in wherePathSolver()
5076 nFrom = nTo; in wherePathSolver()