3 # ***** BEGIN LICENSE BLOCK *****
4 # Version: MPL 1.1/GPL 2.0/LGPL 2.1
6 # The contents of this file are subject to the Mozilla Public License Version
7 # 1.1 (the "License"); you may not use this file except in compliance with
8 # the License. You may obtain a copy of the License at
9 # http://www.mozilla.org/MPL/
11 # Software distributed under the License is distributed on an "AS IS" basis,
12 # WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
13 # for the specific language governing rights and limitations under the
16 # The Original Code is historgram-diff.sh, released
19 # The Initial Developer of the Original Code is
20 # Netscape Communications Corporation.
21 # Portions created by the Initial Developer are Copyright (C) 2000
22 # the Initial Developer. All Rights Reserved.
25 # Chris Waterson <waterson@netscape.com>
27 # Alternatively, the contents of this file may be used under the terms of
28 # either the GNU General Public License Version 2 or later (the "GPL"), or
29 # the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
30 # in which case the provisions of the GPL or the LGPL are applicable instead
31 # of those above. If you wish to allow use of your version of this file only
32 # under the terms of either the GPL or the LGPL, and not to allow others to
33 # use your version of this file under the terms of the MPL, indicate your
34 # decision by deleting the provisions above and replace them with the notice
35 # and other provisions required by the GPL or the LGPL. If you do not delete
36 # the provisions above, a recipient may use your version of this file under
37 # the terms of any one of the MPL, the GPL or the LGPL.
39 # ***** END LICENSE BLOCK *****
41 # histogram-diff.sh [-c <count>] <base> <incr>
43 # Compute incremental memory growth from histogram in file <base> to
44 # histogram in file <incr>, displaying at most <count> rows.
46 # How many rows are we gonna show?
50 while [ $# -gt 0 ]; do
63 # Sort the base and incremental files so that we can `join' them on
65 sort $BASE > /tmp
/$$.left
66 sort $INCR > /tmp
/$$.right
68 # Do the join. The `awk' script computes the difference between
69 # the base and the incremental files.
70 join /tmp
/$$.left
/tmp
/$$.right \
71 |
awk '{ print $1, $2, $3, $4, $5, $4 - $2, $5 - $3; }' \
74 rm -f /tmp
/$$.left
/tmp
/$$.right
76 # Now compute a `TOTAL' row.
77 awk '{ tobj1 += $2; tbytes1 += $3; tobj2 += $4; tbytes2 += $5; tdobj += $6; tdbytes += $7; } END { print "TOTAL", tobj1, tbytes1, tobj2, tbytes2, tdobj, tdbytes; }' /tmp
/$$.joined \
80 # Then, we sort by the largest delta in bytes.
81 sort -nr +6 /tmp
/$$.joined
>> /tmp
/$$.sorted
85 # Pretty-print, including percentages
86 cat <<EOF > /tmp/$$.awk
88 print " ---- Base ---- ---- Incr ---- ----- Difference ----";
89 print "Type Count Bytes Count Bytes Count Bytes %Total";
95 printf "%-22s %6d %8d %6d %8d %6d %8d %6.2lf\n", \$1, \$2, \$3, \$4, \$5, \$6, \$7, 100.0 * \$7 / tbytes;
98 oobjs1 += \$2; obytes1 += \$3;
99 oobjs2 += \$4; obytes2 += \$5;
100 odobjs += \$6; odbytes += \$7;
103 printf "%-22s %6d %8d %6d %8d %6d %8d %6.2lf\n", "OTHER", oobjs1, obytes1, oobjs2, obytes2, odobjs, odbytes, odbytes * 100.0 / tbytes;
107 # Now pretty print the file, and spit it out on stdout.
108 awk -f /tmp
/$$.
awk /tmp
/$$.sorted
110 rm -f /tmp
/$$.
awk /tmp
/$$.sorted