blob: e8faf8f184ae1a64f5d7fb39139079934fcf976d [file] [log] [blame]
Thomas Gleixner25763b32019-05-28 10:10:09 -07001// SPDX-License-Identifier: GPL-2.0-only
Alexei Starovoitov9811e352015-03-25 12:49:26 -07002/* Copyright (c) 2015 PLUMgrid, http://plumgrid.com
Alexei Starovoitov9811e352015-03-25 12:49:26 -07003 */
4#include <stdio.h>
5#include <stdlib.h>
6#include <signal.h>
7#include <unistd.h>
8#include <stdbool.h>
9#include <string.h>
10#include <time.h>
Jesper Dangaard Brouer55de1702017-05-02 14:31:50 +020011#include <sys/resource.h>
12
Jakub Kicinski2bf3e2e2018-05-14 22:35:02 -070013#include <bpf/bpf.h>
Daniel T. Lee63841bc2020-05-16 13:06:05 +090014#include <bpf/libbpf.h>
Alexei Starovoitov9811e352015-03-25 12:49:26 -070015
16struct pair {
17 long long val;
18 __u64 ip;
19};
20
21static __u64 time_get_ns(void)
22{
23 struct timespec ts;
24
25 clock_gettime(CLOCK_MONOTONIC, &ts);
26 return ts.tv_sec * 1000000000ull + ts.tv_nsec;
27}
28
29static void print_old_objects(int fd)
30{
31 long long val = time_get_ns();
32 __u64 key, next_key;
33 struct pair v;
34
35 key = write(1, "\e[1;1H\e[2J", 12); /* clear screen */
36
37 key = -1;
Daniel T. Lee63841bc2020-05-16 13:06:05 +090038 while (bpf_map_get_next_key(fd, &key, &next_key) == 0) {
39 bpf_map_lookup_elem(fd, &next_key, &v);
Alexei Starovoitov9811e352015-03-25 12:49:26 -070040 key = next_key;
41 if (val - v.val < 1000000000ll)
42 /* object was allocated more then 1 sec ago */
43 continue;
44 printf("obj 0x%llx is %2lldsec old was allocated at ip %llx\n",
45 next_key, (val - v.val) / 1000000000ll, v.ip);
46 }
47}
48
49int main(int ac, char **argv)
50{
Jesper Dangaard Brouer55de1702017-05-02 14:31:50 +020051 struct rlimit r = {RLIM_INFINITY, RLIM_INFINITY};
Daniel T. Lee63841bc2020-05-16 13:06:05 +090052 struct bpf_link *links[2];
53 struct bpf_program *prog;
54 struct bpf_object *obj;
Alexei Starovoitov9811e352015-03-25 12:49:26 -070055 char filename[256];
Daniel T. Lee63841bc2020-05-16 13:06:05 +090056 int map_fd, i, j = 0;
Alexei Starovoitov9811e352015-03-25 12:49:26 -070057
Jesper Dangaard Brouer55de1702017-05-02 14:31:50 +020058 if (setrlimit(RLIMIT_MEMLOCK, &r)) {
59 perror("setrlimit(RLIMIT_MEMLOCK, RLIM_INFINITY)");
60 return 1;
61 }
62
Daniel T. Lee63841bc2020-05-16 13:06:05 +090063 snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]);
64 obj = bpf_object__open_file(filename, NULL);
65 if (libbpf_get_error(obj)) {
66 fprintf(stderr, "ERROR: opening BPF object file failed\n");
67 return 0;
68 }
69
70 /* load BPF program */
71 if (bpf_object__load(obj)) {
72 fprintf(stderr, "ERROR: loading BPF object file failed\n");
73 goto cleanup;
74 }
75
76 map_fd = bpf_object__find_map_fd_by_name(obj, "my_map");
77 if (map_fd < 0) {
78 fprintf(stderr, "ERROR: finding a map in obj file failed\n");
79 goto cleanup;
80 }
81
82 bpf_object__for_each_program(prog, obj) {
83 links[j] = bpf_program__attach(prog);
84 if (libbpf_get_error(links[j])) {
85 fprintf(stderr, "ERROR: bpf_program__attach failed\n");
86 links[j] = NULL;
87 goto cleanup;
88 }
89 j++;
Alexei Starovoitov9811e352015-03-25 12:49:26 -070090 }
91
92 for (i = 0; ; i++) {
Daniel T. Lee63841bc2020-05-16 13:06:05 +090093 print_old_objects(map_fd);
Alexei Starovoitov9811e352015-03-25 12:49:26 -070094 sleep(1);
95 }
96
Daniel T. Lee63841bc2020-05-16 13:06:05 +090097cleanup:
98 for (j--; j >= 0; j--)
99 bpf_link__destroy(links[j]);
100
101 bpf_object__close(obj);
Alexei Starovoitov9811e352015-03-25 12:49:26 -0700102 return 0;
103}