592   int nAction;                 /* Number of used slots in aAction[] */  member
607 #define acttab_lookahead_size(X) ((X)->nAction)
690   if( p->nAction + n >= p->nActionAlloc ){  in acttab_insert()
692     p->nActionAlloc = p->nAction + n + p->nActionAlloc + 20;  in acttab_insert()
712   for(i=p->nAction-1; i>=end; i--){  in acttab_insert()
719         if( k<0 || k>=p->nAction ) break;  in acttab_insert()
728       for(j=0; j<p->nAction; j++){  in acttab_insert()
756         for(j=0; j<p->nAction; j++){  in acttab_insert()
759         if( j==p->nAction ){  in acttab_insert()
776     if( k>=p->nAction ) p->nAction = k+1;  in acttab_insert()
778   if( makeItSafe && i+p->nterminal>=p->nAction ) p->nAction = i+p->nterminal+1;  in acttab_insert()
791   int n = p->nAction;  in acttab_action_size()
4247   int nAction;         /* Number of actions */  member
4258   c = p2->nAction - p1->nAction;  in axset_compare()
4523     ax[i*2].nAction = stp->nTknAct;  in ReportTable()
4526     ax[i*2+1].nAction = stp->nNtAct;  in ReportTable()
4535   for(i=0; i<lemp->nxstate*2 && ax[i].nAction>0; i++){  in ReportTable()
4563       for(jj=nn=0; jj<pActtab->nAction; jj++){  in ReportTable()
4568              ax[i].nAction, pActtab->nAction, nn);  in ReportTable()