Searched refs:edest (Results 1 - 2 of 2) sorted by path
| /freebsd-11-stable/contrib/gcc/ |
| H A D | gcse.c | 3535 edge e, edest;
3623 edest = FALLTHRU_EDGE (bb);
3624 dest = edest->insns.r ? NULL : edest->dest;
3630 edest = find_edge (bb, dest);
3631 if (edest && edest->insns.r)
3522 edge e, edest; local
|
| /freebsd-11-stable/contrib/libgnuregex/ |
| H A D | regcomp.c | 1149 /* Analyze the structure tree, and calculate "first", "next", "edest",
1716 int edest = dfa->edests[node].elems[i];
1717 /* If calculating the epsilon closure of `edest' is in progress,
1719 if (dfa->eclosures[edest].nelem == -1)
1724 /* If we haven't calculated the epsilon closure of `edest' yet,
1726 if (dfa->eclosures[edest].nelem == 0)
1728 err = calc_eclosure_iter (&eclosure_elem, dfa, edest, 0);
1733 eclosure_elem = dfa->eclosures[edest];
1734 /* Merge the epsilon closure of `edest'. */
1738 /* If the epsilon closure of `edest' i
1709 int edest = dfa->edests[node].elems[i]; local
[all...] |
Completed in 291 milliseconds