From: Hongyi Lu <jwnhy0@xxxxxxxxx>
6689139af (HEAD -> master) fix spelling in bpf_verifier.h
Spelling is no big deal, but it is still an improvement.
This is my first patch as a newbie. Hope I didn't cause much trouble.
Signed-off-by: Hongyi Lu <jwnhy0@xxxxxxxxx>
---
include/linux/bpf_verifier.h | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/include/linux/bpf_verifier.h b/include/linux/bpf_verifier.h
index e8439f6cb..3930c963f 100644
--- a/include/linux/bpf_verifier.h
+++ b/include/linux/bpf_verifier.h
@@ -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().
--
2.35.1
