summaryrefslogtreecommitdiff
path: root/kernel/bpf
diff options
context:
space:
mode:
authorDaniel Borkmann <daniel@iogearbox.net>2019-03-01 01:31:48 +0100
committerDaniel Borkmann <daniel@iogearbox.net>2019-03-01 01:31:49 +0100
commit3860d38f28568803887f2566a4cfb71aba90feef (patch)
tree4c448c63fd71c34c6eb9c606f13a6662ab07170b /kernel/bpf
parent3d8669e63751b7a3f8fac109cd350c5f6c14e3e1 (diff)
parent7c7a4890c87dd2eb77ef144e5153a7df4c0d6f53 (diff)
Merge branch 'bpf-dedup-fixes'
Andrii Nakryiko says: ==================== This patchset fixes a bug in btf_dedup() algorithm, which under specific hash collision causes infinite loop. It also exposes ability to tune BTF deduplication table size, with double purpose of allowing applications to adjust size according to the size of BTF data, as well as allowing a simple way to force hash collisions by setting table size to 1. - Patch #1 fixes bug in btf_dedup testing code that's checking strings - Patch #2 fixes pointer arg formatting in btf.h - Patch #3 adds option to specify custom dedup table size - Patch #4 fixes aforementioned bug in btf_dedup - Patch #5 adds test that validates the fix v1->v2: - remove "Fixes" from formatting change patch - extract roundup_pow2_max func for dedup table size - btf_equal_struct -> btf_shallow_equal_struct - explain in comment why we can't rely on just btf_dedup_is_equiv ==================== Signed-off-by: Daniel Borkmann <daniel@iogearbox.net>
Diffstat (limited to 'kernel/bpf')
0 files changed, 0 insertions, 0 deletions