Lines Matching refs:ic
241 find_levels_r(opt_state_t *opt_state, struct icode *ic, struct block *b) in find_levels_r() argument
245 if (isMarked(ic, b)) in find_levels_r()
248 Mark(ic, b); in find_levels_r()
252 find_levels_r(opt_state, ic, JT(b)); in find_levels_r()
253 find_levels_r(opt_state, ic, JF(b)); in find_levels_r()
269 find_levels(opt_state_t *opt_state, struct icode *ic) in find_levels() argument
272 unMarkAll(ic); in find_levels()
273 find_levels_r(opt_state, ic, ic->root); in find_levels()
604 fold_op(compiler_state_t *cstate, struct icode *ic, opt_state_t *opt_state, in fold_op() argument
946 opt_stmt(compiler_state_t *cstate, struct icode *ic, opt_state_t *opt_state, in opt_stmt() argument
1035 fold_op(cstate, ic, opt_state, s, val[A_ATOM], K(s->k)); in opt_stmt()
1056 fold_op(cstate, ic, opt_state, s, val[A_ATOM], val[X_ATOM]); in opt_stmt()
1180 opt_blk(compiler_state_t *cstate, struct icode *ic, opt_state_t *opt_state, in opt_blk() argument
1231 opt_stmt(cstate, ic, opt_state, &s->s, b->val, do_stmts); in opt_blk()
1591 opt_blks(compiler_state_t *cstate, opt_state_t *opt_state, struct icode *ic, in opt_blks() argument
1598 maxlevel = ic->root->level; in opt_blks()
1600 find_inedges(opt_state, ic->root); in opt_blks()
1603 opt_blk(cstate, ic, opt_state, p, do_stmts); in opt_blks()
1619 find_inedges(opt_state, ic->root); in opt_blks()
1681 opt_loop(compiler_state_t *cstate, opt_state_t *opt_state, struct icode *ic, in opt_loop() argument
1688 opt_dump(cstate, ic); in opt_loop()
1693 find_levels(opt_state, ic); in opt_loop()
1694 find_dom(opt_state, ic->root); in opt_loop()
1695 find_closure(opt_state, ic->root); in opt_loop()
1696 find_ud(opt_state, ic->root); in opt_loop()
1697 find_edom(opt_state, ic->root); in opt_loop()
1698 opt_blks(cstate, opt_state, ic, do_stmts); in opt_loop()
1702 opt_dump(cstate, ic); in opt_loop()
1712 bpf_optimize(compiler_state_t *cstate, struct icode *ic) in bpf_optimize() argument
1716 opt_init(cstate, &opt_state, ic); in bpf_optimize()
1717 opt_loop(cstate, &opt_state, ic, 0); in bpf_optimize()
1718 opt_loop(cstate, &opt_state, ic, 1); in bpf_optimize()
1719 intern_blocks(&opt_state, ic); in bpf_optimize()
1723 opt_dump(cstate, ic); in bpf_optimize()
1726 opt_root(&ic->root); in bpf_optimize()
1730 opt_dump(cstate, ic); in bpf_optimize()
1737 make_marks(struct icode *ic, struct block *p) in make_marks() argument
1739 if (!isMarked(ic, p)) { in make_marks()
1740 Mark(ic, p); in make_marks()
1742 make_marks(ic, JT(p)); in make_marks()
1743 make_marks(ic, JF(p)); in make_marks()
1753 mark_code(struct icode *ic) in mark_code() argument
1755 ic->cur_mark += 1; in mark_code()
1756 make_marks(ic, ic->root); in mark_code()
1794 intern_blocks(opt_state_t *opt_state, struct icode *ic) in intern_blocks() argument
1804 mark_code(ic); in intern_blocks()
1807 if (!isMarked(ic, opt_state->blocks[i])) in intern_blocks()
1810 if (!isMarked(ic, opt_state->blocks[j])) in intern_blocks()
1866 count_blocks(struct icode *ic, struct block *p) in count_blocks() argument
1868 if (p == 0 || isMarked(ic, p)) in count_blocks()
1870 Mark(ic, p); in count_blocks()
1871 return count_blocks(ic, JT(p)) + count_blocks(ic, JF(p)) + 1; in count_blocks()
1879 number_blks_r(opt_state_t *opt_state, struct icode *ic, struct block *p) in number_blks_r() argument
1883 if (p == 0 || isMarked(ic, p)) in number_blks_r()
1886 Mark(ic, p); in number_blks_r()
1891 number_blks_r(opt_state, ic, JT(p)); in number_blks_r()
1892 number_blks_r(opt_state, ic, JF(p)); in number_blks_r()
1914 count_stmts(struct icode *ic, struct block *p) in count_stmts() argument
1918 if (p == 0 || isMarked(ic, p)) in count_stmts()
1920 Mark(ic, p); in count_stmts()
1921 n = count_stmts(ic, JT(p)) + count_stmts(ic, JF(p)); in count_stmts()
1931 opt_init(compiler_state_t *cstate, opt_state_t *opt_state, struct icode *ic) in opt_init() argument
1940 unMarkAll(ic); in opt_init()
1941 n = count_blocks(ic, ic->root); in opt_init()
1945 unMarkAll(ic); in opt_init()
1947 number_blks_r(opt_state, ic, ic->root); in opt_init()
2027 struct icode *ic, struct block *p) in convert_code_r() argument
2036 if (p == 0 || isMarked(ic, p)) in convert_code_r()
2038 Mark(ic, p); in convert_code_r()
2040 if (convert_code_r(cstate, conv_state, ic, JF(p)) == 0) in convert_code_r()
2042 if (convert_code_r(cstate, conv_state, ic, JT(p)) == 0) in convert_code_r()
2199 icode_to_fcode(compiler_state_t *cstate, struct icode *ic, in icode_to_fcode() argument
2211 unMarkAll(ic); in icode_to_fcode()
2212 n = *lenp = count_stmts(ic, root); in icode_to_fcode()
2221 unMarkAll(ic); in icode_to_fcode()
2222 if (convert_code_r(cstate, &conv_state, ic, root)) in icode_to_fcode()
2271 dot_dump_node(struct icode *ic, struct block *block, struct bpf_program *prog, in dot_dump_node() argument
2277 if (block == NULL || isMarked(ic, block)) in dot_dump_node()
2279 Mark(ic, block); in dot_dump_node()
2299 dot_dump_node(ic, JT(block), prog, out); in dot_dump_node()
2300 dot_dump_node(ic, JF(block), prog, out); in dot_dump_node()
2304 dot_dump_edge(struct icode *ic, struct block *block, FILE *out) in dot_dump_edge() argument
2306 if (block == NULL || isMarked(ic, block)) in dot_dump_edge()
2308 Mark(ic, block); in dot_dump_edge()
2316 dot_dump_edge(ic, JT(block), out); in dot_dump_edge()
2317 dot_dump_edge(ic, JF(block), out); in dot_dump_edge()
2340 dot_dump(compiler_state_t *cstate, struct icode *ic) in dot_dump() argument
2346 f.bf_insns = icode_to_fcode(cstate, ic, ic->root, &f.bf_len); in dot_dump()
2349 ic->cur_mark = 0; in dot_dump()
2350 unMarkAll(ic); in dot_dump()
2351 dot_dump_node(ic, ic->root, &f, out); in dot_dump()
2352 ic->cur_mark = 0; in dot_dump()
2353 unMarkAll(ic); in dot_dump()
2354 dot_dump_edge(ic, ic->root, out); in dot_dump()
2361 plain_dump(compiler_state_t *cstate, struct icode *ic) in plain_dump() argument
2366 f.bf_insns = icode_to_fcode(cstate, ic, ic->root, &f.bf_len); in plain_dump()
2373 opt_dump(compiler_state_t *cstate, struct icode *ic) in opt_dump() argument
2380 dot_dump(cstate, ic); in opt_dump()
2382 plain_dump(cstate, ic); in opt_dump()