Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 1 | //===- EdgeProfiling.cpp - Insert counters for edge profiling -------------===// |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 2 | // |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | 4ee451d | 2007-12-29 20:36:04 +0000 | [diff] [blame] | 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 7 | // |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This pass instruments the specified program with counters for edge profiling. |
| 11 | // Edge profiling can give a reasonable approximation of the hot paths through a |
| 12 | // program, and is used for a wide variety of program transformations. |
| 13 | // |
| 14 | // Note that this implementation is very naive. We insert a counter for *every* |
| 15 | // edge in the program, instead of using control flow information to prune the |
| 16 | // number of counters inserted. |
| 17 | // |
| 18 | //===----------------------------------------------------------------------===// |
| 19 | |
Bill Wendling | e815619 | 2006-12-07 01:30:32 +0000 | [diff] [blame] | 20 | #include "ProfilingUtils.h" |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 21 | #include "llvm/Constants.h" |
| 22 | #include "llvm/DerivedTypes.h" |
Owen Anderson | 5089551 | 2009-07-06 18:42:36 +0000 | [diff] [blame] | 23 | #include "llvm/LLVMContext.h" |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 24 | #include "llvm/Module.h" |
| 25 | #include "llvm/Pass.h" |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 26 | #include "llvm/Support/Compiler.h" |
Bill Wendling | 62c804a | 2006-11-26 09:17:06 +0000 | [diff] [blame] | 27 | #include "llvm/Support/Streams.h" |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 28 | #include "llvm/Transforms/Utils/BasicBlockUtils.h" |
Jeff Cohen | d9ed8c8 | 2005-01-07 06:57:28 +0000 | [diff] [blame] | 29 | #include "llvm/Transforms/Instrumentation.h" |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 30 | #include <set> |
| 31 | using namespace llvm; |
| 32 | |
| 33 | namespace { |
Reid Spencer | 9133fe2 | 2007-02-05 23:32:05 +0000 | [diff] [blame] | 34 | class VISIBILITY_HIDDEN EdgeProfiler : public ModulePass { |
Chris Lattner | b12914b | 2004-09-20 04:48:05 +0000 | [diff] [blame] | 35 | bool runOnModule(Module &M); |
Devang Patel | 794fd75 | 2007-05-01 21:15:47 +0000 | [diff] [blame] | 36 | public: |
Nick Lewycky | ecd94c8 | 2007-05-06 13:37:16 +0000 | [diff] [blame] | 37 | static char ID; // Pass identification, replacement for typeid |
Dan Gohman | ae73dc1 | 2008-09-04 17:05:41 +0000 | [diff] [blame] | 38 | EdgeProfiler() : ModulePass(&ID) {} |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 39 | }; |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 40 | } |
| 41 | |
Dan Gohman | 844731a | 2008-05-13 00:00:25 +0000 | [diff] [blame] | 42 | char EdgeProfiler::ID = 0; |
| 43 | static RegisterPass<EdgeProfiler> |
| 44 | X("insert-edge-profiling", "Insert instrumentation for edge profiling"); |
| 45 | |
Jeff Cohen | d9ed8c8 | 2005-01-07 06:57:28 +0000 | [diff] [blame] | 46 | ModulePass *llvm::createEdgeProfilerPass() { return new EdgeProfiler(); } |
| 47 | |
Chris Lattner | b12914b | 2004-09-20 04:48:05 +0000 | [diff] [blame] | 48 | bool EdgeProfiler::runOnModule(Module &M) { |
Reid Spencer | 688b049 | 2007-02-05 21:19:13 +0000 | [diff] [blame] | 49 | Function *Main = M.getFunction("main"); |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 50 | if (Main == 0) { |
Bill Wendling | e815619 | 2006-12-07 01:30:32 +0000 | [diff] [blame] | 51 | cerr << "WARNING: cannot insert edge profiling into a module" |
| 52 | << " with no main function!\n"; |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 53 | return false; // No main, no instrumentation! |
| 54 | } |
| 55 | |
| 56 | std::set<BasicBlock*> BlocksToInstrument; |
| 57 | unsigned NumEdges = 0; |
Daniel Dunbar | caaa493 | 2009-08-08 17:43:09 +0000 | [diff] [blame^] | 58 | for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) { |
| 59 | if (F->isDeclaration()) continue; |
| 60 | // Reserve space for (0,entry) edge. |
| 61 | ++NumEdges; |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 62 | for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) { |
| 63 | // Keep track of which blocks need to be instrumented. We don't want to |
| 64 | // instrument blocks that are added as the result of breaking critical |
| 65 | // edges! |
| 66 | BlocksToInstrument.insert(BB); |
| 67 | NumEdges += BB->getTerminator()->getNumSuccessors(); |
| 68 | } |
Daniel Dunbar | caaa493 | 2009-08-08 17:43:09 +0000 | [diff] [blame^] | 69 | } |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 70 | |
Owen Anderson | debcb01 | 2009-07-29 22:17:13 +0000 | [diff] [blame] | 71 | const Type *ATy = ArrayType::get(Type::Int32Ty, NumEdges); |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 72 | GlobalVariable *Counters = |
Owen Anderson | e9b11b4 | 2009-07-08 19:03:57 +0000 | [diff] [blame] | 73 | new GlobalVariable(M, ATy, false, GlobalValue::InternalLinkage, |
Owen Anderson | a7235ea | 2009-07-31 20:28:14 +0000 | [diff] [blame] | 74 | Constant::getNullValue(ATy), "EdgeProfCounters"); |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 75 | |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 76 | // Instrument all of the edges... |
| 77 | unsigned i = 0; |
Daniel Dunbar | caaa493 | 2009-08-08 17:43:09 +0000 | [diff] [blame^] | 78 | for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) { |
| 79 | if (F->isDeclaration()) continue; |
| 80 | // Create counter for (0,entry) edge. |
| 81 | IncrementCounterInBlock(&F->getEntryBlock(), i++, Counters); |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 82 | for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) |
| 83 | if (BlocksToInstrument.count(BB)) { // Don't instrument inserted blocks |
| 84 | // Okay, we have to add a counter of each outgoing edge. If the |
| 85 | // outgoing edge is not critical don't split it, just insert the counter |
| 86 | // in the source or destination of the edge. |
| 87 | TerminatorInst *TI = BB->getTerminator(); |
| 88 | for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { |
| 89 | // If the edge is critical, split it. |
| 90 | SplitCriticalEdge(TI, s, this); |
| 91 | |
| 92 | // Okay, we are guaranteed that the edge is no longer critical. If we |
| 93 | // only have a single successor, insert the counter in this block, |
| 94 | // otherwise insert it in the successor block. |
Chris Lattner | 915c656 | 2007-12-13 00:04:46 +0000 | [diff] [blame] | 95 | if (TI->getNumSuccessors() == 1) { |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 96 | // Insert counter at the start of the block |
Reid Spencer | 518310c | 2004-07-18 00:44:37 +0000 | [diff] [blame] | 97 | IncrementCounterInBlock(BB, i++, Counters); |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 98 | } else { |
| 99 | // Insert counter at the start of the block |
Reid Spencer | 518310c | 2004-07-18 00:44:37 +0000 | [diff] [blame] | 100 | IncrementCounterInBlock(TI->getSuccessor(s), i++, Counters); |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 101 | } |
| 102 | } |
| 103 | } |
Daniel Dunbar | caaa493 | 2009-08-08 17:43:09 +0000 | [diff] [blame^] | 104 | } |
Chris Lattner | b2f12a2 | 2004-03-08 17:54:34 +0000 | [diff] [blame] | 105 | |
| 106 | // Add the initialization call to main. |
| 107 | InsertProfilingInitCall(Main, "llvm_start_edge_profiling", Counters); |
| 108 | return true; |
| 109 | } |
| 110 | |