Lines Matching refs:JT
203 if (JT(b)) {
204 find_levels_r(JT(b));
206 level = MAX(JT(b)->level, JF(b)->level) + 1;
254 if (JT(b) == 0)
256 SET_INTERSECT(JT(b)->dom, b->dom, nodewords);
321 if (JT(b) == 0)
323 SET_UNION(JT(b)->closure, b->closure, nodewords);
496 p->out_use |= JT(p)->in_use | JF(p)->in_use;
648 struct block *tmp = JT(b);
650 JT(b) = JF(b);
859 JT(b) = JF(b);
861 JF(b) = JT(b);
902 if (JF(b) != JT(b))
905 JF(b) = JT(b);
907 JT(b) = JF(b);
1296 return sense ? JT(child) : JF(child);
1324 if (JT(ep->succ) == 0)
1327 if (JT(ep->succ) == JF(ep->succ)) {
1334 ep->succ = JT(ep->succ);
1361 if (JT(target) != 0)
1394 if (JT(b->in_edges->pred) == b)
1395 diffp = &JT(b->in_edges->pred);
1404 if (JT(*diffp) != JT(b))
1421 if (JT(*samep) != JT(b))
1453 if (JT(ep->pred) == b)
1454 JT(ep->pred) = pull;
1485 if (JT(b->in_edges->pred) == b)
1486 diffp = &JT(b->in_edges->pred);
1504 diffp = &JT(*diffp);
1507 samep = &JT(*diffp);
1524 samep = &JT(*samep);
1534 *samep = JT(pull);
1535 JT(pull) = *diffp;
1544 if (JT(ep->pred) == b)
1545 JT(ep->pred) = pull;
1615 link_inedge(&b->et, JT(b));
1628 while (BPF_CLASS((*b)->s.code) == BPF_JMP && JT(*b) == JF(*b))
1629 *b = JT(*b);
1708 make_marks(JT(p));
1787 if (JT(p) == 0)
1789 if (JT(p)->link) {
1791 JT(p) = JT(p)->link;
1837 return count_blocks(JT(p)) + count_blocks(JF(p)) + 1;
1857 number_blks_r(JT(p));
1869 * statements in the true branch from 'p' (count_stmts(JT(p)));
1887 n = count_stmts(JT(p)) + count_stmts(JF(p));
2010 if (convert_code_r(JT(p)) == 0)
2046 if (src->s.jt || src->s.jf) {
2058 int jt, jf;
2063 off, src->s.jt, src->s.jf);
2066 if (!src->s.jt || !src->s.jf) {
2071 jt = jf = 0;
2073 if (offset[i] == src->s.jt) {
2074 if (jt) {
2079 dst->jt = i - off - 1;
2080 jt++;
2091 if (!jt || !jf) {
2108 if (JT(p)) {
2110 off = JT(p)->offset - (p->offset + slen) - 1;
2119 dst->jt = extrajmps;
2125 dst->jt = off;
