Lines Matching refs:JF

246         find_levels_r(JF(b));
247         level = MAX(JT(b)->level, JF(b)->level) + 1;
301             SET_INTERSECT(JF(b)->dom, b->dom, nodewords);
372             SET_UNION(JF(b)->closure, b->closure, nodewords);
556             p->out_use |= JT(p)->in_use | JF(p)->in_use;
717     JT(b) = JF(b);
718     JF(b) = tmp;
932             JT(b) = JF(b);
934             JF(b) = JT(b);
978         if (JF(b) != JT(b))
981             JF(b) = JT(b);
983             JT(b) = JF(b);
1404         return sense ? JT(child) : JF(child);
1421         return JF(child);
1435     if (JT(ep->succ) == JF(ep->succ))
1510         diffp = &JF(b->in_edges->pred);
1527         diffp = &JF(*diffp);
1530     samep = &JF(*diffp);
1548         samep = &JF(*samep);
1558     *samep = JF(pull);
1559     JF(pull) = *diffp;
1573                 JF(ep->pred) = pull;
1605         diffp = &JF(b->in_edges->pred);
1613         if (JF(*diffp) != JF(b))
1631         if (JF(*samep) != JF(b))
1668                 JF(ep->pred) = pull;
1745             link_inedge(&b->ef, JF(b));
1757     while (BPF_CLASS((*b)->s.code) == BPF_JMP && JT(*b) == JF(*b))
1846             make_marks(JF(p));
1933         if (JF(p)->link)
1936             JF(p) = JF(p)->link;
1977     return count_blocks(JT(p)) + count_blocks(JF(p)) + 1;
1998     number_blks_r(JF(p));
2027     n = count_stmts(JT(p)) + count_stmts(JF(p));
2151     if (convert_code_r(JF(p)) == 0)
2278         off = JF(p)->offset - (p->offset + slen) - 1;