Lines Matching refs:JF
230 find_levels_r(JF(b));
231 level = MAX(JT(b)->level, JF(b)->level) + 1;
284 SET_INTERSECT(JF(b)->dom, b->dom, nodewords);
354 SET_UNION(JF(b)->closure, b->closure, nodewords);
530 p->out_use |= JT(p)->in_use | JF(p)->in_use;
694 JT(b) = JF(b);
695 JF(b) = tmp;
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);
1358 return JF(child);
1374 if (JT(ep->succ) == JF(ep->succ)) {
1445 diffp = &JF(b->in_edges->pred);
1461 diffp = &JF(*diffp);
1464 samep = &JF(*diffp);
1481 samep = &JF(*samep);
1491 *samep = JF(pull);
1492 JF(pull) = *diffp;
1504 JF(ep->pred) = pull;
1537 diffp = &JF(b->in_edges->pred);
1544 if (JF(*diffp) != JF(b))
1561 if (JF(*samep) != JF(b))
1596 JF(ep->pred) = pull;
1670 link_inedge(&b->ef, JF(b));
1683 while (BPF_CLASS((*b)->s.code) == BPF_JMP && JT(*b) == JF(*b))
1768 make_marks(JF(p));
1856 if (JF(p)->link) {
1858 JF(p) = JF(p)->link;
1902 return count_blocks(JT(p)) + count_blocks(JF(p)) + 1;
1924 number_blks_r(JF(p));
1937 * statements in the false branch from 'p' (count_stmts(JF(p)));
1954 n = count_stmts(JT(p)) + count_stmts(JF(p));
2077 if (convert_code_r(JF(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;
2151 if (offset[i] == src->s.jf) {
2152 if (jf) {
2156 dst->jf = i - off - 1;
2157 jf++;
2160 if (!jt || !jf) {
2195 off = JF(p)->offset - (p->offset + slen) - 1;
2205 dst->jf = extrajmps;
2211 dst->jf = off;
