Lines Matching refs:trans
1902 it in the appropriate slot of trans.
1932 dfastate (int s, struct dfa *d, int trans[])
2114 trans[i] = (IS_WORD_CONSTITUENT(i)) ? state_letter : state;
2115 trans[eolbyte] = state_newline;
2119 trans[i] = -1;
2209 trans[c] = state_newline;
2211 trans[c] = state_letter;
2213 trans[c] = state;
2225 is a non-accepting state, then d->trans[state] points to its table.
2227 If it has no table at all, then d->trans[state] is NULL.
2233 int *trans; /* The new transition table. */
2243 if (d->trans[i])
2245 free((ptr_t) d->trans[i]);
2246 d->trans[i] = NULL;
2270 MALLOC(trans, int, NOTCHAR);
2271 dfastate(s, d, trans);
2273 /* Now go through the new transition table, and make sure that the trans
2277 if (trans[i] >= d->tralloc)
2281 while (trans[i] >= d->tralloc)
2284 d->trans = d->realtrans + 1;
2289 d->trans[oldalloc] = NULL;
2295 trans[eolbyte] = -1;
2298 d->fails[s] = trans;
2300 d->trans[s] = trans;
2309 d->trans = d->realtrans + 1;
2343 /* Make sure that the trans and fail arrays are allocated large enough
2352 d->trans = d->realtrans + 1;
2357 d->trans[oldalloc] = NULL;
2387 if ((t = d->trans[works]) != NULL)
2758 register int **trans, *t; /* Copy of d->trans so it can be optimized
2780 trans = d->trans;
2829 while ((t = trans[s]))
2844 trans = d->trans;
2854 while ((t = trans[s]))
2902 trans = d->trans;
2914 trans = d->trans;
3036 if (d->trans[i])
3037 free((ptr_t) d->trans[i]);