forked from torvalds/linux
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
samples/bpf: Add kmem_alloc()/free() tracker tool
One BPF program attaches to kmem_cache_alloc_node() and remembers all allocated objects in the map. Another program attaches to kmem_cache_free() and deletes corresponding object from the map. User space walks the map every second and prints any objects which are older than 1 second. Usage: $ sudo tracex4 Then start few long living processes. The 'tracex4' will print something like this: obj 0xffff880465928000 is 13sec old was allocated at ip ffffffff8105dc32 obj 0xffff88043181c280 is 13sec old was allocated at ip ffffffff8105dc32 obj 0xffff880465848000 is 8sec old was allocated at ip ffffffff8105dc32 obj 0xffff8804338bc280 is 15sec old was allocated at ip ffffffff8105dc32 $ addr2line -fispe vmlinux ffffffff8105dc32 do_fork at fork.c:1665 As soon as processes exit the memory is reclaimed and 'tracex4' prints nothing. Similar experiment can be done with the __kmalloc()/kfree() pair. Signed-off-by: Alexei Starovoitov <[email protected]> Cc: Andrew Morton <[email protected]> Cc: Arnaldo Carvalho de Melo <[email protected]> Cc: Arnaldo Carvalho de Melo <[email protected]> Cc: Daniel Borkmann <[email protected]> Cc: David S. Miller <[email protected]> Cc: Jiri Olsa <[email protected]> Cc: Linus Torvalds <[email protected]> Cc: Masami Hiramatsu <[email protected]> Cc: Namhyung Kim <[email protected]> Cc: Peter Zijlstra <[email protected]> Cc: Peter Zijlstra <[email protected]> Cc: Steven Rostedt <[email protected]> Link: http://lkml.kernel.org/r/[email protected] Signed-off-by: Ingo Molnar <[email protected]>
- Loading branch information
Alexei Starovoitov
authored and
Ingo Molnar
committed
Apr 2, 2015
1 parent
5c7fc2d
commit 9811e35
Showing
3 changed files
with
127 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,54 @@ | ||
/* Copyright (c) 2015 PLUMgrid, http://plumgrid.com | ||
* | ||
* 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. | ||
*/ | ||
#include <linux/ptrace.h> | ||
#include <linux/version.h> | ||
#include <uapi/linux/bpf.h> | ||
#include "bpf_helpers.h" | ||
|
||
struct pair { | ||
u64 val; | ||
u64 ip; | ||
}; | ||
|
||
struct bpf_map_def SEC("maps") my_map = { | ||
.type = BPF_MAP_TYPE_HASH, | ||
.key_size = sizeof(long), | ||
.value_size = sizeof(struct pair), | ||
.max_entries = 1000000, | ||
}; | ||
|
||
/* kprobe is NOT a stable ABI. If kernel internals change this bpf+kprobe | ||
* example will no longer be meaningful | ||
*/ | ||
SEC("kprobe/kmem_cache_free") | ||
int bpf_prog1(struct pt_regs *ctx) | ||
{ | ||
long ptr = ctx->si; | ||
|
||
bpf_map_delete_elem(&my_map, &ptr); | ||
return 0; | ||
} | ||
|
||
SEC("kretprobe/kmem_cache_alloc_node") | ||
int bpf_prog2(struct pt_regs *ctx) | ||
{ | ||
long ptr = ctx->ax; | ||
long ip = 0; | ||
|
||
/* get ip address of kmem_cache_alloc_node() caller */ | ||
bpf_probe_read(&ip, sizeof(ip), (void *)(ctx->bp + sizeof(ip))); | ||
|
||
struct pair v = { | ||
.val = bpf_ktime_get_ns(), | ||
.ip = ip, | ||
}; | ||
|
||
bpf_map_update_elem(&my_map, &ptr, &v, BPF_ANY); | ||
return 0; | ||
} | ||
char _license[] SEC("license") = "GPL"; | ||
u32 _version SEC("version") = LINUX_VERSION_CODE; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,69 @@ | ||
/* Copyright (c) 2015 PLUMgrid, http://plumgrid.com | ||
* | ||
* 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. | ||
*/ | ||
#include <stdio.h> | ||
#include <stdlib.h> | ||
#include <signal.h> | ||
#include <unistd.h> | ||
#include <stdbool.h> | ||
#include <string.h> | ||
#include <time.h> | ||
#include <linux/bpf.h> | ||
#include "libbpf.h" | ||
#include "bpf_load.h" | ||
|
||
struct pair { | ||
long long val; | ||
__u64 ip; | ||
}; | ||
|
||
static __u64 time_get_ns(void) | ||
{ | ||
struct timespec ts; | ||
|
||
clock_gettime(CLOCK_MONOTONIC, &ts); | ||
return ts.tv_sec * 1000000000ull + ts.tv_nsec; | ||
} | ||
|
||
static void print_old_objects(int fd) | ||
{ | ||
long long val = time_get_ns(); | ||
__u64 key, next_key; | ||
struct pair v; | ||
|
||
key = write(1, "\e[1;1H\e[2J", 12); /* clear screen */ | ||
|
||
key = -1; | ||
while (bpf_get_next_key(map_fd[0], &key, &next_key) == 0) { | ||
bpf_lookup_elem(map_fd[0], &next_key, &v); | ||
key = next_key; | ||
if (val - v.val < 1000000000ll) | ||
/* object was allocated more then 1 sec ago */ | ||
continue; | ||
printf("obj 0x%llx is %2lldsec old was allocated at ip %llx\n", | ||
next_key, (val - v.val) / 1000000000ll, v.ip); | ||
} | ||
} | ||
|
||
int main(int ac, char **argv) | ||
{ | ||
char filename[256]; | ||
int i; | ||
|
||
snprintf(filename, sizeof(filename), "%s_kern.o", argv[0]); | ||
|
||
if (load_bpf_file(filename)) { | ||
printf("%s", bpf_log_buf); | ||
return 1; | ||
} | ||
|
||
for (i = 0; ; i++) { | ||
print_old_objects(map_fd[1]); | ||
sleep(1); | ||
} | ||
|
||
return 0; | ||
} |