Found by running codespell on the bpf implementation.
Signed-off-by: Stephen Hemminger <step...@networkplumber.org>
---
lib/bpf/bpf_jit_x86.c | 2 +-
lib/bpf/bpf_validate.c | 4 ++--
2 files changed, 3 insertions(+), 3 deletions(-)
diff --git a/lib/bpf/bpf_jit_x86.c b/lib/bpf/bpf_jit_x86.c
index aa22ea78a01d..518513376a67 100644
--- a/lib/bpf/bpf_jit_x86.c
+++ b/lib/bpf/bpf_jit_x86.c
@@ -1245,7 +1245,7 @@ emit_epilog(struct bpf_jit_state *st)
uint32_t i;
int32_t spil, ofs;
- /* if we allready have an epilog generate a jump to it */
+ /* if we already have an epilog generate a jump to it */
if (st->exit.num++ != 0) {
emit_abs_jmp(st, st->exit.off);
return;
diff --git a/lib/bpf/bpf_validate.c b/lib/bpf/bpf_validate.c
index 7b1291b382e9..3e7d3d730637 100644
--- a/lib/bpf/bpf_validate.c
+++ b/lib/bpf/bpf_validate.c
@@ -1723,7 +1723,7 @@ static const struct bpf_ins_check ins_chk[UINT8_MAX + 1]
= {
/*
* make sure that instruction syntax is valid,
- * and it fields don't violate partciular instrcution type restrictions.
+ * and it fields don't violate particular instruction type restrictions.
*/
static const char *
check_syntax(const struct ebpf_insn *ins)
@@ -1981,7 +1981,7 @@ validate(struct bpf_verifier *bvf)
/*
* construct CFG, jcc nodes have to outgoing edges,
- * 'exit' nodes - none, all others nodes have exaclty one
+ * 'exit' nodes - none, all others nodes have exactly one
* outgoing edge.
*/
switch (ins->code) {
--
2.30.2
