199 	if (JT(b)) {  in find_levels_r()
200 		find_levels_r(JT(b));  in find_levels_r()
202 		level = MAX(JT(b)->level, JF(b)->level) + 1;  in find_levels_r()
250 			if (JT(b) == 0)  in find_dom()
252 			SET_INTERSECT(JT(b)->dom, b->dom, nodewords);  in find_dom()
317 			if (JT(b) == 0)  in find_closure()
319 			SET_UNION(JT(b)->closure, b->closure, nodewords);  in find_closure()
492 			p->out_use |= JT(p)->in_use | JF(p)->in_use;  in find_ud()
654 	struct block *tmp = JT(b);  in opt_not()
656 	JT(b) = JF(b);  in opt_not()
865 			JT(b) = JF(b);  in opt_peep()
867 			JF(b) = JT(b);  in opt_peep()
908 		if (JF(b) != JT(b))  in opt_peep()
911 			JF(b) = JT(b);  in opt_peep()
913 			JT(b) = JF(b);  in opt_peep()
1306 		return sense ? JT(child) : JF(child);  in fold_edge()
1334 	if (JT(ep->succ) == 0)  in opt_j()
1337 	if (JT(ep->succ) == JF(ep->succ)) {  in opt_j()
1344 			ep->succ = JT(ep->succ);  in opt_j()
1371 				if (JT(target) != 0)  in opt_j()
1404 	if (JT(b->in_edges->pred) == b)  in or_pullup()
1405 		diffp = &JT(b->in_edges->pred);  in or_pullup()
1414 		if (JT(*diffp) != JT(b))  in or_pullup()
1431 		if (JT(*samep) != JT(b))  in or_pullup()
1463 			if (JT(ep->pred) == b)  in or_pullup()
1464 				JT(ep->pred) = pull;  in or_pullup()
1495 	if (JT(b->in_edges->pred) == b)  in and_pullup()
1496 		diffp = &JT(b->in_edges->pred);  in and_pullup()
1514 		diffp = &JT(*diffp);  in and_pullup()
1517 	samep = &JT(*diffp);  in and_pullup()
1534 		samep = &JT(*samep);  in and_pullup()
1544 	*samep = JT(pull);  in and_pullup()
1545 	JT(pull) = *diffp;  in and_pullup()
1554 			if (JT(ep->pred) == b)  in and_pullup()
1555 				JT(ep->pred) = pull;  in and_pullup()
1625 			link_inedge(&b->et, JT(b));  in find_inedges()
1638 	while (BPF_CLASS((*b)->s.code) == BPF_JMP && JT(*b) == JF(*b))  in opt_root()
1639 		*b = JT(*b);  in opt_root()
1718 			make_marks(JT(p));  in make_marks()
1797 		if (JT(p) == 0)  in intern_blocks()
1799 		if (JT(p)->link) {  in intern_blocks()
1801 			JT(p) = JT(p)->link;  in intern_blocks()
1847 	return count_blocks(JT(p)) + count_blocks(JF(p)) + 1;  in count_blocks()
1867 	number_blks_r(JT(p));  in number_blks_r()
1897 	n = count_stmts(JT(p)) + count_stmts(JF(p));  in count_stmts()
2020 	if (convert_code_r(JT(p)) == 0)  in convert_code_r()
2118 	if (JT(p)) {  in convert_code_r()
2120 		off = JT(p)->offset - (p->offset + slen) - 1;  in convert_code_r()
2270 	if (JT(block) == NULL)  in dot_dump_node()
2274 	dot_dump_node(JT(block), prog, out);  in dot_dump_node()
2284 	if (JT(block)) {  in dot_dump_edge()
2286 				block->id, JT(block)->id);  in dot_dump_edge()
2290 	dot_dump_edge(JT(block), out);  in dot_dump_edge()