Home
last modified time | relevance | path

Searched refs:insn_cnt (Results 1 – 3 of 3) sorted by relevance

/kernel/bpf/
Dverifier.c1469 int insn_cnt = env->prog->len; in add_subprog() local
1472 if (off >= insn_cnt || off < 0) { in add_subprog()
1494 int insn_cnt = env->prog->len; in check_subprogs() local
1502 for (i = 0; i < insn_cnt; i++) { in check_subprogs()
1520 subprog[env->subprog_cnt].start = insn_cnt; in check_subprogs()
1529 for (i = 0; i < insn_cnt; i++) { in check_subprogs()
8767 int insn_cnt = env->prog->len; in check_cfg() local
8772 insn_state = env->cfg.insn_state = kvcalloc(insn_cnt, sizeof(int), GFP_KERNEL); in check_cfg()
8776 insn_stack = env->cfg.insn_stack = kvcalloc(insn_cnt, sizeof(int), GFP_KERNEL); in check_cfg()
8803 if (t + 1 < insn_cnt) in check_cfg()
[all …]
Dcore.c386 u32 i, insn_cnt = prog->len + (probe_pass ? end_new - end_old : 0); in bpf_adj_branches() local
390 for (i = 0; i < insn_cnt; i++, insn++) { in bpf_adj_branches()
1150 int insn_delta, insn_cnt; in bpf_jit_blind_constants() local
1161 insn_cnt = clone->len; in bpf_jit_blind_constants()
1164 for (i = 0; i < insn_cnt; i++, insn++) { in bpf_jit_blind_constants()
1193 insn_cnt += insn_delta; in bpf_jit_blind_constants()
Dsyscall.c2160 if (attr->insn_cnt == 0 || in bpf_prog_load()
2161 attr->insn_cnt > (bpf_capable() ? BPF_COMPLEXITY_LIMIT_INSNS : BPF_MAXINSNS)) in bpf_prog_load()
2180 prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER); in bpf_prog_load()
2208 prog->len = attr->insn_cnt; in bpf_prog_load()