Lines Matching refs:JT
228 if (JT(b)) {
229 find_levels_r(JT(b));
231 level = MAX(JT(b)->level, JF(b)->level) + 1;
281 if (JT(b) == 0)
283 SET_INTERSECT(JT(b)->dom, b->dom, nodewords);
351 if (JT(b) == 0)
353 SET_UNION(JT(b)->closure, b->closure, nodewords);
530 p->out_use |= JT(p)->in_use | JF(p)->in_use;
692 struct block *tmp = JT(b);
694 JT(b) = JF(b);
904 JT(b) = JF(b);
906 JF(b) = JT(b);
936 if (JF(b) != JT(b))
939 JF(b) = JT(b);
941 JT(b) = JF(b);
1341 return sense ? JT(child) : JF(child);
1371 if (JT(ep->succ) == 0)
1374 if (JT(ep->succ) == JF(ep->succ)) {
1381 ep->succ = JT(ep->succ);
1408 if (JT(target) != 0)
1442 if (JT(b->in_edges->pred) == b)
1443 diffp = &JT(b->in_edges->pred);
1452 if (JT(*diffp) != JT(b))
1469 if (JT(*samep) != JT(b))
1501 if (JT(ep->pred) == b)
1502 JT(ep->pred) = pull;
1534 if (JT(b->in_edges->pred) == b)
1535 diffp = &JT(b->in_edges->pred);
1553 diffp = &JT(*diffp);
1556 samep = &JT(*diffp);
1573 samep = &JT(*samep);
1583 *samep = JT(pull);
1584 JT(pull) = *diffp;
1593 if (JT(ep->pred) == b)
1594 JT(ep->pred) = pull;
1669 link_inedge(&b->et, JT(b));
1683 while (BPF_CLASS((*b)->s.code) == BPF_JMP && JT(*b) == JF(*b))
1684 *b = JT(*b);
1767 make_marks(JT(p));
1850 if (JT(p) == 0)
1852 if (JT(p)->link) {
1854 JT(p) = JT(p)->link;
1902 return count_blocks(JT(p)) + count_blocks(JF(p)) + 1;
1923 number_blks_r(JT(p));
1935 * statements in the true branch from 'p' (count_stmts(JT(p)));
1954 n = count_stmts(JT(p)) + count_stmts(JF(p));
2079 if (convert_code_r(JT(p)) == 0)
2115 if (src->s.jt || src->s.jf) {
2127 int jt, jf;
2132 off, src->s.jt, src->s.jf);
2135 if (!src->s.jt || !src->s.jf) {
2140 jt = jf = 0;
2142 if (offset[i] == src->s.jt) {
2143 if (jt) {
2148 dst->jt = i - off - 1;
2149 jt++;
2160 if (!jt || !jf) {
2177 if (JT(p)) {
2179 off = JT(p)->offset - (p->offset + slen) - 1;
2188 dst->jt = extrajmps;
2194 dst->jt = off;
