434 	for (i = 0; i <= state->curframe; i++) {  in free_verifier_state()
464 	for (i = src->curframe + 1; i <= dst_state->curframe; i++) {  in copy_verifier_state()
468 	dst_state->curframe = src->curframe;  in copy_verifier_state()
470 	for (i = 0; i <= src->curframe; i++) {  in copy_verifier_state()
896 	if (parent->curframe == state->curframe ||  in skip_callee()
897 	    (parent->curframe < state->curframe &&  in skip_callee()
899 	    (parent->curframe > state->curframe &&  in skip_callee()
903 	if (parent->curframe > state->curframe &&  in skip_callee()
910 		while (tmp && tmp->curframe != state->curframe) {  in skip_callee()
923 		regno, parent->curframe, state->curframe);  in skip_callee()
940 		if (writes && state->frame[state->curframe]->regs[regno].live & REG_LIVE_WRITTEN)  in mark_reg_read()
946 		parent->frame[parent->curframe]->regs[regno].live |= REG_LIVE_READ;  in mark_reg_read()
958 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in check_reg_arg()
1034 	cur = env->cur_state->frame[env->cur_state->curframe];  in check_stack_write()
1169 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in check_stack_read()
1257 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in check_map_access()
2322 	for (i = 0; i <= vstate->curframe; i++)  in clear_all_pkt_pointers()
2333 	if (state->curframe + 1 >= MAX_CALL_FRAMES) {  in check_func_call()
2335 			state->curframe + 2);  in check_func_call()
2347 	caller = state->frame[state->curframe];  in check_func_call()
2348 	if (state->frame[state->curframe + 1]) {  in check_func_call()
2350 			state->curframe + 1);  in check_func_call()
2357 	state->frame[state->curframe + 1] = callee;  in check_func_call()
2366 			state->curframe + 1 /* frameno within this callchain */,  in check_func_call()
2380 	state->curframe++;  in check_func_call()
2400 	callee = state->frame[state->curframe];  in prepare_func_exit()
2413 	state->curframe--;  in prepare_func_exit()
2414 	caller = state->frame[state->curframe];  in prepare_func_exit()
2427 	state->frame[state->curframe + 1] = NULL;  in prepare_func_exit()
2696 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in adjust_ptr_min_max_vals()
3157 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in adjust_reg_min_max_vals()
3383 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in find_good_pkt_pointers()
3456 	for (j = 0; j <= vstate->curframe; j++) {  in find_good_pkt_pointers()
3705 	struct bpf_func_state *state = vstate->frame[vstate->curframe];  in mark_map_regs()
3713 	for (j = 0; j <= vstate->curframe; j++) {  in mark_map_regs()
3821 	struct bpf_reg_state *regs = this_branch->frame[this_branch->curframe]->regs;  in check_cond_jmp_op()
3885 	other_branch_regs = other_branch->frame[other_branch->curframe]->regs;  in check_cond_jmp_op()
3934 		print_verifier_state(env, this_branch->frame[this_branch->curframe]);  in check_cond_jmp_op()
4594 	if (old->curframe != cur->curframe)  in states_equal()
4600 	for (i = 0; i <= old->curframe; i++) {  in states_equal()
4623 	if (vparent->curframe != vstate->curframe) {  in propagate_liveness()
4625 		     vparent->curframe, vstate->curframe);  in propagate_liveness()
4632 		if (vparent->frame[vparent->curframe]->regs[i].live & REG_LIVE_READ)  in propagate_liveness()
4634 		if (vstate->frame[vstate->curframe]->regs[i].live & REG_LIVE_READ) {  in propagate_liveness()
4642 	for (frame = 0; frame <= vstate->curframe; frame++) {  in propagate_liveness()
4719 		cur->frame[cur->curframe]->regs[i].live = REG_LIVE_NONE;  in is_state_visited()
4722 	for (j = 0; j <= cur->curframe; j++) {  in is_state_visited()
4744 	state->curframe = 0;  in do_check()
4802 			print_verifier_state(env, state->frame[state->curframe]);  in do_check()
4983 				if (state->curframe) {  in do_check()