Lines Matching refs:JT

243     if (JT(b))
245         find_levels_r(JT(b));
247         level = MAX(JT(b)->level, JF(b)->level) + 1;
298             if (JT(b) == 0)
300             SET_INTERSECT(JT(b)->dom, b->dom, nodewords);
369             if (JT(b) == 0)
371             SET_UNION(JT(b)->closure, b->closure, nodewords);
556             p->out_use |= JT(p)->in_use | JF(p)->in_use;
715     struct block *tmp = JT(b);
717     JT(b) = JF(b);
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);
1432     if (JT(ep->succ) == 0)
1435     if (JT(ep->succ) == JF(ep->succ))
1444             ep->succ = JT(ep->succ);
1474                 if (JT(target) != 0)
1507     if (JT(b->in_edges->pred) == b)
1508         diffp = &JT(b->in_edges->pred);
1518         if (JT(*diffp) != JT(b))
1536         if (JT(*samep) != JT(b))
1570             if (JT(ep->pred) == b)
1571                 JT(ep->pred) = pull;
1602     if (JT(b->in_edges->pred) == b)
1603         diffp = &JT(b->in_edges->pred);
1622         diffp = &JT(*diffp);
1625     samep = &JT(*diffp);
1643         samep = &JT(*samep);
1653     *samep = JT(pull);
1654     JT(pull) = *diffp;
1665             if (JT(ep->pred) == b)
1666                 JT(ep->pred) = pull;
1744             link_inedge(&b->et, JT(b));
1757     while (BPF_CLASS((*b)->s.code) == BPF_JMP && JT(*b) == JF(*b))
1758         *b = JT(*b);
1845             make_marks(JT(p));
1926         if (JT(p) == 0)
1928         if (JT(p)->link)
1931             JT(p) = JT(p)->link;
1977     return count_blocks(JT(p)) + count_blocks(JF(p)) + 1;
1997     number_blks_r(JT(p));
2027     n = count_stmts(JT(p)) + count_stmts(JF(p));
2153     if (convert_code_r(JT(p)) == 0)
2257     if (JT(p))
2260         off = JT(p)->offset - (p->offset + slen) - 1;