385   struct state **sorted;   /* Table of states sorted by state number */  member
1089     stp = lemp->sorted[i];  in FindLinks()
1098     stp = lemp->sorted[i];  in FindLinks()
1122     assert( lemp->sorted[i]!=0 );  in FindFollowSets()
1123     for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){  in FindFollowSets()
1131       assert( lemp->sorted[i]!=0 );  in FindFollowSets()
1132       for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){  in FindFollowSets()
1164     stp = lemp->sorted[i];  in FindActions()
1195   Action_add(&lemp->sorted[0]->ap,ACCEPT,sp,0);  in FindActions()
1200     stp = lemp->sorted[i];  in FindActions()
1216     for(ap=lemp->sorted[i]->ap; ap; ap=ap->next){  in FindActions()
1748     lem.sorted = State_arrayof();  in main()
3432     stp = lemp->sorted[i];  in ReportOutput()
4520     stp = lemp->sorted[i];  in ReportTable()
4579     for(ap=lemp->sorted[i]->ap; ap; ap=ap->next){  in ReportTable()
4673   while( n>0 && lemp->sorted[n-1]->iTknOfst==NO_OFFSET ) n--;  in ReportTable()
4683     stp = lemp->sorted[i];  in ReportTable()
4699   while( n>0 && lemp->sorted[n-1]->iNtOfst==NO_OFFSET ) n--;  in ReportTable()
4708     stp = lemp->sorted[i];  in ReportTable()
4727     stp = lemp->sorted[i];  in ReportTable()
4998     stp = lemp->sorted[i];  in CompressTables()
5057     stp = lemp->sorted[i];  in CompressTables()
5076     stp = lemp->sorted[i];  in CompressTables()
5135     stp = lemp->sorted[i];  in ResortStates()
5154   qsort(&lemp->sorted[1], lemp->nstate-1, sizeof(lemp->sorted[0]),  in ResortStates()
5157     lemp->sorted[i]->statenum = i;  in ResortStates()
5160   while( lemp->nxstate>1 && lemp->sorted[lemp->nxstate-1]->autoReduce ){  in ResortStates()