Lines Matching defs:nTo
161339 int nTo, nFrom; /* Number of valid entries in aTo[] and aFrom[] */
161341 WherePath *aTo; /* The nTo best paths at the current level */
161417 nTo = 0;
161492 for(jj=0, pTo=aTo; jj<nTo; jj++, pTo++){
161496 testcase( jj==nTo-1 );
161500 if( jj>=nTo ){
161502 if( nTo>=mxChoice
161519 if( nTo<mxChoice ){
161521 jj = nTo++;
161589 if( nTo>=mxChoice ){
161609 for(ii=0, pTo=aTo; ii<nTo; ii++, pTo++){
161626 nFrom = nTo;