682   int i, j, k, n, end;  in acttab_insert()  local
689   n = p->nsymbol + 1;  in acttab_insert()
690   if( p->nAction + n >= p->nActionAlloc ){  in acttab_insert()
692     p->nActionAlloc = p->nAction + n + p->nActionAlloc + 20;  in acttab_insert()
727       n = 0;  in acttab_insert()
730         if( p->aAction[j].lookahead==j+p->mnLookahead-i ) n++;  in acttab_insert()
732       if( n==p->nLookahead ){  in acttab_insert()
791   int n = p->nAction;  in acttab_action_size()  local
792   while( n>0 && p->aAction[n-1].lookahead<0 ){ n--; }  in acttab_action_size()
793   return n;  in acttab_action_size()
1931 static void errline(int n, int k, FILE *err)  in errline()  argument
1940   for(i=1; i<n && g_argv[i]; i++){  in errline()
1957 static int argindex(int n)  in argindex()  argument
1964         if( n==0 ) return i;  in argindex()
1965         n--;  in argindex()
2138 char *OptArg(int n)  in OptArg()  argument
2141   i = argindex(n);  in OptArg()
2145 void OptErr(int n)  in OptErr()  argument
2148   i = argindex(n);  in OptErr()
2631         int nOld, n, nLine = 0, nNew, nBack;  in parseonetoken()  local
2643         n = nOld + nNew + 20;  in parseonetoken()
2654           n += nLine + lemonStrlen(psp->filename) + nBack;  in parseonetoken()
2656         *psp->declargslot = (char *) realloc(*psp->declargslot, n);  in parseonetoken()
2822       int n = 1;  in eval_preprocessor_boolean()  local
2826           n--;  in eval_preprocessor_boolean()
2827           if( n==0 ){  in eval_preprocessor_boolean()
2839           n++;  in eval_preprocessor_boolean()
2853       int j, k, n;  in eval_preprocessor_boolean()  local
2856       n = k - i;  in eval_preprocessor_boolean()
2859         if( strncmp(azDefine[j],&z[i],n)==0 && azDefine[j][n]==0 ){  in eval_preprocessor_boolean()
3422   int i, n;  in ReportOutput()  local
3486   for(i=n=0; i<lemp->nsymbol; i++){  in ReportOutput()
3491     if( n>0 && n+w>75 ){  in ReportOutput()
3493       n = 0;  in ReportOutput()
3495     if( n>0 ){  in ReportOutput()
3497       n++;  in ReportOutput()
3500     n += w;  in ReportOutput()
3502   if( n>0 ) fprintf(fp, "\n");  in ReportOutput()
3798 PRIVATE char *append_str(const char *zText, int n, int p1, int p2){  in append_str()  argument
3810   if( n<=0 ){  in append_str()
3811     if( n<0 ){  in append_str()
3812       used += n;  in append_str()
3815     n = lemonStrlen(zText);  in append_str()
3817   if( (int) (n+sizeof(zInt)*2+used) >= alloced ){  in append_str()
3818     alloced = n + sizeof(zInt)*2 + used + 200;  in append_str()
3822   while( n-- > 0 ){  in append_str()
3824     if( c=='%' && n>0 && zText[0]=='d' ){  in append_str()
3830       n--;  in append_str()
4299   int i, j, n, sz;  in ReportTable()  local
4619   lemp->nactiontab = n = acttab_action_size(pActtab);  in ReportTable()
4620   lemp->tablesize += n*szActionType;  in ReportTable()
4621   fprintf(out,"#define YY_ACTTAB_COUNT (%d)\n", n); lineno++;  in ReportTable()
4623   for(i=j=0; i<n; i++){  in ReportTable()
4628     if( j==9 || i==n-1 ){  in ReportTable()
4638   lemp->nlookaheadtab = n = acttab_lookahead_size(pActtab);  in ReportTable()
4639   lemp->tablesize += n*szCodeType;  in ReportTable()
4641   for(i=j=0; i<n; i++){  in ReportTable()
4672   n = lemp->nxstate;  in ReportTable()
4673   while( n>0 && lemp->sorted[n-1]->iTknOfst==NO_OFFSET ) n--;  in ReportTable()
4674   fprintf(out, "#define YY_SHIFT_COUNT    (%d)\n", n-1); lineno++;  in ReportTable()
4680   lemp->tablesize += n*sz;  in ReportTable()
4681   for(i=j=0; i<n; i++){  in ReportTable()
4688     if( j==9 || i==n-1 ){  in ReportTable()
4698   n = lemp->nxstate;  in ReportTable()
4699   while( n>0 && lemp->sorted[n-1]->iNtOfst==NO_OFFSET ) n--;  in ReportTable()
4700   fprintf(out, "#define YY_REDUCE_COUNT (%d)\n", n-1); lineno++;  in ReportTable()
4705   lemp->tablesize += n*sz;  in ReportTable()
4706   for(i=j=0; i<n; i++){  in ReportTable()
4713     if( j==9 || i==n-1 ){  in ReportTable()
4724   n = lemp->nxstate;  in ReportTable()
4725   lemp->tablesize += n*szActionType;  in ReportTable()
4726   for(i=j=0; i<n; i++){  in ReportTable()
4734     if( j==9 || i==n-1 ){  in ReportTable()
4993   int nbest, n;  in CompressTables()  local
5011       n = 1;  in CompressTables()
5016         if( rp2==rp ) n++;  in CompressTables()
5018       if( n>nbest ){  in CompressTables()
5019         nbest = n;  in CompressTables()
5110   int n;  in stateResortCompare()  local
5112   n = pB->nNtAct - pA->nNtAct;  in stateResortCompare()
5113   if( n==0 ){  in stateResortCompare()
5114     n = pB->nTknAct - pA->nTknAct;  in stateResortCompare()
5115     if( n==0 ){  in stateResortCompare()
5116       n = pB->statenum - pA->statenum;  in stateResortCompare()
5119   assert( n!=0 );  in stateResortCompare()
5120   return n;  in stateResortCompare()
5174 void SetSize(int n)  in SetSize()  argument
5176   size = n+1;  in SetSize()
5547 struct symbol *Symbol_Nth(int n)  in Symbol_Nth()  argument
5550   if( x2a && n>0 && n<=x2a->count ){  in Symbol_Nth()
5551     data = x2a->tbl[n-1].data;  in Symbol_Nth()