0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1 //===- TailRecursionElimination.cpp - Eliminate Tail Calls ----------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
2 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
3 // The LLVM Compiler Infrastructure
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
4 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
5 // This file is distributed under the University of Illinois Open Source
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
6 // License. See LICENSE.TXT for details.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
7 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
8 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
9 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
10 // This file transforms calls of the current function (self recursion) followed
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
11 // by a return instruction with a branch to the entry of the function, creating
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
12 // a loop. This pass also implements the following extensions to the basic
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
13 // algorithm:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
14 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
15 // 1. Trivial instructions between the call and return do not prevent the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
16 // transformation from taking place, though currently the analysis cannot
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
17 // support moving any really useful instructions (only dead ones).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
18 // 2. This pass transforms functions that are prevented from being tail
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
19 // recursive by an associative and commutative expression to use an
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
20 // accumulator variable, thus compiling the typical naive factorial or
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
21 // 'fib' implementation into efficient code.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
22 // 3. TRE is performed if the function returns void, if the return
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
23 // returns the result returned by the call, or if the function returns a
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
24 // run-time constant on all exits from the function. It is possible, though
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
25 // unlikely, that the return returns something else (like constant 0), and
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
26 // can still be TRE'd. It can be TRE'd if ALL OTHER return instructions in
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
27 // the function return the exact same value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
28 // 4. If it can prove that callees do not access their caller stack frame,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
29 // they are marked as eligible for tail call elimination (by the code
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
30 // generator).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
31 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
32 // There are several improvements that could be made:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
33 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
34 // 1. If the function has any alloca instructions, these instructions will be
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
35 // moved out of the entry block of the function, causing them to be
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
36 // evaluated each time through the tail recursion. Safely keeping allocas
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
37 // in the entry block requires analysis to proves that the tail-called
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
38 // function does not read or write the stack object.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
39 // 2. Tail recursion is only performed if the call immediately precedes the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
40 // return instruction. It's possible that there could be a jump between
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
41 // the call and the return.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
42 // 3. There can be intervening operations between the call and the return that
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
43 // prevent the TRE from occurring. For example, there could be GEP's and
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
44 // stores to memory that will not be read or written by the call. This
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
45 // requires some substantial analysis (such as with DSA) to prove safe to
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
46 // move ahead of the call, but doing so could allow many more TREs to be
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
47 // performed, for example in TreeAdd/TreeAlloc from the treeadd benchmark.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
48 // 4. The algorithm we use to detect if callees access their caller stack
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
49 // frames is very primitive.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
50 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
51 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
52
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
53 #include "llvm/Transforms/Scalar.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
54 #include "llvm/ADT/STLExtras.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
55 #include "llvm/ADT/SmallPtrSet.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
56 #include "llvm/ADT/Statistic.h"
|
|
95
|
57 #include "llvm/Analysis/GlobalsModRef.h"
|
|
|
58 #include "llvm/Analysis/CFG.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
59 #include "llvm/Analysis/CaptureTracking.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
60 #include "llvm/Analysis/InlineCost.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
61 #include "llvm/Analysis/InstructionSimplify.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
62 #include "llvm/Analysis/Loads.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
63 #include "llvm/Analysis/TargetTransformInfo.h"
|
|
77
|
64 #include "llvm/IR/CFG.h"
|
|
|
65 #include "llvm/IR/CallSite.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
66 #include "llvm/IR/Constants.h"
|
|
83
|
67 #include "llvm/IR/DataLayout.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
68 #include "llvm/IR/DerivedTypes.h"
|
|
77
|
69 #include "llvm/IR/DiagnosticInfo.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
70 #include "llvm/IR/Function.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
71 #include "llvm/IR/Instructions.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
72 #include "llvm/IR/IntrinsicInst.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
73 #include "llvm/IR/Module.h"
|
|
77
|
74 #include "llvm/IR/ValueHandle.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
75 #include "llvm/Pass.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
76 #include "llvm/Support/Debug.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
77 #include "llvm/Support/raw_ostream.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
78 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
79 #include "llvm/Transforms/Utils/Local.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
80 using namespace llvm;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
81
|
|
77
|
82 #define DEBUG_TYPE "tailcallelim"
|
|
|
83
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
84 STATISTIC(NumEliminated, "Number of tail calls removed");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
85 STATISTIC(NumRetDuped, "Number of return duplicated");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
86 STATISTIC(NumAccumAdded, "Number of accumulators introduced");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
87
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
88 namespace {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
89 struct TailCallElim : public FunctionPass {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
90 const TargetTransformInfo *TTI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
91
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
92 static char ID; // Pass identification, replacement for typeid
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
93 TailCallElim() : FunctionPass(ID) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
94 initializeTailCallElimPass(*PassRegistry::getPassRegistry());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
95 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
96
|
|
77
|
97 void getAnalysisUsage(AnalysisUsage &AU) const override;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
98
|
|
77
|
99 bool runOnFunction(Function &F) override;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
100
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
101 private:
|
|
77
|
102 bool runTRE(Function &F);
|
|
|
103 bool markTails(Function &F, bool &AllCallsAreTailCalls);
|
|
|
104
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
105 CallInst *FindTRECandidate(Instruction *I,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
106 bool CannotTailCallElimCallsMarkedTail);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
107 bool EliminateRecursiveTailCall(CallInst *CI, ReturnInst *Ret,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
108 BasicBlock *&OldEntry,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
109 bool &TailCallsAreMarkedTail,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
110 SmallVectorImpl<PHINode *> &ArgumentPHIs,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
111 bool CannotTailCallElimCallsMarkedTail);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
112 bool FoldReturnAndProcessPred(BasicBlock *BB,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
113 ReturnInst *Ret, BasicBlock *&OldEntry,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
114 bool &TailCallsAreMarkedTail,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
115 SmallVectorImpl<PHINode *> &ArgumentPHIs,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
116 bool CannotTailCallElimCallsMarkedTail);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
117 bool ProcessReturningBlock(ReturnInst *RI, BasicBlock *&OldEntry,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
118 bool &TailCallsAreMarkedTail,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
119 SmallVectorImpl<PHINode *> &ArgumentPHIs,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
120 bool CannotTailCallElimCallsMarkedTail);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
121 bool CanMoveAboveCall(Instruction *I, CallInst *CI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
122 Value *CanTransformAccumulatorRecursion(Instruction *I, CallInst *CI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
123 };
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
124 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
125
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
126 char TailCallElim::ID = 0;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
127 INITIALIZE_PASS_BEGIN(TailCallElim, "tailcallelim",
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
128 "Tail Call Elimination", false, false)
|
|
83
|
129 INITIALIZE_PASS_DEPENDENCY(TargetTransformInfoWrapperPass)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
130 INITIALIZE_PASS_END(TailCallElim, "tailcallelim",
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
131 "Tail Call Elimination", false, false)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
132
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
133 // Public interface to the TailCallElimination pass
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
134 FunctionPass *llvm::createTailCallEliminationPass() {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
135 return new TailCallElim();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
136 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
137
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
138 void TailCallElim::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
83
|
139 AU.addRequired<TargetTransformInfoWrapperPass>();
|
|
95
|
140 AU.addPreserved<GlobalsAAWrapperPass>();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
141 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
142
|
|
77
|
143 /// \brief Scan the specified function for alloca instructions.
|
|
|
144 /// If it contains any dynamic allocas, returns false.
|
|
|
145 static bool CanTRE(Function &F) {
|
|
|
146 // Because of PR962, we don't TRE dynamic allocas.
|
|
|
147 for (auto &BB : F) {
|
|
|
148 for (auto &I : BB) {
|
|
|
149 if (AllocaInst *AI = dyn_cast<AllocaInst>(&I)) {
|
|
|
150 if (!AI->isStaticAlloca())
|
|
|
151 return false;
|
|
|
152 }
|
|
|
153 }
|
|
|
154 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
155
|
|
77
|
156 return true;
|
|
|
157 }
|
|
|
158
|
|
|
159 bool TailCallElim::runOnFunction(Function &F) {
|
|
|
160 if (skipOptnoneFunction(F))
|
|
|
161 return false;
|
|
|
162
|
|
95
|
163 if (F.getFnAttribute("disable-tail-calls").getValueAsString() == "true")
|
|
|
164 return false;
|
|
83
|
165
|
|
77
|
166 bool AllCallsAreTailCalls = false;
|
|
|
167 bool Modified = markTails(F, AllCallsAreTailCalls);
|
|
|
168 if (AllCallsAreTailCalls)
|
|
|
169 Modified |= runTRE(F);
|
|
|
170 return Modified;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
171 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
172
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
173 namespace {
|
|
77
|
174 struct AllocaDerivedValueTracker {
|
|
|
175 // Start at a root value and walk its use-def chain to mark calls that use the
|
|
|
176 // value or a derived value in AllocaUsers, and places where it may escape in
|
|
|
177 // EscapePoints.
|
|
|
178 void walk(Value *Root) {
|
|
|
179 SmallVector<Use *, 32> Worklist;
|
|
|
180 SmallPtrSet<Use *, 32> Visited;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
181
|
|
77
|
182 auto AddUsesToWorklist = [&](Value *V) {
|
|
|
183 for (auto &U : V->uses()) {
|
|
83
|
184 if (!Visited.insert(&U).second)
|
|
77
|
185 continue;
|
|
|
186 Worklist.push_back(&U);
|
|
|
187 }
|
|
|
188 };
|
|
|
189
|
|
|
190 AddUsesToWorklist(Root);
|
|
|
191
|
|
|
192 while (!Worklist.empty()) {
|
|
|
193 Use *U = Worklist.pop_back_val();
|
|
|
194 Instruction *I = cast<Instruction>(U->getUser());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
195
|
|
77
|
196 switch (I->getOpcode()) {
|
|
|
197 case Instruction::Call:
|
|
|
198 case Instruction::Invoke: {
|
|
|
199 CallSite CS(I);
|
|
|
200 bool IsNocapture = !CS.isCallee(U) &&
|
|
|
201 CS.doesNotCapture(CS.getArgumentNo(U));
|
|
|
202 callUsesLocalStack(CS, IsNocapture);
|
|
|
203 if (IsNocapture) {
|
|
|
204 // If the alloca-derived argument is passed in as nocapture, then it
|
|
|
205 // can't propagate to the call's return. That would be capturing.
|
|
|
206 continue;
|
|
|
207 }
|
|
|
208 break;
|
|
|
209 }
|
|
|
210 case Instruction::Load: {
|
|
|
211 // The result of a load is not alloca-derived (unless an alloca has
|
|
|
212 // otherwise escaped, but this is a local analysis).
|
|
|
213 continue;
|
|
|
214 }
|
|
|
215 case Instruction::Store: {
|
|
|
216 if (U->getOperandNo() == 0)
|
|
|
217 EscapePoints.insert(I);
|
|
|
218 continue; // Stores have no users to analyze.
|
|
|
219 }
|
|
|
220 case Instruction::BitCast:
|
|
|
221 case Instruction::GetElementPtr:
|
|
|
222 case Instruction::PHI:
|
|
|
223 case Instruction::Select:
|
|
|
224 case Instruction::AddrSpaceCast:
|
|
|
225 break;
|
|
|
226 default:
|
|
|
227 EscapePoints.insert(I);
|
|
|
228 break;
|
|
|
229 }
|
|
|
230
|
|
|
231 AddUsesToWorklist(I);
|
|
|
232 }
|
|
|
233 }
|
|
|
234
|
|
|
235 void callUsesLocalStack(CallSite CS, bool IsNocapture) {
|
|
|
236 // Add it to the list of alloca users.
|
|
|
237 AllocaUsers.insert(CS.getInstruction());
|
|
|
238
|
|
|
239 // If it's nocapture then it can't capture this alloca.
|
|
|
240 if (IsNocapture)
|
|
|
241 return;
|
|
|
242
|
|
|
243 // If it can write to memory, it can leak the alloca value.
|
|
|
244 if (!CS.onlyReadsMemory())
|
|
|
245 EscapePoints.insert(CS.getInstruction());
|
|
|
246 }
|
|
|
247
|
|
|
248 SmallPtrSet<Instruction *, 32> AllocaUsers;
|
|
|
249 SmallPtrSet<Instruction *, 32> EscapePoints;
|
|
|
250 };
|
|
|
251 }
|
|
|
252
|
|
|
253 bool TailCallElim::markTails(Function &F, bool &AllCallsAreTailCalls) {
|
|
|
254 if (F.callsFunctionThatReturnsTwice())
|
|
|
255 return false;
|
|
|
256 AllCallsAreTailCalls = true;
|
|
|
257
|
|
|
258 // The local stack holds all alloca instructions and all byval arguments.
|
|
|
259 AllocaDerivedValueTracker Tracker;
|
|
|
260 for (Argument &Arg : F.args()) {
|
|
|
261 if (Arg.hasByValAttr())
|
|
|
262 Tracker.walk(&Arg);
|
|
|
263 }
|
|
|
264 for (auto &BB : F) {
|
|
|
265 for (auto &I : BB)
|
|
|
266 if (AllocaInst *AI = dyn_cast<AllocaInst>(&I))
|
|
|
267 Tracker.walk(AI);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
268 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
269
|
|
77
|
270 bool Modified = false;
|
|
|
271
|
|
|
272 // Track whether a block is reachable after an alloca has escaped. Blocks that
|
|
|
273 // contain the escaping instruction will be marked as being visited without an
|
|
|
274 // escaped alloca, since that is how the block began.
|
|
|
275 enum VisitType {
|
|
|
276 UNVISITED,
|
|
|
277 UNESCAPED,
|
|
|
278 ESCAPED
|
|
|
279 };
|
|
|
280 DenseMap<BasicBlock *, VisitType> Visited;
|
|
|
281
|
|
|
282 // We propagate the fact that an alloca has escaped from block to successor.
|
|
|
283 // Visit the blocks that are propagating the escapedness first. To do this, we
|
|
|
284 // maintain two worklists.
|
|
|
285 SmallVector<BasicBlock *, 32> WorklistUnescaped, WorklistEscaped;
|
|
|
286
|
|
|
287 // We may enter a block and visit it thinking that no alloca has escaped yet,
|
|
|
288 // then see an escape point and go back around a loop edge and come back to
|
|
|
289 // the same block twice. Because of this, we defer setting tail on calls when
|
|
|
290 // we first encounter them in a block. Every entry in this list does not
|
|
|
291 // statically use an alloca via use-def chain analysis, but may find an alloca
|
|
|
292 // through other means if the block turns out to be reachable after an escape
|
|
|
293 // point.
|
|
|
294 SmallVector<CallInst *, 32> DeferredTails;
|
|
|
295
|
|
|
296 BasicBlock *BB = &F.getEntryBlock();
|
|
|
297 VisitType Escaped = UNESCAPED;
|
|
|
298 do {
|
|
|
299 for (auto &I : *BB) {
|
|
|
300 if (Tracker.EscapePoints.count(&I))
|
|
|
301 Escaped = ESCAPED;
|
|
|
302
|
|
|
303 CallInst *CI = dyn_cast<CallInst>(&I);
|
|
|
304 if (!CI || CI->isTailCall())
|
|
|
305 continue;
|
|
|
306
|
|
|
307 if (CI->doesNotAccessMemory()) {
|
|
|
308 // A call to a readnone function whose arguments are all things computed
|
|
|
309 // outside this function can be marked tail. Even if you stored the
|
|
|
310 // alloca address into a global, a readnone function can't load the
|
|
|
311 // global anyhow.
|
|
|
312 //
|
|
|
313 // Note that this runs whether we know an alloca has escaped or not. If
|
|
|
314 // it has, then we can't trust Tracker.AllocaUsers to be accurate.
|
|
|
315 bool SafeToTail = true;
|
|
|
316 for (auto &Arg : CI->arg_operands()) {
|
|
|
317 if (isa<Constant>(Arg.getUser()))
|
|
|
318 continue;
|
|
|
319 if (Argument *A = dyn_cast<Argument>(Arg.getUser()))
|
|
|
320 if (!A->hasByValAttr())
|
|
|
321 continue;
|
|
|
322 SafeToTail = false;
|
|
|
323 break;
|
|
|
324 }
|
|
|
325 if (SafeToTail) {
|
|
|
326 emitOptimizationRemark(
|
|
|
327 F.getContext(), "tailcallelim", F, CI->getDebugLoc(),
|
|
|
328 "marked this readnone call a tail call candidate");
|
|
|
329 CI->setTailCall();
|
|
|
330 Modified = true;
|
|
|
331 continue;
|
|
|
332 }
|
|
|
333 }
|
|
|
334
|
|
|
335 if (Escaped == UNESCAPED && !Tracker.AllocaUsers.count(CI)) {
|
|
|
336 DeferredTails.push_back(CI);
|
|
|
337 } else {
|
|
|
338 AllCallsAreTailCalls = false;
|
|
|
339 }
|
|
|
340 }
|
|
|
341
|
|
|
342 for (auto *SuccBB : make_range(succ_begin(BB), succ_end(BB))) {
|
|
|
343 auto &State = Visited[SuccBB];
|
|
|
344 if (State < Escaped) {
|
|
|
345 State = Escaped;
|
|
|
346 if (State == ESCAPED)
|
|
|
347 WorklistEscaped.push_back(SuccBB);
|
|
|
348 else
|
|
|
349 WorklistUnescaped.push_back(SuccBB);
|
|
|
350 }
|
|
|
351 }
|
|
|
352
|
|
|
353 if (!WorklistEscaped.empty()) {
|
|
|
354 BB = WorklistEscaped.pop_back_val();
|
|
|
355 Escaped = ESCAPED;
|
|
|
356 } else {
|
|
|
357 BB = nullptr;
|
|
|
358 while (!WorklistUnescaped.empty()) {
|
|
|
359 auto *NextBB = WorklistUnescaped.pop_back_val();
|
|
|
360 if (Visited[NextBB] == UNESCAPED) {
|
|
|
361 BB = NextBB;
|
|
|
362 Escaped = UNESCAPED;
|
|
|
363 break;
|
|
|
364 }
|
|
|
365 }
|
|
|
366 }
|
|
|
367 } while (BB);
|
|
|
368
|
|
|
369 for (CallInst *CI : DeferredTails) {
|
|
|
370 if (Visited[CI->getParent()] != ESCAPED) {
|
|
|
371 // If the escape point was part way through the block, calls after the
|
|
|
372 // escape point wouldn't have been put into DeferredTails.
|
|
|
373 emitOptimizationRemark(F.getContext(), "tailcallelim", F,
|
|
|
374 CI->getDebugLoc(),
|
|
|
375 "marked this call a tail call candidate");
|
|
|
376 CI->setTailCall();
|
|
|
377 Modified = true;
|
|
|
378 } else {
|
|
|
379 AllCallsAreTailCalls = false;
|
|
|
380 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
381 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
382
|
|
77
|
383 return Modified;
|
|
|
384 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
385
|
|
77
|
386 bool TailCallElim::runTRE(Function &F) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
387 // If this function is a varargs function, we won't be able to PHI the args
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
388 // right, so don't even try to convert it...
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
389 if (F.getFunctionType()->isVarArg()) return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
390
|
|
83
|
391 TTI = &getAnalysis<TargetTransformInfoWrapperPass>().getTTI(F);
|
|
77
|
392 BasicBlock *OldEntry = nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
393 bool TailCallsAreMarkedTail = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
394 SmallVector<PHINode*, 8> ArgumentPHIs;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
395 bool MadeChange = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
396
|
|
95
|
397 // If false, we cannot perform TRE on tail calls marked with the 'tail'
|
|
|
398 // attribute, because doing so would cause the stack size to increase (real
|
|
|
399 // TRE would deallocate variable sized allocas, TRE doesn't).
|
|
77
|
400 bool CanTRETailMarkedCall = CanTRE(F);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
401
|
|
77
|
402 // Change any tail recursive calls to loops.
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
403 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
404 // FIXME: The code generator produces really bad code when an 'escaping
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
405 // alloca' is changed from being a static alloca to being a dynamic alloca.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
406 // Until this is resolved, disable this transformation if that would ever
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
407 // happen. This bug is PR962.
|
|
95
|
408 for (Function::iterator BBI = F.begin(), E = F.end(); BBI != E; /*in loop*/) {
|
|
|
409 BasicBlock *BB = BBI++; // FoldReturnAndProcessPred may delete BB.
|
|
77
|
410 if (ReturnInst *Ret = dyn_cast<ReturnInst>(BB->getTerminator())) {
|
|
|
411 bool Change = ProcessReturningBlock(Ret, OldEntry, TailCallsAreMarkedTail,
|
|
|
412 ArgumentPHIs, !CanTRETailMarkedCall);
|
|
95
|
413 if (!Change && BB->getFirstNonPHIOrDbg() == Ret)
|
|
77
|
414 Change = FoldReturnAndProcessPred(BB, Ret, OldEntry,
|
|
|
415 TailCallsAreMarkedTail, ArgumentPHIs,
|
|
|
416 !CanTRETailMarkedCall);
|
|
|
417 MadeChange |= Change;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
418 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
419 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
420
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
421 // If we eliminated any tail recursions, it's possible that we inserted some
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
422 // silly PHI nodes which just merge an initial value (the incoming operand)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
423 // with themselves. Check to see if we did and clean up our mess if so. This
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
424 // occurs when a function passes an argument straight through to its tail
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
425 // call.
|
|
77
|
426 for (unsigned i = 0, e = ArgumentPHIs.size(); i != e; ++i) {
|
|
|
427 PHINode *PN = ArgumentPHIs[i];
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
428
|
|
77
|
429 // If the PHI Node is a dynamic constant, replace it with the value it is.
|
|
95
|
430 if (Value *PNV = SimplifyInstruction(PN, F.getParent()->getDataLayout())) {
|
|
77
|
431 PN->replaceAllUsesWith(PNV);
|
|
|
432 PN->eraseFromParent();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
433 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
434 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
435
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
436 return MadeChange;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
437 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
438
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
439
|
|
95
|
440 /// Return true if it is safe to move the specified
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
441 /// instruction from after the call to before the call, assuming that all
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
442 /// instructions between the call and this instruction are movable.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
443 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
444 bool TailCallElim::CanMoveAboveCall(Instruction *I, CallInst *CI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
445 // FIXME: We can move load/store/call/free instructions above the call if the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
446 // call does not mod/ref the memory location being processed.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
447 if (I->mayHaveSideEffects()) // This also handles volatile loads.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
448 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
449
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
450 if (LoadInst *L = dyn_cast<LoadInst>(I)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
451 // Loads may always be moved above calls without side effects.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
452 if (CI->mayHaveSideEffects()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
453 // Non-volatile loads may be moved above a call with side effects if it
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
454 // does not write to memory and the load provably won't trap.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
455 // FIXME: Writes to memory only matter if they may alias the pointer
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
456 // being loaded from.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
457 if (CI->mayWriteToMemory() ||
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
458 !isSafeToLoadUnconditionally(L->getPointerOperand(), L,
|
|
95
|
459 L->getAlignment()))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
460 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
461 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
462 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
463
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
464 // Otherwise, if this is a side-effect free instruction, check to make sure
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
465 // that it does not use the return value of the call. If it doesn't use the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
466 // return value of the call, it must only use things that are defined before
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
467 // the call, or movable instructions between the call and the instruction
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
468 // itself.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
469 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
470 if (I->getOperand(i) == CI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
471 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
472 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
473 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
474
|
|
95
|
475 /// Return true if the specified value is the same when the return would exit
|
|
|
476 /// as it was when the initial iteration of the recursive function was executed.
|
|
|
477 ///
|
|
|
478 /// We currently handle static constants and arguments that are not modified as
|
|
|
479 /// part of the recursion.
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
480 static bool isDynamicConstant(Value *V, CallInst *CI, ReturnInst *RI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
481 if (isa<Constant>(V)) return true; // Static constants are always dyn consts
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
482
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
483 // Check to see if this is an immutable argument, if so, the value
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
484 // will be available to initialize the accumulator.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
485 if (Argument *Arg = dyn_cast<Argument>(V)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
486 // Figure out which argument number this is...
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
487 unsigned ArgNo = 0;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
488 Function *F = CI->getParent()->getParent();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
489 for (Function::arg_iterator AI = F->arg_begin(); &*AI != Arg; ++AI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
490 ++ArgNo;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
491
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
492 // If we are passing this argument into call as the corresponding
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
493 // argument operand, then the argument is dynamically constant.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
494 // Otherwise, we cannot transform this function safely.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
495 if (CI->getArgOperand(ArgNo) == Arg)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
496 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
497 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
498
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
499 // Switch cases are always constant integers. If the value is being switched
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
500 // on and the return is only reachable from one of its cases, it's
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
501 // effectively constant.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
502 if (BasicBlock *UniquePred = RI->getParent()->getUniquePredecessor())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
503 if (SwitchInst *SI = dyn_cast<SwitchInst>(UniquePred->getTerminator()))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
504 if (SI->getCondition() == V)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
505 return SI->getDefaultDest() != RI->getParent();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
506
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
507 // Not a constant or immutable argument, we can't safely transform.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
508 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
509 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
510
|
|
95
|
511 /// Check to see if the function containing the specified tail call consistently
|
|
|
512 /// returns the same runtime-constant value at all exit points except for
|
|
|
513 /// IgnoreRI. If so, return the returned value.
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
514 static Value *getCommonReturnValue(ReturnInst *IgnoreRI, CallInst *CI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
515 Function *F = CI->getParent()->getParent();
|
|
77
|
516 Value *ReturnedValue = nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
517
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
518 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
519 ReturnInst *RI = dyn_cast<ReturnInst>(BBI->getTerminator());
|
|
77
|
520 if (RI == nullptr || RI == IgnoreRI) continue;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
521
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
522 // We can only perform this transformation if the value returned is
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
523 // evaluatable at the start of the initial invocation of the function,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
524 // instead of at the end of the evaluation.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
525 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
526 Value *RetOp = RI->getOperand(0);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
527 if (!isDynamicConstant(RetOp, CI, RI))
|
|
77
|
528 return nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
529
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
530 if (ReturnedValue && RetOp != ReturnedValue)
|
|
77
|
531 return nullptr; // Cannot transform if differing values are returned.
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
532 ReturnedValue = RetOp;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
533 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
534 return ReturnedValue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
535 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
536
|
|
95
|
537 /// If the specified instruction can be transformed using accumulator recursion
|
|
|
538 /// elimination, return the constant which is the start of the accumulator
|
|
|
539 /// value. Otherwise return null.
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
540 Value *TailCallElim::CanTransformAccumulatorRecursion(Instruction *I,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
541 CallInst *CI) {
|
|
77
|
542 if (!I->isAssociative() || !I->isCommutative()) return nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
543 assert(I->getNumOperands() == 2 &&
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
544 "Associative/commutative operations should have 2 args!");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
545
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
546 // Exactly one operand should be the result of the call instruction.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
547 if ((I->getOperand(0) == CI && I->getOperand(1) == CI) ||
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
548 (I->getOperand(0) != CI && I->getOperand(1) != CI))
|
|
77
|
549 return nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
550
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
551 // The only user of this instruction we allow is a single return instruction.
|
|
77
|
552 if (!I->hasOneUse() || !isa<ReturnInst>(I->user_back()))
|
|
|
553 return nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
554
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
555 // Ok, now we have to check all of the other return instructions in this
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
556 // function. If they return non-constants or differing values, then we cannot
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
557 // transform the function safely.
|
|
77
|
558 return getCommonReturnValue(cast<ReturnInst>(I->user_back()), CI);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
559 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
560
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
561 static Instruction *FirstNonDbg(BasicBlock::iterator I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
562 while (isa<DbgInfoIntrinsic>(I))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
563 ++I;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
564 return &*I;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
565 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
566
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
567 CallInst*
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
568 TailCallElim::FindTRECandidate(Instruction *TI,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
569 bool CannotTailCallElimCallsMarkedTail) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
570 BasicBlock *BB = TI->getParent();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
571 Function *F = BB->getParent();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
572
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
573 if (&BB->front() == TI) // Make sure there is something before the terminator.
|
|
77
|
574 return nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
575
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
576 // Scan backwards from the return, checking to see if there is a tail call in
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
577 // this block. If so, set CI to it.
|
|
77
|
578 CallInst *CI = nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
579 BasicBlock::iterator BBI = TI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
580 while (true) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
581 CI = dyn_cast<CallInst>(BBI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
582 if (CI && CI->getCalledFunction() == F)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
583 break;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
584
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
585 if (BBI == BB->begin())
|
|
77
|
586 return nullptr; // Didn't find a potential tail call.
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
587 --BBI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
588 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
589
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
590 // If this call is marked as a tail call, and if there are dynamic allocas in
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
591 // the function, we cannot perform this optimization.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
592 if (CI->isTailCall() && CannotTailCallElimCallsMarkedTail)
|
|
77
|
593 return nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
594
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
595 // As a special case, detect code like this:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
596 // double fabs(double f) { return __builtin_fabs(f); } // a 'fabs' call
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
597 // and disable this xform in this case, because the code generator will
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
598 // lower the call to fabs into inline code.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
599 if (BB == &F->getEntryBlock() &&
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
600 FirstNonDbg(BB->front()) == CI &&
|
|
77
|
601 FirstNonDbg(std::next(BB->begin())) == TI &&
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
602 CI->getCalledFunction() &&
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
603 !TTI->isLoweredToCall(CI->getCalledFunction())) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
604 // A single-block function with just a call and a return. Check that
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
605 // the arguments match.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
606 CallSite::arg_iterator I = CallSite(CI).arg_begin(),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
607 E = CallSite(CI).arg_end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
608 Function::arg_iterator FI = F->arg_begin(),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
609 FE = F->arg_end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
610 for (; I != E && FI != FE; ++I, ++FI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
611 if (*I != &*FI) break;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
612 if (I == E && FI == FE)
|
|
77
|
613 return nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
614 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
615
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
616 return CI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
617 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
618
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
619 bool TailCallElim::EliminateRecursiveTailCall(CallInst *CI, ReturnInst *Ret,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
620 BasicBlock *&OldEntry,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
621 bool &TailCallsAreMarkedTail,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
622 SmallVectorImpl<PHINode *> &ArgumentPHIs,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
623 bool CannotTailCallElimCallsMarkedTail) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
624 // If we are introducing accumulator recursion to eliminate operations after
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
625 // the call instruction that are both associative and commutative, the initial
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
626 // value for the accumulator is placed in this variable. If this value is set
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
627 // then we actually perform accumulator recursion elimination instead of
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
628 // simple tail recursion elimination. If the operation is an LLVM instruction
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
629 // (eg: "add") then it is recorded in AccumulatorRecursionInstr. If not, then
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
630 // we are handling the case when the return instruction returns a constant C
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
631 // which is different to the constant returned by other return instructions
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
632 // (which is recorded in AccumulatorRecursionEliminationInitVal). This is a
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
633 // special case of accumulator recursion, the operation being "return C".
|
|
77
|
634 Value *AccumulatorRecursionEliminationInitVal = nullptr;
|
|
|
635 Instruction *AccumulatorRecursionInstr = nullptr;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
636
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
637 // Ok, we found a potential tail call. We can currently only transform the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
638 // tail call if all of the instructions between the call and the return are
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
639 // movable to above the call itself, leaving the call next to the return.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
640 // Check that this is the case now.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
641 BasicBlock::iterator BBI = CI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
642 for (++BBI; &*BBI != Ret; ++BBI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
643 if (CanMoveAboveCall(BBI, CI)) continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
644
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
645 // If we can't move the instruction above the call, it might be because it
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
646 // is an associative and commutative operation that could be transformed
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
647 // using accumulator recursion elimination. Check to see if this is the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
648 // case, and if so, remember the initial accumulator value for later.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
649 if ((AccumulatorRecursionEliminationInitVal =
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
650 CanTransformAccumulatorRecursion(BBI, CI))) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
651 // Yes, this is accumulator recursion. Remember which instruction
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
652 // accumulates.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
653 AccumulatorRecursionInstr = BBI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
654 } else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
655 return false; // Otherwise, we cannot eliminate the tail recursion!
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
656 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
657 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
658
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
659 // We can only transform call/return pairs that either ignore the return value
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
660 // of the call and return void, ignore the value of the call and return a
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
661 // constant, return the value returned by the tail call, or that are being
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
662 // accumulator recursion variable eliminated.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
663 if (Ret->getNumOperands() == 1 && Ret->getReturnValue() != CI &&
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
664 !isa<UndefValue>(Ret->getReturnValue()) &&
|
|
77
|
665 AccumulatorRecursionEliminationInitVal == nullptr &&
|
|
|
666 !getCommonReturnValue(nullptr, CI)) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
667 // One case remains that we are able to handle: the current return
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
668 // instruction returns a constant, and all other return instructions
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
669 // return a different constant.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
670 if (!isDynamicConstant(Ret->getReturnValue(), CI, Ret))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
671 return false; // Current return instruction does not return a constant.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
672 // Check that all other return instructions return a common constant. If
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
673 // so, record it in AccumulatorRecursionEliminationInitVal.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
674 AccumulatorRecursionEliminationInitVal = getCommonReturnValue(Ret, CI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
675 if (!AccumulatorRecursionEliminationInitVal)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
676 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
677 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
678
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
679 BasicBlock *BB = Ret->getParent();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
680 Function *F = BB->getParent();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
681
|
|
77
|
682 emitOptimizationRemark(F->getContext(), "tailcallelim", *F, CI->getDebugLoc(),
|
|
|
683 "transforming tail recursion to loop");
|
|
|
684
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
685 // OK! We can transform this tail call. If this is the first one found,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
686 // create the new entry block, allowing us to branch back to the old entry.
|
|
77
|
687 if (!OldEntry) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
688 OldEntry = &F->getEntryBlock();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
689 BasicBlock *NewEntry = BasicBlock::Create(F->getContext(), "", F, OldEntry);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
690 NewEntry->takeName(OldEntry);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
691 OldEntry->setName("tailrecurse");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
692 BranchInst::Create(OldEntry, NewEntry);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
693
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
694 // If this tail call is marked 'tail' and if there are any allocas in the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
695 // entry block, move them up to the new entry block.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
696 TailCallsAreMarkedTail = CI->isTailCall();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
697 if (TailCallsAreMarkedTail)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
698 // Move all fixed sized allocas from OldEntry to NewEntry.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
699 for (BasicBlock::iterator OEBI = OldEntry->begin(), E = OldEntry->end(),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
700 NEBI = NewEntry->begin(); OEBI != E; )
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
701 if (AllocaInst *AI = dyn_cast<AllocaInst>(OEBI++))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
702 if (isa<ConstantInt>(AI->getArraySize()))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
703 AI->moveBefore(NEBI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
704
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
705 // Now that we have created a new block, which jumps to the entry
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
706 // block, insert a PHI node for each argument of the function.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
707 // For now, we initialize each PHI to only have the real arguments
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
708 // which are passed in.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
709 Instruction *InsertPos = OldEntry->begin();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
710 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
711 I != E; ++I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
712 PHINode *PN = PHINode::Create(I->getType(), 2,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
713 I->getName() + ".tr", InsertPos);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
714 I->replaceAllUsesWith(PN); // Everyone use the PHI node now!
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
715 PN->addIncoming(I, NewEntry);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
716 ArgumentPHIs.push_back(PN);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
717 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
718 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
719
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
720 // If this function has self recursive calls in the tail position where some
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
721 // are marked tail and some are not, only transform one flavor or another. We
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
722 // have to choose whether we move allocas in the entry block to the new entry
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
723 // block or not, so we can't make a good choice for both. NOTE: We could do
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
724 // slightly better here in the case that the function has no entry block
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
725 // allocas.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
726 if (TailCallsAreMarkedTail && !CI->isTailCall())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
727 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
728
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
729 // Ok, now that we know we have a pseudo-entry block WITH all of the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
730 // required PHI nodes, add entries into the PHI node for the actual
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
731 // parameters passed into the tail-recursive call.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
732 for (unsigned i = 0, e = CI->getNumArgOperands(); i != e; ++i)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
733 ArgumentPHIs[i]->addIncoming(CI->getArgOperand(i), BB);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
734
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
735 // If we are introducing an accumulator variable to eliminate the recursion,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
736 // do so now. Note that we _know_ that no subsequent tail recursion
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
737 // eliminations will happen on this function because of the way the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
738 // accumulator recursion predicate is set up.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
739 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
740 if (AccumulatorRecursionEliminationInitVal) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
741 Instruction *AccRecInstr = AccumulatorRecursionInstr;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
742 // Start by inserting a new PHI node for the accumulator.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
743 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
744 PHINode *AccPN =
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
745 PHINode::Create(AccumulatorRecursionEliminationInitVal->getType(),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
746 std::distance(PB, PE) + 1,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
747 "accumulator.tr", OldEntry->begin());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
748
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
749 // Loop over all of the predecessors of the tail recursion block. For the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
750 // real entry into the function we seed the PHI with the initial value,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
751 // computed earlier. For any other existing branches to this block (due to
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
752 // other tail recursions eliminated) the accumulator is not modified.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
753 // Because we haven't added the branch in the current block to OldEntry yet,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
754 // it will not show up as a predecessor.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
755 for (pred_iterator PI = PB; PI != PE; ++PI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
756 BasicBlock *P = *PI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
757 if (P == &F->getEntryBlock())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
758 AccPN->addIncoming(AccumulatorRecursionEliminationInitVal, P);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
759 else
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
760 AccPN->addIncoming(AccPN, P);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
761 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
762
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
763 if (AccRecInstr) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
764 // Add an incoming argument for the current block, which is computed by
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
765 // our associative and commutative accumulator instruction.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
766 AccPN->addIncoming(AccRecInstr, BB);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
767
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
768 // Next, rewrite the accumulator recursion instruction so that it does not
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
769 // use the result of the call anymore, instead, use the PHI node we just
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
770 // inserted.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
771 AccRecInstr->setOperand(AccRecInstr->getOperand(0) != CI, AccPN);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
772 } else {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
773 // Add an incoming argument for the current block, which is just the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
774 // constant returned by the current return instruction.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
775 AccPN->addIncoming(Ret->getReturnValue(), BB);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
776 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
777
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
778 // Finally, rewrite any return instructions in the program to return the PHI
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
779 // node instead of the "initval" that they do currently. This loop will
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
780 // actually rewrite the return value we are destroying, but that's ok.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
781 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
782 if (ReturnInst *RI = dyn_cast<ReturnInst>(BBI->getTerminator()))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
783 RI->setOperand(0, AccPN);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
784 ++NumAccumAdded;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
785 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
786
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
787 // Now that all of the PHI nodes are in place, remove the call and
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
788 // ret instructions, replacing them with an unconditional branch.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
789 BranchInst *NewBI = BranchInst::Create(OldEntry, Ret);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
790 NewBI->setDebugLoc(CI->getDebugLoc());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
791
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
792 BB->getInstList().erase(Ret); // Remove return.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
793 BB->getInstList().erase(CI); // Remove call.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
794 ++NumEliminated;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
795 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
796 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
797
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
798 bool TailCallElim::FoldReturnAndProcessPred(BasicBlock *BB,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
799 ReturnInst *Ret, BasicBlock *&OldEntry,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
800 bool &TailCallsAreMarkedTail,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
801 SmallVectorImpl<PHINode *> &ArgumentPHIs,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
802 bool CannotTailCallElimCallsMarkedTail) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
803 bool Change = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
804
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
805 // If the return block contains nothing but the return and PHI's,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
806 // there might be an opportunity to duplicate the return in its
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
807 // predecessors and perform TRC there. Look for predecessors that end
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
808 // in unconditional branch and recursive call(s).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
809 SmallVector<BranchInst*, 8> UncondBranchPreds;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
810 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
811 BasicBlock *Pred = *PI;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
812 TerminatorInst *PTI = Pred->getTerminator();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
813 if (BranchInst *BI = dyn_cast<BranchInst>(PTI))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
814 if (BI->isUnconditional())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
815 UncondBranchPreds.push_back(BI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
816 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
817
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
818 while (!UncondBranchPreds.empty()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
819 BranchInst *BI = UncondBranchPreds.pop_back_val();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
820 BasicBlock *Pred = BI->getParent();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
821 if (CallInst *CI = FindTRECandidate(BI, CannotTailCallElimCallsMarkedTail)){
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
822 DEBUG(dbgs() << "FOLDING: " << *BB
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
823 << "INTO UNCOND BRANCH PRED: " << *Pred);
|
|
83
|
824 ReturnInst *RI = FoldReturnIntoUncondBranch(Ret, BB, Pred);
|
|
|
825
|
|
|
826 // Cleanup: if all predecessors of BB have been eliminated by
|
|
95
|
827 // FoldReturnIntoUncondBranch, delete it. It is important to empty it,
|
|
|
828 // because the ret instruction in there is still using a value which
|
|
|
829 // EliminateRecursiveTailCall will attempt to remove.
|
|
83
|
830 if (!BB->hasAddressTaken() && pred_begin(BB) == pred_end(BB))
|
|
95
|
831 BB->eraseFromParent();
|
|
83
|
832
|
|
|
833 EliminateRecursiveTailCall(CI, RI, OldEntry, TailCallsAreMarkedTail,
|
|
|
834 ArgumentPHIs,
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
835 CannotTailCallElimCallsMarkedTail);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
836 ++NumRetDuped;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
837 Change = true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
838 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
839 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
840
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
841 return Change;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
842 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
843
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
844 bool
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
845 TailCallElim::ProcessReturningBlock(ReturnInst *Ret, BasicBlock *&OldEntry,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
846 bool &TailCallsAreMarkedTail,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
847 SmallVectorImpl<PHINode *> &ArgumentPHIs,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
848 bool CannotTailCallElimCallsMarkedTail) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
849 CallInst *CI = FindTRECandidate(Ret, CannotTailCallElimCallsMarkedTail);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
850 if (!CI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
851 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
852
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
853 return EliminateRecursiveTailCall(CI, Ret, OldEntry, TailCallsAreMarkedTail,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
854 ArgumentPHIs,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
855 CannotTailCallElimCallsMarkedTail);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
856 }
|
