81 	for (i = 0; i <= st->curframe; i++) {  in compute_scc_callchain()
87 		} else if (i < st->curframe) {  in compute_scc_callchain()
479 	for (i = 0; i <= st->curframe; i++) {  in clean_verifier_state()
987 	if (old->curframe != cur->curframe)  in states_equal()
1007 	for (i = 0; i <= old->curframe; i++) {  in states_equal()
1030 	for (fr = old->curframe; fr >= 0; fr--) {  in propagate_precision()
1117 	int i, fr = cur->curframe;  in states_maybe_looping()
1119 	if (old->curframe != fr)  in states_maybe_looping()
1195 	for (fr = old->curframe; fr >= 0; fr--) {  in iter_active_depths_differ()
1219 	for (i = 0; i <= st->curframe; i++) {  in mark_all_scalars_imprecise()
1278 			struct bpf_func_state *frame = sl->state.frame[sl->state.curframe];  in bpf_is_state_visited()
1281 			    frame->async_entry_cnt != cur->frame[cur->curframe]->async_entry_cnt) {  in bpf_is_state_visited()
1337 					cur_frame = cur->frame[cur->curframe];  in bpf_is_state_visited()
1378 				print_verifier_state(env, cur, cur->curframe, true);  in bpf_is_state_visited()
1380 				print_verifier_state(env, &sl->state, cur->curframe, true);  in bpf_is_state_visited()