1 //===- CodeMetrics.h - Code cost measurements -------------------*- C++ -*-===//
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 various weight measurements for code, helping
11 // the Inliner and other passes decide whether to duplicate its contents.
13 //===----------------------------------------------------------------------===//
15 #ifndef LLVM_ANALYSIS_CODEMETRICS_H
16 #define LLVM_ANALYSIS_CODEMETRICS_H
18 #include "llvm/ADT/DenseMap.h"
19 #include "llvm/ADT/SmallPtrSet.h"
20 #include "llvm/IR/CallSite.h"
23 class AssumptionCache;
29 class TargetTransformInfo;
32 /// \brief Check whether a call will lower to something small.
34 /// This tests checks whether this callsite will lower to something
35 /// significantly cheaper than a traditional call, often a single
36 /// instruction. Note that if isInstructionFree(CS.getInstruction()) would
37 /// return true, so will this function.
38 bool callIsSmall(ImmutableCallSite CS);
40 /// \brief Utility to calculate the size and a few similar metrics for a set
43 /// \brief True if this function contains a call to setjmp or other functions
44 /// with attribute "returns twice" without having the attribute itself.
45 bool exposesReturnsTwice;
47 /// \brief True if this function calls itself.
50 /// \brief True if this function cannot be duplicated.
52 /// True if this function contains one or more indirect branches, or it contains
53 /// one or more 'noduplicate' instructions.
56 /// \brief True if this function calls alloca (in the C sense).
57 bool usesDynamicAlloca;
59 /// \brief Number of instructions in the analyzed blocks.
62 /// \brief Number of analyzed blocks.
65 /// \brief Keeps track of basic block code size estimates.
66 DenseMap<const BasicBlock *, unsigned> NumBBInsts;
68 /// \brief Keep track of the number of calls to 'big' functions.
71 /// \brief The number of calls to internal functions with a single caller.
73 /// These are likely targets for future inlining, likely exposed by
74 /// interleaved devirtualization.
75 unsigned NumInlineCandidates;
77 /// \brief How many instructions produce vector values.
79 /// The inliner is more aggressive with inlining vector kernels.
80 unsigned NumVectorInsts;
82 /// \brief How many 'ret' instructions the blocks contain.
86 : exposesReturnsTwice(false), isRecursive(false), notDuplicatable(false),
87 usesDynamicAlloca(false), NumInsts(0), NumBlocks(0), NumCalls(0),
88 NumInlineCandidates(0), NumVectorInsts(0), NumRets(0) {}
90 /// \brief Add information about a block to the current state.
91 void analyzeBasicBlock(const BasicBlock *BB, const TargetTransformInfo &TTI,
92 SmallPtrSetImpl<const Value*> &EphValues);
94 /// \brief Collect a loop's ephemeral values (those used only by an assume
95 /// or similar intrinsics in the loop).
96 static void collectEphemeralValues(const Loop *L, AssumptionCache *AC,
97 SmallPtrSetImpl<const Value *> &EphValues);
99 /// \brief Collect a functions's ephemeral values (those used only by an
100 /// assume or similar intrinsics in the function).
101 static void collectEphemeralValues(const Function *L, AssumptionCache *AC,
102 SmallPtrSetImpl<const Value *> &EphValues);