summaryrefslogtreecommitdiffstats
path: root/tools/testing/selftests/bpf/progs/test_verif_scale3.c
diff options
context:
space:
mode:
authorAlexei Starovoitov <ast@kernel.org>2019-04-02 06:27:48 +0200
committerDaniel Borkmann <daniel@iogearbox.net>2019-04-04 01:27:38 +0200
commite5e7a8f2d858a91b79c4afc51a3f15edcbf9cb60 (patch)
treeaf71adf7cb55049a8f60f76a4acc3cc330cea4e0 /tools/testing/selftests/bpf/progs/test_verif_scale3.c
parentlibbpf: teach libbpf about log_level bit 2 (diff)
downloadlinux-e5e7a8f2d858a91b79c4afc51a3f15edcbf9cb60.tar.xz
linux-e5e7a8f2d858a91b79c4afc51a3f15edcbf9cb60.zip
selftests/bpf: add few verifier scale tests
Add 3 basic tests that stress verifier scalability. test_verif_scale1.c calls non-inlined jhash() function 90 times on different position in the packet. This test simulates network packet parsing. jhash function is ~140 instructions and main program is ~1200 insns. test_verif_scale2.c force inlines jhash() function 90 times. This program is ~15k instructions long. test_verif_scale3.c calls non-inlined jhash() function 90 times on But this time jhash has to process 32-bytes from the packet instead of 14-bytes in tests 1 and 2. jhash function is ~230 insns and main program is ~1200 insns. $ test_progs -s can be used to see verifier stats. Signed-off-by: Alexei Starovoitov <ast@kernel.org> Signed-off-by: Daniel Borkmann <daniel@iogearbox.net>
Diffstat (limited to 'tools/testing/selftests/bpf/progs/test_verif_scale3.c')
-rw-r--r--tools/testing/selftests/bpf/progs/test_verif_scale3.c30
1 files changed, 30 insertions, 0 deletions
diff --git a/tools/testing/selftests/bpf/progs/test_verif_scale3.c b/tools/testing/selftests/bpf/progs/test_verif_scale3.c
new file mode 100644
index 000000000000..1848da04ea41
--- /dev/null
+++ b/tools/testing/selftests/bpf/progs/test_verif_scale3.c
@@ -0,0 +1,30 @@
+// SPDX-License-Identifier: GPL-2.0
+// Copyright (c) 2019 Facebook
+#include <linux/bpf.h>
+#include "bpf_helpers.h"
+#define ATTR __attribute__((noinline))
+#include "test_jhash.h"
+
+SEC("scale90_noinline32")
+int balancer_ingress(struct __sk_buff *ctx)
+{
+ void *data_end = (void *)(long)ctx->data_end;
+ void *data = (void *)(long)ctx->data;
+ void *ptr;
+ int ret = 0, nh_off, i = 0;
+
+ nh_off = 32;
+
+ /* pragma unroll doesn't work on large loops */
+
+#define C do { \
+ ptr = data + i; \
+ if (ptr + nh_off > data_end) \
+ break; \
+ ctx->tc_index = jhash(ptr, nh_off, ctx->cb[0] + i++); \
+ } while (0);
+#define C30 C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;C;
+ C30;C30;C30; /* 90 calls */
+ return 0;
+}
+char _license[] SEC("license") = "GPL";