1 /* Copyright (c) 2016 Facebook
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.
7 #include <linux/skbuff.h>
8 #include <linux/netdevice.h>
9 #include <linux/version.h>
10 #include <uapi/linux/bpf.h>
11 #include <bpf/bpf_helpers.h>
12 #include <bpf/bpf_tracing.h>
13 #include <bpf/bpf_core_read.h>
14 #include "trace_common.h"
16 #define MAX_ENTRIES 1000
17 #define MAX_NR_CPUS 1024
20 __uint(type, BPF_MAP_TYPE_HASH);
23 __uint(max_entries, MAX_ENTRIES);
24 } hash_map SEC(".maps");
27 __uint(type, BPF_MAP_TYPE_LRU_HASH);
30 __uint(max_entries, 10000);
31 } lru_hash_map SEC(".maps");
34 __uint(type, BPF_MAP_TYPE_LRU_HASH);
37 __uint(max_entries, 10000);
38 __uint(map_flags, BPF_F_NO_COMMON_LRU);
39 } nocommon_lru_hash_map SEC(".maps");
42 __uint(type, BPF_MAP_TYPE_LRU_HASH);
45 __uint(max_entries, MAX_ENTRIES);
46 __uint(map_flags, BPF_F_NUMA_NODE);
48 } inner_lru_hash_map SEC(".maps");
51 __uint(type, BPF_MAP_TYPE_ARRAY_OF_MAPS);
52 __uint(max_entries, MAX_NR_CPUS);
53 __uint(key_size, sizeof(u32));
54 __array(values, struct inner_lru); /* use inner_lru as inner map */
55 } array_of_lru_hashs SEC(".maps") = {
56 /* statically initialize the first element */
57 .values = { &inner_lru_hash_map },
61 __uint(type, BPF_MAP_TYPE_PERCPU_HASH);
62 __uint(key_size, sizeof(u32));
63 __uint(value_size, sizeof(long));
64 __uint(max_entries, MAX_ENTRIES);
65 } percpu_hash_map SEC(".maps");
68 __uint(type, BPF_MAP_TYPE_HASH);
71 __uint(max_entries, MAX_ENTRIES);
72 __uint(map_flags, BPF_F_NO_PREALLOC);
73 } hash_map_alloc SEC(".maps");
76 __uint(type, BPF_MAP_TYPE_PERCPU_HASH);
77 __uint(key_size, sizeof(u32));
78 __uint(value_size, sizeof(long));
79 __uint(max_entries, MAX_ENTRIES);
80 __uint(map_flags, BPF_F_NO_PREALLOC);
81 } percpu_hash_map_alloc SEC(".maps");
84 __uint(type, BPF_MAP_TYPE_LPM_TRIE);
86 __uint(value_size, sizeof(long));
87 __uint(max_entries, 10000);
88 __uint(map_flags, BPF_F_NO_PREALLOC);
89 } lpm_trie_map_alloc SEC(".maps");
92 __uint(type, BPF_MAP_TYPE_ARRAY);
95 __uint(max_entries, MAX_ENTRIES);
96 } array_map SEC(".maps");
99 __uint(type, BPF_MAP_TYPE_LRU_HASH);
102 __uint(max_entries, MAX_ENTRIES);
103 } lru_hash_lookup_map SEC(".maps");
105 SEC("kprobe/" SYSCALL(sys_getuid))
106 int stress_hmap(struct pt_regs *ctx)
108 u32 key = bpf_get_current_pid_tgid();
113 for (i = 0; i < 10; i++) {
114 bpf_map_update_elem(&hash_map, &key, &init_val, BPF_ANY);
115 value = bpf_map_lookup_elem(&hash_map, &key);
117 bpf_map_delete_elem(&hash_map, &key);
123 SEC("kprobe/" SYSCALL(sys_geteuid))
124 int stress_percpu_hmap(struct pt_regs *ctx)
126 u32 key = bpf_get_current_pid_tgid();
131 for (i = 0; i < 10; i++) {
132 bpf_map_update_elem(&percpu_hash_map, &key, &init_val, BPF_ANY);
133 value = bpf_map_lookup_elem(&percpu_hash_map, &key);
135 bpf_map_delete_elem(&percpu_hash_map, &key);
140 SEC("kprobe/" SYSCALL(sys_getgid))
141 int stress_hmap_alloc(struct pt_regs *ctx)
143 u32 key = bpf_get_current_pid_tgid();
148 for (i = 0; i < 10; i++) {
149 bpf_map_update_elem(&hash_map_alloc, &key, &init_val, BPF_ANY);
150 value = bpf_map_lookup_elem(&hash_map_alloc, &key);
152 bpf_map_delete_elem(&hash_map_alloc, &key);
157 SEC("kprobe/" SYSCALL(sys_getegid))
158 int stress_percpu_hmap_alloc(struct pt_regs *ctx)
160 u32 key = bpf_get_current_pid_tgid();
165 for (i = 0; i < 10; i++) {
166 bpf_map_update_elem(&percpu_hash_map_alloc, &key, &init_val, BPF_ANY);
167 value = bpf_map_lookup_elem(&percpu_hash_map_alloc, &key);
169 bpf_map_delete_elem(&percpu_hash_map_alloc, &key);
174 SEC("kprobe/" SYSCALL(sys_connect))
175 int stress_lru_hmap_alloc(struct pt_regs *ctx)
177 struct pt_regs *real_regs = (struct pt_regs *)PT_REGS_PARM1_CORE(ctx);
178 char fmt[] = "Failed at stress_lru_hmap_alloc. ret:%dn";
190 struct sockaddr_in6 *in6;
196 in6 = (struct sockaddr_in6 *)PT_REGS_PARM2_CORE(real_regs);
197 addrlen = (int)PT_REGS_PARM3_CORE(real_regs);
199 if (addrlen != sizeof(*in6))
202 ret = bpf_probe_read_user(test_params.dst6, sizeof(test_params.dst6),
207 if (test_params.magic0 != 0xdead ||
208 test_params.magic1 != 0xbeef)
211 test_case = test_params.tcase;
213 key = bpf_get_prandom_u32();
215 if (test_case == 0) {
216 ret = bpf_map_update_elem(&lru_hash_map, &key, &val, BPF_ANY);
217 } else if (test_case == 1) {
218 ret = bpf_map_update_elem(&nocommon_lru_hash_map, &key, &val,
220 } else if (test_case == 2) {
221 void *nolocal_lru_map;
222 int cpu = bpf_get_smp_processor_id();
224 nolocal_lru_map = bpf_map_lookup_elem(&array_of_lru_hashs,
226 if (!nolocal_lru_map) {
231 ret = bpf_map_update_elem(nolocal_lru_map, &key, &val,
233 } else if (test_case == 3) {
236 key = test_params.key;
238 #pragma clang loop unroll(full)
239 for (i = 0; i < 32; i++) {
240 bpf_map_lookup_elem(&lru_hash_lookup_map, &key);
249 bpf_trace_printk(fmt, sizeof(fmt), ret);
254 SEC("kprobe/" SYSCALL(sys_gettid))
255 int stress_lpm_trie_map_alloc(struct pt_regs *ctx)
269 #pragma clang loop unroll(full)
270 for (i = 0; i < 32; ++i)
271 bpf_map_lookup_elem(&lpm_trie_map_alloc, &key);
276 SEC("kprobe/" SYSCALL(sys_getpgid))
277 int stress_hash_map_lookup(struct pt_regs *ctx)
282 #pragma clang loop unroll(full)
283 for (i = 0; i < 64; ++i)
284 value = bpf_map_lookup_elem(&hash_map, &key);
289 SEC("kprobe/" SYSCALL(sys_getppid))
290 int stress_array_map_lookup(struct pt_regs *ctx)
295 #pragma clang loop unroll(full)
296 for (i = 0; i < 64; ++i)
297 value = bpf_map_lookup_elem(&array_map, &key);
302 char _license[] SEC("license") = "GPL";
303 u32 _version SEC("version") = LINUX_VERSION_CODE;