259 propedom(struct edge *ep)  in propedom()  argument
261 	SET_INSERT(ep->edom, ep->id);  in propedom()
262 	if (ep->succ) {  in propedom()
263 		SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords);  in propedom()
264 		SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords);  in propedom()
1277 fold_edge(struct block *child, struct edge *ep)  in fold_edge()  argument
1281 	int code = ep->code;  in fold_edge()
1294 	aval1 = ep->pred->val[A_ATOM];  in fold_edge()
1295 	oval1 = ep->pred->oval;  in fold_edge()
1329 opt_j(struct edge *ep)  in opt_j()  argument
1334 	if (JT(ep->succ) == 0)  in opt_j()
1337 	if (JT(ep->succ) == JF(ep->succ)) {  in opt_j()
1342 		if (!use_conflict(ep->pred, ep->succ->et.succ)) {  in opt_j()
1344 			ep->succ = JT(ep->succ);  in opt_j()
1356 		register bpf_u_int32 x = ep->edom[i];  in opt_j()
1363 			target = fold_edge(ep->succ, edges[k]);  in opt_j()
1368 			if (target != 0 && !use_conflict(ep->pred, target)) {  in opt_j()
1370 				ep->succ = target;  in opt_j()
1389 	struct edge *ep;  in or_pullup()  local
1391 	ep = b->in_edges;  in or_pullup()
1392 	if (ep == 0)  in or_pullup()
1399 	val = ep->pred->val[A_ATOM];  in or_pullup()
1400 	for (ep = ep->next; ep != 0; ep = ep->next)  in or_pullup()
1401 		if (val != ep->pred->val[A_ATOM])  in or_pullup()
1462 		for (ep = b->in_edges; ep != 0; ep = ep->next) {  in or_pullup()
1463 			if (JT(ep->pred) == b)  in or_pullup()
1464 				JT(ep->pred) = pull;  in or_pullup()
1466 				JF(ep->pred) = pull;  in or_pullup()
1481 	struct edge *ep;  in and_pullup()  local
1483 	ep = b->in_edges;  in and_pullup()
1484 	if (ep == 0)  in and_pullup()
1490 	val = ep->pred->val[A_ATOM];  in and_pullup()
1491 	for (ep = ep->next; ep != 0; ep = ep->next)  in and_pullup()
1492 		if (val != ep->pred->val[A_ATOM])  in and_pullup()
1553 		for (ep = b->in_edges; ep != 0; ep = ep->next) {  in and_pullup()
1554 			if (JT(ep->pred) == b)  in and_pullup()
1555 				JT(ep->pred) = pull;  in and_pullup()
1557 				JF(ep->pred) = pull;  in and_pullup()