1688 	if (st->loop_entry)  in state_loop_entry_as_list()
1689 		return container_of(st->loop_entry, struct bpf_verifier_state_list, state);  in state_loop_entry_as_list()
1758 	dst_state->loop_entry = src->loop_entry;  in copy_verifier_state()
1922 	struct bpf_verifier_state *topmost = st->loop_entry;  in get_loop_entry()
1925 	while (topmost && topmost->loop_entry) {  in get_loop_entry()
1931 		topmost = topmost->loop_entry;  in get_loop_entry()
1945 	if (hdr->branches && hdr->dfs_depth < (cur->loop_entry ?: cur)->dfs_depth) {  in update_loop_entry()
1946 		if (cur->loop_entry) {  in update_loop_entry()
1947 			cur->loop_entry->used_as_loop_entry--;  in update_loop_entry()
1950 		cur->loop_entry = hdr;  in update_loop_entry()
1968 		if (br == 0 && st->parent && st->loop_entry)  in update_branch_counts()
1969 			update_loop_entry(env, st->parent, st->loop_entry);  in update_branch_counts()
18273 	struct bpf_verifier_state *loop_entry;  in clean_live_states()  local
18282 		loop_entry = get_loop_entry(env, &sl->state);  in clean_live_states()
18283 		if (!IS_ERR_OR_NULL(loop_entry) && loop_entry->branches)  in clean_live_states()
18993 	struct bpf_verifier_state *cur = env->cur_state, *new, *loop_entry;  in is_state_visited()  local
19172 		loop_entry = get_loop_entry(env, &sl->state);  in is_state_visited()
19173 		if (IS_ERR(loop_entry))  in is_state_visited()
19174 			return PTR_ERR(loop_entry);  in is_state_visited()
19175 		force_exact = loop_entry && loop_entry->branches > 0;  in is_state_visited()
19178 				update_loop_entry(env, cur, loop_entry);  in is_state_visited()
19662 					if (WARN_ON_ONCE(env->cur_state->loop_entry)) {  in do_check()