kernel/bpf/verifier.c

1515  * Define topmost loop entry as a first node of the loop traversed in a
1517  * tracking algorithm is to associate topmost loop entries with states
1612  * - update topmost loop entry for intermediate states in get_loop_entry().
1616 	struct bpf_verifier_state *topmost = st->loop_entry, *old;
1618 	while (topmost && topmost->loop_entry && topmost != topmost->loop_entry)
1619 		topmost = topmost->loop_entry;
1623 	while (st && st->loop_entry != topmost) {
1625 		st->loop_entry = topmost;
1628 	return topmost;
1639 	 * head's topmost loop entry is not in current DFS path,