Skip to content

Commit

Permalink
Merge pull request #239 from stefantalpalaru/wallClockProfiler
Browse files Browse the repository at this point in the history
support wallClockProfiler
  • Loading branch information
brendangregg authored Aug 31, 2021
2 parents 0961c43 + 238ba71 commit 76b07d8
Show file tree
Hide file tree
Showing 2 changed files with 70 additions and 0 deletions.
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -81,6 +81,7 @@ Use the stackcollapse programs to fold stack samples into single lines. The pro
- `stackcollapse-gdb.pl`: for gdb(1) stacks
- `stackcollapse-go.pl`: for Golang pprof stacks
- `stackcollapse-vsprof.pl`: for Microsoft Visual Studio profiles
- `stackcollapse-wcp.pl`: for wallClockProfiler output

Usage example:

Expand Down
69 changes: 69 additions & 0 deletions stackcollapse-wcp.pl
Original file line number Diff line number Diff line change
@@ -0,0 +1,69 @@
#!/usr/bin/perl -ws
#
# stackcollapse-wcp Collapse wallClockProfiler backtraces
#
# Parse a list of GDB backtraces as generated by https://github.com/jasonrohrer/wallClockProfiler
#
# Copyright 2014 Gabriel Corona. All rights reserved.
# Portions Copyright 2020 Ștefan Talpalaru <stefantalpalaru@yahoo.com>
#
# 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

use strict;

my $current = "";
my $start_processing = 0;
my $samples = 0;
my %stacks;

while(<>) {
s/^\s+|\s+$//g;

if (m/^Full stacks/) {
$start_processing = 1;
next;
}

if (not $start_processing) {
next;
}

if(m/^\d+\.\d+% =+ \((\d+) samples\)/) {
# 99.791% ===================================== (17194 samples)
$samples = $1;
next;
} elsif (m/^\d+: (.*)$/) {
# 1: poll__YNjd8fE6xG8CRNwfLnrx0g_2 (at /mnt/sde1/storage/nim-beacon-chain-clean/vendor/nim-chronos/chronos/asyncloop.nim:343)
my $function = $1;
if ($current eq "") {
$current = $function;
} else {
$current = $function . ";" . $current;
}
} elsif (m/^$/ and $current ne "") {
$stacks{$current} += $samples;
$current = "";
}
}

foreach my $k (sort { $a cmp $b } keys %stacks) {
print "$k $stacks{$k}\n";
}

0 comments on commit 76b07d8

Please sign in to comment.