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
|
#!/usr/bin/perl -w
#
# stackcollapse.pl collapse multiline stacks into single lines.
#
# Parses a multiline stack followed by a number on a separate line, and
# outputs a semicolon separated stack followed by a space and the number.
# If memory addresses (+0xd) are present, they are stripped, and resulting
# identical stacks are colased with their counts summed.
#
# USAGE: ./stackcollapse.pl infile > outfile
#
# Example input:
#
# unix`i86_mwait+0xd
# unix`cpu_idle_mwait+0xf1
# unix`idle+0x114
# unix`thread_start+0x8
# 1641
#
# Example output:
#
# unix`thread_start;unix`idle;unix`cpu_idle_mwait;unix`i86_mwait 1641
#
# Input may contain many stacks, and can be generated using DTrace. The
# first few lines of input are skipped (see $headerlines).
#
# Copyright 2011 Joyent, Inc. All rights reserved.
# Copyright 2011 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
#
# 14-Aug-2011 Brendan Gregg Created this.
use strict;
my $headerlines = 3; # number of input lines to skip
my $includeoffset = 0; # include function offset (except leafs)
my %collapsed;
sub remember_stack {
my ($stack, $count) = @_;
$collapsed{$stack} += $count;
}
my $nr = 0;
my @stack;
foreach (<>) {
next if $nr++ < $headerlines;
chomp;
if (m/^\s*(\d+)+$/) {
my $count = $1;
my $joined = join(";", @stack);
# trim leaf offset if these were retained:
$joined =~ s/\+[^+]*$// if $includeoffset;
remember_stack($joined, $count);
@stack = ();
next;
}
next if (m/^\s*$/);
my $frame = $_;
$frame =~ s/^\s*//;
$frame =~ s/\+[^+]*$// unless $includeoffset;
# Remove arguments from C++ function names:
$frame =~ s/(::.*)[(<].*/$1/;
$frame = "-" if $frame eq "";
my @inline;
for (split /\->/, $frame) {
my $func = $_;
# Strip out L and ; included in java stacks
$func =~ tr/\;/:/;
$func =~ s/^L//;
$func .= "_[i]" if scalar(@inline) > 0; #inlined
push @inline, $func;
}
unshift @stack, @inline;
}
foreach my $k (sort { $a cmp $b } keys %collapsed) {
print "$k $collapsed{$k}\n";
}
|
