clang -cc1 -cc1 -triple amd64-unknown-openbsd7.0 -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name CodeExtractor.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model static -mframe-pointer=all -relaxed-aliasing -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/gnu/usr.bin/clang/libLLVM/obj -resource-dir /usr/local/lib/clang/13.0.0 -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Target/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Target/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Target/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Target/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Target/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Target/AMDGPU -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Analysis -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/ASMParser -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/BinaryFormat -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Bitcode -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Bitcode -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Bitstream -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms -I /include/llvm/CodeGen -I /include/llvm/CodeGen/PBQP -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/IR -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/IR -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms/Coroutines -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/ProfileData/Coverage -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/DebugInfo/CodeView -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/DebugInfo/DWARF -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/DebugInfo -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/DebugInfo/MSF -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/DebugInfo/PDB -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Demangle -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/ExecutionEngine -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/ExecutionEngine/JITLink -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/ExecutionEngine/Orc -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Frontend -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Frontend/OpenACC -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Frontend -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Frontend/OpenMP -I /include/llvm/CodeGen/GlobalISel -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/IRReader -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms/InstCombine -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/Transforms/InstCombine -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/LTO -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Linker -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/MC -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/MC/MCParser -I /include/llvm/CodeGen/MIRParser -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Object -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Option -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Passes -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/ -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/ProfileData -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms/Scalar -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/ADT -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Support -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/DebugInfo/Symbolize -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Target -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms/Utils -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms/Vectorize -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/X86 -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Target/X86 -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/X86 -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Target/X86 -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/X86 -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Target/X86 -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/X86 -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Target/X86 -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include/llvm/X86 -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Target/X86 -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include/llvm/Transforms/IPO -I /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/include -I /usr/src/gnu/usr.bin/clang/libLLVM/../include -I /usr/src/gnu/usr.bin/clang/libLLVM/obj -I /usr/src/gnu/usr.bin/clang/libLLVM/obj/../include -D NDEBUG -D __STDC_LIMIT_MACROS -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D LLVM_PREFIX="/usr" -internal-isystem /usr/include/c++/v1 -internal-isystem /usr/local/lib/clang/13.0.0/include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-comment -std=c++14 -fdeprecated-macro -fdebug-compilation-dir=/usr/src/gnu/usr.bin/clang/libLLVM/obj -ferror-limit 19 -fvisibility-inlines-hidden -fwrapv -stack-protector 2 -fno-rtti -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /home/ben/Projects/vmm/scan-build/2022-01-12-194120-40624-1 -x c++ /usr/src/gnu/usr.bin/clang/libLLVM/../../../llvm/llvm/lib/Transforms/Utils/CodeExtractor.cpp
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 | |
10 | |
11 | |
12 | |
13 | |
14 | |
15 | #include "llvm/Transforms/Utils/CodeExtractor.h" |
16 | #include "llvm/ADT/ArrayRef.h" |
17 | #include "llvm/ADT/DenseMap.h" |
18 | #include "llvm/ADT/Optional.h" |
19 | #include "llvm/ADT/STLExtras.h" |
20 | #include "llvm/ADT/SetVector.h" |
21 | #include "llvm/ADT/SmallPtrSet.h" |
22 | #include "llvm/ADT/SmallVector.h" |
23 | #include "llvm/Analysis/AssumptionCache.h" |
24 | #include "llvm/Analysis/BlockFrequencyInfo.h" |
25 | #include "llvm/Analysis/BlockFrequencyInfoImpl.h" |
26 | #include "llvm/Analysis/BranchProbabilityInfo.h" |
27 | #include "llvm/Analysis/LoopInfo.h" |
28 | #include "llvm/IR/Argument.h" |
29 | #include "llvm/IR/Attributes.h" |
30 | #include "llvm/IR/BasicBlock.h" |
31 | #include "llvm/IR/CFG.h" |
32 | #include "llvm/IR/Constant.h" |
33 | #include "llvm/IR/Constants.h" |
34 | #include "llvm/IR/DIBuilder.h" |
35 | #include "llvm/IR/DataLayout.h" |
36 | #include "llvm/IR/DebugInfoMetadata.h" |
37 | #include "llvm/IR/DerivedTypes.h" |
38 | #include "llvm/IR/Dominators.h" |
39 | #include "llvm/IR/Function.h" |
40 | #include "llvm/IR/GlobalValue.h" |
41 | #include "llvm/IR/InstIterator.h" |
42 | #include "llvm/IR/InstrTypes.h" |
43 | #include "llvm/IR/Instruction.h" |
44 | #include "llvm/IR/Instructions.h" |
45 | #include "llvm/IR/IntrinsicInst.h" |
46 | #include "llvm/IR/Intrinsics.h" |
47 | #include "llvm/IR/LLVMContext.h" |
48 | #include "llvm/IR/MDBuilder.h" |
49 | #include "llvm/IR/Module.h" |
50 | #include "llvm/IR/PatternMatch.h" |
51 | #include "llvm/IR/Type.h" |
52 | #include "llvm/IR/User.h" |
53 | #include "llvm/IR/Value.h" |
54 | #include "llvm/IR/Verifier.h" |
55 | #include "llvm/Pass.h" |
56 | #include "llvm/Support/BlockFrequency.h" |
57 | #include "llvm/Support/BranchProbability.h" |
58 | #include "llvm/Support/Casting.h" |
59 | #include "llvm/Support/CommandLine.h" |
60 | #include "llvm/Support/Debug.h" |
61 | #include "llvm/Support/ErrorHandling.h" |
62 | #include "llvm/Support/raw_ostream.h" |
63 | #include "llvm/Transforms/Utils/BasicBlockUtils.h" |
64 | #include "llvm/Transforms/Utils/Local.h" |
65 | #include <cassert> |
66 | #include <cstdint> |
67 | #include <iterator> |
68 | #include <map> |
69 | #include <set> |
70 | #include <utility> |
71 | #include <vector> |
72 | |
73 | using namespace llvm; |
74 | using namespace llvm::PatternMatch; |
75 | using ProfileCount = Function::ProfileCount; |
76 | |
77 | #define DEBUG_TYPE "code-extractor" |
78 | |
79 | |
80 | |
81 | |
82 | |
83 | static cl::opt<bool> |
84 | AggregateArgsOpt("aggregate-extracted-args", cl::Hidden, |
85 | cl::desc("Aggregate arguments to code-extracted functions")); |
86 | |
87 | |
88 | static bool isBlockValidForExtraction(const BasicBlock &BB, |
89 | const SetVector<BasicBlock *> &Result, |
90 | bool AllowVarArgs, bool AllowAlloca) { |
91 | |
92 | if (BB.hasAddressTaken()) |
93 | return false; |
94 | |
95 | |
96 | |
97 | SmallPtrSet<User const *, 16> Visited; |
98 | SmallVector<User const *, 16> ToVisit; |
99 | |
100 | for (Instruction const &Inst : BB) |
101 | ToVisit.push_back(&Inst); |
102 | |
103 | while (!ToVisit.empty()) { |
104 | User const *Curr = ToVisit.pop_back_val(); |
105 | if (!Visited.insert(Curr).second) |
106 | continue; |
107 | if (isa<BlockAddress const>(Curr)) |
108 | return false; |
109 | |
110 | if (isa<Instruction>(Curr) && cast<Instruction>(Curr)->getParent() != &BB) |
111 | continue; |
112 | |
113 | for (auto const &U : Curr->operands()) { |
114 | if (auto *UU = dyn_cast<User>(U)) |
115 | ToVisit.push_back(UU); |
116 | } |
117 | } |
118 | |
119 | |
120 | |
121 | for (BasicBlock::const_iterator I = BB.begin(), E = BB.end(); I != E; ++I) { |
122 | if (isa<AllocaInst>(I)) { |
123 | if (!AllowAlloca) |
124 | return false; |
125 | continue; |
126 | } |
127 | |
128 | if (const auto *II = dyn_cast<InvokeInst>(I)) { |
129 | |
130 | |
131 | if (auto *UBB = II->getUnwindDest()) |
132 | if (!Result.count(UBB)) |
133 | return false; |
134 | continue; |
135 | } |
136 | |
137 | |
138 | |
139 | if (const auto *CSI = dyn_cast<CatchSwitchInst>(I)) { |
140 | if (auto *UBB = CSI->getUnwindDest()) |
141 | if (!Result.count(UBB)) |
142 | return false; |
143 | for (auto *HBB : CSI->handlers()) |
144 | if (!Result.count(const_cast<BasicBlock*>(HBB))) |
145 | return false; |
146 | continue; |
147 | } |
148 | |
149 | |
150 | |
151 | if (const auto *CPI = dyn_cast<CatchPadInst>(I)) { |
152 | for (const auto *U : CPI->users()) |
153 | if (const auto *CRI = dyn_cast<CatchReturnInst>(U)) |
154 | if (!Result.count(const_cast<BasicBlock*>(CRI->getParent()))) |
155 | return false; |
156 | continue; |
157 | } |
158 | |
159 | |
160 | |
161 | |
162 | if (const auto *CPI = dyn_cast<CleanupPadInst>(I)) { |
163 | for (const auto *U : CPI->users()) |
164 | if (const auto *CRI = dyn_cast<CleanupReturnInst>(U)) |
165 | if (!Result.count(const_cast<BasicBlock*>(CRI->getParent()))) |
166 | return false; |
167 | continue; |
168 | } |
169 | if (const auto *CRI = dyn_cast<CleanupReturnInst>(I)) { |
170 | if (auto *UBB = CRI->getUnwindDest()) |
171 | if (!Result.count(UBB)) |
172 | return false; |
173 | continue; |
174 | } |
175 | |
176 | if (const CallInst *CI = dyn_cast<CallInst>(I)) { |
177 | if (const Function *F = CI->getCalledFunction()) { |
178 | auto IID = F->getIntrinsicID(); |
179 | if (IID == Intrinsic::vastart) { |
180 | if (AllowVarArgs) |
181 | continue; |
182 | else |
183 | return false; |
184 | } |
185 | |
186 | |
187 | |
188 | if (IID == Intrinsic::eh_typeid_for) |
189 | return false; |
190 | } |
191 | } |
192 | } |
193 | |
194 | return true; |
195 | } |
196 | |
197 | |
198 | static SetVector<BasicBlock *> |
199 | buildExtractionBlockSet(ArrayRef<BasicBlock *> BBs, DominatorTree *DT, |
200 | bool AllowVarArgs, bool AllowAlloca) { |
201 | assert(!BBs.empty() && "The set of blocks to extract must be non-empty"); |
202 | SetVector<BasicBlock *> Result; |
203 | |
204 | |
205 | |
206 | for (BasicBlock *BB : BBs) { |
207 | |
208 | if (DT && !DT->isReachableFromEntry(BB)) |
209 | continue; |
210 | |
211 | if (!Result.insert(BB)) |
212 | llvm_unreachable("Repeated basic blocks in extraction input"); |
213 | } |
214 | |
215 | LLVM_DEBUG(dbgs() << "Region front block: " << Result.front()->getName() |
216 | << '\n'); |
217 | |
218 | for (auto *BB : Result) { |
219 | if (!isBlockValidForExtraction(*BB, Result, AllowVarArgs, AllowAlloca)) |
220 | return {}; |
221 | |
222 | |
223 | if (BB == Result.front()) { |
224 | if (BB->isEHPad()) { |
225 | LLVM_DEBUG(dbgs() << "The first block cannot be an unwind block\n"); |
226 | return {}; |
227 | } |
228 | continue; |
229 | } |
230 | |
231 | |
232 | |
233 | for (auto *PBB : predecessors(BB)) |
234 | if (!Result.count(PBB)) { |
235 | LLVM_DEBUG(dbgs() << "No blocks in this region may have entries from " |
236 | "outside the region except for the first block!\n" |
237 | << "Problematic source BB: " << BB->getName() << "\n" |
238 | << "Problematic destination BB: " << PBB->getName() |
239 | << "\n"); |
240 | return {}; |
241 | } |
242 | } |
243 | |
244 | return Result; |
245 | } |
246 | |
247 | CodeExtractor::CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT, |
248 | bool AggregateArgs, BlockFrequencyInfo *BFI, |
249 | BranchProbabilityInfo *BPI, AssumptionCache *AC, |
250 | bool AllowVarArgs, bool AllowAlloca, |
251 | std::string Suffix) |
252 | : DT(DT), AggregateArgs(AggregateArgs || AggregateArgsOpt), BFI(BFI), |
253 | BPI(BPI), AC(AC), AllowVarArgs(AllowVarArgs), |
254 | Blocks(buildExtractionBlockSet(BBs, DT, AllowVarArgs, AllowAlloca)), |
255 | Suffix(Suffix) {} |
256 | |
257 | CodeExtractor::CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs, |
258 | BlockFrequencyInfo *BFI, |
259 | BranchProbabilityInfo *BPI, AssumptionCache *AC, |
260 | std::string Suffix) |
261 | : DT(&DT), AggregateArgs(AggregateArgs || AggregateArgsOpt), BFI(BFI), |
262 | BPI(BPI), AC(AC), AllowVarArgs(false), |
263 | Blocks(buildExtractionBlockSet(L.getBlocks(), &DT, |
264 | false, |
265 | false)), |
266 | Suffix(Suffix) {} |
267 | |
268 | |
269 | |
270 | static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { |
271 | if (Instruction *I = dyn_cast<Instruction>(V)) |
272 | if (Blocks.count(I->getParent())) |
273 | return true; |
274 | return false; |
275 | } |
276 | |
277 | |
278 | |
279 | |
280 | static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { |
281 | if (isa<Argument>(V)) return true; |
282 | if (Instruction *I = dyn_cast<Instruction>(V)) |
283 | if (!Blocks.count(I->getParent())) |
284 | return true; |
285 | return false; |
286 | } |
287 | |
288 | static BasicBlock *getCommonExitBlock(const SetVector<BasicBlock *> &Blocks) { |
289 | BasicBlock *CommonExitBlock = nullptr; |
290 | auto hasNonCommonExitSucc = [&](BasicBlock *Block) { |
291 | for (auto *Succ : successors(Block)) { |
292 | |
293 | if (Blocks.count(Succ)) |
294 | continue; |
295 | if (!CommonExitBlock) { |
296 | CommonExitBlock = Succ; |
297 | continue; |
298 | } |
299 | if (CommonExitBlock != Succ) |
300 | return true; |
301 | } |
302 | return false; |
303 | }; |
304 | |
305 | if (any_of(Blocks, hasNonCommonExitSucc)) |
306 | return nullptr; |
307 | |
308 | return CommonExitBlock; |
309 | } |
310 | |
311 | CodeExtractorAnalysisCache::CodeExtractorAnalysisCache(Function &F) { |
312 | for (BasicBlock &BB : F) { |
313 | for (Instruction &II : BB.instructionsWithoutDebug()) |
314 | if (auto *AI = dyn_cast<AllocaInst>(&II)) |
315 | Allocas.push_back(AI); |
316 | |
317 | findSideEffectInfoForBlock(BB); |
318 | } |
319 | } |
320 | |
321 | void CodeExtractorAnalysisCache::findSideEffectInfoForBlock(BasicBlock &BB) { |
322 | for (Instruction &II : BB.instructionsWithoutDebug()) { |
323 | unsigned Opcode = II.getOpcode(); |
324 | Value *MemAddr = nullptr; |
325 | switch (Opcode) { |
326 | case Instruction::Store: |
327 | case Instruction::Load: { |
328 | if (Opcode == Instruction::Store) { |
329 | StoreInst *SI = cast<StoreInst>(&II); |
330 | MemAddr = SI->getPointerOperand(); |
331 | } else { |
332 | LoadInst *LI = cast<LoadInst>(&II); |
333 | MemAddr = LI->getPointerOperand(); |
334 | } |
335 | |
336 | if (isa<Constant>(MemAddr)) |
337 | break; |
338 | Value *Base = MemAddr->stripInBoundsConstantOffsets(); |
339 | if (!isa<AllocaInst>(Base)) { |
340 | SideEffectingBlocks.insert(&BB); |
341 | return; |
342 | } |
343 | BaseMemAddrs[&BB].insert(Base); |
344 | break; |
345 | } |
346 | default: { |
347 | IntrinsicInst *IntrInst = dyn_cast<IntrinsicInst>(&II); |
348 | if (IntrInst) { |
349 | if (IntrInst->isLifetimeStartOrEnd()) |
350 | break; |
351 | SideEffectingBlocks.insert(&BB); |
352 | return; |
353 | } |
354 | |
355 | if (II.mayHaveSideEffects()) { |
356 | SideEffectingBlocks.insert(&BB); |
357 | return; |
358 | } |
359 | } |
360 | } |
361 | } |
362 | } |
363 | |
364 | bool CodeExtractorAnalysisCache::doesBlockContainClobberOfAddr( |
365 | BasicBlock &BB, AllocaInst *Addr) const { |
366 | if (SideEffectingBlocks.count(&BB)) |
367 | return true; |
368 | auto It = BaseMemAddrs.find(&BB); |
369 | if (It != BaseMemAddrs.end()) |
370 | return It->second.count(Addr); |
371 | return false; |
372 | } |
373 | |
374 | bool CodeExtractor::isLegalToShrinkwrapLifetimeMarkers( |
375 | const CodeExtractorAnalysisCache &CEAC, Instruction *Addr) const { |
376 | AllocaInst *AI = cast<AllocaInst>(Addr->stripInBoundsConstantOffsets()); |
377 | Function *Func = (*Blocks.begin())->getParent(); |
378 | for (BasicBlock &BB : *Func) { |
379 | if (Blocks.count(&BB)) |
380 | continue; |
381 | if (CEAC.doesBlockContainClobberOfAddr(BB, AI)) |
382 | return false; |
383 | } |
384 | return true; |
385 | } |
386 | |
387 | BasicBlock * |
388 | CodeExtractor::findOrCreateBlockForHoisting(BasicBlock *CommonExitBlock) { |
389 | BasicBlock *SinglePredFromOutlineRegion = nullptr; |
390 | assert(!Blocks.count(CommonExitBlock) && |
391 | "Expect a block outside the region!"); |
392 | for (auto *Pred : predecessors(CommonExitBlock)) { |
393 | if (!Blocks.count(Pred)) |
394 | continue; |
395 | if (!SinglePredFromOutlineRegion) { |
396 | SinglePredFromOutlineRegion = Pred; |
397 | } else if (SinglePredFromOutlineRegion != Pred) { |
398 | SinglePredFromOutlineRegion = nullptr; |
399 | break; |
400 | } |
401 | } |
402 | |
403 | if (SinglePredFromOutlineRegion) |
404 | return SinglePredFromOutlineRegion; |
405 | |
406 | #ifndef NDEBUG |
407 | auto getFirstPHI = [](BasicBlock *BB) { |
408 | BasicBlock::iterator I = BB->begin(); |
409 | PHINode *FirstPhi = nullptr; |
410 | while (I != BB->end()) { |
411 | PHINode *Phi = dyn_cast<PHINode>(I); |
412 | if (!Phi) |
413 | break; |
414 | if (!FirstPhi) { |
415 | FirstPhi = Phi; |
416 | break; |
417 | } |
418 | } |
419 | return FirstPhi; |
420 | }; |
421 | |
422 | |
423 | assert(!getFirstPHI(CommonExitBlock) && "Phi not expected"); |
424 | #endif |
425 | |
426 | BasicBlock *NewExitBlock = CommonExitBlock->splitBasicBlock( |
427 | CommonExitBlock->getFirstNonPHI()->getIterator()); |
428 | |
429 | for (BasicBlock *Pred : |
430 | llvm::make_early_inc_range(predecessors(CommonExitBlock))) { |
431 | if (Blocks.count(Pred)) |
432 | continue; |
433 | Pred->getTerminator()->replaceUsesOfWith(CommonExitBlock, NewExitBlock); |
434 | } |
435 | |
436 | Blocks.insert(CommonExitBlock); |
437 | return CommonExitBlock; |
438 | } |
439 | |
440 | |
441 | |
442 | |
443 | |
444 | CodeExtractor::LifetimeMarkerInfo |
445 | CodeExtractor::getLifetimeMarkers(const CodeExtractorAnalysisCache &CEAC, |
446 | Instruction *Addr, |
447 | BasicBlock *ExitBlock) const { |
448 | LifetimeMarkerInfo Info; |
449 | |
450 | for (User *U : Addr->users()) { |
451 | IntrinsicInst *IntrInst = dyn_cast<IntrinsicInst>(U); |
452 | if (IntrInst) { |
453 | |
454 | |
455 | if (IntrInst->getIntrinsicID() == Intrinsic::lifetime_start) { |
456 | if (Info.LifeStart) |
457 | return {}; |
458 | Info.LifeStart = IntrInst; |
459 | continue; |
460 | } |
461 | if (IntrInst->getIntrinsicID() == Intrinsic::lifetime_end) { |
462 | if (Info.LifeEnd) |
463 | return {}; |
464 | Info.LifeEnd = IntrInst; |
465 | continue; |
466 | } |
467 | |
468 | |
469 | if (isa<DbgInfoIntrinsic>(IntrInst)) |
470 | continue; |
471 | } |
472 | |
473 | if (!definedInRegion(Blocks, U)) |
474 | return {}; |
475 | } |
476 | |
477 | if (!Info.LifeStart || !Info.LifeEnd) |
478 | return {}; |
479 | |
480 | Info.SinkLifeStart = !definedInRegion(Blocks, Info.LifeStart); |
481 | Info.HoistLifeEnd = !definedInRegion(Blocks, Info.LifeEnd); |
482 | |
483 | if ((Info.SinkLifeStart || Info.HoistLifeEnd) && |
484 | !isLegalToShrinkwrapLifetimeMarkers(CEAC, Addr)) |
485 | return {}; |
486 | |
487 | |
488 | if (Info.HoistLifeEnd && !ExitBlock) |
489 | return {}; |
490 | |
491 | return Info; |
492 | } |
493 | |
494 | void CodeExtractor::findAllocas(const CodeExtractorAnalysisCache &CEAC, |
495 | ValueSet &SinkCands, ValueSet &HoistCands, |
496 | BasicBlock *&ExitBlock) const { |
497 | Function *Func = (*Blocks.begin())->getParent(); |
498 | ExitBlock = getCommonExitBlock(Blocks); |
499 | |
500 | auto moveOrIgnoreLifetimeMarkers = |
501 | [&](const LifetimeMarkerInfo &LMI) -> bool { |
502 | if (!LMI.LifeStart) |
503 | return false; |
504 | if (LMI.SinkLifeStart) { |
505 | LLVM_DEBUG(dbgs() << "Sinking lifetime.start: " << *LMI.LifeStart |
506 | << "\n"); |
507 | SinkCands.insert(LMI.LifeStart); |
508 | } |
509 | if (LMI.HoistLifeEnd) { |
510 | LLVM_DEBUG(dbgs() << "Hoisting lifetime.end: " << *LMI.LifeEnd << "\n"); |
511 | HoistCands.insert(LMI.LifeEnd); |
512 | } |
513 | return true; |
514 | }; |
515 | |
516 | |
517 | |
518 | for (AllocaInst *AI : CEAC.getAllocas()) { |
519 | BasicBlock *BB = AI->getParent(); |
520 | if (Blocks.count(BB)) |
521 | continue; |
522 | |
523 | |
524 | |
525 | Function *AIFunc = BB->getParent(); |
526 | if (AIFunc != Func) |
527 | continue; |
528 | |
529 | LifetimeMarkerInfo MarkerInfo = getLifetimeMarkers(CEAC, AI, ExitBlock); |
530 | bool Moved = moveOrIgnoreLifetimeMarkers(MarkerInfo); |
531 | if (Moved) { |
532 | LLVM_DEBUG(dbgs() << "Sinking alloca: " << *AI << "\n"); |
533 | SinkCands.insert(AI); |
534 | continue; |
535 | } |
536 | |
537 | |
538 | |
539 | |
540 | |
541 | SmallVector<Instruction *, 2> LifetimeBitcastUsers; |
542 | for (User *U : AI->users()) { |
543 | if (!definedInRegion(Blocks, U)) |
544 | continue; |
545 | |
546 | if (U->stripInBoundsConstantOffsets() != AI) |
547 | continue; |
548 | |
549 | Instruction *Bitcast = cast<Instruction>(U); |
550 | for (User *BU : Bitcast->users()) { |
551 | IntrinsicInst *IntrInst = dyn_cast<IntrinsicInst>(BU); |
552 | if (!IntrInst) |
553 | continue; |
554 | |
555 | if (!IntrInst->isLifetimeStartOrEnd()) |
556 | continue; |
557 | |
558 | if (definedInRegion(Blocks, IntrInst)) |
559 | continue; |
560 | |
561 | LLVM_DEBUG(dbgs() << "Replace use of extracted region bitcast" |
562 | << *Bitcast << " in out-of-region lifetime marker " |
563 | << *IntrInst << "\n"); |
564 | LifetimeBitcastUsers.push_back(IntrInst); |
565 | } |
566 | } |
567 | |
568 | for (Instruction *I : LifetimeBitcastUsers) { |
569 | Module *M = AIFunc->getParent(); |
570 | LLVMContext &Ctx = M->getContext(); |
571 | auto *Int8PtrTy = Type::getInt8PtrTy(Ctx); |
572 | CastInst *CastI = |
573 | CastInst::CreatePointerCast(AI, Int8PtrTy, "lt.cast", I); |
574 | I->replaceUsesOfWith(I->getOperand(1), CastI); |
575 | } |
576 | |
577 | |
578 | SmallVector<Instruction *, 2> Bitcasts; |
579 | SmallVector<LifetimeMarkerInfo, 2> BitcastLifetimeInfo; |
580 | for (User *U : AI->users()) { |
581 | if (U->stripInBoundsConstantOffsets() == AI) { |
582 | Instruction *Bitcast = cast<Instruction>(U); |
583 | LifetimeMarkerInfo LMI = getLifetimeMarkers(CEAC, Bitcast, ExitBlock); |
584 | if (LMI.LifeStart) { |
585 | Bitcasts.push_back(Bitcast); |
586 | BitcastLifetimeInfo.push_back(LMI); |
587 | continue; |
588 | } |
589 | } |
590 | |
591 | |
592 | if (!definedInRegion(Blocks, U)) { |
593 | Bitcasts.clear(); |
594 | break; |
595 | } |
596 | } |
597 | |
598 | |
599 | if (Bitcasts.empty()) |
600 | continue; |
601 | |
602 | LLVM_DEBUG(dbgs() << "Sinking alloca (via bitcast): " << *AI << "\n"); |
603 | SinkCands.insert(AI); |
604 | for (unsigned I = 0, E = Bitcasts.size(); I != E; ++I) { |
605 | Instruction *BitcastAddr = Bitcasts[I]; |
606 | const LifetimeMarkerInfo &LMI = BitcastLifetimeInfo[I]; |
607 | assert(LMI.LifeStart && |
608 | "Unsafe to sink bitcast without lifetime markers"); |
609 | moveOrIgnoreLifetimeMarkers(LMI); |
610 | if (!definedInRegion(Blocks, BitcastAddr)) { |
611 | LLVM_DEBUG(dbgs() << "Sinking bitcast-of-alloca: " << *BitcastAddr |
612 | << "\n"); |
613 | SinkCands.insert(BitcastAddr); |
614 | } |
615 | } |
616 | } |
617 | } |
618 | |
619 | bool CodeExtractor::isEligible() const { |
620 | if (Blocks.empty()) |
621 | return false; |
622 | BasicBlock *Header = *Blocks.begin(); |
623 | Function *F = Header->getParent(); |
624 | |
625 | |
626 | |
627 | if (AllowVarArgs && F->getFunctionType()->isVarArg()) { |
628 | auto containsVarArgIntrinsic = [](const Instruction &I) { |
629 | if (const CallInst *CI = dyn_cast<CallInst>(&I)) |
630 | if (const Function *Callee = CI->getCalledFunction()) |
631 | return Callee->getIntrinsicID() == Intrinsic::vastart || |
632 | Callee->getIntrinsicID() == Intrinsic::vaend; |
633 | return false; |
634 | }; |
635 | |
636 | for (auto &BB : *F) { |
637 | if (Blocks.count(&BB)) |
638 | continue; |
639 | if (llvm::any_of(BB, containsVarArgIntrinsic)) |
640 | return false; |
641 | } |
642 | } |
643 | return true; |
644 | } |
645 | |
646 | void CodeExtractor::findInputsOutputs(ValueSet &Inputs, ValueSet &Outputs, |
647 | const ValueSet &SinkCands) const { |
648 | for (BasicBlock *BB : Blocks) { |
649 | |
650 | |
651 | for (Instruction &II : *BB) { |
652 | for (auto &OI : II.operands()) { |
653 | Value *V = OI; |
654 | if (!SinkCands.count(V) && definedInCaller(Blocks, V)) |
655 | Inputs.insert(V); |
656 | } |
657 | |
658 | for (User *U : II.users()) |
659 | if (!definedInRegion(Blocks, U)) { |
660 | Outputs.insert(&II); |
661 | break; |
662 | } |
663 | } |
664 | } |
665 | } |
666 | |
667 | |
668 | |
669 | |
670 | void CodeExtractor::severSplitPHINodesOfEntry(BasicBlock *&Header) { |
671 | unsigned NumPredsFromRegion = 0; |
672 | unsigned NumPredsOutsideRegion = 0; |
673 | |
674 | if (Header != &Header->getParent()->getEntryBlock()) { |
675 | PHINode *PN = dyn_cast<PHINode>(Header->begin()); |
676 | if (!PN) return; |
677 | |
678 | |
679 | |
680 | |
681 | for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) |
682 | if (Blocks.count(PN->getIncomingBlock(i))) |
683 | ++NumPredsFromRegion; |
684 | else |
685 | ++NumPredsOutsideRegion; |
686 | |
687 | |
688 | |
689 | if (NumPredsOutsideRegion <= 1) return; |
690 | } |
691 | |
692 | |
693 | |
694 | |
695 | |
696 | BasicBlock *NewBB = SplitBlock(Header, Header->getFirstNonPHI(), DT); |
697 | |
698 | |
699 | |
700 | BasicBlock *OldPred = Header; |
701 | Blocks.remove(OldPred); |
702 | Blocks.insert(NewBB); |
703 | Header = NewBB; |
704 | |
705 | |
706 | |
707 | if (NumPredsFromRegion) { |
708 | PHINode *PN = cast<PHINode>(OldPred->begin()); |
709 | |
710 | |
711 | for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) |
712 | if (Blocks.count(PN->getIncomingBlock(i))) { |
713 | Instruction *TI = PN->getIncomingBlock(i)->getTerminator(); |
714 | TI->replaceUsesOfWith(OldPred, NewBB); |
715 | } |
716 | |
717 | |
718 | |
719 | BasicBlock::iterator AfterPHIs; |
720 | for (AfterPHIs = OldPred->begin(); isa<PHINode>(AfterPHIs); ++AfterPHIs) { |
721 | PHINode *PN = cast<PHINode>(AfterPHIs); |
722 | |
723 | |
724 | PHINode *NewPN = PHINode::Create(PN->getType(), 1 + NumPredsFromRegion, |
725 | PN->getName() + ".ce", &NewBB->front()); |
726 | PN->replaceAllUsesWith(NewPN); |
727 | NewPN->addIncoming(PN, OldPred); |
728 | |
729 | |
730 | |
731 | for (unsigned i = 0; i != PN->getNumIncomingValues(); ++i) { |
732 | if (Blocks.count(PN->getIncomingBlock(i))) { |
733 | NewPN->addIncoming(PN->getIncomingValue(i), PN->getIncomingBlock(i)); |
734 | PN->removeIncomingValue(i); |
735 | --i; |
736 | } |
737 | } |
738 | } |
739 | } |
740 | } |
741 | |
742 | |
743 | |
744 | |
745 | |
746 | void CodeExtractor::severSplitPHINodesOfExits( |
747 | const SmallPtrSetImpl<BasicBlock *> &Exits) { |
748 | for (BasicBlock *ExitBB : Exits) { |
749 | BasicBlock *NewBB = nullptr; |
750 | |
751 | for (PHINode &PN : ExitBB->phis()) { |
752 | |
753 | SmallVector<unsigned, 2> IncomingVals; |
754 | for (unsigned i = 0; i < PN.getNumIncomingValues(); ++i) |
755 | if (Blocks.count(PN.getIncomingBlock(i))) |
756 | IncomingVals.push_back(i); |
757 | |
758 | |
759 | |
760 | |
761 | if (IncomingVals.size() <= 1) |
762 | continue; |
763 | |
764 | |
765 | |
766 | if (!NewBB) { |
767 | NewBB = BasicBlock::Create(ExitBB->getContext(), |
768 | ExitBB->getName() + ".split", |
769 | ExitBB->getParent(), ExitBB); |
770 | SmallVector<BasicBlock *, 4> Preds(predecessors(ExitBB)); |
771 | for (BasicBlock *PredBB : Preds) |
772 | if (Blocks.count(PredBB)) |
773 | PredBB->getTerminator()->replaceUsesOfWith(ExitBB, NewBB); |
774 | BranchInst::Create(ExitBB, NewBB); |
775 | Blocks.insert(NewBB); |
776 | } |
777 | |
778 | |
779 | PHINode *NewPN = |
780 | PHINode::Create(PN.getType(), IncomingVals.size(), |
781 | PN.getName() + ".ce", NewBB->getFirstNonPHI()); |
782 | for (unsigned i : IncomingVals) |
783 | NewPN->addIncoming(PN.getIncomingValue(i), PN.getIncomingBlock(i)); |
784 | for (unsigned i : reverse(IncomingVals)) |
785 | PN.removeIncomingValue(i, false); |
786 | PN.addIncoming(NewPN, NewBB); |
787 | } |
788 | } |
789 | } |
790 | |
791 | void CodeExtractor::splitReturnBlocks() { |
792 | for (BasicBlock *Block : Blocks) |
793 | if (ReturnInst *RI = dyn_cast<ReturnInst>(Block->getTerminator())) { |
794 | BasicBlock *New = |
795 | Block->splitBasicBlock(RI->getIterator(), Block->getName() + ".ret"); |
796 | if (DT) { |
797 | |
798 | |
799 | DomTreeNode *OldNode = DT->getNode(Block); |
800 | SmallVector<DomTreeNode *, 8> Children(OldNode->begin(), |
801 | OldNode->end()); |
802 | |
803 | DomTreeNode *NewNode = DT->addNewBlock(New, Block); |
804 | |
805 | for (DomTreeNode *I : Children) |
806 | DT->changeImmediateDominator(I, NewNode); |
807 | } |
808 | } |
809 | } |
810 | |
811 | |
812 | |
813 | Function *CodeExtractor::constructFunction(const ValueSet &inputs, |
814 | const ValueSet &outputs, |
815 | BasicBlock *header, |
816 | BasicBlock *newRootNode, |
817 | BasicBlock *newHeader, |
818 | Function *oldFunction, |
819 | Module *M) { |
820 | LLVM_DEBUG(dbgs() << "inputs: " << inputs.size() << "\n"); |
| 1 | Loop condition is false. Exiting loop | |
|
821 | LLVM_DEBUG(dbgs() << "outputs: " << outputs.size() << "\n"); |
| 2 | | Loop condition is false. Exiting loop | |
|
822 | |
823 | |
824 | switch (NumExitBlocks) { |
| 3 | | Control jumps to the 'default' case at line 828 | |
|
825 | case 0: |
826 | case 1: RetTy = Type::getVoidTy(header->getContext()); break; |
827 | case 2: RetTy = Type::getInt1Ty(header->getContext()); break; |
828 | default: RetTy = Type::getInt16Ty(header->getContext()); break; |
| 4 | | Execution continues on line 831 | |
|
829 | } |
830 | |
831 | std::vector<Type *> paramTy; |
832 | |
833 | |
834 | for (Value *value : inputs) { |
835 | LLVM_DEBUG(dbgs() << "value used in func: " << *value << "\n"); |
836 | paramTy.push_back(value->getType()); |
837 | } |
838 | |
839 | |
840 | for (Value *output : outputs) { |
841 | LLVM_DEBUG(dbgs() << "instr used in func: " << *output << "\n"); |
| 5 | | Loop condition is false. Exiting loop | |
|
842 | if (AggregateArgs) |
| 6 | | Assuming field 'AggregateArgs' is true | |
|
| |
843 | paramTy.push_back(output->getType()); |
844 | else |
845 | paramTy.push_back(PointerType::getUnqual(output->getType())); |
846 | } |
847 | |
848 | LLVM_DEBUG({ |
| 8 | | Loop condition is false. Exiting loop | |
|
849 | dbgs() << "Function type: " << *RetTy << " f("; |
850 | for (Type *i : paramTy) |
851 | dbgs() << *i << ", "; |
852 | dbgs() << ")\n"; |
853 | }); |
854 | |
855 | StructType *StructTy = nullptr; |
| 9 | | 'StructTy' initialized to a null pointer value | |
|
856 | if (AggregateArgs && (inputs.size() + outputs.size() > 0)) { |
| 10 | | Assuming the condition is false | |
|
| |
857 | StructTy = StructType::get(M->getContext(), paramTy); |
858 | paramTy.clear(); |
859 | paramTy.push_back(PointerType::getUnqual(StructTy)); |
860 | } |
861 | FunctionType *funcType = |
862 | FunctionType::get(RetTy, paramTy, |
863 | AllowVarArgs && oldFunction->isVarArg()); |
| 12 | | Assuming field 'AllowVarArgs' is false | |
|
864 | |
865 | std::string SuffixToUse = |
866 | Suffix.empty() |
| 13 | | Assuming the condition is true | |
|
| |
867 | ? (header->getName().empty() ? "extracted" : header->getName().str()) |
| 15 | | Assuming the condition is false | |
|
| |
868 | : Suffix; |
869 | |
870 | Function *newFunction = Function::Create( |
871 | funcType, GlobalValue::InternalLinkage, oldFunction->getAddressSpace(), |
872 | oldFunction->getName() + "." + SuffixToUse, M); |
873 | |
874 | if (oldFunction->doesNotThrow()) |
| 17 | | Assuming the condition is false | |
|
| |
875 | newFunction->setDoesNotThrow(); |
876 | |
877 | |
878 | if (oldFunction->hasUWTable()) |
| 19 | | Assuming the condition is false | |
|
| |
879 | newFunction->setHasUWTable(); |
880 | |
881 | |
882 | |
883 | |
884 | |
885 | |
886 | |
887 | |
888 | for (const auto &Attr : oldFunction->getAttributes().getFnAttributes()) { |
| 21 | | Assuming '__begin1' is equal to '__end1' | |
|
889 | if (Attr.isStringAttribute()) { |
890 | if (Attr.getKindAsString() == "thunk") |
891 | continue; |
892 | } else |
893 | switch (Attr.getKindAsEnum()) { |
894 | |
895 | |
896 | |
897 | case Attribute::Alignment: |
898 | case Attribute::AllocSize: |
899 | case Attribute::ArgMemOnly: |
900 | case Attribute::Builtin: |
901 | case Attribute::ByVal: |
902 | case Attribute::Convergent: |
903 | case Attribute::Dereferenceable: |
904 | case Attribute::DereferenceableOrNull: |
905 | case Attribute::ElementType: |
906 | case Attribute::InAlloca: |
907 | case Attribute::InReg: |
908 | case Attribute::InaccessibleMemOnly: |
909 | case Attribute::InaccessibleMemOrArgMemOnly: |
910 | case Attribute::JumpTable: |
911 | case Attribute::Naked: |
912 | case Attribute::Nest: |
913 | case Attribute::NoAlias: |
914 | case Attribute::NoBuiltin: |
915 | case Attribute::NoCapture: |
916 | case Attribute::NoMerge: |
917 | case Attribute::NoReturn: |
918 | case Attribute::NoSync: |
919 | case Attribute::NoUndef: |
920 | case Attribute::None: |
921 | case Attribute::NonNull: |
922 | case Attribute::Preallocated: |
923 | case Attribute::ReadNone: |
924 | case Attribute::ReadOnly: |
925 | case Attribute::Returned: |
926 | case Attribute::ReturnsTwice: |
927 | case Attribute::SExt: |
928 | case Attribute::Speculatable: |
929 | case Attribute::StackAlignment: |
930 | case Attribute::StructRet: |
931 | case Attribute::SwiftError: |
932 | case Attribute::SwiftSelf: |
933 | case Attribute::SwiftAsync: |
934 | case Attribute::WillReturn: |
935 | case Attribute::WriteOnly: |
936 | case Attribute::ZExt: |
937 | case Attribute::ImmArg: |
938 | case Attribute::ByRef: |
939 | case Attribute::EndAttrKinds: |
940 | case Attribute::EmptyKey: |
941 | case Attribute::TombstoneKey: |
942 | continue; |
943 | |
944 | case Attribute::AlwaysInline: |
945 | case Attribute::Cold: |
946 | case Attribute::Hot: |
947 | case Attribute::NoRecurse: |
948 | case Attribute::InlineHint: |
949 | case Attribute::MinSize: |
950 | case Attribute::NoCallback: |
951 | case Attribute::NoDuplicate: |
952 | case Attribute::NoFree: |
953 | case Attribute::NoImplicitFloat: |
954 | case Attribute::NoInline: |
955 | case Attribute::NonLazyBind: |
956 | case Attribute::NoRedZone: |
957 | case Attribute::NoUnwind: |
958 | case Attribute::NoSanitizeCoverage: |
959 | case Attribute::NullPointerIsValid: |
960 | case Attribute::OptForFuzzing: |
961 | case Attribute::OptimizeNone: |
962 | case Attribute::OptimizeForSize: |
963 | case Attribute::SafeStack: |
964 | case Attribute::ShadowCallStack: |
965 | case Attribute::SanitizeAddress: |
966 | case Attribute::SanitizeMemory: |
967 | case Attribute::SanitizeThread: |
968 | case Attribute::SanitizeHWAddress: |
969 | case Attribute::SanitizeMemTag: |
970 | case Attribute::SpeculativeLoadHardening: |
971 | case Attribute::StackProtect: |
972 | case Attribute::StackProtectReq: |
973 | case Attribute::StackProtectStrong: |
974 | case Attribute::StrictFP: |
975 | case Attribute::UWTable: |
976 | case Attribute::VScaleRange: |
977 | case Attribute::NoCfCheck: |
978 | case Attribute::MustProgress: |
979 | case Attribute::NoProfile: |
980 | break; |
981 | } |
982 | |
983 | newFunction->addFnAttr(Attr); |
984 | } |
985 | newFunction->getBasicBlockList().push_back(newRootNode); |
986 | |
987 | |
988 | Function::arg_iterator AI = newFunction->arg_begin(); |
989 | |
990 | |
991 | |
992 | for (unsigned i = 0, e = inputs.size(); i != e; ++i) { |
| 22 | | Assuming 'i' is not equal to 'e' | |
|
| 23 | | Loop condition is true. Entering loop body | |
|
993 | Value *RewriteVal; |
994 | if (AggregateArgs) { |
| |
995 | Value *Idx[2]; |
996 | Idx[0] = Constant::getNullValue(Type::getInt32Ty(header->getContext())); |
997 | Idx[1] = ConstantInt::get(Type::getInt32Ty(header->getContext()), i); |
998 | Instruction *TI = newFunction->begin()->getTerminator(); |
999 | GetElementPtrInst *GEP = GetElementPtrInst::Create( |
1000 | StructTy, &*AI, Idx, "gep_" + inputs[i]->getName(), TI); |
1001 | RewriteVal = new LoadInst(StructTy->getElementType(i), GEP, |
| 25 | | Called C++ object pointer is null |
|
1002 | "loadgep_" + inputs[i]->getName(), TI); |
1003 | } else |
1004 | RewriteVal = &*AI++; |
1005 | |
1006 | std::vector<User *> Users(inputs[i]->user_begin(), inputs[i]->user_end()); |
1007 | for (User *use : Users) |
1008 | if (Instruction *inst = dyn_cast<Instruction>(use)) |
1009 | if (Blocks.count(inst->getParent())) |
1010 | inst->replaceUsesOfWith(inputs[i], RewriteVal); |
1011 | } |
1012 | |
1013 | |
1014 | if (!AggregateArgs) { |
1015 | AI = newFunction->arg_begin(); |
1016 | for (unsigned i = 0, e = inputs.size(); i != e; ++i, ++AI) |
1017 | AI->setName(inputs[i]->getName()); |
1018 | for (unsigned i = 0, e = outputs.size(); i != e; ++i, ++AI) |
1019 | AI->setName(outputs[i]->getName()+".out"); |
1020 | } |
1021 | |
1022 | |
1023 | |
1024 | |
1025 | std::vector<User *> Users(header->user_begin(), header->user_end()); |
1026 | for (auto &U : Users) |
1027 | |
1028 | |
1029 | if (Instruction *I = dyn_cast<Instruction>(U)) |
1030 | if (I->isTerminator() && I->getFunction() == oldFunction && |
1031 | !Blocks.count(I->getParent())) |
1032 | I->replaceUsesOfWith(header, newHeader); |
1033 | |
1034 | return newFunction; |
1035 | } |
1036 | |
1037 | |
1038 | |
1039 | |
1040 | |
1041 | |
1042 | |
1043 | static void eraseLifetimeMarkersOnInputs(const SetVector<BasicBlock *> &Blocks, |
1044 | const SetVector<Value *> &SunkAllocas, |
1045 | SetVector<Value *> &LifetimesStart) { |
1046 | for (BasicBlock *BB : Blocks) { |
1047 | for (auto It = BB->begin(), End = BB->end(); It != End;) { |
1048 | auto *II = dyn_cast<IntrinsicInst>(&*It); |
1049 | ++It; |
1050 | if (!II || !II->isLifetimeStartOrEnd()) |
1051 | continue; |
1052 | |
1053 | |
1054 | |
1055 | |
1056 | Value *Mem = II->getOperand(1)->stripInBoundsOffsets(); |
1057 | if (SunkAllocas.count(Mem) || definedInRegion(Blocks, Mem)) |
1058 | continue; |
1059 | |
1060 | if (II->getIntrinsicID() == Intrinsic::lifetime_start) |
1061 | LifetimesStart.insert(Mem); |
1062 | II->eraseFromParent(); |
1063 | } |
1064 | } |
1065 | } |
1066 | |
1067 | |
1068 | |
1069 | static void insertLifetimeMarkersSurroundingCall( |
1070 | Module *M, ArrayRef<Value *> LifetimesStart, ArrayRef<Value *> LifetimesEnd, |
1071 | CallInst *TheCall) { |
1072 | LLVMContext &Ctx = M->getContext(); |
1073 | auto Int8PtrTy = Type::getInt8PtrTy(Ctx); |
1074 | auto NegativeOne = ConstantInt::getSigned(Type::getInt64Ty(Ctx), -1); |
1075 | Instruction *Term = TheCall->getParent()->getTerminator(); |
1076 | |
1077 | |
1078 | |
1079 | DenseMap<Value *, Value *> Bitcasts; |
1080 | |
1081 | |
1082 | |
1083 | auto insertMarkers = [&](Function *MarkerFunc, ArrayRef<Value *> Objects, |
1084 | bool InsertBefore) { |
1085 | for (Value *Mem : Objects) { |
1086 | assert((!isa<Instruction>(Mem) || cast<Instruction>(Mem)->getFunction() == |
1087 | TheCall->getFunction()) && |
1088 | "Input memory not defined in original function"); |
1089 | Value *&MemAsI8Ptr = Bitcasts[Mem]; |
1090 | if (!MemAsI8Ptr) { |
1091 | if (Mem->getType() == Int8PtrTy) |
1092 | MemAsI8Ptr = Mem; |
1093 | else |
1094 | MemAsI8Ptr = |
1095 | CastInst::CreatePointerCast(Mem, Int8PtrTy, "lt.cast", TheCall); |
1096 | } |
1097 | |
1098 | auto Marker = CallInst::Create(MarkerFunc, {NegativeOne, MemAsI8Ptr}); |
1099 | if (InsertBefore) |
1100 | Marker->insertBefore(TheCall); |
1101 | else |
1102 | Marker->insertBefore(Term); |
1103 | } |
1104 | }; |
1105 | |
1106 | if (!LifetimesStart.empty()) { |
1107 | auto StartFn = llvm::Intrinsic::getDeclaration( |
1108 | M, llvm::Intrinsic::lifetime_start, Int8PtrTy); |
1109 | insertMarkers(StartFn, LifetimesStart, true); |
1110 | } |
1111 | |
1112 | if (!LifetimesEnd.empty()) { |
1113 | auto EndFn = llvm::Intrinsic::getDeclaration( |
1114 | M, llvm::Intrinsic::lifetime_end, Int8PtrTy); |
1115 | insertMarkers(EndFn, LifetimesEnd, false); |
1116 | } |
1117 | } |
1118 | |
1119 | |
1120 | |
1121 | |
1122 | CallInst *CodeExtractor::emitCallAndSwitchStatement(Function *newFunction, |
1123 | BasicBlock *codeReplacer, |
1124 | ValueSet &inputs, |
1125 | ValueSet &outputs) { |
1126 | |
1127 | |
1128 | std::vector<Value *> params, StructValues, ReloadOutputs, Reloads; |
1129 | |
1130 | Module *M = newFunction->getParent(); |
1131 | LLVMContext &Context = M->getContext(); |
1132 | const DataLayout &DL = M->getDataLayout(); |
1133 | CallInst *call = nullptr; |
1134 | |
1135 | |
1136 | unsigned ArgNo = 0; |
1137 | SmallVector<unsigned, 1> SwiftErrorArgs; |
1138 | for (Value *input : inputs) { |
1139 | if (AggregateArgs) |
1140 | StructValues.push_back(input); |
1141 | else { |
1142 | params.push_back(input); |
1143 | if (input->isSwiftError()) |
1144 | SwiftErrorArgs.push_back(ArgNo); |
1145 | } |
1146 | ++ArgNo; |
1147 | } |
1148 | |
1149 | |
1150 | for (Value *output : outputs) { |
1151 | if (AggregateArgs) { |
1152 | StructValues.push_back(output); |
1153 | } else { |
1154 | AllocaInst *alloca = |
1155 | new AllocaInst(output->getType(), DL.getAllocaAddrSpace(), |
1156 | nullptr, output->getName() + ".loc", |
1157 | &codeReplacer->getParent()->front().front()); |
1158 | ReloadOutputs.push_back(alloca); |
1159 | params.push_back(alloca); |
1160 | } |
1161 | } |
1162 | |
1163 | StructType *StructArgTy = nullptr; |
1164 | AllocaInst *Struct = nullptr; |
1165 | if (AggregateArgs && (inputs.size() + outputs.size() > 0)) { |
1166 | std::vector<Type *> ArgTypes; |
1167 | for (Value *V : StructValues) |
1168 | ArgTypes.push_back(V->getType()); |
1169 | |
1170 | |
1171 | StructArgTy = StructType::get(newFunction->getContext(), ArgTypes); |
1172 | Struct = new AllocaInst(StructArgTy, DL.getAllocaAddrSpace(), nullptr, |
1173 | "structArg", |
1174 | &codeReplacer->getParent()->front().front()); |
1175 | params.push_back(Struct); |
1176 | |
1177 | for (unsigned i = 0, e = inputs.size(); i != e; ++i) { |
1178 | Value *Idx[2]; |
1179 | Idx[0] = Constant::getNullValue(Type::getInt32Ty(Context)); |
1180 | Idx[1] = ConstantInt::get(Type::getInt32Ty(Context), i); |
1181 | GetElementPtrInst *GEP = GetElementPtrInst::Create( |
1182 | StructArgTy, Struct, Idx, "gep_" + StructValues[i]->getName()); |
1183 | codeReplacer->getInstList().push_back(GEP); |
1184 | new StoreInst(StructValues[i], GEP, codeReplacer); |
1185 | } |
1186 | } |
1187 | |
1188 | |
1189 | call = CallInst::Create(newFunction, params, |
1190 | NumExitBlocks > 1 ? "targetBlock" : ""); |
1191 | |
1192 | |
1193 | |
1194 | |
1195 | if (codeReplacer->getParent()->getSubprogram()) { |
1196 | if (auto DL = newFunction->getEntryBlock().getTerminator()->getDebugLoc()) |
1197 | call->setDebugLoc(DL); |
1198 | } |
1199 | codeReplacer->getInstList().push_back(call); |
1200 | |
1201 | |
1202 | for (unsigned SwiftErrArgNo : SwiftErrorArgs) { |
1203 | call->addParamAttr(SwiftErrArgNo, Attribute::SwiftError); |
1204 | newFunction->addParamAttr(SwiftErrArgNo, Attribute::SwiftError); |
1205 | } |
1206 | |
1207 | Function::arg_iterator OutputArgBegin = newFunction->arg_begin(); |
1208 | unsigned FirstOut = inputs.size(); |
1209 | if (!AggregateArgs) |
1210 | std::advance(OutputArgBegin, inputs.size()); |
1211 | |
1212 | |
1213 | for (unsigned i = 0, e = outputs.size(); i != e; ++i) { |
1214 | Value *Output = nullptr; |
1215 | if (AggregateArgs) { |
1216 | Value *Idx[2]; |
1217 | Idx[0] = Constant::getNullValue(Type::getInt32Ty(Context)); |
1218 | Idx[1] = ConstantInt::get(Type::getInt32Ty(Context), FirstOut + i); |
1219 | GetElementPtrInst *GEP = GetElementPtrInst::Create( |
1220 | StructArgTy, Struct, Idx, "gep_reload_" + outputs[i]->getName()); |
1221 | codeReplacer->getInstList().push_back(GEP); |
1222 | Output = GEP; |
1223 | } else { |
1224 | Output = ReloadOutputs[i]; |
1225 | } |
1226 | LoadInst *load = new LoadInst(outputs[i]->getType(), Output, |
1227 | outputs[i]->getName() + ".reload", |
1228 | codeReplacer); |
1229 | Reloads.push_back(load); |
1230 | std::vector<User *> Users(outputs[i]->user_begin(), outputs[i]->user_end()); |
1231 | for (unsigned u = 0, e = Users.size(); u != e; ++u) { |
1232 | Instruction *inst = cast<Instruction>(Users[u]); |
1233 | if (!Blocks.count(inst->getParent())) |
1234 | inst->replaceUsesOfWith(outputs[i], load); |
1235 | } |
1236 | } |
1237 | |
1238 | |
1239 | SwitchInst *TheSwitch = |
1240 | SwitchInst::Create(Constant::getNullValue(Type::getInt16Ty(Context)), |
1241 | codeReplacer, 0, codeReplacer); |
1242 | |
1243 | |
1244 | |
1245 | |
1246 | |
1247 | |
1248 | std::map<BasicBlock *, BasicBlock *> ExitBlockMap; |
1249 | |
1250 | unsigned switchVal = 0; |
1251 | for (BasicBlock *Block : Blocks) { |
1252 | Instruction *TI = Block->getTerminator(); |
1253 | for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) |
1254 | if (!Blocks.count(TI->getSuccessor(i))) { |
1255 | BasicBlock *OldTarget = TI->getSuccessor(i); |
1256 | |
1257 | BasicBlock *&NewTarget = ExitBlockMap[OldTarget]; |
1258 | if (!NewTarget) { |
1259 | |
1260 | |
1261 | NewTarget = BasicBlock::Create(Context, |
1262 | OldTarget->getName() + ".exitStub", |
1263 | newFunction); |
1264 | unsigned SuccNum = switchVal++; |
1265 | |
1266 | Value *brVal = nullptr; |
1267 | switch (NumExitBlocks) { |
1268 | case 0: |
1269 | case 1: break; |
1270 | case 2: |
1271 | brVal = ConstantInt::get(Type::getInt1Ty(Context), !SuccNum); |
1272 | break; |
1273 | default: |
1274 | brVal = ConstantInt::get(Type::getInt16Ty(Context), SuccNum); |
1275 | break; |
1276 | } |
1277 | |
1278 | ReturnInst::Create(Context, brVal, NewTarget); |
1279 | |
1280 | |
1281 | TheSwitch->addCase(ConstantInt::get(Type::getInt16Ty(Context), |
1282 | SuccNum), |
1283 | OldTarget); |
1284 | } |
1285 | |
1286 | |
1287 | TI->setSuccessor(i, NewTarget); |
1288 | } |
1289 | } |
1290 | |
1291 | |
1292 | |
1293 | |
1294 | Function::arg_iterator OAI = OutputArgBegin; |
1295 | for (unsigned i = 0, e = outputs.size(); i != e; ++i) { |
1296 | auto *OutI = dyn_cast<Instruction>(outputs[i]); |
1297 | if (!OutI) |
1298 | continue; |
1299 | |
1300 | |
1301 | BasicBlock::iterator InsertPt; |
1302 | |
1303 | |
1304 | if (auto *InvokeI = dyn_cast<InvokeInst>(OutI)) |
1305 | InsertPt = InvokeI->getNormalDest()->getFirstInsertionPt(); |
1306 | else if (auto *Phi = dyn_cast<PHINode>(OutI)) |
1307 | InsertPt = Phi->getParent()->getFirstInsertionPt(); |
1308 | else |
1309 | InsertPt = std::next(OutI->getIterator()); |
1310 | |
1311 | Instruction *InsertBefore = &*InsertPt; |
1312 | assert((InsertBefore->getFunction() == newFunction || |
1313 | Blocks.count(InsertBefore->getParent())) && |
1314 | "InsertPt should be in new function"); |
1315 | assert(OAI != newFunction->arg_end() && |
1316 | "Number of output arguments should match " |
1317 | "the amount of defined values"); |
1318 | if (AggregateArgs) { |
1319 | Value *Idx[2]; |
1320 | Idx[0] = Constant::getNullValue(Type::getInt32Ty(Context)); |
1321 | Idx[1] = ConstantInt::get(Type::getInt32Ty(Context), FirstOut + i); |
1322 | GetElementPtrInst *GEP = GetElementPtrInst::Create( |
1323 | StructArgTy, &*OAI, Idx, "gep_" + outputs[i]->getName(), |
1324 | InsertBefore); |
1325 | new StoreInst(outputs[i], GEP, InsertBefore); |
1326 | |
1327 | |
1328 | |
1329 | } else { |
1330 | new StoreInst(outputs[i], &*OAI, InsertBefore); |
1331 | ++OAI; |
1332 | } |
1333 | } |
1334 | |
1335 | |
1336 | Type *OldFnRetTy = TheSwitch->getParent()->getParent()->getReturnType(); |
1337 | switch (NumExitBlocks) { |
1338 | case 0: |
1339 | |
1340 | |
1341 | |
1342 | |
1343 | |
1344 | if (OldFnRetTy->isVoidTy()) { |
1345 | ReturnInst::Create(Context, nullptr, TheSwitch); |
1346 | } else if (OldFnRetTy == TheSwitch->getCondition()->getType()) { |
1347 | |
1348 | ReturnInst::Create(Context, TheSwitch->getCondition(), TheSwitch); |
1349 | } else { |
1350 | |
1351 | |
1352 | ReturnInst::Create(Context, |
1353 | Constant::getNullValue(OldFnRetTy), TheSwitch); |
1354 | } |
1355 | |
1356 | TheSwitch->eraseFromParent(); |
1357 | break; |
1358 | case 1: |
1359 | |
1360 | |
1361 | BranchInst::Create(TheSwitch->getSuccessor(1), TheSwitch); |
1362 | TheSwitch->eraseFromParent(); |
1363 | break; |
1364 | case 2: |
1365 | BranchInst::Create(TheSwitch->getSuccessor(1), TheSwitch->getSuccessor(2), |
1366 | call, TheSwitch); |
1367 | TheSwitch->eraseFromParent(); |
1368 | break; |
1369 | default: |
1370 | |
1371 | |
1372 | TheSwitch->setCondition(call); |
1373 | TheSwitch->setDefaultDest(TheSwitch->getSuccessor(NumExitBlocks)); |
1374 | |
1375 | TheSwitch->removeCase(SwitchInst::CaseIt(TheSwitch, NumExitBlocks-1)); |
1376 | break; |
1377 | } |
1378 | |
1379 | |
1380 | |
1381 | insertLifetimeMarkersSurroundingCall(M, ReloadOutputs, ReloadOutputs, call); |
1382 | |
1383 | return call; |
1384 | } |
1385 | |
1386 | void CodeExtractor::moveCodeToFunction(Function *newFunction) { |
1387 | Function *oldFunc = (*Blocks.begin())->getParent(); |
1388 | Function::BasicBlockListType &oldBlocks = oldFunc->getBasicBlockList(); |
1389 | Function::BasicBlockListType &newBlocks = newFunction->getBasicBlockList(); |
1390 | |
1391 | for (BasicBlock *Block : Blocks) { |
1392 | |
1393 | oldBlocks.remove(Block); |
1394 | |
1395 | |
1396 | newBlocks.push_back(Block); |
1397 | } |
1398 | } |
1399 | |
1400 | void CodeExtractor::calculateNewCallTerminatorWeights( |
1401 | BasicBlock *CodeReplacer, |
1402 | DenseMap<BasicBlock *, BlockFrequency> &ExitWeights, |
1403 | BranchProbabilityInfo *BPI) { |
1404 | using Distribution = BlockFrequencyInfoImplBase::Distribution; |
1405 | using BlockNode = BlockFrequencyInfoImplBase::BlockNode; |
1406 | |
1407 | |
1408 | Instruction *TI = CodeReplacer->getTerminator(); |
1409 | SmallVector<unsigned, 8> BranchWeights(TI->getNumSuccessors(), 0); |
1410 | |
1411 | |
1412 | Distribution BranchDist; |
1413 | |
1414 | SmallVector<BranchProbability, 4> EdgeProbabilities( |
1415 | TI->getNumSuccessors(), BranchProbability::getUnknown()); |
1416 | |
1417 | |
1418 | for (unsigned i = 0, e = TI->getNumSuccessors(); i < e; ++i) { |
1419 | BlockNode ExitNode(i); |
1420 | uint64_t ExitFreq = ExitWeights[TI->getSuccessor(i)].getFrequency(); |
1421 | if (ExitFreq != 0) |
1422 | BranchDist.addExit(ExitNode, ExitFreq); |
1423 | else |
1424 | EdgeProbabilities[i] = BranchProbability::getZero(); |
1425 | } |
1426 | |
1427 | |
1428 | if (BranchDist.Total == 0) { |
1429 | BPI->setEdgeProbability(CodeReplacer, EdgeProbabilities); |
1430 | return; |
1431 | } |
1432 | |
1433 | |
1434 | BranchDist.normalize(); |
1435 | |
1436 | |
1437 | for (unsigned I = 0, E = BranchDist.Weights.size(); I < E; ++I) { |
1438 | const auto &Weight = BranchDist.Weights[I]; |
1439 | |
1440 | |
1441 | BranchWeights[Weight.TargetNode.Index] = Weight.Amount; |
1442 | BranchProbability BP(Weight.Amount, BranchDist.Total); |
1443 | EdgeProbabilities[Weight.TargetNode.Index] = BP; |
1444 | } |
1445 | BPI->setEdgeProbability(CodeReplacer, EdgeProbabilities); |
1446 | TI->setMetadata( |
1447 | LLVMContext::MD_prof, |
1448 | MDBuilder(TI->getContext()).createBranchWeights(BranchWeights)); |
1449 | } |
1450 | |
1451 | |
1452 | |
1453 | static void eraseDebugIntrinsicsWithNonLocalRefs(Function &F) { |
1454 | for (Instruction &I : instructions(F)) { |
1455 | SmallVector<DbgVariableIntrinsic *, 4> DbgUsers; |
1456 | findDbgUsers(DbgUsers, &I); |
1457 | for (DbgVariableIntrinsic *DVI : DbgUsers) |
1458 | if (DVI->getFunction() != &F) |
1459 | DVI->eraseFromParent(); |
1460 | } |
1461 | } |
1462 | |
1463 | |
1464 | |
1465 | |
1466 | static void fixupDebugInfoPostExtraction(Function &OldFunc, Function &NewFunc, |
1467 | CallInst &TheCall) { |
1468 | DISubprogram *OldSP = OldFunc.getSubprogram(); |
1469 | LLVMContext &Ctx = OldFunc.getContext(); |
1470 | |
1471 | if (!OldSP) { |
1472 | |
1473 | stripDebugInfo(NewFunc); |
1474 | |
1475 | eraseDebugIntrinsicsWithNonLocalRefs(NewFunc); |
1476 | return; |
1477 | } |
1478 | |
1479 | |
1480 | |
1481 | |
1482 | assert(OldSP->getUnit() && "Missing compile unit for subprogram"); |
1483 | DIBuilder DIB(*OldFunc.getParent(), false, |
1484 | OldSP->getUnit()); |
1485 | auto SPType = DIB.createSubroutineType(DIB.getOrCreateTypeArray(None)); |
1486 | DISubprogram::DISPFlags SPFlags = DISubprogram::SPFlagDefinition | |
1487 | DISubprogram::SPFlagOptimized | |
1488 | DISubprogram::SPFlagLocalToUnit; |
1489 | auto NewSP = DIB.createFunction( |
1490 | OldSP->getUnit(), NewFunc.getName(), NewFunc.getName(), OldSP->getFile(), |
1491 | 0, SPType, 0, DINode::FlagZero, SPFlags); |
1492 | NewFunc.setSubprogram(NewSP); |
1493 | |
1494 | |
1495 | |
1496 | |
1497 | |
1498 | |
1499 | |
1500 | SmallDenseMap<DINode *, DINode *> RemappedMetadata; |
1501 | SmallVector<Instruction *, 4> DebugIntrinsicsToDelete; |
1502 | for (Instruction &I : instructions(NewFunc)) { |
1503 | auto *DII = dyn_cast<DbgInfoIntrinsic>(&I); |
1504 | if (!DII) |
1505 | continue; |
1506 | |
1507 | |
1508 | if (auto *DLI = dyn_cast<DbgLabelInst>(&I)) { |
1509 | DILabel *OldLabel = DLI->getLabel(); |
1510 | DINode *&NewLabel = RemappedMetadata[OldLabel]; |
1511 | if (!NewLabel) |
1512 | NewLabel = DILabel::get(Ctx, NewSP, OldLabel->getName(), |
1513 | OldLabel->getFile(), OldLabel->getLine()); |
1514 | DLI->setArgOperand(0, MetadataAsValue::get(Ctx, NewLabel)); |
1515 | continue; |
1516 | } |
1517 | |
1518 | auto IsInvalidLocation = [&NewFunc](Value *Location) { |
1519 | |
1520 | |
1521 | if (!Location || |
1522 | (!isa<Constant>(Location) && !isa<Instruction>(Location))) |
1523 | return true; |
1524 | Instruction *LocationInst = dyn_cast<Instruction>(Location); |
1525 | return LocationInst && LocationInst->getFunction() != &NewFunc; |
1526 | }; |
1527 | |
1528 | auto *DVI = cast<DbgVariableIntrinsic>(DII); |
1529 | |
1530 | if (any_of(DVI->location_ops(), IsInvalidLocation)) { |
1531 | DebugIntrinsicsToDelete.push_back(DVI); |
1532 | continue; |
1533 | } |
1534 | |
1535 | |
1536 | DILocalVariable *OldVar = DVI->getVariable(); |
1537 | DINode *&NewVar = RemappedMetadata[OldVar]; |
1538 | if (!NewVar) |
1539 | NewVar = DIB.createAutoVariable( |
1540 | NewSP, OldVar->getName(), OldVar->getFile(), OldVar->getLine(), |
1541 | OldVar->getType(), false, DINode::FlagZero, |
1542 | OldVar->getAlignInBits()); |
1543 | DVI->setVariable(cast<DILocalVariable>(NewVar)); |
1544 | } |
1545 | for (auto *DII : DebugIntrinsicsToDelete) |
1546 | DII->eraseFromParent(); |
1547 | DIB.finalizeSubprogram(NewSP); |
1548 | |
1549 | |
1550 | |
1551 | for (Instruction &I : instructions(NewFunc)) { |
1552 | if (const DebugLoc &DL = I.getDebugLoc()) |
1553 | I.setDebugLoc(DILocation::get(Ctx, DL.getLine(), DL.getCol(), NewSP)); |
1554 | |
1555 | |
1556 | auto updateLoopInfoLoc = [&Ctx, NewSP](Metadata *MD) -> Metadata * { |
1557 | if (auto *Loc = dyn_cast_or_null<DILocation>(MD)) |
1558 | return DILocation::get(Ctx, Loc->getLine(), Loc->getColumn(), NewSP, |
1559 | nullptr); |
1560 | return MD; |
1561 | }; |
1562 | updateLoopMetadataDebugLocations(I, updateLoopInfoLoc); |
1563 | } |
1564 | if (!TheCall.getDebugLoc()) |
1565 | TheCall.setDebugLoc(DILocation::get(Ctx, 0, 0, OldSP)); |
1566 | |
1567 | eraseDebugIntrinsicsWithNonLocalRefs(NewFunc); |
1568 | } |
1569 | |
1570 | Function * |
1571 | CodeExtractor::extractCodeRegion(const CodeExtractorAnalysisCache &CEAC) { |
1572 | if (!isEligible()) |
1573 | return nullptr; |
1574 | |
1575 | |
1576 | |
1577 | BasicBlock *header = *Blocks.begin(); |
1578 | Function *oldFunction = header->getParent(); |
1579 | |
1580 | |
1581 | |
1582 | BlockFrequency EntryFreq; |
1583 | if (BFI) { |
1584 | assert(BPI && "Both BPI and BFI are required to preserve profile info"); |
1585 | for (BasicBlock *Pred : predecessors(header)) { |
1586 | if (Blocks.count(Pred)) |
1587 | continue; |
1588 | EntryFreq += |
1589 | BFI->getBlockFreq(Pred) * BPI->getEdgeProbability(Pred, header); |
1590 | } |
1591 | } |
1592 | |
1593 | |
1594 | |
1595 | for (BasicBlock *Block : Blocks) { |
1596 | for (auto It = Block->begin(), End = Block->end(); It != End;) { |
1597 | Instruction *I = &*It; |
1598 | ++It; |
1599 | |
1600 | if (auto *AI = dyn_cast<AssumeInst>(I)) { |
1601 | if (AC) |
1602 | AC->unregisterAssumption(AI); |
1603 | AI->eraseFromParent(); |
1604 | } |
1605 | } |
1606 | } |
1607 | |
1608 | |
1609 | |
1610 | splitReturnBlocks(); |
1611 | |
1612 | |
1613 | |
1614 | DenseMap<BasicBlock *, BlockFrequency> ExitWeights; |
1615 | SmallPtrSet<BasicBlock *, 1> ExitBlocks; |
1616 | for (BasicBlock *Block : Blocks) { |
1617 | for (BasicBlock *Succ : successors(Block)) { |
1618 | if (!Blocks.count(Succ)) { |
1619 | |
1620 | if (BFI) { |
1621 | BlockFrequency &BF = ExitWeights[Succ]; |
1622 | BF += BFI->getBlockFreq(Block) * BPI->getEdgeProbability(Block, Succ); |
1623 | } |
1624 | ExitBlocks.insert(Succ); |
1625 | } |
1626 | } |
1627 | } |
1628 | NumExitBlocks = ExitBlocks.size(); |
1629 | |
1630 | |
1631 | severSplitPHINodesOfEntry(header); |
1632 | severSplitPHINodesOfExits(ExitBlocks); |
1633 | |
1634 | |
1635 | BasicBlock *codeReplacer = BasicBlock::Create(header->getContext(), |
1636 | "codeRepl", oldFunction, |
1637 | header); |
1638 | |
1639 | |
1640 | |
1641 | BasicBlock *newFuncRoot = BasicBlock::Create(header->getContext(), |
1642 | "newFuncRoot"); |
1643 | auto *BranchI = BranchInst::Create(header); |
1644 | |
1645 | |
1646 | |
1647 | |
1648 | if (oldFunction->getSubprogram()) { |
1649 | any_of(Blocks, [&BranchI](const BasicBlock *BB) { |
1650 | return any_of(*BB, [&BranchI](const Instruction &I) { |
1651 | if (!I.getDebugLoc()) |
1652 | return false; |
1653 | BranchI->setDebugLoc(I.getDebugLoc()); |
1654 | return true; |
1655 | }); |
1656 | }); |
1657 | } |
1658 | newFuncRoot->getInstList().push_back(BranchI); |
1659 | |
1660 | ValueSet inputs, outputs, SinkingCands, HoistingCands; |
1661 | BasicBlock *CommonExit = nullptr; |
1662 | findAllocas(CEAC, SinkingCands, HoistingCands, CommonExit); |
1663 | assert(HoistingCands.empty() || CommonExit); |
1664 | |
1665 | |
1666 | findInputsOutputs(inputs, outputs, SinkingCands); |
1667 | |
1668 | |
1669 | |
1670 | |
1671 | AllocaInst *FirstSunkAlloca = nullptr; |
1672 | for (auto *II : SinkingCands) { |
1673 | if (auto *AI = dyn_cast<AllocaInst>(II)) { |
1674 | AI->moveBefore(*newFuncRoot, newFuncRoot->getFirstInsertionPt()); |
1675 | if (!FirstSunkAlloca) |
1676 | FirstSunkAlloca = AI; |
1677 | } |
1678 | } |
1679 | assert((SinkingCands.empty() || FirstSunkAlloca) && |
1680 | "Did not expect a sink candidate without any allocas"); |
1681 | for (auto *II : SinkingCands) { |
1682 | if (!isa<AllocaInst>(II)) { |
1683 | cast<Instruction>(II)->moveAfter(FirstSunkAlloca); |
1684 | } |
1685 | } |
1686 | |
1687 | if (!HoistingCands.empty()) { |
1688 | auto *HoistToBlock = findOrCreateBlockForHoisting(CommonExit); |
1689 | Instruction *TI = HoistToBlock->getTerminator(); |
1690 | for (auto *II : HoistingCands) |
1691 | cast<Instruction>(II)->moveBefore(TI); |
1692 | } |
1693 | |
1694 | |
1695 | |
1696 | |
1697 | |
1698 | ValueSet LifetimesStart; |
1699 | eraseLifetimeMarkersOnInputs(Blocks, SinkingCands, LifetimesStart); |
1700 | |
1701 | |
1702 | Function *newFunction = |
1703 | constructFunction(inputs, outputs, header, newFuncRoot, codeReplacer, |
1704 | oldFunction, oldFunction->getParent()); |
1705 | |
1706 | |
1707 | if (BFI) { |
1708 | auto Count = BFI->getProfileCountFromFreq(EntryFreq.getFrequency()); |
1709 | if (Count.hasValue()) |
1710 | newFunction->setEntryCount( |
1711 | ProfileCount(Count.getValue(), Function::PCT_Real)); |
1712 | BFI->setBlockFreq(codeReplacer, EntryFreq.getFrequency()); |
1713 | } |
1714 | |
1715 | CallInst *TheCall = |
1716 | emitCallAndSwitchStatement(newFunction, codeReplacer, inputs, outputs); |
1717 | |
1718 | moveCodeToFunction(newFunction); |
1719 | |
1720 | |
1721 | |
1722 | insertLifetimeMarkersSurroundingCall( |
1723 | oldFunction->getParent(), LifetimesStart.getArrayRef(), {}, TheCall); |
1724 | |
1725 | |
1726 | if (oldFunction->hasPersonalityFn()) |
1727 | newFunction->setPersonalityFn(oldFunction->getPersonalityFn()); |
1728 | |
1729 | |
1730 | if (BFI && NumExitBlocks > 1) |
1731 | calculateNewCallTerminatorWeights(codeReplacer, ExitWeights, BPI); |
1732 | |
1733 | |
1734 | |
1735 | for (BasicBlock::iterator I = header->begin(); isa<PHINode>(I); ++I) { |
1736 | PHINode *PN = cast<PHINode>(I); |
1737 | for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) |
1738 | if (!Blocks.count(PN->getIncomingBlock(i))) |
1739 | PN->setIncomingBlock(i, newFuncRoot); |
1740 | } |
1741 | |
1742 | for (BasicBlock *ExitBB : ExitBlocks) |
1743 | for (PHINode &PN : ExitBB->phis()) { |
1744 | Value *IncomingCodeReplacerVal = nullptr; |
1745 | for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) { |
1746 | |
1747 | if (!Blocks.count(PN.getIncomingBlock(i))) |
1748 | continue; |
1749 | |
1750 | |
1751 | if (!IncomingCodeReplacerVal) { |
1752 | PN.setIncomingBlock(i, codeReplacer); |
1753 | IncomingCodeReplacerVal = PN.getIncomingValue(i); |
1754 | } else |
1755 | assert(IncomingCodeReplacerVal == PN.getIncomingValue(i) && |
1756 | "PHI has two incompatbile incoming values from codeRepl"); |
1757 | } |
1758 | } |
1759 | |
1760 | fixupDebugInfoPostExtraction(*oldFunction, *newFunction, *TheCall); |
1761 | |
1762 | |
1763 | |
1764 | |
1765 | bool doesNotReturn = none_of(*newFunction, [](const BasicBlock &BB) { |
1766 | const Instruction *Term = BB.getTerminator(); |
1767 | return isa<ReturnInst>(Term) || isa<ResumeInst>(Term); |
1768 | }); |
1769 | if (doesNotReturn) |
1770 | newFunction->setDoesNotReturn(); |
1771 | |
1772 | LLVM_DEBUG(if (verifyFunction(*newFunction, &errs())) { |
1773 | newFunction->dump(); |
1774 | report_fatal_error("verification of newFunction failed!"); |
1775 | }); |
1776 | LLVM_DEBUG(if (verifyFunction(*oldFunction)) |
1777 | report_fatal_error("verification of oldFunction failed!")); |
1778 | LLVM_DEBUG(if (AC && verifyAssumptionCache(*oldFunction, *newFunction, AC)) |
1779 | report_fatal_error("Stale Asumption cache for old Function!")); |
1780 | return newFunction; |
1781 | } |
1782 | |
1783 | bool CodeExtractor::verifyAssumptionCache(const Function &OldFunc, |
1784 | const Function &NewFunc, |
1785 | AssumptionCache *AC) { |
1786 | for (auto AssumeVH : AC->assumptions()) { |
1787 | auto *I = dyn_cast_or_null<CallInst>(AssumeVH); |
1788 | if (!I) |
1789 | continue; |
1790 | |
1791 | |
1792 | if (I->getFunction() != &OldFunc) |
1793 | return true; |
1794 | |
1795 | |
1796 | |
1797 | |
1798 | for (auto AffectedValVH : AC->assumptionsFor(I->getOperand(0))) { |
1799 | auto *AffectedCI = dyn_cast_or_null<CallInst>(AffectedValVH); |
1800 | if (!AffectedCI) |
1801 | continue; |
1802 | if (AffectedCI->getFunction() != &OldFunc) |
1803 | return true; |
1804 | auto *AssumedInst = cast<Instruction>(AffectedCI->getOperand(0)); |
1805 | if (AssumedInst->getFunction() != &OldFunc) |
1806 | return true; |
1807 | } |
1808 | } |
1809 | return false; |
1810 | } |