diff options
| author | David S. Miller <davem@davemloft.net> | 2020-09-15 19:26:21 -0700 |
|---|---|---|
| committer | David S. Miller <davem@davemloft.net> | 2020-09-15 19:26:21 -0700 |
| commit | d5d325eae7823c85eedabf05f78f9cd574fe832b (patch) | |
| tree | 6368d08eff70b8cdaff914a0ea1f516a3a92fdd3 /Documentation | |
| parent | 2fbc6e89b2f1403189e624cabaf73e189c5e50c6 (diff) | |
| parent | ce880cb825fcc22d4e39046a6c3a3a7f6603883d (diff) | |
| download | linux-stable-d5d325eae7823c85eedabf05f78f9cd574fe832b.tar.gz linux-stable-d5d325eae7823c85eedabf05f78f9cd574fe832b.tar.bz2 linux-stable-d5d325eae7823c85eedabf05f78f9cd574fe832b.zip | |
Merge git://git.kernel.org/pub/scm/linux/kernel/git/bpf/bpf
Alexei Starovoitov says:
====================
pull-request: bpf 2020-09-15
The following pull-request contains BPF updates for your *net* tree.
We've added 12 non-merge commits during the last 19 day(s) which contain
a total of 10 files changed, 47 insertions(+), 38 deletions(-).
The main changes are:
1) docs/bpf fixes, from Andrii.
2) ld_abs fix, from Daniel.
3) socket casting helpers fix, from Martin.
4) hash iterator fixes, from Yonghong.
====================
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'Documentation')
| -rw-r--r-- | Documentation/bpf/ringbuf.rst | 5 |
1 files changed, 1 insertions, 4 deletions
diff --git a/Documentation/bpf/ringbuf.rst b/Documentation/bpf/ringbuf.rst index 75f943f0009d..6a615cd62bda 100644 --- a/Documentation/bpf/ringbuf.rst +++ b/Documentation/bpf/ringbuf.rst @@ -182,9 +182,6 @@ in the order of reservations, but only after all previous records where already committed. It is thus possible for slow producers to temporarily hold off submitted records, that were reserved later. -Reservation/commit/consumer protocol is verified by litmus tests in -Documentation/litmus_tests/bpf-rb/_. - One interesting implementation bit, that significantly simplifies (and thus speeds up as well) implementation of both producers and consumers is how data area is mapped twice contiguously back-to-back in the virtual memory. This @@ -200,7 +197,7 @@ a self-pacing notifications of new data being availability. being available after commit only if consumer has already caught up right up to the record being committed. If not, consumer still has to catch up and thus will see new data anyways without needing an extra poll notification. -Benchmarks (see tools/testing/selftests/bpf/benchs/bench_ringbuf.c_) show that +Benchmarks (see tools/testing/selftests/bpf/benchs/bench_ringbufs.c) show that this allows to achieve a very high throughput without having to resort to tricks like "notify only every Nth sample", which are necessary with perf buffer. For extreme cases, when BPF program wants more manual control of |