Lines Matching refs:j
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()
140 j = i+1; in lemon_vsprintf()
143 lemon_addtext(str, &nUsed, &zFormat[j], i-j, 0); in lemon_vsprintf()
682 int i, j, k, n, end; in acttab_insert() local
717 for(j=0; j<p->nLookahead; j++){ in acttab_insert()
718 k = p->aLookahead[j].lookahead - p->mnLookahead + i; in acttab_insert()
720 if( p->aLookahead[j].lookahead!=p->aAction[k].lookahead ) break; in acttab_insert()
721 if( p->aLookahead[j].action!=p->aAction[k].action ) break; in acttab_insert()
723 if( j<p->nLookahead ) continue; in acttab_insert()
728 for(j=0; j<p->nAction; j++){ in acttab_insert()
729 if( p->aAction[j].lookahead<0 ) continue; in acttab_insert()
730 if( p->aAction[j].lookahead==j+p->mnLookahead-i ) n++; in acttab_insert()
750 for(j=0; j<p->nLookahead; j++){ in acttab_insert()
751 k = p->aLookahead[j].lookahead - p->mnLookahead + i; in acttab_insert()
755 if( j<p->nLookahead ) continue; in acttab_insert()
756 for(j=0; j<p->nAction; j++){ in acttab_insert()
757 if( p->aAction[j].lookahead==j+p->mnLookahead-i ) break; in acttab_insert()
759 if( j==p->nAction ){ in acttab_insert()
768 for(j=0; j<p->nLookahead; j++){ in acttab_insert()
769 printf(" %d", p->aLookahead[j].lookahead); in acttab_insert()
773 for(j=0; j<p->nLookahead; j++){ in acttab_insert()
774 k = p->aLookahead[j].lookahead - p->mnLookahead + i; in acttab_insert()
775 p->aAction[k] = p->aLookahead[j]; in acttab_insert()
816 int i, j; in FindRulePrecedences() local
820 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
821 if( sp->subsym[j]->prec>=0 ){ in FindRulePrecedences()
822 rp->precsym = sp->subsym[j]; in FindRulePrecedences()
842 int i, j; in FindFirstSets() local
882 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
883 progress += SetAdd(s1->firstset,s2->subsym[j]->index); in FindFirstSets()
1153 int i,j; in FindActions() local
1167 for(j=0; j<lemp->nterminal; j++){ in FindActions()
1168 if( SetFind(cfp->fws,j) ){ in FindActions()
1171 Action_add(&stp->ap,REDUCE,lemp->symbols[j],(char *)cfp->rp); in FindActions()
1982 int j; in handleflags() local
1983 for(j=0; op[j].label; j++){ in handleflags()
1984 if( strncmp(&g_argv[i][1],op[j].label,lemonStrlen(op[j].label))==0 ) break; in handleflags()
1987 if( op[j].label==0 ){ in handleflags()
1993 }else if( op[j].arg==0 && op[j].fn==0 ){ in handleflags()
1995 }else if( op[j].type==OPT_FLAG ){ in handleflags()
1996 *((int*)op[j].arg) = v; in handleflags()
1997 }else if( op[j].type==OPT_FFLAG ){ in handleflags()
1998 op[j].fn(v); in handleflags()
1999 }else if( op[j].type==OPT_FSTR ){ in handleflags()
2000 op[j].fn(&g_argv[i][2]); in handleflags()
2020 int j; in handleswitch() local
2025 for(j=0; op[j].label; j++){ in handleswitch()
2026 if( strcmp(g_argv[i],op[j].label)==0 ) break; in handleswitch()
2029 if( op[j].label==0 ){ in handleswitch()
2037 switch( op[j].type ){ in handleswitch()
2074 switch( op[j].type ){ in handleswitch()
2079 *(double*)(op[j].arg) = dv; in handleswitch()
2082 op[j].fn(dv); in handleswitch()
2085 *(int*)(op[j].arg) = lv; in handleswitch()
2088 op[j].fn((int)lv); in handleswitch()
2091 *(char**)(op[j].arg) = sv; in handleswitch()
2094 op[j].fn(sv); in handleswitch()
2853 int j, k, n; in eval_preprocessor_boolean() local
2858 for(j=0; j<nDefine; j++){ in eval_preprocessor_boolean()
2859 if( strncmp(azDefine[j],&z[i],n)==0 && azDefine[j][n]==0 ){ in eval_preprocessor_boolean()
2892 int i, j, k; in preprocess_input() local
2904 for(j=start; j<i; j++) if( z[j]!='\n' ) z[j] = ' '; in preprocess_input()
2907 for(j=i; z[j] && z[j]!='\n'; j++) z[j] = ' '; in preprocess_input()
2911 for(j=start; j<i; j++) if( z[j]!='\n' ) z[j] = ' '; in preprocess_input()
2917 for(j=i; z[j] && z[j]!='\n'; j++) z[j] = ' '; in preprocess_input()
2926 for(j=i; z[j] && !ISSPACE(z[j]); j++){} in preprocess_input()
2927 iBool = j; in preprocess_input()
2928 isNot = (j==i+7); in preprocess_input()
2929 while( z[j] && z[j]!='\n' ){ j++; } in preprocess_input()
2930 k = z[j]; in preprocess_input()
2931 z[j] = 0; in preprocess_input()
2933 z[j] = k; in preprocess_input()
2940 for(j=i; z[j] && z[j]!='\n'; j++) z[j] = ' '; in preprocess_input()
3235 int i, j; in rule_print() local
3243 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3244 fprintf(out,"|%s", sp->subsym[j]->name); in rule_print()
3259 int i, j, maxlen, len, ncolumns, skip; in Reprint() local
3272 for(j=i; j<lemp->nsymbol; j+=skip){ in Reprint()
3273 sp = lemp->symbols[j]; in Reprint()
3274 assert( sp->index==j ); in Reprint()
3275 printf(" %3d %-*.*s",j,maxlen,maxlen,sp->name); in Reprint()
3292 int i, j; in RulePrint() local
3300 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
3301 fprintf(fp,"|%s",sp->subsym[j]->name); in RulePrint()
3464 int j; in ReportOutput() local
3474 for(j=0; j<lemp->nterminal; j++){ in ReportOutput()
3475 if( sp->firstset && SetFind(sp->firstset, j) ){ in ReportOutput()
3476 fprintf(fp, " %s", lemp->symbols[j]->name); in ReportOutput()
3991 int j; in translate_code() local
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()
4103 int i,j; /* Loop counters */ in print_stack_union() local
4151 j = 0; in print_stack_union()
4153 while( *cp ) stddt[j++] = *cp++; in print_stack_union()
4154 while( j>0 && ISSPACE(stddt[j-1]) ) j--; in print_stack_union()
4155 stddt[j] = 0; in print_stack_union()
4161 for(j=0; stddt[j]; j++){ in print_stack_union()
4162 hash = hash*53 + stddt[j]; in print_stack_union()
4270 int j; in writeRuleText() local
4272 for(j=0; j<rp->nrhs; j++){ in writeRuleText()
4273 struct symbol *sp = rp->rhs[j]; in writeRuleText()
4299 int i, j, n, sz; in ReportTable() local
4375 for(j=0; j<rp->nrhs; j++){ in ReportTable()
4376 struct symbol *sp = rp->rhs[j]; in ReportTable()
4380 i,j,sp->index in ReportTable()
4387 i,j,sp->subsym[k]->index in ReportTable()
4623 for(i=j=0; i<n; i++){ in ReportTable()
4626 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4628 if( j==9 || i==n-1 ){ in ReportTable()
4630 j = 0; in ReportTable()
4632 j++; in ReportTable()
4641 for(i=j=0; i<n; i++){ in ReportTable()
4644 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4646 if( j==9 ){ in ReportTable()
4648 j = 0; in ReportTable()
4650 j++; in ReportTable()
4658 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4660 if( j==9 ){ in ReportTable()
4662 j = 0; in ReportTable()
4664 j++; in ReportTable()
4668 if( j>0 ){ fprintf(out, "\n"); lineno++; } in ReportTable()
4681 for(i=j=0; i<n; i++){ in ReportTable()
4686 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4688 if( j==9 || i==n-1 ){ in ReportTable()
4690 j = 0; in ReportTable()
4692 j++; in ReportTable()
4706 for(i=j=0; i<n; i++){ in ReportTable()
4711 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4713 if( j==9 || i==n-1 ){ in ReportTable()
4715 j = 0; in ReportTable()
4717 j++; in ReportTable()
4726 for(i=j=0; i<n; i++){ in ReportTable()
4728 if( j==0 ) fprintf(out," /* %5d */ ", i); in ReportTable()
4734 if( j==9 || i==n-1 ){ in ReportTable()
4736 j = 0; in ReportTable()
4738 j++; in ReportTable()
4831 for(j=i+1; j<lemp->nsymbol; j++){ in ReportTable()
4832 struct symbol *sp2 = lemp->symbols[j]; in ReportTable()