DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Mercurial (5216dd412535)

VCS Links

Line Code
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 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174
/* ***** BEGIN LICENSE BLOCK *****
 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
 *
 * The contents of this file are subject to the Mozilla Public License Version
 * 1.1 (the "License"); you may not use this file except in compliance with
 * the License. You may obtain a copy of the License at
 * http://www.mozilla.org/MPL/
 *
 * Software distributed under the License is distributed on an "AS IS" basis,
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 * for the specific language governing rights and limitations under the
 * License.
 *
 * The Original Code is ``histogram''
 *
 * The Initial Developer of the Original Code is Netscape
 * Communications Corp.  Portions created by the Initial Developer are
 * Copyright (C) 2001 the Initial Developer. All Rights Reserved.
 *
 * Contributor(s):
 *   Chris Waterson <waterson@netscape.com>
 *
 * Alternatively, the contents of this file may be used under the terms of
 * either the GNU General Public License Version 2 or later (the "GPL"), or
 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
 * in which case the provisions of the GPL or the LGPL are applicable instead
 * of those above. If you wish to allow use of your version of this file only
 * under the terms of either the GPL or the LGPL, and not to allow others to
 * use your version of this file under the terms of the MPL, indicate your
 * decision by deleting the provisions above and replace them with the notice
 * and other provisions required by the GPL or the LGPL. If you do not delete
 * the provisions above, a recipient may use your version of this file under
 * the terms of any one of the MPL, the GPL or the LGPL.
 *
 * ***** END LICENSE BLOCK ***** */

/*

  A program that computes a call histogram from runtime call
  information. It reads a list of address references (e.g., as
  computed by libcygprof.so), and uses an ELF image to map the
  addresses to functions.

 */

#include <fstream>
#include <hash_map>
#include <limits.h>
#include <unistd.h>
#include <stdio.h>
#include <fcntl.h>

#include "elf_symbol_table.h"

#define _GNU_SOURCE
#include <getopt.h>

const char *opt_exe;
int opt_tick = 0;

elf_symbol_table table;

typedef hash_map<unsigned int, unsigned int> histogram_t;
histogram_t histogram;

static struct option long_options[] = {
    { "exe",  required_argument, 0, 'e' },
    { "tick", optional_argument, 0, 't' },
    { 0,      0,                 0, 0   }
};

static void
usage(const char *name)
{
    cerr << "usage: " << name << " --exe=<image> [--tick[=count]]" << endl;
}

static void
map_addrs(int fd)
{
    // Read the binary addresses from stdin.
    unsigned int buf[128];
    ssize_t cb;

    unsigned int count = 0;
    while ((cb = read(fd, buf, sizeof buf)) > 0) {
        if (cb % sizeof buf[0])
            fprintf(stderr, "unaligned read\n");

        unsigned int *addr = buf;
        unsigned int *limit = buf + (cb / 4);

        for (; addr < limit; ++addr) {
            const Elf32_Sym *sym = table.lookup(*addr);
            if (sym)
                ++histogram[reinterpret_cast<unsigned int>(sym)];

            if (opt_tick && (++count % opt_tick == 0)) {
                cerr << ".";
                flush(cerr);
            }
        }
    }

    if (opt_tick)
        cerr << endl;
}

int
main(int argc, char *argv[])
{
    int c;
    while (1) {
        int option_index = 0;
        c = getopt_long(argc, argv, "e:t", long_options, &option_index);

        if (c < 0)
            break;

        switch (c) {
        case 'e':
            opt_exe = optarg;
            break;

        case 't':
            opt_tick = optarg ? atoi(optarg) : 1000000;
            break;

        default:
            usage(argv[0]);
            return 1;
        }
    }

    if (! opt_exe) {
        usage(argv[0]);
        return 1;
    }

    table.init(opt_exe);

    // Process addresses.
    if (optind >= argc) {
        map_addrs(STDIN_FILENO);
    }
    else {
        do {
            int fd = open(argv[optind], O_RDONLY);
            if (fd < 0) {
                perror(argv[optind]);
                return 1;
            }

            map_addrs(fd);
            close(fd);
        } while (++optind < argc);
    }
    
    // Emit the histogram.
    histogram_t::const_iterator limit = histogram.end();
    histogram_t::const_iterator i;
    for (i = histogram.begin(); i != limit; ++i) {
        const Elf32_Sym *sym = reinterpret_cast<const Elf32_Sym *>(i->first);
        cout.form("%08x %6d %2d %10d ",
                  sym->st_value,
                  sym->st_size,
                  sym->st_shndx,
                  i->second);

        cout << table.get_symbol_name(sym) << endl;
    }

    return 0;
}