Lines Matching refs:curframe
914 for (i = 0; i <= state->curframe; i++) { in free_verifier_state()
952 for (i = src->curframe + 1; i <= dst_state->curframe; i++) { in copy_verifier_state()
957 dst_state->curframe = src->curframe; in copy_verifier_state()
963 for (i = 0; i <= src->curframe; i++) { in copy_verifier_state()
2224 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_reg_arg()
2516 for (i = 0; i <= st->curframe; i++) { in mark_all_scalars_precise()
2552 func = st->frame[st->curframe]; in __mark_chain_precision()
2633 func = st->frame[st->curframe]; in __mark_chain_precision()
2822 cur = env->cur_state->frame[env->cur_state->curframe]; in check_stack_write_fixed_off()
2938 cur = env->cur_state->frame[env->cur_state->curframe]; in check_stack_write_var_off()
3022 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in mark_reg_stack_read()
3073 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_stack_read_fixed_off()
3369 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_mem_region_access()
3427 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_map_access()
5831 for (i = 0; i <= vstate->curframe; i++) in clear_all_pkt_pointers()
5842 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in mark_pkt_end()
5894 for (i = 0; i <= vstate->curframe; i++) in release_reference()
5927 if (state->curframe + 1 >= MAX_CALL_FRAMES) { in __check_func_call()
5929 state->curframe + 2); in __check_func_call()
5933 caller = state->frame[state->curframe]; in __check_func_call()
5934 if (state->frame[state->curframe + 1]) { in __check_func_call()
5936 state->curframe + 1); in __check_func_call()
5995 state->frame[state->curframe + 1] = callee; in __check_func_call()
6004 state->curframe + 1 /* frameno within this callchain */, in __check_func_call()
6019 state->curframe++; in __check_func_call()
6155 callee = state->frame[state->curframe]; in prepare_func_exit()
6168 state->curframe--; in prepare_func_exit()
6169 caller = state->frame[state->curframe]; in prepare_func_exit()
6201 state->frame[state->curframe + 1] = NULL; in prepare_func_exit()
6948 regs = branch->frame[branch->curframe]->regs; in sanitize_speculative_path()
7184 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in adjust_ptr_min_max_vals()
8148 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in adjust_reg_min_max_vals()
8493 for (i = 0; i <= vstate->curframe; i++) in find_good_pkt_pointers()
9022 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in mark_ptr_or_null_regs()
9035 for (i = 0; i <= vstate->curframe; i++) in mark_ptr_or_null_regs()
9151 for (i = 0; i <= vstate->curframe; i++) { in find_equal_scalars()
9173 struct bpf_reg_state *regs = this_branch->frame[this_branch->curframe]->regs; in check_cond_jmp_op()
9279 other_branch_regs = other_branch->frame[other_branch->curframe]->regs; in check_cond_jmp_op()
9356 print_verifier_state(env, this_branch->frame[this_branch->curframe]); in check_cond_jmp_op()
9737 struct bpf_func_state *state = cur->frame[cur->curframe]; in explored_state()
10369 for (i = 0; i <= st->curframe; i++) in clean_verifier_state()
10416 sl->state.curframe != cur->curframe) in clean_live_states()
10418 for (i = 0; i <= cur->curframe; i++) in clean_live_states()
10670 if (old->curframe != cur->curframe) in states_equal()
10685 for (i = 0; i <= old->curframe; i++) { in states_equal()
10738 if (vparent->curframe != vstate->curframe) { in propagate_liveness()
10740 vparent->curframe, vstate->curframe); in propagate_liveness()
10745 for (frame = 0; frame <= vstate->curframe; frame++) { in propagate_liveness()
10751 for (i = frame < vstate->curframe ? BPF_REG_6 : 0; i < BPF_REG_FP; i++) { in propagate_liveness()
10784 state = old->frame[old->curframe]; in propagate_precision()
10818 int i, fr = cur->curframe; in states_maybe_looping()
10820 if (old->curframe != fr) in states_maybe_looping()
10871 struct bpf_func_state *frame = sl->state.frame[sl->state.curframe]; in is_state_visited()
10874 frame->async_entry_cnt != cur->frame[cur->curframe]->async_entry_cnt) { in is_state_visited()
11034 for (j = 0; j <= cur->curframe; j++) { in is_state_visited()
11035 for (i = j < cur->curframe ? BPF_REG_6 : 0; i < BPF_REG_FP; i++) in is_state_visited()
11042 for (j = 0; j <= cur->curframe; j++) { in is_state_visited()
11157 print_verifier_state(env, state->frame[state->curframe]); in do_check()
11362 if (state->curframe) { in do_check()
13351 state->curframe = 0; in do_check_common()
13365 regs = state->frame[state->curframe]->regs; in do_check_common()