Lines Matching refs:curframe
1375 for (i = 0; i <= state->curframe; i++) { in free_verifier_state()
1413 for (i = src->curframe + 1; i <= dst_state->curframe; i++) { in copy_verifier_state()
1419 dst_state->curframe = src->curframe; in copy_verifier_state()
1426 for (i = 0; i <= src->curframe; i++) { in copy_verifier_state()
2729 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_reg_arg()
3052 for (i = 0; i <= st->curframe; i++) { in mark_all_scalars_precise()
3078 for (i = 0; i <= st->curframe; i++) { in mark_all_scalars_imprecise()
3247 if (st->curframe == 0 && in __mark_chain_precision()
3374 return __mark_chain_precision(env, env->cur_state->curframe, regno, -1); in mark_chain_precision()
3509 cur = env->cur_state->frame[env->cur_state->curframe]; in check_stack_write_fixed_off()
3641 cur = env->cur_state->frame[env->cur_state->curframe]; in check_stack_write_var_off()
3738 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in mark_reg_stack_read()
3789 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_stack_read_fixed_off()
4085 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_mem_region_access()
4306 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_map_access()
7377 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in mark_pkt_end()
7466 if (state->curframe + 1 >= MAX_CALL_FRAMES) { in __check_func_call()
7468 state->curframe + 2); in __check_func_call()
7472 caller = state->frame[state->curframe]; in __check_func_call()
7473 if (state->frame[state->curframe + 1]) { in __check_func_call()
7475 state->curframe + 1); in __check_func_call()
7553 state->frame[state->curframe + 1] = callee; in __check_func_call()
7562 state->curframe + 1 /* frameno within this callchain */, in __check_func_call()
7577 state->curframe++; in __check_func_call()
7592 state->frame[state->curframe + 1] = NULL; in __check_func_call()
7831 if (!state->curframe) in in_rbtree_lock_required_cb()
7834 callee = state->frame[state->curframe]; in in_rbtree_lock_required_cb()
7850 callee = state->frame[state->curframe]; in prepare_func_exit()
7863 caller = state->frame[state->curframe - 1]; in prepare_func_exit()
7902 state->frame[state->curframe--] = NULL; in prepare_func_exit()
10237 regs = branch->frame[branch->curframe]->regs; in sanitize_speculative_path()
10473 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in adjust_ptr_min_max_vals()
11429 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in adjust_reg_min_max_vals()
12270 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in mark_ptr_or_null_regs()
12409 struct bpf_reg_state *regs = this_branch->frame[this_branch->curframe]->regs; in check_cond_jmp_op()
12516 other_branch_regs = other_branch->frame[other_branch->curframe]->regs; in check_cond_jmp_op()
12630 print_insn_state(env, this_branch->frame[this_branch->curframe]); in check_cond_jmp_op()
13048 struct bpf_func_state *state = cur->frame[cur->curframe]; in explored_state()
13763 for (i = 0; i <= st->curframe; i++) in clean_verifier_state()
13810 sl->state.curframe != cur->curframe) in clean_live_states()
13812 for (i = 0; i <= cur->curframe; i++) in clean_live_states()
14070 if (old->curframe != cur->curframe) in states_equal()
14100 for (i = 0; i <= old->curframe; i++) { in states_equal()
14153 if (vparent->curframe != vstate->curframe) { in propagate_liveness()
14155 vparent->curframe, vstate->curframe); in propagate_liveness()
14160 for (frame = 0; frame <= vstate->curframe; frame++) { in propagate_liveness()
14166 for (i = frame < vstate->curframe ? BPF_REG_6 : 0; i < BPF_REG_FP; i++) { in propagate_liveness()
14199 for (fr = old->curframe; fr >= 0; fr--) { in propagate_precision()
14235 int i, fr = cur->curframe; in states_maybe_looping()
14237 if (old->curframe != fr) in states_maybe_looping()
14281 struct bpf_func_state *frame = sl->state.frame[sl->state.curframe]; in is_state_visited()
14284 frame->async_entry_cnt != cur->frame[cur->curframe]->async_entry_cnt) { in is_state_visited()
14448 for (j = 0; j <= cur->curframe; j++) { in is_state_visited()
14449 for (i = j < cur->curframe ? BPF_REG_6 : 0; i < BPF_REG_FP; i++) in is_state_visited()
14456 for (j = 0; j <= cur->curframe; j++) { in is_state_visited()
14573 print_verifier_state(env, state->frame[state->curframe], true); in do_check()
14585 print_insn_state(env, state->frame[state->curframe]); in do_check()
14803 if (state->curframe) { in do_check()
17037 state->curframe = 0; in do_check_common()
17053 regs = state->frame[state->curframe]->regs; in do_check_common()