[v2,06/18] bpf: fix spelling in comments
Checks
Commit Message
Found by running codespell on the bpf implementation.
Signed-off-by: Stephen Hemminger <stephen@networkplumber.org>
---
lib/bpf/bpf_jit_x86.c | 2 +-
lib/bpf/bpf_load_elf.c | 2 +-
lib/bpf/bpf_pkt.c | 2 +-
lib/bpf/bpf_validate.c | 8 ++++----
4 files changed, 7 insertions(+), 7 deletions(-)
Comments
>
> Found by running codespell on the bpf implementation.
>
> Signed-off-by: Stephen Hemminger <stephen@networkplumber.org>
> ---
Acked-by: Konstantin Ananyev <konstantin.ananyev@intel.com>
> --
> 2.30.2
@@ -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;
@@ -80,7 +80,7 @@ resolve_xsym(const char *sn, size_t ofs, struct ebpf_insn *ins, size_t ins_sz,
if (type == RTE_BPF_XTYPE_FUNC) {
/* we don't support multiple functions per BPF module,
- * so treat EBPF_PSEUDO_CALL to extrernal function
+ * so treat EBPF_PSEUDO_CALL to external function
* as an ordinary EBPF_CALL.
*/
if (ins[idx].src_reg == EBPF_PSEUDO_CALL) {
@@ -169,7 +169,7 @@ bpf_eth_cbh_add(struct bpf_eth_cbh *cbh, uint16_t port, uint16_t queue)
}
/*
- * BPF packet processing routinies.
+ * BPF packet processing routines.
*/
static inline uint32_t
@@ -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 its fields don't violate particular instruction type restrictions.
*/
static const char *
check_syntax(const struct ebpf_insn *ins)
@@ -1954,7 +1954,7 @@ log_loop(const struct bpf_verifier *bvf)
* First pass goes though all instructions in the set, checks that each
* instruction is a valid one (correct syntax, valid field values, etc.)
* and constructs control flow graph (CFG).
- * Then deapth-first search is performed over the constructed graph.
+ * Then depth-first search is performed over the constructed graph.
* Programs with unreachable instructions and/or loops will be rejected.
*/
static int
@@ -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 other nodes have exactly one
* outgoing edge.
*/
switch (ins->code) {
@@ -2251,7 +2251,7 @@ evaluate(struct bpf_verifier *bvf)
idx = get_node_idx(bvf, node);
op = ins[idx].code;
- /* for jcc node make a copy of evaluatoion state */
+ /* for jcc node make a copy of evaluation state */
if (node->nb_edge > 1)
rc |= save_eval_state(bvf, node);