diff options
author | Bjorn Helgaas <bhelgaas@google.com> | 2023-08-14 16:28:22 -0500 |
---|---|---|
committer | Jonathan Corbet <corbet@lwn.net> | 2023-08-18 11:29:03 -0600 |
commit | d56b699d76d1b352f7a3d3a0a3e91c79b8612d94 (patch) | |
tree | 2a368f3e2e17f7a516bf39e055f79d8c79a74885 /Documentation/bpf | |
parent | ebab9426cd73c45945b44344ca904b343f0ca070 (diff) |
Documentation: Fix typos
Fix typos in Documentation.
Signed-off-by: Bjorn Helgaas <bhelgaas@google.com>
Link: https://lore.kernel.org/r/20230814212822.193684-4-helgaas@kernel.org
Signed-off-by: Jonathan Corbet <corbet@lwn.net>
Diffstat (limited to 'Documentation/bpf')
-rw-r--r-- | Documentation/bpf/cpumasks.rst | 2 | ||||
-rw-r--r-- | Documentation/bpf/graph_ds_impl.rst | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/Documentation/bpf/cpumasks.rst b/Documentation/bpf/cpumasks.rst index 3139c7c02e79..a22b6ad105fb 100644 --- a/Documentation/bpf/cpumasks.rst +++ b/Documentation/bpf/cpumasks.rst @@ -364,7 +364,7 @@ can be used to query the contents of cpumasks. ---- Some example usages of these querying kfuncs were shown above. We will not -replicate those exmaples here. Note, however, that all of the aforementioned +replicate those examples here. Note, however, that all of the aforementioned kfuncs are tested in `tools/testing/selftests/bpf/progs/cpumask_success.c`_, so please take a look there if you're looking for more examples of how they can be used. diff --git a/Documentation/bpf/graph_ds_impl.rst b/Documentation/bpf/graph_ds_impl.rst index 61274622b71d..06288cc719b3 100644 --- a/Documentation/bpf/graph_ds_impl.rst +++ b/Documentation/bpf/graph_ds_impl.rst @@ -23,7 +23,7 @@ Introduction The BPF map API has historically been the main way to expose data structures of various types for use within BPF programs. Some data structures fit naturally -with the map API (HASH, ARRAY), others less so. Consequentially, programs +with the map API (HASH, ARRAY), others less so. Consequently, programs interacting with the latter group of data structures can be hard to parse for kernel programmers without previous BPF experience. |