aboutsummaryrefslogtreecommitdiff
path: root/lib/dynamic_queue_limits.c
diff options
context:
space:
mode:
authorJann Horn <[email protected]>2020-03-30 18:03:24 +0200
committerAlexei Starovoitov <[email protected]>2020-03-30 11:53:52 -0700
commit0fc31b10cfb7e5158bafb9d30839fbc9241c40c4 (patch)
tree63fa1cc54f7facfd7258bf235990169d858148b3 /lib/dynamic_queue_limits.c
parent604dca5e3af1db98bd123b7bfc02b017af99e3a0 (diff)
bpf: Simplify reg_set_min_max_inv handling
reg_set_min_max_inv() contains exactly the same logic as reg_set_min_max(), just flipped around. While this makes sense in a cBPF verifier (where ALU operations are not symmetric), it does not make sense for eBPF. Replace reg_set_min_max_inv() with a helper that flips the opcode around, then lets reg_set_min_max() do the complicated work. Signed-off-by: Jann Horn <[email protected]> Signed-off-by: Daniel Borkmann <[email protected]> Signed-off-by: Alexei Starovoitov <[email protected]> Link: https://lore.kernel.org/bpf/[email protected]
Diffstat (limited to 'lib/dynamic_queue_limits.c')
0 files changed, 0 insertions, 0 deletions