clang -cc1 -cc1 -triple amd64-unknown-openbsd7.0 -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name ByteCodeExprGen.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/libclangAST/obj -resource-dir /usr/local/lib/clang/13.0.0 -I /usr/src/gnu/usr.bin/clang/libclangAST/obj/../include/clang/AST -I /usr/src/gnu/usr.bin/clang/libclangAST/../../../llvm/clang/include -I /usr/src/gnu/usr.bin/clang/libclangAST/../../../llvm/llvm/include -I /usr/src/gnu/usr.bin/clang/libclangAST/../include -I /usr/src/gnu/usr.bin/clang/libclangAST/obj -I /usr/src/gnu/usr.bin/clang/libclangAST/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/libclangAST/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/libclangAST/../../../llvm/clang/lib/AST/Interp/ByteCodeExprGen.cpp
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 | #include "ByteCodeExprGen.h" |
10 | #include "ByteCodeEmitter.h" |
11 | #include "ByteCodeGenError.h" |
12 | #include "Context.h" |
13 | #include "Function.h" |
14 | #include "PrimType.h" |
15 | #include "Program.h" |
16 | #include "State.h" |
17 | |
18 | using namespace clang; |
19 | using namespace clang::interp; |
20 | |
21 | using APSInt = llvm::APSInt; |
22 | template <typename T> using Expected = llvm::Expected<T>; |
23 | template <typename T> using Optional = llvm::Optional<T>; |
24 | |
25 | namespace clang { |
26 | namespace interp { |
27 | |
28 | |
29 | template <class Emitter> class DeclScope final : public LocalScope<Emitter> { |
30 | public: |
31 | DeclScope(ByteCodeExprGen<Emitter> *Ctx, const VarDecl *VD) |
32 | : LocalScope<Emitter>(Ctx), Scope(Ctx->P, VD) {} |
33 | |
34 | void addExtended(const Scope::Local &Local) override { |
35 | return this->addLocal(Local); |
36 | } |
37 | |
38 | private: |
39 | Program::DeclScope Scope; |
40 | }; |
41 | |
42 | |
43 | template <class Emitter> class OptionScope { |
44 | public: |
45 | using InitFnRef = typename ByteCodeExprGen<Emitter>::InitFnRef; |
46 | using ChainedInitFnRef = std::function<bool(InitFnRef)>; |
47 | |
48 | |
49 | OptionScope(ByteCodeExprGen<Emitter> *Ctx, bool NewDiscardResult) |
50 | : Ctx(Ctx), OldDiscardResult(Ctx->DiscardResult), |
51 | OldInitFn(std::move(Ctx->InitFn)) { |
52 | Ctx->DiscardResult = NewDiscardResult; |
53 | Ctx->InitFn = llvm::Optional<InitFnRef>{}; |
54 | } |
55 | |
56 | |
57 | OptionScope(ByteCodeExprGen<Emitter> *Ctx, InitFnRef NewInitFn) |
58 | : Ctx(Ctx), OldDiscardResult(Ctx->DiscardResult), |
59 | OldInitFn(std::move(Ctx->InitFn)) { |
60 | Ctx->DiscardResult = true; |
61 | Ctx->InitFn = NewInitFn; |
62 | } |
63 | |
64 | |
65 | OptionScope(ByteCodeExprGen<Emitter> *Ctx, ChainedInitFnRef NewInitFn) |
66 | : Ctx(Ctx), OldDiscardResult(Ctx->DiscardResult), |
67 | OldInitFn(std::move(Ctx->InitFn)) { |
68 | assert(OldInitFn && "missing initializer"); |
69 | Ctx->InitFn = [this, NewInitFn] { return NewInitFn(*OldInitFn); }; |
70 | } |
71 | |
72 | ~OptionScope() { |
73 | Ctx->DiscardResult = OldDiscardResult; |
74 | Ctx->InitFn = std::move(OldInitFn); |
75 | } |
76 | |
77 | private: |
78 | |
79 | ByteCodeExprGen<Emitter> *Ctx; |
80 | |
81 | bool OldDiscardResult; |
82 | |
83 | llvm::Optional<InitFnRef> OldInitFn; |
84 | }; |
85 | |
86 | } |
87 | } |
88 | |
89 | template <class Emitter> |
90 | bool ByteCodeExprGen<Emitter>::VisitCastExpr(const CastExpr *CE) { |
91 | auto *SubExpr = CE->getSubExpr(); |
92 | switch (CE->getCastKind()) { |
93 | |
94 | case CK_LValueToRValue: { |
95 | return dereference( |
96 | CE->getSubExpr(), DerefKind::Read, |
97 | [](PrimType) { |
98 | |
99 | return true; |
100 | }, |
101 | [this, CE](PrimType T) { |
102 | |
103 | if (!this->emitLoadPop(T, CE)) |
104 | return false; |
105 | return DiscardResult ? this->emitPop(T, CE) : true; |
106 | }); |
107 | } |
108 | |
109 | case CK_ArrayToPointerDecay: |
110 | case CK_AtomicToNonAtomic: |
111 | case CK_ConstructorConversion: |
112 | case CK_FunctionToPointerDecay: |
113 | case CK_NonAtomicToAtomic: |
114 | case CK_NoOp: |
115 | case CK_UserDefinedConversion: |
116 | return this->Visit(SubExpr); |
117 | |
118 | case CK_ToVoid: |
119 | return discard(SubExpr); |
120 | |
121 | default: { |
122 | |
123 | return this->bail(CE); |
124 | } |
125 | } |
126 | } |
127 | |
128 | template <class Emitter> |
129 | bool ByteCodeExprGen<Emitter>::VisitIntegerLiteral(const IntegerLiteral *LE) { |
130 | if (DiscardResult) |
131 | return true; |
132 | |
133 | auto Val = LE->getValue(); |
134 | QualType LitTy = LE->getType(); |
135 | if (Optional<PrimType> T = classify(LitTy)) |
136 | return emitConst(*T, getIntWidth(LitTy), LE->getValue(), LE); |
137 | return this->bail(LE); |
138 | } |
139 | |
140 | template <class Emitter> |
141 | bool ByteCodeExprGen<Emitter>::VisitParenExpr(const ParenExpr *PE) { |
142 | return this->Visit(PE->getSubExpr()); |
143 | } |
144 | |
145 | template <class Emitter> |
146 | bool ByteCodeExprGen<Emitter>::VisitBinaryOperator(const BinaryOperator *BO) { |
147 | const Expr *LHS = BO->getLHS(); |
148 | const Expr *RHS = BO->getRHS(); |
149 | |
150 | |
151 | switch (BO->getOpcode()) { |
152 | case BO_Comma: |
153 | if (!discard(LHS)) |
154 | return false; |
155 | if (!this->Visit(RHS)) |
156 | return false; |
157 | return true; |
158 | default: |
159 | break; |
160 | } |
161 | |
162 | |
163 | Optional<PrimType> LT = classify(LHS->getType()); |
164 | Optional<PrimType> RT = classify(RHS->getType()); |
165 | if (!LT || !RT) { |
166 | return this->bail(BO); |
167 | } |
168 | |
169 | if (Optional<PrimType> T = classify(BO->getType())) { |
170 | if (!visit(LHS)) |
171 | return false; |
172 | if (!visit(RHS)) |
173 | return false; |
174 | |
175 | auto Discard = [this, T, BO](bool Result) { |
176 | if (!Result) |
177 | return false; |
178 | return DiscardResult ? this->emitPop(*T, BO) : true; |
179 | }; |
180 | |
181 | switch (BO->getOpcode()) { |
182 | case BO_EQ: |
183 | return Discard(this->emitEQ(*LT, BO)); |
184 | case BO_NE: |
185 | return Discard(this->emitNE(*LT, BO)); |
186 | case BO_LT: |
187 | return Discard(this->emitLT(*LT, BO)); |
188 | case BO_LE: |
189 | return Discard(this->emitLE(*LT, BO)); |
190 | case BO_GT: |
191 | return Discard(this->emitGT(*LT, BO)); |
192 | case BO_GE: |
193 | return Discard(this->emitGE(*LT, BO)); |
194 | case BO_Sub: |
195 | return Discard(this->emitSub(*T, BO)); |
196 | case BO_Add: |
197 | return Discard(this->emitAdd(*T, BO)); |
198 | case BO_Mul: |
199 | return Discard(this->emitMul(*T, BO)); |
200 | default: |
201 | return this->bail(BO); |
202 | } |
203 | } |
204 | |
205 | return this->bail(BO); |
206 | } |
207 | |
208 | template <class Emitter> |
209 | bool ByteCodeExprGen<Emitter>::discard(const Expr *E) { |
210 | OptionScope<Emitter> Scope(this, true); |
211 | return this->Visit(E); |
212 | } |
213 | |
214 | template <class Emitter> |
215 | bool ByteCodeExprGen<Emitter>::visit(const Expr *E) { |
216 | OptionScope<Emitter> Scope(this, false); |
217 | return this->Visit(E); |
218 | } |
219 | |
220 | template <class Emitter> |
221 | bool ByteCodeExprGen<Emitter>::visitBool(const Expr *E) { |
222 | if (Optional<PrimType> T = classify(E->getType())) { |
223 | return visit(E); |
224 | } else { |
225 | return this->bail(E); |
226 | } |
227 | } |
228 | |
229 | template <class Emitter> |
230 | bool ByteCodeExprGen<Emitter>::visitZeroInitializer(PrimType T, const Expr *E) { |
231 | switch (T) { |
232 | case PT_Bool: |
233 | return this->emitZeroBool(E); |
234 | case PT_Sint8: |
235 | return this->emitZeroSint8(E); |
236 | case PT_Uint8: |
237 | return this->emitZeroUint8(E); |
238 | case PT_Sint16: |
239 | return this->emitZeroSint16(E); |
240 | case PT_Uint16: |
241 | return this->emitZeroUint16(E); |
242 | case PT_Sint32: |
243 | return this->emitZeroSint32(E); |
244 | case PT_Uint32: |
245 | return this->emitZeroUint32(E); |
246 | case PT_Sint64: |
247 | return this->emitZeroSint64(E); |
248 | case PT_Uint64: |
249 | return this->emitZeroUint64(E); |
250 | case PT_Ptr: |
251 | return this->emitNullPtr(E); |
252 | } |
253 | llvm_unreachable("unknown primitive type"); |
254 | } |
255 | |
256 | template <class Emitter> |
257 | bool ByteCodeExprGen<Emitter>::dereference( |
258 | const Expr *LV, DerefKind AK, llvm::function_ref<bool(PrimType)> Direct, |
259 | llvm::function_ref<bool(PrimType)> Indirect) { |
260 | if (Optional<PrimType> T = classify(LV->getType())) { |
261 | if (!LV->refersToBitField()) { |
262 | |
263 | if (auto *DE = dyn_cast<DeclRefExpr>(LV)) { |
264 | if (!DE->getDecl()->getType()->isReferenceType()) { |
265 | if (auto *PD = dyn_cast<ParmVarDecl>(DE->getDecl())) |
266 | return dereferenceParam(LV, *T, PD, AK, Direct, Indirect); |
267 | if (auto *VD = dyn_cast<VarDecl>(DE->getDecl())) |
268 | return dereferenceVar(LV, *T, VD, AK, Direct, Indirect); |
269 | } |
270 | } |
271 | } |
272 | |
273 | if (!visit(LV)) |
274 | return false; |
275 | return Indirect(*T); |
276 | } |
277 | |
278 | return false; |
279 | } |
280 | |
281 | template <class Emitter> |
282 | bool ByteCodeExprGen<Emitter>::dereferenceParam( |
283 | const Expr *LV, PrimType T, const ParmVarDecl *PD, DerefKind AK, |
284 | llvm::function_ref<bool(PrimType)> Direct, |
285 | llvm::function_ref<bool(PrimType)> Indirect) { |
286 | auto It = this->Params.find(PD); |
287 | if (It != this->Params.end()) { |
288 | unsigned Idx = It->second; |
289 | switch (AK) { |
290 | case DerefKind::Read: |
291 | return DiscardResult ? true : this->emitGetParam(T, Idx, LV); |
292 | |
293 | case DerefKind::Write: |
294 | if (!Direct(T)) |
295 | return false; |
296 | if (!this->emitSetParam(T, Idx, LV)) |
297 | return false; |
298 | return DiscardResult ? true : this->emitGetPtrParam(Idx, LV); |
299 | |
300 | case DerefKind::ReadWrite: |
301 | if (!this->emitGetParam(T, Idx, LV)) |
302 | return false; |
303 | if (!Direct(T)) |
304 | return false; |
305 | if (!this->emitSetParam(T, Idx, LV)) |
306 | return false; |
307 | return DiscardResult ? true : this->emitGetPtrParam(Idx, LV); |
308 | } |
309 | return true; |
310 | } |
311 | |
312 | |
313 | if (!DiscardResult && T == PT_Ptr && AK == DerefKind::Read) { |
314 | if (auto Idx = P.getOrCreateDummy(PD)) |
315 | return this->emitGetPtrGlobal(*Idx, PD); |
316 | return false; |
317 | } |
318 | |
319 | |
320 | return visit(LV) && Indirect(T); |
321 | } |
322 | |
323 | template <class Emitter> |
324 | bool ByteCodeExprGen<Emitter>::dereferenceVar( |
325 | const Expr *LV, PrimType T, const VarDecl *VD, DerefKind AK, |
326 | llvm::function_ref<bool(PrimType)> Direct, |
327 | llvm::function_ref<bool(PrimType)> Indirect) { |
328 | auto It = Locals.find(VD); |
329 | if (It != Locals.end()) { |
330 | const auto &L = It->second; |
331 | switch (AK) { |
332 | case DerefKind::Read: |
333 | if (!this->emitGetLocal(T, L.Offset, LV)) |
334 | return false; |
335 | return DiscardResult ? this->emitPop(T, LV) : true; |
336 | |
337 | case DerefKind::Write: |
338 | if (!Direct(T)) |
339 | return false; |
340 | if (!this->emitSetLocal(T, L.Offset, LV)) |
341 | return false; |
342 | return DiscardResult ? true : this->emitGetPtrLocal(L.Offset, LV); |
343 | |
344 | case DerefKind::ReadWrite: |
345 | if (!this->emitGetLocal(T, L.Offset, LV)) |
346 | return false; |
347 | if (!Direct(T)) |
348 | return false; |
349 | if (!this->emitSetLocal(T, L.Offset, LV)) |
350 | return false; |
351 | return DiscardResult ? true : this->emitGetPtrLocal(L.Offset, LV); |
352 | } |
353 | } else if (auto Idx = getGlobalIdx(VD)) { |
354 | switch (AK) { |
355 | case DerefKind::Read: |
356 | if (!this->emitGetGlobal(T, *Idx, LV)) |
357 | return false; |
358 | return DiscardResult ? this->emitPop(T, LV) : true; |
359 | |
360 | case DerefKind::Write: |
361 | if (!Direct(T)) |
362 | return false; |
363 | if (!this->emitSetGlobal(T, *Idx, LV)) |
364 | return false; |
365 | return DiscardResult ? true : this->emitGetPtrGlobal(*Idx, LV); |
366 | |
367 | case DerefKind::ReadWrite: |
368 | if (!this->emitGetGlobal(T, *Idx, LV)) |
369 | return false; |
370 | if (!Direct(T)) |
371 | return false; |
372 | if (!this->emitSetGlobal(T, *Idx, LV)) |
373 | return false; |
374 | return DiscardResult ? true : this->emitGetPtrGlobal(*Idx, LV); |
375 | } |
376 | } |
377 | |
378 | |
379 | |
380 | |
381 | if (!DiscardResult && AK == DerefKind::Read) { |
382 | if (VD->hasLocalStorage() && VD->hasInit() && !VD->isConstexpr()) { |
383 | QualType VT = VD->getType(); |
384 | if (VT.isConstQualified() && VT->isFundamentalType()) |
385 | return this->Visit(VD->getInit()); |
386 | } |
387 | } |
388 | |
389 | |
390 | return visit(LV) && Indirect(T); |
391 | } |
392 | |
393 | template <class Emitter> |
394 | bool ByteCodeExprGen<Emitter>::emitConst(PrimType T, unsigned NumBits, |
395 | const APInt &Value, const Expr *E) { |
396 | switch (T) { |
397 | case PT_Sint8: |
398 | return this->emitConstSint8(Value.getSExtValue(), E); |
399 | case PT_Uint8: |
400 | return this->emitConstUint8(Value.getZExtValue(), E); |
401 | case PT_Sint16: |
402 | return this->emitConstSint16(Value.getSExtValue(), E); |
403 | case PT_Uint16: |
404 | return this->emitConstUint16(Value.getZExtValue(), E); |
405 | case PT_Sint32: |
406 | return this->emitConstSint32(Value.getSExtValue(), E); |
407 | case PT_Uint32: |
408 | return this->emitConstUint32(Value.getZExtValue(), E); |
409 | case PT_Sint64: |
410 | return this->emitConstSint64(Value.getSExtValue(), E); |
411 | case PT_Uint64: |
412 | return this->emitConstUint64(Value.getZExtValue(), E); |
413 | case PT_Bool: |
414 | return this->emitConstBool(Value.getBoolValue(), E); |
415 | case PT_Ptr: |
416 | llvm_unreachable("Invalid integral type"); |
417 | break; |
418 | } |
419 | llvm_unreachable("unknown primitive type"); |
420 | } |
421 | |
422 | template <class Emitter> |
423 | unsigned ByteCodeExprGen<Emitter>::allocateLocalPrimitive(DeclTy &&Src, |
424 | PrimType Ty, |
425 | bool IsConst, |
426 | bool IsExtended) { |
427 | Descriptor *D = P.createDescriptor(Src, Ty, IsConst, Src.is<const Expr *>()); |
| 1 | Calling 'Program::createDescriptor' | |
|
428 | Scope::Local Local = this->createLocal(D); |
429 | if (auto *VD = dyn_cast_or_null<ValueDecl>(Src.dyn_cast<const Decl *>())) |
430 | Locals.insert({VD, Local}); |
431 | VarScope->add(Local, IsExtended); |
432 | return Local.Offset; |
433 | } |
434 | |
435 | template <class Emitter> |
436 | llvm::Optional<unsigned> |
437 | ByteCodeExprGen<Emitter>::allocateLocal(DeclTy &&Src, bool IsExtended) { |
438 | QualType Ty; |
439 | |
440 | const ValueDecl *Key = nullptr; |
441 | bool IsTemporary = false; |
442 | if (auto *VD = dyn_cast_or_null<ValueDecl>(Src.dyn_cast<const Decl *>())) { |
443 | Key = VD; |
444 | Ty = VD->getType(); |
445 | } |
446 | if (auto *E = Src.dyn_cast<const Expr *>()) { |
447 | IsTemporary = true; |
448 | Ty = E->getType(); |
449 | } |
450 | |
451 | Descriptor *D = P.createDescriptor(Src, Ty.getTypePtr(), |
452 | Ty.isConstQualified(), IsTemporary); |
453 | if (!D) |
454 | return {}; |
455 | |
456 | Scope::Local Local = this->createLocal(D); |
457 | if (Key) |
458 | Locals.insert({Key, Local}); |
459 | VarScope->add(Local, IsExtended); |
460 | return Local.Offset; |
461 | } |
462 | |
463 | template <class Emitter> |
464 | bool ByteCodeExprGen<Emitter>::visitInitializer( |
465 | const Expr *Init, InitFnRef InitFn) { |
466 | OptionScope<Emitter> Scope(this, InitFn); |
467 | return this->Visit(Init); |
468 | } |
469 | |
470 | template <class Emitter> |
471 | bool ByteCodeExprGen<Emitter>::getPtrVarDecl(const VarDecl *VD, const Expr *E) { |
472 | |
473 | if (Optional<unsigned> Idx = getGlobalIdx(VD)) { |
474 | if (VD->getType()->isReferenceType()) |
475 | return this->emitGetGlobalPtr(*Idx, E); |
476 | else |
477 | return this->emitGetPtrGlobal(*Idx, E); |
478 | } |
479 | return this->bail(VD); |
480 | } |
481 | |
482 | template <class Emitter> |
483 | llvm::Optional<unsigned> |
484 | ByteCodeExprGen<Emitter>::getGlobalIdx(const VarDecl *VD) { |
485 | if (VD->isConstexpr()) { |
486 | |
487 | return P.getGlobal(VD); |
488 | } |
489 | if (!VD->hasLocalStorage()) { |
490 | |
491 | Program::DeclScope Scope(P, VD); |
492 | return P.getOrCreateGlobal(VD); |
493 | } |
494 | return {}; |
495 | } |
496 | |
497 | template <class Emitter> |
498 | const RecordType *ByteCodeExprGen<Emitter>::getRecordTy(QualType Ty) { |
499 | if (auto *PT = dyn_cast<PointerType>(Ty)) |
500 | return PT->getPointeeType()->getAs<RecordType>(); |
501 | else |
502 | return Ty->getAs<RecordType>(); |
503 | } |
504 | |
505 | template <class Emitter> |
506 | Record *ByteCodeExprGen<Emitter>::getRecord(QualType Ty) { |
507 | if (auto *RecordTy = getRecordTy(Ty)) { |
508 | return getRecord(RecordTy->getDecl()); |
509 | } |
510 | return nullptr; |
511 | } |
512 | |
513 | template <class Emitter> |
514 | Record *ByteCodeExprGen<Emitter>::getRecord(const RecordDecl *RD) { |
515 | return P.getOrCreateRecord(RD); |
516 | } |
517 | |
518 | template <class Emitter> |
519 | bool ByteCodeExprGen<Emitter>::visitExpr(const Expr *Exp) { |
520 | ExprScope<Emitter> RootScope(this); |
521 | if (!visit(Exp)) |
522 | return false; |
523 | |
524 | if (Optional<PrimType> T = classify(Exp)) |
525 | return this->emitRet(*T, Exp); |
526 | else |
527 | return this->emitRetValue(Exp); |
528 | } |
529 | |
530 | template <class Emitter> |
531 | bool ByteCodeExprGen<Emitter>::visitDecl(const VarDecl *VD) { |
532 | const Expr *Init = VD->getInit(); |
533 | |
534 | if (Optional<unsigned> I = P.createGlobal(VD)) { |
535 | if (Optional<PrimType> T = classify(VD->getType())) { |
536 | { |
537 | |
538 | DeclScope<Emitter> LocalScope(this, VD); |
539 | if (!visit(Init)) |
540 | return false; |
541 | } |
542 | |
543 | |
544 | if (!this->emitDup(*T, VD)) |
545 | return false; |
546 | if (!this->emitInitGlobal(*T, *I, VD)) |
547 | return false; |
548 | return this->emitRet(*T, VD); |
549 | } else { |
550 | { |
551 | |
552 | DeclScope<Emitter> LocalScope(this, VD); |
553 | if (!visitGlobalInitializer(Init, *I)) |
554 | return false; |
555 | } |
556 | |
557 | |
558 | if (!this->emitGetPtrGlobal(*I, VD)) |
559 | return false; |
560 | return this->emitRetValue(VD); |
561 | } |
562 | } |
563 | |
564 | return this->bail(VD); |
565 | } |
566 | |
567 | template <class Emitter> |
568 | void ByteCodeExprGen<Emitter>::emitCleanup() { |
569 | for (VariableScope<Emitter> *C = VarScope; C; C = C->getParent()) |
570 | C->emitDestruction(); |
571 | } |
572 | |
573 | namespace clang { |
574 | namespace interp { |
575 | |
576 | template class ByteCodeExprGen<ByteCodeEmitter>; |
577 | template class ByteCodeExprGen<EvalEmitter>; |
578 | |
579 | } |
580 | } |
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 | |
10 | |
11 | |
12 | |
13 | #ifndef LLVM_CLANG_AST_INTERP_PROGRAM_H |
14 | #define LLVM_CLANG_AST_INTERP_PROGRAM_H |
15 | |
16 | #include <map> |
17 | #include <vector> |
18 | #include "Function.h" |
19 | #include "Pointer.h" |
20 | #include "PrimType.h" |
21 | #include "Record.h" |
22 | #include "Source.h" |
23 | #include "llvm/ADT/DenseMap.h" |
24 | #include "llvm/ADT/PointerUnion.h" |
25 | #include "llvm/ADT/StringRef.h" |
26 | #include "llvm/Support/Allocator.h" |
27 | |
28 | namespace clang { |
29 | class RecordDecl; |
30 | class Expr; |
31 | class FunctionDecl; |
32 | class Stmt; |
33 | class StringLiteral; |
34 | class VarDecl; |
35 | |
36 | namespace interp { |
37 | class Context; |
38 | class State; |
39 | class Record; |
40 | class Scope; |
41 | |
42 | |
43 | class Program { |
44 | public: |
45 | Program(Context &Ctx) : Ctx(Ctx) {} |
46 | |
47 | |
48 | unsigned createGlobalString(const StringLiteral *S); |
49 | |
50 | |
51 | Pointer getPtrGlobal(unsigned Idx); |
52 | |
53 | |
54 | Block *getGlobal(unsigned Idx) { |
55 | assert(Idx < Globals.size()); |
56 | return Globals[Idx]->block(); |
57 | } |
58 | |
59 | |
60 | llvm::Optional<unsigned> getGlobal(const ValueDecl *VD); |
61 | |
62 | |
63 | llvm::Optional<unsigned> getOrCreateGlobal(const ValueDecl *VD); |
64 | |
65 | |
66 | llvm::Optional<unsigned> getOrCreateDummy(const ParmVarDecl *PD); |
67 | |
68 | |
69 | llvm::Optional<unsigned> createGlobal(const ValueDecl *VD); |
70 | |
71 | |
72 | llvm::Optional<unsigned> createGlobal(const Expr *E); |
73 | |
74 | |
75 | template <typename... Ts> |
76 | Function *createFunction(const FunctionDecl *Def, Ts &&... Args) { |
77 | auto *Func = new Function(*this, Def, std::forward<Ts>(Args)...); |
78 | Funcs.insert({Def, std::unique_ptr<Function>(Func)}); |
79 | return Func; |
80 | } |
81 | |
82 | template <typename... Ts> |
83 | Function *createFunction(Ts &&... Args) { |
84 | auto *Func = new Function(*this, std::forward<Ts>(Args)...); |
85 | AnonFuncs.emplace_back(Func); |
86 | return Func; |
87 | } |
88 | |
89 | |
90 | Function *getFunction(const FunctionDecl *F); |
91 | |
92 | |
93 | |
94 | |
95 | llvm::Expected<Function *> getOrCreateFunction(const FunctionDecl *F); |
96 | |
97 | |
98 | Record *getOrCreateRecord(const RecordDecl *RD); |
99 | |
100 | |
101 | Descriptor *createDescriptor(const DeclTy &D, PrimType Type, |
102 | bool IsConst = false, |
103 | bool IsTemporary = false, |
104 | bool IsMutable = false) { |
105 | return allocateDescriptor(D, Type, IsConst, IsTemporary, IsMutable); |
| 2 | | Calling 'Program::allocateDescriptor' | |
|
106 | } |
107 | |
108 | |
109 | Descriptor *createDescriptor(const DeclTy &D, const Type *Ty, |
110 | bool IsConst = false, bool IsTemporary = false, |
111 | bool IsMutable = false); |
112 | |
113 | |
114 | class DeclScope { |
115 | public: |
116 | DeclScope(Program &P, const VarDecl *VD) : P(P) { P.startDeclaration(VD); } |
117 | ~DeclScope() { P.endDeclaration(); } |
118 | |
119 | private: |
120 | Program &P; |
121 | }; |
122 | |
123 | |
124 | llvm::Optional<unsigned> getCurrentDecl() const { |
125 | if (CurrentDeclaration == NoDeclaration) |
126 | return llvm::Optional<unsigned>{}; |
127 | return LastDeclaration; |
128 | } |
129 | |
130 | private: |
131 | friend class DeclScope; |
132 | |
133 | llvm::Optional<unsigned> createGlobal(const DeclTy &D, QualType Ty, |
134 | bool IsStatic, bool IsExtern); |
135 | |
136 | |
137 | Context &Ctx; |
138 | |
139 | llvm::DenseMap<const FunctionDecl *, std::unique_ptr<Function>> Funcs; |
140 | |
141 | std::vector<std::unique_ptr<Function>> AnonFuncs; |
142 | |
143 | |
144 | llvm::DenseMap<const FunctionDecl *, std::vector<unsigned>> Relocs; |
145 | |
146 | |
147 | using PoolAllocTy = llvm::BumpPtrAllocatorImpl<llvm::MallocAllocator>; |
148 | |
149 | |
150 | |
151 | |
152 | class Global { |
153 | public: |
154 | |
155 | template <typename... Tys> |
156 | Global(Tys... Args) : B(std::forward<Tys>(Args)...) {} |
157 | |
158 | |
159 | void *operator new(size_t Meta, PoolAllocTy &Alloc, size_t Data) { |
160 | return Alloc.Allocate(Meta + Data, alignof(void *)); |
161 | } |
162 | |
163 | |
164 | char *data() { return B.data(); } |
165 | |
166 | Block *block() { return &B; } |
167 | |
168 | private: |
169 | |
170 | Block B; |
171 | }; |
172 | |
173 | |
174 | PoolAllocTy Allocator; |
175 | |
176 | |
177 | std::vector<Global *> Globals; |
178 | |
179 | llvm::DenseMap<const void *, unsigned> GlobalIndices; |
180 | |
181 | |
182 | llvm::DenseMap<const RecordDecl *, Record *> Records; |
183 | |
184 | |
185 | llvm::DenseMap<const ParmVarDecl *, unsigned> DummyParams; |
186 | |
187 | |
188 | template <typename... Ts> |
189 | Descriptor *allocateDescriptor(Ts &&... Args) { |
190 | return new (Allocator) Descriptor(std::forward<Ts>(Args)...); |
| 3 | | Calling 'operator new<llvm::MallocAllocator, 4096UL, 4096UL, 128UL>' | |
|
191 | } |
192 | |
193 | |
194 | static constexpr unsigned NoDeclaration = (unsigned)-1; |
195 | |
196 | unsigned LastDeclaration = 0; |
197 | |
198 | unsigned CurrentDeclaration = NoDeclaration; |
199 | |
200 | |
201 | void startDeclaration(const VarDecl *Decl) { |
202 | LastDeclaration += 1; |
203 | CurrentDeclaration = LastDeclaration; |
204 | } |
205 | |
206 | |
207 | void endDeclaration() { |
208 | CurrentDeclaration = NoDeclaration; |
209 | } |
210 | |
211 | public: |
212 | |
213 | void dump() const; |
214 | void dump(llvm::raw_ostream &OS) const; |
215 | }; |
216 | |
217 | } |
218 | } |
219 | |
220 | #endif |
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); |
| 6 | | 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)); |
| 5 | | 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), |
| 4 | | 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; } |
| 11 | | 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; |
| 8 | | 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); |
| 7 | | 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_ |