Skip to content

RFC bpf: Fix reg_bounds' slow mode and improve verifier refinement

Paul Chaignon bpf 1 version New

Get series with b4
b4 am [email protected]

Versions newest first

  1. v1 RFC Latest7 patches 0 repliesNew

Patches in v1 No applies recorded yet

#Subject and filesSizeRepliesApplied
1/7bpf/verifier: Use intersection checks when simulating to detect dead brancheskernel/bpf/verifier.c+208 -50 replies
2/7selftests/bpf: Test for empty intersection of tnum and u64tools/testing/selftests/bpf/progs/verifier_bounds.c+25 -00 replies
3/7selftests/bpf: Fix reg_bounds to prune on range violationstools/testing/selftests/bpf/prog_tests/reg_bounds.c+19 -20 replies
4/7bpf: Improve 64bits bounds refinement from u32 boundskernel/bpf/verifier.c tools/testing/selftests/bpf/prog_tests/reg_bounds.c+47 -130 replies
5/7bpf: Remove dead code from u32->*64 refinement logickernel/bpf/verifier.c+0 -380 replies
6/7selftests/bpf: Hardcode insteresting 32->64 refinement casestools/testing/selftests/bpf/prog_tests/reg_bounds.c+7 -00 replies
7/7selftests/bpf: new cases handled by 32->64 range refinementstools/testing/selftests/bpf/progs/verifier_bounds.c+177 -00 replies

Reviews trailers per patch

No Reviewed-by, Acked-by or Tested-by trailers for v1 yet.

Read the v1 thread

Cover letter [PATCH RFC bpf-next 0/7] bpf: Fix reg_bounds' slow mode and improve verifier refinement

This patchset fixes several failing test cases in the slow-mode reg_bounds selftests. It also includes an improvement to the verifier u32->*64 refinement logic, to help better align it with reg_bounds' refinement logic.

I'm sending as an RFC because it needs [1] to be merged first. The two patches from [1] are included here, before my fixes.

Patch "bpf: Improve 64bits bounds refinement from u32 bounds" also happens to address the refinement shortcomings discussed at [2]. To demonstrate that, I included the new selftests from [2] at the end of this series.

1: https://lore.kernel.org/all/[email protected]/
2: https://lore.kernel.org/all/[email protected]/

Harishankar Vishwanathan (1):
bpf/verifier: Use intersection checks when simulating to detect dead
branches

Paul Chaignon (5):
selftests/bpf: Test for empty intersection of tnum and u64 selftests/bpf: Fix reg_bounds to prune on range violations
bpf: Improve 64bits bounds refinement from u32 bounds
bpf: Remove dead code from u32->*64 refinement logic selftests/bpf: Hardcode insteresting 32->64 refinement cases

Eduard Zingerman (1):
selftests/bpf: new cases handled by 32->64 range refinements

 kernel/bpf/verifier.c                         | 299 +++++++++++++++---
 .../selftests/bpf/prog_tests/reg_bounds.c     |  38 ++-
 .../selftests/bpf/progs/verifier_bounds.c     | 202 ++++++++++++
 3 files changed, 482 insertions(+), 57 deletions(-)
Signature · 1 line
2.43.0