6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-02-10 04:33:40 +00:00
Code Issues Projects Releases Wiki Activity

Revert removal of std:: prefixes and addtion of "using namespace std;".

Browse Source 
This violates the LLVM coding standards.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@25050 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Reid Spencer 2005-12-30 09:07:29 +00:00
parent 64c9e7a339
commit 1adc3de914
1 changed files with 55 additions and 55 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

110
tools/llvm-prof/llvm-prof.cpp
View File

@ -26,14 +26,13 @@
#include <set> #include <set>
using namespace llvm; using namespace llvm;
using namespace std;
namespace { namespace {
cl::opt<string> cl::opt<std::string>
BytecodeFile(cl::Positional, cl::desc("<program bytecode file>"), BytecodeFile(cl::Positional, cl::desc("<program bytecode file>"),
cl::Required); cl::Required);
cl::opt<string> cl::opt<std::string>
ProfileDataFile(cl::Positional, cl::desc("<llvmprof.out file>"), ProfileDataFile(cl::Positional, cl::desc("<llvmprof.out file>"),
cl::Optional, cl::init("llvmprof.out")); cl::Optional, cl::init("llvmprof.out"));
@ -50,31 +49,31 @@ namespace {
// PairSecondSort - A sorting predicate to sort by the second element of a pair. // PairSecondSort - A sorting predicate to sort by the second element of a pair.
template<class T> template<class T>
struct PairSecondSortReverse struct PairSecondSortReverse
: public binary_function<pair<T, unsigned>, : public std::binary_function<std::pair<T, unsigned>,
pair<T, unsigned>, bool> { std::pair<T, unsigned>, bool> {
bool operator()(const pair<T, unsigned> &LHS, bool operator()(const std::pair<T, unsigned> &LHS,
const pair<T, unsigned> &RHS) const { const std::pair<T, unsigned> &RHS) const {
return LHS.second > RHS.second; return LHS.second > RHS.second;
} }
}; };
namespace { namespace {
class ProfileAnnotator : public AssemblyAnnotationWriter { class ProfileAnnotator : public AssemblyAnnotationWriter {
map<const Function *, unsigned> &FuncFreqs; std::map<const Function *, unsigned> &FuncFreqs;
map<const BasicBlock*, unsigned> &BlockFreqs; std::map<const BasicBlock*, unsigned> &BlockFreqs;
map<ProfileInfoLoader::Edge, unsigned> &EdgeFreqs; std::map<ProfileInfoLoader::Edge, unsigned> &EdgeFreqs;
public: public:
ProfileAnnotator(map<const Function *, unsigned> &FF, ProfileAnnotator(std::map<const Function *, unsigned> &FF,
map<const BasicBlock*, unsigned> &BF, std::map<const BasicBlock*, unsigned> &BF,
map<ProfileInfoLoader::Edge, unsigned> &EF) std::map<ProfileInfoLoader::Edge, unsigned> &EF)
: FuncFreqs(FF), BlockFreqs(BF), EdgeFreqs(EF) {} : FuncFreqs(FF), BlockFreqs(BF), EdgeFreqs(EF) {}
virtual void emitFunctionAnnot(const Function *F, ostream &OS) { virtual void emitFunctionAnnot(const Function *F, std::ostream &OS) {
OS << ";;; %" << F->getName() << " called " << FuncFreqs[F] OS << ";;; %" << F->getName() << " called " << FuncFreqs[F]
<< " times.\n;;;\n"; << " times.\n;;;\n";
} }
virtual void emitBasicBlockStartAnnot(const BasicBlock *BB, virtual void emitBasicBlockStartAnnot(const BasicBlock *BB,
ostream &OS) { std::ostream &OS) {
if (BlockFreqs.empty()) return; if (BlockFreqs.empty()) return;
if (unsigned Count = BlockFreqs[BB]) if (unsigned Count = BlockFreqs[BB])
OS << "\t;;; Basic block executed " << Count << " times.\n"; OS << "\t;;; Basic block executed " << Count << " times.\n";
@ -82,18 +81,18 @@ namespace {
OS << "\t;;; Never executed!\n"; OS << "\t;;; Never executed!\n";
} }
virtual void emitBasicBlockEndAnnot(const BasicBlock *BB, ostream &OS){ virtual void emitBasicBlockEndAnnot(const BasicBlock *BB, std::ostream &OS){
if (EdgeFreqs.empty()) return; if (EdgeFreqs.empty()) return;
// Figure out how many times each successor executed. // Figure out how many times each successor executed.
vector<pair<const BasicBlock*, unsigned> > SuccCounts; std::vector<std::pair<const BasicBlock*, unsigned> > SuccCounts;
const TerminatorInst *TI = BB->getTerminator(); const TerminatorInst *TI = BB->getTerminator();
map<ProfileInfoLoader::Edge, unsigned>::iterator I = std::map<ProfileInfoLoader::Edge, unsigned>::iterator I =
EdgeFreqs.lower_bound(make_pair(const_cast<BasicBlock*>(BB), 0U)); EdgeFreqs.lower_bound(std::make_pair(const_cast<BasicBlock*>(BB), 0U));
for (; I != EdgeFreqs.end() && I->first.first == BB; ++I) for (; I != EdgeFreqs.end() && I->first.first == BB; ++I)
if (I->second) if (I->second)
SuccCounts.push_back(make_pair(TI->getSuccessor(I->first.second), SuccCounts.push_back(std::make_pair(TI->getSuccessor(I->first.second),
I->second)); I->second));
if (!SuccCounts.empty()) { if (!SuccCounts.empty()) {
OS << "\t;;; Out-edge counts:"; OS << "\t;;; Out-edge counts:";
@ -113,25 +112,26 @@ int main(int argc, char **argv) {
sys::PrintStackTraceOnErrorSignal(); sys::PrintStackTraceOnErrorSignal();
// Read in the bytecode file... // Read in the bytecode file...
string ErrorMessage; std::string ErrorMessage;
Module *M = ParseBytecodeFile(BytecodeFile, &ErrorMessage); Module *M = ParseBytecodeFile(BytecodeFile, &ErrorMessage);
if (M == 0) { if (M == 0) {
cerr << argv[0] << ": " << BytecodeFile << ": " << ErrorMessage << "\n"; std::cerr << argv[0] << ": " << BytecodeFile << ": "
<< ErrorMessage << "\n";
return 1; return 1;
} }
// Read the profiling information // Read the profiling information
ProfileInfoLoader PI(argv[0], ProfileDataFile, *M); ProfileInfoLoader PI(argv[0], ProfileDataFile, *M);
map<const Function *, unsigned> FuncFreqs; std::map<const Function *, unsigned> FuncFreqs;
map<const BasicBlock*, unsigned> BlockFreqs; std::map<const BasicBlock*, unsigned> BlockFreqs;
map<ProfileInfoLoader::Edge, unsigned> EdgeFreqs; std::map<ProfileInfoLoader::Edge, unsigned> EdgeFreqs;
// Output a report. Eventually, there will be multiple reports selectable on // Output a report. Eventually, there will be multiple reports selectable on
// the command line, for now, just keep things simple. // the command line, for now, just keep things simple.
// Emit the most frequent function table... // Emit the most frequent function table...
vector<pair<Function*, unsigned> > FunctionCounts; std::vector<std::pair<Function*, unsigned> > FunctionCounts;
PI.getFunctionCounts(FunctionCounts); PI.getFunctionCounts(FunctionCounts);
FuncFreqs.insert(FunctionCounts.begin(), FunctionCounts.end()); FuncFreqs.insert(FunctionCounts.begin(), FunctionCounts.end());
@ -143,41 +143,41 @@ int main(int argc, char **argv) {
for (unsigned i = 0, e = FunctionCounts.size(); i != e; ++i) for (unsigned i = 0, e = FunctionCounts.size(); i != e; ++i)
TotalExecutions += FunctionCounts[i].second; TotalExecutions += FunctionCounts[i].second;
cout << "===" << string(73, '-') << "===\n" std::cout << "===" << std::string(73, '-') << "===\n"
<< "LLVM profiling output for execution"; << "LLVM profiling output for execution";
if (PI.getNumExecutions() != 1) cout << "s"; if (PI.getNumExecutions() != 1) std::cout << "s";
cout << ":\n"; std::cout << ":\n";
for (unsigned i = 0, e = PI.getNumExecutions(); i != e; ++i) { for (unsigned i = 0, e = PI.getNumExecutions(); i != e; ++i) {
cout << " "; std::cout << " ";
if (e != 1) cout << i+1 << ". "; if (e != 1) std::cout << i+1 << ". ";
cout << PI.getExecution(i) << "\n"; std::cout << PI.getExecution(i) << "\n";
} }
cout << "\n===" << string(73, '-') << "===\n"; std::cout << "\n===" << std::string(73, '-') << "===\n";
cout << "Function execution frequencies:\n\n"; std::cout << "Function execution frequencies:\n\n";
// Print out the function frequencies... // Print out the function frequencies...
cout << " ## Frequency\n"; std::cout << " ## Frequency\n";
for (unsigned i = 0, e = FunctionCounts.size(); i != e; ++i) { for (unsigned i = 0, e = FunctionCounts.size(); i != e; ++i) {
if (FunctionCounts[i].second == 0) { if (FunctionCounts[i].second == 0) {
cout << "\n NOTE: " << e-i << " function" << std::cout << "\n NOTE: " << e-i << " function" <<
(e-i-1 ? "s were" : " was") << " never executed!\n"; (e-i-1 ? "s were" : " was") << " never executed!\n";
break; break;
} }
cout << setw(3) << i+1 << ". " std::cout << std::setw(3) << i+1 << ". "
<< setw(5) << FunctionCounts[i].second << "/" << std::setw(5) << FunctionCounts[i].second << "/"
<< TotalExecutions << " " << TotalExecutions << " "
<< FunctionCounts[i].first->getName().c_str() << "\n"; << FunctionCounts[i].first->getName().c_str() << "\n";
} }
set<Function*> FunctionsToPrint; std::set<Function*> FunctionsToPrint;
// If we have block count information, print out the LLVM module with // If we have block count information, print out the LLVM module with
// frequency annotations. // frequency annotations.
if (PI.hasAccurateBlockCounts()) { if (PI.hasAccurateBlockCounts()) {
vector<pair<BasicBlock*, unsigned> > Counts; std::vector<std::pair<BasicBlock*, unsigned> > Counts;
PI.getBlockCounts(Counts); PI.getBlockCounts(Counts);
TotalExecutions = 0; TotalExecutions = 0;
@ -188,20 +188,20 @@ int main(int argc, char **argv) {
sort(Counts.begin(), Counts.end(), sort(Counts.begin(), Counts.end(),
PairSecondSortReverse<BasicBlock*>()); PairSecondSortReverse<BasicBlock*>());
cout << "\n===" << string(73, '-') << "===\n"; std::cout << "\n===" << std::string(73, '-') << "===\n";
cout << "Top 20 most frequently executed basic blocks:\n\n"; std::cout << "Top 20 most frequently executed basic blocks:\n\n";
// Print out the function frequencies... // Print out the function frequencies...
cout <<" ## %% \tFrequency\n"; std::cout <<" ## %% \tFrequency\n";
unsigned BlocksToPrint = Counts.size(); unsigned BlocksToPrint = Counts.size();
if (BlocksToPrint > 20) BlocksToPrint = 20; if (BlocksToPrint > 20) BlocksToPrint = 20;
for (unsigned i = 0; i != BlocksToPrint; ++i) { for (unsigned i = 0; i != BlocksToPrint; ++i) {
if (Counts[i].second == 0) break; if (Counts[i].second == 0) break;
Function *F = Counts[i].first->getParent(); Function *F = Counts[i].first->getParent();
cout << setw(3) << i+1 << ". " std::cout << std::setw(3) << i+1 << ". "
<< setw(5) << setprecision(2) << std::setw(5) << std::setprecision(2)
<< Counts[i].second/(double)TotalExecutions*100 << "% " << Counts[i].second/(double)TotalExecutions*100 << "% "
<< setw(5) << Counts[i].second << "/" << std::setw(5) << Counts[i].second << "/"
<< TotalExecutions << "\t" << TotalExecutions << "\t"
<< F->getName().c_str() << "() - " << F->getName().c_str() << "() - "
<< Counts[i].first->getName().c_str() << "\n"; << Counts[i].first->getName().c_str() << "\n";
@ -212,31 +212,31 @@ int main(int argc, char **argv) {
} }
if (PI.hasAccurateEdgeCounts()) { if (PI.hasAccurateEdgeCounts()) {
vector<pair<ProfileInfoLoader::Edge, unsigned> > Counts; std::vector<std::pair<ProfileInfoLoader::Edge, unsigned> > Counts;
PI.getEdgeCounts(Counts); PI.getEdgeCounts(Counts);
EdgeFreqs.insert(Counts.begin(), Counts.end()); EdgeFreqs.insert(Counts.begin(), Counts.end());
} }
if (PrintAnnotatedLLVM || PrintAllCode) { if (PrintAnnotatedLLVM || PrintAllCode) {
cout << "\n===" << string(73, '-') << "===\n"; std::cout << "\n===" << std::string(73, '-') << "===\n";
cout << "Annotated LLVM code for the module:\n\n"; std::cout << "Annotated LLVM code for the module:\n\n";
ProfileAnnotator PA(FuncFreqs, BlockFreqs, EdgeFreqs); ProfileAnnotator PA(FuncFreqs, BlockFreqs, EdgeFreqs);
if (FunctionsToPrint.empty() || PrintAllCode) if (FunctionsToPrint.empty() || PrintAllCode)
M->print(cout, &PA); M->print(std::cout, &PA);
else else
// Print just a subset of the functions... // Print just a subset of the functions...
for (set<Function*>::iterator I = FunctionsToPrint.begin(), for (std::set<Function*>::iterator I = FunctionsToPrint.begin(),
E = FunctionsToPrint.end(); I != E; ++I) E = FunctionsToPrint.end(); I != E; ++I)
(*I)->print(cout, &PA); (*I)->print(std::cout, &PA);
} }
return 0; return 0;
} catch (const string& msg) { } catch (const std::string& msg) {
cerr << argv[0] << ": " << msg << "\n"; std::cerr << argv[0] << ": " << msg << "\n";
} catch (...) { } catch (...) {
cerr << argv[0] << ": Unexpected unknown exception occurred.\n"; std::cerr << argv[0] << ": Unexpected unknown exception occurred.\n";
} }
return 1; return 1;
} }