[mirror_ubuntu-bionic-kernel.git] / samples / bpf / map_perf_test_user.c

/* Copyright (c) 2016 Facebook
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of version 2 of the GNU General Public
 * License as published by the Free Software Foundation.
 */
#define _GNU_SOURCE
#include <sched.h>
#include <stdio.h>
#include <sys/types.h>
#include <asm/unistd.h>
#include <unistd.h>
#include <assert.h>
#include <sys/wait.h>
#include <stdlib.h>
#include <signal.h>
#include <linux/bpf.h>
#include <string.h>
#include <time.h>
#include <sys/resource.h>
#include <arpa/inet.h>
#include <errno.h>

#include "libbpf.h"
#include "bpf_load.h"

#define TEST_BIT(t) (1U << (t))
#define MAX_NR_CPUS 1024

static __u64 time_get_ns(void)
{
	struct timespec ts;

	clock_gettime(CLOCK_MONOTONIC, &ts);
	return ts.tv_sec * 1000000000ull + ts.tv_nsec;
}

enum test_type {
	HASH_PREALLOC,
	PERCPU_HASH_PREALLOC,
	HASH_KMALLOC,
	PERCPU_HASH_KMALLOC,
	LRU_HASH_PREALLOC,
	NOCOMMON_LRU_HASH_PREALLOC,
	LPM_KMALLOC,
	HASH_LOOKUP,
	ARRAY_LOOKUP,
	INNER_LRU_HASH_PREALLOC,
	LRU_HASH_LOOKUP,
	NR_TESTS,
};

const char *test_map_names[NR_TESTS] = {
	[HASH_PREALLOC] = "hash_map",
	[PERCPU_HASH_PREALLOC] = "percpu_hash_map",
	[HASH_KMALLOC] = "hash_map_alloc",
	[PERCPU_HASH_KMALLOC] = "percpu_hash_map_alloc",
	[LRU_HASH_PREALLOC] = "lru_hash_map",
	[NOCOMMON_LRU_HASH_PREALLOC] = "nocommon_lru_hash_map",
	[LPM_KMALLOC] = "lpm_trie_map_alloc",
	[HASH_LOOKUP] = "hash_map",
	[ARRAY_LOOKUP] = "array_map",
	[INNER_LRU_HASH_PREALLOC] = "inner_lru_hash_map",
	[LRU_HASH_LOOKUP] = "lru_hash_lookup_map",
};

static int test_flags = ~0;
static uint32_t num_map_entries;
static uint32_t inner_lru_hash_size;
static int inner_lru_hash_idx = -1;
static int array_of_lru_hashs_idx = -1;
static int lru_hash_lookup_idx = -1;
static int lru_hash_lookup_test_entries = 32;
static uint32_t max_cnt = 1000000;

static int check_test_flags(enum test_type t)
{
	return test_flags & TEST_BIT(t);
}

static void test_hash_prealloc(int cpu)
{
	__u64 start_time;
	int i;

	start_time = time_get_ns();
	for (i = 0; i < max_cnt; i++)
		syscall(__NR_getuid);
	printf("%d:hash_map_perf pre-alloc %lld events per sec\n",
	       cpu, max_cnt * 1000000000ll / (time_get_ns() - start_time));
}

static int pre_test_lru_hash_lookup(int tasks)
{
	int fd = map_fd[lru_hash_lookup_idx];
	uint32_t key;
	long val = 1;
	int ret;

	if (num_map_entries > lru_hash_lookup_test_entries)
		lru_hash_lookup_test_entries = num_map_entries;

	/* Populate the lru_hash_map for LRU_HASH_LOOKUP perf test.
	 *
	 * It is fine that the user requests for a map with
	 * num_map_entries < 32 and some of the later lru hash lookup
	 * may return not found.  For LRU map, we are not interested
	 * in such small map performance.
	 */
	for (key = 0; key < lru_hash_lookup_test_entries; key++) {
		ret = bpf_map_update_elem(fd, &key, &val, BPF_NOEXIST);
		if (ret)
			return ret;
	}

	return 0;
}

static void do_test_lru(enum test_type test, int cpu)
{
	static int inner_lru_map_fds[MAX_NR_CPUS];

	struct sockaddr_in6 in6 = { .sin6_family = AF_INET6 };
	const char *test_name;
	__u64 start_time;
	int i, ret;

	if (test == INNER_LRU_HASH_PREALLOC) {
		int outer_fd = map_fd[array_of_lru_hashs_idx];
		unsigned int mycpu, mynode;

		assert(cpu < MAX_NR_CPUS);

		if (cpu) {
			ret = syscall(__NR_getcpu, &mycpu, &mynode, NULL);
			assert(!ret);

			inner_lru_map_fds[cpu] =
				bpf_create_map_node(BPF_MAP_TYPE_LRU_HASH,
						    test_map_names[INNER_LRU_HASH_PREALLOC],
						    sizeof(uint32_t),
						    sizeof(long),
						    inner_lru_hash_size, 0,
						    mynode);
			if (inner_lru_map_fds[cpu] == -1) {
				printf("cannot create BPF_MAP_TYPE_LRU_HASH %s(%d)\n",
				       strerror(errno), errno);
				exit(1);
			}
		} else {
			inner_lru_map_fds[cpu] = map_fd[inner_lru_hash_idx];
		}

		ret = bpf_map_update_elem(outer_fd, &cpu,
					  &inner_lru_map_fds[cpu],
					  BPF_ANY);
		if (ret) {
			printf("cannot update ARRAY_OF_LRU_HASHS with key:%u. %s(%d)\n",
			       cpu, strerror(errno), errno);
			exit(1);
		}
	}

	in6.sin6_addr.s6_addr16[0] = 0xdead;
	in6.sin6_addr.s6_addr16[1] = 0xbeef;

	if (test == LRU_HASH_PREALLOC) {
		test_name = "lru_hash_map_perf";
		in6.sin6_addr.s6_addr16[2] = 0;
	} else if (test == NOCOMMON_LRU_HASH_PREALLOC) {
		test_name = "nocommon_lru_hash_map_perf";
		in6.sin6_addr.s6_addr16[2] = 1;
	} else if (test == INNER_LRU_HASH_PREALLOC) {
		test_name = "inner_lru_hash_map_perf";
		in6.sin6_addr.s6_addr16[2] = 2;
	} else if (test == LRU_HASH_LOOKUP) {
		test_name = "lru_hash_lookup_perf";
		in6.sin6_addr.s6_addr16[2] = 3;
		in6.sin6_addr.s6_addr32[3] = 0;
	} else {
		assert(0);
	}

	start_time = time_get_ns();
	for (i = 0; i < max_cnt; i++) {
		ret = connect(-1, (const struct sockaddr *)&in6, sizeof(in6));
		assert(ret == -1 && errno == EBADF);
		if (in6.sin6_addr.s6_addr32[3] <
		    lru_hash_lookup_test_entries - 32)
			in6.sin6_addr.s6_addr32[3] += 32;
		else
			in6.sin6_addr.s6_addr32[3] = 0;
	}
	printf("%d:%s pre-alloc %lld events per sec\n",
	       cpu, test_name,
	       max_cnt * 1000000000ll / (time_get_ns() - start_time));
}

static void test_lru_hash_prealloc(int cpu)
{
	do_test_lru(LRU_HASH_PREALLOC, cpu);
}

static void test_nocommon_lru_hash_prealloc(int cpu)
{
	do_test_lru(NOCOMMON_LRU_HASH_PREALLOC, cpu);
}

static void test_inner_lru_hash_prealloc(int cpu)
{
	do_test_lru(INNER_LRU_HASH_PREALLOC, cpu);
}

static void test_lru_hash_lookup(int cpu)
{
	do_test_lru(LRU_HASH_LOOKUP, cpu);
}

static void test_percpu_hash_prealloc(int cpu)
{
	__u64 start_time;
	int i;

	start_time = time_get_ns();
	for (i = 0; i < max_cnt; i++)
		syscall(__NR_geteuid);
	printf("%d:percpu_hash_map_perf pre-alloc %lld events per sec\n",
	       cpu, max_cnt * 1000000000ll / (time_get_ns() - start_time));
}

static void test_hash_kmalloc(int cpu)
{
	__u64 start_time;
	int i;

	start_time = time_get_ns();
	for (i = 0; i < max_cnt; i++)
		syscall(__NR_getgid);
	printf("%d:hash_map_perf kmalloc %lld events per sec\n",
	       cpu, max_cnt * 1000000000ll / (time_get_ns() - start_time));
}

static void test_percpu_hash_kmalloc(int cpu)
{
	__u64 start_time;
	int i;

	start_time = time_get_ns();
	for (i = 0; i < max_cnt; i++)
		syscall(__NR_getegid);
	printf("%d:percpu_hash_map_perf kmalloc %lld events per sec\n",
	       cpu, max_cnt * 1000000000ll / (time_get_ns() - start_time));
}

static void test_lpm_kmalloc(int cpu)
{
	__u64 start_time;
	int i;

	start_time = time_get_ns();
	for (i = 0; i < max_cnt; i++)
		syscall(__NR_gettid);
	printf("%d:lpm_perf kmalloc %lld events per sec\n",
	       cpu, max_cnt * 1000000000ll / (time_get_ns() - start_time));
}

static void test_hash_lookup(int cpu)
{
	__u64 start_time;
	int i;

	start_time = time_get_ns();
	for (i = 0; i < max_cnt; i++)
		syscall(__NR_getpgid, 0);
	printf("%d:hash_lookup %lld lookups per sec\n",
	       cpu, max_cnt * 1000000000ll * 64 / (time_get_ns() - start_time));
}

static void test_array_lookup(int cpu)
{
	__u64 start_time;
	int i;

	start_time = time_get_ns();
	for (i = 0; i < max_cnt; i++)
		syscall(__NR_getppid, 0);
	printf("%d:array_lookup %lld lookups per sec\n",
	       cpu, max_cnt * 1000000000ll * 64 / (time_get_ns() - start_time));
}

typedef int (*pre_test_func)(int tasks);
const pre_test_func pre_test_funcs[] = {
	[LRU_HASH_LOOKUP] = pre_test_lru_hash_lookup,
};

typedef void (*test_func)(int cpu);
const test_func test_funcs[] = {
	[HASH_PREALLOC] = test_hash_prealloc,
	[PERCPU_HASH_PREALLOC] = test_percpu_hash_prealloc,
	[HASH_KMALLOC] = test_hash_kmalloc,
	[PERCPU_HASH_KMALLOC] = test_percpu_hash_kmalloc,
	[LRU_HASH_PREALLOC] = test_lru_hash_prealloc,
	[NOCOMMON_LRU_HASH_PREALLOC] = test_nocommon_lru_hash_prealloc,
	[LPM_KMALLOC] = test_lpm_kmalloc,
	[HASH_LOOKUP] = test_hash_lookup,
	[ARRAY_LOOKUP] = test_array_lookup,
	[INNER_LRU_HASH_PREALLOC] = test_inner_lru_hash_prealloc,
	[LRU_HASH_LOOKUP] = test_lru_hash_lookup,
};

static int pre_test(int tasks)
{
	int i;

	for (i = 0; i < NR_TESTS; i++) {
		if (pre_test_funcs[i] && check_test_flags(i)) {
			int ret = pre_test_funcs[i](tasks);

			if (ret)
				return ret;
		}
	}

	return 0;
}

static void loop(int cpu)
{
	cpu_set_t cpuset;
	int i;

	CPU_ZERO(&cpuset);
	CPU_SET(cpu, &cpuset);
	sched_setaffinity(0, sizeof(cpuset), &cpuset);

	for (i = 0; i < NR_TESTS; i++) {
		if (check_test_flags(i))
			test_funcs[i](cpu);
	}
}

static void run_perf_test(int tasks)
{
	pid_t pid[tasks];
	int i;

	assert(!pre_test(tasks));

	for (i = 0; i < tasks; i++) {
		pid[i] = fork();
		if (pid[i] == 0) {
			loop(i);
			exit(0);
		} else if (pid[i] == -1) {
			printf("couldn't spawn #%d process\n", i);
			exit(1);
		}
	}
	for (i = 0; i < tasks; i++) {
		int status;

		assert(waitpid(pid[i], &status, 0) == pid[i]);
		assert(status == 0);
	}
}

static void fill_lpm_trie(void)
{
	struct bpf_lpm_trie_key *key;
	unsigned long value = 0;
	unsigned int i;
	int r;

	key = alloca(sizeof(*key) + 4);
	key->prefixlen = 32;

	for (i = 0; i < 512; ++i) {
		key->prefixlen = rand() % 33;
		key->data[0] = rand() & 0xff;
		key->data[1] = rand() & 0xff;
		key->data[2] = rand() & 0xff;
		key->data[3] = rand() & 0xff;
		r = bpf_map_update_elem(map_fd[6], key, &value, 0);
		assert(!r);
	}

	key->prefixlen = 32;
	key->data[0] = 192;
	key->data[1] = 168;
	key->data[2] = 0;
	key->data[3] = 1;
	value = 128;

	r = bpf_map_update_elem(map_fd[6], key, &value, 0);
	assert(!r);
}

static void fixup_map(struct bpf_map_data *map, int idx)
{
	int i;

	if (!strcmp("inner_lru_hash_map", map->name)) {
		inner_lru_hash_idx = idx;
		inner_lru_hash_size = map->def.max_entries;
	}

	if (!strcmp("array_of_lru_hashs", map->name)) {
		if (inner_lru_hash_idx == -1) {
			printf("inner_lru_hash_map must be defined before array_of_lru_hashs\n");
			exit(1);
		}
		map->def.inner_map_idx = inner_lru_hash_idx;
		array_of_lru_hashs_idx = idx;
	}

	if (!strcmp("lru_hash_lookup_map", map->name))
		lru_hash_lookup_idx = idx;

	if (num_map_entries <= 0)
		return;

	inner_lru_hash_size = num_map_entries;

	/* Only change the max_entries for the enabled test(s) */
	for (i = 0; i < NR_TESTS; i++) {
		if (!strcmp(test_map_names[i], map->name) &&
		    (check_test_flags(i))) {
			map->def.max_entries = num_map_entries;
		}
	}
}

int main(int argc, char **argv)
{
	struct rlimit r = {RLIM_INFINITY, RLIM_INFINITY};
	char filename[256];
	int num_cpu = 8;

	snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]);
	setrlimit(RLIMIT_MEMLOCK, &r);

	if (argc > 1)
		test_flags = atoi(argv[1]) ? : test_flags;

	if (argc > 2)
		num_cpu = atoi(argv[2]) ? : num_cpu;

	if (argc > 3)
		num_map_entries = atoi(argv[3]);

	if (argc > 4)
		max_cnt = atoi(argv[4]);

	if (load_bpf_file_fixup_map(filename, fixup_map)) {
		printf("%s", bpf_log_buf);
		return 1;
	}

	fill_lpm_trie();

	run_perf_test(num_cpu);

	return 0;
}
Commit	Line	Data
26e90931 AS	1	/* Copyright (c) 2016 Facebook
	2	*
	3	* This program is free software; you can redistribute it and/or
	4	* modify it under the terms of version 2 of the GNU General Public
	5	* License as published by the Free Software Foundation.
	6	*/
	7	#define _GNU_SOURCE
	8	#include <sched.h>
	9	#include <stdio.h>
	10	#include <sys/types.h>
	11	#include <asm/unistd.h>
	12	#include <unistd.h>
	13	#include <assert.h>
	14	#include <sys/wait.h>
	15	#include <stdlib.h>
	16	#include <signal.h>
	17	#include <linux/bpf.h>
	18	#include <string.h>
	19	#include <time.h>
77e63534	20	#include <sys/resource.h>
bf8db5d2 MKL	21	#include <arpa/inet.h>
	22	#include <errno.h>
	23
26e90931 AS	24	#include "libbpf.h"
	25	#include "bpf_load.h"
	26
9fd63d05	27	#define TEST_BIT(t) (1U << (t))
3a5795b8	28	#define MAX_NR_CPUS 1024
26e90931 AS	29
	30	static __u64 time_get_ns(void)
	31	{
	32	struct timespec ts;
	33
	34	clock_gettime(CLOCK_MONOTONIC, &ts);
	35	return ts.tv_sec * 1000000000ull + ts.tv_nsec;
	36	}
	37
9fd63d05 MKL	38	enum test_type {
	39	HASH_PREALLOC,
	40	PERCPU_HASH_PREALLOC,
	41	HASH_KMALLOC,
	42	PERCPU_HASH_KMALLOC,
	43	LRU_HASH_PREALLOC,
	44	NOCOMMON_LRU_HASH_PREALLOC,
	45	LPM_KMALLOC,
	46	HASH_LOOKUP,
	47	ARRAY_LOOKUP,
3a5795b8	48	INNER_LRU_HASH_PREALLOC,
637cd8c3	49	LRU_HASH_LOOKUP,
9fd63d05 MKL	50	NR_TESTS,
	51	};
	52
	53	const char *test_map_names[NR_TESTS] = {
	54	[HASH_PREALLOC] = "hash_map",
	55	[PERCPU_HASH_PREALLOC] = "percpu_hash_map",
	56	[HASH_KMALLOC] = "hash_map_alloc",
	57	[PERCPU_HASH_KMALLOC] = "percpu_hash_map_alloc",
	58	[LRU_HASH_PREALLOC] = "lru_hash_map",
	59	[NOCOMMON_LRU_HASH_PREALLOC] = "nocommon_lru_hash_map",
	60	[LPM_KMALLOC] = "lpm_trie_map_alloc",
	61	[HASH_LOOKUP] = "hash_map",
	62	[ARRAY_LOOKUP] = "array_map",
3a5795b8	63	[INNER_LRU_HASH_PREALLOC] = "inner_lru_hash_map",
637cd8c3	64	[LRU_HASH_LOOKUP] = "lru_hash_lookup_map",
9fd63d05	65	};
26e90931 AS	66
26e90931 AS	67	static int test_flags = ~0;
9fd63d05	68	static uint32_t num_map_entries;
3a5795b8 MKL	69	static uint32_t inner_lru_hash_size;
	70	static int inner_lru_hash_idx = -1;
	71	static int array_of_lru_hashs_idx = -1;
637cd8c3 MKL	72	static int lru_hash_lookup_idx = -1;
637cd8c3 MKL	73	static int lru_hash_lookup_test_entries = 32;
9fd63d05 MKL	74	static uint32_t max_cnt = 1000000;
	75
	76	static int check_test_flags(enum test_type t)
	77	{
	78	return test_flags & TEST_BIT(t);
	79	}
26e90931 AS	80
	81	static void test_hash_prealloc(int cpu)
	82	{
	83	__u64 start_time;
	84	int i;
	85
	86	start_time = time_get_ns();
9fd63d05	87	for (i = 0; i < max_cnt; i++)
26e90931 AS	88	syscall(__NR_getuid);
26e90931 AS	89	printf("%d:hash_map_perf pre-alloc %lld events per sec\n",
9fd63d05	90	cpu, max_cnt * 1000000000ll / (time_get_ns() - start_time));
26e90931 AS	91	}
26e90931 AS	92
637cd8c3 MKL	93	static int pre_test_lru_hash_lookup(int tasks)
	94	{
	95	int fd = map_fd[lru_hash_lookup_idx];
	96	uint32_t key;
	97	long val = 1;
	98	int ret;
	99
	100	if (num_map_entries > lru_hash_lookup_test_entries)
	101	lru_hash_lookup_test_entries = num_map_entries;
	102
	103	/* Populate the lru_hash_map for LRU_HASH_LOOKUP perf test.
	104	*
	105	* It is fine that the user requests for a map with
	106	* num_map_entries < 32 and some of the later lru hash lookup
	107	* may return not found. For LRU map, we are not interested
	108	* in such small map performance.
	109	*/
	110	for (key = 0; key < lru_hash_lookup_test_entries; key++) {
	111	ret = bpf_map_update_elem(fd, &key, &val, BPF_NOEXIST);
	112	if (ret)
	113	return ret;
	114	}
	115
	116	return 0;
	117	}
	118
9fd63d05	119	static void do_test_lru(enum test_type test, int cpu)
5db58faf	120	{
3a5795b8 MKL	121	static int inner_lru_map_fds[MAX_NR_CPUS];
3a5795b8 MKL	122
bf8db5d2 MKL	123	struct sockaddr_in6 in6 = { .sin6_family = AF_INET6 };
bf8db5d2 MKL	124	const char *test_name;
5db58faf	125	__u64 start_time;
bf8db5d2 MKL	126	int i, ret;
bf8db5d2 MKL	127
3a5795b8 MKL	128	if (test == INNER_LRU_HASH_PREALLOC) {
3a5795b8 MKL	129	int outer_fd = map_fd[array_of_lru_hashs_idx];
ad17d0e6	130	unsigned int mycpu, mynode;
3a5795b8 MKL	131
	132	assert(cpu < MAX_NR_CPUS);
	133
	134	if (cpu) {
ad17d0e6 MKL	135	ret = syscall(__NR_getcpu, &mycpu, &mynode, NULL);
	136	assert(!ret);
	137
3a5795b8	138	inner_lru_map_fds[cpu] =
ad17d0e6	139	bpf_create_map_node(BPF_MAP_TYPE_LRU_HASH,
88cda1c9	140	test_map_names[INNER_LRU_HASH_PREALLOC],
ad17d0e6 MKL	141	sizeof(uint32_t),
	142	sizeof(long),
	143	inner_lru_hash_size, 0,
	144	mynode);
3a5795b8 MKL	145	if (inner_lru_map_fds[cpu] == -1) {
	146	printf("cannot create BPF_MAP_TYPE_LRU_HASH %s(%d)\n",
	147	strerror(errno), errno);
	148	exit(1);
	149	}
	150	} else {
	151	inner_lru_map_fds[cpu] = map_fd[inner_lru_hash_idx];
	152	}
	153
	154	ret = bpf_map_update_elem(outer_fd, &cpu,
	155	&inner_lru_map_fds[cpu],
	156	BPF_ANY);
	157	if (ret) {
	158	printf("cannot update ARRAY_OF_LRU_HASHS with key:%u. %s(%d)\n",
	159	cpu, strerror(errno), errno);
	160	exit(1);
	161	}
	162	}
	163
bf8db5d2 MKL	164	in6.sin6_addr.s6_addr16[0] = 0xdead;
	165	in6.sin6_addr.s6_addr16[1] = 0xbeef;
	166
9fd63d05	167	if (test == LRU_HASH_PREALLOC) {
bf8db5d2	168	test_name = "lru_hash_map_perf";
637cd8c3	169	in6.sin6_addr.s6_addr16[2] = 0;
9fd63d05	170	} else if (test == NOCOMMON_LRU_HASH_PREALLOC) {
bf8db5d2	171	test_name = "nocommon_lru_hash_map_perf";
637cd8c3	172	in6.sin6_addr.s6_addr16[2] = 1;
3a5795b8 MKL	173	} else if (test == INNER_LRU_HASH_PREALLOC) {
3a5795b8 MKL	174	test_name = "inner_lru_hash_map_perf";
637cd8c3 MKL	175	in6.sin6_addr.s6_addr16[2] = 2;
	176	} else if (test == LRU_HASH_LOOKUP) {
	177	test_name = "lru_hash_lookup_perf";
	178	in6.sin6_addr.s6_addr16[2] = 3;
	179	in6.sin6_addr.s6_addr32[3] = 0;
bf8db5d2 MKL	180	} else {
	181	assert(0);
	182	}
5db58faf MKL	183
5db58faf MKL	184	start_time = time_get_ns();
9fd63d05	185	for (i = 0; i < max_cnt; i++) {
bf8db5d2 MKL	186	ret = connect(-1, (const struct sockaddr *)&in6, sizeof(in6));
bf8db5d2 MKL	187	assert(ret == -1 && errno == EBADF);
637cd8c3 MKL	188	if (in6.sin6_addr.s6_addr32[3] <
	189	lru_hash_lookup_test_entries - 32)
	190	in6.sin6_addr.s6_addr32[3] += 32;
	191	else
	192	in6.sin6_addr.s6_addr32[3] = 0;
bf8db5d2 MKL	193	}
	194	printf("%d:%s pre-alloc %lld events per sec\n",
	195	cpu, test_name,
9fd63d05	196	max_cnt * 1000000000ll / (time_get_ns() - start_time));
5db58faf MKL	197	}
5db58faf MKL	198
bf8db5d2	199	static void test_lru_hash_prealloc(int cpu)
5db58faf	200	{
bf8db5d2 MKL	201	do_test_lru(LRU_HASH_PREALLOC, cpu);
bf8db5d2 MKL	202	}
5db58faf	203
bf8db5d2 MKL	204	static void test_nocommon_lru_hash_prealloc(int cpu)
	205	{
	206	do_test_lru(NOCOMMON_LRU_HASH_PREALLOC, cpu);
5db58faf MKL	207	}
5db58faf MKL	208
3a5795b8 MKL	209	static void test_inner_lru_hash_prealloc(int cpu)
	210	{
	211	do_test_lru(INNER_LRU_HASH_PREALLOC, cpu);
	212	}
	213
637cd8c3 MKL	214	static void test_lru_hash_lookup(int cpu)
	215	{
	216	do_test_lru(LRU_HASH_LOOKUP, cpu);
	217	}
	218
26e90931 AS	219	static void test_percpu_hash_prealloc(int cpu)
	220	{
	221	__u64 start_time;
	222	int i;
	223
	224	start_time = time_get_ns();
9fd63d05	225	for (i = 0; i < max_cnt; i++)
26e90931 AS	226	syscall(__NR_geteuid);
26e90931 AS	227	printf("%d:percpu_hash_map_perf pre-alloc %lld events per sec\n",
9fd63d05	228	cpu, max_cnt * 1000000000ll / (time_get_ns() - start_time));
26e90931 AS	229	}
	230
	231	static void test_hash_kmalloc(int cpu)
	232	{
	233	__u64 start_time;
	234	int i;
	235
	236	start_time = time_get_ns();
9fd63d05	237	for (i = 0; i < max_cnt; i++)
26e90931 AS	238	syscall(__NR_getgid);
26e90931 AS	239	printf("%d:hash_map_perf kmalloc %lld events per sec\n",
9fd63d05	240	cpu, max_cnt * 1000000000ll / (time_get_ns() - start_time));
26e90931 AS	241	}
	242
	243	static void test_percpu_hash_kmalloc(int cpu)
	244	{
	245	__u64 start_time;
	246	int i;
	247
	248	start_time = time_get_ns();
9fd63d05	249	for (i = 0; i < max_cnt; i++)
26e90931 AS	250	syscall(__NR_getegid);
26e90931 AS	251	printf("%d:percpu_hash_map_perf kmalloc %lld events per sec\n",
9fd63d05	252	cpu, max_cnt * 1000000000ll / (time_get_ns() - start_time));
26e90931 AS	253	}
26e90931 AS	254
b8a943e2 DH	255	static void test_lpm_kmalloc(int cpu)
	256	{
	257	__u64 start_time;
	258	int i;
	259
	260	start_time = time_get_ns();
9fd63d05	261	for (i = 0; i < max_cnt; i++)
b8a943e2 DH	262	syscall(__NR_gettid);
b8a943e2 DH	263	printf("%d:lpm_perf kmalloc %lld events per sec\n",
9fd63d05	264	cpu, max_cnt * 1000000000ll / (time_get_ns() - start_time));
b8a943e2 DH	265	}
b8a943e2 DH	266
95ff141e AS	267	static void test_hash_lookup(int cpu)
	268	{
	269	__u64 start_time;
	270	int i;
	271
	272	start_time = time_get_ns();
9fd63d05	273	for (i = 0; i < max_cnt; i++)
95ff141e AS	274	syscall(__NR_getpgid, 0);
95ff141e AS	275	printf("%d:hash_lookup %lld lookups per sec\n",
9fd63d05	276	cpu, max_cnt * 1000000000ll * 64 / (time_get_ns() - start_time));
95ff141e AS	277	}
	278
	279	static void test_array_lookup(int cpu)
	280	{
	281	__u64 start_time;
	282	int i;
	283
	284	start_time = time_get_ns();
9fd63d05	285	for (i = 0; i < max_cnt; i++)
95ec6696	286	syscall(__NR_getppid, 0);
95ff141e	287	printf("%d:array_lookup %lld lookups per sec\n",
9fd63d05	288	cpu, max_cnt * 1000000000ll * 64 / (time_get_ns() - start_time));
95ff141e AS	289	}
95ff141e AS	290
637cd8c3 MKL	291	typedef int (*pre_test_func)(int tasks);
	292	const pre_test_func pre_test_funcs[] = {
	293	[LRU_HASH_LOOKUP] = pre_test_lru_hash_lookup,
	294	};
	295
9fd63d05 MKL	296	typedef void (*test_func)(int cpu);
	297	const test_func test_funcs[] = {
	298	[HASH_PREALLOC] = test_hash_prealloc,
	299	[PERCPU_HASH_PREALLOC] = test_percpu_hash_prealloc,
	300	[HASH_KMALLOC] = test_hash_kmalloc,
	301	[PERCPU_HASH_KMALLOC] = test_percpu_hash_kmalloc,
	302	[LRU_HASH_PREALLOC] = test_lru_hash_prealloc,
	303	[NOCOMMON_LRU_HASH_PREALLOC] = test_nocommon_lru_hash_prealloc,
	304	[LPM_KMALLOC] = test_lpm_kmalloc,
	305	[HASH_LOOKUP] = test_hash_lookup,
	306	[ARRAY_LOOKUP] = test_array_lookup,
3a5795b8	307	[INNER_LRU_HASH_PREALLOC] = test_inner_lru_hash_prealloc,
637cd8c3	308	[LRU_HASH_LOOKUP] = test_lru_hash_lookup,
9fd63d05 MKL	309	};
9fd63d05 MKL	310
637cd8c3 MKL	311	static int pre_test(int tasks)
	312	{
	313	int i;
	314
	315	for (i = 0; i < NR_TESTS; i++) {
	316	if (pre_test_funcs[i] && check_test_flags(i)) {
	317	int ret = pre_test_funcs[i](tasks);
	318
	319	if (ret)
	320	return ret;
	321	}
	322	}
	323
	324	return 0;
	325	}
	326
26e90931 AS	327	static void loop(int cpu)
	328	{
	329	cpu_set_t cpuset;
9fd63d05	330	int i;
26e90931 AS	331
	332	CPU_ZERO(&cpuset);
	333	CPU_SET(cpu, &cpuset);
	334	sched_setaffinity(0, sizeof(cpuset), &cpuset);
	335
9fd63d05 MKL	336	for (i = 0; i < NR_TESTS; i++) {
	337	if (check_test_flags(i))
	338	test_funcs[i](cpu);
	339	}
26e90931 AS	340	}
	341
	342	static void run_perf_test(int tasks)
	343	{
	344	pid_t pid[tasks];
	345	int i;
	346
637cd8c3 MKL	347	assert(!pre_test(tasks));
637cd8c3 MKL	348
26e90931 AS	349	for (i = 0; i < tasks; i++) {
	350	pid[i] = fork();
	351	if (pid[i] == 0) {
	352	loop(i);
	353	exit(0);
	354	} else if (pid[i] == -1) {
	355	printf("couldn't spawn #%d process\n", i);
	356	exit(1);
	357	}
	358	}
	359	for (i = 0; i < tasks; i++) {
	360	int status;
	361
	362	assert(waitpid(pid[i], &status, 0) == pid[i]);
	363	assert(status == 0);
	364	}
	365	}
	366
b8a943e2 DH	367	static void fill_lpm_trie(void)
	368	{
	369	struct bpf_lpm_trie_key *key;
	370	unsigned long value = 0;
	371	unsigned int i;
	372	int r;
	373
	374	key = alloca(sizeof(*key) + 4);
	375	key->prefixlen = 32;
	376
	377	for (i = 0; i < 512; ++i) {
	378	key->prefixlen = rand() % 33;
	379	key->data[0] = rand() & 0xff;
	380	key->data[1] = rand() & 0xff;
	381	key->data[2] = rand() & 0xff;
	382	key->data[3] = rand() & 0xff;
	383	r = bpf_map_update_elem(map_fd[6], key, &value, 0);
	384	assert(!r);
	385	}
	386
	387	key->prefixlen = 32;
	388	key->data[0] = 192;
	389	key->data[1] = 168;
	390	key->data[2] = 0;
	391	key->data[3] = 1;
	392	value = 128;
	393
	394	r = bpf_map_update_elem(map_fd[6], key, &value, 0);
	395	assert(!r);
	396	}
	397
6979bcc7	398	static void fixup_map(struct bpf_map_data *map, int idx)
9fd63d05 MKL	399	{
	400	int i;
	401
6979bcc7	402	if (!strcmp("inner_lru_hash_map", map->name)) {
3a5795b8	403	inner_lru_hash_idx = idx;
6979bcc7	404	inner_lru_hash_size = map->def.max_entries;
3a5795b8 MKL	405	}
3a5795b8 MKL	406
6979bcc7	407	if (!strcmp("array_of_lru_hashs", map->name)) {
3a5795b8 MKL	408	if (inner_lru_hash_idx == -1) {
	409	printf("inner_lru_hash_map must be defined before array_of_lru_hashs\n");
	410	exit(1);
	411	}
6979bcc7	412	map->def.inner_map_idx = inner_lru_hash_idx;
3a5795b8 MKL	413	array_of_lru_hashs_idx = idx;
	414	}
	415
637cd8c3 MKL	416	if (!strcmp("lru_hash_lookup_map", map->name))
	417	lru_hash_lookup_idx = idx;
	418
9fd63d05 MKL	419	if (num_map_entries <= 0)
	420	return;
	421
3a5795b8 MKL	422	inner_lru_hash_size = num_map_entries;
3a5795b8 MKL	423
9fd63d05 MKL	424	/* Only change the max_entries for the enabled test(s) */
9fd63d05 MKL	425	for (i = 0; i < NR_TESTS; i++) {
6979bcc7	426	if (!strcmp(test_map_names[i], map->name) &&
9fd63d05	427	(check_test_flags(i))) {
6979bcc7	428	map->def.max_entries = num_map_entries;
9fd63d05 MKL	429	}
	430	}
	431	}
	432
26e90931 AS	433	int main(int argc, char **argv)
	434	{
	435	struct rlimit r = {RLIM_INFINITY, RLIM_INFINITY};
	436	char filename[256];
	437	int num_cpu = 8;
	438
	439	snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]);
	440	setrlimit(RLIMIT_MEMLOCK, &r);
	441
	442	if (argc > 1)
	443	test_flags = atoi(argv[1]) ? : test_flags;
	444
	445	if (argc > 2)
	446	num_cpu = atoi(argv[2]) ? : num_cpu;
	447
9fd63d05 MKL	448	if (argc > 3)
	449	num_map_entries = atoi(argv[3]);
	450
	451	if (argc > 4)
	452	max_cnt = atoi(argv[4]);
	453
	454	if (load_bpf_file_fixup_map(filename, fixup_map)) {
26e90931 AS	455	printf("%s", bpf_log_buf);
	456	return 1;
	457	}
	458
b8a943e2 DH	459	fill_lpm_trie();
b8a943e2 DH	460
26e90931 AS	461	run_perf_test(num_cpu);
	462
	463	return 0;
	464	}