tools/reorder/histogram.cpp

   1 /* ***** BEGIN LICENSE BLOCK *****
   2  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
   3  *
   4  * The contents of this file are subject to the Mozilla Public License Version
   5  * 1.1 (the "License"); you may not use this file except in compliance with
   6  * the License. You may obtain a copy of the License at
   7  * http://www.mozilla.org/MPL/
   8  *
   9  * Software distributed under the License is distributed on an "AS IS" basis,
  10  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
  11  * for the specific language governing rights and limitations under the
  12  * License.
  13  *
  14  * The Original Code is ``histogram''
  15  *
  16  * The Initial Developer of the Original Code is Netscape
  17  * Communications Corp.  Portions created by the Initial Developer are
  18  * Copyright (C) 2001 the Initial Developer. All Rights Reserved.
  19  *
  20  * Contributor(s):
  21  *   Chris Waterson <waterson@netscape.com>
  22  *
  23  * Alternatively, the contents of this file may be used under the terms of
  24  * either the GNU General Public License Version 2 or later (the "GPL"), or
  25  * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
  26  * in which case the provisions of the GPL or the LGPL are applicable instead
  27  * of those above. If you wish to allow use of your version of this file only
  28  * under the terms of either the GPL or the LGPL, and not to allow others to
  29  * use your version of this file under the terms of the MPL, indicate your
  30  * decision by deleting the provisions above and replace them with the notice
  31  * and other provisions required by the GPL or the LGPL. If you do not delete
  32  * the provisions above, a recipient may use your version of this file under
  33  * the terms of any one of the MPL, the GPL or the LGPL.
  34  *
  35  * ***** END LICENSE BLOCK ***** */
  36
  37 /*
  38
  39   A program that computes a call histogram from runtime call
  40   information. It reads a list of address references (e.g., as
  41   computed by libcygprof.so), and uses an ELF image to map the
  42   addresses to functions.
  43
  44  */
  45
  46 #include <fstream>
  47 #include <hash_map>
  48 #include <limits.h>
  49 #include <unistd.h>
  50 #include <stdio.h>
  51 #include <fcntl.h>
  52
  53 #include "elf_symbol_table.h"
  54
  55 #define _GNU_SOURCE
  56 #include <getopt.h>
  57
  58 const char *opt_exe;
  59 int opt_tick = 0;
  60
  61 elf_symbol_table table;
  62
  63 typedef hash_map<unsigned int, unsigned int> histogram_t;
  64 histogram_t histogram;
  65
  66 static struct option long_options[] = {
  67     { "exe",  required_argument, 0, 'e' },
  68     { "tick", optional_argument, 0, 't' },
  69     { 0,      0,                 0, 0   }
  70 };
  71
  72 static void
  73 usage(const char *name)
  74 {
  75     cerr << "usage: " << name << " --exe=<image> [--tick[=count]]" << endl;
  76 }
  77
  78 static void
  79 map_addrs(int fd)
  80 {
  81     // Read the binary addresses from stdin.
  82     unsigned int buf[128];
  83     ssize_t cb;
  84
  85     unsigned int count = 0;
  86     while ((cb = read(fd, buf, sizeof buf)) > 0) {
  87         if (cb % sizeof buf[0])
  88             fprintf(stderr, "unaligned read\n");
  89
  90         unsigned int *addr = buf;
  91         unsigned int *limit = buf + (cb / 4);
  92
  93         for (; addr < limit; ++addr) {
  94             const Elf32_Sym *sym = table.lookup(*addr);
  95             if (sym)
  96                 ++histogram[reinterpret_cast<unsigned int>(sym)];
  97
  98             if (opt_tick && (++count % opt_tick == 0)) {
  99                 cerr << ".";
 100                 flush(cerr);
 101             }
 102         }
 103     }
 104
 105     if (opt_tick)
 106         cerr << endl;
 107 }
 108
 109 int
 110 main(int argc, char *argv[])
 111 {
 112     int c;
 113     while (1) {
 114         int option_index = 0;
 115         c = getopt_long(argc, argv, "e:t", long_options, &option_index);
 116
 117         if (c < 0)
 118             break;
 119
 120         switch (c) {
 121         case 'e':
 122             opt_exe = optarg;
 123             break;
 124
 125         case 't':
 126             opt_tick = optarg ? atoi(optarg) : 1000000;
 127             break;
 128
 129         default:
 130             usage(argv[0]);
 131             return 1;
 132         }
 133     }
 134
 135     if (! opt_exe) {
 136         usage(argv[0]);
 137         return 1;
 138     }
 139
 140     table.init(opt_exe);
 141
 142     // Process addresses.
 143     if (optind >= argc) {
 144         map_addrs(STDIN_FILENO);
 145     }
 146     else {
 147         do {
 148             int fd = open(argv[optind], O_RDONLY);
 149             if (fd < 0) {
 150                 perror(argv[optind]);
 151                 return 1;
 152             }
 153
 154             map_addrs(fd);
 155             close(fd);
 156         } while (++optind < argc);
 157     }
 158
 159     // Emit the histogram.
 160     histogram_t::const_iterator limit = histogram.end();
 161     histogram_t::const_iterator i;
 162     for (i = histogram.begin(); i != limit; ++i) {
 163         const Elf32_Sym *sym = reinterpret_cast<const Elf32_Sym *>(i->first);
 164         cout.form("%08x %6d %2d %10d ",
 165                   sym->st_value,
 166                   sym->st_size,
 167                   sym->st_shndx,
 168                   i->second);
 169
 170         cout << table.get_symbol_name(sym) << endl;
 171     }
 172
 173     return 0;
 174 }