Commit 6dbdc9f3 authored by Hongyi Lu's avatar Hongyi Lu Committed by Daniel Borkmann
Browse files

bpf: Fix spelling in bpf_verifier.h 



Minor spelling fix spotted in bpf_verifier.h. Spelling is no big deal,
but it is still an improvement when reading through the code.

Signed-off-by: default avatarHongyi Lu <jwnhy0@gmail.com>
Signed-off-by: default avatarDaniel Borkmann <daniel@iogearbox.net>
Link: https://lore.kernel.org/bpf/20220613211633.58647-1-jwnhy0@gmail.com
parent d5e9aeda

include/linux/bpf_verifier.h

+1 −1
Original line number Diff line number Diff line
@@ -299,7 +299,7 @@ struct bpf_verifier_state { 
	 * If is_state_visited() sees a state with branches > 0 it means

	 * there is a loop. If such state is exactly equal to the current state

	 * it's an infinite loop. Note states_equal() checks for states

	 * equvalency, so two states being 'states_equal' does not mean

	 * equivalency, so two states being 'states_equal' does not mean

	 * infinite loop. The exact comparison is provided by

	 * states_maybe_looping() function. It's a stronger pre-check and

	 * much faster than states_equal().