166 struct action;
168 static struct action *Action_new(void);
169 static struct action *Action_sort(struct action *);
344 struct action {  struct
352   struct action *next;     /* Next action for this state */  argument
353   struct action *collide;  /* Next action with the same hash */  argument
362   struct action *ap;       /* List of actions for this state */
490 static struct action *Action_new(void){  in Action_new()
491   static struct action *actionfreelist = 0;  in Action_new()
492   struct action *newaction;  in Action_new()
497     actionfreelist = (struct action *)calloc(amt, sizeof(struct action));  in Action_new()
515   struct action *ap1,  in actioncmp()
516   struct action *ap2  in actioncmp()
533 static struct action *Action_sort(  in Action_sort()
534   struct action *ap  in Action_sort()
536   ap = (struct action *)msort((char *)ap,(char **)&ap->next,  in Action_sort()
542   struct action **app,  in Action_add()
547   struct action *newaction;  in Action_add()
587   int action;                /* Action to take on the given lookahead */  member
609 #define acttab_yyaction(X,N)  ((X)->aAction[N].action)
639 void acttab_action(acttab *p, int lookahead, int action){  in acttab_action()  argument
652     p->mnAction = action;  in acttab_action()
657       p->mnAction = action;  in acttab_action()
661   p->aLookahead[p->nLookahead].action = action;  in acttab_action()
700       p->aAction[i].action = -1;  in acttab_insert()
715       if( p->aAction[i].action!=p->mnAction ) continue;  in acttab_insert()
720         if( p->aLookahead[j].action!=p->aAction[k].action ) break;  in acttab_insert()
1146 static int resolve_conflict(struct action *,struct action *);
1198     struct action *ap, *nap;  in FindActions()
1214     struct action *ap;  in FindActions()
1240   struct action *apx,  in resolve_conflict()
1241   struct action *apy  in resolve_conflict()
3354   struct action *ap,          /* The action to print */  in PrintAction()
3424   struct action *ap;  in ReportOutput()
3568 PRIVATE int compute_action(struct lemon *lemp, struct action *ap)  in compute_action()
4296   struct action *ap;  in ReportTable()
4539         int action;  in ReportTable()  local
4541         action = compute_action(lemp, ap);  in ReportTable()
4542         if( action<0 ) continue;  in ReportTable()
4543         acttab_action(pActtab, ap->sp->index, action);  in ReportTable()
4550         int action;  in ReportTable()  local
4553         action = compute_action(lemp, ap);  in ReportTable()
4554         if( action<0 ) continue;  in ReportTable()
4555         acttab_action(pActtab, ap->sp->index, action);  in ReportTable()
4564         if( pActtab->aAction[jj].action<0 ) nn++;  in ReportTable()
4624     int action = acttab_yyaction(pActtab, i);  in ReportTable()  local
4625     if( action<0 ) action = lemp->noAction;  in ReportTable()
4627     fprintf(out, " %4d,", action);  in ReportTable()
4991   struct action *ap, *ap2, *nextap;  in CompressTables()
5132   struct action *ap;  in ResortStates()