Lines Matching defs:nAction

405   int nAction;                 /* Number of used slots in aAction[] */
420 #define acttab_size(X) ((X)->nAction)
490   if( p->nAction + n >= p->nActionAlloc ){
492     p->nActionAlloc = p->nAction + n + p->nActionAlloc + 20;
508   ** i reaches p->nAction, which means we append the new transaction set.
512   for(i=0; i<p->nAction+p->mnLookahead; i++){
520       for(j=0; j<p->nAction; j++){
523       if( j==p->nAction ){
530         if( k<0 || k>=p->nAction ) break;
536       for(j=0; j<p->nAction; j++){
549     if( k>=p->nAction ) p->nAction = k+1;
3146   int nAction;         /* Number of actions */
3155   return p2->nAction - p1->nAction;
3299     ax[i*2].nAction = stp->nTknAct;
3302     ax[i*2+1].nAction = stp->nNtAct;
3313   for(i=0; i<lemp->nstate*2 && ax[i].nAction>0; i++){