summaryrefslogtreecommitdiff
path: root/Documentation/bpf/graph_ds_impl.rst
diff options
context:
space:
mode:
Diffstat (limited to 'Documentation/bpf/graph_ds_impl.rst')
-rw-r--r--Documentation/bpf/graph_ds_impl.rst2
1 files changed, 1 insertions, 1 deletions
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.