Merge branch 'for-next' of git://git.kernel.org/pub/scm/linux/kernel/git/shli/md
[linux-2.6-block.git] / tools / perf / tests / bpf.c
CommitLineData
a43783ae 1#include <errno.h>
ba1fae43
WN
2#include <stdio.h>
3#include <sys/epoll.h>
7a8ef4c4
ACM
4#include <sys/types.h>
5#include <sys/stat.h>
bafae98e 6#include <fcntl.h>
6a7d550e 7#include <util/util.h>
ba1fae43
WN
8#include <util/bpf-loader.h>
9#include <util/evlist.h>
6a7d550e
WN
10#include <linux/bpf.h>
11#include <linux/filter.h>
877a7a11 12#include <linux/kernel.h>
a2630536 13#include <api/fs/fs.h>
6a7d550e 14#include <bpf/bpf.h>
ba1fae43
WN
15#include "tests.h"
16#include "llvm.h"
17#include "debug.h"
18#define NR_ITERS 111
a2630536 19#define PERF_TEST_BPF_PATH "/sys/fs/bpf/perf_test"
ba1fae43
WN
20
21#ifdef HAVE_LIBBPF_SUPPORT
22
e0337f4f 23static int epoll_pwait_loop(void)
ba1fae43
WN
24{
25 int i;
26
27 /* Should fail NR_ITERS times */
28 for (i = 0; i < NR_ITERS; i++)
e0337f4f 29 epoll_pwait(-(i + 1), NULL, 0, 0, NULL);
ba1fae43
WN
30 return 0;
31}
32
bbb7d492
WN
33#ifdef HAVE_BPF_PROLOGUE
34
35static int llseek_loop(void)
36{
37 int fds[2], i;
38
39 fds[0] = open("/dev/null", O_RDONLY);
40 fds[1] = open("/dev/null", O_RDWR);
41
42 if (fds[0] < 0 || fds[1] < 0)
43 return -1;
44
45 for (i = 0; i < NR_ITERS; i++) {
46 lseek(fds[i % 2], i, (i / 2) % 2 ? SEEK_CUR : SEEK_SET);
47 lseek(fds[(i + 1) % 2], i, (i / 2) % 2 ? SEEK_CUR : SEEK_SET);
48 }
49 close(fds[0]);
50 close(fds[1]);
51 return 0;
52}
53
54#endif
55
ba1fae43
WN
56static struct {
57 enum test_llvm__testcase prog_id;
58 const char *desc;
59 const char *name;
60 const char *msg_compile_fail;
61 const char *msg_load_fail;
62 int (*target_func)(void);
63 int expect_result;
a2630536 64 bool pin;
ba1fae43
WN
65} bpf_testcase_table[] = {
66 {
13cb2d0f
ACM
67 .prog_id = LLVM_TESTCASE_BASE,
68 .desc = "Basic BPF filtering",
69 .name = "[basic_bpf_test]",
70 .msg_compile_fail = "fix 'perf test LLVM' first",
71 .msg_load_fail = "load bpf object failed",
e0337f4f 72 .target_func = &epoll_pwait_loop,
13cb2d0f 73 .expect_result = (NR_ITERS + 1) / 2,
a2630536
JS
74 },
75 {
13cb2d0f
ACM
76 .prog_id = LLVM_TESTCASE_BASE,
77 .desc = "BPF pinning",
78 .name = "[bpf_pinning]",
79 .msg_compile_fail = "fix kbuild first",
80 .msg_load_fail = "check your vmlinux setting?",
e0337f4f 81 .target_func = &epoll_pwait_loop,
13cb2d0f
ACM
82 .expect_result = (NR_ITERS + 1) / 2,
83 .pin = true,
ba1fae43 84 },
bbb7d492
WN
85#ifdef HAVE_BPF_PROLOGUE
86 {
13cb2d0f
ACM
87 .prog_id = LLVM_TESTCASE_BPF_PROLOGUE,
88 .desc = "BPF prologue generation",
89 .name = "[bpf_prologue_test]",
90 .msg_compile_fail = "fix kbuild first",
91 .msg_load_fail = "check your vmlinux setting?",
92 .target_func = &llseek_loop,
93 .expect_result = (NR_ITERS + 1) / 4,
bbb7d492
WN
94 },
95#endif
7b6982ce 96 {
13cb2d0f
ACM
97 .prog_id = LLVM_TESTCASE_BPF_RELOCATION,
98 .desc = "BPF relocation checker",
99 .name = "[bpf_relocation_test]",
100 .msg_compile_fail = "fix 'perf test LLVM' first",
101 .msg_load_fail = "libbpf error when dealing with relocation",
7b6982ce 102 },
ba1fae43
WN
103};
104
105static int do_test(struct bpf_object *obj, int (*func)(void),
106 int expect)
107{
108 struct record_opts opts = {
109 .target = {
110 .uid = UINT_MAX,
111 .uses_mmap = true,
112 },
113 .freq = 0,
114 .mmap_pages = 256,
115 .default_interval = 1,
116 };
117
118 char pid[16];
119 char sbuf[STRERR_BUFSIZE];
120 struct perf_evlist *evlist;
121 int i, ret = TEST_FAIL, err = 0, count = 0;
122
5d9cdc11 123 struct parse_events_state parse_state;
ba1fae43
WN
124 struct parse_events_error parse_error;
125
126 bzero(&parse_error, sizeof(parse_error));
5d9cdc11
ACM
127 bzero(&parse_state, sizeof(parse_state));
128 parse_state.error = &parse_error;
129 INIT_LIST_HEAD(&parse_state.list);
ba1fae43 130
5d9cdc11
ACM
131 err = parse_events_load_bpf_obj(&parse_state, &parse_state.list, obj, NULL);
132 if (err || list_empty(&parse_state.list)) {
ba1fae43 133 pr_debug("Failed to add events selected by BPF\n");
ad0dd7ae 134 return TEST_FAIL;
ba1fae43
WN
135 }
136
137 snprintf(pid, sizeof(pid), "%d", getpid());
138 pid[sizeof(pid) - 1] = '\0';
139 opts.target.tid = opts.target.pid = pid;
140
141 /* Instead of perf_evlist__new_default, don't add default events */
142 evlist = perf_evlist__new();
143 if (!evlist) {
042cfb5f 144 pr_debug("Not enough memory to create evlist\n");
ba1fae43
WN
145 return TEST_FAIL;
146 }
147
148 err = perf_evlist__create_maps(evlist, &opts.target);
149 if (err < 0) {
150 pr_debug("Not enough memory to create thread/cpu maps\n");
151 goto out_delete_evlist;
152 }
153
5d9cdc11
ACM
154 perf_evlist__splice_list_tail(evlist, &parse_state.list);
155 evlist->nr_groups = parse_state.nr_groups;
ba1fae43 156
e68ae9cf 157 perf_evlist__config(evlist, &opts, NULL);
ba1fae43
WN
158
159 err = perf_evlist__open(evlist);
160 if (err < 0) {
161 pr_debug("perf_evlist__open: %s\n",
c8b5f2c9 162 str_error_r(errno, sbuf, sizeof(sbuf)));
ba1fae43
WN
163 goto out_delete_evlist;
164 }
165
f74b9d3a 166 err = perf_evlist__mmap(evlist, opts.mmap_pages);
ba1fae43
WN
167 if (err < 0) {
168 pr_debug("perf_evlist__mmap: %s\n",
c8b5f2c9 169 str_error_r(errno, sbuf, sizeof(sbuf)));
ba1fae43
WN
170 goto out_delete_evlist;
171 }
172
173 perf_evlist__enable(evlist);
174 (*func)();
175 perf_evlist__disable(evlist);
176
177 for (i = 0; i < evlist->nr_mmaps; i++) {
178 union perf_event *event;
179
180 while ((event = perf_evlist__mmap_read(evlist, i)) != NULL) {
181 const u32 type = event->header.type;
182
183 if (type == PERF_RECORD_SAMPLE)
184 count ++;
185 }
186 }
187
ad0dd7ae 188 if (count != expect) {
6703c977 189 pr_debug("BPF filter result incorrect, expected %d, got %d samples\n", expect, count);
ad0dd7ae
WN
190 goto out_delete_evlist;
191 }
ba1fae43
WN
192
193 ret = TEST_OK;
194
195out_delete_evlist:
196 perf_evlist__delete(evlist);
197 return ret;
198}
199
200static struct bpf_object *
201prepare_bpf(void *obj_buf, size_t obj_buf_sz, const char *name)
202{
203 struct bpf_object *obj;
204
205 obj = bpf__prepare_load_buffer(obj_buf, obj_buf_sz, name);
206 if (IS_ERR(obj)) {
207 pr_debug("Compile BPF program failed.\n");
208 return NULL;
209 }
210 return obj;
211}
212
916d4092 213static int __test__bpf(int idx)
ba1fae43
WN
214{
215 int ret;
216 void *obj_buf;
217 size_t obj_buf_sz;
218 struct bpf_object *obj;
219
220 ret = test_llvm__fetch_bpf_obj(&obj_buf, &obj_buf_sz,
916d4092 221 bpf_testcase_table[idx].prog_id,
7b6982ce 222 true, NULL);
ba1fae43
WN
223 if (ret != TEST_OK || !obj_buf || !obj_buf_sz) {
224 pr_debug("Unable to get BPF object, %s\n",
916d4092
ACM
225 bpf_testcase_table[idx].msg_compile_fail);
226 if (idx == 0)
ba1fae43
WN
227 return TEST_SKIP;
228 else
229 return TEST_FAIL;
230 }
231
232 obj = prepare_bpf(obj_buf, obj_buf_sz,
916d4092 233 bpf_testcase_table[idx].name);
7b6982ce
WN
234 if ((!!bpf_testcase_table[idx].target_func) != (!!obj)) {
235 if (!obj)
236 pr_debug("Fail to load BPF object: %s\n",
237 bpf_testcase_table[idx].msg_load_fail);
238 else
239 pr_debug("Success unexpectedly: %s\n",
240 bpf_testcase_table[idx].msg_load_fail);
ba1fae43
WN
241 ret = TEST_FAIL;
242 goto out;
243 }
244
a2630536 245 if (obj) {
7b6982ce
WN
246 ret = do_test(obj,
247 bpf_testcase_table[idx].target_func,
248 bpf_testcase_table[idx].expect_result);
a2630536
JS
249 if (ret != TEST_OK)
250 goto out;
251 if (bpf_testcase_table[idx].pin) {
252 int err;
253
254 if (!bpf_fs__mount()) {
255 pr_debug("BPF filesystem not mounted\n");
256 ret = TEST_FAIL;
257 goto out;
258 }
259 err = mkdir(PERF_TEST_BPF_PATH, 0777);
260 if (err && errno != EEXIST) {
261 pr_debug("Failed to make perf_test dir: %s\n",
262 strerror(errno));
263 ret = TEST_FAIL;
264 goto out;
265 }
266 if (bpf_object__pin(obj, PERF_TEST_BPF_PATH))
267 ret = TEST_FAIL;
268 if (rm_rf(PERF_TEST_BPF_PATH))
269 ret = TEST_FAIL;
270 }
271 }
272
ba1fae43
WN
273out:
274 bpf__clear();
275 return ret;
276}
277
77a0cf68
WN
278int test__bpf_subtest_get_nr(void)
279{
280 return (int)ARRAY_SIZE(bpf_testcase_table);
281}
282
283const char *test__bpf_subtest_get_desc(int i)
284{
285 if (i < 0 || i >= (int)ARRAY_SIZE(bpf_testcase_table))
286 return NULL;
287 return bpf_testcase_table[i].desc;
288}
289
6a7d550e
WN
290static int check_env(void)
291{
292 int err;
293 unsigned int kver_int;
294 char license[] = "GPL";
295
296 struct bpf_insn insns[] = {
297 BPF_MOV64_IMM(BPF_REG_0, 1),
298 BPF_EXIT_INSN(),
299 };
300
301 err = fetch_kernel_version(&kver_int, NULL, 0);
302 if (err) {
303 pr_debug("Unable to get kernel version\n");
304 return err;
305 }
306
307 err = bpf_load_program(BPF_PROG_TYPE_KPROBE, insns,
308 sizeof(insns) / sizeof(insns[0]),
309 license, kver_int, NULL, 0);
310 if (err < 0) {
311 pr_err("Missing basic BPF support, skip this test: %s\n",
312 strerror(errno));
313 return err;
314 }
315 close(err);
316
317 return 0;
318}
319
81f17c90 320int test__bpf(struct test *test __maybe_unused, int i)
ba1fae43 321{
ba1fae43
WN
322 int err;
323
77a0cf68
WN
324 if (i < 0 || i >= (int)ARRAY_SIZE(bpf_testcase_table))
325 return TEST_FAIL;
326
ba1fae43
WN
327 if (geteuid() != 0) {
328 pr_debug("Only root can run BPF test\n");
329 return TEST_SKIP;
330 }
331
6a7d550e
WN
332 if (check_env())
333 return TEST_SKIP;
334
77a0cf68
WN
335 err = __test__bpf(i);
336 return err;
337}
ba1fae43 338
77a0cf68
WN
339#else
340int test__bpf_subtest_get_nr(void)
341{
342 return 0;
343}
ba1fae43 344
77a0cf68
WN
345const char *test__bpf_subtest_get_desc(int i __maybe_unused)
346{
347 return NULL;
ba1fae43
WN
348}
349
81f17c90 350int test__bpf(struct test *test __maybe_unused, int i __maybe_unused)
ba1fae43
WN
351{
352 pr_debug("Skip BPF test because BPF support is not compiled\n");
353 return TEST_SKIP;
354}
355#endif