summaryrefslogtreecommitdiff
path: root/lib/list_sort.c
diff options
context:
space:
mode:
authorDaniel Borkmann <dborkman@redhat.com>2014-05-23 18:44:01 +0200
committerDavid S. Miller <davem@davemloft.net>2014-05-23 16:48:06 -0400
commit2e8a83c52ffa41816a979ab0e3bcadf4b0d9e8a1 (patch)
treeef3101980fef5d2f580026d96c78b40fe007b43b /lib/list_sort.c
parent10f18e0ba1ea7eb004bbaecb4748b1eb28802d24 (diff)
net: filter: add test case for jump with holes and ret x variants
This patch adds three more test cases: 1) long jumps with holes of unreachable code 2) ret x 3) ldx + ret x All three tests are for classical BPF and to make sure that any changes will not break some exotic behaviour that exists probably since decades. The last two tests are expected to fail by the BPF checker already, as in classic BPF only K or A are allowed to be returned. Thus, there are now 52 test cases for BPF. Signed-off-by: Daniel Borkmann <dborkman@redhat.com> Acked-by: Alexei Starovoitov <ast@plumgrid.com> Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'lib/list_sort.c')
0 files changed, 0 insertions, 0 deletions