Lines Matching refs:ep
290 propedom(ep)
291 struct edge *ep;
293 SET_INSERT(ep->edom, ep->id);
294 if (ep->succ) {
295 SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords);
296 SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords);
1310 fold_edge(child, ep)
1312 struct edge *ep;
1316 int code = ep->code;
1329 aval1 = ep->pred->val[A_ATOM];
1330 oval1 = ep->pred->oval;
1365 opt_j(ep)
1366 struct edge *ep;
1371 if (JT(ep->succ) == 0)
1374 if (JT(ep->succ) == JF(ep->succ)) {
1379 if (!use_conflict(ep->pred, ep->succ->et.succ)) {
1381 ep->succ = JT(ep->succ);
1393 register bpf_u_int32 x = ep->edom[i];
1400 target = fold_edge(ep->succ, edges[k]);
1405 if (target != 0 && !use_conflict(ep->pred, target)) {
1407 ep->succ = target;
1427 struct edge *ep;
1429 ep = b->in_edges;
1430 if (ep == 0)
1437 val = ep->pred->val[A_ATOM];
1438 for (ep = ep->next; ep != 0; ep = ep->next)
1439 if (val != ep->pred->val[A_ATOM])
1500 for (ep = b->in_edges; ep != 0; ep = ep->next) {
1501 if (JT(ep->pred) == b)
1502 JT(ep->pred) = pull;
1504 JF(ep->pred) = pull;
1520 struct edge *ep;
1522 ep = b->in_edges;
1523 if (ep == 0)
1529 val = ep->pred->val[A_ATOM];
1530 for (ep = ep->next; ep != 0; ep = ep->next)
1531 if (val != ep->pred->val[A_ATOM])
1592 for (ep = b->in_edges; ep != 0; ep = ep->next) {
1593 if (JT(ep->pred) == b)
1594 JT(ep->pred) = pull;
1596 JF(ep->pred) = pull;
