1 //===- ProfileInfo.cpp - Profile Info Interface ---------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the abstract ProfileInfo interface, and the default
11 // "no profile" implementation.
13 //===----------------------------------------------------------------------===//
15 #include "llvm/Analysis/Passes.h"
16 #include "llvm/Analysis/ProfileInfo.h"
17 #include "llvm/Pass.h"
18 #include "llvm/Support/CFG.h"
19 #include "llvm/Support/Compiler.h"
23 // Register the ProfileInfo interface, providing a nice name to refer to.
24 static RegisterAnalysisGroup<ProfileInfo> Z("Profile Information");
25 char ProfileInfo::ID = 0;
27 ProfileInfo::~ProfileInfo() {}
29 unsigned ProfileInfo::getExecutionCount(const BasicBlock *BB) const {
30 if (BlockCounts.find(BB) != BlockCounts.end())
31 return BlockCounts.find(BB)->second;
33 pred_const_iterator PI = pred_begin(BB), PE = pred_end(BB);
35 // Are there zero predecessors of this block?
37 // If this is the entry block, look for the Null -> Entry edge.
38 if (BB == &BB->getParent()->getEntryBlock())
39 return getEdgeWeight(0, BB);
41 return 0; // Otherwise, this is a dead block.
44 // Otherwise, if there are predecessors, the execution count of this block is
45 // the sum of the edge frequencies from the incoming edges. Note that if
46 // there are multiple edges from a predecessor to this block that we don't
47 // want to count its weight multiple times. For this reason, we keep track of
48 // the predecessors we've seen and only count them if we haven't run into them
51 // We don't want to create an std::set unless we are dealing with a block that
52 // has a LARGE number of in-edges. Handle the common case of having only a
53 // few in-edges with special code.
55 const BasicBlock *FirstPred = *PI;
56 unsigned Count = getEdgeWeight(FirstPred, BB);
58 if (PI == PE) return Count; // Quick exit for single predecessor blocks
60 const BasicBlock *SecondPred = *PI;
61 if (SecondPred != FirstPred) Count += getEdgeWeight(SecondPred, BB);
63 if (PI == PE) return Count; // Quick exit for two predecessor blocks
65 const BasicBlock *ThirdPred = *PI;
66 if (ThirdPred != FirstPred && ThirdPred != SecondPred)
67 Count += getEdgeWeight(ThirdPred, BB);
69 if (PI == PE) return Count; // Quick exit for three predecessor blocks
71 std::set<const BasicBlock*> ProcessedPreds;
72 ProcessedPreds.insert(FirstPred);
73 ProcessedPreds.insert(SecondPred);
74 ProcessedPreds.insert(ThirdPred);
75 for (; PI != PE; ++PI)
76 if (ProcessedPreds.insert(*PI).second)
77 Count += getEdgeWeight(*PI, BB);
81 unsigned ProfileInfo::getExecutionCount(const Function *F) const {
82 if (FunctionCounts.find(F) != FunctionCounts.end())
83 return FunctionCounts.find(F)->second;
85 return getExecutionCount(&F->getEntryBlock());
89 //===----------------------------------------------------------------------===//
90 // NoProfile ProfileInfo implementation
94 struct VISIBILITY_HIDDEN NoProfileInfo
95 : public ImmutablePass, public ProfileInfo {
96 static char ID; // Class identification, replacement for typeinfo
97 NoProfileInfo() : ImmutablePass(&ID) {}
99 } // End of anonymous namespace
101 char NoProfileInfo::ID = 0;
102 // Register this pass...
103 static RegisterPass<NoProfileInfo>
104 X("no-profile", "No Profile Information", false, true);
106 // Declare that we implement the ProfileInfo interface
107 static RegisterAnalysisGroup<ProfileInfo, true> Y(X);
109 ImmutablePass *llvm::createNoProfileInfoPass() { return new NoProfileInfo(); }