Lines Matching refs:i
95 int i, j, k, c; in lemon_vsprintf() local
100 for(i=j=0; (c = zFormat[i])!=0; i++){ in lemon_vsprintf()
103 lemon_addtext(str, &nUsed, &zFormat[j], i-j, 0); in lemon_vsprintf()
104 c = zFormat[++i]; in lemon_vsprintf()
105 if( ISDIGIT(c) || (c=='-' && ISDIGIT(zFormat[i+1])) ){ in lemon_vsprintf()
106 if( c=='-' ) i++; in lemon_vsprintf()
107 while( ISDIGIT(zFormat[i]) ) iWidth = iWidth*10 + zFormat[i++] - '0'; in lemon_vsprintf()
109 c = zFormat[i]; in lemon_vsprintf()
129 }else if( c=='.' && memcmp(&zFormat[i], ".*s", 3)==0 ){ in lemon_vsprintf()
130 i += 2; in lemon_vsprintf()
140 j = i+1; in lemon_vsprintf()
143 lemon_addtext(str, &nUsed, &zFormat[j], i-j, 0); in lemon_vsprintf()
495 int i; in Action_new() local
502 for(i=0; i<amt-1; i++) actionfreelist[i].next = &actionfreelist[i+1]; in Action_new()
681 int i, j, k, n, end; in acttab_insert() local
698 for(i=oldAlloc; i<p->nActionAlloc; i++){ in acttab_insert()
699 p->aAction[i].lookahead = -1; in acttab_insert()
700 p->aAction[i].action = -1; in acttab_insert()
711 for(i=p->nAction-1; i>=end; i--){ in acttab_insert()
712 if( p->aAction[i].lookahead==p->mnLookahead ){ in acttab_insert()
715 if( p->aAction[i].action!=p->mnAction ) continue; in acttab_insert()
717 k = p->aLookahead[j].lookahead - p->mnLookahead + i; in acttab_insert()
729 if( p->aAction[j].lookahead==j+p->mnLookahead-i ) n++; in acttab_insert()
741 if( i<end ){ in acttab_insert()
746 i = makeItSafe ? p->mnLookahead : 0; in acttab_insert()
747 for(; i<p->nActionAlloc - p->mxLookahead; i++){ in acttab_insert()
748 if( p->aAction[i].lookahead<0 ){ in acttab_insert()
750 k = p->aLookahead[j].lookahead - p->mnLookahead + i; in acttab_insert()
756 if( p->aAction[j].lookahead==j+p->mnLookahead-i ) break; in acttab_insert()
770 printf(" inserted at %d\n", i); in acttab_insert()
773 k = p->aLookahead[j].lookahead - p->mnLookahead + i; in acttab_insert()
777 if( makeItSafe && i+p->nterminal>=p->nAction ) p->nAction = i+p->nterminal+1; in acttab_insert()
782 return i - p->mnLookahead; in acttab_insert()
815 int i, j; in FindRulePrecedences() local
816 for(i=0; i<rp->nrhs && rp->precsym==0; i++){ in FindRulePrecedences()
817 struct symbol *sp = rp->rhs[i]; in FindRulePrecedences()
826 rp->precsym = rp->rhs[i]; in FindRulePrecedences()
841 int i, j; in FindFirstSets() local
845 for(i=0; i<lemp->nsymbol; i++){ in FindFirstSets()
846 lemp->symbols[i]->lambda = LEMON_FALSE; in FindFirstSets()
848 for(i=lemp->nterminal; i<lemp->nsymbol; i++){ in FindFirstSets()
849 lemp->symbols[i]->firstset = SetNew(); in FindFirstSets()
857 for(i=0; i<rp->nrhs; i++){ in FindFirstSets()
858 struct symbol *sp = rp->rhs[i]; in FindFirstSets()
862 if( i==rp->nrhs ){ in FindFirstSets()
875 for(i=0; i<rp->nrhs; i++){ in FindFirstSets()
876 s2 = rp->rhs[i]; in FindFirstSets()
931 int i; in FindStates() local
932 for(i=0; i<rp->nrhs; i++){ in FindStates()
933 if( rp->rhs[i]==sp ){ /* FIX ME: Deal with multiterminals */ in FindStates()
1010 int i; in same_symbol() local
1015 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1016 if( a->subsym[i]!=b->subsym[i] ) return 0; in same_symbol()
1064 int i; in buildshifts() local
1065 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
1066 Action_add(&stp->ap,SHIFT,sp->subsym[i],(char*)newstp); in buildshifts()
1079 int i; in FindLinks() local
1087 for(i=0; i<lemp->nstate; i++){ in FindLinks()
1088 stp = lemp->sorted[i]; in FindLinks()
1096 for(i=0; i<lemp->nstate; i++){ in FindLinks()
1097 stp = lemp->sorted[i]; in FindLinks()
1114 int i; in FindFollowSets() local
1120 for(i=0; i<lemp->nstate; i++){ in FindFollowSets()
1121 assert( lemp->sorted[i]!=0 ); in FindFollowSets()
1122 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){ in FindFollowSets()
1129 for(i=0; i<lemp->nstate; i++){ in FindFollowSets()
1130 assert( lemp->sorted[i]!=0 ); in FindFollowSets()
1131 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){ in FindFollowSets()
1152 int i,j; in FindActions() local
1162 for(i=0; i<lemp->nstate; i++){ /* Loop over all states */ in FindActions()
1163 stp = lemp->sorted[i]; in FindActions()
1197 for(i=0; i<lemp->nstate; i++){ in FindActions()
1199 stp = lemp->sorted[i]; in FindActions()
1213 for(i=0; i<lemp->nstate; i++){ in FindActions()
1215 for(ap=lemp->sorted[i]->ap; ap; ap=ap->next){ in FindActions()
1405 int i, dot; in Configlist_closure() local
1421 for(i=dot+1; i<rp->nrhs; i++){ in Configlist_closure()
1422 xsp = rp->rhs[i]; in Configlist_closure()
1437 if( i==rp->nrhs ) Plink_add(&cfp->fplp,newcfp); in Configlist_closure()
1592 unsigned int i; in Rule_sort() local
1599 for(i=0; i<sizeof(x)/sizeof(x[0])-1 && x[i]; i++){ in Rule_sort()
1600 rp = Rule_merge(x[i], rp); in Rule_sort()
1601 x[i] = 0; in Rule_sort()
1603 x[i] = rp; in Rule_sort()
1607 for(i=0; i<sizeof(x)/sizeof(x[0]); i++){ in Rule_sort()
1608 rp = Rule_merge(x[i], rp); in Rule_sort()
1664 int i; in main() local
1706 for(i=0; i<lem.nsymbol; i++) lem.symbols[i]->index = i; in main()
1708 for(i=0; i<lem.nsymbol; i++) lem.symbols[i]->index = i; in main()
1709 while( lem.symbols[i-1]->type==MULTITERMINAL ){ i--; } in main()
1710 assert( strcmp(lem.symbols[i-1]->name,"{default}")==0 ); in main()
1711 lem.nsymbol = i - 1; in main()
1712 for(i=1; ISUPPER(lem.symbols[i]->name[0]); i++); in main()
1713 lem.nterminal = i; in main()
1719 for(i=0, rp=lem.rule; rp; rp=rp->next){ in main()
1720 rp->iRule = rp->code ? i++ : -1; in main()
1722 lem.nruleWithAction = i; in main()
1724 if( rp->iRule<0 ) rp->iRule = i++; in main()
1902 int i; in msort() local
1904 for(i=0; i<LISTSIZE; i++) set[i] = 0; in msort()
1909 for(i=0; i<LISTSIZE-1 && set[i]!=0; i++){ in msort()
1910 ep = merge(ep,set[i],cmp,offset); in msort()
1911 set[i] = 0; in msort()
1913 set[i] = ep; in msort()
1916 for(i=0; i<LISTSIZE; i++) if( set[i] ) ep = merge(set[i],ep,cmp,offset); in msort()
1932 int spcnt, i; in errline() local
1939 for(i=1; i<n && g_argv[i]; i++){ in errline()
1940 fprintf(err," %s",g_argv[i]); in errline()
1941 spcnt += lemonStrlen(g_argv[i])+1; in errline()
1944 for(; g_argv[i]; i++) fprintf(err," %s",g_argv[i]); in errline()
1958 int i; in argindex() local
1961 for(i=1; g_argv[i]; i++){ in argindex()
1962 if( dashdash || !ISOPT(g_argv[i]) ){ in argindex()
1963 if( n==0 ) return i; in argindex()
1966 if( strcmp(g_argv[i],"--")==0 ) dashdash = 1; in argindex()
1977 static int handleflags(int i, FILE *err) in handleflags() argument
1983 if( strncmp(&g_argv[i][1],op[j].label,lemonStrlen(op[j].label))==0 ) break; in handleflags()
1985 v = g_argv[i][0]=='-' ? 1 : 0; in handleflags()
1989 errline(i,1,err); in handleflags()
1999 (*(void(*)(char *))(op[j].arg))(&g_argv[i][2]); in handleflags()
2003 errline(i,1,err); in handleflags()
2013 static int handleswitch(int i, FILE *err) in handleswitch() argument
2021 cp = strchr(g_argv[i],'='); in handleswitch()
2025 if( strcmp(g_argv[i],op[j].label)==0 ) break; in handleswitch()
2031 errline(i,0,err); in handleswitch()
2041 errline(i,0,err); in handleswitch()
2052 errline(i,(int)((char*)end-(char*)g_argv[i]),err); in handleswitch()
2063 errline(i,(int)((char*)end-(char*)g_argv[i]),err); in handleswitch()
2107 int i; in OptInit() local
2108 for(i=1; g_argv[i]; i++){ in OptInit()
2109 if( g_argv[i][0]=='+' || g_argv[i][0]=='-' ){ in OptInit()
2110 errcnt += handleflags(i,err); in OptInit()
2111 }else if( strchr(g_argv[i],'=') ){ in OptInit()
2112 errcnt += handleswitch(i,err); in OptInit()
2127 int i; in OptNArgs() local
2129 for(i=1; g_argv[i]; i++){ in OptNArgs()
2130 if( dashdash || !ISOPT(g_argv[i]) ) cnt++; in OptNArgs()
2131 if( strcmp(g_argv[i],"--")==0 ) dashdash = 1; in OptNArgs()
2139 int i; in OptArg() local
2140 i = argindex(n); in OptArg()
2141 return i>=0 ? g_argv[i] : 0; in OptArg()
2146 int i; in OptErr() local
2147 i = argindex(n); in OptErr()
2148 if( i>=0 ) errline(i,0,errstream); in OptErr()
2152 int i; in OptPrint() local
2155 for(i=0; op[i].label; i++){ in OptPrint()
2156 len = lemonStrlen(op[i].label) + 1; in OptPrint()
2157 switch( op[i].type ){ in OptPrint()
2176 for(i=0; op[i].label; i++){ in OptPrint()
2177 switch( op[i].type ){ in OptPrint()
2180 fprintf(errstream," -%-*s %s\n",max,op[i].label,op[i].message); in OptPrint()
2184 fprintf(errstream," -%s<integer>%*s %s\n",op[i].label, in OptPrint()
2185 (int)(max-lemonStrlen(op[i].label)-9),"",op[i].message); in OptPrint()
2189 fprintf(errstream," -%s<real>%*s %s\n",op[i].label, in OptPrint()
2190 (int)(max-lemonStrlen(op[i].label)-6),"",op[i].message); in OptPrint()
2194 fprintf(errstream," -%s<string>%*s %s\n",op[i].label, in OptPrint()
2195 (int)(max-lemonStrlen(op[i].label)-8),"",op[i].message); in OptPrint()
2391 int i; in parseonetoken() local
2395 for(i=0; i<psp->nrhs; i++){ in parseonetoken()
2396 rp->rhs[i] = psp->rhs[i]; in parseonetoken()
2397 rp->rhsalias[i] = psp->alias[i]; in parseonetoken()
2398 if( rp->rhsalias[i]!=0 ){ rp->rhs[i]->bContent = 1; } in parseonetoken()
2797 int i; in eval_preprocessor_boolean() local
2798 for(i=0; z[i]!=0; i++){ in eval_preprocessor_boolean()
2799 if( ISSPACE(z[i]) ) continue; in eval_preprocessor_boolean()
2800 if( z[i]=='!' ){ in eval_preprocessor_boolean()
2805 if( z[i]=='|' && z[i+1]=='|' ){ in eval_preprocessor_boolean()
2808 i++; in eval_preprocessor_boolean()
2812 if( z[i]=='&' && z[i+1]=='&' ){ in eval_preprocessor_boolean()
2815 i++; in eval_preprocessor_boolean()
2819 if( z[i]=='(' ){ in eval_preprocessor_boolean()
2823 for(k=i+1; z[k]; k++){ in eval_preprocessor_boolean()
2828 res = eval_preprocessor_boolean(&z[i+1], -1); in eval_preprocessor_boolean()
2831 i = i-res; in eval_preprocessor_boolean()
2834 i = k; in eval_preprocessor_boolean()
2840 i = k; in eval_preprocessor_boolean()
2851 if( ISALPHA(z[i]) ){ in eval_preprocessor_boolean()
2854 for(k=i+1; ISALNUM(z[k]) || z[k]=='_'; k++){} in eval_preprocessor_boolean()
2855 n = k - i; in eval_preprocessor_boolean()
2858 if( strncmp(azDefine[j],&z[i],n)==0 && azDefine[j][n]==0 ){ in eval_preprocessor_boolean()
2863 i = k-1; in eval_preprocessor_boolean()
2878 fprintf(stderr, " %.*s <-- syntax error here\n", i+1, z); in eval_preprocessor_boolean()
2881 return -(i+1); in eval_preprocessor_boolean()
2891 int i, j, k; in preprocess_input() local
2896 for(i=0; z[i]; i++){ in preprocess_input()
2897 if( z[i]=='\n' ) lineno++; in preprocess_input()
2898 if( z[i]!='%' || (i>0 && z[i-1]!='\n') ) continue; in preprocess_input()
2899 if( strncmp(&z[i],"%endif",6)==0 && ISSPACE(z[i+6]) ){ in preprocess_input()
2903 for(j=start; j<i; j++) if( z[j]!='\n' ) z[j] = ' '; in preprocess_input()
2906 for(j=i; z[j] && z[j]!='\n'; j++) z[j] = ' '; in preprocess_input()
2907 }else if( strncmp(&z[i],"%else",5)==0 && ISSPACE(z[i+5]) ){ in preprocess_input()
2910 for(j=start; j<i; j++) if( z[j]!='\n' ) z[j] = ' '; in preprocess_input()
2913 start = i; in preprocess_input()
2916 for(j=i; z[j] && z[j]!='\n'; j++) z[j] = ' '; in preprocess_input()
2917 }else if( strncmp(&z[i],"%ifdef ",7)==0 in preprocess_input()
2918 || strncmp(&z[i],"%if ",4)==0 in preprocess_input()
2919 || strncmp(&z[i],"%ifndef ",8)==0 ){ in preprocess_input()
2925 for(j=i; z[j] && !ISSPACE(z[j]); j++){} in preprocess_input()
2927 isNot = (j==i+7); in preprocess_input()
2935 start = i; in preprocess_input()
2939 for(j=i; z[j] && z[j]!='\n'; j++) z[j] = ' '; in preprocess_input()
3119 int i; in Plink_new() local
3127 for(i=0; i<amt-1; i++) plink_freelist[i].next = &plink_freelist[i+1]; in Plink_new()
3234 int i, j; in rule_print() local
3238 for(i=0; i<rp->nrhs; i++){ in rule_print()
3239 struct symbol *sp = rp->rhs[i]; in rule_print()
3258 int i, j, maxlen, len, ncolumns, skip; in Reprint() local
3261 for(i=0; i<lemp->nsymbol; i++){ in Reprint()
3262 sp = lemp->symbols[i]; in Reprint()
3269 for(i=0; i<skip; i++){ in Reprint()
3271 for(j=i; j<lemp->nsymbol; j+=skip){ in Reprint()
3291 int i, j; in RulePrint() local
3293 for(i=0; i<=rp->nrhs; i++){ in RulePrint()
3294 if( i==iCursor ) fprintf(fp," *"); in RulePrint()
3295 if( i==rp->nrhs ) break; in RulePrint()
3296 sp = rp->rhs[i]; in RulePrint()
3322 int i;
3326 for(i=0; i<lemp->nterminal; i++){
3327 if( SetFind(set,i) ){
3328 fprintf(out,"%s%s",spacer,lemp->symbols[i]->name);
3421 int i, n; in ReportOutput() local
3430 for(i=0; i<lemp->nxstate; i++){ in ReportOutput()
3431 stp = lemp->sorted[i]; in ReportOutput()
3462 for(i=0; i<lemp->nsymbol; i++){ in ReportOutput()
3466 sp = lemp->symbols[i]; in ReportOutput()
3467 fprintf(fp, " %3d: %s", i, sp->name); in ReportOutput()
3485 for(i=n=0; i<lemp->nsymbol; i++){ in ReportOutput()
3487 struct symbol *sp = lemp->symbols[i]; in ReportOutput()
3606 int i, iStart; in tplt_xfer() local
3612 for(i=0; line[i]; i++){ in tplt_xfer()
3613 if( line[i]=='P' && strncmp(&line[i],"Parse",5)==0 in tplt_xfer()
3614 && (i==0 || !ISALPHA(line[i-1])) in tplt_xfer()
3616 if( i>iStart ) fprintf(out,"%.*s",i-iStart,&line[iStart]); in tplt_xfer()
3618 i += 4; in tplt_xfer()
3619 iStart = i+1; in tplt_xfer()
3848 int i; in translate_code() local
3858 for(i=0; i<rp->nrhs; i++) used[i] = 0; in translate_code()
3940 for(i=0; i<rp->nrhs; i++){ in translate_code()
3941 if( rp->rhsalias[i] && strcmp(cp,rp->rhsalias[i])==0 ){ in translate_code()
3942 if( i==0 && dontUseRhs0 ){ in translate_code()
3950 append_str("yymsp[%d].major",-1,i-rp->nrhs+1,0); in translate_code()
3952 struct symbol *sp = rp->rhs[i]; in translate_code()
3959 append_str("yymsp[%d].minor.yy%d",0,i-rp->nrhs+1, dtnum); in translate_code()
3962 used[i] = 1; in translate_code()
3988 for(i=0; i<rp->nrhs; i++){ in translate_code()
3989 if( rp->rhsalias[i] ){ in translate_code()
3990 if( i>0 ){ in translate_code()
3992 if( rp->lhsalias && strcmp(rp->lhsalias,rp->rhsalias[i])==0 ){ in translate_code()
3996 rp->rhs[i]->name, rp->rhsalias[i]); in translate_code()
3999 for(j=0; j<i; j++){ in translate_code()
4000 if( rp->rhsalias[j] && strcmp(rp->rhsalias[j],rp->rhsalias[i])==0 ){ in translate_code()
4003 rp->rhsalias[i]); in translate_code()
4009 if( !used[i] ){ in translate_code()
4012 rp->rhsalias[i],rp->rhs[i]->name,rp->rhsalias[i]); in translate_code()
4015 }else if( i>0 && has_destructor(rp->rhs[i],lemp) ){ in translate_code()
4017 rp->rhs[i]->index,i-rp->nrhs+1); in translate_code()
4103 int i,j; /* Loop counters */ in print_stack_union() local
4114 for(i=0; i<arraysize; i++) types[i] = 0; in print_stack_union()
4119 for(i=0; i<lemp->nsymbol; i++){ in print_stack_union()
4121 struct symbol *sp = lemp->symbols[i]; in print_stack_union()
4138 for(i=0; i<lemp->nsymbol; i++){ in print_stack_union()
4139 struct symbol *sp = lemp->symbols[i]; in print_stack_union()
4194 for(i=0; i<arraysize; i++){ in print_stack_union()
4195 if( types[i]==0 ) continue; in print_stack_union()
4196 fprintf(out," %s yy%d;\n",types[i],i+1); lineno++; in print_stack_union()
4197 free(types[i]); in print_stack_union()
4299 int i, j, n, sz; in ReportTable() local
4342 for(i=0; i<lemp->nsymbol; i++){ in ReportTable()
4346 i, lemp->symbols[i]->name, in ReportTable()
4347 i<lemp->nterminal ? "TRUE" : "FALSE" in ReportTable()
4349 if( lemp->symbols[i]->fallback ){ in ReportTable()
4350 fprintf(sql, ",%d);\n", lemp->symbols[i]->fallback->index); in ReportTable()
4367 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4368 assert( i==rp->iRule ); in ReportTable()
4380 i,j,sp->index in ReportTable()
4387 i,j,sp->subsym[k]->index in ReportTable()
4405 for(i=0; ISSPACE(lemp->include[i]); i++){ in ReportTable()
4406 if( lemp->include[i]=='\n' ){ in ReportTable()
4407 lemp->include += i+1; in ReportTable()
4408 i = -1; in ReportTable()
4434 for(i=1; i<lemp->nterminal; i++){ in ReportTable()
4435 fprintf(out,"#define %s%-30s %2d\n",prefix,lemp->symbols[i]->name,i); in ReportTable()
4464 i = lemonStrlen(lemp->arg); in ReportTable()
4465 while( i>=1 && ISSPACE(lemp->arg[i-1]) ) i--; in ReportTable()
4466 while( i>=1 && (ISALNUM(lemp->arg[i-1]) || lemp->arg[i-1]=='_') ) i--; in ReportTable()
4469 fprintf(out,"#define %sARG_PARAM ,%s\n",name,&lemp->arg[i]); lineno++; in ReportTable()
4471 name,lemp->arg,&lemp->arg[i]); lineno++; in ReportTable()
4473 name,&lemp->arg[i],&lemp->arg[i]); lineno++; in ReportTable()
4482 i = lemonStrlen(lemp->ctx); in ReportTable()
4483 while( i>=1 && ISSPACE(lemp->ctx[i-1]) ) i--; in ReportTable()
4484 while( i>=1 && (ISALNUM(lemp->ctx[i-1]) || lemp->ctx[i-1]=='_') ) i--; in ReportTable()
4487 fprintf(out,"#define %sCTX_PARAM ,%s\n",name,&lemp->ctx[i]); lineno++; in ReportTable()
4489 name,lemp->ctx,&lemp->ctx[i]); lineno++; in ReportTable()
4491 name,&lemp->ctx[i],&lemp->ctx[i]); lineno++; in ReportTable()
4519 for(i=0; i<lemp->nxstate; i++){ in ReportTable()
4520 stp = lemp->sorted[i]; in ReportTable()
4521 ax[i*2].stp = stp; in ReportTable()
4522 ax[i*2].isTkn = 1; in ReportTable()
4523 ax[i*2].nAction = stp->nTknAct; in ReportTable()
4524 ax[i*2+1].stp = stp; in ReportTable()
4525 ax[i*2+1].isTkn = 0; in ReportTable()
4526 ax[i*2+1].nAction = stp->nNtAct; in ReportTable()
4532 for(i=0; i<lemp->nxstate*2; i++) ax[i].iOrder = i; in ReportTable()
4535 for(i=0; i<lemp->nxstate*2 && ax[i].nAction>0; i++){ in ReportTable()
4536 stp = ax[i].stp; in ReportTable()
4537 if( ax[i].isTkn ){ in ReportTable()
4567 i, stp->statenum, ax[i].isTkn ? "Token" : "Var ", in ReportTable()
4568 ax[i].nAction, pActtab->nAction, nn); in ReportTable()
4578 for(i=0; i<lemp->nxstate; i++){ in ReportTable()
4579 for(ap=lemp->sorted[i]->ap; ap; ap=ap->next){ in ReportTable()
4594 i = lemp->minShiftReduce; in ReportTable()
4595 fprintf(out,"#define YY_MIN_SHIFTREDUCE %d\n",i); lineno++; in ReportTable()
4596 i += lemp->nrule; in ReportTable()
4597 fprintf(out,"#define YY_MAX_SHIFTREDUCE %d\n", i-1); lineno++; in ReportTable()
4602 i = lemp->minReduce + lemp->nrule; in ReportTable()
4603 fprintf(out,"#define YY_MAX_REDUCE %d\n", i-1); lineno++; in ReportTable()
4623 for(i=j=0; i<n; i++){ in ReportTable()
4624 int action = acttab_yyaction(pActtab, i); in ReportTable()
4626 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4628 if( j==9 || i==n-1 ){ in ReportTable()
4641 for(i=j=0; i<n; i++){ in ReportTable()
4642 int la = acttab_yylookahead(pActtab, i); in ReportTable()
4644 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4657 while( i<nLookAhead ){ in ReportTable()
4658 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4666 i++; in ReportTable()
4681 for(i=j=0; i<n; i++){ in ReportTable()
4683 stp = lemp->sorted[i]; in ReportTable()
4686 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4688 if( j==9 || i==n-1 ){ in ReportTable()
4706 for(i=j=0; i<n; i++){ in ReportTable()
4708 stp = lemp->sorted[i]; in ReportTable()
4711 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4713 if( j==9 || i==n-1 ){ in ReportTable()
4726 for(i=j=0; i<n; i++){ in ReportTable()
4727 stp = lemp->sorted[i]; in ReportTable()
4728 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4734 if( j==9 || i==n-1 ){ in ReportTable()
4752 for(i=0; i<=mx; i++){ in ReportTable()
4753 struct symbol *p = lemp->symbols[i]; in ReportTable()
4767 for(i=0; i<lemp->nsymbol; i++){ in ReportTable()
4768 fprintf(out," /* %4d */ \"%s\",\n",i, lemp->symbols[i]->name); lineno++; in ReportTable()
4776 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4777 assert( rp->iRule==i ); in ReportTable()
4778 fprintf(out," /* %3d */ \"", i); in ReportTable()
4790 for(i=0; i<lemp->nsymbol; i++){ in ReportTable()
4791 struct symbol *sp = lemp->symbols[i]; in ReportTable()
4799 for(i=0; i<lemp->nsymbol && lemp->symbols[i]->type!=TERMINAL; i++); in ReportTable()
4800 if( i<lemp->nsymbol ){ in ReportTable()
4801 emit_destructor_code(out,lemp->symbols[i],lemp,&lineno); in ReportTable()
4808 for(i=0; i<lemp->nsymbol; i++){ in ReportTable()
4809 struct symbol *sp = lemp->symbols[i]; in ReportTable()
4824 for(i=0; i<lemp->nsymbol; i++){ in ReportTable()
4825 struct symbol *sp = lemp->symbols[i]; in ReportTable()
4831 for(j=i+1; j<lemp->nsymbol; j++){ in ReportTable()
4842 emit_destructor_code(out,lemp->symbols[i],lemp,&lineno); in ReportTable()
4857 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4858 fprintf(out," %4d, /* (%d) ", rp->lhs->index, i); in ReportTable()
4863 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4864 fprintf(out," %3d, /* (%d) ", -rp->nrhs, i); in ReportTable()
4871 i = 0; in ReportTable()
4873 i += translate_code(lemp, rp); in ReportTable()
4875 if( i ){ in ReportTable()
4952 int i; in ReportHeader() local
4959 for(i=1; i<lemp->nterminal && fgets(line,LINESIZE,in); i++){ in ReportHeader()
4961 prefix,lemp->symbols[i]->name,i); in ReportHeader()
4966 if( i==lemp->nterminal && nextChar==EOF ){ in ReportHeader()
4973 for(i=1; i<lemp->nterminal; i++){ in ReportHeader()
4974 fprintf(out,"#define %s%-30s %3d\n",prefix,lemp->symbols[i]->name,i); in ReportHeader()
4994 int i; in CompressTables() local
4997 for(i=0; i<lemp->nstate; i++){ in CompressTables()
4998 stp = lemp->sorted[i]; in CompressTables()
5056 for(i=0; i<lemp->nstate; i++){ in CompressTables()
5057 stp = lemp->sorted[i]; in CompressTables()
5075 for(i=0; i<lemp->nstate; i++){ in CompressTables()
5076 stp = lemp->sorted[i]; in CompressTables()
5130 int i; in ResortStates() local
5134 for(i=0; i<lemp->nstate; i++){ in ResortStates()
5135 stp = lemp->sorted[i]; in ResortStates()
5156 for(i=0; i<lemp->nstate; i++){ in ResortStates()
5157 lemp->sorted[i]->statenum = i; in ResortStates()
5209 int i, progress; in SetUnion() local
5211 for(i=0; i<size; i++){ in SetUnion()
5212 if( s2[i]==0 ) continue; in SetUnion()
5213 if( s1[i]==0 ){ in SetUnion()
5215 s1[i] = 1; in SetUnion()
5296 int i; in Strsafe_init() local
5298 for(i=0; i<1024; i++) x1a->ht[i] = 0; in Strsafe_init()
5324 int i,arrSize; in Strsafe_insert() local
5331 for(i=0; i<arrSize; i++) array.ht[i] = 0; in Strsafe_insert()
5332 for(i=0; i<x1a->count; i++){ in Strsafe_insert()
5334 oldnp = &(x1a->tbl[i]); in Strsafe_insert()
5336 newnp = &(array.tbl[i]); in Strsafe_insert()
5464 int i; in Symbol_init() local
5466 for(i=0; i<128; i++) x2a->ht[i] = 0; in Symbol_init()
5492 int i,arrSize; in Symbol_insert() local
5499 for(i=0; i<arrSize; i++) array.ht[i] = 0; in Symbol_insert()
5500 for(i=0; i<x2a->count; i++){ in Symbol_insert()
5502 oldnp = &(x2a->tbl[i]); in Symbol_insert()
5504 newnp = &(array.tbl[i]); in Symbol_insert()
5570 int i,arrSize; in Symbol_arrayof() local
5575 for(i=0; i<arrSize; i++) array[i] = x2a->tbl[i].data; in Symbol_arrayof()
5663 int i; in State_init() local
5665 for(i=0; i<128; i++) x3a->ht[i] = 0; in State_init()
5691 int i,arrSize; in State_insert() local
5698 for(i=0; i<arrSize; i++) array.ht[i] = 0; in State_insert()
5699 for(i=0; i<x3a->count; i++){ in State_insert()
5701 oldnp = &(x3a->tbl[i]); in State_insert()
5703 newnp = &(array.tbl[i]); in State_insert()
5749 int i,arrSize; in State_arrayof() local
5754 for(i=0; i<arrSize; i++) array[i] = x3a->tbl[i].data; in State_arrayof()
5803 int i; in Configtable_init() local
5805 for(i=0; i<64; i++) x4a->ht[i] = 0; in Configtable_init()
5831 int i,arrSize; in Configtable_insert() local
5838 for(i=0; i<arrSize; i++) array.ht[i] = 0; in Configtable_insert()
5839 for(i=0; i<x4a->count; i++){ in Configtable_insert()
5841 oldnp = &(x4a->tbl[i]); in Configtable_insert()
5843 newnp = &(array.tbl[i]); in Configtable_insert()
5887 int i; in Configtable_clear() local
5889 if( f ) for(i=0; i<x4a->count; i++) (*f)(x4a->tbl[i].data); in Configtable_clear()
5890 for(i=0; i<x4a->size; i++) x4a->ht[i] = 0; in Configtable_clear()