1 //===--- CodeGenFunction.cpp - Emit LLVM Code from ASTs for a Function ----===//
2 //
3 //                     The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This coordinates the per-function state used while generating code.
11 //
12 //===----------------------------------------------------------------------===//
13 
14 #include "CodeGenFunction.h"
15 #include "CGBlocks.h"
16 #include "CGCleanup.h"
17 #include "CGCUDARuntime.h"
18 #include "CGCXXABI.h"
19 #include "CGDebugInfo.h"
20 #include "CGOpenMPRuntime.h"
21 #include "CodeGenModule.h"
22 #include "CodeGenPGO.h"
23 #include "TargetInfo.h"
24 #include "clang/AST/ASTContext.h"
25 #include "clang/AST/Decl.h"
26 #include "clang/AST/DeclCXX.h"
27 #include "clang/AST/StmtCXX.h"
28 #include "clang/AST/StmtObjC.h"
29 #include "clang/Basic/Builtins.h"
30 #include "clang/Basic/TargetInfo.h"
31 #include "clang/CodeGen/CGFunctionInfo.h"
32 #include "clang/Frontend/CodeGenOptions.h"
33 #include "clang/Sema/SemaDiagnostic.h"
34 #include "llvm/IR/DataLayout.h"
35 #include "llvm/IR/Intrinsics.h"
36 #include "llvm/IR/MDBuilder.h"
37 #include "llvm/IR/Operator.h"
38 using namespace clang;
39 using namespace CodeGen;
40 
41 /// shouldEmitLifetimeMarkers - Decide whether we need emit the life-time
42 /// markers.
43 static bool shouldEmitLifetimeMarkers(const CodeGenOptions &CGOpts,
44                                       const LangOptions &LangOpts) {
45   if (CGOpts.DisableLifetimeMarkers)
46     return false;
47 
48   // Asan uses markers for use-after-scope checks.
49   if (CGOpts.SanitizeAddressUseAfterScope)
50     return true;
51 
52   // Disable lifetime markers in msan builds.
53   // FIXME: Remove this when msan works with lifetime markers.
54   if (LangOpts.Sanitize.has(SanitizerKind::Memory))
55     return false;
56 
57   // For now, only in optimized builds.
58   return CGOpts.OptimizationLevel != 0;
59 }
60 
61 CodeGenFunction::CodeGenFunction(CodeGenModule &cgm, bool suppressNewContext)
62     : CodeGenTypeCache(cgm), CGM(cgm), Target(cgm.getTarget()),
63       Builder(cgm, cgm.getModule().getContext(), llvm::ConstantFolder(),
64               CGBuilderInserterTy(this)),
65       CurFn(nullptr), ReturnValue(Address::invalid()),
66       CapturedStmtInfo(nullptr), SanOpts(CGM.getLangOpts().Sanitize),
67       IsSanitizerScope(false), CurFuncIsThunk(false), AutoreleaseResult(false),
68       SawAsmBlock(false), IsOutlinedSEHHelper(false), BlockInfo(nullptr),
69       BlockPointer(nullptr), LambdaThisCaptureField(nullptr),
70       NormalCleanupDest(nullptr), NextCleanupDestIndex(1),
71       FirstBlockInfo(nullptr), EHResumeBlock(nullptr), ExceptionSlot(nullptr),
72       EHSelectorSlot(nullptr), DebugInfo(CGM.getModuleDebugInfo()),
73       DisableDebugInfo(false), DidCallStackSave(false), IndirectBranch(nullptr),
74       PGO(cgm), SwitchInsn(nullptr), SwitchWeights(nullptr),
75       CaseRangeBlock(nullptr), UnreachableBlock(nullptr), NumReturnExprs(0),
76       NumSimpleReturnExprs(0), CXXABIThisDecl(nullptr),
77       CXXABIThisValue(nullptr), CXXThisValue(nullptr),
78       CXXStructorImplicitParamDecl(nullptr),
79       CXXStructorImplicitParamValue(nullptr), OutermostConditional(nullptr),
80       CurLexicalScope(nullptr), TerminateLandingPad(nullptr),
81       TerminateHandler(nullptr), TrapBB(nullptr),
82       ShouldEmitLifetimeMarkers(
83           shouldEmitLifetimeMarkers(CGM.getCodeGenOpts(), CGM.getLangOpts())) {
84   if (!suppressNewContext)
85     CGM.getCXXABI().getMangleContext().startNewFunction();
86 
87   llvm::FastMathFlags FMF;
88   if (CGM.getLangOpts().FastMath)
89     FMF.setUnsafeAlgebra();
90   if (CGM.getLangOpts().FiniteMathOnly) {
91     FMF.setNoNaNs();
92     FMF.setNoInfs();
93   }
94   if (CGM.getCodeGenOpts().NoNaNsFPMath) {
95     FMF.setNoNaNs();
96   }
97   if (CGM.getCodeGenOpts().NoSignedZeros) {
98     FMF.setNoSignedZeros();
99   }
100   if (CGM.getCodeGenOpts().ReciprocalMath) {
101     FMF.setAllowReciprocal();
102   }
103   Builder.setFastMathFlags(FMF);
104 }
105 
106 CodeGenFunction::~CodeGenFunction() {
107   assert(LifetimeExtendedCleanupStack.empty() && "failed to emit a cleanup");
108 
109   // If there are any unclaimed block infos, go ahead and destroy them
110   // now.  This can happen if IR-gen gets clever and skips evaluating
111   // something.
112   if (FirstBlockInfo)
113     destroyBlockInfos(FirstBlockInfo);
114 
115   if (getLangOpts().OpenMP && CurFn)
116     CGM.getOpenMPRuntime().functionFinished(*this);
117 }
118 
119 CharUnits CodeGenFunction::getNaturalPointeeTypeAlignment(QualType T,
120                                                      AlignmentSource *Source) {
121   return getNaturalTypeAlignment(T->getPointeeType(), Source,
122                                  /*forPointee*/ true);
123 }
124 
125 CharUnits CodeGenFunction::getNaturalTypeAlignment(QualType T,
126                                                    AlignmentSource *Source,
127                                                    bool forPointeeType) {
128   // Honor alignment typedef attributes even on incomplete types.
129   // We also honor them straight for C++ class types, even as pointees;
130   // there's an expressivity gap here.
131   if (auto TT = T->getAs<TypedefType>()) {
132     if (auto Align = TT->getDecl()->getMaxAlignment()) {
133       if (Source) *Source = AlignmentSource::AttributedType;
134       return getContext().toCharUnitsFromBits(Align);
135     }
136   }
137 
138   if (Source) *Source = AlignmentSource::Type;
139 
140   CharUnits Alignment;
141   if (T->isIncompleteType()) {
142     Alignment = CharUnits::One(); // Shouldn't be used, but pessimistic is best.
143   } else {
144     // For C++ class pointees, we don't know whether we're pointing at a
145     // base or a complete object, so we generally need to use the
146     // non-virtual alignment.
147     const CXXRecordDecl *RD;
148     if (forPointeeType && (RD = T->getAsCXXRecordDecl())) {
149       Alignment = CGM.getClassPointerAlignment(RD);
150     } else {
151       Alignment = getContext().getTypeAlignInChars(T);
152     }
153 
154     // Cap to the global maximum type alignment unless the alignment
155     // was somehow explicit on the type.
156     if (unsigned MaxAlign = getLangOpts().MaxTypeAlign) {
157       if (Alignment.getQuantity() > MaxAlign &&
158           !getContext().isAlignmentRequired(T))
159         Alignment = CharUnits::fromQuantity(MaxAlign);
160     }
161   }
162   return Alignment;
163 }
164 
165 LValue CodeGenFunction::MakeNaturalAlignAddrLValue(llvm::Value *V, QualType T) {
166   AlignmentSource AlignSource;
167   CharUnits Alignment = getNaturalTypeAlignment(T, &AlignSource);
168   return LValue::MakeAddr(Address(V, Alignment), T, getContext(), AlignSource,
169                           CGM.getTBAAInfo(T));
170 }
171 
172 /// Given a value of type T* that may not be to a complete object,
173 /// construct an l-value with the natural pointee alignment of T.
174 LValue
175 CodeGenFunction::MakeNaturalAlignPointeeAddrLValue(llvm::Value *V, QualType T) {
176   AlignmentSource AlignSource;
177   CharUnits Align = getNaturalTypeAlignment(T, &AlignSource, /*pointee*/ true);
178   return MakeAddrLValue(Address(V, Align), T, AlignSource);
179 }
180 
181 
182 llvm::Type *CodeGenFunction::ConvertTypeForMem(QualType T) {
183   return CGM.getTypes().ConvertTypeForMem(T);
184 }
185 
186 llvm::Type *CodeGenFunction::ConvertType(QualType T) {
187   return CGM.getTypes().ConvertType(T);
188 }
189 
190 TypeEvaluationKind CodeGenFunction::getEvaluationKind(QualType type) {
191   type = type.getCanonicalType();
192   while (true) {
193     switch (type->getTypeClass()) {
194 #define TYPE(name, parent)
195 #define ABSTRACT_TYPE(name, parent)
196 #define NON_CANONICAL_TYPE(name, parent) case Type::name:
197 #define DEPENDENT_TYPE(name, parent) case Type::name:
198 #define NON_CANONICAL_UNLESS_DEPENDENT_TYPE(name, parent) case Type::name:
199 #include "clang/AST/TypeNodes.def"
200       llvm_unreachable("non-canonical or dependent type in IR-generation");
201 
202     case Type::Auto:
203     case Type::DeducedTemplateSpecialization:
204       llvm_unreachable("undeduced type in IR-generation");
205 
206     // Various scalar types.
207     case Type::Builtin:
208     case Type::Pointer:
209     case Type::BlockPointer:
210     case Type::LValueReference:
211     case Type::RValueReference:
212     case Type::MemberPointer:
213     case Type::Vector:
214     case Type::ExtVector:
215     case Type::FunctionProto:
216     case Type::FunctionNoProto:
217     case Type::Enum:
218     case Type::ObjCObjectPointer:
219     case Type::Pipe:
220       return TEK_Scalar;
221 
222     // Complexes.
223     case Type::Complex:
224       return TEK_Complex;
225 
226     // Arrays, records, and Objective-C objects.
227     case Type::ConstantArray:
228     case Type::IncompleteArray:
229     case Type::VariableArray:
230     case Type::Record:
231     case Type::ObjCObject:
232     case Type::ObjCInterface:
233       return TEK_Aggregate;
234 
235     // We operate on atomic values according to their underlying type.
236     case Type::Atomic:
237       type = cast<AtomicType>(type)->getValueType();
238       continue;
239     }
240     llvm_unreachable("unknown type kind!");
241   }
242 }
243 
244 llvm::DebugLoc CodeGenFunction::EmitReturnBlock() {
245   // For cleanliness, we try to avoid emitting the return block for
246   // simple cases.
247   llvm::BasicBlock *CurBB = Builder.GetInsertBlock();
248 
249   if (CurBB) {
250     assert(!CurBB->getTerminator() && "Unexpected terminated block.");
251 
252     // We have a valid insert point, reuse it if it is empty or there are no
253     // explicit jumps to the return block.
254     if (CurBB->empty() || ReturnBlock.getBlock()->use_empty()) {
255       ReturnBlock.getBlock()->replaceAllUsesWith(CurBB);
256       delete ReturnBlock.getBlock();
257     } else
258       EmitBlock(ReturnBlock.getBlock());
259     return llvm::DebugLoc();
260   }
261 
262   // Otherwise, if the return block is the target of a single direct
263   // branch then we can just put the code in that block instead. This
264   // cleans up functions which started with a unified return block.
265   if (ReturnBlock.getBlock()->hasOneUse()) {
266     llvm::BranchInst *BI =
267       dyn_cast<llvm::BranchInst>(*ReturnBlock.getBlock()->user_begin());
268     if (BI && BI->isUnconditional() &&
269         BI->getSuccessor(0) == ReturnBlock.getBlock()) {
270       // Record/return the DebugLoc of the simple 'return' expression to be used
271       // later by the actual 'ret' instruction.
272       llvm::DebugLoc Loc = BI->getDebugLoc();
273       Builder.SetInsertPoint(BI->getParent());
274       BI->eraseFromParent();
275       delete ReturnBlock.getBlock();
276       return Loc;
277     }
278   }
279 
280   // FIXME: We are at an unreachable point, there is no reason to emit the block
281   // unless it has uses. However, we still need a place to put the debug
282   // region.end for now.
283 
284   EmitBlock(ReturnBlock.getBlock());
285   return llvm::DebugLoc();
286 }
287 
288 static void EmitIfUsed(CodeGenFunction &CGF, llvm::BasicBlock *BB) {
289   if (!BB) return;
290   if (!BB->use_empty())
291     return CGF.CurFn->getBasicBlockList().push_back(BB);
292   delete BB;
293 }
294 
295 void CodeGenFunction::FinishFunction(SourceLocation EndLoc) {
296   assert(BreakContinueStack.empty() &&
297          "mismatched push/pop in break/continue stack!");
298 
299   bool OnlySimpleReturnStmts = NumSimpleReturnExprs > 0
300     && NumSimpleReturnExprs == NumReturnExprs
301     && ReturnBlock.getBlock()->use_empty();
302   // Usually the return expression is evaluated before the cleanup
303   // code.  If the function contains only a simple return statement,
304   // such as a constant, the location before the cleanup code becomes
305   // the last useful breakpoint in the function, because the simple
306   // return expression will be evaluated after the cleanup code. To be
307   // safe, set the debug location for cleanup code to the location of
308   // the return statement.  Otherwise the cleanup code should be at the
309   // end of the function's lexical scope.
310   //
311   // If there are multiple branches to the return block, the branch
312   // instructions will get the location of the return statements and
313   // all will be fine.
314   if (CGDebugInfo *DI = getDebugInfo()) {
315     if (OnlySimpleReturnStmts)
316       DI->EmitLocation(Builder, LastStopPoint);
317     else
318       DI->EmitLocation(Builder, EndLoc);
319   }
320 
321   // Pop any cleanups that might have been associated with the
322   // parameters.  Do this in whatever block we're currently in; it's
323   // important to do this before we enter the return block or return
324   // edges will be *really* confused.
325   bool HasCleanups = EHStack.stable_begin() != PrologueCleanupDepth;
326   bool HasOnlyLifetimeMarkers =
327       HasCleanups && EHStack.containsOnlyLifetimeMarkers(PrologueCleanupDepth);
328   bool EmitRetDbgLoc = !HasCleanups || HasOnlyLifetimeMarkers;
329   if (HasCleanups) {
330     // Make sure the line table doesn't jump back into the body for
331     // the ret after it's been at EndLoc.
332     if (CGDebugInfo *DI = getDebugInfo())
333       if (OnlySimpleReturnStmts)
334         DI->EmitLocation(Builder, EndLoc);
335 
336     PopCleanupBlocks(PrologueCleanupDepth);
337   }
338 
339   // Emit function epilog (to return).
340   llvm::DebugLoc Loc = EmitReturnBlock();
341 
342   if (ShouldInstrumentFunction())
343     EmitFunctionInstrumentation("__cyg_profile_func_exit");
344 
345   // Emit debug descriptor for function end.
346   if (CGDebugInfo *DI = getDebugInfo())
347     DI->EmitFunctionEnd(Builder);
348 
349   // Reset the debug location to that of the simple 'return' expression, if any
350   // rather than that of the end of the function's scope '}'.
351   ApplyDebugLocation AL(*this, Loc);
352   EmitFunctionEpilog(*CurFnInfo, EmitRetDbgLoc, EndLoc);
353   EmitEndEHSpec(CurCodeDecl);
354 
355   assert(EHStack.empty() &&
356          "did not remove all scopes from cleanup stack!");
357 
358   // If someone did an indirect goto, emit the indirect goto block at the end of
359   // the function.
360   if (IndirectBranch) {
361     EmitBlock(IndirectBranch->getParent());
362     Builder.ClearInsertionPoint();
363   }
364 
365   // If some of our locals escaped, insert a call to llvm.localescape in the
366   // entry block.
367   if (!EscapedLocals.empty()) {
368     // Invert the map from local to index into a simple vector. There should be
369     // no holes.
370     SmallVector<llvm::Value *, 4> EscapeArgs;
371     EscapeArgs.resize(EscapedLocals.size());
372     for (auto &Pair : EscapedLocals)
373       EscapeArgs[Pair.second] = Pair.first;
374     llvm::Function *FrameEscapeFn = llvm::Intrinsic::getDeclaration(
375         &CGM.getModule(), llvm::Intrinsic::localescape);
376     CGBuilderTy(*this, AllocaInsertPt).CreateCall(FrameEscapeFn, EscapeArgs);
377   }
378 
379   // Remove the AllocaInsertPt instruction, which is just a convenience for us.
380   llvm::Instruction *Ptr = AllocaInsertPt;
381   AllocaInsertPt = nullptr;
382   Ptr->eraseFromParent();
383 
384   // If someone took the address of a label but never did an indirect goto, we
385   // made a zero entry PHI node, which is illegal, zap it now.
386   if (IndirectBranch) {
387     llvm::PHINode *PN = cast<llvm::PHINode>(IndirectBranch->getAddress());
388     if (PN->getNumIncomingValues() == 0) {
389       PN->replaceAllUsesWith(llvm::UndefValue::get(PN->getType()));
390       PN->eraseFromParent();
391     }
392   }
393 
394   EmitIfUsed(*this, EHResumeBlock);
395   EmitIfUsed(*this, TerminateLandingPad);
396   EmitIfUsed(*this, TerminateHandler);
397   EmitIfUsed(*this, UnreachableBlock);
398 
399   if (CGM.getCodeGenOpts().EmitDeclMetadata)
400     EmitDeclMetadata();
401 
402   for (SmallVectorImpl<std::pair<llvm::Instruction *, llvm::Value *> >::iterator
403            I = DeferredReplacements.begin(),
404            E = DeferredReplacements.end();
405        I != E; ++I) {
406     I->first->replaceAllUsesWith(I->second);
407     I->first->eraseFromParent();
408   }
409 }
410 
411 /// ShouldInstrumentFunction - Return true if the current function should be
412 /// instrumented with __cyg_profile_func_* calls
413 bool CodeGenFunction::ShouldInstrumentFunction() {
414   if (!CGM.getCodeGenOpts().InstrumentFunctions)
415     return false;
416   if (!CurFuncDecl || CurFuncDecl->hasAttr<NoInstrumentFunctionAttr>())
417     return false;
418   return true;
419 }
420 
421 /// ShouldXRayInstrument - Return true if the current function should be
422 /// instrumented with XRay nop sleds.
423 bool CodeGenFunction::ShouldXRayInstrumentFunction() const {
424   return CGM.getCodeGenOpts().XRayInstrumentFunctions;
425 }
426 
427 /// EmitFunctionInstrumentation - Emit LLVM code to call the specified
428 /// instrumentation function with the current function and the call site, if
429 /// function instrumentation is enabled.
430 void CodeGenFunction::EmitFunctionInstrumentation(const char *Fn) {
431   auto NL = ApplyDebugLocation::CreateArtificial(*this);
432   // void __cyg_profile_func_{enter,exit} (void *this_fn, void *call_site);
433   llvm::PointerType *PointerTy = Int8PtrTy;
434   llvm::Type *ProfileFuncArgs[] = { PointerTy, PointerTy };
435   llvm::FunctionType *FunctionTy =
436     llvm::FunctionType::get(VoidTy, ProfileFuncArgs, false);
437 
438   llvm::Constant *F = CGM.CreateRuntimeFunction(FunctionTy, Fn);
439   llvm::CallInst *CallSite = Builder.CreateCall(
440     CGM.getIntrinsic(llvm::Intrinsic::returnaddress),
441     llvm::ConstantInt::get(Int32Ty, 0),
442     "callsite");
443 
444   llvm::Value *args[] = {
445     llvm::ConstantExpr::getBitCast(CurFn, PointerTy),
446     CallSite
447   };
448 
449   EmitNounwindRuntimeCall(F, args);
450 }
451 
452 static void removeImageAccessQualifier(std::string& TyName) {
453   std::string ReadOnlyQual("__read_only");
454   std::string::size_type ReadOnlyPos = TyName.find(ReadOnlyQual);
455   if (ReadOnlyPos != std::string::npos)
456     // "+ 1" for the space after access qualifier.
457     TyName.erase(ReadOnlyPos, ReadOnlyQual.size() + 1);
458   else {
459     std::string WriteOnlyQual("__write_only");
460     std::string::size_type WriteOnlyPos = TyName.find(WriteOnlyQual);
461     if (WriteOnlyPos != std::string::npos)
462       TyName.erase(WriteOnlyPos, WriteOnlyQual.size() + 1);
463     else {
464       std::string ReadWriteQual("__read_write");
465       std::string::size_type ReadWritePos = TyName.find(ReadWriteQual);
466       if (ReadWritePos != std::string::npos)
467         TyName.erase(ReadWritePos, ReadWriteQual.size() + 1);
468     }
469   }
470 }
471 
472 // Returns the address space id that should be produced to the
473 // kernel_arg_addr_space metadata. This is always fixed to the ids
474 // as specified in the SPIR 2.0 specification in order to differentiate
475 // for example in clGetKernelArgInfo() implementation between the address
476 // spaces with targets without unique mapping to the OpenCL address spaces
477 // (basically all single AS CPUs).
478 static unsigned ArgInfoAddressSpace(unsigned LangAS) {
479   switch (LangAS) {
480   case LangAS::opencl_global:   return 1;
481   case LangAS::opencl_constant: return 2;
482   case LangAS::opencl_local:    return 3;
483   case LangAS::opencl_generic:  return 4; // Not in SPIR 2.0 specs.
484   default:
485     return 0; // Assume private.
486   }
487 }
488 
489 // OpenCL v1.2 s5.6.4.6 allows the compiler to store kernel argument
490 // information in the program executable. The argument information stored
491 // includes the argument name, its type, the address and access qualifiers used.
492 static void GenOpenCLArgMetadata(const FunctionDecl *FD, llvm::Function *Fn,
493                                  CodeGenModule &CGM, llvm::LLVMContext &Context,
494                                  CGBuilderTy &Builder, ASTContext &ASTCtx) {
495   // Create MDNodes that represent the kernel arg metadata.
496   // Each MDNode is a list in the form of "key", N number of values which is
497   // the same number of values as their are kernel arguments.
498 
499   const PrintingPolicy &Policy = ASTCtx.getPrintingPolicy();
500 
501   // MDNode for the kernel argument address space qualifiers.
502   SmallVector<llvm::Metadata *, 8> addressQuals;
503 
504   // MDNode for the kernel argument access qualifiers (images only).
505   SmallVector<llvm::Metadata *, 8> accessQuals;
506 
507   // MDNode for the kernel argument type names.
508   SmallVector<llvm::Metadata *, 8> argTypeNames;
509 
510   // MDNode for the kernel argument base type names.
511   SmallVector<llvm::Metadata *, 8> argBaseTypeNames;
512 
513   // MDNode for the kernel argument type qualifiers.
514   SmallVector<llvm::Metadata *, 8> argTypeQuals;
515 
516   // MDNode for the kernel argument names.
517   SmallVector<llvm::Metadata *, 8> argNames;
518 
519   for (unsigned i = 0, e = FD->getNumParams(); i != e; ++i) {
520     const ParmVarDecl *parm = FD->getParamDecl(i);
521     QualType ty = parm->getType();
522     std::string typeQuals;
523 
524     if (ty->isPointerType()) {
525       QualType pointeeTy = ty->getPointeeType();
526 
527       // Get address qualifier.
528       addressQuals.push_back(llvm::ConstantAsMetadata::get(Builder.getInt32(
529         ArgInfoAddressSpace(pointeeTy.getAddressSpace()))));
530 
531       // Get argument type name.
532       std::string typeName =
533           pointeeTy.getUnqualifiedType().getAsString(Policy) + "*";
534 
535       // Turn "unsigned type" to "utype"
536       std::string::size_type pos = typeName.find("unsigned");
537       if (pointeeTy.isCanonical() && pos != std::string::npos)
538         typeName.erase(pos+1, 8);
539 
540       argTypeNames.push_back(llvm::MDString::get(Context, typeName));
541 
542       std::string baseTypeName =
543           pointeeTy.getUnqualifiedType().getCanonicalType().getAsString(
544               Policy) +
545           "*";
546 
547       // Turn "unsigned type" to "utype"
548       pos = baseTypeName.find("unsigned");
549       if (pos != std::string::npos)
550         baseTypeName.erase(pos+1, 8);
551 
552       argBaseTypeNames.push_back(llvm::MDString::get(Context, baseTypeName));
553 
554       // Get argument type qualifiers:
555       if (ty.isRestrictQualified())
556         typeQuals = "restrict";
557       if (pointeeTy.isConstQualified() ||
558           (pointeeTy.getAddressSpace() == LangAS::opencl_constant))
559         typeQuals += typeQuals.empty() ? "const" : " const";
560       if (pointeeTy.isVolatileQualified())
561         typeQuals += typeQuals.empty() ? "volatile" : " volatile";
562     } else {
563       uint32_t AddrSpc = 0;
564       bool isPipe = ty->isPipeType();
565       if (ty->isImageType() || isPipe)
566         AddrSpc = ArgInfoAddressSpace(LangAS::opencl_global);
567 
568       addressQuals.push_back(
569           llvm::ConstantAsMetadata::get(Builder.getInt32(AddrSpc)));
570 
571       // Get argument type name.
572       std::string typeName;
573       if (isPipe)
574         typeName = ty.getCanonicalType()->getAs<PipeType>()->getElementType()
575                      .getAsString(Policy);
576       else
577         typeName = ty.getUnqualifiedType().getAsString(Policy);
578 
579       // Turn "unsigned type" to "utype"
580       std::string::size_type pos = typeName.find("unsigned");
581       if (ty.isCanonical() && pos != std::string::npos)
582         typeName.erase(pos+1, 8);
583 
584       std::string baseTypeName;
585       if (isPipe)
586         baseTypeName = ty.getCanonicalType()->getAs<PipeType>()
587                           ->getElementType().getCanonicalType()
588                           .getAsString(Policy);
589       else
590         baseTypeName =
591           ty.getUnqualifiedType().getCanonicalType().getAsString(Policy);
592 
593       // Remove access qualifiers on images
594       // (as they are inseparable from type in clang implementation,
595       // but OpenCL spec provides a special query to get access qualifier
596       // via clGetKernelArgInfo with CL_KERNEL_ARG_ACCESS_QUALIFIER):
597       if (ty->isImageType()) {
598         removeImageAccessQualifier(typeName);
599         removeImageAccessQualifier(baseTypeName);
600       }
601 
602       argTypeNames.push_back(llvm::MDString::get(Context, typeName));
603 
604       // Turn "unsigned type" to "utype"
605       pos = baseTypeName.find("unsigned");
606       if (pos != std::string::npos)
607         baseTypeName.erase(pos+1, 8);
608 
609       argBaseTypeNames.push_back(llvm::MDString::get(Context, baseTypeName));
610 
611       // Get argument type qualifiers:
612       if (ty.isConstQualified())
613         typeQuals = "const";
614       if (ty.isVolatileQualified())
615         typeQuals += typeQuals.empty() ? "volatile" : " volatile";
616       if (isPipe)
617         typeQuals = "pipe";
618     }
619 
620     argTypeQuals.push_back(llvm::MDString::get(Context, typeQuals));
621 
622     // Get image and pipe access qualifier:
623     if (ty->isImageType()|| ty->isPipeType()) {
624       const OpenCLAccessAttr *A = parm->getAttr<OpenCLAccessAttr>();
625       if (A && A->isWriteOnly())
626         accessQuals.push_back(llvm::MDString::get(Context, "write_only"));
627       else if (A && A->isReadWrite())
628         accessQuals.push_back(llvm::MDString::get(Context, "read_write"));
629       else
630         accessQuals.push_back(llvm::MDString::get(Context, "read_only"));
631     } else
632       accessQuals.push_back(llvm::MDString::get(Context, "none"));
633 
634     // Get argument name.
635     argNames.push_back(llvm::MDString::get(Context, parm->getName()));
636   }
637 
638   Fn->setMetadata("kernel_arg_addr_space",
639                   llvm::MDNode::get(Context, addressQuals));
640   Fn->setMetadata("kernel_arg_access_qual",
641                   llvm::MDNode::get(Context, accessQuals));
642   Fn->setMetadata("kernel_arg_type",
643                   llvm::MDNode::get(Context, argTypeNames));
644   Fn->setMetadata("kernel_arg_base_type",
645                   llvm::MDNode::get(Context, argBaseTypeNames));
646   Fn->setMetadata("kernel_arg_type_qual",
647                   llvm::MDNode::get(Context, argTypeQuals));
648   if (CGM.getCodeGenOpts().EmitOpenCLArgMetadata)
649     Fn->setMetadata("kernel_arg_name",
650                     llvm::MDNode::get(Context, argNames));
651 }
652 
653 void CodeGenFunction::EmitOpenCLKernelMetadata(const FunctionDecl *FD,
654                                                llvm::Function *Fn)
655 {
656   if (!FD->hasAttr<OpenCLKernelAttr>())
657     return;
658 
659   llvm::LLVMContext &Context = getLLVMContext();
660 
661   GenOpenCLArgMetadata(FD, Fn, CGM, Context, Builder, getContext());
662 
663   if (const VecTypeHintAttr *A = FD->getAttr<VecTypeHintAttr>()) {
664     QualType hintQTy = A->getTypeHint();
665     const ExtVectorType *hintEltQTy = hintQTy->getAs<ExtVectorType>();
666     bool isSignedInteger =
667         hintQTy->isSignedIntegerType() ||
668         (hintEltQTy && hintEltQTy->getElementType()->isSignedIntegerType());
669     llvm::Metadata *attrMDArgs[] = {
670         llvm::ConstantAsMetadata::get(llvm::UndefValue::get(
671             CGM.getTypes().ConvertType(A->getTypeHint()))),
672         llvm::ConstantAsMetadata::get(llvm::ConstantInt::get(
673             llvm::IntegerType::get(Context, 32),
674             llvm::APInt(32, (uint64_t)(isSignedInteger ? 1 : 0))))};
675     Fn->setMetadata("vec_type_hint", llvm::MDNode::get(Context, attrMDArgs));
676   }
677 
678   if (const WorkGroupSizeHintAttr *A = FD->getAttr<WorkGroupSizeHintAttr>()) {
679     llvm::Metadata *attrMDArgs[] = {
680         llvm::ConstantAsMetadata::get(Builder.getInt32(A->getXDim())),
681         llvm::ConstantAsMetadata::get(Builder.getInt32(A->getYDim())),
682         llvm::ConstantAsMetadata::get(Builder.getInt32(A->getZDim()))};
683     Fn->setMetadata("work_group_size_hint", llvm::MDNode::get(Context, attrMDArgs));
684   }
685 
686   if (const ReqdWorkGroupSizeAttr *A = FD->getAttr<ReqdWorkGroupSizeAttr>()) {
687     llvm::Metadata *attrMDArgs[] = {
688         llvm::ConstantAsMetadata::get(Builder.getInt32(A->getXDim())),
689         llvm::ConstantAsMetadata::get(Builder.getInt32(A->getYDim())),
690         llvm::ConstantAsMetadata::get(Builder.getInt32(A->getZDim()))};
691     Fn->setMetadata("reqd_work_group_size", llvm::MDNode::get(Context, attrMDArgs));
692   }
693 }
694 
695 /// Determine whether the function F ends with a return stmt.
696 static bool endsWithReturn(const Decl* F) {
697   const Stmt *Body = nullptr;
698   if (auto *FD = dyn_cast_or_null<FunctionDecl>(F))
699     Body = FD->getBody();
700   else if (auto *OMD = dyn_cast_or_null<ObjCMethodDecl>(F))
701     Body = OMD->getBody();
702 
703   if (auto *CS = dyn_cast_or_null<CompoundStmt>(Body)) {
704     auto LastStmt = CS->body_rbegin();
705     if (LastStmt != CS->body_rend())
706       return isa<ReturnStmt>(*LastStmt);
707   }
708   return false;
709 }
710 
711 static void markAsIgnoreThreadCheckingAtRuntime(llvm::Function *Fn) {
712   Fn->addFnAttr("sanitize_thread_no_checking_at_run_time");
713   Fn->removeFnAttr(llvm::Attribute::SanitizeThread);
714 }
715 
716 void CodeGenFunction::StartFunction(GlobalDecl GD,
717                                     QualType RetTy,
718                                     llvm::Function *Fn,
719                                     const CGFunctionInfo &FnInfo,
720                                     const FunctionArgList &Args,
721                                     SourceLocation Loc,
722                                     SourceLocation StartLoc) {
723   assert(!CurFn &&
724          "Do not use a CodeGenFunction object for more than one function");
725 
726   const Decl *D = GD.getDecl();
727 
728   DidCallStackSave = false;
729   CurCodeDecl = D;
730   if (const auto *FD = dyn_cast_or_null<FunctionDecl>(D))
731     if (FD->usesSEHTry())
732       CurSEHParent = FD;
733   CurFuncDecl = (D ? D->getNonClosureContext() : nullptr);
734   FnRetTy = RetTy;
735   CurFn = Fn;
736   CurFnInfo = &FnInfo;
737   assert(CurFn->isDeclaration() && "Function already has body?");
738 
739   if (CGM.isInSanitizerBlacklist(Fn, Loc))
740     SanOpts.clear();
741 
742   if (D) {
743     // Apply the no_sanitize* attributes to SanOpts.
744     for (auto Attr : D->specific_attrs<NoSanitizeAttr>())
745       SanOpts.Mask &= ~Attr->getMask();
746   }
747 
748   // Apply sanitizer attributes to the function.
749   if (SanOpts.hasOneOf(SanitizerKind::Address | SanitizerKind::KernelAddress))
750     Fn->addFnAttr(llvm::Attribute::SanitizeAddress);
751   if (SanOpts.has(SanitizerKind::Thread))
752     Fn->addFnAttr(llvm::Attribute::SanitizeThread);
753   if (SanOpts.has(SanitizerKind::Memory))
754     Fn->addFnAttr(llvm::Attribute::SanitizeMemory);
755   if (SanOpts.has(SanitizerKind::SafeStack))
756     Fn->addFnAttr(llvm::Attribute::SafeStack);
757 
758   // Ignore TSan memory acesses from within ObjC/ObjC++ dealloc, initialize,
759   // .cxx_destruct, __destroy_helper_block_ and all of their calees at run time.
760   if (SanOpts.has(SanitizerKind::Thread)) {
761     if (const auto *OMD = dyn_cast_or_null<ObjCMethodDecl>(D)) {
762       IdentifierInfo *II = OMD->getSelector().getIdentifierInfoForSlot(0);
763       if (OMD->getMethodFamily() == OMF_dealloc ||
764           OMD->getMethodFamily() == OMF_initialize ||
765           (OMD->getSelector().isUnarySelector() && II->isStr(".cxx_destruct"))) {
766         markAsIgnoreThreadCheckingAtRuntime(Fn);
767       }
768     } else if (const auto *FD = dyn_cast_or_null<FunctionDecl>(D)) {
769       IdentifierInfo *II = FD->getIdentifier();
770       if (II && II->isStr("__destroy_helper_block_"))
771         markAsIgnoreThreadCheckingAtRuntime(Fn);
772     }
773   }
774 
775   // Apply xray attributes to the function (as a string, for now)
776   if (D && ShouldXRayInstrumentFunction()) {
777     if (const auto *XRayAttr = D->getAttr<XRayInstrumentAttr>()) {
778       if (XRayAttr->alwaysXRayInstrument())
779         Fn->addFnAttr("function-instrument", "xray-always");
780       if (XRayAttr->neverXRayInstrument())
781         Fn->addFnAttr("function-instrument", "xray-never");
782     } else {
783       Fn->addFnAttr(
784           "xray-instruction-threshold",
785           llvm::itostr(CGM.getCodeGenOpts().XRayInstructionThreshold));
786     }
787   }
788 
789   if (const FunctionDecl *FD = dyn_cast_or_null<FunctionDecl>(D))
790     if (CGM.getLangOpts().OpenMP && FD->hasAttr<OMPDeclareSimdDeclAttr>())
791       CGM.getOpenMPRuntime().emitDeclareSimdFunction(FD, Fn);
792 
793   // Add no-jump-tables value.
794   Fn->addFnAttr("no-jump-tables",
795                 llvm::toStringRef(CGM.getCodeGenOpts().NoUseJumpTables));
796 
797   if (getLangOpts().OpenCL) {
798     // Add metadata for a kernel function.
799     if (const FunctionDecl *FD = dyn_cast_or_null<FunctionDecl>(D))
800       EmitOpenCLKernelMetadata(FD, Fn);
801   }
802 
803   // If we are checking function types, emit a function type signature as
804   // prologue data.
805   if (getLangOpts().CPlusPlus && SanOpts.has(SanitizerKind::Function)) {
806     if (const FunctionDecl *FD = dyn_cast_or_null<FunctionDecl>(D)) {
807       if (llvm::Constant *PrologueSig =
808               CGM.getTargetCodeGenInfo().getUBSanFunctionSignature(CGM)) {
809         llvm::Constant *FTRTTIConst =
810             CGM.GetAddrOfRTTIDescriptor(FD->getType(), /*ForEH=*/true);
811         llvm::Constant *PrologueStructElems[] = { PrologueSig, FTRTTIConst };
812         llvm::Constant *PrologueStructConst =
813             llvm::ConstantStruct::getAnon(PrologueStructElems, /*Packed=*/true);
814         Fn->setPrologueData(PrologueStructConst);
815       }
816     }
817   }
818 
819   // If we're in C++ mode and the function name is "main", it is guaranteed
820   // to be norecurse by the standard (3.6.1.3 "The function main shall not be
821   // used within a program").
822   if (getLangOpts().CPlusPlus)
823     if (const FunctionDecl *FD = dyn_cast_or_null<FunctionDecl>(D))
824       if (FD->isMain())
825         Fn->addFnAttr(llvm::Attribute::NoRecurse);
826 
827   llvm::BasicBlock *EntryBB = createBasicBlock("entry", CurFn);
828 
829   // Create a marker to make it easy to insert allocas into the entryblock
830   // later.  Don't create this with the builder, because we don't want it
831   // folded.
832   llvm::Value *Undef = llvm::UndefValue::get(Int32Ty);
833   AllocaInsertPt = new llvm::BitCastInst(Undef, Int32Ty, "allocapt", EntryBB);
834 
835   ReturnBlock = getJumpDestInCurrentScope("return");
836 
837   Builder.SetInsertPoint(EntryBB);
838 
839   // Emit subprogram debug descriptor.
840   if (CGDebugInfo *DI = getDebugInfo()) {
841     // Reconstruct the type from the argument list so that implicit parameters,
842     // such as 'this' and 'vtt', show up in the debug info. Preserve the calling
843     // convention.
844     CallingConv CC = CallingConv::CC_C;
845     if (auto *FD = dyn_cast_or_null<FunctionDecl>(D))
846       if (const auto *SrcFnTy = FD->getType()->getAs<FunctionType>())
847         CC = SrcFnTy->getCallConv();
848     SmallVector<QualType, 16> ArgTypes;
849     for (const VarDecl *VD : Args)
850       ArgTypes.push_back(VD->getType());
851     QualType FnType = getContext().getFunctionType(
852         RetTy, ArgTypes, FunctionProtoType::ExtProtoInfo(CC));
853     DI->EmitFunctionStart(GD, Loc, StartLoc, FnType, CurFn, Builder);
854   }
855 
856   if (ShouldInstrumentFunction())
857     EmitFunctionInstrumentation("__cyg_profile_func_enter");
858 
859   // Since emitting the mcount call here impacts optimizations such as function
860   // inlining, we just add an attribute to insert a mcount call in backend.
861   // The attribute "counting-function" is set to mcount function name which is
862   // architecture dependent.
863   if (CGM.getCodeGenOpts().InstrumentForProfiling) {
864     if (CGM.getCodeGenOpts().CallFEntry)
865       Fn->addFnAttr("fentry-call", "true");
866     else
867       Fn->addFnAttr("counting-function", getTarget().getMCountName());
868   }
869 
870   if (RetTy->isVoidType()) {
871     // Void type; nothing to return.
872     ReturnValue = Address::invalid();
873 
874     // Count the implicit return.
875     if (!endsWithReturn(D))
876       ++NumReturnExprs;
877   } else if (CurFnInfo->getReturnInfo().getKind() == ABIArgInfo::Indirect &&
878              !hasScalarEvaluationKind(CurFnInfo->getReturnType())) {
879     // Indirect aggregate return; emit returned value directly into sret slot.
880     // This reduces code size, and affects correctness in C++.
881     auto AI = CurFn->arg_begin();
882     if (CurFnInfo->getReturnInfo().isSRetAfterThis())
883       ++AI;
884     ReturnValue = Address(&*AI, CurFnInfo->getReturnInfo().getIndirectAlign());
885   } else if (CurFnInfo->getReturnInfo().getKind() == ABIArgInfo::InAlloca &&
886              !hasScalarEvaluationKind(CurFnInfo->getReturnType())) {
887     // Load the sret pointer from the argument struct and return into that.
888     unsigned Idx = CurFnInfo->getReturnInfo().getInAllocaFieldIndex();
889     llvm::Function::arg_iterator EI = CurFn->arg_end();
890     --EI;
891     llvm::Value *Addr = Builder.CreateStructGEP(nullptr, &*EI, Idx);
892     Addr = Builder.CreateAlignedLoad(Addr, getPointerAlign(), "agg.result");
893     ReturnValue = Address(Addr, getNaturalTypeAlignment(RetTy));
894   } else {
895     ReturnValue = CreateIRTemp(RetTy, "retval");
896 
897     // Tell the epilog emitter to autorelease the result.  We do this
898     // now so that various specialized functions can suppress it
899     // during their IR-generation.
900     if (getLangOpts().ObjCAutoRefCount &&
901         !CurFnInfo->isReturnsRetained() &&
902         RetTy->isObjCRetainableType())
903       AutoreleaseResult = true;
904   }
905 
906   EmitStartEHSpec(CurCodeDecl);
907 
908   PrologueCleanupDepth = EHStack.stable_begin();
909   EmitFunctionProlog(*CurFnInfo, CurFn, Args);
910 
911   if (D && isa<CXXMethodDecl>(D) && cast<CXXMethodDecl>(D)->isInstance()) {
912     CGM.getCXXABI().EmitInstanceFunctionProlog(*this);
913     const CXXMethodDecl *MD = cast<CXXMethodDecl>(D);
914     if (MD->getParent()->isLambda() &&
915         MD->getOverloadedOperator() == OO_Call) {
916       // We're in a lambda; figure out the captures.
917       MD->getParent()->getCaptureFields(LambdaCaptureFields,
918                                         LambdaThisCaptureField);
919       if (LambdaThisCaptureField) {
920         // If the lambda captures the object referred to by '*this' - either by
921         // value or by reference, make sure CXXThisValue points to the correct
922         // object.
923 
924         // Get the lvalue for the field (which is a copy of the enclosing object
925         // or contains the address of the enclosing object).
926         LValue ThisFieldLValue = EmitLValueForLambdaField(LambdaThisCaptureField);
927         if (!LambdaThisCaptureField->getType()->isPointerType()) {
928           // If the enclosing object was captured by value, just use its address.
929           CXXThisValue = ThisFieldLValue.getAddress().getPointer();
930         } else {
931           // Load the lvalue pointed to by the field, since '*this' was captured
932           // by reference.
933           CXXThisValue =
934               EmitLoadOfLValue(ThisFieldLValue, SourceLocation()).getScalarVal();
935         }
936       }
937       for (auto *FD : MD->getParent()->fields()) {
938         if (FD->hasCapturedVLAType()) {
939           auto *ExprArg = EmitLoadOfLValue(EmitLValueForLambdaField(FD),
940                                            SourceLocation()).getScalarVal();
941           auto VAT = FD->getCapturedVLAType();
942           VLASizeMap[VAT->getSizeExpr()] = ExprArg;
943         }
944       }
945     } else {
946       // Not in a lambda; just use 'this' from the method.
947       // FIXME: Should we generate a new load for each use of 'this'?  The
948       // fast register allocator would be happier...
949       CXXThisValue = CXXABIThisValue;
950     }
951 
952     // Sanitize the 'this' pointer once per function, if it's available.
953     if (CXXThisValue)
954       EmitTypeCheck(TCK_MemberAccess, Loc, CXXThisValue,
955                     MD->getThisType(getContext()));
956   }
957 
958   // If any of the arguments have a variably modified type, make sure to
959   // emit the type size.
960   for (FunctionArgList::const_iterator i = Args.begin(), e = Args.end();
961        i != e; ++i) {
962     const VarDecl *VD = *i;
963 
964     // Dig out the type as written from ParmVarDecls; it's unclear whether
965     // the standard (C99 6.9.1p10) requires this, but we're following the
966     // precedent set by gcc.
967     QualType Ty;
968     if (const ParmVarDecl *PVD = dyn_cast<ParmVarDecl>(VD))
969       Ty = PVD->getOriginalType();
970     else
971       Ty = VD->getType();
972 
973     if (Ty->isVariablyModifiedType())
974       EmitVariablyModifiedType(Ty);
975   }
976   // Emit a location at the end of the prologue.
977   if (CGDebugInfo *DI = getDebugInfo())
978     DI->EmitLocation(Builder, StartLoc);
979 }
980 
981 void CodeGenFunction::EmitFunctionBody(FunctionArgList &Args,
982                                        const Stmt *Body) {
983   incrementProfileCounter(Body);
984   if (const CompoundStmt *S = dyn_cast<CompoundStmt>(Body))
985     EmitCompoundStmtWithoutScope(*S);
986   else
987     EmitStmt(Body);
988 }
989 
990 /// When instrumenting to collect profile data, the counts for some blocks
991 /// such as switch cases need to not include the fall-through counts, so
992 /// emit a branch around the instrumentation code. When not instrumenting,
993 /// this just calls EmitBlock().
994 void CodeGenFunction::EmitBlockWithFallThrough(llvm::BasicBlock *BB,
995                                                const Stmt *S) {
996   llvm::BasicBlock *SkipCountBB = nullptr;
997   if (HaveInsertPoint() && CGM.getCodeGenOpts().hasProfileClangInstr()) {
998     // When instrumenting for profiling, the fallthrough to certain
999     // statements needs to skip over the instrumentation code so that we
1000     // get an accurate count.
1001     SkipCountBB = createBasicBlock("skipcount");
1002     EmitBranch(SkipCountBB);
1003   }
1004   EmitBlock(BB);
1005   uint64_t CurrentCount = getCurrentProfileCount();
1006   incrementProfileCounter(S);
1007   setCurrentProfileCount(getCurrentProfileCount() + CurrentCount);
1008   if (SkipCountBB)
1009     EmitBlock(SkipCountBB);
1010 }
1011 
1012 /// Tries to mark the given function nounwind based on the
1013 /// non-existence of any throwing calls within it.  We believe this is
1014 /// lightweight enough to do at -O0.
1015 static void TryMarkNoThrow(llvm::Function *F) {
1016   // LLVM treats 'nounwind' on a function as part of the type, so we
1017   // can't do this on functions that can be overwritten.
1018   if (F->isInterposable()) return;
1019 
1020   for (llvm::BasicBlock &BB : *F)
1021     for (llvm::Instruction &I : BB)
1022       if (I.mayThrow())
1023         return;
1024 
1025   F->setDoesNotThrow();
1026 }
1027 
1028 QualType CodeGenFunction::BuildFunctionArgList(GlobalDecl GD,
1029                                                FunctionArgList &Args) {
1030   const FunctionDecl *FD = cast<FunctionDecl>(GD.getDecl());
1031   QualType ResTy = FD->getReturnType();
1032 
1033   const CXXMethodDecl *MD = dyn_cast<CXXMethodDecl>(FD);
1034   if (MD && MD->isInstance()) {
1035     if (CGM.getCXXABI().HasThisReturn(GD))
1036       ResTy = MD->getThisType(getContext());
1037     else if (CGM.getCXXABI().hasMostDerivedReturn(GD))
1038       ResTy = CGM.getContext().VoidPtrTy;
1039     CGM.getCXXABI().buildThisParam(*this, Args);
1040   }
1041 
1042   // The base version of an inheriting constructor whose constructed base is a
1043   // virtual base is not passed any arguments (because it doesn't actually call
1044   // the inherited constructor).
1045   bool PassedParams = true;
1046   if (const CXXConstructorDecl *CD = dyn_cast<CXXConstructorDecl>(FD))
1047     if (auto Inherited = CD->getInheritedConstructor())
1048       PassedParams =
1049           getTypes().inheritingCtorHasParams(Inherited, GD.getCtorType());
1050 
1051   if (PassedParams) {
1052     for (auto *Param : FD->parameters()) {
1053       Args.push_back(Param);
1054       if (!Param->hasAttr<PassObjectSizeAttr>())
1055         continue;
1056 
1057       IdentifierInfo *NoID = nullptr;
1058       auto *Implicit = ImplicitParamDecl::Create(
1059           getContext(), Param->getDeclContext(), Param->getLocation(), NoID,
1060           getContext().getSizeType());
1061       SizeArguments[Param] = Implicit;
1062       Args.push_back(Implicit);
1063     }
1064   }
1065 
1066   if (MD && (isa<CXXConstructorDecl>(MD) || isa<CXXDestructorDecl>(MD)))
1067     CGM.getCXXABI().addImplicitStructorParams(*this, ResTy, Args);
1068 
1069   return ResTy;
1070 }
1071 
1072 static bool
1073 shouldUseUndefinedBehaviorReturnOptimization(const FunctionDecl *FD,
1074                                              const ASTContext &Context) {
1075   QualType T = FD->getReturnType();
1076   // Avoid the optimization for functions that return a record type with a
1077   // trivial destructor or another trivially copyable type.
1078   if (const RecordType *RT = T.getCanonicalType()->getAs<RecordType>()) {
1079     if (const auto *ClassDecl = dyn_cast<CXXRecordDecl>(RT->getDecl()))
1080       return !ClassDecl->hasTrivialDestructor();
1081   }
1082   return !T.isTriviallyCopyableType(Context);
1083 }
1084 
1085 void CodeGenFunction::GenerateCode(GlobalDecl GD, llvm::Function *Fn,
1086                                    const CGFunctionInfo &FnInfo) {
1087   const FunctionDecl *FD = cast<FunctionDecl>(GD.getDecl());
1088   CurGD = GD;
1089 
1090   FunctionArgList Args;
1091   QualType ResTy = BuildFunctionArgList(GD, Args);
1092 
1093   // Check if we should generate debug info for this function.
1094   if (FD->hasAttr<NoDebugAttr>())
1095     DebugInfo = nullptr; // disable debug info indefinitely for this function
1096 
1097   // The function might not have a body if we're generating thunks for a
1098   // function declaration.
1099   SourceRange BodyRange;
1100   if (Stmt *Body = FD->getBody())
1101     BodyRange = Body->getSourceRange();
1102   else
1103     BodyRange = FD->getLocation();
1104   CurEHLocation = BodyRange.getEnd();
1105 
1106   // Use the location of the start of the function to determine where
1107   // the function definition is located. By default use the location
1108   // of the declaration as the location for the subprogram. A function
1109   // may lack a declaration in the source code if it is created by code
1110   // gen. (examples: _GLOBAL__I_a, __cxx_global_array_dtor, thunk).
1111   SourceLocation Loc = FD->getLocation();
1112 
1113   // If this is a function specialization then use the pattern body
1114   // as the location for the function.
1115   if (const FunctionDecl *SpecDecl = FD->getTemplateInstantiationPattern())
1116     if (SpecDecl->hasBody(SpecDecl))
1117       Loc = SpecDecl->getLocation();
1118 
1119   Stmt *Body = FD->getBody();
1120 
1121   // Initialize helper which will detect jumps which can cause invalid lifetime
1122   // markers.
1123   if (Body && ShouldEmitLifetimeMarkers)
1124     Bypasses.Init(Body);
1125 
1126   // Emit the standard function prologue.
1127   StartFunction(GD, ResTy, Fn, FnInfo, Args, Loc, BodyRange.getBegin());
1128 
1129   // Generate the body of the function.
1130   PGO.assignRegionCounters(GD, CurFn);
1131   if (isa<CXXDestructorDecl>(FD))
1132     EmitDestructorBody(Args);
1133   else if (isa<CXXConstructorDecl>(FD))
1134     EmitConstructorBody(Args);
1135   else if (getLangOpts().CUDA &&
1136            !getLangOpts().CUDAIsDevice &&
1137            FD->hasAttr<CUDAGlobalAttr>())
1138     CGM.getCUDARuntime().emitDeviceStub(*this, Args);
1139   else if (isa<CXXConversionDecl>(FD) &&
1140            cast<CXXConversionDecl>(FD)->isLambdaToBlockPointerConversion()) {
1141     // The lambda conversion to block pointer is special; the semantics can't be
1142     // expressed in the AST, so IRGen needs to special-case it.
1143     EmitLambdaToBlockPointerBody(Args);
1144   } else if (isa<CXXMethodDecl>(FD) &&
1145              cast<CXXMethodDecl>(FD)->isLambdaStaticInvoker()) {
1146     // The lambda static invoker function is special, because it forwards or
1147     // clones the body of the function call operator (but is actually static).
1148     EmitLambdaStaticInvokeFunction(cast<CXXMethodDecl>(FD));
1149   } else if (FD->isDefaulted() && isa<CXXMethodDecl>(FD) &&
1150              (cast<CXXMethodDecl>(FD)->isCopyAssignmentOperator() ||
1151               cast<CXXMethodDecl>(FD)->isMoveAssignmentOperator())) {
1152     // Implicit copy-assignment gets the same special treatment as implicit
1153     // copy-constructors.
1154     emitImplicitAssignmentOperatorBody(Args);
1155   } else if (Body) {
1156     EmitFunctionBody(Args, Body);
1157   } else
1158     llvm_unreachable("no definition for emitted function");
1159 
1160   // C++11 [stmt.return]p2:
1161   //   Flowing off the end of a function [...] results in undefined behavior in
1162   //   a value-returning function.
1163   // C11 6.9.1p12:
1164   //   If the '}' that terminates a function is reached, and the value of the
1165   //   function call is used by the caller, the behavior is undefined.
1166   if (getLangOpts().CPlusPlus && !FD->hasImplicitReturnZero() && !SawAsmBlock &&
1167       !FD->getReturnType()->isVoidType() && Builder.GetInsertBlock()) {
1168     bool ShouldEmitUnreachable =
1169         CGM.getCodeGenOpts().StrictReturn ||
1170         shouldUseUndefinedBehaviorReturnOptimization(FD, getContext());
1171     if (SanOpts.has(SanitizerKind::Return)) {
1172       SanitizerScope SanScope(this);
1173       llvm::Value *IsFalse = Builder.getFalse();
1174       EmitCheck(std::make_pair(IsFalse, SanitizerKind::Return),
1175                 SanitizerHandler::MissingReturn,
1176                 EmitCheckSourceLocation(FD->getLocation()), None);
1177     } else if (ShouldEmitUnreachable) {
1178       if (CGM.getCodeGenOpts().OptimizationLevel == 0)
1179         EmitTrapCall(llvm::Intrinsic::trap);
1180     }
1181     if (SanOpts.has(SanitizerKind::Return) || ShouldEmitUnreachable) {
1182       Builder.CreateUnreachable();
1183       Builder.ClearInsertionPoint();
1184     }
1185   }
1186 
1187   // Emit the standard function epilogue.
1188   FinishFunction(BodyRange.getEnd());
1189 
1190   // If we haven't marked the function nothrow through other means, do
1191   // a quick pass now to see if we can.
1192   if (!CurFn->doesNotThrow())
1193     TryMarkNoThrow(CurFn);
1194 }
1195 
1196 /// ContainsLabel - Return true if the statement contains a label in it.  If
1197 /// this statement is not executed normally, it not containing a label means
1198 /// that we can just remove the code.
1199 bool CodeGenFunction::ContainsLabel(const Stmt *S, bool IgnoreCaseStmts) {
1200   // Null statement, not a label!
1201   if (!S) return false;
1202 
1203   // If this is a label, we have to emit the code, consider something like:
1204   // if (0) {  ...  foo:  bar(); }  goto foo;
1205   //
1206   // TODO: If anyone cared, we could track __label__'s, since we know that you
1207   // can't jump to one from outside their declared region.
1208   if (isa<LabelStmt>(S))
1209     return true;
1210 
1211   // If this is a case/default statement, and we haven't seen a switch, we have
1212   // to emit the code.
1213   if (isa<SwitchCase>(S) && !IgnoreCaseStmts)
1214     return true;
1215 
1216   // If this is a switch statement, we want to ignore cases below it.
1217   if (isa<SwitchStmt>(S))
1218     IgnoreCaseStmts = true;
1219 
1220   // Scan subexpressions for verboten labels.
1221   for (const Stmt *SubStmt : S->children())
1222     if (ContainsLabel(SubStmt, IgnoreCaseStmts))
1223       return true;
1224 
1225   return false;
1226 }
1227 
1228 /// containsBreak - Return true if the statement contains a break out of it.
1229 /// If the statement (recursively) contains a switch or loop with a break
1230 /// inside of it, this is fine.
1231 bool CodeGenFunction::containsBreak(const Stmt *S) {
1232   // Null statement, not a label!
1233   if (!S) return false;
1234 
1235   // If this is a switch or loop that defines its own break scope, then we can
1236   // include it and anything inside of it.
1237   if (isa<SwitchStmt>(S) || isa<WhileStmt>(S) || isa<DoStmt>(S) ||
1238       isa<ForStmt>(S))
1239     return false;
1240 
1241   if (isa<BreakStmt>(S))
1242     return true;
1243 
1244   // Scan subexpressions for verboten breaks.
1245   for (const Stmt *SubStmt : S->children())
1246     if (containsBreak(SubStmt))
1247       return true;
1248 
1249   return false;
1250 }
1251 
1252 bool CodeGenFunction::mightAddDeclToScope(const Stmt *S) {
1253   if (!S) return false;
1254 
1255   // Some statement kinds add a scope and thus never add a decl to the current
1256   // scope. Note, this list is longer than the list of statements that might
1257   // have an unscoped decl nested within them, but this way is conservatively
1258   // correct even if more statement kinds are added.
1259   if (isa<IfStmt>(S) || isa<SwitchStmt>(S) || isa<WhileStmt>(S) ||
1260       isa<DoStmt>(S) || isa<ForStmt>(S) || isa<CompoundStmt>(S) ||
1261       isa<CXXForRangeStmt>(S) || isa<CXXTryStmt>(S) ||
1262       isa<ObjCForCollectionStmt>(S) || isa<ObjCAtTryStmt>(S))
1263     return false;
1264 
1265   if (isa<DeclStmt>(S))
1266     return true;
1267 
1268   for (const Stmt *SubStmt : S->children())
1269     if (mightAddDeclToScope(SubStmt))
1270       return true;
1271 
1272   return false;
1273 }
1274 
1275 /// ConstantFoldsToSimpleInteger - If the specified expression does not fold
1276 /// to a constant, or if it does but contains a label, return false.  If it
1277 /// constant folds return true and set the boolean result in Result.
1278 bool CodeGenFunction::ConstantFoldsToSimpleInteger(const Expr *Cond,
1279                                                    bool &ResultBool,
1280                                                    bool AllowLabels) {
1281   llvm::APSInt ResultInt;
1282   if (!ConstantFoldsToSimpleInteger(Cond, ResultInt, AllowLabels))
1283     return false;
1284 
1285   ResultBool = ResultInt.getBoolValue();
1286   return true;
1287 }
1288 
1289 /// ConstantFoldsToSimpleInteger - If the specified expression does not fold
1290 /// to a constant, or if it does but contains a label, return false.  If it
1291 /// constant folds return true and set the folded value.
1292 bool CodeGenFunction::ConstantFoldsToSimpleInteger(const Expr *Cond,
1293                                                    llvm::APSInt &ResultInt,
1294                                                    bool AllowLabels) {
1295   // FIXME: Rename and handle conversion of other evaluatable things
1296   // to bool.
1297   llvm::APSInt Int;
1298   if (!Cond->EvaluateAsInt(Int, getContext()))
1299     return false;  // Not foldable, not integer or not fully evaluatable.
1300 
1301   if (!AllowLabels && CodeGenFunction::ContainsLabel(Cond))
1302     return false;  // Contains a label.
1303 
1304   ResultInt = Int;
1305   return true;
1306 }
1307 
1308 
1309 
1310 /// EmitBranchOnBoolExpr - Emit a branch on a boolean condition (e.g. for an if
1311 /// statement) to the specified blocks.  Based on the condition, this might try
1312 /// to simplify the codegen of the conditional based on the branch.
1313 ///
1314 void CodeGenFunction::EmitBranchOnBoolExpr(const Expr *Cond,
1315                                            llvm::BasicBlock *TrueBlock,
1316                                            llvm::BasicBlock *FalseBlock,
1317                                            uint64_t TrueCount) {
1318   Cond = Cond->IgnoreParens();
1319 
1320   if (const BinaryOperator *CondBOp = dyn_cast<BinaryOperator>(Cond)) {
1321 
1322     // Handle X && Y in a condition.
1323     if (CondBOp->getOpcode() == BO_LAnd) {
1324       // If we have "1 && X", simplify the code.  "0 && X" would have constant
1325       // folded if the case was simple enough.
1326       bool ConstantBool = false;
1327       if (ConstantFoldsToSimpleInteger(CondBOp->getLHS(), ConstantBool) &&
1328           ConstantBool) {
1329         // br(1 && X) -> br(X).
1330         incrementProfileCounter(CondBOp);
1331         return EmitBranchOnBoolExpr(CondBOp->getRHS(), TrueBlock, FalseBlock,
1332                                     TrueCount);
1333       }
1334 
1335       // If we have "X && 1", simplify the code to use an uncond branch.
1336       // "X && 0" would have been constant folded to 0.
1337       if (ConstantFoldsToSimpleInteger(CondBOp->getRHS(), ConstantBool) &&
1338           ConstantBool) {
1339         // br(X && 1) -> br(X).
1340         return EmitBranchOnBoolExpr(CondBOp->getLHS(), TrueBlock, FalseBlock,
1341                                     TrueCount);
1342       }
1343 
1344       // Emit the LHS as a conditional.  If the LHS conditional is false, we
1345       // want to jump to the FalseBlock.
1346       llvm::BasicBlock *LHSTrue = createBasicBlock("land.lhs.true");
1347       // The counter tells us how often we evaluate RHS, and all of TrueCount
1348       // can be propagated to that branch.
1349       uint64_t RHSCount = getProfileCount(CondBOp->getRHS());
1350 
1351       ConditionalEvaluation eval(*this);
1352       {
1353         ApplyDebugLocation DL(*this, Cond);
1354         EmitBranchOnBoolExpr(CondBOp->getLHS(), LHSTrue, FalseBlock, RHSCount);
1355         EmitBlock(LHSTrue);
1356       }
1357 
1358       incrementProfileCounter(CondBOp);
1359       setCurrentProfileCount(getProfileCount(CondBOp->getRHS()));
1360 
1361       // Any temporaries created here are conditional.
1362       eval.begin(*this);
1363       EmitBranchOnBoolExpr(CondBOp->getRHS(), TrueBlock, FalseBlock, TrueCount);
1364       eval.end(*this);
1365 
1366       return;
1367     }
1368 
1369     if (CondBOp->getOpcode() == BO_LOr) {
1370       // If we have "0 || X", simplify the code.  "1 || X" would have constant
1371       // folded if the case was simple enough.
1372       bool ConstantBool = false;
1373       if (ConstantFoldsToSimpleInteger(CondBOp->getLHS(), ConstantBool) &&
1374           !ConstantBool) {
1375         // br(0 || X) -> br(X).
1376         incrementProfileCounter(CondBOp);
1377         return EmitBranchOnBoolExpr(CondBOp->getRHS(), TrueBlock, FalseBlock,
1378                                     TrueCount);
1379       }
1380 
1381       // If we have "X || 0", simplify the code to use an uncond branch.
1382       // "X || 1" would have been constant folded to 1.
1383       if (ConstantFoldsToSimpleInteger(CondBOp->getRHS(), ConstantBool) &&
1384           !ConstantBool) {
1385         // br(X || 0) -> br(X).
1386         return EmitBranchOnBoolExpr(CondBOp->getLHS(), TrueBlock, FalseBlock,
1387                                     TrueCount);
1388       }
1389 
1390       // Emit the LHS as a conditional.  If the LHS conditional is true, we
1391       // want to jump to the TrueBlock.
1392       llvm::BasicBlock *LHSFalse = createBasicBlock("lor.lhs.false");
1393       // We have the count for entry to the RHS and for the whole expression
1394       // being true, so we can divy up True count between the short circuit and
1395       // the RHS.
1396       uint64_t LHSCount =
1397           getCurrentProfileCount() - getProfileCount(CondBOp->getRHS());
1398       uint64_t RHSCount = TrueCount - LHSCount;
1399 
1400       ConditionalEvaluation eval(*this);
1401       {
1402         ApplyDebugLocation DL(*this, Cond);
1403         EmitBranchOnBoolExpr(CondBOp->getLHS(), TrueBlock, LHSFalse, LHSCount);
1404         EmitBlock(LHSFalse);
1405       }
1406 
1407       incrementProfileCounter(CondBOp);
1408       setCurrentProfileCount(getProfileCount(CondBOp->getRHS()));
1409 
1410       // Any temporaries created here are conditional.
1411       eval.begin(*this);
1412       EmitBranchOnBoolExpr(CondBOp->getRHS(), TrueBlock, FalseBlock, RHSCount);
1413 
1414       eval.end(*this);
1415 
1416       return;
1417     }
1418   }
1419 
1420   if (const UnaryOperator *CondUOp = dyn_cast<UnaryOperator>(Cond)) {
1421     // br(!x, t, f) -> br(x, f, t)
1422     if (CondUOp->getOpcode() == UO_LNot) {
1423       // Negate the count.
1424       uint64_t FalseCount = getCurrentProfileCount() - TrueCount;
1425       // Negate the condition and swap the destination blocks.
1426       return EmitBranchOnBoolExpr(CondUOp->getSubExpr(), FalseBlock, TrueBlock,
1427                                   FalseCount);
1428     }
1429   }
1430 
1431   if (const ConditionalOperator *CondOp = dyn_cast<ConditionalOperator>(Cond)) {
1432     // br(c ? x : y, t, f) -> br(c, br(x, t, f), br(y, t, f))
1433     llvm::BasicBlock *LHSBlock = createBasicBlock("cond.true");
1434     llvm::BasicBlock *RHSBlock = createBasicBlock("cond.false");
1435 
1436     ConditionalEvaluation cond(*this);
1437     EmitBranchOnBoolExpr(CondOp->getCond(), LHSBlock, RHSBlock,
1438                          getProfileCount(CondOp));
1439 
1440     // When computing PGO branch weights, we only know the overall count for
1441     // the true block. This code is essentially doing tail duplication of the
1442     // naive code-gen, introducing new edges for which counts are not
1443     // available. Divide the counts proportionally between the LHS and RHS of
1444     // the conditional operator.
1445     uint64_t LHSScaledTrueCount = 0;
1446     if (TrueCount) {
1447       double LHSRatio =
1448           getProfileCount(CondOp) / (double)getCurrentProfileCount();
1449       LHSScaledTrueCount = TrueCount * LHSRatio;
1450     }
1451 
1452     cond.begin(*this);
1453     EmitBlock(LHSBlock);
1454     incrementProfileCounter(CondOp);
1455     {
1456       ApplyDebugLocation DL(*this, Cond);
1457       EmitBranchOnBoolExpr(CondOp->getLHS(), TrueBlock, FalseBlock,
1458                            LHSScaledTrueCount);
1459     }
1460     cond.end(*this);
1461 
1462     cond.begin(*this);
1463     EmitBlock(RHSBlock);
1464     EmitBranchOnBoolExpr(CondOp->getRHS(), TrueBlock, FalseBlock,
1465                          TrueCount - LHSScaledTrueCount);
1466     cond.end(*this);
1467 
1468     return;
1469   }
1470 
1471   if (const CXXThrowExpr *Throw = dyn_cast<CXXThrowExpr>(Cond)) {
1472     // Conditional operator handling can give us a throw expression as a
1473     // condition for a case like:
1474     //   br(c ? throw x : y, t, f) -> br(c, br(throw x, t, f), br(y, t, f)
1475     // Fold this to:
1476     //   br(c, throw x, br(y, t, f))
1477     EmitCXXThrowExpr(Throw, /*KeepInsertionPoint*/false);
1478     return;
1479   }
1480 
1481   // If the branch has a condition wrapped by __builtin_unpredictable,
1482   // create metadata that specifies that the branch is unpredictable.
1483   // Don't bother if not optimizing because that metadata would not be used.
1484   llvm::MDNode *Unpredictable = nullptr;
1485   auto *Call = dyn_cast<CallExpr>(Cond);
1486   if (Call && CGM.getCodeGenOpts().OptimizationLevel != 0) {
1487     auto *FD = dyn_cast_or_null<FunctionDecl>(Call->getCalleeDecl());
1488     if (FD && FD->getBuiltinID() == Builtin::BI__builtin_unpredictable) {
1489       llvm::MDBuilder MDHelper(getLLVMContext());
1490       Unpredictable = MDHelper.createUnpredictable();
1491     }
1492   }
1493 
1494   // Create branch weights based on the number of times we get here and the
1495   // number of times the condition should be true.
1496   uint64_t CurrentCount = std::max(getCurrentProfileCount(), TrueCount);
1497   llvm::MDNode *Weights =
1498       createProfileWeights(TrueCount, CurrentCount - TrueCount);
1499 
1500   // Emit the code with the fully general case.
1501   llvm::Value *CondV;
1502   {
1503     ApplyDebugLocation DL(*this, Cond);
1504     CondV = EvaluateExprAsBool(Cond);
1505   }
1506   Builder.CreateCondBr(CondV, TrueBlock, FalseBlock, Weights, Unpredictable);
1507 }
1508 
1509 /// ErrorUnsupported - Print out an error that codegen doesn't support the
1510 /// specified stmt yet.
1511 void CodeGenFunction::ErrorUnsupported(const Stmt *S, const char *Type) {
1512   CGM.ErrorUnsupported(S, Type);
1513 }
1514 
1515 /// emitNonZeroVLAInit - Emit the "zero" initialization of a
1516 /// variable-length array whose elements have a non-zero bit-pattern.
1517 ///
1518 /// \param baseType the inner-most element type of the array
1519 /// \param src - a char* pointing to the bit-pattern for a single
1520 /// base element of the array
1521 /// \param sizeInChars - the total size of the VLA, in chars
1522 static void emitNonZeroVLAInit(CodeGenFunction &CGF, QualType baseType,
1523                                Address dest, Address src,
1524                                llvm::Value *sizeInChars) {
1525   CGBuilderTy &Builder = CGF.Builder;
1526 
1527   CharUnits baseSize = CGF.getContext().getTypeSizeInChars(baseType);
1528   llvm::Value *baseSizeInChars
1529     = llvm::ConstantInt::get(CGF.IntPtrTy, baseSize.getQuantity());
1530 
1531   Address begin =
1532     Builder.CreateElementBitCast(dest, CGF.Int8Ty, "vla.begin");
1533   llvm::Value *end =
1534     Builder.CreateInBoundsGEP(begin.getPointer(), sizeInChars, "vla.end");
1535 
1536   llvm::BasicBlock *originBB = CGF.Builder.GetInsertBlock();
1537   llvm::BasicBlock *loopBB = CGF.createBasicBlock("vla-init.loop");
1538   llvm::BasicBlock *contBB = CGF.createBasicBlock("vla-init.cont");
1539 
1540   // Make a loop over the VLA.  C99 guarantees that the VLA element
1541   // count must be nonzero.
1542   CGF.EmitBlock(loopBB);
1543 
1544   llvm::PHINode *cur = Builder.CreatePHI(begin.getType(), 2, "vla.cur");
1545   cur->addIncoming(begin.getPointer(), originBB);
1546 
1547   CharUnits curAlign =
1548     dest.getAlignment().alignmentOfArrayElement(baseSize);
1549 
1550   // memcpy the individual element bit-pattern.
1551   Builder.CreateMemCpy(Address(cur, curAlign), src, baseSizeInChars,
1552                        /*volatile*/ false);
1553 
1554   // Go to the next element.
1555   llvm::Value *next =
1556     Builder.CreateInBoundsGEP(CGF.Int8Ty, cur, baseSizeInChars, "vla.next");
1557 
1558   // Leave if that's the end of the VLA.
1559   llvm::Value *done = Builder.CreateICmpEQ(next, end, "vla-init.isdone");
1560   Builder.CreateCondBr(done, contBB, loopBB);
1561   cur->addIncoming(next, loopBB);
1562 
1563   CGF.EmitBlock(contBB);
1564 }
1565 
1566 void
1567 CodeGenFunction::EmitNullInitialization(Address DestPtr, QualType Ty) {
1568   // Ignore empty classes in C++.
1569   if (getLangOpts().CPlusPlus) {
1570     if (const RecordType *RT = Ty->getAs<RecordType>()) {
1571       if (cast<CXXRecordDecl>(RT->getDecl())->isEmpty())
1572         return;
1573     }
1574   }
1575 
1576   // Cast the dest ptr to the appropriate i8 pointer type.
1577   if (DestPtr.getElementType() != Int8Ty)
1578     DestPtr = Builder.CreateElementBitCast(DestPtr, Int8Ty);
1579 
1580   // Get size and alignment info for this aggregate.
1581   CharUnits size = getContext().getTypeSizeInChars(Ty);
1582 
1583   llvm::Value *SizeVal;
1584   const VariableArrayType *vla;
1585 
1586   // Don't bother emitting a zero-byte memset.
1587   if (size.isZero()) {
1588     // But note that getTypeInfo returns 0 for a VLA.
1589     if (const VariableArrayType *vlaType =
1590           dyn_cast_or_null<VariableArrayType>(
1591                                           getContext().getAsArrayType(Ty))) {
1592       QualType eltType;
1593       llvm::Value *numElts;
1594       std::tie(numElts, eltType) = getVLASize(vlaType);
1595 
1596       SizeVal = numElts;
1597       CharUnits eltSize = getContext().getTypeSizeInChars(eltType);
1598       if (!eltSize.isOne())
1599         SizeVal = Builder.CreateNUWMul(SizeVal, CGM.getSize(eltSize));
1600       vla = vlaType;
1601     } else {
1602       return;
1603     }
1604   } else {
1605     SizeVal = CGM.getSize(size);
1606     vla = nullptr;
1607   }
1608 
1609   // If the type contains a pointer to data member we can't memset it to zero.
1610   // Instead, create a null constant and copy it to the destination.
1611   // TODO: there are other patterns besides zero that we can usefully memset,
1612   // like -1, which happens to be the pattern used by member-pointers.
1613   if (!CGM.getTypes().isZeroInitializable(Ty)) {
1614     // For a VLA, emit a single element, then splat that over the VLA.
1615     if (vla) Ty = getContext().getBaseElementType(vla);
1616 
1617     llvm::Constant *NullConstant = CGM.EmitNullConstant(Ty);
1618 
1619     llvm::GlobalVariable *NullVariable =
1620       new llvm::GlobalVariable(CGM.getModule(), NullConstant->getType(),
1621                                /*isConstant=*/true,
1622                                llvm::GlobalVariable::PrivateLinkage,
1623                                NullConstant, Twine());
1624     CharUnits NullAlign = DestPtr.getAlignment();
1625     NullVariable->setAlignment(NullAlign.getQuantity());
1626     Address SrcPtr(Builder.CreateBitCast(NullVariable, Builder.getInt8PtrTy()),
1627                    NullAlign);
1628 
1629     if (vla) return emitNonZeroVLAInit(*this, Ty, DestPtr, SrcPtr, SizeVal);
1630 
1631     // Get and call the appropriate llvm.memcpy overload.
1632     Builder.CreateMemCpy(DestPtr, SrcPtr, SizeVal, false);
1633     return;
1634   }
1635 
1636   // Otherwise, just memset the whole thing to zero.  This is legal
1637   // because in LLVM, all default initializers (other than the ones we just
1638   // handled above) are guaranteed to have a bit pattern of all zeros.
1639   Builder.CreateMemSet(DestPtr, Builder.getInt8(0), SizeVal, false);
1640 }
1641 
1642 llvm::BlockAddress *CodeGenFunction::GetAddrOfLabel(const LabelDecl *L) {
1643   // Make sure that there is a block for the indirect goto.
1644   if (!IndirectBranch)
1645     GetIndirectGotoBlock();
1646 
1647   llvm::BasicBlock *BB = getJumpDestForLabel(L).getBlock();
1648 
1649   // Make sure the indirect branch includes all of the address-taken blocks.
1650   IndirectBranch->addDestination(BB);
1651   return llvm::BlockAddress::get(CurFn, BB);
1652 }
1653 
1654 llvm::BasicBlock *CodeGenFunction::GetIndirectGotoBlock() {
1655   // If we already made the indirect branch for indirect goto, return its block.
1656   if (IndirectBranch) return IndirectBranch->getParent();
1657 
1658   CGBuilderTy TmpBuilder(*this, createBasicBlock("indirectgoto"));
1659 
1660   // Create the PHI node that indirect gotos will add entries to.
1661   llvm::Value *DestVal = TmpBuilder.CreatePHI(Int8PtrTy, 0,
1662                                               "indirect.goto.dest");
1663 
1664   // Create the indirect branch instruction.
1665   IndirectBranch = TmpBuilder.CreateIndirectBr(DestVal);
1666   return IndirectBranch->getParent();
1667 }
1668 
1669 /// Computes the length of an array in elements, as well as the base
1670 /// element type and a properly-typed first element pointer.
1671 llvm::Value *CodeGenFunction::emitArrayLength(const ArrayType *origArrayType,
1672                                               QualType &baseType,
1673                                               Address &addr) {
1674   const ArrayType *arrayType = origArrayType;
1675 
1676   // If it's a VLA, we have to load the stored size.  Note that
1677   // this is the size of the VLA in bytes, not its size in elements.
1678   llvm::Value *numVLAElements = nullptr;
1679   if (isa<VariableArrayType>(arrayType)) {
1680     numVLAElements = getVLASize(cast<VariableArrayType>(arrayType)).first;
1681 
1682     // Walk into all VLAs.  This doesn't require changes to addr,
1683     // which has type T* where T is the first non-VLA element type.
1684     do {
1685       QualType elementType = arrayType->getElementType();
1686       arrayType = getContext().getAsArrayType(elementType);
1687 
1688       // If we only have VLA components, 'addr' requires no adjustment.
1689       if (!arrayType) {
1690         baseType = elementType;
1691         return numVLAElements;
1692       }
1693     } while (isa<VariableArrayType>(arrayType));
1694 
1695     // We get out here only if we find a constant array type
1696     // inside the VLA.
1697   }
1698 
1699   // We have some number of constant-length arrays, so addr should
1700   // have LLVM type [M x [N x [...]]]*.  Build a GEP that walks
1701   // down to the first element of addr.
1702   SmallVector<llvm::Value*, 8> gepIndices;
1703 
1704   // GEP down to the array type.
1705   llvm::ConstantInt *zero = Builder.getInt32(0);
1706   gepIndices.push_back(zero);
1707 
1708   uint64_t countFromCLAs = 1;
1709   QualType eltType;
1710 
1711   llvm::ArrayType *llvmArrayType =
1712     dyn_cast<llvm::ArrayType>(addr.getElementType());
1713   while (llvmArrayType) {
1714     assert(isa<ConstantArrayType>(arrayType));
1715     assert(cast<ConstantArrayType>(arrayType)->getSize().getZExtValue()
1716              == llvmArrayType->getNumElements());
1717 
1718     gepIndices.push_back(zero);
1719     countFromCLAs *= llvmArrayType->getNumElements();
1720     eltType = arrayType->getElementType();
1721 
1722     llvmArrayType =
1723       dyn_cast<llvm::ArrayType>(llvmArrayType->getElementType());
1724     arrayType = getContext().getAsArrayType(arrayType->getElementType());
1725     assert((!llvmArrayType || arrayType) &&
1726            "LLVM and Clang types are out-of-synch");
1727   }
1728 
1729   if (arrayType) {
1730     // From this point onwards, the Clang array type has been emitted
1731     // as some other type (probably a packed struct). Compute the array
1732     // size, and just emit the 'begin' expression as a bitcast.
1733     while (arrayType) {
1734       countFromCLAs *=
1735           cast<ConstantArrayType>(arrayType)->getSize().getZExtValue();
1736       eltType = arrayType->getElementType();
1737       arrayType = getContext().getAsArrayType(eltType);
1738     }
1739 
1740     llvm::Type *baseType = ConvertType(eltType);
1741     addr = Builder.CreateElementBitCast(addr, baseType, "array.begin");
1742   } else {
1743     // Create the actual GEP.
1744     addr = Address(Builder.CreateInBoundsGEP(addr.getPointer(),
1745                                              gepIndices, "array.begin"),
1746                    addr.getAlignment());
1747   }
1748 
1749   baseType = eltType;
1750 
1751   llvm::Value *numElements
1752     = llvm::ConstantInt::get(SizeTy, countFromCLAs);
1753 
1754   // If we had any VLA dimensions, factor them in.
1755   if (numVLAElements)
1756     numElements = Builder.CreateNUWMul(numVLAElements, numElements);
1757 
1758   return numElements;
1759 }
1760 
1761 std::pair<llvm::Value*, QualType>
1762 CodeGenFunction::getVLASize(QualType type) {
1763   const VariableArrayType *vla = getContext().getAsVariableArrayType(type);
1764   assert(vla && "type was not a variable array type!");
1765   return getVLASize(vla);
1766 }
1767 
1768 std::pair<llvm::Value*, QualType>
1769 CodeGenFunction::getVLASize(const VariableArrayType *type) {
1770   // The number of elements so far; always size_t.
1771   llvm::Value *numElements = nullptr;
1772 
1773   QualType elementType;
1774   do {
1775     elementType = type->getElementType();
1776     llvm::Value *vlaSize = VLASizeMap[type->getSizeExpr()];
1777     assert(vlaSize && "no size for VLA!");
1778     assert(vlaSize->getType() == SizeTy);
1779 
1780     if (!numElements) {
1781       numElements = vlaSize;
1782     } else {
1783       // It's undefined behavior if this wraps around, so mark it that way.
1784       // FIXME: Teach -fsanitize=undefined to trap this.
1785       numElements = Builder.CreateNUWMul(numElements, vlaSize);
1786     }
1787   } while ((type = getContext().getAsVariableArrayType(elementType)));
1788 
1789   return std::pair<llvm::Value*,QualType>(numElements, elementType);
1790 }
1791 
1792 void CodeGenFunction::EmitVariablyModifiedType(QualType type) {
1793   assert(type->isVariablyModifiedType() &&
1794          "Must pass variably modified type to EmitVLASizes!");
1795 
1796   EnsureInsertPoint();
1797 
1798   // We're going to walk down into the type and look for VLA
1799   // expressions.
1800   do {
1801     assert(type->isVariablyModifiedType());
1802 
1803     const Type *ty = type.getTypePtr();
1804     switch (ty->getTypeClass()) {
1805 
1806 #define TYPE(Class, Base)
1807 #define ABSTRACT_TYPE(Class, Base)
1808 #define NON_CANONICAL_TYPE(Class, Base)
1809 #define DEPENDENT_TYPE(Class, Base) case Type::Class:
1810 #define NON_CANONICAL_UNLESS_DEPENDENT_TYPE(Class, Base)
1811 #include "clang/AST/TypeNodes.def"
1812       llvm_unreachable("unexpected dependent type!");
1813 
1814     // These types are never variably-modified.
1815     case Type::Builtin:
1816     case Type::Complex:
1817     case Type::Vector:
1818     case Type::ExtVector:
1819     case Type::Record:
1820     case Type::Enum:
1821     case Type::Elaborated:
1822     case Type::TemplateSpecialization:
1823     case Type::ObjCTypeParam:
1824     case Type::ObjCObject:
1825     case Type::ObjCInterface:
1826     case Type::ObjCObjectPointer:
1827       llvm_unreachable("type class is never variably-modified!");
1828 
1829     case Type::Adjusted:
1830       type = cast<AdjustedType>(ty)->getAdjustedType();
1831       break;
1832 
1833     case Type::Decayed:
1834       type = cast<DecayedType>(ty)->getPointeeType();
1835       break;
1836 
1837     case Type::Pointer:
1838       type = cast<PointerType>(ty)->getPointeeType();
1839       break;
1840 
1841     case Type::BlockPointer:
1842       type = cast<BlockPointerType>(ty)->getPointeeType();
1843       break;
1844 
1845     case Type::LValueReference:
1846     case Type::RValueReference:
1847       type = cast<ReferenceType>(ty)->getPointeeType();
1848       break;
1849 
1850     case Type::MemberPointer:
1851       type = cast<MemberPointerType>(ty)->getPointeeType();
1852       break;
1853 
1854     case Type::ConstantArray:
1855     case Type::IncompleteArray:
1856       // Losing element qualification here is fine.
1857       type = cast<ArrayType>(ty)->getElementType();
1858       break;
1859 
1860     case Type::VariableArray: {
1861       // Losing element qualification here is fine.
1862       const VariableArrayType *vat = cast<VariableArrayType>(ty);
1863 
1864       // Unknown size indication requires no size computation.
1865       // Otherwise, evaluate and record it.
1866       if (const Expr *size = vat->getSizeExpr()) {
1867         // It's possible that we might have emitted this already,
1868         // e.g. with a typedef and a pointer to it.
1869         llvm::Value *&entry = VLASizeMap[size];
1870         if (!entry) {
1871           llvm::Value *Size = EmitScalarExpr(size);
1872 
1873           // C11 6.7.6.2p5:
1874           //   If the size is an expression that is not an integer constant
1875           //   expression [...] each time it is evaluated it shall have a value
1876           //   greater than zero.
1877           if (SanOpts.has(SanitizerKind::VLABound) &&
1878               size->getType()->isSignedIntegerType()) {
1879             SanitizerScope SanScope(this);
1880             llvm::Value *Zero = llvm::Constant::getNullValue(Size->getType());
1881             llvm::Constant *StaticArgs[] = {
1882               EmitCheckSourceLocation(size->getLocStart()),
1883               EmitCheckTypeDescriptor(size->getType())
1884             };
1885             EmitCheck(std::make_pair(Builder.CreateICmpSGT(Size, Zero),
1886                                      SanitizerKind::VLABound),
1887                       SanitizerHandler::VLABoundNotPositive, StaticArgs, Size);
1888           }
1889 
1890           // Always zexting here would be wrong if it weren't
1891           // undefined behavior to have a negative bound.
1892           entry = Builder.CreateIntCast(Size, SizeTy, /*signed*/ false);
1893         }
1894       }
1895       type = vat->getElementType();
1896       break;
1897     }
1898 
1899     case Type::FunctionProto:
1900     case Type::FunctionNoProto:
1901       type = cast<FunctionType>(ty)->getReturnType();
1902       break;
1903 
1904     case Type::Paren:
1905     case Type::TypeOf:
1906     case Type::UnaryTransform:
1907     case Type::Attributed:
1908     case Type::SubstTemplateTypeParm:
1909     case Type::PackExpansion:
1910       // Keep walking after single level desugaring.
1911       type = type.getSingleStepDesugaredType(getContext());
1912       break;
1913 
1914     case Type::Typedef:
1915     case Type::Decltype:
1916     case Type::Auto:
1917     case Type::DeducedTemplateSpecialization:
1918       // Stop walking: nothing to do.
1919       return;
1920 
1921     case Type::TypeOfExpr:
1922       // Stop walking: emit typeof expression.
1923       EmitIgnoredExpr(cast<TypeOfExprType>(ty)->getUnderlyingExpr());
1924       return;
1925 
1926     case Type::Atomic:
1927       type = cast<AtomicType>(ty)->getValueType();
1928       break;
1929 
1930     case Type::Pipe:
1931       type = cast<PipeType>(ty)->getElementType();
1932       break;
1933     }
1934   } while (type->isVariablyModifiedType());
1935 }
1936 
1937 Address CodeGenFunction::EmitVAListRef(const Expr* E) {
1938   if (getContext().getBuiltinVaListType()->isArrayType())
1939     return EmitPointerWithAlignment(E);
1940   return EmitLValue(E).getAddress();
1941 }
1942 
1943 Address CodeGenFunction::EmitMSVAListRef(const Expr *E) {
1944   return EmitLValue(E).getAddress();
1945 }
1946 
1947 void CodeGenFunction::EmitDeclRefExprDbgValue(const DeclRefExpr *E,
1948                                               const APValue &Init) {
1949   assert(!Init.isUninit() && "Invalid DeclRefExpr initializer!");
1950   if (CGDebugInfo *Dbg = getDebugInfo())
1951     if (CGM.getCodeGenOpts().getDebugInfo() >= codegenoptions::LimitedDebugInfo)
1952       Dbg->EmitGlobalVariable(E->getDecl(), Init);
1953 }
1954 
1955 CodeGenFunction::PeepholeProtection
1956 CodeGenFunction::protectFromPeepholes(RValue rvalue) {
1957   // At the moment, the only aggressive peephole we do in IR gen
1958   // is trunc(zext) folding, but if we add more, we can easily
1959   // extend this protection.
1960 
1961   if (!rvalue.isScalar()) return PeepholeProtection();
1962   llvm::Value *value = rvalue.getScalarVal();
1963   if (!isa<llvm::ZExtInst>(value)) return PeepholeProtection();
1964 
1965   // Just make an extra bitcast.
1966   assert(HaveInsertPoint());
1967   llvm::Instruction *inst = new llvm::BitCastInst(value, value->getType(), "",
1968                                                   Builder.GetInsertBlock());
1969 
1970   PeepholeProtection protection;
1971   protection.Inst = inst;
1972   return protection;
1973 }
1974 
1975 void CodeGenFunction::unprotectFromPeepholes(PeepholeProtection protection) {
1976   if (!protection.Inst) return;
1977 
1978   // In theory, we could try to duplicate the peepholes now, but whatever.
1979   protection.Inst->eraseFromParent();
1980 }
1981 
1982 llvm::Value *CodeGenFunction::EmitAnnotationCall(llvm::Value *AnnotationFn,
1983                                                  llvm::Value *AnnotatedVal,
1984                                                  StringRef AnnotationStr,
1985                                                  SourceLocation Location) {
1986   llvm::Value *Args[4] = {
1987     AnnotatedVal,
1988     Builder.CreateBitCast(CGM.EmitAnnotationString(AnnotationStr), Int8PtrTy),
1989     Builder.CreateBitCast(CGM.EmitAnnotationUnit(Location), Int8PtrTy),
1990     CGM.EmitAnnotationLineNo(Location)
1991   };
1992   return Builder.CreateCall(AnnotationFn, Args);
1993 }
1994 
1995 void CodeGenFunction::EmitVarAnnotations(const VarDecl *D, llvm::Value *V) {
1996   assert(D->hasAttr<AnnotateAttr>() && "no annotate attribute");
1997   // FIXME We create a new bitcast for every annotation because that's what
1998   // llvm-gcc was doing.
1999   for (const auto *I : D->specific_attrs<AnnotateAttr>())
2000     EmitAnnotationCall(CGM.getIntrinsic(llvm::Intrinsic::var_annotation),
2001                        Builder.CreateBitCast(V, CGM.Int8PtrTy, V->getName()),
2002                        I->getAnnotation(), D->getLocation());
2003 }
2004 
2005 Address CodeGenFunction::EmitFieldAnnotations(const FieldDecl *D,
2006                                               Address Addr) {
2007   assert(D->hasAttr<AnnotateAttr>() && "no annotate attribute");
2008   llvm::Value *V = Addr.getPointer();
2009   llvm::Type *VTy = V->getType();
2010   llvm::Value *F = CGM.getIntrinsic(llvm::Intrinsic::ptr_annotation,
2011                                     CGM.Int8PtrTy);
2012 
2013   for (const auto *I : D->specific_attrs<AnnotateAttr>()) {
2014     // FIXME Always emit the cast inst so we can differentiate between
2015     // annotation on the first field of a struct and annotation on the struct
2016     // itself.
2017     if (VTy != CGM.Int8PtrTy)
2018       V = Builder.Insert(new llvm::BitCastInst(V, CGM.Int8PtrTy));
2019     V = EmitAnnotationCall(F, V, I->getAnnotation(), D->getLocation());
2020     V = Builder.CreateBitCast(V, VTy);
2021   }
2022 
2023   return Address(V, Addr.getAlignment());
2024 }
2025 
2026 CodeGenFunction::CGCapturedStmtInfo::~CGCapturedStmtInfo() { }
2027 
2028 CodeGenFunction::SanitizerScope::SanitizerScope(CodeGenFunction *CGF)
2029     : CGF(CGF) {
2030   assert(!CGF->IsSanitizerScope);
2031   CGF->IsSanitizerScope = true;
2032 }
2033 
2034 CodeGenFunction::SanitizerScope::~SanitizerScope() {
2035   CGF->IsSanitizerScope = false;
2036 }
2037 
2038 void CodeGenFunction::InsertHelper(llvm::Instruction *I,
2039                                    const llvm::Twine &Name,
2040                                    llvm::BasicBlock *BB,
2041                                    llvm::BasicBlock::iterator InsertPt) const {
2042   LoopStack.InsertHelper(I);
2043   if (IsSanitizerScope)
2044     CGM.getSanitizerMetadata()->disableSanitizerForInstruction(I);
2045 }
2046 
2047 void CGBuilderInserter::InsertHelper(
2048     llvm::Instruction *I, const llvm::Twine &Name, llvm::BasicBlock *BB,
2049     llvm::BasicBlock::iterator InsertPt) const {
2050   llvm::IRBuilderDefaultInserter::InsertHelper(I, Name, BB, InsertPt);
2051   if (CGF)
2052     CGF->InsertHelper(I, Name, BB, InsertPt);
2053 }
2054 
2055 static bool hasRequiredFeatures(const SmallVectorImpl<StringRef> &ReqFeatures,
2056                                 CodeGenModule &CGM, const FunctionDecl *FD,
2057                                 std::string &FirstMissing) {
2058   // If there aren't any required features listed then go ahead and return.
2059   if (ReqFeatures.empty())
2060     return false;
2061 
2062   // Now build up the set of caller features and verify that all the required
2063   // features are there.
2064   llvm::StringMap<bool> CallerFeatureMap;
2065   CGM.getFunctionFeatureMap(CallerFeatureMap, FD);
2066 
2067   // If we have at least one of the features in the feature list return
2068   // true, otherwise return false.
2069   return std::all_of(
2070       ReqFeatures.begin(), ReqFeatures.end(), [&](StringRef Feature) {
2071         SmallVector<StringRef, 1> OrFeatures;
2072         Feature.split(OrFeatures, "|");
2073         return std::any_of(OrFeatures.begin(), OrFeatures.end(),
2074                            [&](StringRef Feature) {
2075                              if (!CallerFeatureMap.lookup(Feature)) {
2076                                FirstMissing = Feature.str();
2077                                return false;
2078                              }
2079                              return true;
2080                            });
2081       });
2082 }
2083 
2084 // Emits an error if we don't have a valid set of target features for the
2085 // called function.
2086 void CodeGenFunction::checkTargetFeatures(const CallExpr *E,
2087                                           const FunctionDecl *TargetDecl) {
2088   // Early exit if this is an indirect call.
2089   if (!TargetDecl)
2090     return;
2091 
2092   // Get the current enclosing function if it exists. If it doesn't
2093   // we can't check the target features anyhow.
2094   const FunctionDecl *FD = dyn_cast_or_null<FunctionDecl>(CurFuncDecl);
2095   if (!FD)
2096     return;
2097 
2098   // Grab the required features for the call. For a builtin this is listed in
2099   // the td file with the default cpu, for an always_inline function this is any
2100   // listed cpu and any listed features.
2101   unsigned BuiltinID = TargetDecl->getBuiltinID();
2102   std::string MissingFeature;
2103   if (BuiltinID) {
2104     SmallVector<StringRef, 1> ReqFeatures;
2105     const char *FeatureList =
2106         CGM.getContext().BuiltinInfo.getRequiredFeatures(BuiltinID);
2107     // Return if the builtin doesn't have any required features.
2108     if (!FeatureList || StringRef(FeatureList) == "")
2109       return;
2110     StringRef(FeatureList).split(ReqFeatures, ",");
2111     if (!hasRequiredFeatures(ReqFeatures, CGM, FD, MissingFeature))
2112       CGM.getDiags().Report(E->getLocStart(), diag::err_builtin_needs_feature)
2113           << TargetDecl->getDeclName()
2114           << CGM.getContext().BuiltinInfo.getRequiredFeatures(BuiltinID);
2115 
2116   } else if (TargetDecl->hasAttr<TargetAttr>()) {
2117     // Get the required features for the callee.
2118     SmallVector<StringRef, 1> ReqFeatures;
2119     llvm::StringMap<bool> CalleeFeatureMap;
2120     CGM.getFunctionFeatureMap(CalleeFeatureMap, TargetDecl);
2121     for (const auto &F : CalleeFeatureMap) {
2122       // Only positive features are "required".
2123       if (F.getValue())
2124         ReqFeatures.push_back(F.getKey());
2125     }
2126     if (!hasRequiredFeatures(ReqFeatures, CGM, FD, MissingFeature))
2127       CGM.getDiags().Report(E->getLocStart(), diag::err_function_needs_feature)
2128           << FD->getDeclName() << TargetDecl->getDeclName() << MissingFeature;
2129   }
2130 }
2131 
2132 void CodeGenFunction::EmitSanitizerStatReport(llvm::SanitizerStatKind SSK) {
2133   if (!CGM.getCodeGenOpts().SanitizeStats)
2134     return;
2135 
2136   llvm::IRBuilder<> IRB(Builder.GetInsertBlock(), Builder.GetInsertPoint());
2137   IRB.SetCurrentDebugLocation(Builder.getCurrentDebugLocation());
2138   CGM.getSanStats().create(IRB, SSK);
2139 }
2140 
2141 llvm::DebugLoc CodeGenFunction::SourceLocToDebugLoc(SourceLocation Location) {
2142   if (CGDebugInfo *DI = getDebugInfo())
2143     return DI->SourceLocToDebugLoc(Location);
2144 
2145   return llvm::DebugLoc();
2146 }
2147