clang -cc1 -cc1 -triple amd64-unknown-openbsd7.0 -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name MachineSSAUpdater.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 pic -pic-level 1 -fhalf-no-semantic-interposition -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" -D PIC -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 -D_RET_PROTECTOR -ret-protector -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/CodeGen/MachineSSAUpdater.cpp
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 | |
10 | |
11 | |
12 | |
13 | |
14 | #include "llvm/CodeGen/MachineSSAUpdater.h" |
15 | #include "llvm/ADT/DenseMap.h" |
16 | #include "llvm/ADT/SmallVector.h" |
17 | #include "llvm/CodeGen/MachineBasicBlock.h" |
18 | #include "llvm/CodeGen/MachineFunction.h" |
19 | #include "llvm/CodeGen/MachineInstr.h" |
20 | #include "llvm/CodeGen/MachineInstrBuilder.h" |
21 | #include "llvm/CodeGen/MachineOperand.h" |
22 | #include "llvm/CodeGen/MachineRegisterInfo.h" |
23 | #include "llvm/CodeGen/TargetInstrInfo.h" |
24 | #include "llvm/CodeGen/TargetOpcodes.h" |
25 | #include "llvm/CodeGen/TargetSubtargetInfo.h" |
26 | #include "llvm/IR/DebugLoc.h" |
27 | #include "llvm/Support/Debug.h" |
28 | #include "llvm/Support/ErrorHandling.h" |
29 | #include "llvm/Support/raw_ostream.h" |
30 | #include "llvm/Transforms/Utils/SSAUpdaterImpl.h" |
31 | #include <utility> |
32 | |
33 | using namespace llvm; |
34 | |
35 | #define DEBUG_TYPE "machine-ssaupdater" |
36 | |
37 | using AvailableValsTy = DenseMap<MachineBasicBlock *, Register>; |
38 | |
39 | static AvailableValsTy &getAvailableVals(void *AV) { |
40 | return *static_cast<AvailableValsTy*>(AV); |
41 | } |
42 | |
43 | MachineSSAUpdater::MachineSSAUpdater(MachineFunction &MF, |
44 | SmallVectorImpl<MachineInstr*> *NewPHI) |
45 | : InsertedPHIs(NewPHI), TII(MF.getSubtarget().getInstrInfo()), |
46 | MRI(&MF.getRegInfo()) {} |
47 | |
48 | MachineSSAUpdater::~MachineSSAUpdater() { |
49 | delete static_cast<AvailableValsTy*>(AV); |
50 | } |
51 | |
52 | |
53 | |
54 | void MachineSSAUpdater::Initialize(const TargetRegisterClass *RC) { |
55 | if (!AV) |
56 | AV = new AvailableValsTy(); |
57 | else |
58 | getAvailableVals(AV).clear(); |
59 | |
60 | VRC = RC; |
61 | } |
62 | |
63 | void MachineSSAUpdater::Initialize(Register V) { |
64 | Initialize(MRI->getRegClass(V)); |
65 | } |
66 | |
67 | |
68 | |
69 | bool MachineSSAUpdater::HasValueForBlock(MachineBasicBlock *BB) const { |
70 | return getAvailableVals(AV).count(BB); |
71 | } |
72 | |
73 | |
74 | |
75 | void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, Register V) { |
76 | getAvailableVals(AV)[BB] = V; |
77 | } |
78 | |
79 | |
80 | |
81 | Register MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) { |
82 | return GetValueAtEndOfBlockInternal(BB); |
83 | } |
84 | |
85 | static |
86 | Register LookForIdenticalPHI(MachineBasicBlock *BB, |
87 | SmallVectorImpl<std::pair<MachineBasicBlock *, Register>> &PredValues) { |
88 | if (BB->empty()) |
89 | return Register(); |
90 | |
91 | MachineBasicBlock::iterator I = BB->begin(); |
92 | if (!I->isPHI()) |
93 | return Register(); |
94 | |
95 | AvailableValsTy AVals; |
96 | for (unsigned i = 0, e = PredValues.size(); i != e; ++i) |
97 | AVals[PredValues[i].first] = PredValues[i].second; |
98 | while (I != BB->end() && I->isPHI()) { |
99 | bool Same = true; |
100 | for (unsigned i = 1, e = I->getNumOperands(); i != e; i += 2) { |
101 | Register SrcReg = I->getOperand(i).getReg(); |
102 | MachineBasicBlock *SrcBB = I->getOperand(i+1).getMBB(); |
103 | if (AVals[SrcBB] != SrcReg) { |
104 | Same = false; |
105 | break; |
106 | } |
107 | } |
108 | if (Same) |
109 | return I->getOperand(0).getReg(); |
110 | ++I; |
111 | } |
112 | return Register(); |
113 | } |
114 | |
115 | |
116 | |
117 | |
118 | static |
119 | MachineInstrBuilder InsertNewDef(unsigned Opcode, |
120 | MachineBasicBlock *BB, MachineBasicBlock::iterator I, |
121 | const TargetRegisterClass *RC, |
122 | MachineRegisterInfo *MRI, |
123 | const TargetInstrInfo *TII) { |
124 | Register NewVR = MRI->createVirtualRegister(RC); |
125 | return BuildMI(*BB, I, DebugLoc(), TII->get(Opcode), NewVR); |
126 | } |
127 | |
128 | |
129 | |
130 | |
131 | |
132 | |
133 | |
134 | |
135 | |
136 | |
137 | |
138 | |
139 | |
140 | |
141 | |
142 | |
143 | |
144 | |
145 | |
146 | Register MachineSSAUpdater::GetValueInMiddleOfBlock(MachineBasicBlock *BB) { |
147 | |
148 | |
149 | if (!HasValueForBlock(BB)) |
150 | return GetValueAtEndOfBlockInternal(BB); |
151 | |
152 | |
153 | if (BB->pred_empty()) { |
154 | |
155 | MachineInstr *NewDef = InsertNewDef(TargetOpcode::IMPLICIT_DEF, |
156 | BB, BB->getFirstTerminator(), |
157 | VRC, MRI, TII); |
158 | return NewDef->getOperand(0).getReg(); |
159 | } |
160 | |
161 | |
162 | |
163 | SmallVector<std::pair<MachineBasicBlock*, Register>, 8> PredValues; |
164 | Register SingularValue; |
165 | |
166 | bool isFirstPred = true; |
167 | for (MachineBasicBlock *PredBB : BB->predecessors()) { |
168 | Register PredVal = GetValueAtEndOfBlockInternal(PredBB); |
169 | PredValues.push_back(std::make_pair(PredBB, PredVal)); |
170 | |
171 | |
172 | if (isFirstPred) { |
173 | SingularValue = PredVal; |
174 | isFirstPred = false; |
175 | } else if (PredVal != SingularValue) |
176 | SingularValue = Register(); |
177 | } |
178 | |
179 | |
180 | if (SingularValue) |
181 | return SingularValue; |
182 | |
183 | |
184 | Register DupPHI = LookForIdenticalPHI(BB, PredValues); |
185 | if (DupPHI) |
186 | return DupPHI; |
187 | |
188 | |
189 | MachineBasicBlock::iterator Loc = BB->empty() ? BB->end() : BB->begin(); |
190 | MachineInstrBuilder InsertedPHI = InsertNewDef(TargetOpcode::PHI, BB, |
191 | Loc, VRC, MRI, TII); |
192 | |
193 | |
194 | for (unsigned i = 0, e = PredValues.size(); i != e; ++i) |
195 | InsertedPHI.addReg(PredValues[i].second).addMBB(PredValues[i].first); |
196 | |
197 | |
198 | |
199 | if (unsigned ConstVal = InsertedPHI->isConstantValuePHI()) { |
200 | InsertedPHI->eraseFromParent(); |
201 | return ConstVal; |
202 | } |
203 | |
204 | |
205 | if (InsertedPHIs) InsertedPHIs->push_back(InsertedPHI); |
206 | |
207 | LLVM_DEBUG(dbgs() << " Inserted PHI: " << *InsertedPHI << "\n"); |
208 | return InsertedPHI.getReg(0); |
209 | } |
210 | |
211 | static |
212 | MachineBasicBlock *findCorrespondingPred(const MachineInstr *MI, |
213 | MachineOperand *U) { |
214 | for (unsigned i = 1, e = MI->getNumOperands(); i != e; i += 2) { |
215 | if (&MI->getOperand(i) == U) |
216 | return MI->getOperand(i+1).getMBB(); |
217 | } |
218 | |
219 | llvm_unreachable("MachineOperand::getParent() failure?"); |
220 | } |
221 | |
222 | |
223 | |
224 | void MachineSSAUpdater::RewriteUse(MachineOperand &U) { |
225 | MachineInstr *UseMI = U.getParent(); |
226 | Register NewVR; |
227 | if (UseMI->isPHI()) { |
| |
228 | MachineBasicBlock *SourceBB = findCorrespondingPred(UseMI, &U); |
229 | NewVR = GetValueAtEndOfBlockInternal(SourceBB); |
| 2 | | Calling 'MachineSSAUpdater::GetValueAtEndOfBlockInternal' | |
|
230 | } else { |
231 | NewVR = GetValueInMiddleOfBlock(UseMI->getParent()); |
232 | } |
233 | |
234 | U.setReg(NewVR); |
235 | } |
236 | |
237 | namespace llvm { |
238 | |
239 | |
240 | |
241 | template<> |
242 | class SSAUpdaterTraits<MachineSSAUpdater> { |
243 | public: |
244 | using BlkT = MachineBasicBlock; |
245 | using ValT = Register; |
246 | using PhiT = MachineInstr; |
247 | using BlkSucc_iterator = MachineBasicBlock::succ_iterator; |
248 | |
249 | static BlkSucc_iterator BlkSucc_begin(BlkT *BB) { return BB->succ_begin(); } |
250 | static BlkSucc_iterator BlkSucc_end(BlkT *BB) { return BB->succ_end(); } |
251 | |
252 | |
253 | class PHI_iterator { |
254 | private: |
255 | MachineInstr *PHI; |
256 | unsigned idx; |
257 | |
258 | public: |
259 | explicit PHI_iterator(MachineInstr *P) |
260 | : PHI(P), idx(1) {} |
261 | PHI_iterator(MachineInstr *P, bool) |
262 | : PHI(P), idx(PHI->getNumOperands()) {} |
263 | |
264 | PHI_iterator &operator++() { idx += 2; return *this; } |
265 | bool operator==(const PHI_iterator& x) const { return idx == x.idx; } |
266 | bool operator!=(const PHI_iterator& x) const { return !operator==(x); } |
267 | |
268 | unsigned getIncomingValue() { return PHI->getOperand(idx).getReg(); } |
269 | |
270 | MachineBasicBlock *getIncomingBlock() { |
271 | return PHI->getOperand(idx+1).getMBB(); |
272 | } |
273 | }; |
274 | |
275 | static inline PHI_iterator PHI_begin(PhiT *PHI) { return PHI_iterator(PHI); } |
276 | |
277 | static inline PHI_iterator PHI_end(PhiT *PHI) { |
278 | return PHI_iterator(PHI, true); |
279 | } |
280 | |
281 | |
282 | |
283 | static void FindPredecessorBlocks(MachineBasicBlock *BB, |
284 | SmallVectorImpl<MachineBasicBlock*> *Preds){ |
285 | append_range(*Preds, BB->predecessors()); |
286 | } |
287 | |
288 | |
289 | |
290 | static Register GetUndefVal(MachineBasicBlock *BB, |
291 | MachineSSAUpdater *Updater) { |
292 | |
293 | MachineInstr *NewDef = InsertNewDef(TargetOpcode::IMPLICIT_DEF, |
294 | BB, BB->getFirstNonPHI(), |
295 | Updater->VRC, Updater->MRI, |
296 | Updater->TII); |
297 | return NewDef->getOperand(0).getReg(); |
298 | } |
299 | |
300 | |
301 | |
302 | static Register CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds, |
303 | MachineSSAUpdater *Updater) { |
304 | MachineBasicBlock::iterator Loc = BB->empty() ? BB->end() : BB->begin(); |
305 | MachineInstr *PHI = InsertNewDef(TargetOpcode::PHI, BB, Loc, |
306 | Updater->VRC, Updater->MRI, |
307 | Updater->TII); |
308 | return PHI->getOperand(0).getReg(); |
309 | } |
310 | |
311 | |
312 | |
313 | static void AddPHIOperand(MachineInstr *PHI, Register Val, |
314 | MachineBasicBlock *Pred) { |
315 | MachineInstrBuilder(*Pred->getParent(), PHI).addReg(Val).addMBB(Pred); |
316 | } |
317 | |
318 | |
319 | static MachineInstr *InstrIsPHI(MachineInstr *I) { |
320 | if (I && I->isPHI()) |
321 | return I; |
322 | return nullptr; |
323 | } |
324 | |
325 | |
326 | |
327 | static MachineInstr *ValueIsPHI(Register Val, MachineSSAUpdater *Updater) { |
328 | return InstrIsPHI(Updater->MRI->getVRegDef(Val)); |
329 | } |
330 | |
331 | |
332 | |
333 | static MachineInstr *ValueIsNewPHI(Register Val, MachineSSAUpdater *Updater) { |
334 | MachineInstr *PHI = ValueIsPHI(Val, Updater); |
335 | if (PHI && PHI->getNumOperands() <= 1) |
336 | return PHI; |
337 | return nullptr; |
338 | } |
339 | |
340 | |
341 | |
342 | static Register GetPHIValue(MachineInstr *PHI) { |
343 | return PHI->getOperand(0).getReg(); |
344 | } |
345 | }; |
346 | |
347 | } |
348 | |
349 | |
350 | |
351 | |
352 | |
353 | Register MachineSSAUpdater::GetValueAtEndOfBlockInternal(MachineBasicBlock *BB){ |
354 | AvailableValsTy &AvailableVals = getAvailableVals(AV); |
355 | if (Register V = AvailableVals[BB]) |
| 3 | | Assuming the condition is false | |
|
| |
356 | return V; |
357 | |
358 | SSAUpdaterImpl<MachineSSAUpdater> Impl(this, &AvailableVals, InsertedPHIs); |
359 | return Impl.GetValue(BB); |
| 5 | | Calling 'SSAUpdaterImpl::GetValue' | |
|
360 | } |
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 | |
10 | |
11 | |
12 | |
13 | |
14 | #ifndef LLVM_TRANSFORMS_UTILS_SSAUPDATERIMPL_H |
15 | #define LLVM_TRANSFORMS_UTILS_SSAUPDATERIMPL_H |
16 | |
17 | #include "llvm/ADT/DenseMap.h" |
18 | #include "llvm/ADT/SmallVector.h" |
19 | #include "llvm/Support/Allocator.h" |
20 | #include "llvm/Support/Debug.h" |
21 | #include "llvm/Support/raw_ostream.h" |
22 | |
23 | #define DEBUG_TYPE "ssaupdater" |
24 | |
25 | namespace llvm { |
26 | |
27 | template<typename T> class SSAUpdaterTraits; |
28 | |
29 | template<typename UpdaterT> |
30 | class SSAUpdaterImpl { |
31 | private: |
32 | UpdaterT *Updater; |
33 | |
34 | using Traits = SSAUpdaterTraits<UpdaterT>; |
35 | using BlkT = typename Traits::BlkT; |
36 | using ValT = typename Traits::ValT; |
37 | using PhiT = typename Traits::PhiT; |
38 | |
39 | |
40 | |
41 | |
42 | class BBInfo { |
43 | public: |
44 | |
45 | BlkT *BB; |
46 | |
47 | |
48 | ValT AvailableVal; |
49 | |
50 | |
51 | BBInfo *DefBB; |
52 | |
53 | |
54 | int BlkNum = 0; |
55 | |
56 | |
57 | BBInfo *IDom = nullptr; |
58 | |
59 | |
60 | unsigned NumPreds = 0; |
61 | |
62 | |
63 | BBInfo **Preds = nullptr; |
64 | |
65 | |
66 | PhiT *PHITag = nullptr; |
67 | |
68 | BBInfo(BlkT *ThisBB, ValT V) |
69 | : BB(ThisBB), AvailableVal(V), DefBB(V ? this : nullptr) {} |
70 | }; |
71 | |
72 | using AvailableValsTy = DenseMap<BlkT *, ValT>; |
73 | |
74 | AvailableValsTy *AvailableVals; |
75 | |
76 | SmallVectorImpl<PhiT *> *InsertedPHIs; |
77 | |
78 | using BlockListTy = SmallVectorImpl<BBInfo *>; |
79 | using BBMapTy = DenseMap<BlkT *, BBInfo *>; |
80 | |
81 | BBMapTy BBMap; |
82 | BumpPtrAllocator Allocator; |
83 | |
84 | public: |
85 | explicit SSAUpdaterImpl(UpdaterT *U, AvailableValsTy *A, |
86 | SmallVectorImpl<PhiT *> *Ins) : |
87 | Updater(U), AvailableVals(A), InsertedPHIs(Ins) {} |
88 | |
89 | |
90 | |
91 | |
92 | |
93 | ValT GetValue(BlkT *BB) { |
94 | SmallVector<BBInfo *, 100> BlockList; |
95 | BBInfo *PseudoEntry = BuildBlockList(BB, &BlockList); |
| 6 | | Calling 'SSAUpdaterImpl::BuildBlockList' | |
|
96 | |
97 | |
98 | if (BlockList.size() == 0) { |
99 | ValT V = Traits::GetUndefVal(BB, Updater); |
100 | (*AvailableVals)[BB] = V; |
101 | return V; |
102 | } |
103 | |
104 | FindDominators(&BlockList, PseudoEntry); |
105 | FindPHIPlacement(&BlockList); |
106 | FindAvailableVals(&BlockList); |
107 | |
108 | return BBMap[BB]->DefBB->AvailableVal; |
109 | } |
110 | |
111 | |
112 | |
113 | |
114 | |
115 | BBInfo *BuildBlockList(BlkT *BB, BlockListTy *BlockList) { |
116 | SmallVector<BBInfo *, 10> RootList; |
117 | SmallVector<BBInfo *, 64> WorkList; |
118 | |
119 | BBInfo *Info = new (Allocator) BBInfo(BB, 0); |
| 7 | | Calling 'operator new<llvm::MallocAllocator, 4096UL, 4096UL, 128UL>' | |
|
120 | BBMap[BB] = Info; |
121 | WorkList.push_back(Info); |
122 | |
123 | |
124 | |
125 | |
126 | SmallVector<BlkT *, 10> Preds; |
127 | while (!WorkList.empty()) { |
128 | Info = WorkList.pop_back_val(); |
129 | Preds.clear(); |
130 | Traits::FindPredecessorBlocks(Info->BB, &Preds); |
131 | Info->NumPreds = Preds.size(); |
132 | if (Info->NumPreds == 0) |
133 | Info->Preds = nullptr; |
134 | else |
135 | Info->Preds = static_cast<BBInfo **>(Allocator.Allocate( |
136 | Info->NumPreds * sizeof(BBInfo *), alignof(BBInfo *))); |
137 | |
138 | for (unsigned p = 0; p != Info->NumPreds; ++p) { |
139 | BlkT *Pred = Preds[p]; |
140 | |
141 | typename BBMapTy::value_type &BBMapBucket = |
142 | BBMap.FindAndConstruct(Pred); |
143 | if (BBMapBucket.second) { |
144 | Info->Preds[p] = BBMapBucket.second; |
145 | continue; |
146 | } |
147 | |
148 | |
149 | ValT PredVal = AvailableVals->lookup(Pred); |
150 | BBInfo *PredInfo = new (Allocator) BBInfo(Pred, PredVal); |
151 | BBMapBucket.second = PredInfo; |
152 | Info->Preds[p] = PredInfo; |
153 | |
154 | if (PredInfo->AvailableVal) { |
155 | RootList.push_back(PredInfo); |
156 | continue; |
157 | } |
158 | WorkList.push_back(PredInfo); |
159 | } |
160 | } |
161 | |
162 | |
163 | |
164 | |
165 | BBInfo *PseudoEntry = new (Allocator) BBInfo(nullptr, 0); |
166 | unsigned BlkNum = 1; |
167 | |
168 | |
169 | while (!RootList.empty()) { |
170 | Info = RootList.pop_back_val(); |
171 | Info->IDom = PseudoEntry; |
172 | Info->BlkNum = -1; |
173 | WorkList.push_back(Info); |
174 | } |
175 | |
176 | while (!WorkList.empty()) { |
177 | Info = WorkList.back(); |
178 | |
179 | if (Info->BlkNum == -2) { |
180 | |
181 | Info->BlkNum = BlkNum++; |
182 | |
183 | if (!Info->AvailableVal) |
184 | BlockList->push_back(Info); |
185 | WorkList.pop_back(); |
186 | continue; |
187 | } |
188 | |
189 | |
190 | |
191 | |
192 | |
193 | Info->BlkNum = -2; |
194 | |
195 | |
196 | for (typename Traits::BlkSucc_iterator SI = |
197 | Traits::BlkSucc_begin(Info->BB), |
198 | E = Traits::BlkSucc_end(Info->BB); SI != E; ++SI) { |
199 | BBInfo *SuccInfo = BBMap[*SI]; |
200 | if (!SuccInfo || SuccInfo->BlkNum) |
201 | continue; |
202 | SuccInfo->BlkNum = -1; |
203 | WorkList.push_back(SuccInfo); |
204 | } |
205 | } |
206 | PseudoEntry->BlkNum = BlkNum; |
207 | return PseudoEntry; |
208 | } |
209 | |
210 | |
211 | |
212 | |
213 | |
214 | BBInfo *IntersectDominators(BBInfo *Blk1, BBInfo *Blk2) { |
215 | while (Blk1 != Blk2) { |
216 | while (Blk1->BlkNum < Blk2->BlkNum) { |
217 | Blk1 = Blk1->IDom; |
218 | if (!Blk1) |
219 | return Blk2; |
220 | } |
221 | while (Blk2->BlkNum < Blk1->BlkNum) { |
222 | Blk2 = Blk2->IDom; |
223 | if (!Blk2) |
224 | return Blk1; |
225 | } |
226 | } |
227 | return Blk1; |
228 | } |
229 | |
230 | |
231 | |
232 | |
233 | |
234 | |
235 | |
236 | |
237 | |
238 | |
239 | |
240 | void FindDominators(BlockListTy *BlockList, BBInfo *PseudoEntry) { |
241 | bool Changed; |
242 | do { |
243 | Changed = false; |
244 | |
245 | for (typename BlockListTy::reverse_iterator I = BlockList->rbegin(), |
246 | E = BlockList->rend(); I != E; ++I) { |
247 | BBInfo *Info = *I; |
248 | BBInfo *NewIDom = nullptr; |
249 | |
250 | |
251 | for (unsigned p = 0; p != Info->NumPreds; ++p) { |
252 | BBInfo *Pred = Info->Preds[p]; |
253 | |
254 | |
255 | if (Pred->BlkNum == 0) { |
256 | Pred->AvailableVal = Traits::GetUndefVal(Pred->BB, Updater); |
257 | (*AvailableVals)[Pred->BB] = Pred->AvailableVal; |
258 | Pred->DefBB = Pred; |
259 | Pred->BlkNum = PseudoEntry->BlkNum; |
260 | PseudoEntry->BlkNum++; |
261 | } |
262 | |
263 | if (!NewIDom) |
264 | NewIDom = Pred; |
265 | else |
266 | NewIDom = IntersectDominators(NewIDom, Pred); |
267 | } |
268 | |
269 | |
270 | if (NewIDom && NewIDom != Info->IDom) { |
271 | Info->IDom = NewIDom; |
272 | Changed = true; |
273 | } |
274 | } |
275 | } while (Changed); |
276 | } |
277 | |
278 | |
279 | |
280 | |
281 | |
282 | bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) { |
283 | for (; Pred != IDom; Pred = Pred->IDom) { |
284 | if (Pred->DefBB == Pred) |
285 | return true; |
286 | } |
287 | return false; |
288 | } |
289 | |
290 | |
291 | |
292 | |
293 | |
294 | void FindPHIPlacement(BlockListTy *BlockList) { |
295 | bool Changed; |
296 | do { |
297 | Changed = false; |
298 | |
299 | for (typename BlockListTy::reverse_iterator I = BlockList->rbegin(), |
300 | E = BlockList->rend(); I != E; ++I) { |
301 | BBInfo *Info = *I; |
302 | |
303 | |
304 | if (Info->DefBB == Info) |
305 | continue; |
306 | |
307 | |
308 | BBInfo *NewDefBB = Info->IDom->DefBB; |
309 | for (unsigned p = 0; p != Info->NumPreds; ++p) { |
310 | if (IsDefInDomFrontier(Info->Preds[p], Info->IDom)) { |
311 | |
312 | NewDefBB = Info; |
313 | break; |
314 | } |
315 | } |
316 | |
317 | |
318 | if (NewDefBB != Info->DefBB) { |
319 | Info->DefBB = NewDefBB; |
320 | Changed = true; |
321 | } |
322 | } |
323 | } while (Changed); |
324 | } |
325 | |
326 | |
327 | |
328 | |
329 | |
330 | |
331 | void FindAvailableVals(BlockListTy *BlockList) { |
332 | |
333 | |
334 | |
335 | for (typename BlockListTy::iterator I = BlockList->begin(), |
336 | E = BlockList->end(); I != E; ++I) { |
337 | BBInfo *Info = *I; |
338 | |
339 | if (Info->DefBB != Info) |
340 | continue; |
341 | |
342 | |
343 | FindExistingPHI(Info->BB, BlockList); |
344 | if (Info->AvailableVal) |
345 | continue; |
346 | |
347 | ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater); |
348 | Info->AvailableVal = PHI; |
349 | (*AvailableVals)[Info->BB] = PHI; |
350 | } |
351 | |
352 | |
353 | |
354 | for (typename BlockListTy::reverse_iterator I = BlockList->rbegin(), |
355 | E = BlockList->rend(); I != E; ++I) { |
356 | BBInfo *Info = *I; |
357 | |
358 | if (Info->DefBB != Info) { |
359 | |
360 | |
361 | (*AvailableVals)[Info->BB] = Info->DefBB->AvailableVal; |
362 | continue; |
363 | } |
364 | |
365 | |
366 | PhiT *PHI = Traits::ValueIsNewPHI(Info->AvailableVal, Updater); |
367 | if (!PHI) |
368 | continue; |
369 | |
370 | |
371 | for (unsigned p = 0; p != Info->NumPreds; ++p) { |
372 | BBInfo *PredInfo = Info->Preds[p]; |
373 | BlkT *Pred = PredInfo->BB; |
374 | |
375 | if (PredInfo->DefBB != PredInfo) |
376 | PredInfo = PredInfo->DefBB; |
377 | Traits::AddPHIOperand(PHI, PredInfo->AvailableVal, Pred); |
378 | } |
379 | |
380 | LLVM_DEBUG(dbgs() << " Inserted PHI: " << *PHI << "\n"); |
381 | |
382 | |
383 | if (InsertedPHIs) InsertedPHIs->push_back(PHI); |
384 | } |
385 | } |
386 | |
387 | |
388 | |
389 | void FindExistingPHI(BlkT *BB, BlockListTy *BlockList) { |
390 | for (auto &SomePHI : BB->phis()) { |
391 | if (CheckIfPHIMatches(&SomePHI)) { |
392 | RecordMatchingPHIs(BlockList); |
393 | break; |
394 | } |
395 | |
396 | for (typename BlockListTy::iterator I = BlockList->begin(), |
397 | E = BlockList->end(); I != E; ++I) |
398 | (*I)->PHITag = nullptr; |
399 | } |
400 | } |
401 | |
402 | |
403 | |
404 | bool CheckIfPHIMatches(PhiT *PHI) { |
405 | SmallVector<PhiT *, 20> WorkList; |
406 | WorkList.push_back(PHI); |
407 | |
408 | |
409 | BBMap[PHI->getParent()]->PHITag = PHI; |
410 | |
411 | while (!WorkList.empty()) { |
412 | PHI = WorkList.pop_back_val(); |
413 | |
414 | |
415 | for (typename Traits::PHI_iterator I = Traits::PHI_begin(PHI), |
416 | E = Traits::PHI_end(PHI); I != E; ++I) { |
417 | ValT IncomingVal = I.getIncomingValue(); |
418 | BBInfo *PredInfo = BBMap[I.getIncomingBlock()]; |
419 | |
420 | if (PredInfo->DefBB != PredInfo) |
421 | PredInfo = PredInfo->DefBB; |
422 | |
423 | |
424 | if (PredInfo->AvailableVal) { |
425 | if (IncomingVal == PredInfo->AvailableVal) |
426 | continue; |
427 | return false; |
428 | } |
429 | |
430 | |
431 | PhiT *IncomingPHIVal = Traits::ValueIsPHI(IncomingVal, Updater); |
432 | if (!IncomingPHIVal || IncomingPHIVal->getParent() != PredInfo->BB) |
433 | return false; |
434 | |
435 | |
436 | if (PredInfo->PHITag) { |
437 | if (IncomingPHIVal == PredInfo->PHITag) |
438 | continue; |
439 | return false; |
440 | } |
441 | PredInfo->PHITag = IncomingPHIVal; |
442 | |
443 | WorkList.push_back(IncomingPHIVal); |
444 | } |
445 | } |
446 | return true; |
447 | } |
448 | |
449 | |
450 | |
451 | void RecordMatchingPHIs(BlockListTy *BlockList) { |
452 | for (typename BlockListTy::iterator I = BlockList->begin(), |
453 | E = BlockList->end(); I != E; ++I) |
454 | if (PhiT *PHI = (*I)->PHITag) { |
455 | BlkT *BB = PHI->getParent(); |
456 | ValT PHIVal = Traits::GetPHIValue(PHI); |
457 | (*AvailableVals)[BB] = PHIVal; |
458 | BBMap[BB]->AvailableVal = PHIVal; |
459 | } |
460 | } |
461 | }; |
462 | |
463 | } |
464 | |
465 | #undef DEBUG_TYPE // "ssaupdater" |
466 | |
467 | #endif // LLVM_TRANSFORMS_UTILS_SSAUPDATERIMPL_H |
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 | |
10 | |
11 | |
12 | |
13 | |
14 | |
15 | |
16 | |
17 | #ifndef LLVM_SUPPORT_ALLOCATOR_H |
18 | #define LLVM_SUPPORT_ALLOCATOR_H |
19 | |
20 | #include "llvm/ADT/Optional.h" |
21 | #include "llvm/ADT/SmallVector.h" |
22 | #include "llvm/Support/Alignment.h" |
23 | #include "llvm/Support/AllocatorBase.h" |
24 | #include "llvm/Support/Compiler.h" |
25 | #include "llvm/Support/ErrorHandling.h" |
26 | #include "llvm/Support/MathExtras.h" |
27 | #include "llvm/Support/MemAlloc.h" |
28 | #include <algorithm> |
29 | #include <cassert> |
30 | #include <cstddef> |
31 | #include <cstdint> |
32 | #include <cstdlib> |
33 | #include <iterator> |
34 | #include <type_traits> |
35 | #include <utility> |
36 | |
37 | namespace llvm { |
38 | |
39 | namespace detail { |
40 | |
41 | |
42 | |
43 | void printBumpPtrAllocatorStats(unsigned NumSlabs, size_t BytesAllocated, |
44 | size_t TotalMemory); |
45 | |
46 | } |
47 | |
48 | |
49 | |
50 | |
51 | |
52 | |
53 | |
54 | |
55 | |
56 | |
57 | |
58 | |
59 | |
60 | |
61 | |
62 | |
63 | |
64 | |
65 | template <typename AllocatorT = MallocAllocator, size_t SlabSize = 4096, |
66 | size_t SizeThreshold = SlabSize, size_t GrowthDelay = 128> |
67 | class BumpPtrAllocatorImpl |
68 | : public AllocatorBase<BumpPtrAllocatorImpl<AllocatorT, SlabSize, |
69 | SizeThreshold, GrowthDelay>>, |
70 | private AllocatorT { |
71 | public: |
72 | static_assert(SizeThreshold <= SlabSize, |
73 | "The SizeThreshold must be at most the SlabSize to ensure " |
74 | "that objects larger than a slab go into their own memory " |
75 | "allocation."); |
76 | static_assert(GrowthDelay > 0, |
77 | "GrowthDelay must be at least 1 which already increases the" |
78 | "slab size after each allocated slab."); |
79 | |
80 | BumpPtrAllocatorImpl() = default; |
81 | |
82 | template <typename T> |
83 | BumpPtrAllocatorImpl(T &&Allocator) |
84 | : AllocatorT(std::forward<T &&>(Allocator)) {} |
85 | |
86 | |
87 | |
88 | BumpPtrAllocatorImpl(BumpPtrAllocatorImpl &&Old) |
89 | : AllocatorT(static_cast<AllocatorT &&>(Old)), CurPtr(Old.CurPtr), |
90 | End(Old.End), Slabs(std::move(Old.Slabs)), |
91 | CustomSizedSlabs(std::move(Old.CustomSizedSlabs)), |
92 | BytesAllocated(Old.BytesAllocated), RedZoneSize(Old.RedZoneSize) { |
93 | Old.CurPtr = Old.End = nullptr; |
94 | Old.BytesAllocated = 0; |
95 | Old.Slabs.clear(); |
96 | Old.CustomSizedSlabs.clear(); |
97 | } |
98 | |
99 | ~BumpPtrAllocatorImpl() { |
100 | DeallocateSlabs(Slabs.begin(), Slabs.end()); |
101 | DeallocateCustomSizedSlabs(); |
102 | } |
103 | |
104 | BumpPtrAllocatorImpl &operator=(BumpPtrAllocatorImpl &&RHS) { |
105 | DeallocateSlabs(Slabs.begin(), Slabs.end()); |
106 | DeallocateCustomSizedSlabs(); |
107 | |
108 | CurPtr = RHS.CurPtr; |
109 | End = RHS.End; |
110 | BytesAllocated = RHS.BytesAllocated; |
111 | RedZoneSize = RHS.RedZoneSize; |
112 | Slabs = std::move(RHS.Slabs); |
113 | CustomSizedSlabs = std::move(RHS.CustomSizedSlabs); |
114 | AllocatorT::operator=(static_cast<AllocatorT &&>(RHS)); |
115 | |
116 | RHS.CurPtr = RHS.End = nullptr; |
117 | RHS.BytesAllocated = 0; |
118 | RHS.Slabs.clear(); |
119 | RHS.CustomSizedSlabs.clear(); |
120 | return *this; |
121 | } |
122 | |
123 | |
124 | |
125 | void Reset() { |
126 | |
127 | DeallocateCustomSizedSlabs(); |
128 | CustomSizedSlabs.clear(); |
129 | |
130 | if (Slabs.empty()) |
131 | return; |
132 | |
133 | |
134 | BytesAllocated = 0; |
135 | CurPtr = (char *)Slabs.front(); |
136 | End = CurPtr + SlabSize; |
137 | |
138 | __asan_poison_memory_region(*Slabs.begin(), computeSlabSize(0)); |
139 | DeallocateSlabs(std::next(Slabs.begin()), Slabs.end()); |
140 | Slabs.erase(std::next(Slabs.begin()), Slabs.end()); |
141 | } |
142 | |
143 | |
144 | LLVM_ATTRIBUTE_RETURNS_NONNULL LLVM_ATTRIBUTE_RETURNS_NOALIAS void * |
145 | Allocate(size_t Size, Align Alignment) { |
146 | |
147 | BytesAllocated += Size; |
148 | |
149 | size_t Adjustment = offsetToAlignedAddr(CurPtr, Alignment); |
| 10 | | Calling 'offsetToAlignedAddr' | |
|
150 | assert(Adjustment + Size >= Size && "Adjustment + Size must not overflow"); |
151 | |
152 | size_t SizeToAllocate = Size; |
153 | #if LLVM_ADDRESS_SANITIZER_BUILD |
154 | |
155 | SizeToAllocate += RedZoneSize; |
156 | #endif |
157 | |
158 | |
159 | if (Adjustment + SizeToAllocate <= size_t(End - CurPtr)) { |
160 | char *AlignedPtr = CurPtr + Adjustment; |
161 | CurPtr = AlignedPtr + SizeToAllocate; |
162 | |
163 | |
164 | |
165 | __msan_allocated_memory(AlignedPtr, Size); |
166 | |
167 | __asan_unpoison_memory_region(AlignedPtr, Size); |
168 | return AlignedPtr; |
169 | } |
170 | |
171 | |
172 | size_t PaddedSize = SizeToAllocate + Alignment.value() - 1; |
173 | if (PaddedSize > SizeThreshold) { |
174 | void *NewSlab = |
175 | AllocatorT::Allocate(PaddedSize, alignof(std::max_align_t)); |
176 | |
177 | |
178 | __asan_poison_memory_region(NewSlab, PaddedSize); |
179 | CustomSizedSlabs.push_back(std::make_pair(NewSlab, PaddedSize)); |
180 | |
181 | uintptr_t AlignedAddr = alignAddr(NewSlab, Alignment); |
182 | assert(AlignedAddr + Size <= (uintptr_t)NewSlab + PaddedSize); |
183 | char *AlignedPtr = (char*)AlignedAddr; |
184 | __msan_allocated_memory(AlignedPtr, Size); |
185 | __asan_unpoison_memory_region(AlignedPtr, Size); |
186 | return AlignedPtr; |
187 | } |
188 | |
189 | |
190 | StartNewSlab(); |
191 | uintptr_t AlignedAddr = alignAddr(CurPtr, Alignment); |
192 | assert(AlignedAddr + SizeToAllocate <= (uintptr_t)End && |
193 | "Unable to allocate memory!"); |
194 | char *AlignedPtr = (char*)AlignedAddr; |
195 | CurPtr = AlignedPtr + SizeToAllocate; |
196 | __msan_allocated_memory(AlignedPtr, Size); |
197 | __asan_unpoison_memory_region(AlignedPtr, Size); |
198 | return AlignedPtr; |
199 | } |
200 | |
201 | inline LLVM_ATTRIBUTE_RETURNS_NONNULL LLVM_ATTRIBUTE_RETURNS_NOALIAS void * |
202 | Allocate(size_t Size, size_t Alignment) { |
203 | assert(Alignment > 0 && "0-byte alignment is not allowed. Use 1 instead."); |
204 | return Allocate(Size, Align(Alignment)); |
| 9 | | Calling 'BumpPtrAllocatorImpl::Allocate' | |
|
205 | } |
206 | |
207 | |
208 | using AllocatorBase<BumpPtrAllocatorImpl>::Allocate; |
209 | |
210 | |
211 | |
212 | |
213 | void Deallocate(const void *Ptr, size_t Size, size_t ) { |
214 | __asan_poison_memory_region(Ptr, Size); |
215 | } |
216 | |
217 | |
218 | using AllocatorBase<BumpPtrAllocatorImpl>::Deallocate; |
219 | |
220 | size_t GetNumSlabs() const { return Slabs.size() + CustomSizedSlabs.size(); } |
221 | |
222 | |
223 | |
224 | |
225 | |
226 | |
227 | llvm::Optional<int64_t> identifyObject(const void *Ptr) { |
228 | const char *P = static_cast<const char *>(Ptr); |
229 | int64_t InSlabIdx = 0; |
230 | for (size_t Idx = 0, E = Slabs.size(); Idx < E; Idx++) { |
231 | const char *S = static_cast<const char *>(Slabs[Idx]); |
232 | if (P >= S && P < S + computeSlabSize(Idx)) |
233 | return InSlabIdx + static_cast<int64_t>(P - S); |
234 | InSlabIdx += static_cast<int64_t>(computeSlabSize(Idx)); |
235 | } |
236 | |
237 | |
238 | int64_t InCustomSizedSlabIdx = -1; |
239 | for (size_t Idx = 0, E = CustomSizedSlabs.size(); Idx < E; Idx++) { |
240 | const char *S = static_cast<const char *>(CustomSizedSlabs[Idx].first); |
241 | size_t Size = CustomSizedSlabs[Idx].second; |
242 | if (P >= S && P < S + Size) |
243 | return InCustomSizedSlabIdx - static_cast<int64_t>(P - S); |
244 | InCustomSizedSlabIdx -= static_cast<int64_t>(Size); |
245 | } |
246 | return None; |
247 | } |
248 | |
249 | |
250 | |
251 | |
252 | |
253 | int64_t identifyKnownObject(const void *Ptr) { |
254 | Optional<int64_t> Out = identifyObject(Ptr); |
255 | assert(Out && "Wrong allocator used"); |
256 | return *Out; |
257 | } |
258 | |
259 | |
260 | |
261 | |
262 | |
263 | |
264 | |
265 | |
266 | |
267 | |
268 | |
269 | template <typename T> |
270 | int64_t identifyKnownAlignedObject(const void *Ptr) { |
271 | int64_t Out = identifyKnownObject(Ptr); |
272 | assert(Out % alignof(T) == 0 && "Wrong alignment information"); |
273 | return Out / alignof(T); |
274 | } |
275 | |
276 | size_t getTotalMemory() const { |
277 | size_t TotalMemory = 0; |
278 | for (auto I = Slabs.begin(), E = Slabs.end(); I != E; ++I) |
279 | TotalMemory += computeSlabSize(std::distance(Slabs.begin(), I)); |
280 | for (auto &PtrAndSize : CustomSizedSlabs) |
281 | TotalMemory += PtrAndSize.second; |
282 | return TotalMemory; |
283 | } |
284 | |
285 | size_t getBytesAllocated() const { return BytesAllocated; } |
286 | |
287 | void setRedZoneSize(size_t NewSize) { |
288 | RedZoneSize = NewSize; |
289 | } |
290 | |
291 | void PrintStats() const { |
292 | detail::printBumpPtrAllocatorStats(Slabs.size(), BytesAllocated, |
293 | getTotalMemory()); |
294 | } |
295 | |
296 | private: |
297 | |
298 | |
299 | |
300 | char *CurPtr = nullptr; |
301 | |
302 | |
303 | char *End = nullptr; |
304 | |
305 | |
306 | SmallVector<void *, 4> Slabs; |
307 | |
308 | |
309 | SmallVector<std::pair<void *, size_t>, 0> CustomSizedSlabs; |
310 | |
311 | |
312 | |
313 | |
314 | size_t BytesAllocated = 0; |
315 | |
316 | |
317 | |
318 | size_t RedZoneSize = 1; |
319 | |
320 | static size_t computeSlabSize(unsigned SlabIdx) { |
321 | |
322 | |
323 | |
324 | |
325 | return SlabSize * |
326 | ((size_t)1 << std::min<size_t>(30, SlabIdx / GrowthDelay)); |
327 | } |
328 | |
329 | |
330 | |
331 | void StartNewSlab() { |
332 | size_t AllocatedSlabSize = computeSlabSize(Slabs.size()); |
333 | |
334 | void *NewSlab = |
335 | AllocatorT::Allocate(AllocatedSlabSize, alignof(std::max_align_t)); |
336 | |
337 | |
338 | __asan_poison_memory_region(NewSlab, AllocatedSlabSize); |
339 | |
340 | Slabs.push_back(NewSlab); |
341 | CurPtr = (char *)(NewSlab); |
342 | End = ((char *)NewSlab) + AllocatedSlabSize; |
343 | } |
344 | |
345 | |
346 | void DeallocateSlabs(SmallVectorImpl<void *>::iterator I, |
347 | SmallVectorImpl<void *>::iterator E) { |
348 | for (; I != E; ++I) { |
349 | size_t AllocatedSlabSize = |
350 | computeSlabSize(std::distance(Slabs.begin(), I)); |
351 | AllocatorT::Deallocate(*I, AllocatedSlabSize, alignof(std::max_align_t)); |
352 | } |
353 | } |
354 | |
355 | |
356 | void DeallocateCustomSizedSlabs() { |
357 | for (auto &PtrAndSize : CustomSizedSlabs) { |
358 | void *Ptr = PtrAndSize.first; |
359 | size_t Size = PtrAndSize.second; |
360 | AllocatorT::Deallocate(Ptr, Size, alignof(std::max_align_t)); |
361 | } |
362 | } |
363 | |
364 | template <typename T> friend class SpecificBumpPtrAllocator; |
365 | }; |
366 | |
367 | |
368 | |
369 | typedef BumpPtrAllocatorImpl<> BumpPtrAllocator; |
370 | |
371 | |
372 | |
373 | |
374 | |
375 | |
376 | template <typename T> class SpecificBumpPtrAllocator { |
377 | BumpPtrAllocator Allocator; |
378 | |
379 | public: |
380 | SpecificBumpPtrAllocator() { |
381 | |
382 | |
383 | Allocator.setRedZoneSize(0); |
384 | } |
385 | SpecificBumpPtrAllocator(SpecificBumpPtrAllocator &&Old) |
386 | : Allocator(std::move(Old.Allocator)) {} |
387 | ~SpecificBumpPtrAllocator() { DestroyAll(); } |
388 | |
389 | SpecificBumpPtrAllocator &operator=(SpecificBumpPtrAllocator &&RHS) { |
390 | Allocator = std::move(RHS.Allocator); |
391 | return *this; |
392 | } |
393 | |
394 | |
395 | |
396 | |
397 | void DestroyAll() { |
398 | auto DestroyElements = [](char *Begin, char *End) { |
399 | assert(Begin == (char *)alignAddr(Begin, Align::Of<T>())); |
400 | for (char *Ptr = Begin; Ptr + sizeof(T) <= End; Ptr += sizeof(T)) |
401 | reinterpret_cast<T *>(Ptr)->~T(); |
402 | }; |
403 | |
404 | for (auto I = Allocator.Slabs.begin(), E = Allocator.Slabs.end(); I != E; |
405 | ++I) { |
406 | size_t AllocatedSlabSize = BumpPtrAllocator::computeSlabSize( |
407 | std::distance(Allocator.Slabs.begin(), I)); |
408 | char *Begin = (char *)alignAddr(*I, Align::Of<T>()); |
409 | char *End = *I == Allocator.Slabs.back() ? Allocator.CurPtr |
410 | : (char *)*I + AllocatedSlabSize; |
411 | |
412 | DestroyElements(Begin, End); |
413 | } |
414 | |
415 | for (auto &PtrAndSize : Allocator.CustomSizedSlabs) { |
416 | void *Ptr = PtrAndSize.first; |
417 | size_t Size = PtrAndSize.second; |
418 | DestroyElements((char *)alignAddr(Ptr, Align::Of<T>()), |
419 | (char *)Ptr + Size); |
420 | } |
421 | |
422 | Allocator.Reset(); |
423 | } |
424 | |
425 | |
426 | T *Allocate(size_t num = 1) { return Allocator.Allocate<T>(num); } |
427 | }; |
428 | |
429 | } |
430 | |
431 | template <typename AllocatorT, size_t SlabSize, size_t SizeThreshold, |
432 | size_t GrowthDelay> |
433 | void * |
434 | operator new(size_t Size, |
435 | llvm::BumpPtrAllocatorImpl<AllocatorT, SlabSize, SizeThreshold, |
436 | GrowthDelay> &Allocator) { |
437 | return Allocator.Allocate(Size, std::min((size_t)llvm::NextPowerOf2(Size), |
| 8 | | Calling 'BumpPtrAllocatorImpl::Allocate' | |
|
438 | alignof(std::max_align_t))); |
439 | } |
440 | |
441 | template <typename AllocatorT, size_t SlabSize, size_t SizeThreshold, |
442 | size_t GrowthDelay> |
443 | void operator delete(void *, |
444 | llvm::BumpPtrAllocatorImpl<AllocatorT, SlabSize, |
445 | SizeThreshold, GrowthDelay> &) { |
446 | } |
447 | |
448 | #endif // LLVM_SUPPORT_ALLOCATOR_H |
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 | |
10 | |
11 | |
12 | |
13 | |
14 | |
15 | |
16 | |
17 | |
18 | |
19 | |
20 | |
21 | #ifndef LLVM_SUPPORT_ALIGNMENT_H_ |
22 | #define LLVM_SUPPORT_ALIGNMENT_H_ |
23 | |
24 | #include "llvm/ADT/Optional.h" |
25 | #include "llvm/Support/MathExtras.h" |
26 | #include <cassert> |
27 | #ifndef NDEBUG |
28 | #include <string> |
29 | #endif // NDEBUG |
30 | |
31 | namespace llvm { |
32 | |
33 | #define ALIGN_CHECK_ISPOSITIVE(decl) \ |
34 | assert(decl > 0 && (#decl " should be defined")) |
35 | |
36 | |
37 | |
38 | |
39 | struct Align { |
40 | private: |
41 | uint8_t ShiftValue = 0; |
42 | |
43 | |
44 | friend struct MaybeAlign; |
45 | friend unsigned Log2(Align); |
46 | friend bool operator==(Align Lhs, Align Rhs); |
47 | friend bool operator!=(Align Lhs, Align Rhs); |
48 | friend bool operator<=(Align Lhs, Align Rhs); |
49 | friend bool operator>=(Align Lhs, Align Rhs); |
50 | friend bool operator<(Align Lhs, Align Rhs); |
51 | friend bool operator>(Align Lhs, Align Rhs); |
52 | friend unsigned encode(struct MaybeAlign A); |
53 | friend struct MaybeAlign decodeMaybeAlign(unsigned Value); |
54 | |
55 | |
56 | |
57 | |
58 | |
59 | |
60 | |
61 | |
62 | struct LogValue { |
63 | uint8_t Log; |
64 | }; |
65 | |
66 | public: |
67 | |
68 | constexpr Align() = default; |
69 | |
70 | |
71 | constexpr Align(const Align &Other) = default; |
72 | constexpr Align(Align &&Other) = default; |
73 | Align &operator=(const Align &Other) = default; |
74 | Align &operator=(Align &&Other) = default; |
75 | |
76 | explicit Align(uint64_t Value) { |
77 | assert(Value > 0 && "Value must not be 0"); |
78 | assert(llvm::isPowerOf2_64(Value) && "Alignment is not a power of 2"); |
79 | ShiftValue = Log2_64(Value); |
80 | assert(ShiftValue < 64 && "Broken invariant"); |
81 | } |
82 | |
83 | |
84 | |
85 | uint64_t value() const { return uint64_t(1) << ShiftValue; } |
| 15 | | The result of the left shift is undefined due to shifting by '255', which is greater or equal to the width of type 'uint64_t' |
|
86 | |
87 | |
88 | template <size_t kValue> constexpr static LogValue Constant() { |
89 | return LogValue{static_cast<uint8_t>(CTLog2<kValue>())}; |
90 | } |
91 | |
92 | |
93 | |
94 | template <typename T> constexpr static LogValue Of() { |
95 | return Constant<std::alignment_of<T>::value>(); |
96 | } |
97 | |
98 | |
99 | constexpr Align(LogValue CA) : ShiftValue(CA.Log) {} |
100 | }; |
101 | |
102 | |
103 | inline Align assumeAligned(uint64_t Value) { |
104 | return Value ? Align(Value) : Align(); |
105 | } |
106 | |
107 | |
108 | |
109 | struct MaybeAlign : public llvm::Optional<Align> { |
110 | private: |
111 | using UP = llvm::Optional<Align>; |
112 | |
113 | public: |
114 | |
115 | MaybeAlign() = default; |
116 | |
117 | |
118 | MaybeAlign(const MaybeAlign &Other) = default; |
119 | MaybeAlign &operator=(const MaybeAlign &Other) = default; |
120 | MaybeAlign(MaybeAlign &&Other) = default; |
121 | MaybeAlign &operator=(MaybeAlign &&Other) = default; |
122 | |
123 | |
124 | using UP::UP; |
125 | |
126 | explicit MaybeAlign(uint64_t Value) { |
127 | assert((Value == 0 || llvm::isPowerOf2_64(Value)) && |
128 | "Alignment is neither 0 nor a power of 2"); |
129 | if (Value) |
130 | emplace(Value); |
131 | } |
132 | |
133 | |
134 | Align valueOrOne() const { return hasValue() ? getValue() : Align(); } |
135 | }; |
136 | |
137 | |
138 | inline bool isAligned(Align Lhs, uint64_t SizeInBytes) { |
139 | return SizeInBytes % Lhs.value() == 0; |
140 | } |
141 | |
142 | |
143 | inline bool isAddrAligned(Align Lhs, const void *Addr) { |
144 | return isAligned(Lhs, reinterpret_cast<uintptr_t>(Addr)); |
145 | } |
146 | |
147 | |
148 | inline uint64_t alignTo(uint64_t Size, Align A) { |
149 | const uint64_t Value = A.value(); |
| |
150 | |
151 | |
152 | |
153 | |
154 | |
155 | |
156 | |
157 | |
158 | |
159 | return (Size + Value - 1) & ~(Value - 1U); |
160 | } |
161 | |
162 | |
163 | |
164 | |
165 | |
166 | |
167 | |
168 | |
169 | |
170 | |
171 | |
172 | |
173 | inline uint64_t alignTo(uint64_t Size, Align A, uint64_t Skew) { |
174 | const uint64_t Value = A.value(); |
175 | Skew %= Value; |
176 | return ((Size + Value - 1 - Skew) & ~(Value - 1U)) + Skew; |
177 | } |
178 | |
179 | |
180 | |
181 | inline uint64_t alignTo(uint64_t Size, MaybeAlign A) { |
182 | return A ? alignTo(Size, A.getValue()) : Size; |
183 | } |
184 | |
185 | |
186 | inline uintptr_t alignAddr(const void *Addr, Align Alignment) { |
187 | uintptr_t ArithAddr = reinterpret_cast<uintptr_t>(Addr); |
188 | assert(static_cast<uintptr_t>(ArithAddr + Alignment.value() - 1) >= |
189 | ArithAddr && |
190 | "Overflow"); |
191 | return alignTo(ArithAddr, Alignment); |
192 | } |
193 | |
194 | |
195 | |
196 | inline uint64_t offsetToAlignment(uint64_t Value, Align Alignment) { |
197 | return alignTo(Value, Alignment) - Value; |
| 12 | | The value 255 is assigned to 'A.ShiftValue' | |
|
| |
198 | } |
199 | |
200 | |
201 | |
202 | inline uint64_t offsetToAlignedAddr(const void *Addr, Align Alignment) { |
203 | return offsetToAlignment(reinterpret_cast<uintptr_t>(Addr), Alignment); |
| 11 | | Calling 'offsetToAlignment' | |
|
204 | } |
205 | |
206 | |
207 | inline unsigned Log2(Align A) { return A.ShiftValue; } |
208 | |
209 | |
210 | |
211 | inline Align commonAlignment(Align A, Align B) { return std::min(A, B); } |
212 | |
213 | |
214 | |
215 | inline Align commonAlignment(Align A, uint64_t Offset) { |
216 | return Align(MinAlign(A.value(), Offset)); |
217 | } |
218 | |
219 | |
220 | |
221 | inline MaybeAlign commonAlignment(MaybeAlign A, MaybeAlign B) { |
222 | return A && B ? commonAlignment(*A, *B) : A ? A : B; |
223 | } |
224 | |
225 | |
226 | |
227 | inline MaybeAlign commonAlignment(MaybeAlign A, uint64_t Offset) { |
228 | return MaybeAlign(MinAlign((*A).value(), Offset)); |
229 | } |
230 | |
231 | |
232 | inline unsigned encode(MaybeAlign A) { return A ? A->ShiftValue + 1 : 0; } |
233 | |
234 | |
235 | inline MaybeAlign decodeMaybeAlign(unsigned Value) { |
236 | if (Value == 0) |
237 | return MaybeAlign(); |
238 | Align Out; |
239 | Out.ShiftValue = Value - 1; |
240 | return Out; |
241 | } |
242 | |
243 | |
244 | |
245 | inline unsigned encode(Align A) { return encode(MaybeAlign(A)); } |
246 | |
247 | |
248 | inline bool operator==(Align Lhs, uint64_t Rhs) { |
249 | ALIGN_CHECK_ISPOSITIVE(Rhs); |
250 | return Lhs.value() == Rhs; |
251 | } |
252 | inline bool operator!=(Align Lhs, uint64_t Rhs) { |
253 | ALIGN_CHECK_ISPOSITIVE(Rhs); |
254 | return Lhs.value() != Rhs; |
255 | } |
256 | inline bool operator<=(Align Lhs, uint64_t Rhs) { |
257 | ALIGN_CHECK_ISPOSITIVE(Rhs); |
258 | return Lhs.value() <= Rhs; |
259 | } |
260 | inline bool operator>=(Align Lhs, uint64_t Rhs) { |
261 | ALIGN_CHECK_ISPOSITIVE(Rhs); |
262 | return Lhs.value() >= Rhs; |
263 | } |
264 | inline bool operator<(Align Lhs, uint64_t Rhs) { |
265 | ALIGN_CHECK_ISPOSITIVE(Rhs); |
266 | return Lhs.value() < Rhs; |
267 | } |
268 | inline bool operator>(Align Lhs, uint64_t Rhs) { |
269 | ALIGN_CHECK_ISPOSITIVE(Rhs); |
270 | return Lhs.value() > Rhs; |
271 | } |
272 | |
273 | |
274 | inline bool operator==(MaybeAlign Lhs, uint64_t Rhs) { |
275 | return Lhs ? (*Lhs).value() == Rhs : Rhs == 0; |
276 | } |
277 | inline bool operator!=(MaybeAlign Lhs, uint64_t Rhs) { |
278 | return Lhs ? (*Lhs).value() != Rhs : Rhs != 0; |
279 | } |
280 | |
281 | |
282 | inline bool operator==(Align Lhs, Align Rhs) { |
283 | return Lhs.ShiftValue == Rhs.ShiftValue; |
284 | } |
285 | inline bool operator!=(Align Lhs, Align Rhs) { |
286 | return Lhs.ShiftValue != Rhs.ShiftValue; |
287 | } |
288 | inline bool operator<=(Align Lhs, Align Rhs) { |
289 | return Lhs.ShiftValue <= Rhs.ShiftValue; |
290 | } |
291 | inline bool operator>=(Align Lhs, Align Rhs) { |
292 | return Lhs.ShiftValue >= Rhs.ShiftValue; |
293 | } |
294 | inline bool operator<(Align Lhs, Align Rhs) { |
295 | return Lhs.ShiftValue < Rhs.ShiftValue; |
296 | } |
297 | inline bool operator>(Align Lhs, Align Rhs) { |
298 | return Lhs.ShiftValue > Rhs.ShiftValue; |
299 | } |
300 | |
301 | |
302 | bool operator<=(Align Lhs, MaybeAlign Rhs) = delete; |
303 | bool operator>=(Align Lhs, MaybeAlign Rhs) = delete; |
304 | bool operator<(Align Lhs, MaybeAlign Rhs) = delete; |
305 | bool operator>(Align Lhs, MaybeAlign Rhs) = delete; |
306 | |
307 | bool operator<=(MaybeAlign Lhs, Align Rhs) = delete; |
308 | bool operator>=(MaybeAlign Lhs, Align Rhs) = delete; |
309 | bool operator<(MaybeAlign Lhs, Align Rhs) = delete; |
310 | bool operator>(MaybeAlign Lhs, Align Rhs) = delete; |
311 | |
312 | bool operator<=(MaybeAlign Lhs, MaybeAlign Rhs) = delete; |
313 | bool operator>=(MaybeAlign Lhs, MaybeAlign Rhs) = delete; |
314 | bool operator<(MaybeAlign Lhs, MaybeAlign Rhs) = delete; |
315 | bool operator>(MaybeAlign Lhs, MaybeAlign Rhs) = delete; |
316 | |
317 | inline Align operator*(Align Lhs, uint64_t Rhs) { |
318 | assert(Rhs > 0 && "Rhs must be positive"); |
319 | return Align(Lhs.value() * Rhs); |
320 | } |
321 | |
322 | inline MaybeAlign operator*(MaybeAlign Lhs, uint64_t Rhs) { |
323 | assert(Rhs > 0 && "Rhs must be positive"); |
324 | return Lhs ? Lhs.getValue() * Rhs : MaybeAlign(); |
325 | } |
326 | |
327 | inline Align operator/(Align Lhs, uint64_t Divisor) { |
328 | assert(llvm::isPowerOf2_64(Divisor) && |
329 | "Divisor must be positive and a power of 2"); |
330 | assert(Lhs != 1 && "Can't halve byte alignment"); |
331 | return Align(Lhs.value() / Divisor); |
332 | } |
333 | |
334 | inline MaybeAlign operator/(MaybeAlign Lhs, uint64_t Divisor) { |
335 | assert(llvm::isPowerOf2_64(Divisor) && |
336 | "Divisor must be positive and a power of 2"); |
337 | return Lhs ? Lhs.getValue() / Divisor : MaybeAlign(); |
338 | } |
339 | |
340 | inline Align max(MaybeAlign Lhs, Align Rhs) { |
341 | return Lhs && *Lhs > Rhs ? *Lhs : Rhs; |
342 | } |
343 | |
344 | inline Align max(Align Lhs, MaybeAlign Rhs) { |
345 | return Rhs && *Rhs > Lhs ? *Rhs : Lhs; |
346 | } |
347 | |
348 | #ifndef NDEBUG |
349 | |
350 | inline std::string DebugStr(const Align &A) { |
351 | return std::to_string(A.value()); |
352 | } |
353 | |
354 | inline std::string DebugStr(const MaybeAlign &MA) { |
355 | if (MA) |
356 | return std::to_string(MA->value()); |
357 | return "None"; |
358 | } |
359 | #endif // NDEBUG |
360 | |
361 | #undef ALIGN_CHECK_ISPOSITIVE |
362 | |
363 | } |
364 | |
365 | #endif // LLVM_SUPPORT_ALIGNMENT_H_ |