Go to the documentation of this file.
14 #ifndef LLVM_TRANSFORMS_UTILS_CODEEXTRACTOR_H
15 #define LLVM_TRANSFORMS_UTILS_CODEEXTRACTOR_H
24 template <
typename PtrType>
class SmallPtrSetImpl;
28 class BlockFrequencyInfo;
29 class BranchProbabilityInfo;
30 class AssumptionCache;
90 const bool AggregateArgs;
135 bool AllowAlloca =
false,
137 std::string Suffix =
"");
147 std::string Suffix =
"");
231 struct LifetimeMarkerInfo {
232 bool SinkLifeStart =
false;
233 bool HoistLifeEnd =
false;
244 void severSplitPHINodesOfEntry(
BasicBlock *&Header);
246 void splitReturnBlocks();
254 void moveCodeToFunction(
Function *newFunction);
256 void calculateNewCallTerminatorWeights(
268 #endif // LLVM_TRANSFORMS_UTILS_CODEEXTRACTOR_H
This is an optimization pass for GlobalISel generic memory operations.
We currently emits eax Perhaps this is what we really should generate is Is imull three or four cycles eax eax The current instruction priority is based on pattern complexity The former is more complex because it folds a load so the latter will not be emitted Perhaps we should use AddedComplexity to give LEA32r a higher priority We should always try to match LEA first since the LEA matching code does some estimate to determine whether the match is profitable if we care more about code then imull is better It s two bytes shorter than movl leal On a Pentium M
Represents a single loop in the control flow graph.
This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small.
Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree.
The instances of the Type class are immutable: once they are created, they are never changed.
Expected< ExpressionValue > max(const ExpressionValue &Lhs, const ExpressionValue &Rhs)
LLVM Basic Block Representation.
amdgpu Simplify well known AMD library false FunctionCallee Value * Arg
BlockFrequencyInfo pass uses BlockFrequencyInfoImpl implementation to estimate IR basic block frequen...
Analysis providing branch probability information.
Implements a dense probed hash-table based set.
@ BasicBlock
Various leaf nodes.
A Module instance is used to store all the information related to an LLVM module.
ArrayRef - Represent a constant reference to an array (0 or more elements consecutively in memory),...
A cache of @llvm.assume calls within a function.
Machine Check Debug Module
A templated base class for SmallPtrSet which provides the typesafe interface that is common across al...
This class represents a function call, abstracting a target machine's calling convention.
Common register allocation spilling lr str ldr sxth r3 ldr mla r4 can lr mov lr str ldr sxth r3 mla r4 and then merge mul and lr str ldr sxth r3 mla r4 It also increase the likelihood the store may become dead bb27 Successors according to LLVM BB
an instruction to allocate memory on the stack
LLVM Value Representation.