mirror of
https://github.com/brain-hackers/linux-brain.git
synced 2024-06-09 23:36:23 +09:00
e5e7a8f2d8
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>
31 lines
750 B
C
31 lines
750 B
C
// SPDX-License-Identifier: GPL-2.0
|
|
// Copyright (c) 2019 Facebook
|
|
#include <linux/bpf.h>
|
|
#include "bpf_helpers.h"
|
|
#define ATTR __attribute__((always_inline))
|
|
#include "test_jhash.h"
|
|
|
|
SEC("scale90_inline")
|
|
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 = 14;
|
|
|
|
/* 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";
|