Lines Matching refs:JF
205 find_levels_r(JF(b));
206 level = MAX(JT(b)->level, JF(b)->level) + 1;
257 SET_INTERSECT(JF(b)->dom, b->dom, nodewords);
324 SET_UNION(JF(b)->closure, b->closure, nodewords);
496 p->out_use |= JT(p)->in_use | JF(p)->in_use;
650 JT(b) = JF(b);
651 JF(b) = tmp;
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);
1313 return JF(child);
1327 if (JT(ep->succ) == JF(ep->succ)) {
1397 diffp = &JF(b->in_edges->pred);
1413 diffp = &JF(*diffp);
1416 samep = &JF(*diffp);
1433 samep = &JF(*samep);
1443 *samep = JF(pull);
1444 JF(pull) = *diffp;
1456 JF(ep->pred) = pull;
1488 diffp = &JF(b->in_edges->pred);
1495 if (JF(*diffp) != JF(b))
1512 if (JF(*samep) != JF(b))
1547 JF(ep->pred) = pull;
1616 link_inedge(&b->ef, JF(b));
1628 while (BPF_CLASS((*b)->s.code) == BPF_JMP && JT(*b) == JF(*b))
1709 make_marks(JF(p));
1793 if (JF(p)->link) {
1795 JF(p) = JF(p)->link;
1837 return count_blocks(JT(p)) + count_blocks(JF(p)) + 1;
1858 number_blks_r(JF(p));
1871 * statements in the false branch from 'p' (count_stmts(JF(p)));
1887 n = count_stmts(JT(p)) + count_stmts(JF(p));
2008 if (convert_code_r(JF(p)) == 0)
2126 off = JF(p)->offset - (p->offset + slen) - 1;