Lines Matching refs:aLookahead
459 ** into aLookahead[] using multiple calls to acttab_action(). Then the
462 ** also resets the aLookahead[] array in preparation for the next
475 *aLookahead; /* A single new transaction set */
476 int mnLookahead; /* Minimum aLookahead[].lookahead */
478 int mxLookahead; /* Maximum aLookahead[].lookahead */
479 int nLookahead; /* Used slots in aLookahead[] */
480 int nLookaheadAlloc; /* Slots allocated in aLookahead[] */
495 free( p->aLookahead );
518 p->aLookahead = (struct lookahead_action *) realloc( p->aLookahead,
519 sizeof(p->aLookahead[0])*p->nLookaheadAlloc );
520 if( p->aLookahead==0 ){
536 p->aLookahead[p->nLookahead].lookahead = lookahead;
537 p->aLookahead[p->nLookahead].action = action;
580 /* All lookaheads and actions in the aLookahead[] transaction
584 k = p->aLookahead[j].lookahead - p->mnLookahead + i;
586 if( p->aLookahead[j].lookahead!=p->aAction[k].lookahead ) break;
587 if( p->aLookahead[j].action!=p->aAction[k].action ) break;
591 /* No possible lookahead value that is not in the aLookahead[]
606 ** aLookahead[] transaction.
610 ** aLookahead[] transaction. Leave i set to the offset of the hole.
616 k = p->aLookahead[j].lookahead - p->mnLookahead + i;
632 k = p->aLookahead[j].lookahead - p->mnLookahead + i;
633 p->aAction[k] = p->aLookahead[j];
