-
Notifications
You must be signed in to change notification settings - Fork 33
/
mallocstacks.py
executable file
·214 lines (188 loc) · 6.48 KB
/
mallocstacks.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
#!/usr/bin/python
#
# mallocstacks Trace libc malloc() and show stacks and total bytes.
# For Linux, uses BCC, eBPF.
#
# USAGE: mallocstacks [-h] [-p PID | -t TID] [-f]
# [--stack-storage-size STACK_STORAGE_SIZE]
# [-m MIN_BLOCK_TIME] [-M MAX_BLOCK_TIME]
# [duration]
#
# This is a proof-of-concept tool that only traces libc malloc().
# To be developed further, it should also trace realloc(), calloc(), and
# other libc allocator routines.
#
# Copyright 2016 Netflix, Inc.
# Licensed under the Apache License, Version 2.0 (the "License")
#
# 13-Jan-2016 Brendan Gregg Created this (offcputime).
# 22-Dec-2017 " " Converted this into mallocstacks.
from __future__ import print_function
from bcc import BPF
from sys import stderr
from time import sleep, strftime
import argparse
import errno
import signal
# arg validation
def positive_int(val):
try:
ival = int(val)
except ValueError:
raise argparse.ArgumentTypeError("must be an integer")
if ival < 0:
raise argparse.ArgumentTypeError("must be positive")
return ival
def positive_nonzero_int(val):
ival = positive_int(val)
if ival == 0:
raise argparse.ArgumentTypeError("must be nonzero")
return ival
# arguments
examples = """examples:
./mallocstacks # trace libc malloc() bytes until Ctrl-C
./mallocstacks 5 # trace for 5 seconds only
./mallocstacks -f 5 # 5 seconds, and output in folded format
./mallocstacks -m 1000 # only trace I/O more than 1000 usec
./mallocstacks -M 10000 # only trace I/O less than 10000 usec
./mallocstacks -p 185 # only trace threads for PID 185
./mallocstacks -t 188 # only trace thread 188
"""
parser = argparse.ArgumentParser(
description="Summarize libc malloc() bytes by stack trace",
formatter_class=argparse.RawDescriptionHelpFormatter,
epilog=examples)
thread_group = parser.add_mutually_exclusive_group()
# Note: this script provides --pid and --tid flags but their arguments are
# referred to internally using kernel nomenclature: TGID and PID.
thread_group.add_argument("-p", "--pid", metavar="PID", dest="tgid",
help="trace this PID only", type=positive_int)
thread_group.add_argument("-t", "--tid", metavar="TID", dest="pid",
help="trace this TID only", type=positive_int)
parser.add_argument("-f", "--folded", action="store_true",
help="output folded format")
parser.add_argument("--stack-storage-size", default=2048,
type=positive_nonzero_int,
help="the number of unique stack traces that can be stored and "
"displayed (default 2048)")
parser.add_argument("duration", nargs="?", default=99999999,
type=positive_nonzero_int,
help="duration of trace, in seconds")
args = parser.parse_args()
if args.pid and args.tgid:
parser.error("specify only one of -p and -t")
folded = args.folded
duration = int(args.duration)
debug = 0
# signal handler
def signal_ignore(signal, frame):
print()
# define BPF program
bpf_text = """
#include <uapi/linux/ptrace.h>
#include <linux/sched.h>
struct key_t {
u32 pid;
u32 tgid;
int user_stack_id;
char name[TASK_COMM_LEN];
};
BPF_HASH(bytes, struct key_t);
BPF_STACK_TRACE(stack_traces, STACK_STORAGE_SIZE)
int trace_malloc(struct pt_regs *ctx, size_t size) {
u32 pid = bpf_get_current_pid_tgid();
u32 tgid = bpf_get_current_pid_tgid() >> 32;
if (!(THREAD_FILTER)) {
return 0;
}
// create map key
u64 zero = 0, *val;
struct key_t key = {};
key.pid = pid;
key.tgid = tgid;
key.user_stack_id = USER_STACK_GET;
bpf_get_current_comm(&key.name, sizeof(key.name));
val = bytes.lookup_or_init(&key, &zero);
(*val) += size;
return 0;
}
"""
# set thread filter
thread_context = ""
if args.tgid is not None:
thread_context = "PID %d" % args.tgid
thread_filter = 'tgid == %d' % args.tgid
elif args.pid is not None:
thread_context = "TID %d" % args.pid
thread_filter = 'pid == %d' % args.pid
else:
thread_context = "all threads"
thread_filter = '1'
bpf_text = bpf_text.replace('THREAD_FILTER', thread_filter)
# set stack storage size
bpf_text = bpf_text.replace('STACK_STORAGE_SIZE', str(args.stack_storage_size))
# handle stack args
user_stack_get = \
"stack_traces.get_stackid(ctx, BPF_F_REUSE_STACKID | BPF_F_USER_STACK)"
stack_context = "user"
bpf_text = bpf_text.replace('USER_STACK_GET', user_stack_get)
if (debug):
print(bpf_text)
# initialize BPF
b = BPF(text=bpf_text)
if args.pid is not None:
tpid = args.pid
else:
tpid = -1
b.attach_uprobe(name="c", sym="malloc", fn_name="trace_malloc", pid=tpid)
matched = b.num_open_uprobes()
if matched == 0:
print("error: 0 functions traced. Exiting.", file=stderr)
exit(1)
# header
if not folded:
print("Tracing libc malloc() bytes (us) of %s by %s stack" %
(thread_context, stack_context), end="")
if duration < 99999999:
print(" for %d secs." % duration)
else:
print("... Hit Ctrl-C to end.")
try:
sleep(duration)
except KeyboardInterrupt:
# as cleanup can take many seconds, trap Ctrl-C:
signal.signal(signal.SIGINT, signal_ignore)
if not folded:
print()
missing_stacks = 0
has_enomem = False
bytemap = b.get_table("bytes")
stack_traces = b.get_table("stack_traces")
for k, v in sorted(bytemap.items(), key=lambda bytemap: bytemap[1].value):
# handle get_stackid erorrs
if (k.user_stack_id < 0 and k.user_stack_id != -errno.EFAULT):
missing_stacks += 1
# check for an ENOMEM error
if k.user_stack_id == -errno.ENOMEM:
has_enomem = True
continue
# user stacks will be symbolized by tgid, not pid, to avoid the overhead
# of one symbol resolver per thread
user_stack = list(stack_traces.walk(k.user_stack_id))
if folded:
# print folded stack output
line = [k.name.decode()] + \
[b.sym(addr, k.tgid) for addr in reversed(user_stack)]
print("%s %d" % (";".join(line), v.value))
else:
# print default multi-line stack output
for addr in user_stack:
print(" %s" % b.sym(addr, k.tgid))
print(" %-16s %s (%d)" % ("-", k.name.decode(), k.pid))
print(" %d\n" % v.value)
if missing_stacks > 0:
enomem_str = "" if not has_enomem else \
" Consider increasing --stack-storage-size."
print("WARNING: %d stack traces could not be displayed.%s" %
(missing_stacks, enomem_str),
file=stderr)