JF
next = JF(list);
JF(list) = target;
p = !((*p)->sense) ? &JT(*p) : &JF(*p);
return sense ? JT(child) : JF(child);
return JF(child);
if (JT(ep->succ) == JF(ep->succ)) {
diffp = &JF(b->in_edges->pred);
diffp = &JF(*diffp);
samep = &JF(*diffp);
samep = &JF(*samep);
*samep = JF(pull);
JF(pull) = *diffp;
JF(ep->pred) = pull;
diffp = &JF(b->in_edges->pred);
if (JF(*diffp) != JF(b))
if (JF(*samep) != JF(b))
JF(ep->pred) = pull;
link_inedge(&b->ef, JF(b));
while (BPF_CLASS((*b)->s.code) == BPF_JMP && JT(*b) == JF(*b))
make_marks(JF(p));
if (JF(p)->link) {
JF(p) = JF(p)->link;
return count_blocks(JT(p)) + count_blocks(JF(p)) + 1;
number_blks_r(JF(p));
n = count_stmts(JT(p)) + count_stmts(JF(p));
if (convert_code_r(JF(p)) == 0)
off = JF(p)->offset - (p->offset + slen) - 1;
find_levels_r(JF(b));
level = MAX(JT(b)->level, JF(b)->level) + 1;
SET_INTERSECT(JF(b)->dom, b->dom, nodewords);
SET_UNION(JF(b)->closure, b->closure, nodewords);
p->out_use |= JT(p)->in_use | JF(p)->in_use;
JT(b) = JF(b);
JF(b) = tmp;
JT(b) = JF(b);
JF(b) = t;
JT(b) = JF(b);
JF(b) = t;
if (JF(b) != JT(b))
JF(b) = JT(b);
JT(b) = JF(b);