diff options
author | Andreas Neustifter <astifter@gmx.at> | 2009-09-01 10:06:05 +0000 |
---|---|---|
committer | Andreas Neustifter <astifter@gmx.at> | 2009-09-01 10:06:05 +0000 |
commit | 09ae6e0d77d7eb3339a20c613a6f0a9c391dc9f3 (patch) | |
tree | c78caf02d8f9bab167ab83f8649a8de7a2fe799c | |
parent | 76448f751688349d8dc7330dbe56ba0165878790 (diff) | |
download | external_llvm-09ae6e0d77d7eb3339a20c613a6f0a9c391dc9f3.zip external_llvm-09ae6e0d77d7eb3339a20c613a6f0a9c391dc9f3.tar.gz external_llvm-09ae6e0d77d7eb3339a20c613a6f0a9c391dc9f3.tar.bz2 |
Preparation for Optimal Edge Profiling:
Optimal edge profiling is only possible when blocks with no predecessors get an
virtual edge (BB,0) that counts the execution frequencies of this
function-exiting blocks.
This patch makes the necessary changes before actually enabling optimal edge profiling.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@80667 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r-- | include/llvm/Analysis/ProfileInfo.h | 9 | ||||
-rw-r--r-- | lib/Analysis/ProfileEstimatorPass.cpp | 9 |
2 files changed, 15 insertions, 3 deletions
diff --git a/include/llvm/Analysis/ProfileInfo.h b/include/llvm/Analysis/ProfileInfo.h index 16bfc13..94a8666 100644 --- a/include/llvm/Analysis/ProfileInfo.h +++ b/include/llvm/Analysis/ProfileInfo.h @@ -63,8 +63,13 @@ namespace llvm { // getFunction() - Returns the Function for an Edge, checking for validity. static const Function* getFunction(Edge e) { - assert(e.second && "Invalid ProfileInfo::Edge"); - return e.second->getParent(); + if (e.first) { + return e.first->getParent(); + } else if (e.second) { + return e.second->getParent(); + } + assert(0 && "Invalid ProfileInfo::Edge"); + return (const Function*)0; } // getEdge() - Creates an Edge from two BasicBlocks. diff --git a/lib/Analysis/ProfileEstimatorPass.cpp b/lib/Analysis/ProfileEstimatorPass.cpp index 8f5313f..3af7eba 100644 --- a/lib/Analysis/ProfileEstimatorPass.cpp +++ b/lib/Analysis/ProfileEstimatorPass.cpp @@ -168,7 +168,14 @@ void ProfileEstimatorPass::recurseBasicBlock(BasicBlock *BB) { std::set<BasicBlock*> ProcessedSuccs; // Otherwise consider weight of outgoing edges and store them for - // distribution of remaining weight. + // distribution of remaining weight. In case the block has no successors + // create a (BB,0) edge. + succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB); + if (bbi == bbe) { + Edge edge = getEdge(BB,0); + EdgeInformation[BB->getParent()][edge] = BBWeight; + printEdgeWeight(edge); + } for ( succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB); bbi != bbe; ++bbi ) { if (ProcessedSuccs.insert(*bbi).second) { |