mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-12-02 16:36:40 +00:00
What the loop unroller cares about, rather than just not unrolling loops with calls, is
not unrolling loops that contain calls that would be better off getting inlined. This mostly comes up when an interleaved devirtualization pass has devirtualized a call which the inliner will inline on a future pass. Thus, rather than blocking all loops containing calls, add a metric for "inline candidate calls" and block loops containing those instead. llvm-svn: 113535
This commit is contained in:
parent
38194e51cc
commit
f7276d42d3
@ -45,6 +45,11 @@ namespace llvm {
|
||||
|
||||
/// NumCalls - Keep track of the number of calls to 'big' functions.
|
||||
unsigned NumCalls;
|
||||
|
||||
/// NumInlineCandidates - Keep track of the number of calls to internal
|
||||
/// functions with only a single caller. These are likely targets for
|
||||
/// future inlining, likely exposed by interleaved devirtualization.
|
||||
unsigned NumInlineCandidates;
|
||||
|
||||
/// NumVectorInsts - Keep track of how many instructions produce vector
|
||||
/// values. The inliner is being more aggressive with inlining vector
|
||||
@ -56,7 +61,8 @@ namespace llvm {
|
||||
|
||||
CodeMetrics() : callsSetJmp(false), isRecursive(false),
|
||||
containsIndirectBr(false), usesDynamicAlloca(false),
|
||||
NumInsts(0), NumBlocks(0), NumCalls(0), NumVectorInsts(0),
|
||||
NumInsts(0), NumBlocks(0), NumCalls(0),
|
||||
NumInlineCandidates(0), NumVectorInsts(0),
|
||||
NumRets(0) {}
|
||||
|
||||
/// analyzeBasicBlock - Add information about the specified basic block
|
||||
|
@ -70,6 +70,12 @@ void CodeMetrics::analyzeBasicBlock(const BasicBlock *BB) {
|
||||
// variables as volatile if they are live across a setjmp call, and they
|
||||
// probably won't do this in callers.
|
||||
if (const Function *F = CS.getCalledFunction()) {
|
||||
// If a function is both internal and has a single use, then it is
|
||||
// extremely likely to get inlined in the future (it was probably
|
||||
// exposed by an interleaved devirtualization pass).
|
||||
if (F->hasInternalLinkage() && F->hasOneUse())
|
||||
++NumInlineCandidates;
|
||||
|
||||
if (F->isDeclaration() &&
|
||||
(F->getName() == "setjmp" || F->getName() == "_setjmp"))
|
||||
callsSetJmp = true;
|
||||
|
@ -89,7 +89,7 @@ static unsigned ApproximateLoopSize(const Loop *L, unsigned &NumCalls) {
|
||||
for (Loop::block_iterator I = L->block_begin(), E = L->block_end();
|
||||
I != E; ++I)
|
||||
Metrics.analyzeBasicBlock(*I);
|
||||
NumCalls = Metrics.NumCalls;
|
||||
NumCalls = Metrics.NumInlineCandidates;
|
||||
|
||||
unsigned LoopSize = Metrics.NumInsts;
|
||||
|
||||
@ -151,11 +151,11 @@ bool LoopUnroll::runOnLoop(Loop *L, LPPassManager &LPM) {
|
||||
|
||||
// Enforce the threshold.
|
||||
if (CurrentThreshold != NoThreshold) {
|
||||
unsigned NumCalls;
|
||||
unsigned LoopSize = ApproximateLoopSize(L, NumCalls);
|
||||
unsigned NumInlineCandidates;
|
||||
unsigned LoopSize = ApproximateLoopSize(L, NumInlineCandidates);
|
||||
DEBUG(dbgs() << " Loop Size = " << LoopSize << "\n");
|
||||
if (NumCalls != 0) {
|
||||
DEBUG(dbgs() << " Not unrolling loop with function calls.\n");
|
||||
if (NumInlineCandidates != 0) {
|
||||
DEBUG(dbgs() << " Not unrolling loop with inlinable calls.\n");
|
||||
return false;
|
||||
}
|
||||
uint64_t Size = (uint64_t)LoopSize*Count;
|
||||
|
Loading…
Reference in New Issue
Block a user