forked from brendangregg/FlameGraph
-
Notifications
You must be signed in to change notification settings - Fork 1
/
stackcollapse-ljp.awk
executable file
·74 lines (69 loc) · 1.81 KB
/
stackcollapse-ljp.awk
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
#!/usr/bin/awk -f
#
# stackcollapse-ljp.awk collapse lightweight java profile reports
# into single lines stacks.
#
# Parses a list of multiline stacks generated by:
#
# https://code.google.com/p/lightweight-java-profiler
#
# and outputs a semicolon separated stack followed by a space and a count.
#
# USAGE: ./stackcollapse-ljp.pl infile > outfile
#
# Example input:
#
# 42 3 my_func_b(prog.java:455)
# my_func_a(prog.java:123)
# java.lang.Thread.run(Thread.java:744)
# [...]
#
# Example output:
#
# java.lang.Thread.run;my_func_a;my_func_b 42
#
# The unused number is the number of frames in each stack.
#
# Copyright 2014 Brendan Gregg. All rights reserved.
#
# CDDL HEADER START
#
# The contents of this file are subject to the terms of the
# Common Development and Distribution License (the "License").
# You may not use this file except in compliance with the License.
#
# You can obtain a copy of the license at docs/cddl1.txt or
# http://opensource.org/licenses/CDDL-1.0.
# See the License for the specific language governing permissions
# and limitations under the License.
#
# When distributing Covered Code, include this CDDL HEADER in each
# file and include the License file at docs/cddl1.txt.
# If applicable, add the following below this CDDL HEADER, with the
# fields enclosed by brackets "[]" replaced with your own identifying
# information: Portions Copyright [yyyy] [name of copyright owner]
#
# CDDL HEADER END
#
# 12-Jun-2014 Brendan Gregg Created this.
$1 == "Total" {
# We're done. Print last stack and exit.
print stack, count
exit
}
{
# Strip file location. Comment this out to keep.
gsub(/\(.*\)/, "")
}
NF == 3 {
# New stack begins. Print previous buffered stack.
if (count)
print stack, count
# Begin a new stack.
count = $1
stack = $3
}
NF == 1 {
# Build stack.
stack = $1 ";" stack
}