blob: cb907258e5d76785a6f03485109ada2cf48e4bc8 [file] [log] [blame]
Chris Lattner6f82d072003-10-28 19:16:35 +00001//===- llvm-prof.cpp - Read in and process llvmprof.out data files --------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This tools is meant for use with the various LLVM profiling instrumentation
11// passes. It reads in the data file produced by executing an instrumented
12// program, and outputs a nice report.
13//
14//===----------------------------------------------------------------------===//
15
Chris Lattnere4367792003-10-28 20:13:07 +000016#include "ProfileInfo.h"
Chris Lattner7a78d812003-10-28 21:08:18 +000017#include "llvm/Function.h"
Chris Lattner6f82d072003-10-28 19:16:35 +000018#include "llvm/Bytecode/Reader.h"
19#include "Support/CommandLine.h"
Chris Lattnere4367792003-10-28 20:13:07 +000020#include <iostream>
Chris Lattner7a78d812003-10-28 21:08:18 +000021#include <cstdio>
Chris Lattner6f82d072003-10-28 19:16:35 +000022
23namespace {
24 cl::opt<std::string>
25 BytecodeFile(cl::Positional, cl::desc("<program bytecode file>"),
26 cl::Required);
27
28 cl::opt<std::string>
29 ProfileDataFile(cl::Positional, cl::desc("<llvmprof.out file>"),
30 cl::Optional, cl::init("llvmprof.out"));
31}
32
Chris Lattner7a78d812003-10-28 21:08:18 +000033// PairSecondSort - A sorting predicate to sort by the second element of a pair.
34template<class T>
35struct PairSecondSort
36 : public std::binary_function<std::pair<T, unsigned>,
37 std::pair<T, unsigned>, bool> {
38 bool operator()(const std::pair<T, unsigned> &LHS,
39 const std::pair<T, unsigned> &RHS) const {
40 return LHS.second < RHS.second;
41 }
42};
43
44
Chris Lattner6f82d072003-10-28 19:16:35 +000045int main(int argc, char **argv) {
46 cl::ParseCommandLineOptions(argc, argv, " llvm profile dump decoder\n");
Chris Lattner6f82d072003-10-28 19:16:35 +000047
Chris Lattnere4367792003-10-28 20:13:07 +000048 // Read in the bytecode file...
49 std::string ErrorMessage;
Chris Lattner7a78d812003-10-28 21:08:18 +000050 Module *M = ParseBytecodeFile(BytecodeFile, &ErrorMessage);
51 if (M == 0) {
Chris Lattnere4367792003-10-28 20:13:07 +000052 std::cerr << argv[0] << ": " << BytecodeFile << ": " << ErrorMessage
53 << "\n";
54 return 1;
55 }
Chris Lattner6f82d072003-10-28 19:16:35 +000056
Chris Lattnere4367792003-10-28 20:13:07 +000057 // Read the profiling information
Chris Lattner7a78d812003-10-28 21:08:18 +000058 ProfileInfo PI(argv[0], ProfileDataFile, *M);
Chris Lattner6f82d072003-10-28 19:16:35 +000059
Chris Lattner7a78d812003-10-28 21:08:18 +000060 // Output a report. Eventually, there will be multiple reports selectable on
61 // the command line, for now, just keep things simple.
62
63 // Emit the most frequent function table...
64 std::vector<std::pair<Function*, unsigned> > FunctionCounts;
65 PI.getFunctionCounts(FunctionCounts);
66
67 // Sort by the frequency, backwards.
68 std::sort(FunctionCounts.begin(), FunctionCounts.end(),
69 std::not2(PairSecondSort<Function*>()));
70
71 unsigned TotalExecutions = 0;
72 for (unsigned i = 0, e = FunctionCounts.size(); i != e; ++i)
73 TotalExecutions += FunctionCounts[i].second;
74
75 // Print out the function frequencies...
76 printf(" ## Frequency\n");
77 for (unsigned i = 0, e = FunctionCounts.size(); i != e; ++i)
78 printf("%3d. %5d/%d %s\n", i, FunctionCounts[i].second, TotalExecutions,
79 FunctionCounts[i].first->getName().c_str());
Chris Lattner6f82d072003-10-28 19:16:35 +000080 return 0;
81}