Lines Matching refs:j
51 int i, j, k; in cfoll() local
58 for (j = 0; j < tptr; j++) in cfoll()
59 tmpstat[j] = FALSE; in cfoll()
70 for (j = 1; j < ncg; j++) in cfoll()
71 symbol[j] = (i == RNCCL); in cfoll()
76 for (j = 1; j < ncg; j++) in cfoll()
77 if (symbol[j]) { in cfoll()
79 if (cindex[j] == in cfoll()
83 *pcptr++ = cindex[j]; in cfoll()
131 int j; in pfoll() local
136 j = *p++; in pfoll()
137 if (j >= 1) { in pfoll()
139 for (k = 2; k <= j; k++) in pfoll()
313 int i, j; in cgoto() local
366 for (j = 1; j < ncg; j++) in cgoto()
367 if (cindex[j] == *q) in cgoto()
368 symbol[j] = in cgoto()
455 int j, *newpos; in nextstate() local
464 j = name[curpos]; in nextstate()
465 if ((!ISOPERATOR(j) && j == c) || in nextstate()
466 (j == RSTR && c == right[curpos]) || in nextstate()
467 (j == RCCL && member(c, (CHR *) left[curpos]))) { in nextstate()
471 for (j = 0; j < number; j++) in nextstate()
475 j = 0; in nextstate()
479 j++; in nextstate()
485 count = j; in nextstate()
492 int *j, k; in notin() local
500 j = state[i]; in notin()
501 if (count == *j++) { in notin()
503 if (!temp[*j++]) in notin()
524 int i, j, k; in packtrans() local
611 j = 0; in packtrans()
613 while (ach[j] && p < upper) { in packtrans()
614 while (ach[j] < nchar[p] && ach[j]) { in packtrans()
616 j++; in packtrans()
618 if (ach[j] == 0) in packtrans()
620 if (ach[j] > nchar[p]) { in packtrans()
625 if (ast[j] != nexts[++p] || in packtrans()
626 ast[j] == -1 || in packtrans()
627 (cpackflg[st] && ach[j] != match[ach[j]])) in packtrans()
629 j++; in packtrans()
631 while (ach[j]) { in packtrans()
633 j++; in packtrans()
656 j = 0; in packtrans()
657 while (ach[j]) { in packtrans()
660 while (ach[j] < nchar[p-1] && ach[j]) { in packtrans()
662 nchar[nptr] = ach[j]; in packtrans()
663 nexts[++nptr] = ast[j]; in packtrans()
664 j++; in packtrans()
668 if (ach[j] > nchar[p-1]) { in packtrans()
673 if (ast[j] != nexts[p] || in packtrans()
674 ast[j] == -1 || in packtrans()
675 (cpackflg[st] && ach[j] != match[ach[j]])) { in packtrans()
677 nchar[nptr] = ach[j]; in packtrans()
678 nexts[++nptr] = ast[j]; in packtrans()
681 j++; in packtrans()
683 while (ach[j]) { in packtrans()
684 nchar[nptr] = ach[j]; in packtrans()
685 nexts[++nptr] = ast[j++]; in packtrans()
718 int *p, i, j; in pstate() local
725 for (j = 1; j < i; j++) { in pstate()
727 if (j%30 == 0) in pstate()
791 int *p, i, j; in acompute() local
824 for (j = i+1; j < k; j++) in acompute()
825 if (temp[j] < temp[i]) { in acompute()
826 m = temp[j]; in acompute()
827 temp[j] = temp[i]; in acompute()
877 int i, j; in pccl() local
882 for (j = 1; j < ncg; j++) in pccl()
883 if (cindex[j] == i) { in pccl()
884 allprint(j); in pccl()
924 int i, j, k; in layout() local
932 j = gotof[i]; in layout()
933 if (j == -1) { in layout()
937 bot = j; in layout()
938 while (nchar[j]) in layout()
939 j++; in layout()
940 top = j - 1; in layout()
944 for (j = bot; j <= top; j++) { in layout()
945 (void) printf(" %o", nchar[j]); in layout()
946 if (j % 10 == 0) in layout()
966 for (j = bot; j <= top; j++) { in layout()
967 k = startup+ctable[nchar[j]]; in layout()
971 } while (j <= top); in layout()
978 for (j = bot; j <= top; j++) { in layout()
979 k = startup + ctable[nchar[j]]; in layout()
980 if (ctable[nchar[j]] <= 0) in layout()
983 j, (int)nchar[j], ctable[nchar[k]]); in layout()
985 advance[k] = nexts[j+1]+1; in layout()
994 for (j = bot; j <= top; j++) { in layout()
995 k = startup + nchar[j]; in layout()
999 } while (j <= top); in layout()
1005 for (j = bot; j <= top; j++) { in layout()
1006 k = startup + nchar[j]; in layout()
1008 advance[k] = nexts[j+1] + 1; in layout()
1037 for (j = 0; j < 4; j++) { in layout()
1038 k = i+j; in layout()
1085 for (j = 0; j < 8; j++) { in layout()
1087 fbch = match[i+j]; in layout()
1103 for (j = 0; j < 8; j++) in layout()
1105 fbarr[i+j]); in layout()
1115 for (j = 0; j < 8; j++) in layout()
1116 (void) fprintf(fout, "%d,", i+j < NACTIONS ? in layout()
1117 extra[i+j] : 0); in layout()
1174 int i, j, k; in bprint() local
1181 for (j = 1; j < 8; j++) { in bprint()
1182 k = i+j; in bprint()
1196 int i, *j, k; in padd() local
1203 j = array[i]; in padd()
1204 if (j && *j++ == count) { in padd()
1206 if (!tmpstat[*j++]) in padd()