1168 	for (i = 0; i <= state->curframe; i++) {  in free_verifier_state()
1206 	for (i = src->curframe + 1; i <= dst_state->curframe; i++) {  in copy_verifier_state()
1211 	dst_state->curframe = src->curframe;  in copy_verifier_state()
1217 	for (i = 0; i <= src->curframe; i++) {  in copy_verifier_state()
2462 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in check_reg_arg()
2758 		for (i = 0; i <= st->curframe; i++) {  in mark_all_scalars_precise()
2941 	return __mark_chain_precision(env, env->cur_state->curframe, regno, -1);  in mark_chain_precision()
3059 	cur = env->cur_state->frame[env->cur_state->curframe];  in check_stack_write_fixed_off()
3178 	cur = env->cur_state->frame[env->cur_state->curframe];  in check_stack_write_var_off()
3266 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in mark_reg_stack_read()
3317 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in check_stack_read_fixed_off()
3613 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in check_mem_region_access()
3834 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in check_map_access()
6609 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in mark_pkt_end()
6681 	if (state->curframe + 1 >= MAX_CALL_FRAMES) {  in __check_func_call()
6683 			state->curframe + 2);  in __check_func_call()
6687 	caller = state->frame[state->curframe];  in __check_func_call()
6688 	if (state->frame[state->curframe + 1]) {  in __check_func_call()
6690 			state->curframe + 1);  in __check_func_call()
6750 	state->frame[state->curframe + 1] = callee;  in __check_func_call()
6759 			state->curframe + 1 /* frameno within this callchain */,  in __check_func_call()
6774 	state->curframe++;  in __check_func_call()
6789 	state->frame[state->curframe + 1] = NULL;  in __check_func_call()
6991 	callee = state->frame[state->curframe];  in prepare_func_exit()
7004 	caller = state->frame[state->curframe - 1];  in prepare_func_exit()
7043 	state->frame[state->curframe--] = NULL;  in prepare_func_exit()
7990 		regs = branch->frame[branch->curframe]->regs;  in sanitize_speculative_path()
8226 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in adjust_ptr_min_max_vals()
9182 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in adjust_reg_min_max_vals()
10018 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in mark_ptr_or_null_regs()
10157 	struct bpf_reg_state *regs = this_branch->frame[this_branch->curframe]->regs;  in check_cond_jmp_op()
10263 	other_branch_regs = other_branch->frame[other_branch->curframe]->regs;  in check_cond_jmp_op()
10340 		print_insn_state(env, this_branch->frame[this_branch->curframe]);  in check_cond_jmp_op()
10753 	struct bpf_func_state *state = cur->frame[cur->curframe];  in explored_state()
11460 	for (i = 0; i <= st->curframe; i++)  in clean_verifier_state()
11507 		    sl->state.curframe != cur->curframe)  in clean_live_states()
11509 		for (i = 0; i <= cur->curframe; i++)  in clean_live_states()
11760 	if (old->curframe != cur->curframe)  in states_equal()
11775 	for (i = 0; i <= old->curframe; i++) {  in states_equal()
11828 	if (vparent->curframe != vstate->curframe) {  in propagate_liveness()
11830 		     vparent->curframe, vstate->curframe);  in propagate_liveness()
11835 	for (frame = 0; frame <= vstate->curframe; frame++) {  in propagate_liveness()
11841 		for (i = frame < vstate->curframe ? BPF_REG_6 : 0; i < BPF_REG_FP; i++) {  in propagate_liveness()
11874 	for (fr = old->curframe; fr >= 0; fr--) {  in propagate_precision()
11910 	int i, fr = cur->curframe;  in states_maybe_looping()
11912 	if (old->curframe != fr)  in states_maybe_looping()
11963 			struct bpf_func_state *frame = sl->state.frame[sl->state.curframe];  in is_state_visited()
11966 			    frame->async_entry_cnt != cur->frame[cur->curframe]->async_entry_cnt) {  in is_state_visited()
12126 	for (j = 0; j <= cur->curframe; j++) {  in is_state_visited()
12127 		for (i = j < cur->curframe ? BPF_REG_6 : 0; i < BPF_REG_FP; i++)  in is_state_visited()
12134 	for (j = 0; j <= cur->curframe; j++) {  in is_state_visited()
12241 			print_verifier_state(env, state->frame[state->curframe], true);  in do_check()
12253 				print_insn_state(env, state->frame[state->curframe]);  in do_check()
12462 				if (state->curframe) {  in do_check()
14634 	state->curframe = 0;  in do_check_common()
14648 	regs = state->frame[state->curframe]->regs;  in do_check_common()