Lines Matching refs:curframe
906 for (i = 0; i <= state->curframe; i++) { in free_verifier_state()
944 for (i = src->curframe + 1; i <= dst_state->curframe; i++) { in copy_verifier_state()
949 dst_state->curframe = src->curframe; in copy_verifier_state()
955 for (i = 0; i <= src->curframe; i++) { in copy_verifier_state()
2076 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_reg_arg()
2367 for (i = 0; i <= st->curframe; i++) { in mark_all_scalars_precise()
2403 func = st->frame[st->curframe]; in __mark_chain_precision()
2484 func = st->frame[st->curframe]; in __mark_chain_precision()
2667 cur = env->cur_state->frame[env->cur_state->curframe]; in check_stack_write_fixed_off()
2783 cur = env->cur_state->frame[env->cur_state->curframe]; in check_stack_write_var_off()
2867 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in mark_reg_stack_read()
2918 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_stack_read_fixed_off()
3195 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_mem_region_access()
3253 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_map_access()
5616 for (i = 0; i <= vstate->curframe; i++) in clear_all_pkt_pointers()
5627 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in mark_pkt_end()
5679 for (i = 0; i <= vstate->curframe; i++) in release_reference()
5712 if (state->curframe + 1 >= MAX_CALL_FRAMES) { in __check_func_call()
5714 state->curframe + 2); in __check_func_call()
5718 caller = state->frame[state->curframe]; in __check_func_call()
5719 if (state->frame[state->curframe + 1]) { in __check_func_call()
5721 state->curframe + 1); in __check_func_call()
5780 state->frame[state->curframe + 1] = callee; in __check_func_call()
5789 state->curframe + 1 /* frameno within this callchain */, in __check_func_call()
5804 state->curframe++; in __check_func_call()
5940 callee = state->frame[state->curframe]; in prepare_func_exit()
5953 state->curframe--; in prepare_func_exit()
5954 caller = state->frame[state->curframe]; in prepare_func_exit()
5986 state->frame[state->curframe + 1] = NULL; in prepare_func_exit()
6723 regs = branch->frame[branch->curframe]->regs; in sanitize_speculative_path()
6959 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in adjust_ptr_min_max_vals()
7923 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in adjust_reg_min_max_vals()
8264 for (i = 0; i <= vstate->curframe; i++) in find_good_pkt_pointers()
8793 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in mark_ptr_or_null_regs()
8806 for (i = 0; i <= vstate->curframe; i++) in mark_ptr_or_null_regs()
8922 for (i = 0; i <= vstate->curframe; i++) { in find_equal_scalars()
8944 struct bpf_reg_state *regs = this_branch->frame[this_branch->curframe]->regs; in check_cond_jmp_op()
9050 other_branch_regs = other_branch->frame[other_branch->curframe]->regs; in check_cond_jmp_op()
9127 print_verifier_state(env, this_branch->frame[this_branch->curframe]); in check_cond_jmp_op()
9507 struct bpf_func_state *state = cur->frame[cur->curframe]; in explored_state()
10139 for (i = 0; i <= st->curframe; i++) in clean_verifier_state()
10186 sl->state.curframe != cur->curframe) in clean_live_states()
10188 for (i = 0; i <= cur->curframe; i++) in clean_live_states()
10440 if (old->curframe != cur->curframe) in states_equal()
10455 for (i = 0; i <= old->curframe; i++) { in states_equal()
10508 if (vparent->curframe != vstate->curframe) { in propagate_liveness()
10510 vparent->curframe, vstate->curframe); in propagate_liveness()
10515 for (frame = 0; frame <= vstate->curframe; frame++) { in propagate_liveness()
10521 for (i = frame < vstate->curframe ? BPF_REG_6 : 0; i < BPF_REG_FP; i++) { in propagate_liveness()
10554 state = old->frame[old->curframe]; in propagate_precision()
10588 int i, fr = cur->curframe; in states_maybe_looping()
10590 if (old->curframe != fr) in states_maybe_looping()
10641 struct bpf_func_state *frame = sl->state.frame[sl->state.curframe]; in is_state_visited()
10644 frame->async_entry_cnt != cur->frame[cur->curframe]->async_entry_cnt) { in is_state_visited()
10804 for (j = 0; j <= cur->curframe; j++) { in is_state_visited()
10805 for (i = j < cur->curframe ? BPF_REG_6 : 0; i < BPF_REG_FP; i++) in is_state_visited()
10812 for (j = 0; j <= cur->curframe; j++) { in is_state_visited()
10927 print_verifier_state(env, state->frame[state->curframe]); in do_check()
11131 if (state->curframe) { in do_check()
13104 state->curframe = 0; in do_check_common()
13118 regs = state->frame[state->curframe]->regs; in do_check_common()