head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.13 netbsd-11-0-RC3:1.1.1.13 netbsd-11-0-RC2:1.1.1.13 netbsd-11-0-RC1:1.1.1.13 perseant-exfatfs-base-20250801:1.1.1.13 netbsd-11:1.1.1.13.0.10 netbsd-11-base:1.1.1.13 netbsd-10-1-RELEASE:1.1.1.13 perseant-exfatfs-base-20240630:1.1.1.13 perseant-exfatfs:1.1.1.13.0.8 perseant-exfatfs-base:1.1.1.13 netbsd-8-3-RELEASE:1.1.1.10 netbsd-9-4-RELEASE:1.1.1.12 netbsd-10-0-RELEASE:1.1.1.13 netbsd-10-0-RC6:1.1.1.13 netbsd-10-0-RC5:1.1.1.13 netbsd-10-0-RC4:1.1.1.13 netbsd-10-0-RC3:1.1.1.13 netbsd-10-0-RC2:1.1.1.13 netbsd-10-0-RC1:1.1.1.13 netbsd-10:1.1.1.13.0.6 netbsd-10-base:1.1.1.13 netbsd-9-3-RELEASE:1.1.1.12 cjep_sun2x:1.1.1.13.0.4 cjep_sun2x-base:1.1.1.13 cjep_staticlib_x-base1:1.1.1.13 netbsd-9-2-RELEASE:1.1.1.12 cjep_staticlib_x:1.1.1.13.0.2 cjep_staticlib_x-base:1.1.1.13 netbsd-9-1-RELEASE:1.1.1.12 phil-wifi-20200421:1.1.1.13 phil-wifi-20200411:1.1.1.13 phil-wifi-20200406:1.1.1.13 netbsd-8-2-RELEASE:1.1.1.10 netbsd-9-0-RELEASE:1.1.1.12 netbsd-9-0-RC2:1.1.1.12 netbsd-9-0-RC1:1.1.1.12 netbsd-9:1.1.1.12.0.2 netbsd-9-base:1.1.1.12 phil-wifi-20190609:1.1.1.12 netbsd-8-1-RELEASE:1.1.1.10 netbsd-8-1-RC1:1.1.1.10 pgoyette-compat-merge-20190127:1.1.1.11.2.1 pgoyette-compat-20190127:1.1.1.12 pgoyette-compat-20190118:1.1.1.12 pgoyette-compat-1226:1.1.1.12 pgoyette-compat-1126:1.1.1.12 pgoyette-compat-1020:1.1.1.12 pgoyette-compat-0930:1.1.1.12 pgoyette-compat-0906:1.1.1.12 netbsd-7-2-RELEASE:1.1.1.7.2.1 pgoyette-compat-0728:1.1.1.12 clang-337282:1.1.1.12 netbsd-8-0-RELEASE:1.1.1.10 phil-wifi:1.1.1.11.0.4 phil-wifi-base:1.1.1.11 pgoyette-compat-0625:1.1.1.11 netbsd-8-0-RC2:1.1.1.10 pgoyette-compat-0521:1.1.1.11 pgoyette-compat-0502:1.1.1.11 pgoyette-compat-0422:1.1.1.11 netbsd-8-0-RC1:1.1.1.10 pgoyette-compat-0415:1.1.1.11 pgoyette-compat-0407:1.1.1.11 pgoyette-compat-0330:1.1.1.11 pgoyette-compat-0322:1.1.1.11 pgoyette-compat-0315:1.1.1.11 netbsd-7-1-2-RELEASE:1.1.1.7.2.1 pgoyette-compat:1.1.1.11.0.2 pgoyette-compat-base:1.1.1.11 netbsd-7-1-1-RELEASE:1.1.1.7.2.1 clang-319952:1.1.1.11 matt-nb8-mediatek:1.1.1.10.0.10 matt-nb8-mediatek-base:1.1.1.10 clang-309604:1.1.1.11 perseant-stdc-iso10646:1.1.1.10.0.8 perseant-stdc-iso10646-base:1.1.1.10 netbsd-8:1.1.1.10.0.6 netbsd-8-base:1.1.1.10 prg-localcount2-base3:1.1.1.10 prg-localcount2-base2:1.1.1.10 prg-localcount2-base1:1.1.1.10 prg-localcount2:1.1.1.10.0.4 prg-localcount2-base:1.1.1.10 pgoyette-localcount-20170426:1.1.1.10 bouyer-socketcan-base1:1.1.1.10 pgoyette-localcount-20170320:1.1.1.10 netbsd-7-1:1.1.1.7.2.1.0.6 netbsd-7-1-RELEASE:1.1.1.7.2.1 netbsd-7-1-RC2:1.1.1.7.2.1 clang-294123:1.1.1.10 netbsd-7-nhusb-base-20170116:1.1.1.7.2.1 bouyer-socketcan:1.1.1.10.0.2 bouyer-socketcan-base:1.1.1.10 clang-291444:1.1.1.10 pgoyette-localcount-20170107:1.1.1.9 netbsd-7-1-RC1:1.1.1.7.2.1 pgoyette-localcount-20161104:1.1.1.9 netbsd-7-0-2-RELEASE:1.1.1.7.2.1 localcount-20160914:1.1.1.9 netbsd-7-nhusb:1.1.1.7.2.1.0.4 netbsd-7-nhusb-base:1.1.1.7.2.1 clang-280599:1.1.1.9 pgoyette-localcount-20160806:1.1.1.9 pgoyette-localcount-20160726:1.1.1.9 pgoyette-localcount:1.1.1.9.0.2 pgoyette-localcount-base:1.1.1.9 netbsd-7-0-1-RELEASE:1.1.1.7.2.1 clang-261930:1.1.1.9 netbsd-7-0:1.1.1.7.2.1.0.2 netbsd-7-0-RELEASE:1.1.1.7.2.1 netbsd-7-0-RC3:1.1.1.7.2.1 netbsd-7-0-RC2:1.1.1.7.2.1 netbsd-7-0-RC1:1.1.1.7.2.1 clang-237755:1.1.1.8 clang-232565:1.1.1.8 clang-227398:1.1.1.8 tls-maxphys-base:1.1.1.7 tls-maxphys:1.1.1.7.0.4 netbsd-7:1.1.1.7.0.2 netbsd-7-base:1.1.1.7 clang-215315:1.1.1.7 clang-209886:1.1.1.6 yamt-pagecache:1.1.1.5.0.4 yamt-pagecache-base9:1.1.1.5 tls-earlyentropy:1.1.1.5.0.2 tls-earlyentropy-base:1.1.1.6 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.5 riastradh-drm2-base3:1.1.1.5 clang-202566:1.1.1.5 clang-201163:1.1.1.4 clang-199312:1.1.1.3 clang-198450:1.1.1.2 clang-196603:1.1.1.1 clang-195771:1.1.1.1 LLVM:1.1.1; locks; strict; comment @// @; 1.1 date 2013.11.28.14.14.53; author joerg; state Exp; branches 1.1.1.1; next ; commitid ow8OybrawrB1f3fx; 1.1.1.1 date 2013.11.28.14.14.53; author joerg; state Exp; branches; next 1.1.1.2; commitid ow8OybrawrB1f3fx; 1.1.1.2 date 2014.01.05.15.38.05; author joerg; state Exp; branches; next 1.1.1.3; commitid wh3aCSIWykURqWjx; 1.1.1.3 date 2014.01.15.21.26.25; author joerg; state Exp; branches; next 1.1.1.4; commitid NQXlzzA0SPkc5glx; 1.1.1.4 date 2014.02.14.20.07.09; author joerg; state Exp; branches; next 1.1.1.5; commitid annVkZ1sc17rF6px; 1.1.1.5 date 2014.03.04.19.53.47; author joerg; state Exp; branches 1.1.1.5.2.1 1.1.1.5.4.1; next 1.1.1.6; commitid 29z1hJonZISIXprx; 1.1.1.6 date 2014.05.30.18.14.40; author joerg; state Exp; branches; next 1.1.1.7; commitid 8q0kdlBlCn09GACx; 1.1.1.7 date 2014.08.10.17.08.35; author joerg; state Exp; branches 1.1.1.7.2.1 1.1.1.7.4.1; next 1.1.1.8; commitid N85tXAN6Ex9VZPLx; 1.1.1.8 date 2015.01.29.19.57.31; author joerg; state Exp; branches; next 1.1.1.9; commitid mlISSizlPKvepX7y; 1.1.1.9 date 2016.02.27.22.12.09; author joerg; state Exp; branches 1.1.1.9.2.1; next 1.1.1.10; commitid tIimz3oDlh1NpBWy; 1.1.1.10 date 2017.01.11.10.33.21; author joerg; state Exp; branches; next 1.1.1.11; commitid CNnUNfII1jgNmxBz; 1.1.1.11 date 2017.08.01.19.35.19; author joerg; state Exp; branches 1.1.1.11.2.1 1.1.1.11.4.1; next 1.1.1.12; commitid pMuDy65V0VicSx1A; 1.1.1.12 date 2018.07.17.18.31.01; author joerg; state Exp; branches; next 1.1.1.13; commitid wDzL46ALjrCZgwKA; 1.1.1.13 date 2019.11.13.22.19.21; author joerg; state dead; branches; next ; commitid QD8YATxuNG34YJKB; 1.1.1.5.2.1 date 2014.08.10.07.08.07; author tls; state Exp; branches; next ; commitid t01A1TLTYxkpGMLx; 1.1.1.5.4.1 date 2014.03.04.19.53.47; author yamt; state dead; branches; next 1.1.1.5.4.2; commitid WSrDtL5nYAUyiyBx; 1.1.1.5.4.2 date 2014.05.22.16.18.26; author yamt; state Exp; branches; next ; commitid WSrDtL5nYAUyiyBx; 1.1.1.7.2.1 date 2015.06.04.20.04.27; author snj; state Exp; branches; next ; commitid yRnjq9fueSo6n9oy; 1.1.1.7.4.1 date 2014.08.10.17.08.35; author tls; state dead; branches; next 1.1.1.7.4.2; commitid jTnpym9Qu0o4R1Nx; 1.1.1.7.4.2 date 2014.08.19.23.47.27; author tls; state Exp; branches; next ; commitid jTnpym9Qu0o4R1Nx; 1.1.1.9.2.1 date 2017.03.20.06.52.37; author pgoyette; state Exp; branches; next ; commitid jjw7cAwgyKq7RfKz; 1.1.1.11.2.1 date 2018.07.28.04.33.17; author pgoyette; state Exp; branches; next ; commitid 1UP1xAIUxv1ZgRLA; 1.1.1.11.4.1 date 2019.06.10.21.45.21; author christos; state Exp; branches; next 1.1.1.11.4.2; commitid jtc8rnCzWiEEHGqB; 1.1.1.11.4.2 date 2020.04.13.07.46.32; author martin; state dead; branches; next ; commitid X01YhRUPVUDaec4C; desc @@ 1.1 log @Initial revision @ text @//===--- CGExprCXX.cpp - Emit LLVM Code for C++ expressions ---------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This contains code dealing with code generation of C++ expressions // //===----------------------------------------------------------------------===// #include "CodeGenFunction.h" #include "CGCUDARuntime.h" #include "CGCXXABI.h" #include "CGDebugInfo.h" #include "CGObjCRuntime.h" #include "clang/CodeGen/CGFunctionInfo.h" #include "clang/Frontend/CodeGenOptions.h" #include "llvm/IR/Intrinsics.h" #include "llvm/Support/CallSite.h" using namespace clang; using namespace CodeGen; RValue CodeGenFunction::EmitCXXMemberCall(const CXXMethodDecl *MD, SourceLocation CallLoc, llvm::Value *Callee, ReturnValueSlot ReturnValue, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, CallExpr::const_arg_iterator ArgBeg, CallExpr::const_arg_iterator ArgEnd) { assert(MD->isInstance() && "Trying to emit a member call expr on a static method!"); // C++11 [class.mfct.non-static]p2: // If a non-static member function of a class X is called for an object that // is not of type X, or of a type derived from X, the behavior is undefined. EmitTypeCheck(isa(MD) ? TCK_ConstructorCall : TCK_MemberCall, CallLoc, This, getContext().getRecordType(MD->getParent())); CallArgList Args; // Push the this ptr. Args.add(RValue::get(This), MD->getThisType(getContext())); // If there is an implicit parameter (e.g. VTT), emit it. if (ImplicitParam) { Args.add(RValue::get(ImplicitParam), ImplicitParamTy); } const FunctionProtoType *FPT = MD->getType()->castAs(); RequiredArgs required = RequiredArgs::forPrototypePlus(FPT, Args.size()); // And the rest of the call args. EmitCallArgs(Args, FPT, ArgBeg, ArgEnd); return EmitCall(CGM.getTypes().arrangeCXXMethodCall(Args, FPT, required), Callee, ReturnValue, Args, MD); } static CXXRecordDecl *getCXXRecord(const Expr *E) { QualType T = E->getType(); if (const PointerType *PTy = T->getAs()) T = PTy->getPointeeType(); const RecordType *Ty = T->castAs(); return cast(Ty->getDecl()); } // Note: This function also emit constructor calls to support a MSVC // extensions allowing explicit constructor function call. RValue CodeGenFunction::EmitCXXMemberCallExpr(const CXXMemberCallExpr *CE, ReturnValueSlot ReturnValue) { const Expr *callee = CE->getCallee()->IgnoreParens(); if (isa(callee)) return EmitCXXMemberPointerCallExpr(CE, ReturnValue); const MemberExpr *ME = cast(callee); const CXXMethodDecl *MD = cast(ME->getMemberDecl()); if (MD->isStatic()) { // The method is static, emit it as we would a regular call. llvm::Value *Callee = CGM.GetAddrOfFunction(MD); return EmitCall(getContext().getPointerType(MD->getType()), Callee, CE->getLocStart(), ReturnValue, CE->arg_begin(), CE->arg_end()); } // Compute the object pointer. const Expr *Base = ME->getBase(); bool CanUseVirtualCall = MD->isVirtual() && !ME->hasQualifier(); const CXXMethodDecl *DevirtualizedMethod = NULL; if (CanUseVirtualCall && CanDevirtualizeMemberFunctionCall(Base, MD)) { const CXXRecordDecl *BestDynamicDecl = Base->getBestDynamicClassType(); DevirtualizedMethod = MD->getCorrespondingMethodInClass(BestDynamicDecl); assert(DevirtualizedMethod); const CXXRecordDecl *DevirtualizedClass = DevirtualizedMethod->getParent(); const Expr *Inner = Base->ignoreParenBaseCasts(); if (getCXXRecord(Inner) == DevirtualizedClass) // If the class of the Inner expression is where the dynamic method // is defined, build the this pointer from it. Base = Inner; else if (getCXXRecord(Base) != DevirtualizedClass) { // If the method is defined in a class that is not the best dynamic // one or the one of the full expression, we would have to build // a derived-to-base cast to compute the correct this pointer, but // we don't have support for that yet, so do a virtual call. DevirtualizedMethod = NULL; } // If the return types are not the same, this might be a case where more // code needs to run to compensate for it. For example, the derived // method might return a type that inherits form from the return // type of MD and has a prefix. // For now we just avoid devirtualizing these covariant cases. if (DevirtualizedMethod && DevirtualizedMethod->getResultType().getCanonicalType() != MD->getResultType().getCanonicalType()) DevirtualizedMethod = NULL; } llvm::Value *This; if (ME->isArrow()) This = EmitScalarExpr(Base); else This = EmitLValue(Base).getAddress(); if (MD->isTrivial()) { if (isa(MD)) return RValue::get(0); if (isa(MD) && cast(MD)->isDefaultConstructor()) return RValue::get(0); if (MD->isCopyAssignmentOperator() || MD->isMoveAssignmentOperator()) { // We don't like to generate the trivial copy/move assignment operator // when it isn't necessary; just produce the proper effect here. llvm::Value *RHS = EmitLValue(*CE->arg_begin()).getAddress(); EmitAggregateAssign(This, RHS, CE->getType()); return RValue::get(This); } if (isa(MD) && cast(MD)->isCopyOrMoveConstructor()) { // Trivial move and copy ctor are the same. llvm::Value *RHS = EmitLValue(*CE->arg_begin()).getAddress(); EmitSynthesizedCXXCopyCtorCall(cast(MD), This, RHS, CE->arg_begin(), CE->arg_end()); return RValue::get(This); } llvm_unreachable("unknown trivial member function"); } // Compute the function type we're calling. const CXXMethodDecl *CalleeDecl = DevirtualizedMethod ? DevirtualizedMethod : MD; const CGFunctionInfo *FInfo = 0; if (const CXXDestructorDecl *Dtor = dyn_cast(CalleeDecl)) FInfo = &CGM.getTypes().arrangeCXXDestructor(Dtor, Dtor_Complete); else if (const CXXConstructorDecl *Ctor = dyn_cast(CalleeDecl)) FInfo = &CGM.getTypes().arrangeCXXConstructorDeclaration(Ctor, Ctor_Complete); else FInfo = &CGM.getTypes().arrangeCXXMethodDeclaration(CalleeDecl); llvm::FunctionType *Ty = CGM.getTypes().GetFunctionType(*FInfo); // C++ [class.virtual]p12: // Explicit qualification with the scope operator (5.1) suppresses the // virtual call mechanism. // // We also don't emit a virtual call if the base expression has a record type // because then we know what the type is. bool UseVirtualCall = CanUseVirtualCall && !DevirtualizedMethod; llvm::Value *Callee; if (const CXXDestructorDecl *Dtor = dyn_cast(MD)) { assert(CE->arg_begin() == CE->arg_end() && "Destructor shouldn't have explicit parameters"); assert(ReturnValue.isNull() && "Destructor shouldn't have return value"); if (UseVirtualCall) { CGM.getCXXABI().EmitVirtualDestructorCall(*this, Dtor, Dtor_Complete, CE->getExprLoc(), This); } else { if (getLangOpts().AppleKext && MD->isVirtual() && ME->hasQualifier()) Callee = BuildAppleKextVirtualCall(MD, ME->getQualifier(), Ty); else if (!DevirtualizedMethod) Callee = CGM.GetAddrOfCXXDestructor(Dtor, Dtor_Complete, FInfo, Ty); else { const CXXDestructorDecl *DDtor = cast(DevirtualizedMethod); Callee = CGM.GetAddrOfFunction(GlobalDecl(DDtor, Dtor_Complete), Ty); } EmitCXXMemberCall(MD, CE->getExprLoc(), Callee, ReturnValue, This, /*ImplicitParam=*/0, QualType(), 0, 0); } return RValue::get(0); } if (const CXXConstructorDecl *Ctor = dyn_cast(MD)) { Callee = CGM.GetAddrOfFunction(GlobalDecl(Ctor, Ctor_Complete), Ty); } else if (UseVirtualCall) { Callee = CGM.getCXXABI().getVirtualFunctionPointer(*this, MD, This, Ty); } else { if (getLangOpts().AppleKext && MD->isVirtual() && ME->hasQualifier()) Callee = BuildAppleKextVirtualCall(MD, ME->getQualifier(), Ty); else if (!DevirtualizedMethod) Callee = CGM.GetAddrOfFunction(MD, Ty); else { Callee = CGM.GetAddrOfFunction(DevirtualizedMethod, Ty); } } if (MD->isVirtual()) This = CGM.getCXXABI().adjustThisArgumentForVirtualCall(*this, MD, This); return EmitCXXMemberCall(MD, CE->getExprLoc(), Callee, ReturnValue, This, /*ImplicitParam=*/0, QualType(), CE->arg_begin(), CE->arg_end()); } RValue CodeGenFunction::EmitCXXMemberPointerCallExpr(const CXXMemberCallExpr *E, ReturnValueSlot ReturnValue) { const BinaryOperator *BO = cast(E->getCallee()->IgnoreParens()); const Expr *BaseExpr = BO->getLHS(); const Expr *MemFnExpr = BO->getRHS(); const MemberPointerType *MPT = MemFnExpr->getType()->castAs(); const FunctionProtoType *FPT = MPT->getPointeeType()->castAs(); const CXXRecordDecl *RD = cast(MPT->getClass()->getAs()->getDecl()); // Get the member function pointer. llvm::Value *MemFnPtr = EmitScalarExpr(MemFnExpr); // Emit the 'this' pointer. llvm::Value *This; if (BO->getOpcode() == BO_PtrMemI) This = EmitScalarExpr(BaseExpr); else This = EmitLValue(BaseExpr).getAddress(); EmitTypeCheck(TCK_MemberCall, E->getExprLoc(), This, QualType(MPT->getClass(), 0)); // Ask the ABI to load the callee. Note that This is modified. llvm::Value *Callee = CGM.getCXXABI().EmitLoadOfMemberFunctionPointer(*this, This, MemFnPtr, MPT); CallArgList Args; QualType ThisType = getContext().getPointerType(getContext().getTagDeclType(RD)); // Push the this ptr. Args.add(RValue::get(This), ThisType); RequiredArgs required = RequiredArgs::forPrototypePlus(FPT, 1); // And the rest of the call args EmitCallArgs(Args, FPT, E->arg_begin(), E->arg_end()); return EmitCall(CGM.getTypes().arrangeCXXMethodCall(Args, FPT, required), Callee, ReturnValue, Args); } RValue CodeGenFunction::EmitCXXOperatorMemberCallExpr(const CXXOperatorCallExpr *E, const CXXMethodDecl *MD, ReturnValueSlot ReturnValue) { assert(MD->isInstance() && "Trying to emit a member call expr on a static method!"); LValue LV = EmitLValue(E->getArg(0)); llvm::Value *This = LV.getAddress(); if ((MD->isCopyAssignmentOperator() || MD->isMoveAssignmentOperator()) && MD->isTrivial()) { llvm::Value *Src = EmitLValue(E->getArg(1)).getAddress(); QualType Ty = E->getType(); EmitAggregateAssign(This, Src, Ty); return RValue::get(This); } llvm::Value *Callee = EmitCXXOperatorMemberCallee(E, MD, This); return EmitCXXMemberCall(MD, E->getExprLoc(), Callee, ReturnValue, This, /*ImplicitParam=*/0, QualType(), E->arg_begin() + 1, E->arg_end()); } RValue CodeGenFunction::EmitCUDAKernelCallExpr(const CUDAKernelCallExpr *E, ReturnValueSlot ReturnValue) { return CGM.getCUDARuntime().EmitCUDAKernelCallExpr(*this, E, ReturnValue); } static void EmitNullBaseClassInitialization(CodeGenFunction &CGF, llvm::Value *DestPtr, const CXXRecordDecl *Base) { if (Base->isEmpty()) return; DestPtr = CGF.EmitCastToVoidPtr(DestPtr); const ASTRecordLayout &Layout = CGF.getContext().getASTRecordLayout(Base); CharUnits Size = Layout.getNonVirtualSize(); CharUnits Align = Layout.getNonVirtualAlign(); llvm::Value *SizeVal = CGF.CGM.getSize(Size); // If the type contains a pointer to data member we can't memset it to zero. // Instead, create a null constant and copy it to the destination. // TODO: there are other patterns besides zero that we can usefully memset, // like -1, which happens to be the pattern used by member-pointers. // TODO: isZeroInitializable can be over-conservative in the case where a // virtual base contains a member pointer. if (!CGF.CGM.getTypes().isZeroInitializable(Base)) { llvm::Constant *NullConstant = CGF.CGM.EmitNullConstantForBase(Base); llvm::GlobalVariable *NullVariable = new llvm::GlobalVariable(CGF.CGM.getModule(), NullConstant->getType(), /*isConstant=*/true, llvm::GlobalVariable::PrivateLinkage, NullConstant, Twine()); NullVariable->setAlignment(Align.getQuantity()); llvm::Value *SrcPtr = CGF.EmitCastToVoidPtr(NullVariable); // Get and call the appropriate llvm.memcpy overload. CGF.Builder.CreateMemCpy(DestPtr, SrcPtr, SizeVal, Align.getQuantity()); return; } // Otherwise, just memset the whole thing to zero. This is legal // because in LLVM, all default initializers (other than the ones we just // handled above) are guaranteed to have a bit pattern of all zeros. CGF.Builder.CreateMemSet(DestPtr, CGF.Builder.getInt8(0), SizeVal, Align.getQuantity()); } void CodeGenFunction::EmitCXXConstructExpr(const CXXConstructExpr *E, AggValueSlot Dest) { assert(!Dest.isIgnored() && "Must have a destination!"); const CXXConstructorDecl *CD = E->getConstructor(); // If we require zero initialization before (or instead of) calling the // constructor, as can be the case with a non-user-provided default // constructor, emit the zero initialization now, unless destination is // already zeroed. if (E->requiresZeroInitialization() && !Dest.isZeroed()) { switch (E->getConstructionKind()) { case CXXConstructExpr::CK_Delegating: case CXXConstructExpr::CK_Complete: EmitNullInitialization(Dest.getAddr(), E->getType()); break; case CXXConstructExpr::CK_VirtualBase: case CXXConstructExpr::CK_NonVirtualBase: EmitNullBaseClassInitialization(*this, Dest.getAddr(), CD->getParent()); break; } } // If this is a call to a trivial default constructor, do nothing. if (CD->isTrivial() && CD->isDefaultConstructor()) return; // Elide the constructor if we're constructing from a temporary. // The temporary check is required because Sema sets this on NRVO // returns. if (getLangOpts().ElideConstructors && E->isElidable()) { assert(getContext().hasSameUnqualifiedType(E->getType(), E->getArg(0)->getType())); if (E->getArg(0)->isTemporaryObject(getContext(), CD->getParent())) { EmitAggExpr(E->getArg(0), Dest); return; } } if (const ConstantArrayType *arrayType = getContext().getAsConstantArrayType(E->getType())) { EmitCXXAggrConstructorCall(CD, arrayType, Dest.getAddr(), E->arg_begin(), E->arg_end()); } else { CXXCtorType Type = Ctor_Complete; bool ForVirtualBase = false; bool Delegating = false; switch (E->getConstructionKind()) { case CXXConstructExpr::CK_Delegating: // We should be emitting a constructor; GlobalDecl will assert this Type = CurGD.getCtorType(); Delegating = true; break; case CXXConstructExpr::CK_Complete: Type = Ctor_Complete; break; case CXXConstructExpr::CK_VirtualBase: ForVirtualBase = true; // fall-through case CXXConstructExpr::CK_NonVirtualBase: Type = Ctor_Base; } // Call the constructor. EmitCXXConstructorCall(CD, Type, ForVirtualBase, Delegating, Dest.getAddr(), E->arg_begin(), E->arg_end()); } } void CodeGenFunction::EmitSynthesizedCXXCopyCtor(llvm::Value *Dest, llvm::Value *Src, const Expr *Exp) { if (const ExprWithCleanups *E = dyn_cast(Exp)) Exp = E->getSubExpr(); assert(isa(Exp) && "EmitSynthesizedCXXCopyCtor - unknown copy ctor expr"); const CXXConstructExpr* E = cast(Exp); const CXXConstructorDecl *CD = E->getConstructor(); RunCleanupsScope Scope(*this); // If we require zero initialization before (or instead of) calling the // constructor, as can be the case with a non-user-provided default // constructor, emit the zero initialization now. // FIXME. Do I still need this for a copy ctor synthesis? if (E->requiresZeroInitialization()) EmitNullInitialization(Dest, E->getType()); assert(!getContext().getAsConstantArrayType(E->getType()) && "EmitSynthesizedCXXCopyCtor - Copied-in Array"); EmitSynthesizedCXXCopyCtorCall(CD, Dest, Src, E->arg_begin(), E->arg_end()); } static CharUnits CalculateCookiePadding(CodeGenFunction &CGF, const CXXNewExpr *E) { if (!E->isArray()) return CharUnits::Zero(); // No cookie is required if the operator new[] being used is the // reserved placement operator new[]. if (E->getOperatorNew()->isReservedGlobalPlacementOperator()) return CharUnits::Zero(); return CGF.CGM.getCXXABI().GetArrayCookieSize(E); } static llvm::Value *EmitCXXNewAllocSize(CodeGenFunction &CGF, const CXXNewExpr *e, unsigned minElements, llvm::Value *&numElements, llvm::Value *&sizeWithoutCookie) { QualType type = e->getAllocatedType(); if (!e->isArray()) { CharUnits typeSize = CGF.getContext().getTypeSizeInChars(type); sizeWithoutCookie = llvm::ConstantInt::get(CGF.SizeTy, typeSize.getQuantity()); return sizeWithoutCookie; } // The width of size_t. unsigned sizeWidth = CGF.SizeTy->getBitWidth(); // Figure out the cookie size. llvm::APInt cookieSize(sizeWidth, CalculateCookiePadding(CGF, e).getQuantity()); // Emit the array size expression. // We multiply the size of all dimensions for NumElements. // e.g for 'int[2][3]', ElemType is 'int' and NumElements is 6. numElements = CGF.EmitScalarExpr(e->getArraySize()); assert(isa(numElements->getType())); // The number of elements can be have an arbitrary integer type; // essentially, we need to multiply it by a constant factor, add a // cookie size, and verify that the result is representable as a // size_t. That's just a gloss, though, and it's wrong in one // important way: if the count is negative, it's an error even if // the cookie size would bring the total size >= 0. bool isSigned = e->getArraySize()->getType()->isSignedIntegerOrEnumerationType(); llvm::IntegerType *numElementsType = cast(numElements->getType()); unsigned numElementsWidth = numElementsType->getBitWidth(); // Compute the constant factor. llvm::APInt arraySizeMultiplier(sizeWidth, 1); while (const ConstantArrayType *CAT = CGF.getContext().getAsConstantArrayType(type)) { type = CAT->getElementType(); arraySizeMultiplier *= CAT->getSize(); } CharUnits typeSize = CGF.getContext().getTypeSizeInChars(type); llvm::APInt typeSizeMultiplier(sizeWidth, typeSize.getQuantity()); typeSizeMultiplier *= arraySizeMultiplier; // This will be a size_t. llvm::Value *size; // If someone is doing 'new int[42]' there is no need to do a dynamic check. // Don't bloat the -O0 code. if (llvm::ConstantInt *numElementsC = dyn_cast(numElements)) { const llvm::APInt &count = numElementsC->getValue(); bool hasAnyOverflow = false; // If 'count' was a negative number, it's an overflow. if (isSigned && count.isNegative()) hasAnyOverflow = true; // We want to do all this arithmetic in size_t. If numElements is // wider than that, check whether it's already too big, and if so, // overflow. else if (numElementsWidth > sizeWidth && numElementsWidth - sizeWidth > count.countLeadingZeros()) hasAnyOverflow = true; // Okay, compute a count at the right width. llvm::APInt adjustedCount = count.zextOrTrunc(sizeWidth); // If there is a brace-initializer, we cannot allocate fewer elements than // there are initializers. If we do, that's treated like an overflow. if (adjustedCount.ult(minElements)) hasAnyOverflow = true; // Scale numElements by that. This might overflow, but we don't // care because it only overflows if allocationSize does, too, and // if that overflows then we shouldn't use this. numElements = llvm::ConstantInt::get(CGF.SizeTy, adjustedCount * arraySizeMultiplier); // Compute the size before cookie, and track whether it overflowed. bool overflow; llvm::APInt allocationSize = adjustedCount.umul_ov(typeSizeMultiplier, overflow); hasAnyOverflow |= overflow; // Add in the cookie, and check whether it's overflowed. if (cookieSize != 0) { // Save the current size without a cookie. This shouldn't be // used if there was overflow. sizeWithoutCookie = llvm::ConstantInt::get(CGF.SizeTy, allocationSize); allocationSize = allocationSize.uadd_ov(cookieSize, overflow); hasAnyOverflow |= overflow; } // On overflow, produce a -1 so operator new will fail. if (hasAnyOverflow) { size = llvm::Constant::getAllOnesValue(CGF.SizeTy); } else { size = llvm::ConstantInt::get(CGF.SizeTy, allocationSize); } // Otherwise, we might need to use the overflow intrinsics. } else { // There are up to five conditions we need to test for: // 1) if isSigned, we need to check whether numElements is negative; // 2) if numElementsWidth > sizeWidth, we need to check whether // numElements is larger than something representable in size_t; // 3) if minElements > 0, we need to check whether numElements is smaller // than that. // 4) we need to compute // sizeWithoutCookie := numElements * typeSizeMultiplier // and check whether it overflows; and // 5) if we need a cookie, we need to compute // size := sizeWithoutCookie + cookieSize // and check whether it overflows. llvm::Value *hasOverflow = 0; // If numElementsWidth > sizeWidth, then one way or another, we're // going to have to do a comparison for (2), and this happens to // take care of (1), too. if (numElementsWidth > sizeWidth) { llvm::APInt threshold(numElementsWidth, 1); threshold <<= sizeWidth; llvm::Value *thresholdV = llvm::ConstantInt::get(numElementsType, threshold); hasOverflow = CGF.Builder.CreateICmpUGE(numElements, thresholdV); numElements = CGF.Builder.CreateTrunc(numElements, CGF.SizeTy); // Otherwise, if we're signed, we want to sext up to size_t. } else if (isSigned) { if (numElementsWidth < sizeWidth) numElements = CGF.Builder.CreateSExt(numElements, CGF.SizeTy); // If there's a non-1 type size multiplier, then we can do the // signedness check at the same time as we do the multiply // because a negative number times anything will cause an // unsigned overflow. Otherwise, we have to do it here. But at least // in this case, we can subsume the >= minElements check. if (typeSizeMultiplier == 1) hasOverflow = CGF.Builder.CreateICmpSLT(numElements, llvm::ConstantInt::get(CGF.SizeTy, minElements)); // Otherwise, zext up to size_t if necessary. } else if (numElementsWidth < sizeWidth) { numElements = CGF.Builder.CreateZExt(numElements, CGF.SizeTy); } assert(numElements->getType() == CGF.SizeTy); if (minElements) { // Don't allow allocation of fewer elements than we have initializers. if (!hasOverflow) { hasOverflow = CGF.Builder.CreateICmpULT(numElements, llvm::ConstantInt::get(CGF.SizeTy, minElements)); } else if (numElementsWidth > sizeWidth) { // The other existing overflow subsumes this check. // We do an unsigned comparison, since any signed value < -1 is // taken care of either above or below. hasOverflow = CGF.Builder.CreateOr(hasOverflow, CGF.Builder.CreateICmpULT(numElements, llvm::ConstantInt::get(CGF.SizeTy, minElements))); } } size = numElements; // Multiply by the type size if necessary. This multiplier // includes all the factors for nested arrays. // // This step also causes numElements to be scaled up by the // nested-array factor if necessary. Overflow on this computation // can be ignored because the result shouldn't be used if // allocation fails. if (typeSizeMultiplier != 1) { llvm::Value *umul_with_overflow = CGF.CGM.getIntrinsic(llvm::Intrinsic::umul_with_overflow, CGF.SizeTy); llvm::Value *tsmV = llvm::ConstantInt::get(CGF.SizeTy, typeSizeMultiplier); llvm::Value *result = CGF.Builder.CreateCall2(umul_with_overflow, size, tsmV); llvm::Value *overflowed = CGF.Builder.CreateExtractValue(result, 1); if (hasOverflow) hasOverflow = CGF.Builder.CreateOr(hasOverflow, overflowed); else hasOverflow = overflowed; size = CGF.Builder.CreateExtractValue(result, 0); // Also scale up numElements by the array size multiplier. if (arraySizeMultiplier != 1) { // If the base element type size is 1, then we can re-use the // multiply we just did. if (typeSize.isOne()) { assert(arraySizeMultiplier == typeSizeMultiplier); numElements = size; // Otherwise we need a separate multiply. } else { llvm::Value *asmV = llvm::ConstantInt::get(CGF.SizeTy, arraySizeMultiplier); numElements = CGF.Builder.CreateMul(numElements, asmV); } } } else { // numElements doesn't need to be scaled. assert(arraySizeMultiplier == 1); } // Add in the cookie size if necessary. if (cookieSize != 0) { sizeWithoutCookie = size; llvm::Value *uadd_with_overflow = CGF.CGM.getIntrinsic(llvm::Intrinsic::uadd_with_overflow, CGF.SizeTy); llvm::Value *cookieSizeV = llvm::ConstantInt::get(CGF.SizeTy, cookieSize); llvm::Value *result = CGF.Builder.CreateCall2(uadd_with_overflow, size, cookieSizeV); llvm::Value *overflowed = CGF.Builder.CreateExtractValue(result, 1); if (hasOverflow) hasOverflow = CGF.Builder.CreateOr(hasOverflow, overflowed); else hasOverflow = overflowed; size = CGF.Builder.CreateExtractValue(result, 0); } // If we had any possibility of dynamic overflow, make a select to // overwrite 'size' with an all-ones value, which should cause // operator new to throw. if (hasOverflow) size = CGF.Builder.CreateSelect(hasOverflow, llvm::Constant::getAllOnesValue(CGF.SizeTy), size); } if (cookieSize == 0) sizeWithoutCookie = size; else assert(sizeWithoutCookie && "didn't set sizeWithoutCookie?"); return size; } static void StoreAnyExprIntoOneUnit(CodeGenFunction &CGF, const Expr *Init, QualType AllocType, llvm::Value *NewPtr) { CharUnits Alignment = CGF.getContext().getTypeAlignInChars(AllocType); switch (CGF.getEvaluationKind(AllocType)) { case TEK_Scalar: CGF.EmitScalarInit(Init, 0, CGF.MakeAddrLValue(NewPtr, AllocType, Alignment), false); return; case TEK_Complex: CGF.EmitComplexExprIntoLValue(Init, CGF.MakeAddrLValue(NewPtr, AllocType, Alignment), /*isInit*/ true); return; case TEK_Aggregate: { AggValueSlot Slot = AggValueSlot::forAddr(NewPtr, Alignment, AllocType.getQualifiers(), AggValueSlot::IsDestructed, AggValueSlot::DoesNotNeedGCBarriers, AggValueSlot::IsNotAliased); CGF.EmitAggExpr(Init, Slot); return; } } llvm_unreachable("bad evaluation kind"); } void CodeGenFunction::EmitNewArrayInitializer(const CXXNewExpr *E, QualType elementType, llvm::Value *beginPtr, llvm::Value *numElements) { if (!E->hasInitializer()) return; // We have a POD type. llvm::Value *explicitPtr = beginPtr; // Find the end of the array, hoisted out of the loop. llvm::Value *endPtr = Builder.CreateInBoundsGEP(beginPtr, numElements, "array.end"); unsigned initializerElements = 0; const Expr *Init = E->getInitializer(); llvm::AllocaInst *endOfInit = 0; QualType::DestructionKind dtorKind = elementType.isDestructedType(); EHScopeStack::stable_iterator cleanup; llvm::Instruction *cleanupDominator = 0; // If the initializer is an initializer list, first do the explicit elements. if (const InitListExpr *ILE = dyn_cast(Init)) { initializerElements = ILE->getNumInits(); // Enter a partial-destruction cleanup if necessary. if (needsEHCleanup(dtorKind)) { // In principle we could tell the cleanup where we are more // directly, but the control flow can get so varied here that it // would actually be quite complex. Therefore we go through an // alloca. endOfInit = CreateTempAlloca(beginPtr->getType(), "array.endOfInit"); cleanupDominator = Builder.CreateStore(beginPtr, endOfInit); pushIrregularPartialArrayCleanup(beginPtr, endOfInit, elementType, getDestroyer(dtorKind)); cleanup = EHStack.stable_begin(); } for (unsigned i = 0, e = ILE->getNumInits(); i != e; ++i) { // Tell the cleanup that it needs to destroy up to this // element. TODO: some of these stores can be trivially // observed to be unnecessary. if (endOfInit) Builder.CreateStore(explicitPtr, endOfInit); StoreAnyExprIntoOneUnit(*this, ILE->getInit(i), elementType, explicitPtr); explicitPtr =Builder.CreateConstGEP1_32(explicitPtr, 1, "array.exp.next"); } // The remaining elements are filled with the array filler expression. Init = ILE->getArrayFiller(); } // Create the continuation block. llvm::BasicBlock *contBB = createBasicBlock("new.loop.end"); // If the number of elements isn't constant, we have to now check if there is // anything left to initialize. if (llvm::ConstantInt *constNum = dyn_cast(numElements)) { // If all elements have already been initialized, skip the whole loop. if (constNum->getZExtValue() <= initializerElements) { // If there was a cleanup, deactivate it. if (cleanupDominator) DeactivateCleanupBlock(cleanup, cleanupDominator); return; } } else { llvm::BasicBlock *nonEmptyBB = createBasicBlock("new.loop.nonempty"); llvm::Value *isEmpty = Builder.CreateICmpEQ(explicitPtr, endPtr, "array.isempty"); Builder.CreateCondBr(isEmpty, contBB, nonEmptyBB); EmitBlock(nonEmptyBB); } // Enter the loop. llvm::BasicBlock *entryBB = Builder.GetInsertBlock(); llvm::BasicBlock *loopBB = createBasicBlock("new.loop"); EmitBlock(loopBB); // Set up the current-element phi. llvm::PHINode *curPtr = Builder.CreatePHI(explicitPtr->getType(), 2, "array.cur"); curPtr->addIncoming(explicitPtr, entryBB); // Store the new cleanup position for irregular cleanups. if (endOfInit) Builder.CreateStore(curPtr, endOfInit); // Enter a partial-destruction cleanup if necessary. if (!cleanupDominator && needsEHCleanup(dtorKind)) { pushRegularPartialArrayCleanup(beginPtr, curPtr, elementType, getDestroyer(dtorKind)); cleanup = EHStack.stable_begin(); cleanupDominator = Builder.CreateUnreachable(); } // Emit the initializer into this element. StoreAnyExprIntoOneUnit(*this, Init, E->getAllocatedType(), curPtr); // Leave the cleanup if we entered one. if (cleanupDominator) { DeactivateCleanupBlock(cleanup, cleanupDominator); cleanupDominator->eraseFromParent(); } // Advance to the next element. llvm::Value *nextPtr = Builder.CreateConstGEP1_32(curPtr, 1, "array.next"); // Check whether we've gotten to the end of the array and, if so, // exit the loop. llvm::Value *isEnd = Builder.CreateICmpEQ(nextPtr, endPtr, "array.atend"); Builder.CreateCondBr(isEnd, contBB, loopBB); curPtr->addIncoming(nextPtr, Builder.GetInsertBlock()); EmitBlock(contBB); } static void EmitZeroMemSet(CodeGenFunction &CGF, QualType T, llvm::Value *NewPtr, llvm::Value *Size) { CGF.EmitCastToVoidPtr(NewPtr); CharUnits Alignment = CGF.getContext().getTypeAlignInChars(T); CGF.Builder.CreateMemSet(NewPtr, CGF.Builder.getInt8(0), Size, Alignment.getQuantity(), false); } static void EmitNewInitializer(CodeGenFunction &CGF, const CXXNewExpr *E, QualType ElementType, llvm::Value *NewPtr, llvm::Value *NumElements, llvm::Value *AllocSizeWithoutCookie) { const Expr *Init = E->getInitializer(); if (E->isArray()) { if (const CXXConstructExpr *CCE = dyn_cast_or_null(Init)){ CXXConstructorDecl *Ctor = CCE->getConstructor(); if (Ctor->isTrivial()) { // If new expression did not specify value-initialization, then there // is no initialization. if (!CCE->requiresZeroInitialization() || Ctor->getParent()->isEmpty()) return; if (CGF.CGM.getTypes().isZeroInitializable(ElementType)) { // Optimization: since zero initialization will just set the memory // to all zeroes, generate a single memset to do it in one shot. EmitZeroMemSet(CGF, ElementType, NewPtr, AllocSizeWithoutCookie); return; } } CGF.EmitCXXAggrConstructorCall(Ctor, NumElements, NewPtr, CCE->arg_begin(), CCE->arg_end(), CCE->requiresZeroInitialization()); return; } else if (Init && isa(Init) && CGF.CGM.getTypes().isZeroInitializable(ElementType)) { // Optimization: since zero initialization will just set the memory // to all zeroes, generate a single memset to do it in one shot. EmitZeroMemSet(CGF, ElementType, NewPtr, AllocSizeWithoutCookie); return; } CGF.EmitNewArrayInitializer(E, ElementType, NewPtr, NumElements); return; } if (!Init) return; StoreAnyExprIntoOneUnit(CGF, Init, E->getAllocatedType(), NewPtr); } /// Emit a call to an operator new or operator delete function, as implicitly /// created by new-expressions and delete-expressions. static RValue EmitNewDeleteCall(CodeGenFunction &CGF, const FunctionDecl *Callee, const FunctionProtoType *CalleeType, const CallArgList &Args) { llvm::Instruction *CallOrInvoke; llvm::Value *CalleeAddr = CGF.CGM.GetAddrOfFunction(Callee); RValue RV = CGF.EmitCall(CGF.CGM.getTypes().arrangeFreeFunctionCall(Args, CalleeType), CalleeAddr, ReturnValueSlot(), Args, Callee, &CallOrInvoke); /// C++1y [expr.new]p10: /// [In a new-expression,] an implementation is allowed to omit a call /// to a replaceable global allocation function. /// /// We model such elidable calls with the 'builtin' attribute. llvm::Function *Fn = dyn_cast(CalleeAddr); if (Callee->isReplaceableGlobalAllocationFunction() && Fn && Fn->hasFnAttribute(llvm::Attribute::NoBuiltin)) { // FIXME: Add addAttribute to CallSite. if (llvm::CallInst *CI = dyn_cast(CallOrInvoke)) CI->addAttribute(llvm::AttributeSet::FunctionIndex, llvm::Attribute::Builtin); else if (llvm::InvokeInst *II = dyn_cast(CallOrInvoke)) II->addAttribute(llvm::AttributeSet::FunctionIndex, llvm::Attribute::Builtin); else llvm_unreachable("unexpected kind of call instruction"); } return RV; } namespace { /// A cleanup to call the given 'operator delete' function upon /// abnormal exit from a new expression. class CallDeleteDuringNew : public EHScopeStack::Cleanup { size_t NumPlacementArgs; const FunctionDecl *OperatorDelete; llvm::Value *Ptr; llvm::Value *AllocSize; RValue *getPlacementArgs() { return reinterpret_cast(this+1); } public: static size_t getExtraSize(size_t NumPlacementArgs) { return NumPlacementArgs * sizeof(RValue); } CallDeleteDuringNew(size_t NumPlacementArgs, const FunctionDecl *OperatorDelete, llvm::Value *Ptr, llvm::Value *AllocSize) : NumPlacementArgs(NumPlacementArgs), OperatorDelete(OperatorDelete), Ptr(Ptr), AllocSize(AllocSize) {} void setPlacementArg(unsigned I, RValue Arg) { assert(I < NumPlacementArgs && "index out of range"); getPlacementArgs()[I] = Arg; } void Emit(CodeGenFunction &CGF, Flags flags) { const FunctionProtoType *FPT = OperatorDelete->getType()->getAs(); assert(FPT->getNumArgs() == NumPlacementArgs + 1 || (FPT->getNumArgs() == 2 && NumPlacementArgs == 0)); CallArgList DeleteArgs; // The first argument is always a void*. FunctionProtoType::arg_type_iterator AI = FPT->arg_type_begin(); DeleteArgs.add(RValue::get(Ptr), *AI++); // A member 'operator delete' can take an extra 'size_t' argument. if (FPT->getNumArgs() == NumPlacementArgs + 2) DeleteArgs.add(RValue::get(AllocSize), *AI++); // Pass the rest of the arguments, which must match exactly. for (unsigned I = 0; I != NumPlacementArgs; ++I) DeleteArgs.add(getPlacementArgs()[I], *AI++); // Call 'operator delete'. EmitNewDeleteCall(CGF, OperatorDelete, FPT, DeleteArgs); } }; /// A cleanup to call the given 'operator delete' function upon /// abnormal exit from a new expression when the new expression is /// conditional. class CallDeleteDuringConditionalNew : public EHScopeStack::Cleanup { size_t NumPlacementArgs; const FunctionDecl *OperatorDelete; DominatingValue::saved_type Ptr; DominatingValue::saved_type AllocSize; DominatingValue::saved_type *getPlacementArgs() { return reinterpret_cast::saved_type*>(this+1); } public: static size_t getExtraSize(size_t NumPlacementArgs) { return NumPlacementArgs * sizeof(DominatingValue::saved_type); } CallDeleteDuringConditionalNew(size_t NumPlacementArgs, const FunctionDecl *OperatorDelete, DominatingValue::saved_type Ptr, DominatingValue::saved_type AllocSize) : NumPlacementArgs(NumPlacementArgs), OperatorDelete(OperatorDelete), Ptr(Ptr), AllocSize(AllocSize) {} void setPlacementArg(unsigned I, DominatingValue::saved_type Arg) { assert(I < NumPlacementArgs && "index out of range"); getPlacementArgs()[I] = Arg; } void Emit(CodeGenFunction &CGF, Flags flags) { const FunctionProtoType *FPT = OperatorDelete->getType()->getAs(); assert(FPT->getNumArgs() == NumPlacementArgs + 1 || (FPT->getNumArgs() == 2 && NumPlacementArgs == 0)); CallArgList DeleteArgs; // The first argument is always a void*. FunctionProtoType::arg_type_iterator AI = FPT->arg_type_begin(); DeleteArgs.add(Ptr.restore(CGF), *AI++); // A member 'operator delete' can take an extra 'size_t' argument. if (FPT->getNumArgs() == NumPlacementArgs + 2) { RValue RV = AllocSize.restore(CGF); DeleteArgs.add(RV, *AI++); } // Pass the rest of the arguments, which must match exactly. for (unsigned I = 0; I != NumPlacementArgs; ++I) { RValue RV = getPlacementArgs()[I].restore(CGF); DeleteArgs.add(RV, *AI++); } // Call 'operator delete'. EmitNewDeleteCall(CGF, OperatorDelete, FPT, DeleteArgs); } }; } /// Enter a cleanup to call 'operator delete' if the initializer in a /// new-expression throws. static void EnterNewDeleteCleanup(CodeGenFunction &CGF, const CXXNewExpr *E, llvm::Value *NewPtr, llvm::Value *AllocSize, const CallArgList &NewArgs) { // If we're not inside a conditional branch, then the cleanup will // dominate and we can do the easier (and more efficient) thing. if (!CGF.isInConditionalBranch()) { CallDeleteDuringNew *Cleanup = CGF.EHStack .pushCleanupWithExtra(EHCleanup, E->getNumPlacementArgs(), E->getOperatorDelete(), NewPtr, AllocSize); for (unsigned I = 0, N = E->getNumPlacementArgs(); I != N; ++I) Cleanup->setPlacementArg(I, NewArgs[I+1].RV); return; } // Otherwise, we need to save all this stuff. DominatingValue::saved_type SavedNewPtr = DominatingValue::save(CGF, RValue::get(NewPtr)); DominatingValue::saved_type SavedAllocSize = DominatingValue::save(CGF, RValue::get(AllocSize)); CallDeleteDuringConditionalNew *Cleanup = CGF.EHStack .pushCleanupWithExtra(EHCleanup, E->getNumPlacementArgs(), E->getOperatorDelete(), SavedNewPtr, SavedAllocSize); for (unsigned I = 0, N = E->getNumPlacementArgs(); I != N; ++I) Cleanup->setPlacementArg(I, DominatingValue::save(CGF, NewArgs[I+1].RV)); CGF.initFullExprCleanup(); } llvm::Value *CodeGenFunction::EmitCXXNewExpr(const CXXNewExpr *E) { // The element type being allocated. QualType allocType = getContext().getBaseElementType(E->getAllocatedType()); // 1. Build a call to the allocation function. FunctionDecl *allocator = E->getOperatorNew(); const FunctionProtoType *allocatorType = allocator->getType()->castAs(); CallArgList allocatorArgs; // The allocation size is the first argument. QualType sizeType = getContext().getSizeType(); // If there is a brace-initializer, cannot allocate fewer elements than inits. unsigned minElements = 0; if (E->isArray() && E->hasInitializer()) { if (const InitListExpr *ILE = dyn_cast(E->getInitializer())) minElements = ILE->getNumInits(); } llvm::Value *numElements = 0; llvm::Value *allocSizeWithoutCookie = 0; llvm::Value *allocSize = EmitCXXNewAllocSize(*this, E, minElements, numElements, allocSizeWithoutCookie); allocatorArgs.add(RValue::get(allocSize), sizeType); // Emit the rest of the arguments. // FIXME: Ideally, this should just use EmitCallArgs. CXXNewExpr::const_arg_iterator placementArg = E->placement_arg_begin(); // First, use the types from the function type. // We start at 1 here because the first argument (the allocation size) // has already been emitted. for (unsigned i = 1, e = allocatorType->getNumArgs(); i != e; ++i, ++placementArg) { QualType argType = allocatorType->getArgType(i); assert(getContext().hasSameUnqualifiedType(argType.getNonReferenceType(), placementArg->getType()) && "type mismatch in call argument!"); EmitCallArg(allocatorArgs, *placementArg, argType); } // Either we've emitted all the call args, or we have a call to a // variadic function. assert((placementArg == E->placement_arg_end() || allocatorType->isVariadic()) && "Extra arguments to non-variadic function!"); // If we still have any arguments, emit them using the type of the argument. for (CXXNewExpr::const_arg_iterator placementArgsEnd = E->placement_arg_end(); placementArg != placementArgsEnd; ++placementArg) { EmitCallArg(allocatorArgs, *placementArg, placementArg->getType()); } // Emit the allocation call. If the allocator is a global placement // operator, just "inline" it directly. RValue RV; if (allocator->isReservedGlobalPlacementOperator()) { assert(allocatorArgs.size() == 2); RV = allocatorArgs[1].RV; // TODO: kill any unnecessary computations done for the size // argument. } else { RV = EmitNewDeleteCall(*this, allocator, allocatorType, allocatorArgs); } // Emit a null check on the allocation result if the allocation // function is allowed to return null (because it has a non-throwing // exception spec; for this part, we inline // CXXNewExpr::shouldNullCheckAllocation()) and we have an // interesting initializer. bool nullCheck = allocatorType->isNothrow(getContext()) && (!allocType.isPODType(getContext()) || E->hasInitializer()); llvm::BasicBlock *nullCheckBB = 0; llvm::BasicBlock *contBB = 0; llvm::Value *allocation = RV.getScalarVal(); unsigned AS = allocation->getType()->getPointerAddressSpace(); // The null-check means that the initializer is conditionally // evaluated. ConditionalEvaluation conditional(*this); if (nullCheck) { conditional.begin(*this); nullCheckBB = Builder.GetInsertBlock(); llvm::BasicBlock *notNullBB = createBasicBlock("new.notnull"); contBB = createBasicBlock("new.cont"); llvm::Value *isNull = Builder.CreateIsNull(allocation, "new.isnull"); Builder.CreateCondBr(isNull, contBB, notNullBB); EmitBlock(notNullBB); } // If there's an operator delete, enter a cleanup to call it if an // exception is thrown. EHScopeStack::stable_iterator operatorDeleteCleanup; llvm::Instruction *cleanupDominator = 0; if (E->getOperatorDelete() && !E->getOperatorDelete()->isReservedGlobalPlacementOperator()) { EnterNewDeleteCleanup(*this, E, allocation, allocSize, allocatorArgs); operatorDeleteCleanup = EHStack.stable_begin(); cleanupDominator = Builder.CreateUnreachable(); } assert((allocSize == allocSizeWithoutCookie) == CalculateCookiePadding(*this, E).isZero()); if (allocSize != allocSizeWithoutCookie) { assert(E->isArray()); allocation = CGM.getCXXABI().InitializeArrayCookie(*this, allocation, numElements, E, allocType); } llvm::Type *elementPtrTy = ConvertTypeForMem(allocType)->getPointerTo(AS); llvm::Value *result = Builder.CreateBitCast(allocation, elementPtrTy); EmitNewInitializer(*this, E, allocType, result, numElements, allocSizeWithoutCookie); if (E->isArray()) { // NewPtr is a pointer to the base element type. If we're // allocating an array of arrays, we'll need to cast back to the // array pointer type. llvm::Type *resultType = ConvertTypeForMem(E->getType()); if (result->getType() != resultType) result = Builder.CreateBitCast(result, resultType); } // Deactivate the 'operator delete' cleanup if we finished // initialization. if (operatorDeleteCleanup.isValid()) { DeactivateCleanupBlock(operatorDeleteCleanup, cleanupDominator); cleanupDominator->eraseFromParent(); } if (nullCheck) { conditional.end(*this); llvm::BasicBlock *notNullBB = Builder.GetInsertBlock(); EmitBlock(contBB); llvm::PHINode *PHI = Builder.CreatePHI(result->getType(), 2); PHI->addIncoming(result, notNullBB); PHI->addIncoming(llvm::Constant::getNullValue(result->getType()), nullCheckBB); result = PHI; } return result; } void CodeGenFunction::EmitDeleteCall(const FunctionDecl *DeleteFD, llvm::Value *Ptr, QualType DeleteTy) { assert(DeleteFD->getOverloadedOperator() == OO_Delete); const FunctionProtoType *DeleteFTy = DeleteFD->getType()->getAs(); CallArgList DeleteArgs; // Check if we need to pass the size to the delete operator. llvm::Value *Size = 0; QualType SizeTy; if (DeleteFTy->getNumArgs() == 2) { SizeTy = DeleteFTy->getArgType(1); CharUnits DeleteTypeSize = getContext().getTypeSizeInChars(DeleteTy); Size = llvm::ConstantInt::get(ConvertType(SizeTy), DeleteTypeSize.getQuantity()); } QualType ArgTy = DeleteFTy->getArgType(0); llvm::Value *DeletePtr = Builder.CreateBitCast(Ptr, ConvertType(ArgTy)); DeleteArgs.add(RValue::get(DeletePtr), ArgTy); if (Size) DeleteArgs.add(RValue::get(Size), SizeTy); // Emit the call to delete. EmitNewDeleteCall(*this, DeleteFD, DeleteFTy, DeleteArgs); } namespace { /// Calls the given 'operator delete' on a single object. struct CallObjectDelete : EHScopeStack::Cleanup { llvm::Value *Ptr; const FunctionDecl *OperatorDelete; QualType ElementType; CallObjectDelete(llvm::Value *Ptr, const FunctionDecl *OperatorDelete, QualType ElementType) : Ptr(Ptr), OperatorDelete(OperatorDelete), ElementType(ElementType) {} void Emit(CodeGenFunction &CGF, Flags flags) { CGF.EmitDeleteCall(OperatorDelete, Ptr, ElementType); } }; } /// Emit the code for deleting a single object. static void EmitObjectDelete(CodeGenFunction &CGF, const FunctionDecl *OperatorDelete, llvm::Value *Ptr, QualType ElementType, bool UseGlobalDelete) { // Find the destructor for the type, if applicable. If the // destructor is virtual, we'll just emit the vcall and return. const CXXDestructorDecl *Dtor = 0; if (const RecordType *RT = ElementType->getAs()) { CXXRecordDecl *RD = cast(RT->getDecl()); if (RD->hasDefinition() && !RD->hasTrivialDestructor()) { Dtor = RD->getDestructor(); if (Dtor->isVirtual()) { if (UseGlobalDelete) { // If we're supposed to call the global delete, make sure we do so // even if the destructor throws. // Derive the complete-object pointer, which is what we need // to pass to the deallocation function. llvm::Value *completePtr = CGF.CGM.getCXXABI().adjustToCompleteObject(CGF, Ptr, ElementType); CGF.EHStack.pushCleanup(NormalAndEHCleanup, completePtr, OperatorDelete, ElementType); } // FIXME: Provide a source location here. CXXDtorType DtorType = UseGlobalDelete ? Dtor_Complete : Dtor_Deleting; CGF.CGM.getCXXABI().EmitVirtualDestructorCall(CGF, Dtor, DtorType, SourceLocation(), Ptr); if (UseGlobalDelete) { CGF.PopCleanupBlock(); } return; } } } // Make sure that we call delete even if the dtor throws. // This doesn't have to a conditional cleanup because we're going // to pop it off in a second. CGF.EHStack.pushCleanup(NormalAndEHCleanup, Ptr, OperatorDelete, ElementType); if (Dtor) CGF.EmitCXXDestructorCall(Dtor, Dtor_Complete, /*ForVirtualBase=*/false, /*Delegating=*/false, Ptr); else if (CGF.getLangOpts().ObjCAutoRefCount && ElementType->isObjCLifetimeType()) { switch (ElementType.getObjCLifetime()) { case Qualifiers::OCL_None: case Qualifiers::OCL_ExplicitNone: case Qualifiers::OCL_Autoreleasing: break; case Qualifiers::OCL_Strong: { // Load the pointer value. llvm::Value *PtrValue = CGF.Builder.CreateLoad(Ptr, ElementType.isVolatileQualified()); CGF.EmitARCRelease(PtrValue, ARCPreciseLifetime); break; } case Qualifiers::OCL_Weak: CGF.EmitARCDestroyWeak(Ptr); break; } } CGF.PopCleanupBlock(); } namespace { /// Calls the given 'operator delete' on an array of objects. struct CallArrayDelete : EHScopeStack::Cleanup { llvm::Value *Ptr; const FunctionDecl *OperatorDelete; llvm::Value *NumElements; QualType ElementType; CharUnits CookieSize; CallArrayDelete(llvm::Value *Ptr, const FunctionDecl *OperatorDelete, llvm::Value *NumElements, QualType ElementType, CharUnits CookieSize) : Ptr(Ptr), OperatorDelete(OperatorDelete), NumElements(NumElements), ElementType(ElementType), CookieSize(CookieSize) {} void Emit(CodeGenFunction &CGF, Flags flags) { const FunctionProtoType *DeleteFTy = OperatorDelete->getType()->getAs(); assert(DeleteFTy->getNumArgs() == 1 || DeleteFTy->getNumArgs() == 2); CallArgList Args; // Pass the pointer as the first argument. QualType VoidPtrTy = DeleteFTy->getArgType(0); llvm::Value *DeletePtr = CGF.Builder.CreateBitCast(Ptr, CGF.ConvertType(VoidPtrTy)); Args.add(RValue::get(DeletePtr), VoidPtrTy); // Pass the original requested size as the second argument. if (DeleteFTy->getNumArgs() == 2) { QualType size_t = DeleteFTy->getArgType(1); llvm::IntegerType *SizeTy = cast(CGF.ConvertType(size_t)); CharUnits ElementTypeSize = CGF.CGM.getContext().getTypeSizeInChars(ElementType); // The size of an element, multiplied by the number of elements. llvm::Value *Size = llvm::ConstantInt::get(SizeTy, ElementTypeSize.getQuantity()); Size = CGF.Builder.CreateMul(Size, NumElements); // Plus the size of the cookie if applicable. if (!CookieSize.isZero()) { llvm::Value *CookieSizeV = llvm::ConstantInt::get(SizeTy, CookieSize.getQuantity()); Size = CGF.Builder.CreateAdd(Size, CookieSizeV); } Args.add(RValue::get(Size), size_t); } // Emit the call to delete. EmitNewDeleteCall(CGF, OperatorDelete, DeleteFTy, Args); } }; } /// Emit the code for deleting an array of objects. static void EmitArrayDelete(CodeGenFunction &CGF, const CXXDeleteExpr *E, llvm::Value *deletedPtr, QualType elementType) { llvm::Value *numElements = 0; llvm::Value *allocatedPtr = 0; CharUnits cookieSize; CGF.CGM.getCXXABI().ReadArrayCookie(CGF, deletedPtr, E, elementType, numElements, allocatedPtr, cookieSize); assert(allocatedPtr && "ReadArrayCookie didn't set allocated pointer"); // Make sure that we call delete even if one of the dtors throws. const FunctionDecl *operatorDelete = E->getOperatorDelete(); CGF.EHStack.pushCleanup(NormalAndEHCleanup, allocatedPtr, operatorDelete, numElements, elementType, cookieSize); // Destroy the elements. if (QualType::DestructionKind dtorKind = elementType.isDestructedType()) { assert(numElements && "no element count for a type with a destructor!"); llvm::Value *arrayEnd = CGF.Builder.CreateInBoundsGEP(deletedPtr, numElements, "delete.end"); // Note that it is legal to allocate a zero-length array, and we // can never fold the check away because the length should always // come from a cookie. CGF.emitArrayDestroy(deletedPtr, arrayEnd, elementType, CGF.getDestroyer(dtorKind), /*checkZeroLength*/ true, CGF.needsEHCleanup(dtorKind)); } // Pop the cleanup block. CGF.PopCleanupBlock(); } void CodeGenFunction::EmitCXXDeleteExpr(const CXXDeleteExpr *E) { const Expr *Arg = E->getArgument(); llvm::Value *Ptr = EmitScalarExpr(Arg); // Null check the pointer. llvm::BasicBlock *DeleteNotNull = createBasicBlock("delete.notnull"); llvm::BasicBlock *DeleteEnd = createBasicBlock("delete.end"); llvm::Value *IsNull = Builder.CreateIsNull(Ptr, "isnull"); Builder.CreateCondBr(IsNull, DeleteEnd, DeleteNotNull); EmitBlock(DeleteNotNull); // We might be deleting a pointer to array. If so, GEP down to the // first non-array element. // (this assumes that A(*)[3][7] is converted to [3 x [7 x %A]]*) QualType DeleteTy = Arg->getType()->getAs()->getPointeeType(); if (DeleteTy->isConstantArrayType()) { llvm::Value *Zero = Builder.getInt32(0); SmallVector GEP; GEP.push_back(Zero); // point at the outermost array // For each layer of array type we're pointing at: while (const ConstantArrayType *Arr = getContext().getAsConstantArrayType(DeleteTy)) { // 1. Unpeel the array type. DeleteTy = Arr->getElementType(); // 2. GEP to the first element of the array. GEP.push_back(Zero); } Ptr = Builder.CreateInBoundsGEP(Ptr, GEP, "del.first"); } assert(ConvertTypeForMem(DeleteTy) == cast(Ptr->getType())->getElementType()); if (E->isArrayForm()) { EmitArrayDelete(*this, E, Ptr, DeleteTy); } else { EmitObjectDelete(*this, E->getOperatorDelete(), Ptr, DeleteTy, E->isGlobalDelete()); } EmitBlock(DeleteEnd); } static llvm::Constant *getBadTypeidFn(CodeGenFunction &CGF) { // void __cxa_bad_typeid(); llvm::FunctionType *FTy = llvm::FunctionType::get(CGF.VoidTy, false); return CGF.CGM.CreateRuntimeFunction(FTy, "__cxa_bad_typeid"); } static void EmitBadTypeidCall(CodeGenFunction &CGF) { llvm::Value *Fn = getBadTypeidFn(CGF); CGF.EmitRuntimeCallOrInvoke(Fn).setDoesNotReturn(); CGF.Builder.CreateUnreachable(); } static llvm::Value *EmitTypeidFromVTable(CodeGenFunction &CGF, const Expr *E, llvm::Type *StdTypeInfoPtrTy) { // Get the vtable pointer. llvm::Value *ThisPtr = CGF.EmitLValue(E).getAddress(); // C++ [expr.typeid]p2: // If the glvalue expression is obtained by applying the unary * operator to // a pointer and the pointer is a null pointer value, the typeid expression // throws the std::bad_typeid exception. if (const UnaryOperator *UO = dyn_cast(E->IgnoreParens())) { if (UO->getOpcode() == UO_Deref) { llvm::BasicBlock *BadTypeidBlock = CGF.createBasicBlock("typeid.bad_typeid"); llvm::BasicBlock *EndBlock = CGF.createBasicBlock("typeid.end"); llvm::Value *IsNull = CGF.Builder.CreateIsNull(ThisPtr); CGF.Builder.CreateCondBr(IsNull, BadTypeidBlock, EndBlock); CGF.EmitBlock(BadTypeidBlock); EmitBadTypeidCall(CGF); CGF.EmitBlock(EndBlock); } } llvm::Value *Value = CGF.GetVTablePtr(ThisPtr, StdTypeInfoPtrTy->getPointerTo()); // Load the type info. Value = CGF.Builder.CreateConstInBoundsGEP1_64(Value, -1ULL); return CGF.Builder.CreateLoad(Value); } llvm::Value *CodeGenFunction::EmitCXXTypeidExpr(const CXXTypeidExpr *E) { llvm::Type *StdTypeInfoPtrTy = ConvertType(E->getType())->getPointerTo(); if (E->isTypeOperand()) { llvm::Constant *TypeInfo = CGM.GetAddrOfRTTIDescriptor(E->getTypeOperand(getContext())); return Builder.CreateBitCast(TypeInfo, StdTypeInfoPtrTy); } // C++ [expr.typeid]p2: // When typeid is applied to a glvalue expression whose type is a // polymorphic class type, the result refers to a std::type_info object // representing the type of the most derived object (that is, the dynamic // type) to which the glvalue refers. if (E->isPotentiallyEvaluated()) return EmitTypeidFromVTable(*this, E->getExprOperand(), StdTypeInfoPtrTy); QualType OperandTy = E->getExprOperand()->getType(); return Builder.CreateBitCast(CGM.GetAddrOfRTTIDescriptor(OperandTy), StdTypeInfoPtrTy); } static llvm::Constant *getDynamicCastFn(CodeGenFunction &CGF) { // void *__dynamic_cast(const void *sub, // const abi::__class_type_info *src, // const abi::__class_type_info *dst, // std::ptrdiff_t src2dst_offset); llvm::Type *Int8PtrTy = CGF.Int8PtrTy; llvm::Type *PtrDiffTy = CGF.ConvertType(CGF.getContext().getPointerDiffType()); llvm::Type *Args[4] = { Int8PtrTy, Int8PtrTy, Int8PtrTy, PtrDiffTy }; llvm::FunctionType *FTy = llvm::FunctionType::get(Int8PtrTy, Args, false); // Mark the function as nounwind readonly. llvm::Attribute::AttrKind FuncAttrs[] = { llvm::Attribute::NoUnwind, llvm::Attribute::ReadOnly }; llvm::AttributeSet Attrs = llvm::AttributeSet::get( CGF.getLLVMContext(), llvm::AttributeSet::FunctionIndex, FuncAttrs); return CGF.CGM.CreateRuntimeFunction(FTy, "__dynamic_cast", Attrs); } static llvm::Constant *getBadCastFn(CodeGenFunction &CGF) { // void __cxa_bad_cast(); llvm::FunctionType *FTy = llvm::FunctionType::get(CGF.VoidTy, false); return CGF.CGM.CreateRuntimeFunction(FTy, "__cxa_bad_cast"); } static void EmitBadCastCall(CodeGenFunction &CGF) { llvm::Value *Fn = getBadCastFn(CGF); CGF.EmitRuntimeCallOrInvoke(Fn).setDoesNotReturn(); CGF.Builder.CreateUnreachable(); } /// \brief Compute the src2dst_offset hint as described in the /// Itanium C++ ABI [2.9.7] static CharUnits computeOffsetHint(ASTContext &Context, const CXXRecordDecl *Src, const CXXRecordDecl *Dst) { CXXBasePaths Paths(/*FindAmbiguities=*/true, /*RecordPaths=*/true, /*DetectVirtual=*/false); // If Dst is not derived from Src we can skip the whole computation below and // return that Src is not a public base of Dst. Record all inheritance paths. if (!Dst->isDerivedFrom(Src, Paths)) return CharUnits::fromQuantity(-2ULL); unsigned NumPublicPaths = 0; CharUnits Offset; // Now walk all possible inheritance paths. for (CXXBasePaths::paths_iterator I = Paths.begin(), E = Paths.end(); I != E; ++I) { if (I->Access != AS_public) // Ignore non-public inheritance. continue; ++NumPublicPaths; for (CXXBasePath::iterator J = I->begin(), JE = I->end(); J != JE; ++J) { // If the path contains a virtual base class we can't give any hint. // -1: no hint. if (J->Base->isVirtual()) return CharUnits::fromQuantity(-1ULL); if (NumPublicPaths > 1) // Won't use offsets, skip computation. continue; // Accumulate the base class offsets. const ASTRecordLayout &L = Context.getASTRecordLayout(J->Class); Offset += L.getBaseClassOffset(J->Base->getType()->getAsCXXRecordDecl()); } } // -2: Src is not a public base of Dst. if (NumPublicPaths == 0) return CharUnits::fromQuantity(-2ULL); // -3: Src is a multiple public base type but never a virtual base type. if (NumPublicPaths > 1) return CharUnits::fromQuantity(-3ULL); // Otherwise, the Src type is a unique public nonvirtual base type of Dst. // Return the offset of Src from the origin of Dst. return Offset; } static llvm::Value * EmitDynamicCastCall(CodeGenFunction &CGF, llvm::Value *Value, QualType SrcTy, QualType DestTy, llvm::BasicBlock *CastEnd) { llvm::Type *PtrDiffLTy = CGF.ConvertType(CGF.getContext().getPointerDiffType()); llvm::Type *DestLTy = CGF.ConvertType(DestTy); if (const PointerType *PTy = DestTy->getAs()) { if (PTy->getPointeeType()->isVoidType()) { // C++ [expr.dynamic.cast]p7: // If T is "pointer to cv void," then the result is a pointer to the // most derived object pointed to by v. // Get the vtable pointer. llvm::Value *VTable = CGF.GetVTablePtr(Value, PtrDiffLTy->getPointerTo()); // Get the offset-to-top from the vtable. llvm::Value *OffsetToTop = CGF.Builder.CreateConstInBoundsGEP1_64(VTable, -2ULL); OffsetToTop = CGF.Builder.CreateLoad(OffsetToTop, "offset.to.top"); // Finally, add the offset to the pointer. Value = CGF.EmitCastToVoidPtr(Value); Value = CGF.Builder.CreateInBoundsGEP(Value, OffsetToTop); return CGF.Builder.CreateBitCast(Value, DestLTy); } } QualType SrcRecordTy; QualType DestRecordTy; if (const PointerType *DestPTy = DestTy->getAs()) { SrcRecordTy = SrcTy->castAs()->getPointeeType(); DestRecordTy = DestPTy->getPointeeType(); } else { SrcRecordTy = SrcTy; DestRecordTy = DestTy->castAs()->getPointeeType(); } assert(SrcRecordTy->isRecordType() && "source type must be a record type!"); assert(DestRecordTy->isRecordType() && "dest type must be a record type!"); llvm::Value *SrcRTTI = CGF.CGM.GetAddrOfRTTIDescriptor(SrcRecordTy.getUnqualifiedType()); llvm::Value *DestRTTI = CGF.CGM.GetAddrOfRTTIDescriptor(DestRecordTy.getUnqualifiedType()); // Compute the offset hint. const CXXRecordDecl *SrcDecl = SrcRecordTy->getAsCXXRecordDecl(); const CXXRecordDecl *DestDecl = DestRecordTy->getAsCXXRecordDecl(); llvm::Value *OffsetHint = llvm::ConstantInt::get(PtrDiffLTy, computeOffsetHint(CGF.getContext(), SrcDecl, DestDecl).getQuantity()); // Emit the call to __dynamic_cast. Value = CGF.EmitCastToVoidPtr(Value); llvm::Value *args[] = { Value, SrcRTTI, DestRTTI, OffsetHint }; Value = CGF.EmitNounwindRuntimeCall(getDynamicCastFn(CGF), args); Value = CGF.Builder.CreateBitCast(Value, DestLTy); /// C++ [expr.dynamic.cast]p9: /// A failed cast to reference type throws std::bad_cast if (DestTy->isReferenceType()) { llvm::BasicBlock *BadCastBlock = CGF.createBasicBlock("dynamic_cast.bad_cast"); llvm::Value *IsNull = CGF.Builder.CreateIsNull(Value); CGF.Builder.CreateCondBr(IsNull, BadCastBlock, CastEnd); CGF.EmitBlock(BadCastBlock); EmitBadCastCall(CGF); } return Value; } static llvm::Value *EmitDynamicCastToNull(CodeGenFunction &CGF, QualType DestTy) { llvm::Type *DestLTy = CGF.ConvertType(DestTy); if (DestTy->isPointerType()) return llvm::Constant::getNullValue(DestLTy); /// C++ [expr.dynamic.cast]p9: /// A failed cast to reference type throws std::bad_cast EmitBadCastCall(CGF); CGF.EmitBlock(CGF.createBasicBlock("dynamic_cast.end")); return llvm::UndefValue::get(DestLTy); } llvm::Value *CodeGenFunction::EmitDynamicCast(llvm::Value *Value, const CXXDynamicCastExpr *DCE) { QualType DestTy = DCE->getTypeAsWritten(); if (DCE->isAlwaysNull()) return EmitDynamicCastToNull(*this, DestTy); QualType SrcTy = DCE->getSubExpr()->getType(); // C++ [expr.dynamic.cast]p4: // If the value of v is a null pointer value in the pointer case, the result // is the null pointer value of type T. bool ShouldNullCheckSrcValue = SrcTy->isPointerType(); llvm::BasicBlock *CastNull = 0; llvm::BasicBlock *CastNotNull = 0; llvm::BasicBlock *CastEnd = createBasicBlock("dynamic_cast.end"); if (ShouldNullCheckSrcValue) { CastNull = createBasicBlock("dynamic_cast.null"); CastNotNull = createBasicBlock("dynamic_cast.notnull"); llvm::Value *IsNull = Builder.CreateIsNull(Value); Builder.CreateCondBr(IsNull, CastNull, CastNotNull); EmitBlock(CastNotNull); } Value = EmitDynamicCastCall(*this, Value, SrcTy, DestTy, CastEnd); if (ShouldNullCheckSrcValue) { EmitBranch(CastEnd); EmitBlock(CastNull); EmitBranch(CastEnd); } EmitBlock(CastEnd); if (ShouldNullCheckSrcValue) { llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2); PHI->addIncoming(Value, CastNotNull); PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()), CastNull); Value = PHI; } return Value; } void CodeGenFunction::EmitLambdaExpr(const LambdaExpr *E, AggValueSlot Slot) { RunCleanupsScope Scope(*this); LValue SlotLV = MakeAddrLValue(Slot.getAddr(), E->getType(), Slot.getAlignment()); CXXRecordDecl::field_iterator CurField = E->getLambdaClass()->field_begin(); for (LambdaExpr::capture_init_iterator i = E->capture_init_begin(), e = E->capture_init_end(); i != e; ++i, ++CurField) { // Emit initialization LValue LV = EmitLValueForFieldInitialization(SlotLV, *CurField); ArrayRef ArrayIndexes; if (CurField->getType()->isArrayType()) ArrayIndexes = E->getCaptureInitIndexVars(i); EmitInitializerForField(*CurField, LV, *i, ArrayIndexes); } } @ 1.1.1.1 log @Import Clang 3.4rc1 r195771. @ text @@ 1.1.1.2 log @Import clang 3.5svn r198450. @ text @d723 1 a723 1 // FIXME: Refactor with EmitExprAsInit. a768 1 a772 11 // If this is a multi-dimensional array new, we will initialize multiple // elements with each init list element. QualType AllocType = E->getAllocatedType(); if (const ConstantArrayType *CAT = dyn_cast_or_null( AllocType->getAsArrayTypeUnsafe())) { unsigned AS = explicitPtr->getType()->getPointerAddressSpace(); llvm::Type *AllocPtrTy = ConvertTypeForMem(AllocType)->getPointerTo(AS); explicitPtr = Builder.CreateBitCast(explicitPtr, AllocPtrTy); initializerElements *= getContext().getConstantArrayElementCount(CAT); } d791 2 a792 4 StoreAnyExprIntoOneUnit(*this, ILE->getInit(i), ILE->getInit(i)->getType(), explicitPtr); explicitPtr = Builder.CreateConstGEP1_32(explicitPtr, 1, "array.exp.next"); a796 2 explicitPtr = Builder.CreateBitCast(explicitPtr, beginPtr->getType()); d851 3 a853 23 // FIXME: The code below intends to initialize the individual array base // elements, one at a time - but when dealing with multi-dimensional arrays - // the pointer arithmetic can get confused - so the fix below entails casting // to the allocated type to ensure that we get the pointer arithmetic right. // It seems like the right approach here, it to really initialize the // individual array base elements one at a time since it'll generate less // code. I think the problem is that the wrong type is being passed into // StoreAnyExprIntoOneUnit, but directly fixing that doesn't really work, // because the Init expression has the wrong type at this point. // So... this is ok for a quick fix, but we can and should do a lot better // here long-term. // Advance to the next element by adjusting the pointer type as necessary. // For new int[10][20][30], alloc type is int[20][30], base type is 'int'. QualType AllocType = E->getAllocatedType(); llvm::Type *AllocPtrTy = ConvertTypeForMem(AllocType)->getPointerTo( curPtr->getType()->getPointerAddressSpace()); llvm::Value *curPtrAllocTy = Builder.CreateBitCast(curPtr, AllocPtrTy); llvm::Value *nextPtrAllocTy = Builder.CreateConstGEP1_32(curPtrAllocTy, 1, "array.next"); // Cast it back to the base type so that we can compare it to the endPtr. llvm::Value *nextPtr = Builder.CreateBitCast(nextPtrAllocTy, endPtr->getType()); d1132 5 d1139 22 a1160 4 EmitCallArgs(allocatorArgs, allocatorType->isVariadic(), allocatorType->arg_type_begin() + 1, allocatorType->arg_type_end(), E->placement_arg_begin(), E->placement_arg_end()); @ 1.1.1.3 log @Import Clang 3.5svn r199312 @ text @d319 1 a319 1 CharUnits Align = Layout.getNonVirtualAlignment(); @ 1.1.1.4 log @Import Clang 3.5svn r201163. @ text @d122 2 a123 2 DevirtualizedMethod->getReturnType().getCanonicalType() != MD->getReturnType().getCanonicalType()) d1017 2 a1018 2 assert(FPT->getNumParams() == NumPlacementArgs + 1 || (FPT->getNumParams() == 2 && NumPlacementArgs == 0)); d1023 1 a1023 1 FunctionProtoType::param_type_iterator AI = FPT->param_type_begin(); d1027 1 a1027 1 if (FPT->getNumParams() == NumPlacementArgs + 2) d1072 2 a1073 2 assert(FPT->getNumParams() == NumPlacementArgs + 1 || (FPT->getNumParams() == 2 && NumPlacementArgs == 0)); d1078 1 a1078 1 FunctionProtoType::param_type_iterator AI = FPT->param_type_begin(); d1082 1 a1082 1 if (FPT->getNumParams() == NumPlacementArgs + 2) { d1171 2 a1172 2 allocatorType->param_type_begin() + 1, allocatorType->param_type_end(), E->placement_arg_begin(), d1289 2 a1290 2 if (DeleteFTy->getNumParams() == 2) { SizeTy = DeleteFTy->getParamType(1); d1295 2 a1296 2 QualType ArgTy = DeleteFTy->getParamType(0); d1425 1 a1425 1 assert(DeleteFTy->getNumParams() == 1 || DeleteFTy->getNumParams() == 2); d1430 1 a1430 1 QualType VoidPtrTy = DeleteFTy->getParamType(0); d1436 2 a1437 2 if (DeleteFTy->getNumParams() == 2) { QualType size_t = DeleteFTy->getParamType(1); @ 1.1.1.5 log @Import Clang 3.5svn r202566. @ text @d263 1 a263 1 CGM.getCXXABI().EmitLoadOfMemberFunctionPointer(*this, BO, This, MemFnPtr, MPT); @ 1.1.1.5.2.1 log @Rebase. @ text @a20 1 #include "llvm/IR/CallSite.h" d22 1 d98 1 a98 1 const CXXMethodDecl *DevirtualizedMethod = nullptr; d114 1 a114 1 DevirtualizedMethod = nullptr; d124 1 a124 1 DevirtualizedMethod = nullptr; d135 1 a135 1 if (isa(MD)) return RValue::get(nullptr); d138 1 a138 1 return RValue::get(nullptr); d161 1 a161 1 const CGFunctionInfo *FInfo = nullptr; d202 1 a202 1 /*ImplicitParam=*/nullptr, QualType(), nullptr,nullptr); d204 1 a204 1 return RValue::get(nullptr); d223 2 a224 4 if (MD->isVirtual()) { This = CGM.getCXXABI().adjustThisArgumentForVirtualFunctionCall( *this, MD, This, UseVirtualCall); } d227 1 a227 1 /*ImplicitParam=*/nullptr, QualType(), d300 1 a300 1 /*ImplicitParam=*/nullptr, QualType(), d587 1 a587 1 llvm::Value *hasOverflow = nullptr; d727 2 a728 2 CGF.EmitScalarInit(Init, nullptr, CGF.MakeAddrLValue(NewPtr, AllocType, Alignment), d765 1 a765 1 llvm::AllocaInst *endOfInit = nullptr; d768 1 a768 1 llvm::Instruction *cleanupDominator = nullptr; a814 10 llvm::ConstantInt *constNum = dyn_cast(numElements); // If all elements have already been initialized, skip the whole loop. if (constNum && constNum->getZExtValue() <= initializerElements) { // If there was a cleanup, deactivate it. if (cleanupDominator) DeactivateCleanupBlock(cleanup, cleanupDominator); return; } d820 9 a828 1 if (!constNum) { d1014 1 a1014 1 void Emit(CodeGenFunction &CGF, Flags flags) override { d1069 1 a1069 1 void Emit(CodeGenFunction &CGF, Flags flags) override { d1160 2 a1161 2 llvm::Value *numElements = nullptr; llvm::Value *allocSizeWithoutCookie = nullptr; d1195 2 a1196 2 llvm::BasicBlock *nullCheckBB = nullptr; llvm::BasicBlock *contBB = nullptr; d1220 1 a1220 1 llvm::Instruction *cleanupDominator = nullptr; d1287 1 a1287 1 llvm::Value *Size = nullptr; d1319 1 a1319 1 void Emit(CodeGenFunction &CGF, Flags flags) override { d1333 1 a1333 1 const CXXDestructorDecl *Dtor = nullptr; d1422 1 a1422 1 void Emit(CodeGenFunction &CGF, Flags flags) override { d1470 2 a1471 2 llvm::Value *numElements = nullptr; llvm::Value *allocatedPtr = nullptr; d1819 3 a1821 3 llvm::BasicBlock *CastNull = nullptr; llvm::BasicBlock *CastNotNull = nullptr; @ 1.1.1.6 log @Import Clang 3.5svn r209886. @ text @a20 1 #include "llvm/IR/CallSite.h" d22 1 d98 1 a98 1 const CXXMethodDecl *DevirtualizedMethod = nullptr; d114 1 a114 1 DevirtualizedMethod = nullptr; d124 1 a124 1 DevirtualizedMethod = nullptr; d135 1 a135 1 if (isa(MD)) return RValue::get(nullptr); d138 1 a138 1 return RValue::get(nullptr); d161 1 a161 1 const CGFunctionInfo *FInfo = nullptr; d202 1 a202 1 /*ImplicitParam=*/nullptr, QualType(), nullptr,nullptr); d204 1 a204 1 return RValue::get(nullptr); d223 2 a224 4 if (MD->isVirtual()) { This = CGM.getCXXABI().adjustThisArgumentForVirtualFunctionCall( *this, MD, This, UseVirtualCall); } d227 1 a227 1 /*ImplicitParam=*/nullptr, QualType(), d300 1 a300 1 /*ImplicitParam=*/nullptr, QualType(), d587 1 a587 1 llvm::Value *hasOverflow = nullptr; d727 2 a728 2 CGF.EmitScalarInit(Init, nullptr, CGF.MakeAddrLValue(NewPtr, AllocType, Alignment), d765 1 a765 1 llvm::AllocaInst *endOfInit = nullptr; d768 1 a768 1 llvm::Instruction *cleanupDominator = nullptr; a814 10 llvm::ConstantInt *constNum = dyn_cast(numElements); // If all elements have already been initialized, skip the whole loop. if (constNum && constNum->getZExtValue() <= initializerElements) { // If there was a cleanup, deactivate it. if (cleanupDominator) DeactivateCleanupBlock(cleanup, cleanupDominator); return; } d820 9 a828 1 if (!constNum) { d1014 1 a1014 1 void Emit(CodeGenFunction &CGF, Flags flags) override { d1069 1 a1069 1 void Emit(CodeGenFunction &CGF, Flags flags) override { d1160 2 a1161 2 llvm::Value *numElements = nullptr; llvm::Value *allocSizeWithoutCookie = nullptr; d1195 2 a1196 2 llvm::BasicBlock *nullCheckBB = nullptr; llvm::BasicBlock *contBB = nullptr; d1220 1 a1220 1 llvm::Instruction *cleanupDominator = nullptr; d1287 1 a1287 1 llvm::Value *Size = nullptr; d1319 1 a1319 1 void Emit(CodeGenFunction &CGF, Flags flags) override { d1333 1 a1333 1 const CXXDestructorDecl *Dtor = nullptr; d1422 1 a1422 1 void Emit(CodeGenFunction &CGF, Flags flags) override { d1470 2 a1471 2 llvm::Value *numElements = nullptr; llvm::Value *allocatedPtr = nullptr; d1819 3 a1821 3 llvm::BasicBlock *CastNull = nullptr; llvm::BasicBlock *CastNotNull = nullptr; @ 1.1.1.7 log @Import clang 3.6svn r215315. @ text @d752 4 a755 7 CodeGenFunction::EmitNewArrayInitializer(const CXXNewExpr *E, QualType ElementType, llvm::Value *BeginPtr, llvm::Value *NumElements, llvm::Value *AllocSizeWithoutCookie) { // If we have a type with trivial initialization and no initializer, // there's nothing to do. d757 1 a757 1 return; d759 4 a762 1 llvm::Value *CurPtr = BeginPtr; d764 1 a764 1 unsigned InitListElements = 0; d767 4 a770 4 llvm::AllocaInst *EndOfInit = nullptr; QualType::DestructionKind DtorKind = ElementType.isDestructedType(); EHScopeStack::stable_iterator Cleanup; llvm::Instruction *CleanupDominator = nullptr; d774 1 a774 1 InitListElements = ILE->getNumInits(); d781 1 a781 1 unsigned AS = CurPtr->getType()->getPointerAddressSpace(); d783 2 a784 2 CurPtr = Builder.CreateBitCast(CurPtr, AllocPtrTy); InitListElements *= getContext().getConstantArrayElementCount(CAT); d787 3 a789 3 // Enter a partial-destruction Cleanup if necessary. if (needsEHCleanup(DtorKind)) { // In principle we could tell the Cleanup where we are more d793 5 a797 5 EndOfInit = CreateTempAlloca(BeginPtr->getType(), "array.init.end"); CleanupDominator = Builder.CreateStore(BeginPtr, EndOfInit); pushIrregularPartialArrayCleanup(BeginPtr, EndOfInit, ElementType, getDestroyer(DtorKind)); Cleanup = EHStack.stable_begin(); d804 1 a804 6 if (EndOfInit) Builder.CreateStore(Builder.CreateBitCast(CurPtr, BeginPtr->getType()), EndOfInit); // FIXME: If the last initializer is an incomplete initializer list for // an array, and we have an array filler, we can fold together the two // initialization loops. d806 3 a808 2 ILE->getInit(i)->getType(), CurPtr); CurPtr = Builder.CreateConstInBoundsGEP1_32(CurPtr, 1, "array.exp.next"); d814 1 a814 13 // Extract the initializer for the individual array elements by pulling // out the array filler from all the nested initializer lists. This avoids // generating a nested loop for the initialization. while (Init && Init->getType()->isConstantArrayType()) { auto *SubILE = dyn_cast(Init); if (!SubILE) break; assert(SubILE->getNumInits() == 0 && "explicit inits in array filler?"); Init = SubILE->getArrayFiller(); } // Switch back to initializing one base element at a time. CurPtr = Builder.CreateBitCast(CurPtr, BeginPtr->getType()); d817 1 a817 53 // Attempt to perform zero-initialization using memset. auto TryMemsetInitialization = [&]() -> bool { // FIXME: If the type is a pointer-to-data-member under the Itanium ABI, // we can initialize with a memset to -1. if (!CGM.getTypes().isZeroInitializable(ElementType)) return false; // Optimization: since zero initialization will just set the memory // to all zeroes, generate a single memset to do it in one shot. // Subtract out the size of any elements we've already initialized. auto *RemainingSize = AllocSizeWithoutCookie; if (InitListElements) { // We know this can't overflow; we check this when doing the allocation. auto *InitializedSize = llvm::ConstantInt::get( RemainingSize->getType(), getContext().getTypeSizeInChars(ElementType).getQuantity() * InitListElements); RemainingSize = Builder.CreateSub(RemainingSize, InitializedSize); } // Create the memset. CharUnits Alignment = getContext().getTypeAlignInChars(ElementType); Builder.CreateMemSet(CurPtr, Builder.getInt8(0), RemainingSize, Alignment.getQuantity(), false); return true; }; // If all elements have already been initialized, skip any further // initialization. llvm::ConstantInt *ConstNum = dyn_cast(NumElements); if (ConstNum && ConstNum->getZExtValue() <= InitListElements) { // If there was a Cleanup, deactivate it. if (CleanupDominator) DeactivateCleanupBlock(Cleanup, CleanupDominator); return; } assert(Init && "have trailing elements to initialize but no initializer"); // If this is a constructor call, try to optimize it out, and failing that // emit a single loop to initialize all remaining elements. if (const CXXConstructExpr *CCE = dyn_cast(Init)) { CXXConstructorDecl *Ctor = CCE->getConstructor(); if (Ctor->isTrivial()) { // If new expression did not specify value-initialization, then there // is no initialization. if (!CCE->requiresZeroInitialization() || Ctor->getParent()->isEmpty()) return; if (TryMemsetInitialization()) return; } d819 5 a823 14 // Store the new Cleanup position for irregular Cleanups. // // FIXME: Share this cleanup with the constructor call emission rather than // having it create a cleanup of its own. if (EndOfInit) Builder.CreateStore(CurPtr, EndOfInit); // Emit a constructor call loop to initialize the remaining elements. if (InitListElements) NumElements = Builder.CreateSub( NumElements, llvm::ConstantInt::get(NumElements->getType(), InitListElements)); EmitCXXAggrConstructorCall(Ctor, NumElements, CurPtr, CCE->arg_begin(), CCE->arg_end(), CCE->requiresZeroInitialization()); d827 2 a828 30 // If this is value-initialization, we can usually use memset. ImplicitValueInitExpr IVIE(ElementType); if (isa(Init)) { if (TryMemsetInitialization()) return; // Switch to an ImplicitValueInitExpr for the element type. This handles // only one case: multidimensional array new of pointers to members. In // all other cases, we already have an initializer for the array element. Init = &IVIE; } // At this point we should have found an initializer for the individual // elements of the array. assert(getContext().hasSameUnqualifiedType(ElementType, Init->getType()) && "got wrong type of element to initialize"); // If we have an empty initializer list, we can usually use memset. if (auto *ILE = dyn_cast(Init)) if (ILE->getNumInits() == 0 && TryMemsetInitialization()) return; // Create the loop blocks. llvm::BasicBlock *EntryBB = Builder.GetInsertBlock(); llvm::BasicBlock *LoopBB = createBasicBlock("new.loop"); llvm::BasicBlock *ContBB = createBasicBlock("new.loop.end"); // Find the end of the array, hoisted out of the loop. llvm::Value *EndPtr = Builder.CreateInBoundsGEP(BeginPtr, NumElements, "array.end"); d832 3 a834 2 if (!ConstNum) { llvm::Value *IsEmpty = Builder.CreateICmpEQ(CurPtr, EndPtr, d836 2 a837 1 Builder.CreateCondBr(IsEmpty, ContBB, LoopBB); d841 4 a844 1 EmitBlock(LoopBB); d847 13 a859 14 llvm::PHINode *CurPtrPhi = Builder.CreatePHI(CurPtr->getType(), 2, "array.cur"); CurPtrPhi->addIncoming(CurPtr, EntryBB); CurPtr = CurPtrPhi; // Store the new Cleanup position for irregular Cleanups. if (EndOfInit) Builder.CreateStore(CurPtr, EndOfInit); // Enter a partial-destruction Cleanup if necessary. if (!CleanupDominator && needsEHCleanup(DtorKind)) { pushRegularPartialArrayCleanup(BeginPtr, CurPtr, ElementType, getDestroyer(DtorKind)); Cleanup = EHStack.stable_begin(); CleanupDominator = Builder.CreateUnreachable(); d863 1 a863 1 StoreAnyExprIntoOneUnit(*this, Init, Init->getType(), CurPtr); d865 4 a868 4 // Leave the Cleanup if we entered one. if (CleanupDominator) { DeactivateCleanupBlock(Cleanup, CleanupDominator); CleanupDominator->eraseFromParent(); d871 12 d884 10 a893 3 llvm::Value *NextPtr = Builder.CreateConstInBoundsGEP1_32(CurPtr, 1, "array.next"); d896 3 a898 3 llvm::Value *IsEnd = Builder.CreateICmpEQ(NextPtr, EndPtr, "array.atend"); Builder.CreateCondBr(IsEnd, ContBB, LoopBB); CurPtrPhi->addIncoming(NextPtr, Builder.GetInsertBlock()); d900 1 a900 1 EmitBlock(ContBB); d903 8 d916 37 a952 5 if (E->isArray()) CGF.EmitNewArrayInitializer(E, ElementType, NewPtr, NumElements, AllocSizeWithoutCookie); else if (const Expr *Init = E->getInitializer()) StoreAnyExprIntoOneUnit(CGF, Init, E->getAllocatedType(), NewPtr); a989 18 RValue CodeGenFunction::EmitBuiltinNewDeleteCall(const FunctionProtoType *Type, const Expr *Arg, bool IsDelete) { CallArgList Args; const Stmt *ArgS = Arg; EmitCallArgs(Args, *Type->param_type_begin(), ConstExprIterator(&ArgS), ConstExprIterator(&ArgS + 1)); // Find the allocation or deallocation function that we're calling. ASTContext &Ctx = getContext(); DeclarationName Name = Ctx.DeclarationNames .getCXXOperatorName(IsDelete ? OO_Delete : OO_New); for (auto *Decl : Ctx.getTranslationUnitDecl()->lookup(Name)) if (auto *FD = dyn_cast(Decl)) if (Ctx.hasSameType(FD->getType(), QualType(Type, 0))) return EmitNewDeleteCall(*this, cast(Decl), Type, Args); llvm_unreachable("predeclared global operator new/delete is missing"); } d1558 6 a1563 8 static bool isGLValueFromPointerDeref(const Expr *E) { E = E->IgnoreParens(); if (const auto *CE = dyn_cast(E)) { if (!CE->getSubExpr()->isGLValue()) return false; return isGLValueFromPointerDeref(CE->getSubExpr()); } d1565 4 a1568 21 if (const auto *OVE = dyn_cast(E)) return isGLValueFromPointerDeref(OVE->getSourceExpr()); if (const auto *BO = dyn_cast(E)) if (BO->getOpcode() == BO_Comma) return isGLValueFromPointerDeref(BO->getRHS()); if (const auto *ACO = dyn_cast(E)) return isGLValueFromPointerDeref(ACO->getTrueExpr()) || isGLValueFromPointerDeref(ACO->getFalseExpr()); // C++11 [expr.sub]p1: // The expression E1[E2] is identical (by definition) to *((E1)+(E2)) if (isa(E)) return true; if (const auto *UO = dyn_cast(E)) if (UO->getOpcode() == UO_Deref) return true; return false; d1571 2 a1572 1 static llvm::Value *EmitTypeidFromVTable(CodeGenFunction &CGF, const Expr *E, d1581 3 a1583 8 // // However, this paragraph's intent is not clear. We choose a very generous // interpretation which implores us to consider comma operators, conditional // operators, parentheses and other such constructs. QualType SrcRecordTy = E->getType(); if (CGF.CGM.getCXXABI().shouldTypeidBeNullChecked( isGLValueFromPointerDeref(E), SrcRecordTy)) { llvm::BasicBlock *BadTypeidBlock = d1585 2 a1586 1 llvm::BasicBlock *EndBlock = CGF.createBasicBlock("typeid.end"); d1588 2 a1589 2 llvm::Value *IsNull = CGF.Builder.CreateIsNull(ThisPtr); CGF.Builder.CreateCondBr(IsNull, BadTypeidBlock, EndBlock); d1591 4 a1594 3 CGF.EmitBlock(BadTypeidBlock); CGF.CGM.getCXXABI().EmitBadTypeidCall(CGF); CGF.EmitBlock(EndBlock); d1597 6 a1602 2 return CGF.CGM.getCXXABI().EmitTypeid(CGF, SrcRecordTy, ThisPtr, StdTypeInfoPtrTy); d1629 167 d1804 1 a1804 2 if (!CGF.CGM.getCXXABI().EmitBadCastCall(CGF)) return nullptr; d1815 1 a1815 2 if (llvm::Value *T = EmitDynamicCastToNull(*this, DestTy)) return T; a1818 20 // C++ [expr.dynamic.cast]p7: // If T is "pointer to cv void," then the result is a pointer to the most // derived object pointed to by v. const PointerType *DestPTy = DestTy->getAs(); bool isDynamicCastToVoid; QualType SrcRecordTy; QualType DestRecordTy; if (DestPTy) { isDynamicCastToVoid = DestPTy->getPointeeType()->isVoidType(); SrcRecordTy = SrcTy->castAs()->getPointeeType(); DestRecordTy = DestPTy->getPointeeType(); } else { isDynamicCastToVoid = false; SrcRecordTy = SrcTy; DestRecordTy = DestTy->castAs()->getPointeeType(); } assert(SrcRecordTy->isRecordType() && "source type must be a record type!"); d1822 1 a1822 3 bool ShouldNullCheckSrcValue = CGM.getCXXABI().shouldDynamicCastCallBeNullChecked(SrcTy->isPointerType(), SrcRecordTy); d1837 1 a1837 9 if (isDynamicCastToVoid) { Value = CGM.getCXXABI().EmitDynamicCastToVoid(*this, Value, SrcRecordTy, DestTy); } else { assert(DestRecordTy->isRecordType() && "destination type must be a record type!"); Value = CGM.getCXXABI().EmitDynamicCastCall(*this, Value, SrcRecordTy, DestTy, DestRecordTy, CastEnd); } @ 1.1.1.7.2.1 log @Update LLVM to 3.6.1, requested by joerg in ticket 824. @ text @d27 9 a35 6 static RequiredArgs commonEmitCXXMemberOrOperatorCall( CodeGenFunction &CGF, const CXXMethodDecl *MD, llvm::Value *Callee, ReturnValueSlot ReturnValue, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, const CallExpr *CE, CallArgList &Args) { assert(CE == nullptr || isa(CE) || isa(CE)); d37 1 a37 1 "Trying to emit a member or operator call expr on a static method!"); d42 5 a46 7 SourceLocation CallLoc; if (CE) CallLoc = CE->getExprLoc(); CGF.EmitTypeCheck( isa(MD) ? CodeGenFunction::TCK_ConstructorCall : CodeGenFunction::TCK_MemberCall, CallLoc, This, CGF.getContext().getRecordType(MD->getParent())); d49 1 a49 1 Args.add(RValue::get(This), MD->getThisType(CGF.getContext())); d58 1 a58 1 d60 1 a60 12 if (CE) { // Special case: skip first argument of CXXOperatorCall (it is "this"). unsigned ArgsToSkip = isa(CE) ? 1 : 0; CGF.EmitCallArgs(Args, FPT, CE->arg_begin() + ArgsToSkip, CE->arg_end(), CE->getDirectCallee()); } else { assert( FPT->getNumParams() == 0 && "No CallExpr specified for function with non-zero number of arguments"); } return required; } a61 9 RValue CodeGenFunction::EmitCXXMemberOrOperatorCall( const CXXMethodDecl *MD, llvm::Value *Callee, ReturnValueSlot ReturnValue, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, const CallExpr *CE) { const FunctionProtoType *FPT = MD->getType()->castAs(); CallArgList Args; RequiredArgs required = commonEmitCXXMemberOrOperatorCall( *this, MD, Callee, ReturnValue, This, ImplicitParam, ImplicitParamTy, CE, Args); a65 11 RValue CodeGenFunction::EmitCXXStructorCall( const CXXMethodDecl *MD, llvm::Value *Callee, ReturnValueSlot ReturnValue, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, const CallExpr *CE, StructorType Type) { CallArgList Args; commonEmitCXXMemberOrOperatorCall(*this, MD, Callee, ReturnValue, This, ImplicitParam, ImplicitParamTy, CE, Args); return EmitCall(CGM.getTypes().arrangeCXXStructorDeclaration(MD, Type), Callee, ReturnValue, Args, MD); } d89 3 a91 2 return EmitCall(getContext().getPointerType(MD->getType()), Callee, CE, ReturnValue); d94 1 a94 3 bool HasQualifier = ME->hasQualifier(); NestedNameSpecifier *Qualifier = HasQualifier ? ME->getQualifier() : nullptr; bool IsArrow = ME->isArrow(); d96 1 a96 13 return EmitCXXMemberOrOperatorMemberCallExpr( CE, MD, ReturnValue, HasQualifier, Qualifier, IsArrow, Base); } RValue CodeGenFunction::EmitCXXMemberOrOperatorMemberCallExpr( const CallExpr *CE, const CXXMethodDecl *MD, ReturnValueSlot ReturnValue, bool HasQualifier, NestedNameSpecifier *Qualifier, bool IsArrow, const Expr *Base) { assert(isa(CE) || isa(CE)); // Compute the object pointer. bool CanUseVirtualCall = MD->isVirtual() && !HasQualifier; d105 1 a105 9 if (DevirtualizedMethod->getReturnType().getCanonicalType() != MD->getReturnType().getCanonicalType()) // If the return types are not the same, this might be a case where more // code needs to run to compensate for it. For example, the derived // method might return a type that inherits form from the return // type of MD and has a prefix. // For now we just avoid devirtualizing these covariant cases. DevirtualizedMethod = nullptr; else if (getCXXRecord(Inner) == DevirtualizedClass) d116 9 d128 1 a128 1 if (IsArrow) d140 15 a154 21 if (!MD->getParent()->mayInsertExtraPadding()) { if (MD->isCopyAssignmentOperator() || MD->isMoveAssignmentOperator()) { // We don't like to generate the trivial copy/move assignment operator // when it isn't necessary; just produce the proper effect here. // Special case: skip first argument of CXXOperatorCall (it is "this"). unsigned ArgsToSkip = isa(CE) ? 1 : 0; llvm::Value *RHS = EmitLValue(*(CE->arg_begin() + ArgsToSkip)).getAddress(); EmitAggregateAssign(This, RHS, CE->getType()); return RValue::get(This); } if (isa(MD) && cast(MD)->isCopyOrMoveConstructor()) { // Trivial move and copy ctor are the same. assert(CE->getNumArgs() == 1 && "unexpected argcount for trivial ctor"); llvm::Value *RHS = EmitLValue(*CE->arg_begin()).getAddress(); EmitAggregateCopy(This, RHS, CE->arg_begin()->getType()); return RValue::get(This); } llvm_unreachable("unknown trivial member function"); d156 1 d160 1 a160 2 const CXXMethodDecl *CalleeDecl = DevirtualizedMethod ? DevirtualizedMethod : MD; d162 6 a167 6 if (const auto *Dtor = dyn_cast(CalleeDecl)) FInfo = &CGM.getTypes().arrangeCXXStructorDeclaration( Dtor, StructorType::Complete); else if (const auto *Ctor = dyn_cast(CalleeDecl)) FInfo = &CGM.getTypes().arrangeCXXStructorDeclaration( Ctor, StructorType::Complete); d187 2 a188 2 CGM.getCXXABI().EmitVirtualDestructorCall( *this, Dtor, Dtor_Complete, This, cast(CE)); d190 4 a193 2 if (getLangOpts().AppleKext && MD->isVirtual() && HasQualifier) Callee = BuildAppleKextVirtualCall(MD, Qualifier, Ty); d195 1 a195 2 Callee = CGM.getAddrOfCXXStructor(Dtor, StructorType::Complete, FInfo, Ty); d201 2 a202 2 EmitCXXMemberOrOperatorCall(MD, Callee, ReturnValue, This, /*ImplicitParam=*/nullptr, QualType(), CE); d212 4 a215 2 if (getLangOpts().AppleKext && MD->isVirtual() && HasQualifier) Callee = BuildAppleKextVirtualCall(MD, Qualifier, Ty); d228 3 a230 2 return EmitCXXMemberOrOperatorCall(MD, Callee, ReturnValue, This, /*ImplicitParam=*/nullptr, QualType(), CE); d278 1 a278 1 EmitCallArgs(Args, FPT, E->arg_begin(), E->arg_end(), E->getDirectCallee()); d289 15 a303 3 return EmitCXXMemberOrOperatorMemberCallExpr( E, MD, ReturnValue, /*HasQualifier=*/false, /*Qualifier=*/nullptr, /*IsArrow=*/false, E->getArg(0)); d395 2 a396 1 EmitCXXAggrConstructorCall(CD, arrayType, Dest.getAddr(), E); d423 1 a423 1 E); d448 1 a448 1 EmitSynthesizedCXXCopyCtorCall(CD, Dest, Src, E); d729 3 a731 2 CGF.EmitScalarInit(Init, nullptr, CGF.MakeAddrLValue(NewPtr, AllocType, Alignment), false); d898 2 a899 1 EmitCXXAggrConstructorCall(Ctor, NumElements, CurPtr, CCE, a989 1 ApplyDebugLocation DL(CGF, E->getStartLoc()); d1006 3 a1008 3 CGF.EmitCall(CGF.CGM.getTypes().arrangeFreeFunctionCall( Args, CalleeType, /*chainCall=*/false), CalleeAddr, ReturnValueSlot(), Args, Callee, &CallOrInvoke); d1229 1 a1229 1 d1234 4 a1237 3 EmitCallArgs(allocatorArgs, allocatorType, E->placement_arg_begin(), E->placement_arg_end(), /* CalleeDecl */ nullptr, /*ParamsToSkip*/ 1); a1388 8 void CodeGenFunction::pushCallObjectDeleteCleanup(const FunctionDecl *OperatorDelete, llvm::Value *CompletePtr, QualType ElementType) { EHStack.pushCleanup(NormalAndEHCleanup, CompletePtr, OperatorDelete, ElementType); } d1391 1 a1391 1 const CXXDeleteExpr *DE, d1393 2 a1394 1 QualType ElementType) { d1404 23 a1426 2 CGF.CGM.getCXXABI().emitVirtualObjectDelete(CGF, DE, Ptr, ElementType, Dtor); a1434 1 const FunctionDecl *OperatorDelete = DE->getOperatorDelete(); d1611 2 a1612 1 EmitObjectDelete(*this, E, Ptr, DeleteTy); d1803 2 a1804 2 LValue SlotLV = MakeAddrLValue(Slot.getAddr(), E->getType(), Slot.getAlignment()); d1811 1 d1813 4 a1816 9 if (CurField->hasCapturedVLAType()) { auto VAT = CurField->getCapturedVLAType(); EmitStoreThroughLValue(RValue::get(VLASizeMap[VAT->getSizeExpr()]), LV); } else { ArrayRef ArrayIndexes; if (CurField->getType()->isArrayType()) ArrayIndexes = E->getCaptureInitIndexVars(i); EmitInitializerForField(*CurField, LV, *i, ArrayIndexes); } @ 1.1.1.8 log @Import Clang 3.6RC1 r227398. @ text @d27 9 a35 6 static RequiredArgs commonEmitCXXMemberOrOperatorCall( CodeGenFunction &CGF, const CXXMethodDecl *MD, llvm::Value *Callee, ReturnValueSlot ReturnValue, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, const CallExpr *CE, CallArgList &Args) { assert(CE == nullptr || isa(CE) || isa(CE)); d37 1 a37 1 "Trying to emit a member or operator call expr on a static method!"); d42 5 a46 7 SourceLocation CallLoc; if (CE) CallLoc = CE->getExprLoc(); CGF.EmitTypeCheck( isa(MD) ? CodeGenFunction::TCK_ConstructorCall : CodeGenFunction::TCK_MemberCall, CallLoc, This, CGF.getContext().getRecordType(MD->getParent())); d49 1 a49 1 Args.add(RValue::get(This), MD->getThisType(CGF.getContext())); d58 1 a58 1 d60 1 a60 12 if (CE) { // Special case: skip first argument of CXXOperatorCall (it is "this"). unsigned ArgsToSkip = isa(CE) ? 1 : 0; CGF.EmitCallArgs(Args, FPT, CE->arg_begin() + ArgsToSkip, CE->arg_end(), CE->getDirectCallee()); } else { assert( FPT->getNumParams() == 0 && "No CallExpr specified for function with non-zero number of arguments"); } return required; } a61 9 RValue CodeGenFunction::EmitCXXMemberOrOperatorCall( const CXXMethodDecl *MD, llvm::Value *Callee, ReturnValueSlot ReturnValue, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, const CallExpr *CE) { const FunctionProtoType *FPT = MD->getType()->castAs(); CallArgList Args; RequiredArgs required = commonEmitCXXMemberOrOperatorCall( *this, MD, Callee, ReturnValue, This, ImplicitParam, ImplicitParamTy, CE, Args); a65 11 RValue CodeGenFunction::EmitCXXStructorCall( const CXXMethodDecl *MD, llvm::Value *Callee, ReturnValueSlot ReturnValue, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, const CallExpr *CE, StructorType Type) { CallArgList Args; commonEmitCXXMemberOrOperatorCall(*this, MD, Callee, ReturnValue, This, ImplicitParam, ImplicitParamTy, CE, Args); return EmitCall(CGM.getTypes().arrangeCXXStructorDeclaration(MD, Type), Callee, ReturnValue, Args, MD); } d89 3 a91 2 return EmitCall(getContext().getPointerType(MD->getType()), Callee, CE, ReturnValue); d94 1 a94 3 bool HasQualifier = ME->hasQualifier(); NestedNameSpecifier *Qualifier = HasQualifier ? ME->getQualifier() : nullptr; bool IsArrow = ME->isArrow(); d96 1 a96 13 return EmitCXXMemberOrOperatorMemberCallExpr( CE, MD, ReturnValue, HasQualifier, Qualifier, IsArrow, Base); } RValue CodeGenFunction::EmitCXXMemberOrOperatorMemberCallExpr( const CallExpr *CE, const CXXMethodDecl *MD, ReturnValueSlot ReturnValue, bool HasQualifier, NestedNameSpecifier *Qualifier, bool IsArrow, const Expr *Base) { assert(isa(CE) || isa(CE)); // Compute the object pointer. bool CanUseVirtualCall = MD->isVirtual() && !HasQualifier; d105 1 a105 9 if (DevirtualizedMethod->getReturnType().getCanonicalType() != MD->getReturnType().getCanonicalType()) // If the return types are not the same, this might be a case where more // code needs to run to compensate for it. For example, the derived // method might return a type that inherits form from the return // type of MD and has a prefix. // For now we just avoid devirtualizing these covariant cases. DevirtualizedMethod = nullptr; else if (getCXXRecord(Inner) == DevirtualizedClass) d116 9 d128 1 a128 1 if (IsArrow) d140 15 a154 21 if (!MD->getParent()->mayInsertExtraPadding()) { if (MD->isCopyAssignmentOperator() || MD->isMoveAssignmentOperator()) { // We don't like to generate the trivial copy/move assignment operator // when it isn't necessary; just produce the proper effect here. // Special case: skip first argument of CXXOperatorCall (it is "this"). unsigned ArgsToSkip = isa(CE) ? 1 : 0; llvm::Value *RHS = EmitLValue(*(CE->arg_begin() + ArgsToSkip)).getAddress(); EmitAggregateAssign(This, RHS, CE->getType()); return RValue::get(This); } if (isa(MD) && cast(MD)->isCopyOrMoveConstructor()) { // Trivial move and copy ctor are the same. assert(CE->getNumArgs() == 1 && "unexpected argcount for trivial ctor"); llvm::Value *RHS = EmitLValue(*CE->arg_begin()).getAddress(); EmitAggregateCopy(This, RHS, CE->arg_begin()->getType()); return RValue::get(This); } llvm_unreachable("unknown trivial member function"); d156 1 d160 1 a160 2 const CXXMethodDecl *CalleeDecl = DevirtualizedMethod ? DevirtualizedMethod : MD; d162 6 a167 6 if (const auto *Dtor = dyn_cast(CalleeDecl)) FInfo = &CGM.getTypes().arrangeCXXStructorDeclaration( Dtor, StructorType::Complete); else if (const auto *Ctor = dyn_cast(CalleeDecl)) FInfo = &CGM.getTypes().arrangeCXXStructorDeclaration( Ctor, StructorType::Complete); d187 2 a188 2 CGM.getCXXABI().EmitVirtualDestructorCall( *this, Dtor, Dtor_Complete, This, cast(CE)); d190 4 a193 2 if (getLangOpts().AppleKext && MD->isVirtual() && HasQualifier) Callee = BuildAppleKextVirtualCall(MD, Qualifier, Ty); d195 1 a195 2 Callee = CGM.getAddrOfCXXStructor(Dtor, StructorType::Complete, FInfo, Ty); d201 2 a202 2 EmitCXXMemberOrOperatorCall(MD, Callee, ReturnValue, This, /*ImplicitParam=*/nullptr, QualType(), CE); d212 4 a215 2 if (getLangOpts().AppleKext && MD->isVirtual() && HasQualifier) Callee = BuildAppleKextVirtualCall(MD, Qualifier, Ty); d228 3 a230 2 return EmitCXXMemberOrOperatorCall(MD, Callee, ReturnValue, This, /*ImplicitParam=*/nullptr, QualType(), CE); d278 1 a278 1 EmitCallArgs(Args, FPT, E->arg_begin(), E->arg_end(), E->getDirectCallee()); d289 15 a303 3 return EmitCXXMemberOrOperatorMemberCallExpr( E, MD, ReturnValue, /*HasQualifier=*/false, /*Qualifier=*/nullptr, /*IsArrow=*/false, E->getArg(0)); d395 2 a396 1 EmitCXXAggrConstructorCall(CD, arrayType, Dest.getAddr(), E); d423 1 a423 1 E); d448 1 a448 1 EmitSynthesizedCXXCopyCtorCall(CD, Dest, Src, E); d729 3 a731 2 CGF.EmitScalarInit(Init, nullptr, CGF.MakeAddrLValue(NewPtr, AllocType, Alignment), false); d898 2 a899 1 EmitCXXAggrConstructorCall(Ctor, NumElements, CurPtr, CCE, a989 1 ApplyDebugLocation DL(CGF, E->getStartLoc()); d1006 3 a1008 3 CGF.EmitCall(CGF.CGM.getTypes().arrangeFreeFunctionCall( Args, CalleeType, /*chainCall=*/false), CalleeAddr, ReturnValueSlot(), Args, Callee, &CallOrInvoke); d1229 1 a1229 1 d1234 4 a1237 3 EmitCallArgs(allocatorArgs, allocatorType, E->placement_arg_begin(), E->placement_arg_end(), /* CalleeDecl */ nullptr, /*ParamsToSkip*/ 1); a1388 8 void CodeGenFunction::pushCallObjectDeleteCleanup(const FunctionDecl *OperatorDelete, llvm::Value *CompletePtr, QualType ElementType) { EHStack.pushCleanup(NormalAndEHCleanup, CompletePtr, OperatorDelete, ElementType); } d1391 1 a1391 1 const CXXDeleteExpr *DE, d1393 2 a1394 1 QualType ElementType) { d1404 23 a1426 2 CGF.CGM.getCXXABI().emitVirtualObjectDelete(CGF, DE, Ptr, ElementType, Dtor); a1434 1 const FunctionDecl *OperatorDelete = DE->getOperatorDelete(); d1611 2 a1612 1 EmitObjectDelete(*this, E, Ptr, DeleteTy); d1803 2 a1804 2 LValue SlotLV = MakeAddrLValue(Slot.getAddr(), E->getType(), Slot.getAlignment()); d1811 1 d1813 4 a1816 9 if (CurField->hasCapturedVLAType()) { auto VAT = CurField->getCapturedVLAType(); EmitStoreThroughLValue(RValue::get(VLASizeMap[VAT->getSizeExpr()]), LV); } else { ArrayRef ArrayIndexes; if (CurField->getType()->isArrayType()) ArrayIndexes = E->getCaptureInitIndexVars(i); EmitInitializerForField(*CurField, LV, *i, ArrayIndexes); } @ 1.1.1.9 log @Import Clang 3.8.0rc3 r261930. @ text @d62 1 a62 1 CGF.EmitCallArgs(Args, FPT, drop_begin(CE->arguments(), ArgsToSkip), d169 1 a169 1 Address This = Address::invalid(); d171 1 a171 1 This = EmitPointerWithAlignment(Base); d176 1 a176 1 if (MD->isTrivial() || (MD->isDefaulted() && MD->getParent()->isUnion())) { d188 2 a189 1 Address RHS = EmitLValue(*(CE->arg_begin() + ArgsToSkip)).getAddress(); d191 1 a191 1 return RValue::get(This.getPointer()); d198 3 a200 3 Address RHS = EmitLValue(*CE->arg_begin()).getAddress(); EmitAggregateCopy(This, RHS, (*CE->arg_begin())->getType()); return RValue::get(This.getPointer()); d248 1 a248 1 EmitCXXMemberOrOperatorCall(MD, Callee, ReturnValue, This.getPointer(), d257 1 a257 2 Callee = CGM.getCXXABI().getVirtualFunctionPointer(*this, MD, This, Ty, CE->getLocStart()); a258 6 if (SanOpts.has(SanitizerKind::CFINVCall) && MD->getParent()->isDynamicClass()) { llvm::Value *VTable = GetVTablePtr(This, Int8PtrTy, MD->getParent()); EmitVTablePtrCheckForCall(MD, VTable, CFITCK_NVCall, CE->getLocStart()); } d273 1 a273 1 return EmitCXXMemberOrOperatorCall(MD, Callee, ReturnValue, This.getPointer(), d297 2 a298 1 Address This = Address::invalid(); d300 1 a300 1 This = EmitPointerWithAlignment(BaseExpr); d304 1 a304 1 EmitTypeCheck(TCK_MemberCall, E->getExprLoc(), This.getPointer(), a307 1 llvm::Value *ThisPtrForCall = nullptr; d309 1 a309 2 CGM.getCXXABI().EmitLoadOfMemberFunctionPointer(*this, BO, This, ThisPtrForCall, MemFnPtr, MPT); d317 1 a317 1 Args.add(RValue::get(ThisPtrForCall), ThisType); d322 1 a322 1 EmitCallArgs(Args, FPT, E->arguments(), E->getDirectCallee()); d344 1 a344 1 Address DestPtr, d349 1 a349 1 DestPtr = CGF.Builder.CreateElementBitCast(DestPtr, CGF.Int8Ty); d352 2 a353 1 CharUnits NVSize = Layout.getNonVirtualSize(); d355 1 a355 27 // We cannot simply zero-initialize the entire base sub-object if vbptrs are // present, they are initialized by the most derived class before calling the // constructor. SmallVector, 1> Stores; Stores.emplace_back(CharUnits::Zero(), NVSize); // Each store is split by the existence of a vbptr. CharUnits VBPtrWidth = CGF.getPointerSize(); std::vector VBPtrOffsets = CGF.CGM.getCXXABI().getVBPtrOffsets(Base); for (CharUnits VBPtrOffset : VBPtrOffsets) { std::pair LastStore = Stores.pop_back_val(); CharUnits LastStoreOffset = LastStore.first; CharUnits LastStoreSize = LastStore.second; CharUnits SplitBeforeOffset = LastStoreOffset; CharUnits SplitBeforeSize = VBPtrOffset - SplitBeforeOffset; assert(!SplitBeforeSize.isNegative() && "negative store size!"); if (!SplitBeforeSize.isZero()) Stores.emplace_back(SplitBeforeOffset, SplitBeforeSize); CharUnits SplitAfterOffset = VBPtrOffset + VBPtrWidth; CharUnits SplitAfterSize = LastStoreSize - SplitAfterOffset; assert(!SplitAfterSize.isNegative() && "negative store size!"); if (!SplitAfterSize.isZero()) Stores.emplace_back(SplitAfterOffset, SplitAfterSize); } d363 2 a364 6 llvm::Constant *NullConstantForBase = CGF.CGM.EmitNullConstantForBase(Base); if (!NullConstantForBase->isNullValue()) { llvm::GlobalVariable *NullVariable = new llvm::GlobalVariable( CGF.CGM.getModule(), NullConstantForBase->getType(), /*isConstant=*/true, llvm::GlobalVariable::PrivateLinkage, NullConstantForBase, Twine()); d366 5 a370 2 CharUnits Align = std::max(Layout.getNonVirtualAlignment(), DestPtr.getAlignment()); d372 1 a372 2 Address SrcPtr = Address(CGF.EmitCastToVoidPtr(NullVariable), Align); d375 4 a378 10 for (std::pair Store : Stores) { CharUnits StoreOffset = Store.first; CharUnits StoreSize = Store.second; llvm::Value *StoreSizeVal = CGF.CGM.getSize(StoreSize); CGF.Builder.CreateMemCpy( CGF.Builder.CreateConstInBoundsByteGEP(DestPtr, StoreOffset), CGF.Builder.CreateConstInBoundsByteGEP(SrcPtr, StoreOffset), StoreSizeVal); } d382 2 a383 10 } else { for (std::pair Store : Stores) { CharUnits StoreOffset = Store.first; CharUnits StoreSize = Store.second; llvm::Value *StoreSizeVal = CGF.CGM.getSize(StoreSize); CGF.Builder.CreateMemSet( CGF.Builder.CreateConstInBoundsByteGEP(DestPtr, StoreOffset), CGF.Builder.getInt8(0), StoreSizeVal); } } d400 1 a400 1 EmitNullInitialization(Dest.getAddress(), E->getType()); d404 1 a404 2 EmitNullBaseClassInitialization(*this, Dest.getAddress(), CD->getParent()); d427 1 a427 1 EmitCXXAggrConstructorCall(CD, arrayType, Dest.getAddress(), E); d453 2 a454 2 EmitCXXConstructorCall(CD, Type, ForVirtualBase, Delegating, Dest.getAddress(), E); d458 4 a461 2 void CodeGenFunction::EmitSynthesizedCXXCopyCtor(Address Dest, Address Src, const Expr *Exp) { d687 1 a687 1 CGF.Builder.CreateCall(umul_with_overflow, {size, tsmV}); d726 1 a726 1 CGF.Builder.CreateCall(uadd_with_overflow, {size, cookieSizeV}); d755 1 a755 1 QualType AllocType, Address NewPtr) { d757 1 d761 1 a761 1 CGF.MakeAddrLValue(NewPtr, AllocType), false); d764 2 a765 1 CGF.EmitComplexExprIntoLValue(Init, CGF.MakeAddrLValue(NewPtr, AllocType), d770 1 a770 1 = AggValueSlot::forAddr(NewPtr, AllocType.getQualifiers(), d781 6 a786 4 void CodeGenFunction::EmitNewArrayInitializer( const CXXNewExpr *E, QualType ElementType, llvm::Type *ElementTy, Address BeginPtr, llvm::Value *NumElements, llvm::Value *AllocSizeWithoutCookie) { d792 1 a792 1 Address CurPtr = BeginPtr; d797 1 a797 1 Address EndOfInit = Address::invalid(); a801 4 CharUnits ElementSize = getContext().getTypeSizeInChars(ElementType); CharUnits ElementAlign = BeginPtr.getAlignment().alignmentOfArrayElement(ElementSize); d811 3 a813 2 ElementTy = ConvertTypeForMem(AllocType); CurPtr = Builder.CreateElementBitCast(CurPtr, ElementTy); d823 3 a825 5 EndOfInit = CreateTempAlloca(BeginPtr.getType(), getPointerAlign(), "array.init.end"); CleanupDominator = Builder.CreateStore(BeginPtr.getPointer(), EndOfInit); pushIrregularPartialArrayCleanup(BeginPtr.getPointer(), EndOfInit, ElementType, ElementAlign, a829 1 CharUnits StartAlign = CurPtr.getAlignment(); d834 3 a836 5 if (EndOfInit.isValid()) { auto FinishedPtr = Builder.CreateBitCast(CurPtr.getPointer(), BeginPtr.getType()); Builder.CreateStore(FinishedPtr, EndOfInit); } d842 1 a842 4 CurPtr = Address(Builder.CreateInBoundsGEP(CurPtr.getPointer(), Builder.getSize(1), "array.exp.next"), StartAlign.alignmentAtOffset((i + 1) * ElementSize)); d860 1 a860 1 CurPtr = Builder.CreateBitCast(CurPtr, BeginPtr.getType()); d885 3 a887 1 Builder.CreateMemSet(CurPtr, Builder.getInt8(0), RemainingSize, false); d921 1 a921 2 if (EndOfInit.isValid()) Builder.CreateStore(CurPtr.getPointer(), EndOfInit); a954 19 // If we have a struct whose every field is value-initialized, we can // usually use memset. if (auto *ILE = dyn_cast(Init)) { if (const RecordType *RType = ILE->getType()->getAs()) { if (RType->getDecl()->isStruct()) { unsigned NumFields = 0; for (auto *Field : RType->getDecl()->fields()) if (!Field->isUnnamedBitfield()) ++NumFields; if (ILE->getNumInits() == NumFields) for (unsigned i = 0, e = ILE->getNumInits(); i != e; ++i) if (!isa(ILE->getInit(i))) --NumFields; if (ILE->getNumInits() == NumFields && TryMemsetInitialization()) return; } } } d962 1 a962 1 Builder.CreateInBoundsGEP(BeginPtr.getPointer(), NumElements, "array.end"); d967 2 a968 2 llvm::Value *IsEmpty = Builder.CreateICmpEQ(CurPtr.getPointer(), EndPtr, "array.isempty"); d977 3 a979 4 Builder.CreatePHI(CurPtr.getType(), 2, "array.cur"); CurPtrPhi->addIncoming(CurPtr.getPointer(), EntryBB); CurPtr = Address(CurPtrPhi, ElementAlign); d982 1 a982 2 if (EndOfInit.isValid()) Builder.CreateStore(CurPtr.getPointer(), EndOfInit); d986 1 a986 2 pushRegularPartialArrayCleanup(BeginPtr.getPointer(), CurPtr.getPointer(), ElementType, ElementAlign, d1003 1 a1003 2 Builder.CreateConstInBoundsGEP1_32(ElementTy, CurPtr.getPointer(), 1, "array.next"); d1015 3 a1017 2 QualType ElementType, llvm::Type *ElementTy, Address NewPtr, llvm::Value *NumElements, d1019 1 a1019 1 ApplyDebugLocation DL(CGF, E); d1021 1 a1021 1 CGF.EmitNewArrayInitializer(E, ElementType, ElementTy, NewPtr, NumElements, d1067 2 a1068 1 EmitCallArgs(Args, *Type->param_type_begin(), llvm::makeArrayRef(ArgS)); d1083 1 a1083 1 class CallDeleteDuringNew final : public EHScopeStack::Cleanup { d1136 1 a1136 1 class CallDeleteDuringConditionalNew final : public EHScopeStack::Cleanup { d1197 1 a1197 1 Address NewPtr, d1207 1 a1207 2 NewPtr.getPointer(), AllocSize); d1216 1 a1216 1 DominatingValue::save(CGF, RValue::get(NewPtr.getPointer())); d1239 7 d1260 8 d1270 1 a1270 2 Address allocation = Address::invalid(); CallArgList allocatorArgs; d1272 4 a1275 22 assert(E->getNumPlacementArgs() == 1); const Expr *arg = *E->placement_arguments().begin(); AlignmentSource alignSource; allocation = EmitPointerWithAlignment(arg, &alignSource); // The pointer expression will, in many cases, be an opaque void*. // In these cases, discard the computed alignment and use the // formal alignment of the allocated type. if (alignSource != AlignmentSource::Decl) { allocation = Address(allocation.getPointer(), getContext().getTypeAlignInChars(allocType)); } // Set up allocatorArgs for the call to operator delete if it's not // the reserved global operator. if (E->getOperatorDelete() && !E->getOperatorDelete()->isReservedGlobalPlacementOperator()) { allocatorArgs.add(RValue::get(allocSize), getContext().getSizeType()); allocatorArgs.add(RValue::get(allocation.getPointer()), arg->getType()); } d1277 1 a1277 27 const FunctionProtoType *allocatorType = allocator->getType()->castAs(); // The allocation size is the first argument. QualType sizeType = getContext().getSizeType(); allocatorArgs.add(RValue::get(allocSize), sizeType); // We start at 1 here because the first argument (the allocation size) // has already been emitted. EmitCallArgs(allocatorArgs, allocatorType, E->placement_arguments(), /* CalleeDecl */ nullptr, /*ParamsToSkip*/ 1); RValue RV = EmitNewDeleteCall(*this, allocator, allocatorType, allocatorArgs); // For now, only assume that the allocation function returns // something satisfactorily aligned for the element type, plus // the cookie if we have one. CharUnits allocationAlign = getContext().getTypeAlignInChars(allocType); if (allocSize != allocSizeWithoutCookie) { CharUnits cookieAlign = getSizeAlign(); // FIXME? allocationAlign = std::max(allocationAlign, cookieAlign); } allocation = Address(RV.getScalarVal(), allocationAlign); d1282 2 a1283 1 // exception spec or is the reserved placement new) and we have an d1285 1 a1285 1 bool nullCheck = E->shouldNullCheckAllocation(getContext()) && d1291 3 d1305 1 a1305 2 llvm::Value *isNull = Builder.CreateIsNull(allocation.getPointer(), "new.isnull"); d1330 3 a1332 2 llvm::Type *elementTy = ConvertTypeForMem(allocType); Address result = Builder.CreateElementBitCast(allocation, elementTy); d1334 1 a1334 9 // Passing pointer through invariant.group.barrier to avoid propagation of // vptrs information which may be included in previous type. if (CGM.getCodeGenOpts().StrictVTablePointers && CGM.getCodeGenOpts().OptimizationLevel > 0 && allocator->isReservedGlobalPlacementOperator()) result = Address(Builder.CreateInvariantGroupBarrier(result.getPointer()), result.getAlignment()); EmitNewInitializer(*this, E, allocType, elementTy, result, numElements, d1341 1 a1341 1 if (result.getType() != resultType) a1351 1 llvm::Value *resultPtr = result.getPointer(); d1358 3 a1360 3 llvm::PHINode *PHI = Builder.CreatePHI(resultPtr->getType(), 2); PHI->addIncoming(resultPtr, notNullBB); PHI->addIncoming(llvm::Constant::getNullValue(resultPtr->getType()), d1363 1 a1363 1 resultPtr = PHI; d1366 1 a1366 1 return resultPtr; d1402 1 a1402 1 struct CallObjectDelete final : EHScopeStack::Cleanup { d1429 1 a1429 1 Address Ptr, d1452 1 a1452 2 Ptr.getPointer(), OperatorDelete, ElementType); d1459 3 a1461 2 else if (auto Lifetime = ElementType.getObjCLifetime()) { switch (Lifetime) { d1467 6 a1472 2 case Qualifiers::OCL_Strong: CGF.EmitARCDestroyStrong(Ptr, ARCPreciseLifetime); d1474 1 d1487 1 a1487 1 struct CallArrayDelete final : EHScopeStack::Cleanup { d1527 1 a1527 2 if (NumElements) Size = CGF.Builder.CreateMul(Size, NumElements); d1548 1 a1548 1 Address deletedPtr, a1568 5 CharUnits elementSize = CGF.getContext().getTypeSizeInChars(elementType); CharUnits elementAlign = deletedPtr.getAlignment().alignmentOfArrayElement(elementSize); llvm::Value *arrayBegin = deletedPtr.getPointer(); d1570 1 a1570 1 CGF.Builder.CreateInBoundsGEP(arrayBegin, numElements, "delete.end"); d1575 1 a1575 1 CGF.emitArrayDestroy(arrayBegin, arrayEnd, elementType, elementAlign, d1587 1 a1587 1 Address Ptr = EmitPointerWithAlignment(Arg); d1593 1 a1593 1 llvm::Value *IsNull = Builder.CreateIsNull(Ptr.getPointer(), "isnull"); d1618 1 a1618 2 Ptr = Address(Builder.CreateInBoundsGEP(Ptr.getPointer(), GEP, "del.first"), Ptr.getAlignment()); d1621 2 a1622 1 assert(ConvertTypeForMem(DeleteTy) == Ptr.getElementType()); d1668 1 a1668 1 Address ThisPtr = CGF.EmitLValue(E).getAddress(); d1685 1 a1685 1 llvm::Value *IsNull = CGF.Builder.CreateIsNull(ThisPtr.getPointer()); d1736 1 a1736 1 llvm::Value *CodeGenFunction::EmitDynamicCast(Address ThisAddr, a1737 1 CGM.EmitExplicitCastExprType(DCE, this); d1781 1 a1781 1 llvm::Value *IsNull = Builder.CreateIsNull(ThisAddr.getPointer()); a1785 1 llvm::Value *Value; d1787 1 a1787 1 Value = CGM.getCXXABI().EmitDynamicCastToVoid(*this, ThisAddr, SrcRecordTy, d1792 1 a1792 1 Value = CGM.getCXXABI().EmitDynamicCastCall(*this, ThisAddr, SrcRecordTy, a1793 1 CastNotNull = Builder.GetInsertBlock(); d1818 2 a1819 1 LValue SlotLV = MakeAddrLValue(Slot.getAddress(), E->getType()); d1822 2 a1823 2 for (LambdaExpr::const_capture_init_iterator i = E->capture_init_begin(), e = E->capture_init_end(); @ 1.1.1.9.2.1 log @Sync with HEAD @ text @d27 4 a30 5 static RequiredArgs commonEmitCXXMemberOrOperatorCall(CodeGenFunction &CGF, const CXXMethodDecl *MD, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, const CallExpr *CE, CallArgList &Args, CallArgList *RtlArgs) { d35 11 a45 1 ASTContext &C = CGF.getContext(); d48 1 a48 4 const CXXRecordDecl *RD = CGF.CGM.getCXXABI().getThisArgumentTypeForMethod(MD); Args.add(RValue::get(This), RD ? C.getPointerType(C.getTypeDeclType(RD)) : C.VoidPtrTy); d56 1 a56 1 RequiredArgs required = RequiredArgs::forPrototypePlus(FPT, Args.size(), MD); d59 1 a59 6 if (RtlArgs) { // Special case: if the caller emitted the arguments right-to-left already // (prior to emitting the *this argument), we're done. This happens for // assignment operators. Args.addFrom(*RtlArgs); } else if (CE) { d73 1 a73 2 const CXXMethodDecl *MD, const CGCallee &Callee, ReturnValueSlot ReturnValue, d75 1 a75 1 const CallExpr *CE, CallArgList *RtlArgs) { d79 4 a82 3 *this, MD, This, ImplicitParam, ImplicitParamTy, CE, Args, RtlArgs); auto &FnInfo = CGM.getTypes().arrangeCXXMethodCall(Args, FPT, required); return EmitCall(FnInfo, Callee, ReturnValue, Args); d85 4 a88 4 RValue CodeGenFunction::EmitCXXDestructorCall( const CXXDestructorDecl *DD, const CGCallee &Callee, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, const CallExpr *CE, StructorType Type) { d90 4 a93 55 commonEmitCXXMemberOrOperatorCall(*this, DD, This, ImplicitParam, ImplicitParamTy, CE, Args, nullptr); return EmitCall(CGM.getTypes().arrangeCXXStructorDeclaration(DD, Type), Callee, ReturnValueSlot(), Args); } RValue CodeGenFunction::EmitCXXPseudoDestructorExpr( const CXXPseudoDestructorExpr *E) { QualType DestroyedType = E->getDestroyedType(); if (DestroyedType.hasStrongOrWeakObjCLifetime()) { // Automatic Reference Counting: // If the pseudo-expression names a retainable object with weak or // strong lifetime, the object shall be released. Expr *BaseExpr = E->getBase(); Address BaseValue = Address::invalid(); Qualifiers BaseQuals; // If this is s.x, emit s as an lvalue. If it is s->x, emit s as a scalar. if (E->isArrow()) { BaseValue = EmitPointerWithAlignment(BaseExpr); const PointerType *PTy = BaseExpr->getType()->getAs(); BaseQuals = PTy->getPointeeType().getQualifiers(); } else { LValue BaseLV = EmitLValue(BaseExpr); BaseValue = BaseLV.getAddress(); QualType BaseTy = BaseExpr->getType(); BaseQuals = BaseTy.getQualifiers(); } switch (DestroyedType.getObjCLifetime()) { case Qualifiers::OCL_None: case Qualifiers::OCL_ExplicitNone: case Qualifiers::OCL_Autoreleasing: break; case Qualifiers::OCL_Strong: EmitARCRelease(Builder.CreateLoad(BaseValue, DestroyedType.isVolatileQualified()), ARCPreciseLifetime); break; case Qualifiers::OCL_Weak: EmitARCDestroyWeak(BaseValue); break; } } else { // C++ [expr.pseudo]p1: // The result shall only be used as the operand for the function call // operator (), and the result of such a call has type void. The only // effect is the evaluation of the postfix-expression before the dot or // arrow. EmitIgnoredExpr(E->getBase()); } return RValue::get(nullptr); d118 2 a119 2 CGCallee callee = CGCallee::forDirect(CGM.GetAddrOfFunction(MD), MD); return EmitCall(getContext().getPointerType(MD->getType()), callee, CE, a168 13 // C++17 demands that we evaluate the RHS of a (possibly-compound) assignment // operator before the LHS. CallArgList RtlArgStorage; CallArgList *RtlArgs = nullptr; if (auto *OCE = dyn_cast(CE)) { if (OCE->isAssignmentOp()) { RtlArgs = &RtlArgStorage; EmitCallArgs(*RtlArgs, MD->getType()->castAs(), drop_begin(CE->arguments(), 1), CE->getDirectCallee(), /*ParamsToSkip*/0, EvaluationOrder::ForceRightToLeft); } } d186 4 a189 6 LValue RHS = isa(CE) ? MakeNaturalAlignAddrLValue( (*RtlArgs)[0].RV.getScalarVal(), (*(CE->arg_begin() + 1))->getType()) : EmitLValue(*CE->arg_begin()); EmitAggregateAssign(This, RHS.getAddress(), CE->getType()); a219 16 // C++11 [class.mfct.non-static]p2: // If a non-static member function of a class X is called for an object that // is not of type X, or of a type derived from X, the behavior is undefined. SourceLocation CallLoc; ASTContext &C = getContext(); if (CE) CallLoc = CE->getExprLoc(); EmitTypeCheck(isa(CalleeDecl) ? CodeGenFunction::TCK_ConstructorCall : CodeGenFunction::TCK_MemberCall, CallLoc, This.getPointer(), C.getRecordType(CalleeDecl->getParent())); // FIXME: Uses of 'MD' past this point need to be audited. We may need to use // 'CalleeDecl' instead. d227 2 a228 1 a236 1 CGCallee Callee; d240 2 a241 3 Callee = CGCallee::forDirect( CGM.getAddrOfCXXStructor(Dtor, StructorType::Complete, FInfo, Ty), Dtor); d245 1 a245 3 Callee = CGCallee::forDirect( CGM.GetAddrOfFunction(GlobalDecl(DDtor, Dtor_Complete), Ty), DDtor); d247 2 a248 3 EmitCXXMemberOrOperatorCall( CalleeDecl, Callee, ReturnValue, This.getPointer(), /*ImplicitParam=*/nullptr, QualType(), CE, nullptr); a252 1 CGCallee Callee; d254 1 a254 3 Callee = CGCallee::forDirect( CGM.GetAddrOfFunction(GlobalDecl(Ctor, Ctor_Complete), Ty), Ctor); d262 1 a262 2 EmitVTablePtrCheckForCall(MD->getParent(), VTable, CFITCK_NVCall, CE->getLocStart()); d268 1 a268 1 Callee = CGCallee::forDirect(CGM.GetAddrOfFunction(MD, Ty), MD); d270 1 a270 3 Callee = CGCallee::forDirect( CGM.GetAddrOfFunction(DevirtualizedMethod, Ty), DevirtualizedMethod); d276 1 a276 1 *this, CalleeDecl, This, UseVirtualCall); d279 2 a280 3 return EmitCXXMemberOrOperatorCall( CalleeDecl, Callee, ReturnValue, This.getPointer(), /*ImplicitParam=*/nullptr, QualType(), CE, RtlArgs); d299 3 a311 3 // Get the member function pointer. llvm::Value *MemFnPtr = EmitScalarExpr(MemFnExpr); d314 1 a314 1 CGCallee Callee = d326 2 a327 3 RequiredArgs required = RequiredArgs::forPrototypePlus(FPT, 1, /*FD=*/nullptr); d329 1 a329 1 EmitCallArgs(Args, FPT, E->arguments()); a371 3 // Stop before we hit any virtual base pointers located in virtual bases. if (VBPtrOffset >= NVSize) break; d474 2 a475 2 if (const ArrayType *arrayType = getContext().getAsArrayType(E->getType())) { a848 26 // Attempt to perform zero-initialization using memset. auto TryMemsetInitialization = [&]() -> bool { // FIXME: If the type is a pointer-to-data-member under the Itanium ABI, // we can initialize with a memset to -1. if (!CGM.getTypes().isZeroInitializable(ElementType)) return false; // Optimization: since zero initialization will just set the memory // to all zeroes, generate a single memset to do it in one shot. // Subtract out the size of any elements we've already initialized. auto *RemainingSize = AllocSizeWithoutCookie; if (InitListElements) { // We know this can't overflow; we check this when doing the allocation. auto *InitializedSize = llvm::ConstantInt::get( RemainingSize->getType(), getContext().getTypeSizeInChars(ElementType).getQuantity() * InitListElements); RemainingSize = Builder.CreateSub(RemainingSize, InitializedSize); } // Create the memset. Builder.CreateMemSet(CurPtr, Builder.getInt8(0), RemainingSize, false); return true; }; a850 34 // Initializing from a (braced) string literal is a special case; the init // list element does not initialize a (single) array element. if (ILE->isStringLiteralInit()) { // Initialize the initial portion of length equal to that of the string // literal. The allocation must be for at least this much; we emitted a // check for that earlier. AggValueSlot Slot = AggValueSlot::forAddr(CurPtr, ElementType.getQualifiers(), AggValueSlot::IsDestructed, AggValueSlot::DoesNotNeedGCBarriers, AggValueSlot::IsNotAliased); EmitAggExpr(ILE->getInit(0), Slot); // Move past these elements. InitListElements = cast(ILE->getType()->getAsArrayTypeUnsafe()) ->getSize().getZExtValue(); CurPtr = Address(Builder.CreateInBoundsGEP(CurPtr.getPointer(), Builder.getSize(InitListElements), "string.init.end"), CurPtr.getAlignment().alignmentAtOffset(InitListElements * ElementSize)); // Zero out the rest, if any remain. llvm::ConstantInt *ConstNum = dyn_cast(NumElements); if (!ConstNum || !ConstNum->equalsInt(InitListElements)) { bool OK = TryMemsetInitialization(); (void)OK; assert(OK && "couldn't memset character type?"); } return; } d917 26 d1013 1 a1013 3 unsigned NumElements = 0; if (auto *CXXRD = dyn_cast(RType->getDecl())) NumElements = CXXRD->getNumBases(); d1016 2 a1017 3 ++NumElements; // FIXME: Recurse into nested InitListExprs. if (ILE->getNumInits() == NumElements) d1020 2 a1021 2 --NumElements; if (ILE->getNumInits() == NumElements && TryMemsetInitialization()) d1105 1 a1105 1 const FunctionDecl *CalleeDecl, d1109 1 a1109 2 llvm::Constant *CalleePtr = CGF.CGM.GetAddrOfFunction(CalleeDecl); CGCallee Callee = CGCallee::forDirect(CalleePtr, CalleeDecl); d1113 1 a1113 1 Callee, ReturnValueSlot(), Args, &CallOrInvoke); d1120 2 a1121 2 llvm::Function *Fn = dyn_cast(CalleePtr); if (CalleeDecl->isReplaceableGlobalAllocationFunction() && d1154 10 a1163 3 static std::pair shouldPassSizeAndAlignToUsualDelete(const FunctionProtoType *FPT) { auto AI = FPT->param_type_begin(), AE = FPT->param_type_end(); d1165 11 a1175 2 // The first argument is always a void*. ++AI; d1177 4 a1180 3 // Figure out what other parameters we should be implicitly passing. bool PassSize = false; bool PassAlignment = false; d1182 11 a1192 4 if (AI != AE && (*AI)->isIntegerType()) { PassSize = true; ++AI; } d1194 3 a1196 4 if (AI != AE && (*AI)->isAlignValT()) { PassAlignment = true; ++AI; } d1198 3 a1200 3 assert(AI == AE && "unexpected usual deallocation function parameter"); return {PassSize, PassAlignment}; } d1202 4 a1205 14 namespace { /// A cleanup to call the given 'operator delete' function upon abnormal /// exit from a new expression. Templated on a traits type that deals with /// ensuring that the arguments dominate the cleanup if necessary. template class CallDeleteDuringNew final : public EHScopeStack::Cleanup { /// Type used to hold llvm::Value*s. typedef typename Traits::ValueTy ValueTy; /// Type used to hold RValues. typedef typename Traits::RValueTy RValueTy; struct PlacementArg { RValueTy ArgValue; QualType ArgType; }; d1207 5 a1211 2 unsigned NumPlacementArgs : 31; unsigned PassAlignmentToPlacementDelete : 1; d1213 2 a1214 3 ValueTy Ptr; ValueTy AllocSize; CharUnits AllocAlign; d1216 2 a1217 2 PlacementArg *getPlacementArgs() { return reinterpret_cast(this + 1); d1222 1 a1222 1 return NumPlacementArgs * sizeof(PlacementArg); d1225 6 a1230 8 CallDeleteDuringNew(size_t NumPlacementArgs, const FunctionDecl *OperatorDelete, ValueTy Ptr, ValueTy AllocSize, bool PassAlignmentToPlacementDelete, CharUnits AllocAlign) : NumPlacementArgs(NumPlacementArgs), PassAlignmentToPlacementDelete(PassAlignmentToPlacementDelete), OperatorDelete(OperatorDelete), Ptr(Ptr), AllocSize(AllocSize), AllocAlign(AllocAlign) {} d1232 1 a1232 1 void setPlacementArg(unsigned I, RValueTy Arg, QualType Type) { d1234 1 a1234 1 getPlacementArgs()[I] = {Arg, Type}; d1238 5 a1242 2 const FunctionProtoType *FPT = OperatorDelete->getType()->getAs(); d1246 2 a1247 1 DeleteArgs.add(Traits::get(CGF, Ptr), FPT->getParamType(0)); d1249 4 a1252 12 // Figure out what other parameters we should be implicitly passing. bool PassSize = false; bool PassAlignment = false; if (NumPlacementArgs) { // A placement deallocation function is implicitly passed an alignment // if the placement allocation function was, but is never passed a size. PassAlignment = PassAlignmentToPlacementDelete; } else { // For a non-placement new-expression, 'operator delete' can take a // size and/or an alignment if it has the right parameters. std::tie(PassSize, PassAlignment) = shouldPassSizeAndAlignToUsualDelete(FPT); a1254 14 // The second argument can be a std::size_t (for non-placement delete). if (PassSize) DeleteArgs.add(Traits::get(CGF, AllocSize), CGF.getContext().getSizeType()); // The next (second or third) argument can be a std::align_val_t, which // is an enum whose underlying type is std::size_t. // FIXME: Use the right type as the parameter type. Note that in a call // to operator delete(size_t, ...), we may not have it available. if (PassAlignment) DeleteArgs.add(RValue::get(llvm::ConstantInt::get( CGF.SizeTy, AllocAlign.getQuantity())), CGF.getContext().getSizeType()); d1257 2 a1258 2 auto Arg = getPlacementArgs()[I]; DeleteArgs.add(Traits::get(CGF, Arg.ArgValue), Arg.ArgType); a1272 1 CharUnits AllocAlign, a1273 2 unsigned NumNonPlacementArgs = E->passAlignment() ? 2 : 1; d1277 8 a1284 21 struct DirectCleanupTraits { typedef llvm::Value *ValueTy; typedef RValue RValueTy; static RValue get(CodeGenFunction &, ValueTy V) { return RValue::get(V); } static RValue get(CodeGenFunction &, RValueTy V) { return V; } }; typedef CallDeleteDuringNew DirectCleanup; DirectCleanup *Cleanup = CGF.EHStack .pushCleanupWithExtra(EHCleanup, E->getNumPlacementArgs(), E->getOperatorDelete(), NewPtr.getPointer(), AllocSize, E->passAlignment(), AllocAlign); for (unsigned I = 0, N = E->getNumPlacementArgs(); I != N; ++I) { auto &Arg = NewArgs[I + NumNonPlacementArgs]; Cleanup->setPlacementArg(I, Arg.RV, Arg.Ty); } d1295 9 a1303 22 struct ConditionalCleanupTraits { typedef DominatingValue::saved_type ValueTy; typedef DominatingValue::saved_type RValueTy; static RValue get(CodeGenFunction &CGF, ValueTy V) { return V.restore(CGF); } }; typedef CallDeleteDuringNew ConditionalCleanup; ConditionalCleanup *Cleanup = CGF.EHStack .pushCleanupWithExtra(EHCleanup, E->getNumPlacementArgs(), E->getOperatorDelete(), SavedNewPtr, SavedAllocSize, E->passAlignment(), AllocAlign); for (unsigned I = 0, N = E->getNumPlacementArgs(); I != N; ++I) { auto &Arg = NewArgs[I + NumNonPlacementArgs]; Cleanup->setPlacementArg(I, DominatingValue::save(CGF, Arg.RV), Arg.Ty); } d1318 1 a1318 6 const InitListExpr *ILE = dyn_cast(E->getInitializer()); if (ILE && ILE->isStringLiteralInit()) minElements = cast(ILE->getType()->getAsArrayTypeUnsafe()) ->getSize().getZExtValue(); else if (ILE) a1326 1 CharUnits allocAlign = getContext().getTypeAlignInChars(allocType); d1342 4 a1345 2 if (alignSource != AlignmentSource::Decl) allocation = Address(allocation.getPointer(), allocAlign); a1357 1 unsigned ParamsToSkip = 0; a1361 25 ++ParamsToSkip; if (allocSize != allocSizeWithoutCookie) { CharUnits cookieAlign = getSizeAlign(); // FIXME: Ask the ABI. allocAlign = std::max(allocAlign, cookieAlign); } // The allocation alignment may be passed as the second argument. if (E->passAlignment()) { QualType AlignValT = sizeType; if (allocatorType->getNumParams() > 1) { AlignValT = allocatorType->getParamType(1); assert(getContext().hasSameUnqualifiedType( AlignValT->castAs()->getDecl()->getIntegerType(), sizeType) && "wrong type for alignment parameter"); ++ParamsToSkip; } else { // Corner case, passing alignment to 'operator new(size_t, ...)'. assert(allocator->isVariadic() && "can't pass alignment to allocator"); } allocatorArgs.add( RValue::get(llvm::ConstantInt::get(SizeTy, allocAlign.getQuantity())), AlignValT); } d1363 2 a1364 1 // FIXME: Why do we not pass a CalleeDecl here? d1366 2 a1367 1 /*CalleeDecl*/nullptr, /*ParamsToSkip*/ParamsToSkip); d1372 8 a1379 11 // If this was a call to a global replaceable allocation function that does // not take an alignment argument, the allocator is known to produce // storage that's suitably aligned for any object that fits, up to a known // threshold. Otherwise assume it's suitably aligned for the allocated type. CharUnits allocationAlign = allocAlign; if (!E->passAlignment() && allocator->isReplaceableGlobalAllocationFunction()) { unsigned AllocatorAlign = llvm::PowerOf2Floor(std::min( Target.getNewAlign(), getContext().getTypeSize(allocType))); allocationAlign = std::max( allocationAlign, getContext().toCharUnitsFromBits(AllocatorAlign)); d1418 1 a1418 2 EnterNewDeleteCleanup(*this, E, allocation, allocSize, allocAlign, allocatorArgs); d1480 3 a1482 5 llvm::Value *Ptr, QualType DeleteTy, llvm::Value *NumElements, CharUnits CookieSize) { assert((!NumElements && CookieSize.isZero()) || DeleteFD->getOverloadedOperator() == OO_Array_Delete); d1489 9 a1497 2 std::pair PassSizeAndAlign = shouldPassSizeAndAlignToUsualDelete(DeleteFTy); d1499 1 a1499 4 auto ParamTypeIt = DeleteFTy->param_type_begin(); // Pass the pointer itself. QualType ArgTy = *ParamTypeIt++; d1503 2 a1504 31 // Pass the size if the delete function has a size_t parameter. if (PassSizeAndAlign.first) { QualType SizeType = *ParamTypeIt++; CharUnits DeleteTypeSize = getContext().getTypeSizeInChars(DeleteTy); llvm::Value *Size = llvm::ConstantInt::get(ConvertType(SizeType), DeleteTypeSize.getQuantity()); // For array new, multiply by the number of elements. if (NumElements) Size = Builder.CreateMul(Size, NumElements); // If there is a cookie, add the cookie size. if (!CookieSize.isZero()) Size = Builder.CreateAdd( Size, llvm::ConstantInt::get(SizeTy, CookieSize.getQuantity())); DeleteArgs.add(RValue::get(Size), SizeType); } // Pass the alignment if the delete function has an align_val_t parameter. if (PassSizeAndAlign.second) { QualType AlignValType = *ParamTypeIt++; CharUnits DeleteTypeAlign = getContext().toCharUnitsFromBits( getContext().getTypeAlignIfKnown(DeleteTy)); llvm::Value *Align = llvm::ConstantInt::get(ConvertType(AlignValType), DeleteTypeAlign.getQuantity()); DeleteArgs.add(RValue::get(Align), AlignValType); } assert(ParamTypeIt == DeleteFTy->param_type_end() && "unknown parameter to usual delete function"); a1540 9 // C++11 [expr.delete]p3: // If the static type of the object to be deleted is different from its // dynamic type, the static type shall be a base class of the dynamic type // of the object to be deleted and the static type shall have a virtual // destructor or the behavior is undefined. CGF.EmitTypeCheck(CodeGenFunction::TCK_MemberCall, DE->getExprLoc(), Ptr.getPointer(), ElementType); d1608 39 a1646 2 CGF.EmitDeleteCall(OperatorDelete, Ptr, ElementType, NumElements, CookieSize); d1944 4 a1947 1 EmitInitializerForField(*CurField, LV, *i); @ 1.1.1.10 log @Import Clang pre-4.0.0 r291444. @ text @d27 4 a30 5 static RequiredArgs commonEmitCXXMemberOrOperatorCall(CodeGenFunction &CGF, const CXXMethodDecl *MD, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, const CallExpr *CE, CallArgList &Args, CallArgList *RtlArgs) { d35 11 a45 1 ASTContext &C = CGF.getContext(); d48 1 a48 4 const CXXRecordDecl *RD = CGF.CGM.getCXXABI().getThisArgumentTypeForMethod(MD); Args.add(RValue::get(This), RD ? C.getPointerType(C.getTypeDeclType(RD)) : C.VoidPtrTy); d56 1 a56 1 RequiredArgs required = RequiredArgs::forPrototypePlus(FPT, Args.size(), MD); d59 1 a59 6 if (RtlArgs) { // Special case: if the caller emitted the arguments right-to-left already // (prior to emitting the *this argument), we're done. This happens for // assignment operators. Args.addFrom(*RtlArgs); } else if (CE) { d73 1 a73 2 const CXXMethodDecl *MD, const CGCallee &Callee, ReturnValueSlot ReturnValue, d75 1 a75 1 const CallExpr *CE, CallArgList *RtlArgs) { d79 4 a82 3 *this, MD, This, ImplicitParam, ImplicitParamTy, CE, Args, RtlArgs); auto &FnInfo = CGM.getTypes().arrangeCXXMethodCall(Args, FPT, required); return EmitCall(FnInfo, Callee, ReturnValue, Args); d85 4 a88 4 RValue CodeGenFunction::EmitCXXDestructorCall( const CXXDestructorDecl *DD, const CGCallee &Callee, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, const CallExpr *CE, StructorType Type) { d90 4 a93 55 commonEmitCXXMemberOrOperatorCall(*this, DD, This, ImplicitParam, ImplicitParamTy, CE, Args, nullptr); return EmitCall(CGM.getTypes().arrangeCXXStructorDeclaration(DD, Type), Callee, ReturnValueSlot(), Args); } RValue CodeGenFunction::EmitCXXPseudoDestructorExpr( const CXXPseudoDestructorExpr *E) { QualType DestroyedType = E->getDestroyedType(); if (DestroyedType.hasStrongOrWeakObjCLifetime()) { // Automatic Reference Counting: // If the pseudo-expression names a retainable object with weak or // strong lifetime, the object shall be released. Expr *BaseExpr = E->getBase(); Address BaseValue = Address::invalid(); Qualifiers BaseQuals; // If this is s.x, emit s as an lvalue. If it is s->x, emit s as a scalar. if (E->isArrow()) { BaseValue = EmitPointerWithAlignment(BaseExpr); const PointerType *PTy = BaseExpr->getType()->getAs(); BaseQuals = PTy->getPointeeType().getQualifiers(); } else { LValue BaseLV = EmitLValue(BaseExpr); BaseValue = BaseLV.getAddress(); QualType BaseTy = BaseExpr->getType(); BaseQuals = BaseTy.getQualifiers(); } switch (DestroyedType.getObjCLifetime()) { case Qualifiers::OCL_None: case Qualifiers::OCL_ExplicitNone: case Qualifiers::OCL_Autoreleasing: break; case Qualifiers::OCL_Strong: EmitARCRelease(Builder.CreateLoad(BaseValue, DestroyedType.isVolatileQualified()), ARCPreciseLifetime); break; case Qualifiers::OCL_Weak: EmitARCDestroyWeak(BaseValue); break; } } else { // C++ [expr.pseudo]p1: // The result shall only be used as the operand for the function call // operator (), and the result of such a call has type void. The only // effect is the evaluation of the postfix-expression before the dot or // arrow. EmitIgnoredExpr(E->getBase()); } return RValue::get(nullptr); d118 2 a119 2 CGCallee callee = CGCallee::forDirect(CGM.GetAddrOfFunction(MD), MD); return EmitCall(getContext().getPointerType(MD->getType()), callee, CE, a168 13 // C++17 demands that we evaluate the RHS of a (possibly-compound) assignment // operator before the LHS. CallArgList RtlArgStorage; CallArgList *RtlArgs = nullptr; if (auto *OCE = dyn_cast(CE)) { if (OCE->isAssignmentOp()) { RtlArgs = &RtlArgStorage; EmitCallArgs(*RtlArgs, MD->getType()->castAs(), drop_begin(CE->arguments(), 1), CE->getDirectCallee(), /*ParamsToSkip*/0, EvaluationOrder::ForceRightToLeft); } } d186 4 a189 6 LValue RHS = isa(CE) ? MakeNaturalAlignAddrLValue( (*RtlArgs)[0].RV.getScalarVal(), (*(CE->arg_begin() + 1))->getType()) : EmitLValue(*CE->arg_begin()); EmitAggregateAssign(This, RHS.getAddress(), CE->getType()); a219 16 // C++11 [class.mfct.non-static]p2: // If a non-static member function of a class X is called for an object that // is not of type X, or of a type derived from X, the behavior is undefined. SourceLocation CallLoc; ASTContext &C = getContext(); if (CE) CallLoc = CE->getExprLoc(); EmitTypeCheck(isa(CalleeDecl) ? CodeGenFunction::TCK_ConstructorCall : CodeGenFunction::TCK_MemberCall, CallLoc, This.getPointer(), C.getRecordType(CalleeDecl->getParent())); // FIXME: Uses of 'MD' past this point need to be audited. We may need to use // 'CalleeDecl' instead. d227 2 a228 1 a236 1 CGCallee Callee; d240 2 a241 3 Callee = CGCallee::forDirect( CGM.getAddrOfCXXStructor(Dtor, StructorType::Complete, FInfo, Ty), Dtor); d245 1 a245 3 Callee = CGCallee::forDirect( CGM.GetAddrOfFunction(GlobalDecl(DDtor, Dtor_Complete), Ty), DDtor); d247 2 a248 3 EmitCXXMemberOrOperatorCall( CalleeDecl, Callee, ReturnValue, This.getPointer(), /*ImplicitParam=*/nullptr, QualType(), CE, nullptr); a252 1 CGCallee Callee; d254 1 a254 3 Callee = CGCallee::forDirect( CGM.GetAddrOfFunction(GlobalDecl(Ctor, Ctor_Complete), Ty), Ctor); d262 1 a262 2 EmitVTablePtrCheckForCall(MD->getParent(), VTable, CFITCK_NVCall, CE->getLocStart()); d268 1 a268 1 Callee = CGCallee::forDirect(CGM.GetAddrOfFunction(MD, Ty), MD); d270 1 a270 3 Callee = CGCallee::forDirect( CGM.GetAddrOfFunction(DevirtualizedMethod, Ty), DevirtualizedMethod); d276 1 a276 1 *this, CalleeDecl, This, UseVirtualCall); d279 2 a280 3 return EmitCXXMemberOrOperatorCall( CalleeDecl, Callee, ReturnValue, This.getPointer(), /*ImplicitParam=*/nullptr, QualType(), CE, RtlArgs); d299 3 a311 3 // Get the member function pointer. llvm::Value *MemFnPtr = EmitScalarExpr(MemFnExpr); d314 1 a314 1 CGCallee Callee = d326 2 a327 3 RequiredArgs required = RequiredArgs::forPrototypePlus(FPT, 1, /*FD=*/nullptr); d329 1 a329 1 EmitCallArgs(Args, FPT, E->arguments()); a371 3 // Stop before we hit any virtual base pointers located in virtual bases. if (VBPtrOffset >= NVSize) break; d474 2 a475 2 if (const ArrayType *arrayType = getContext().getAsArrayType(E->getType())) { a848 26 // Attempt to perform zero-initialization using memset. auto TryMemsetInitialization = [&]() -> bool { // FIXME: If the type is a pointer-to-data-member under the Itanium ABI, // we can initialize with a memset to -1. if (!CGM.getTypes().isZeroInitializable(ElementType)) return false; // Optimization: since zero initialization will just set the memory // to all zeroes, generate a single memset to do it in one shot. // Subtract out the size of any elements we've already initialized. auto *RemainingSize = AllocSizeWithoutCookie; if (InitListElements) { // We know this can't overflow; we check this when doing the allocation. auto *InitializedSize = llvm::ConstantInt::get( RemainingSize->getType(), getContext().getTypeSizeInChars(ElementType).getQuantity() * InitListElements); RemainingSize = Builder.CreateSub(RemainingSize, InitializedSize); } // Create the memset. Builder.CreateMemSet(CurPtr, Builder.getInt8(0), RemainingSize, false); return true; }; a850 34 // Initializing from a (braced) string literal is a special case; the init // list element does not initialize a (single) array element. if (ILE->isStringLiteralInit()) { // Initialize the initial portion of length equal to that of the string // literal. The allocation must be for at least this much; we emitted a // check for that earlier. AggValueSlot Slot = AggValueSlot::forAddr(CurPtr, ElementType.getQualifiers(), AggValueSlot::IsDestructed, AggValueSlot::DoesNotNeedGCBarriers, AggValueSlot::IsNotAliased); EmitAggExpr(ILE->getInit(0), Slot); // Move past these elements. InitListElements = cast(ILE->getType()->getAsArrayTypeUnsafe()) ->getSize().getZExtValue(); CurPtr = Address(Builder.CreateInBoundsGEP(CurPtr.getPointer(), Builder.getSize(InitListElements), "string.init.end"), CurPtr.getAlignment().alignmentAtOffset(InitListElements * ElementSize)); // Zero out the rest, if any remain. llvm::ConstantInt *ConstNum = dyn_cast(NumElements); if (!ConstNum || !ConstNum->equalsInt(InitListElements)) { bool OK = TryMemsetInitialization(); (void)OK; assert(OK && "couldn't memset character type?"); } return; } d917 26 d1013 1 a1013 3 unsigned NumElements = 0; if (auto *CXXRD = dyn_cast(RType->getDecl())) NumElements = CXXRD->getNumBases(); d1016 2 a1017 3 ++NumElements; // FIXME: Recurse into nested InitListExprs. if (ILE->getNumInits() == NumElements) d1020 2 a1021 2 --NumElements; if (ILE->getNumInits() == NumElements && TryMemsetInitialization()) d1105 1 a1105 1 const FunctionDecl *CalleeDecl, d1109 1 a1109 2 llvm::Constant *CalleePtr = CGF.CGM.GetAddrOfFunction(CalleeDecl); CGCallee Callee = CGCallee::forDirect(CalleePtr, CalleeDecl); d1113 1 a1113 1 Callee, ReturnValueSlot(), Args, &CallOrInvoke); d1120 2 a1121 2 llvm::Function *Fn = dyn_cast(CalleePtr); if (CalleeDecl->isReplaceableGlobalAllocationFunction() && d1154 10 a1163 3 static std::pair shouldPassSizeAndAlignToUsualDelete(const FunctionProtoType *FPT) { auto AI = FPT->param_type_begin(), AE = FPT->param_type_end(); d1165 11 a1175 2 // The first argument is always a void*. ++AI; d1177 4 a1180 3 // Figure out what other parameters we should be implicitly passing. bool PassSize = false; bool PassAlignment = false; d1182 11 a1192 4 if (AI != AE && (*AI)->isIntegerType()) { PassSize = true; ++AI; } d1194 3 a1196 4 if (AI != AE && (*AI)->isAlignValT()) { PassAlignment = true; ++AI; } d1198 3 a1200 3 assert(AI == AE && "unexpected usual deallocation function parameter"); return {PassSize, PassAlignment}; } d1202 4 a1205 14 namespace { /// A cleanup to call the given 'operator delete' function upon abnormal /// exit from a new expression. Templated on a traits type that deals with /// ensuring that the arguments dominate the cleanup if necessary. template class CallDeleteDuringNew final : public EHScopeStack::Cleanup { /// Type used to hold llvm::Value*s. typedef typename Traits::ValueTy ValueTy; /// Type used to hold RValues. typedef typename Traits::RValueTy RValueTy; struct PlacementArg { RValueTy ArgValue; QualType ArgType; }; d1207 5 a1211 2 unsigned NumPlacementArgs : 31; unsigned PassAlignmentToPlacementDelete : 1; d1213 2 a1214 3 ValueTy Ptr; ValueTy AllocSize; CharUnits AllocAlign; d1216 2 a1217 2 PlacementArg *getPlacementArgs() { return reinterpret_cast(this + 1); d1222 1 a1222 1 return NumPlacementArgs * sizeof(PlacementArg); d1225 6 a1230 8 CallDeleteDuringNew(size_t NumPlacementArgs, const FunctionDecl *OperatorDelete, ValueTy Ptr, ValueTy AllocSize, bool PassAlignmentToPlacementDelete, CharUnits AllocAlign) : NumPlacementArgs(NumPlacementArgs), PassAlignmentToPlacementDelete(PassAlignmentToPlacementDelete), OperatorDelete(OperatorDelete), Ptr(Ptr), AllocSize(AllocSize), AllocAlign(AllocAlign) {} d1232 1 a1232 1 void setPlacementArg(unsigned I, RValueTy Arg, QualType Type) { d1234 1 a1234 1 getPlacementArgs()[I] = {Arg, Type}; d1238 5 a1242 2 const FunctionProtoType *FPT = OperatorDelete->getType()->getAs(); d1246 2 a1247 1 DeleteArgs.add(Traits::get(CGF, Ptr), FPT->getParamType(0)); d1249 4 a1252 12 // Figure out what other parameters we should be implicitly passing. bool PassSize = false; bool PassAlignment = false; if (NumPlacementArgs) { // A placement deallocation function is implicitly passed an alignment // if the placement allocation function was, but is never passed a size. PassAlignment = PassAlignmentToPlacementDelete; } else { // For a non-placement new-expression, 'operator delete' can take a // size and/or an alignment if it has the right parameters. std::tie(PassSize, PassAlignment) = shouldPassSizeAndAlignToUsualDelete(FPT); a1254 14 // The second argument can be a std::size_t (for non-placement delete). if (PassSize) DeleteArgs.add(Traits::get(CGF, AllocSize), CGF.getContext().getSizeType()); // The next (second or third) argument can be a std::align_val_t, which // is an enum whose underlying type is std::size_t. // FIXME: Use the right type as the parameter type. Note that in a call // to operator delete(size_t, ...), we may not have it available. if (PassAlignment) DeleteArgs.add(RValue::get(llvm::ConstantInt::get( CGF.SizeTy, AllocAlign.getQuantity())), CGF.getContext().getSizeType()); d1257 2 a1258 2 auto Arg = getPlacementArgs()[I]; DeleteArgs.add(Traits::get(CGF, Arg.ArgValue), Arg.ArgType); a1272 1 CharUnits AllocAlign, a1273 2 unsigned NumNonPlacementArgs = E->passAlignment() ? 2 : 1; d1277 8 a1284 21 struct DirectCleanupTraits { typedef llvm::Value *ValueTy; typedef RValue RValueTy; static RValue get(CodeGenFunction &, ValueTy V) { return RValue::get(V); } static RValue get(CodeGenFunction &, RValueTy V) { return V; } }; typedef CallDeleteDuringNew DirectCleanup; DirectCleanup *Cleanup = CGF.EHStack .pushCleanupWithExtra(EHCleanup, E->getNumPlacementArgs(), E->getOperatorDelete(), NewPtr.getPointer(), AllocSize, E->passAlignment(), AllocAlign); for (unsigned I = 0, N = E->getNumPlacementArgs(); I != N; ++I) { auto &Arg = NewArgs[I + NumNonPlacementArgs]; Cleanup->setPlacementArg(I, Arg.RV, Arg.Ty); } d1295 9 a1303 22 struct ConditionalCleanupTraits { typedef DominatingValue::saved_type ValueTy; typedef DominatingValue::saved_type RValueTy; static RValue get(CodeGenFunction &CGF, ValueTy V) { return V.restore(CGF); } }; typedef CallDeleteDuringNew ConditionalCleanup; ConditionalCleanup *Cleanup = CGF.EHStack .pushCleanupWithExtra(EHCleanup, E->getNumPlacementArgs(), E->getOperatorDelete(), SavedNewPtr, SavedAllocSize, E->passAlignment(), AllocAlign); for (unsigned I = 0, N = E->getNumPlacementArgs(); I != N; ++I) { auto &Arg = NewArgs[I + NumNonPlacementArgs]; Cleanup->setPlacementArg(I, DominatingValue::save(CGF, Arg.RV), Arg.Ty); } d1318 1 a1318 6 const InitListExpr *ILE = dyn_cast(E->getInitializer()); if (ILE && ILE->isStringLiteralInit()) minElements = cast(ILE->getType()->getAsArrayTypeUnsafe()) ->getSize().getZExtValue(); else if (ILE) a1326 1 CharUnits allocAlign = getContext().getTypeAlignInChars(allocType); d1342 4 a1345 2 if (alignSource != AlignmentSource::Decl) allocation = Address(allocation.getPointer(), allocAlign); a1357 1 unsigned ParamsToSkip = 0; a1361 25 ++ParamsToSkip; if (allocSize != allocSizeWithoutCookie) { CharUnits cookieAlign = getSizeAlign(); // FIXME: Ask the ABI. allocAlign = std::max(allocAlign, cookieAlign); } // The allocation alignment may be passed as the second argument. if (E->passAlignment()) { QualType AlignValT = sizeType; if (allocatorType->getNumParams() > 1) { AlignValT = allocatorType->getParamType(1); assert(getContext().hasSameUnqualifiedType( AlignValT->castAs()->getDecl()->getIntegerType(), sizeType) && "wrong type for alignment parameter"); ++ParamsToSkip; } else { // Corner case, passing alignment to 'operator new(size_t, ...)'. assert(allocator->isVariadic() && "can't pass alignment to allocator"); } allocatorArgs.add( RValue::get(llvm::ConstantInt::get(SizeTy, allocAlign.getQuantity())), AlignValT); } d1363 2 a1364 1 // FIXME: Why do we not pass a CalleeDecl here? d1366 2 a1367 1 /*CalleeDecl*/nullptr, /*ParamsToSkip*/ParamsToSkip); d1372 8 a1379 11 // If this was a call to a global replaceable allocation function that does // not take an alignment argument, the allocator is known to produce // storage that's suitably aligned for any object that fits, up to a known // threshold. Otherwise assume it's suitably aligned for the allocated type. CharUnits allocationAlign = allocAlign; if (!E->passAlignment() && allocator->isReplaceableGlobalAllocationFunction()) { unsigned AllocatorAlign = llvm::PowerOf2Floor(std::min( Target.getNewAlign(), getContext().getTypeSize(allocType))); allocationAlign = std::max( allocationAlign, getContext().toCharUnitsFromBits(AllocatorAlign)); d1418 1 a1418 2 EnterNewDeleteCleanup(*this, E, allocation, allocSize, allocAlign, allocatorArgs); d1480 3 a1482 5 llvm::Value *Ptr, QualType DeleteTy, llvm::Value *NumElements, CharUnits CookieSize) { assert((!NumElements && CookieSize.isZero()) || DeleteFD->getOverloadedOperator() == OO_Array_Delete); d1489 9 a1497 2 std::pair PassSizeAndAlign = shouldPassSizeAndAlignToUsualDelete(DeleteFTy); d1499 1 a1499 4 auto ParamTypeIt = DeleteFTy->param_type_begin(); // Pass the pointer itself. QualType ArgTy = *ParamTypeIt++; d1503 2 a1504 31 // Pass the size if the delete function has a size_t parameter. if (PassSizeAndAlign.first) { QualType SizeType = *ParamTypeIt++; CharUnits DeleteTypeSize = getContext().getTypeSizeInChars(DeleteTy); llvm::Value *Size = llvm::ConstantInt::get(ConvertType(SizeType), DeleteTypeSize.getQuantity()); // For array new, multiply by the number of elements. if (NumElements) Size = Builder.CreateMul(Size, NumElements); // If there is a cookie, add the cookie size. if (!CookieSize.isZero()) Size = Builder.CreateAdd( Size, llvm::ConstantInt::get(SizeTy, CookieSize.getQuantity())); DeleteArgs.add(RValue::get(Size), SizeType); } // Pass the alignment if the delete function has an align_val_t parameter. if (PassSizeAndAlign.second) { QualType AlignValType = *ParamTypeIt++; CharUnits DeleteTypeAlign = getContext().toCharUnitsFromBits( getContext().getTypeAlignIfKnown(DeleteTy)); llvm::Value *Align = llvm::ConstantInt::get(ConvertType(AlignValType), DeleteTypeAlign.getQuantity()); DeleteArgs.add(RValue::get(Align), AlignValType); } assert(ParamTypeIt == DeleteFTy->param_type_end() && "unknown parameter to usual delete function"); a1540 9 // C++11 [expr.delete]p3: // If the static type of the object to be deleted is different from its // dynamic type, the static type shall be a base class of the dynamic type // of the object to be deleted and the static type shall have a virtual // destructor or the behavior is undefined. CGF.EmitTypeCheck(CodeGenFunction::TCK_MemberCall, DE->getExprLoc(), Ptr.getPointer(), ElementType); d1608 39 a1646 2 CGF.EmitDeleteCall(OperatorDelete, Ptr, ElementType, NumElements, CookieSize); d1944 4 a1947 1 EmitInitializerForField(*CurField, LV, *i); @ 1.1.1.11 log @Import clang r309604 from branches/release_50 @ text @d27 1 a27 9 namespace { struct MemberCallInfo { RequiredArgs ReqArgs; // Number of prefix arguments for the call. Ignores the `this` pointer. unsigned PrefixSize; }; } static MemberCallInfo a50 1 unsigned PrefixSize = Args.size() - 1; d68 1 a68 1 return {required, PrefixSize}; d78 1 a78 1 MemberCallInfo CallInfo = commonEmitCXXMemberOrOperatorCall( d80 1 a80 2 auto &FnInfo = CGM.getTypes().arrangeCXXMethodCall( Args, FPT, CallInfo.ReqArgs, CallInfo.PrefixSize); d192 1 a192 2 if (CanUseVirtualCall && MD->getDevirtualizedMethod(Base, getLangOpts().AppleKext)) { d293 4 a296 14 SanitizerSet SkippedChecks; if (const auto *CMCE = dyn_cast(CE)) { auto *IOA = CMCE->getImplicitObjectArgument(); bool IsImplicitObjectCXXThis = IsWrappedCXXThis(IOA); if (IsImplicitObjectCXXThis) SkippedChecks.set(SanitizerKind::Alignment, true); if (IsImplicitObjectCXXThis || isa(IOA)) SkippedChecks.set(SanitizerKind::Null, true); } EmitTypeCheck( isa(CalleeDecl) ? CodeGenFunction::TCK_ConstructorCall : CodeGenFunction::TCK_MemberCall, CallLoc, This.getPointer(), C.getRecordType(CalleeDecl->getParent()), /*Alignment=*/CharUnits::Zero(), SkippedChecks); d423 1 a423 2 return EmitCall(CGM.getTypes().arrangeCXXMethodCall(Args, FPT, required, /*PrefixSize=*/0), d662 1 a662 4 numElements = CGF.CGM.EmitConstantExpr(e->getArraySize(), CGF.getContext().getSizeType(), &CGF); if (!numElements) numElements = CGF.EmitScalarExpr(e->getArraySize()); d1259 1 a1259 1 CI->addAttribute(llvm::AttributeList::FunctionIndex, d1262 1 a1262 1 II->addAttribute(llvm::AttributeList::FunctionIndex, d1510 2 a1511 2 LValueBaseInfo BaseInfo; allocation = EmitPointerWithAlignment(arg, &BaseInfo); d1516 1 a1516 1 if (BaseInfo.getAlignmentSource() != AlignmentSource::Decl) d1563 1 a1563 1 /*AC*/AbstractCallee(), /*ParamsToSkip*/ParamsToSkip); a1636 2 // To not break LTO with different optimizations levels, we do it regardless // of optimization level. d1638 1 @ 1.1.1.11.4.1 log @Sync with HEAD @ text @a18 1 #include "ConstantEmitter.h" d91 1 a91 2 return EmitCall(FnInfo, Callee, ReturnValue, Args, nullptr, CE ? CE->getExprLoc() : SourceLocation()); d243 5 a247 9 LValue This; if (IsArrow) { LValueBaseInfo BaseInfo; TBAAAccessInfo TBAAInfo; Address ThisValue = EmitPointerWithAlignment(Base, &BaseInfo, &TBAAInfo); This = MakeAddrLValue(ThisValue, Base->getType(), BaseInfo, TBAAInfo); } else { This = EmitLValue(Base); } d262 1 a262 1 (*RtlArgs)[0].getRValue(*this).getScalarVal(), d265 1 a265 1 EmitAggregateAssign(This, RHS, CE->getType()); d273 2 a274 7 const Expr *Arg = *CE->arg_begin(); LValue RHS = EmitLValue(Arg); LValue Dest = MakeAddrLValue(This.getAddress(), Arg->getType()); // This is the MSVC p->Ctor::Ctor(...) extension. We assume that's // constructing a new complete object of type Ctor. EmitAggregateCopy(Dest, RHS, Arg->getType(), AggValueSlot::DoesNotOverlap); d336 1 a336 2 *this, Dtor, Dtor_Complete, This.getAddress(), cast(CE)); d365 2 a366 1 Callee = CGCallee::forVirtual(CE, MD, This.getAddress(), Ty); d370 3 a372 6 llvm::Value *VTable; const CXXRecordDecl *RD; std::tie(VTable, RD) = CGM.getCXXABI().LoadVTablePtr(*this, This.getAddress(), MD->getParent()); EmitVTablePtrCheckForCall(RD, VTable, CFITCK_NVCall, CE->getLocStart()); d387 2 a388 4 Address NewThisAddr = CGM.getCXXABI().adjustThisArgumentForVirtualFunctionCall( *this, CalleeDecl, This.getAddress(), UseVirtualCall); This.setAddress(NewThisAddr); d446 1 a446 1 Callee, ReturnValue, Args, nullptr, E->getExprLoc()); d613 1 a613 1 LLVM_FALLTHROUGH; d621 1 a621 1 Dest.getAddress(), E, Dest.mayOverlap()); d684 2 a685 2 numElements = ConstantEmitter(CGF).tryEmitAbstract(e->getArraySize(), e->getType()); d923 1 a923 2 QualType AllocType, Address NewPtr, AggValueSlot::Overlap_t MayOverlap) { d939 1 a939 2 AggValueSlot::IsNotAliased, MayOverlap); d1008 1 a1008 2 AggValueSlot::IsNotAliased, AggValueSlot::DoesNotOverlap); d1073 1 a1073 2 ILE->getInit(i)->getType(), CurPtr, AggValueSlot::DoesNotOverlap); d1226 1 a1226 2 StoreAnyExprIntoOneUnit(*this, Init, Init->getType(), CurPtr, AggValueSlot::DoesNotOverlap); d1257 1 a1257 2 StoreAnyExprIntoOneUnit(CGF, Init, E->getAllocatedType(), NewPtr, AggValueSlot::DoesNotOverlap); d1297 1 a1297 1 const CallExpr *TheCall, d1300 2 a1301 1 EmitCallArgs(Args, Type->getParamTypes(), TheCall->arguments()); a1305 1 d1309 1 a1309 1 return EmitNewDeleteCall(*this, FD, Type, Args); d1313 2 a1314 13 namespace { /// The parameters to pass to a usual operator delete. struct UsualDeleteParams { bool DestroyingDelete = false; bool Size = false; bool Alignment = false; }; } static UsualDeleteParams getUsualDeleteParams(const FunctionDecl *FD) { UsualDeleteParams Params; const FunctionProtoType *FPT = FD->getType()->castAs(); d1320 3 a1322 6 // The next parameter may be a std::destroying_delete_t. if (FD->isDestroyingOperatorDelete()) { Params.DestroyingDelete = true; assert(AI != AE); ++AI; } a1323 1 // Figure out what other parameters we should be implicitly passing. d1325 1 a1325 1 Params.Size = true; d1330 1 a1330 1 Params.Alignment = true; d1335 1 a1335 1 return Params; d1388 1 a1388 2 // The first argument is always a void* (or C* for a destroying operator // delete for class type C). d1392 2 a1393 1 UsualDeleteParams Params; d1397 1 a1397 1 Params.Alignment = PassAlignmentToPlacementDelete; d1401 2 a1402 1 Params = getUsualDeleteParams(OperatorDelete); a1404 3 assert(!Params.DestroyingDelete && "should not call destroying delete in a new-expression"); d1406 1 a1406 1 if (Params.Size) d1414 1 a1414 1 if (Params.Alignment) d1463 1 a1463 1 Cleanup->setPlacementArg(I, Arg.getRValue(CGF), Arg.Ty); d1494 2 a1495 2 Cleanup->setPlacementArg( I, DominatingValue::save(CGF, Arg.getRValue(CGF)), Arg.Ty); d1660 1 a1660 1 // Passing pointer through launder.invariant.group to avoid propagation of d1666 1 a1666 1 result = Address(Builder.CreateLaunderInvariantGroup(result.getPointer()), d1717 3 a1719 1 auto Params = getUsualDeleteParams(DeleteFD); a1726 8 // Pass the std::destroying_delete tag if present. if (Params.DestroyingDelete) { QualType DDTag = *ParamTypeIt++; // Just pass an 'undef'. We expect the tag type to be an empty struct. auto *V = llvm::UndefValue::get(getTypes().ConvertType(DDTag)); DeleteArgs.add(RValue::get(V), DDTag); } d1728 1 a1728 1 if (Params.Size) { d1747 1 a1747 1 if (Params.Alignment) { a1788 15 /// Emit the code for deleting a single object with a destroying operator /// delete. If the element type has a non-virtual destructor, Ptr has already /// been converted to the type of the parameter of 'operator delete'. Otherwise /// Ptr points to an object of the static type. static void EmitDestroyingObjectDelete(CodeGenFunction &CGF, const CXXDeleteExpr *DE, Address Ptr, QualType ElementType) { auto *Dtor = ElementType->getAsCXXRecordDecl()->getDestructor(); if (Dtor && Dtor->isVirtual()) CGF.CGM.getCXXABI().emitVirtualObjectDelete(CGF, DE, Ptr, ElementType, Dtor); else CGF.EmitDeleteCall(DE->getOperatorDelete(), Ptr.getPointer(), ElementType); } a1802 3 const FunctionDecl *OperatorDelete = DE->getOperatorDelete(); assert(!OperatorDelete->isDestroyingOperatorDelete()); d1822 1 a1933 10 QualType DeleteTy = E->getDestroyedType(); // A destroying operator delete overrides the entire operation of the // delete expression. if (E->getOperatorDelete()->isDestroyingOperatorDelete()) { EmitDestroyingObjectDelete(*this, E, Ptr, DeleteTy); EmitBlock(DeleteEnd); return; } d1937 1 a2005 9 QualType SrcRecordTy = E->getType(); // C++ [class.cdtor]p4: // If the operand of typeid refers to the object under construction or // destruction and the static type of the operand is neither the constructor // or destructor’s class nor one of its bases, the behavior is undefined. CGF.EmitTypeCheck(CodeGenFunction::TCK_DynamicOperation, E->getExprLoc(), ThisPtr.getPointer(), SrcRecordTy); d2014 1 d2077 4 a2100 12 // C++ [class.cdtor]p5: // If the operand of the dynamic_cast refers to the object under // construction or destruction and the static type of the operand is not a // pointer to or object of the constructor or destructor’s own class or one // of its bases, the dynamic_cast results in undefined behavior. EmitTypeCheck(TCK_DynamicOperation, DCE->getExprLoc(), ThisAddr.getPointer(), SrcRecordTy); if (DCE->isAlwaysNull()) if (llvm::Value *T = EmitDynamicCastToNull(*this, DestTy)) return T; @ 1.1.1.11.4.2 log @Mostly merge changes from HEAD upto 20200411 @ text @@ 1.1.1.11.2.1 log @Sync with HEAD @ text @a18 1 #include "ConstantEmitter.h" d91 1 a91 2 return EmitCall(FnInfo, Callee, ReturnValue, Args, nullptr, CE ? CE->getExprLoc() : SourceLocation()); d243 5 a247 9 LValue This; if (IsArrow) { LValueBaseInfo BaseInfo; TBAAAccessInfo TBAAInfo; Address ThisValue = EmitPointerWithAlignment(Base, &BaseInfo, &TBAAInfo); This = MakeAddrLValue(ThisValue, Base->getType(), BaseInfo, TBAAInfo); } else { This = EmitLValue(Base); } d262 1 a262 1 (*RtlArgs)[0].getRValue(*this).getScalarVal(), d265 1 a265 1 EmitAggregateAssign(This, RHS, CE->getType()); d273 2 a274 7 const Expr *Arg = *CE->arg_begin(); LValue RHS = EmitLValue(Arg); LValue Dest = MakeAddrLValue(This.getAddress(), Arg->getType()); // This is the MSVC p->Ctor::Ctor(...) extension. We assume that's // constructing a new complete object of type Ctor. EmitAggregateCopy(Dest, RHS, Arg->getType(), AggValueSlot::DoesNotOverlap); d336 1 a336 2 *this, Dtor, Dtor_Complete, This.getAddress(), cast(CE)); d365 2 a366 1 Callee = CGCallee::forVirtual(CE, MD, This.getAddress(), Ty); d370 3 a372 6 llvm::Value *VTable; const CXXRecordDecl *RD; std::tie(VTable, RD) = CGM.getCXXABI().LoadVTablePtr(*this, This.getAddress(), MD->getParent()); EmitVTablePtrCheckForCall(RD, VTable, CFITCK_NVCall, CE->getLocStart()); d387 2 a388 4 Address NewThisAddr = CGM.getCXXABI().adjustThisArgumentForVirtualFunctionCall( *this, CalleeDecl, This.getAddress(), UseVirtualCall); This.setAddress(NewThisAddr); d446 1 a446 1 Callee, ReturnValue, Args, nullptr, E->getExprLoc()); d613 1 a613 1 LLVM_FALLTHROUGH; d621 1 a621 1 Dest.getAddress(), E, Dest.mayOverlap()); d684 2 a685 2 numElements = ConstantEmitter(CGF).tryEmitAbstract(e->getArraySize(), e->getType()); d923 1 a923 2 QualType AllocType, Address NewPtr, AggValueSlot::Overlap_t MayOverlap) { d939 1 a939 2 AggValueSlot::IsNotAliased, MayOverlap); d1008 1 a1008 2 AggValueSlot::IsNotAliased, AggValueSlot::DoesNotOverlap); d1073 1 a1073 2 ILE->getInit(i)->getType(), CurPtr, AggValueSlot::DoesNotOverlap); d1226 1 a1226 2 StoreAnyExprIntoOneUnit(*this, Init, Init->getType(), CurPtr, AggValueSlot::DoesNotOverlap); d1257 1 a1257 2 StoreAnyExprIntoOneUnit(CGF, Init, E->getAllocatedType(), NewPtr, AggValueSlot::DoesNotOverlap); d1297 1 a1297 1 const CallExpr *TheCall, d1300 2 a1301 1 EmitCallArgs(Args, Type->getParamTypes(), TheCall->arguments()); a1305 1 d1309 1 a1309 1 return EmitNewDeleteCall(*this, FD, Type, Args); d1313 2 a1314 13 namespace { /// The parameters to pass to a usual operator delete. struct UsualDeleteParams { bool DestroyingDelete = false; bool Size = false; bool Alignment = false; }; } static UsualDeleteParams getUsualDeleteParams(const FunctionDecl *FD) { UsualDeleteParams Params; const FunctionProtoType *FPT = FD->getType()->castAs(); d1320 3 a1322 6 // The next parameter may be a std::destroying_delete_t. if (FD->isDestroyingOperatorDelete()) { Params.DestroyingDelete = true; assert(AI != AE); ++AI; } a1323 1 // Figure out what other parameters we should be implicitly passing. d1325 1 a1325 1 Params.Size = true; d1330 1 a1330 1 Params.Alignment = true; d1335 1 a1335 1 return Params; d1388 1 a1388 2 // The first argument is always a void* (or C* for a destroying operator // delete for class type C). d1392 2 a1393 1 UsualDeleteParams Params; d1397 1 a1397 1 Params.Alignment = PassAlignmentToPlacementDelete; d1401 2 a1402 1 Params = getUsualDeleteParams(OperatorDelete); a1404 3 assert(!Params.DestroyingDelete && "should not call destroying delete in a new-expression"); d1406 1 a1406 1 if (Params.Size) d1414 1 a1414 1 if (Params.Alignment) d1463 1 a1463 1 Cleanup->setPlacementArg(I, Arg.getRValue(CGF), Arg.Ty); d1494 2 a1495 2 Cleanup->setPlacementArg( I, DominatingValue::save(CGF, Arg.getRValue(CGF)), Arg.Ty); d1660 1 a1660 1 // Passing pointer through launder.invariant.group to avoid propagation of d1666 1 a1666 1 result = Address(Builder.CreateLaunderInvariantGroup(result.getPointer()), d1717 3 a1719 1 auto Params = getUsualDeleteParams(DeleteFD); a1726 8 // Pass the std::destroying_delete tag if present. if (Params.DestroyingDelete) { QualType DDTag = *ParamTypeIt++; // Just pass an 'undef'. We expect the tag type to be an empty struct. auto *V = llvm::UndefValue::get(getTypes().ConvertType(DDTag)); DeleteArgs.add(RValue::get(V), DDTag); } d1728 1 a1728 1 if (Params.Size) { d1747 1 a1747 1 if (Params.Alignment) { a1788 15 /// Emit the code for deleting a single object with a destroying operator /// delete. If the element type has a non-virtual destructor, Ptr has already /// been converted to the type of the parameter of 'operator delete'. Otherwise /// Ptr points to an object of the static type. static void EmitDestroyingObjectDelete(CodeGenFunction &CGF, const CXXDeleteExpr *DE, Address Ptr, QualType ElementType) { auto *Dtor = ElementType->getAsCXXRecordDecl()->getDestructor(); if (Dtor && Dtor->isVirtual()) CGF.CGM.getCXXABI().emitVirtualObjectDelete(CGF, DE, Ptr, ElementType, Dtor); else CGF.EmitDeleteCall(DE->getOperatorDelete(), Ptr.getPointer(), ElementType); } a1802 3 const FunctionDecl *OperatorDelete = DE->getOperatorDelete(); assert(!OperatorDelete->isDestroyingOperatorDelete()); d1822 1 a1933 10 QualType DeleteTy = E->getDestroyedType(); // A destroying operator delete overrides the entire operation of the // delete expression. if (E->getOperatorDelete()->isDestroyingOperatorDelete()) { EmitDestroyingObjectDelete(*this, E, Ptr, DeleteTy); EmitBlock(DeleteEnd); return; } d1937 1 a2005 9 QualType SrcRecordTy = E->getType(); // C++ [class.cdtor]p4: // If the operand of typeid refers to the object under construction or // destruction and the static type of the operand is neither the constructor // or destructor’s class nor one of its bases, the behavior is undefined. CGF.EmitTypeCheck(CodeGenFunction::TCK_DynamicOperation, E->getExprLoc(), ThisPtr.getPointer(), SrcRecordTy); d2014 1 d2077 4 a2100 12 // C++ [class.cdtor]p5: // If the operand of the dynamic_cast refers to the object under // construction or destruction and the static type of the operand is not a // pointer to or object of the constructor or destructor’s own class or one // of its bases, the dynamic_cast results in undefined behavior. EmitTypeCheck(TCK_DynamicOperation, DCE->getExprLoc(), ThisAddr.getPointer(), SrcRecordTy); if (DCE->isAlwaysNull()) if (llvm::Value *T = EmitDynamicCastToNull(*this, DestTy)) return T; @ 1.1.1.12 log @Import clang r337282 from trunk @ text @a18 1 #include "ConstantEmitter.h" d91 1 a91 2 return EmitCall(FnInfo, Callee, ReturnValue, Args, nullptr, CE ? CE->getExprLoc() : SourceLocation()); d243 5 a247 9 LValue This; if (IsArrow) { LValueBaseInfo BaseInfo; TBAAAccessInfo TBAAInfo; Address ThisValue = EmitPointerWithAlignment(Base, &BaseInfo, &TBAAInfo); This = MakeAddrLValue(ThisValue, Base->getType(), BaseInfo, TBAAInfo); } else { This = EmitLValue(Base); } d262 1 a262 1 (*RtlArgs)[0].getRValue(*this).getScalarVal(), d265 1 a265 1 EmitAggregateAssign(This, RHS, CE->getType()); d273 2 a274 7 const Expr *Arg = *CE->arg_begin(); LValue RHS = EmitLValue(Arg); LValue Dest = MakeAddrLValue(This.getAddress(), Arg->getType()); // This is the MSVC p->Ctor::Ctor(...) extension. We assume that's // constructing a new complete object of type Ctor. EmitAggregateCopy(Dest, RHS, Arg->getType(), AggValueSlot::DoesNotOverlap); d336 1 a336 2 *this, Dtor, Dtor_Complete, This.getAddress(), cast(CE)); d365 2 a366 1 Callee = CGCallee::forVirtual(CE, MD, This.getAddress(), Ty); d370 3 a372 6 llvm::Value *VTable; const CXXRecordDecl *RD; std::tie(VTable, RD) = CGM.getCXXABI().LoadVTablePtr(*this, This.getAddress(), MD->getParent()); EmitVTablePtrCheckForCall(RD, VTable, CFITCK_NVCall, CE->getLocStart()); d387 2 a388 4 Address NewThisAddr = CGM.getCXXABI().adjustThisArgumentForVirtualFunctionCall( *this, CalleeDecl, This.getAddress(), UseVirtualCall); This.setAddress(NewThisAddr); d446 1 a446 1 Callee, ReturnValue, Args, nullptr, E->getExprLoc()); d613 1 a613 1 LLVM_FALLTHROUGH; d621 1 a621 1 Dest.getAddress(), E, Dest.mayOverlap()); d684 2 a685 2 numElements = ConstantEmitter(CGF).tryEmitAbstract(e->getArraySize(), e->getType()); d923 1 a923 2 QualType AllocType, Address NewPtr, AggValueSlot::Overlap_t MayOverlap) { d939 1 a939 2 AggValueSlot::IsNotAliased, MayOverlap); d1008 1 a1008 2 AggValueSlot::IsNotAliased, AggValueSlot::DoesNotOverlap); d1073 1 a1073 2 ILE->getInit(i)->getType(), CurPtr, AggValueSlot::DoesNotOverlap); d1226 1 a1226 2 StoreAnyExprIntoOneUnit(*this, Init, Init->getType(), CurPtr, AggValueSlot::DoesNotOverlap); d1257 1 a1257 2 StoreAnyExprIntoOneUnit(CGF, Init, E->getAllocatedType(), NewPtr, AggValueSlot::DoesNotOverlap); d1297 1 a1297 1 const CallExpr *TheCall, d1300 2 a1301 1 EmitCallArgs(Args, Type->getParamTypes(), TheCall->arguments()); a1305 1 d1309 1 a1309 1 return EmitNewDeleteCall(*this, FD, Type, Args); d1313 2 a1314 13 namespace { /// The parameters to pass to a usual operator delete. struct UsualDeleteParams { bool DestroyingDelete = false; bool Size = false; bool Alignment = false; }; } static UsualDeleteParams getUsualDeleteParams(const FunctionDecl *FD) { UsualDeleteParams Params; const FunctionProtoType *FPT = FD->getType()->castAs(); d1320 3 a1322 6 // The next parameter may be a std::destroying_delete_t. if (FD->isDestroyingOperatorDelete()) { Params.DestroyingDelete = true; assert(AI != AE); ++AI; } a1323 1 // Figure out what other parameters we should be implicitly passing. d1325 1 a1325 1 Params.Size = true; d1330 1 a1330 1 Params.Alignment = true; d1335 1 a1335 1 return Params; d1388 1 a1388 2 // The first argument is always a void* (or C* for a destroying operator // delete for class type C). d1392 2 a1393 1 UsualDeleteParams Params; d1397 1 a1397 1 Params.Alignment = PassAlignmentToPlacementDelete; d1401 2 a1402 1 Params = getUsualDeleteParams(OperatorDelete); a1404 3 assert(!Params.DestroyingDelete && "should not call destroying delete in a new-expression"); d1406 1 a1406 1 if (Params.Size) d1414 1 a1414 1 if (Params.Alignment) d1463 1 a1463 1 Cleanup->setPlacementArg(I, Arg.getRValue(CGF), Arg.Ty); d1494 2 a1495 2 Cleanup->setPlacementArg( I, DominatingValue::save(CGF, Arg.getRValue(CGF)), Arg.Ty); d1660 1 a1660 1 // Passing pointer through launder.invariant.group to avoid propagation of d1666 1 a1666 1 result = Address(Builder.CreateLaunderInvariantGroup(result.getPointer()), d1717 3 a1719 1 auto Params = getUsualDeleteParams(DeleteFD); a1726 8 // Pass the std::destroying_delete tag if present. if (Params.DestroyingDelete) { QualType DDTag = *ParamTypeIt++; // Just pass an 'undef'. We expect the tag type to be an empty struct. auto *V = llvm::UndefValue::get(getTypes().ConvertType(DDTag)); DeleteArgs.add(RValue::get(V), DDTag); } d1728 1 a1728 1 if (Params.Size) { d1747 1 a1747 1 if (Params.Alignment) { a1788 15 /// Emit the code for deleting a single object with a destroying operator /// delete. If the element type has a non-virtual destructor, Ptr has already /// been converted to the type of the parameter of 'operator delete'. Otherwise /// Ptr points to an object of the static type. static void EmitDestroyingObjectDelete(CodeGenFunction &CGF, const CXXDeleteExpr *DE, Address Ptr, QualType ElementType) { auto *Dtor = ElementType->getAsCXXRecordDecl()->getDestructor(); if (Dtor && Dtor->isVirtual()) CGF.CGM.getCXXABI().emitVirtualObjectDelete(CGF, DE, Ptr, ElementType, Dtor); else CGF.EmitDeleteCall(DE->getOperatorDelete(), Ptr.getPointer(), ElementType); } a1802 3 const FunctionDecl *OperatorDelete = DE->getOperatorDelete(); assert(!OperatorDelete->isDestroyingOperatorDelete()); d1822 1 a1933 10 QualType DeleteTy = E->getDestroyedType(); // A destroying operator delete overrides the entire operation of the // delete expression. if (E->getOperatorDelete()->isDestroyingOperatorDelete()) { EmitDestroyingObjectDelete(*this, E, Ptr, DeleteTy); EmitBlock(DeleteEnd); return; } d1937 1 a2005 9 QualType SrcRecordTy = E->getType(); // C++ [class.cdtor]p4: // If the operand of typeid refers to the object under construction or // destruction and the static type of the operand is neither the constructor // or destructor’s class nor one of its bases, the behavior is undefined. CGF.EmitTypeCheck(CodeGenFunction::TCK_DynamicOperation, E->getExprLoc(), ThisPtr.getPointer(), SrcRecordTy); d2014 1 d2077 4 a2100 12 // C++ [class.cdtor]p5: // If the operand of the dynamic_cast refers to the object under // construction or destruction and the static type of the operand is not a // pointer to or object of the constructor or destructor’s own class or one // of its bases, the dynamic_cast results in undefined behavior. EmitTypeCheck(TCK_DynamicOperation, DCE->getExprLoc(), ThisAddr.getPointer(), SrcRecordTy); if (DCE->isAlwaysNull()) if (llvm::Value *T = EmitDynamicCastToNull(*this, DestTy)) return T; @ 1.1.1.13 log @Mark old LLVM instance as dead. @ text @@ 1.1.1.7.4.1 log @file CGExprCXX.cpp was added on branch tls-maxphys on 2014-08-19 23:47:27 +0000 @ text @d1 1818 @ 1.1.1.7.4.2 log @Rebase to HEAD as of a few days ago. @ text @a0 1818 //===--- CGExprCXX.cpp - Emit LLVM Code for C++ expressions ---------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This contains code dealing with code generation of C++ expressions // //===----------------------------------------------------------------------===// #include "CodeGenFunction.h" #include "CGCUDARuntime.h" #include "CGCXXABI.h" #include "CGDebugInfo.h" #include "CGObjCRuntime.h" #include "clang/CodeGen/CGFunctionInfo.h" #include "clang/Frontend/CodeGenOptions.h" #include "llvm/IR/CallSite.h" #include "llvm/IR/Intrinsics.h" using namespace clang; using namespace CodeGen; RValue CodeGenFunction::EmitCXXMemberCall(const CXXMethodDecl *MD, SourceLocation CallLoc, llvm::Value *Callee, ReturnValueSlot ReturnValue, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, CallExpr::const_arg_iterator ArgBeg, CallExpr::const_arg_iterator ArgEnd) { assert(MD->isInstance() && "Trying to emit a member call expr on a static method!"); // C++11 [class.mfct.non-static]p2: // If a non-static member function of a class X is called for an object that // is not of type X, or of a type derived from X, the behavior is undefined. EmitTypeCheck(isa(MD) ? TCK_ConstructorCall : TCK_MemberCall, CallLoc, This, getContext().getRecordType(MD->getParent())); CallArgList Args; // Push the this ptr. Args.add(RValue::get(This), MD->getThisType(getContext())); // If there is an implicit parameter (e.g. VTT), emit it. if (ImplicitParam) { Args.add(RValue::get(ImplicitParam), ImplicitParamTy); } const FunctionProtoType *FPT = MD->getType()->castAs(); RequiredArgs required = RequiredArgs::forPrototypePlus(FPT, Args.size()); // And the rest of the call args. EmitCallArgs(Args, FPT, ArgBeg, ArgEnd); return EmitCall(CGM.getTypes().arrangeCXXMethodCall(Args, FPT, required), Callee, ReturnValue, Args, MD); } static CXXRecordDecl *getCXXRecord(const Expr *E) { QualType T = E->getType(); if (const PointerType *PTy = T->getAs()) T = PTy->getPointeeType(); const RecordType *Ty = T->castAs(); return cast(Ty->getDecl()); } // Note: This function also emit constructor calls to support a MSVC // extensions allowing explicit constructor function call. RValue CodeGenFunction::EmitCXXMemberCallExpr(const CXXMemberCallExpr *CE, ReturnValueSlot ReturnValue) { const Expr *callee = CE->getCallee()->IgnoreParens(); if (isa(callee)) return EmitCXXMemberPointerCallExpr(CE, ReturnValue); const MemberExpr *ME = cast(callee); const CXXMethodDecl *MD = cast(ME->getMemberDecl()); if (MD->isStatic()) { // The method is static, emit it as we would a regular call. llvm::Value *Callee = CGM.GetAddrOfFunction(MD); return EmitCall(getContext().getPointerType(MD->getType()), Callee, CE->getLocStart(), ReturnValue, CE->arg_begin(), CE->arg_end()); } // Compute the object pointer. const Expr *Base = ME->getBase(); bool CanUseVirtualCall = MD->isVirtual() && !ME->hasQualifier(); const CXXMethodDecl *DevirtualizedMethod = nullptr; if (CanUseVirtualCall && CanDevirtualizeMemberFunctionCall(Base, MD)) { const CXXRecordDecl *BestDynamicDecl = Base->getBestDynamicClassType(); DevirtualizedMethod = MD->getCorrespondingMethodInClass(BestDynamicDecl); assert(DevirtualizedMethod); const CXXRecordDecl *DevirtualizedClass = DevirtualizedMethod->getParent(); const Expr *Inner = Base->ignoreParenBaseCasts(); if (getCXXRecord(Inner) == DevirtualizedClass) // If the class of the Inner expression is where the dynamic method // is defined, build the this pointer from it. Base = Inner; else if (getCXXRecord(Base) != DevirtualizedClass) { // If the method is defined in a class that is not the best dynamic // one or the one of the full expression, we would have to build // a derived-to-base cast to compute the correct this pointer, but // we don't have support for that yet, so do a virtual call. DevirtualizedMethod = nullptr; } // If the return types are not the same, this might be a case where more // code needs to run to compensate for it. For example, the derived // method might return a type that inherits form from the return // type of MD and has a prefix. // For now we just avoid devirtualizing these covariant cases. if (DevirtualizedMethod && DevirtualizedMethod->getReturnType().getCanonicalType() != MD->getReturnType().getCanonicalType()) DevirtualizedMethod = nullptr; } llvm::Value *This; if (ME->isArrow()) This = EmitScalarExpr(Base); else This = EmitLValue(Base).getAddress(); if (MD->isTrivial()) { if (isa(MD)) return RValue::get(nullptr); if (isa(MD) && cast(MD)->isDefaultConstructor()) return RValue::get(nullptr); if (MD->isCopyAssignmentOperator() || MD->isMoveAssignmentOperator()) { // We don't like to generate the trivial copy/move assignment operator // when it isn't necessary; just produce the proper effect here. llvm::Value *RHS = EmitLValue(*CE->arg_begin()).getAddress(); EmitAggregateAssign(This, RHS, CE->getType()); return RValue::get(This); } if (isa(MD) && cast(MD)->isCopyOrMoveConstructor()) { // Trivial move and copy ctor are the same. llvm::Value *RHS = EmitLValue(*CE->arg_begin()).getAddress(); EmitSynthesizedCXXCopyCtorCall(cast(MD), This, RHS, CE->arg_begin(), CE->arg_end()); return RValue::get(This); } llvm_unreachable("unknown trivial member function"); } // Compute the function type we're calling. const CXXMethodDecl *CalleeDecl = DevirtualizedMethod ? DevirtualizedMethod : MD; const CGFunctionInfo *FInfo = nullptr; if (const CXXDestructorDecl *Dtor = dyn_cast(CalleeDecl)) FInfo = &CGM.getTypes().arrangeCXXDestructor(Dtor, Dtor_Complete); else if (const CXXConstructorDecl *Ctor = dyn_cast(CalleeDecl)) FInfo = &CGM.getTypes().arrangeCXXConstructorDeclaration(Ctor, Ctor_Complete); else FInfo = &CGM.getTypes().arrangeCXXMethodDeclaration(CalleeDecl); llvm::FunctionType *Ty = CGM.getTypes().GetFunctionType(*FInfo); // C++ [class.virtual]p12: // Explicit qualification with the scope operator (5.1) suppresses the // virtual call mechanism. // // We also don't emit a virtual call if the base expression has a record type // because then we know what the type is. bool UseVirtualCall = CanUseVirtualCall && !DevirtualizedMethod; llvm::Value *Callee; if (const CXXDestructorDecl *Dtor = dyn_cast(MD)) { assert(CE->arg_begin() == CE->arg_end() && "Destructor shouldn't have explicit parameters"); assert(ReturnValue.isNull() && "Destructor shouldn't have return value"); if (UseVirtualCall) { CGM.getCXXABI().EmitVirtualDestructorCall(*this, Dtor, Dtor_Complete, CE->getExprLoc(), This); } else { if (getLangOpts().AppleKext && MD->isVirtual() && ME->hasQualifier()) Callee = BuildAppleKextVirtualCall(MD, ME->getQualifier(), Ty); else if (!DevirtualizedMethod) Callee = CGM.GetAddrOfCXXDestructor(Dtor, Dtor_Complete, FInfo, Ty); else { const CXXDestructorDecl *DDtor = cast(DevirtualizedMethod); Callee = CGM.GetAddrOfFunction(GlobalDecl(DDtor, Dtor_Complete), Ty); } EmitCXXMemberCall(MD, CE->getExprLoc(), Callee, ReturnValue, This, /*ImplicitParam=*/nullptr, QualType(), nullptr,nullptr); } return RValue::get(nullptr); } if (const CXXConstructorDecl *Ctor = dyn_cast(MD)) { Callee = CGM.GetAddrOfFunction(GlobalDecl(Ctor, Ctor_Complete), Ty); } else if (UseVirtualCall) { Callee = CGM.getCXXABI().getVirtualFunctionPointer(*this, MD, This, Ty); } else { if (getLangOpts().AppleKext && MD->isVirtual() && ME->hasQualifier()) Callee = BuildAppleKextVirtualCall(MD, ME->getQualifier(), Ty); else if (!DevirtualizedMethod) Callee = CGM.GetAddrOfFunction(MD, Ty); else { Callee = CGM.GetAddrOfFunction(DevirtualizedMethod, Ty); } } if (MD->isVirtual()) { This = CGM.getCXXABI().adjustThisArgumentForVirtualFunctionCall( *this, MD, This, UseVirtualCall); } return EmitCXXMemberCall(MD, CE->getExprLoc(), Callee, ReturnValue, This, /*ImplicitParam=*/nullptr, QualType(), CE->arg_begin(), CE->arg_end()); } RValue CodeGenFunction::EmitCXXMemberPointerCallExpr(const CXXMemberCallExpr *E, ReturnValueSlot ReturnValue) { const BinaryOperator *BO = cast(E->getCallee()->IgnoreParens()); const Expr *BaseExpr = BO->getLHS(); const Expr *MemFnExpr = BO->getRHS(); const MemberPointerType *MPT = MemFnExpr->getType()->castAs(); const FunctionProtoType *FPT = MPT->getPointeeType()->castAs(); const CXXRecordDecl *RD = cast(MPT->getClass()->getAs()->getDecl()); // Get the member function pointer. llvm::Value *MemFnPtr = EmitScalarExpr(MemFnExpr); // Emit the 'this' pointer. llvm::Value *This; if (BO->getOpcode() == BO_PtrMemI) This = EmitScalarExpr(BaseExpr); else This = EmitLValue(BaseExpr).getAddress(); EmitTypeCheck(TCK_MemberCall, E->getExprLoc(), This, QualType(MPT->getClass(), 0)); // Ask the ABI to load the callee. Note that This is modified. llvm::Value *Callee = CGM.getCXXABI().EmitLoadOfMemberFunctionPointer(*this, BO, This, MemFnPtr, MPT); CallArgList Args; QualType ThisType = getContext().getPointerType(getContext().getTagDeclType(RD)); // Push the this ptr. Args.add(RValue::get(This), ThisType); RequiredArgs required = RequiredArgs::forPrototypePlus(FPT, 1); // And the rest of the call args EmitCallArgs(Args, FPT, E->arg_begin(), E->arg_end()); return EmitCall(CGM.getTypes().arrangeCXXMethodCall(Args, FPT, required), Callee, ReturnValue, Args); } RValue CodeGenFunction::EmitCXXOperatorMemberCallExpr(const CXXOperatorCallExpr *E, const CXXMethodDecl *MD, ReturnValueSlot ReturnValue) { assert(MD->isInstance() && "Trying to emit a member call expr on a static method!"); LValue LV = EmitLValue(E->getArg(0)); llvm::Value *This = LV.getAddress(); if ((MD->isCopyAssignmentOperator() || MD->isMoveAssignmentOperator()) && MD->isTrivial()) { llvm::Value *Src = EmitLValue(E->getArg(1)).getAddress(); QualType Ty = E->getType(); EmitAggregateAssign(This, Src, Ty); return RValue::get(This); } llvm::Value *Callee = EmitCXXOperatorMemberCallee(E, MD, This); return EmitCXXMemberCall(MD, E->getExprLoc(), Callee, ReturnValue, This, /*ImplicitParam=*/nullptr, QualType(), E->arg_begin() + 1, E->arg_end()); } RValue CodeGenFunction::EmitCUDAKernelCallExpr(const CUDAKernelCallExpr *E, ReturnValueSlot ReturnValue) { return CGM.getCUDARuntime().EmitCUDAKernelCallExpr(*this, E, ReturnValue); } static void EmitNullBaseClassInitialization(CodeGenFunction &CGF, llvm::Value *DestPtr, const CXXRecordDecl *Base) { if (Base->isEmpty()) return; DestPtr = CGF.EmitCastToVoidPtr(DestPtr); const ASTRecordLayout &Layout = CGF.getContext().getASTRecordLayout(Base); CharUnits Size = Layout.getNonVirtualSize(); CharUnits Align = Layout.getNonVirtualAlignment(); llvm::Value *SizeVal = CGF.CGM.getSize(Size); // If the type contains a pointer to data member we can't memset it to zero. // Instead, create a null constant and copy it to the destination. // TODO: there are other patterns besides zero that we can usefully memset, // like -1, which happens to be the pattern used by member-pointers. // TODO: isZeroInitializable can be over-conservative in the case where a // virtual base contains a member pointer. if (!CGF.CGM.getTypes().isZeroInitializable(Base)) { llvm::Constant *NullConstant = CGF.CGM.EmitNullConstantForBase(Base); llvm::GlobalVariable *NullVariable = new llvm::GlobalVariable(CGF.CGM.getModule(), NullConstant->getType(), /*isConstant=*/true, llvm::GlobalVariable::PrivateLinkage, NullConstant, Twine()); NullVariable->setAlignment(Align.getQuantity()); llvm::Value *SrcPtr = CGF.EmitCastToVoidPtr(NullVariable); // Get and call the appropriate llvm.memcpy overload. CGF.Builder.CreateMemCpy(DestPtr, SrcPtr, SizeVal, Align.getQuantity()); return; } // Otherwise, just memset the whole thing to zero. This is legal // because in LLVM, all default initializers (other than the ones we just // handled above) are guaranteed to have a bit pattern of all zeros. CGF.Builder.CreateMemSet(DestPtr, CGF.Builder.getInt8(0), SizeVal, Align.getQuantity()); } void CodeGenFunction::EmitCXXConstructExpr(const CXXConstructExpr *E, AggValueSlot Dest) { assert(!Dest.isIgnored() && "Must have a destination!"); const CXXConstructorDecl *CD = E->getConstructor(); // If we require zero initialization before (or instead of) calling the // constructor, as can be the case with a non-user-provided default // constructor, emit the zero initialization now, unless destination is // already zeroed. if (E->requiresZeroInitialization() && !Dest.isZeroed()) { switch (E->getConstructionKind()) { case CXXConstructExpr::CK_Delegating: case CXXConstructExpr::CK_Complete: EmitNullInitialization(Dest.getAddr(), E->getType()); break; case CXXConstructExpr::CK_VirtualBase: case CXXConstructExpr::CK_NonVirtualBase: EmitNullBaseClassInitialization(*this, Dest.getAddr(), CD->getParent()); break; } } // If this is a call to a trivial default constructor, do nothing. if (CD->isTrivial() && CD->isDefaultConstructor()) return; // Elide the constructor if we're constructing from a temporary. // The temporary check is required because Sema sets this on NRVO // returns. if (getLangOpts().ElideConstructors && E->isElidable()) { assert(getContext().hasSameUnqualifiedType(E->getType(), E->getArg(0)->getType())); if (E->getArg(0)->isTemporaryObject(getContext(), CD->getParent())) { EmitAggExpr(E->getArg(0), Dest); return; } } if (const ConstantArrayType *arrayType = getContext().getAsConstantArrayType(E->getType())) { EmitCXXAggrConstructorCall(CD, arrayType, Dest.getAddr(), E->arg_begin(), E->arg_end()); } else { CXXCtorType Type = Ctor_Complete; bool ForVirtualBase = false; bool Delegating = false; switch (E->getConstructionKind()) { case CXXConstructExpr::CK_Delegating: // We should be emitting a constructor; GlobalDecl will assert this Type = CurGD.getCtorType(); Delegating = true; break; case CXXConstructExpr::CK_Complete: Type = Ctor_Complete; break; case CXXConstructExpr::CK_VirtualBase: ForVirtualBase = true; // fall-through case CXXConstructExpr::CK_NonVirtualBase: Type = Ctor_Base; } // Call the constructor. EmitCXXConstructorCall(CD, Type, ForVirtualBase, Delegating, Dest.getAddr(), E->arg_begin(), E->arg_end()); } } void CodeGenFunction::EmitSynthesizedCXXCopyCtor(llvm::Value *Dest, llvm::Value *Src, const Expr *Exp) { if (const ExprWithCleanups *E = dyn_cast(Exp)) Exp = E->getSubExpr(); assert(isa(Exp) && "EmitSynthesizedCXXCopyCtor - unknown copy ctor expr"); const CXXConstructExpr* E = cast(Exp); const CXXConstructorDecl *CD = E->getConstructor(); RunCleanupsScope Scope(*this); // If we require zero initialization before (or instead of) calling the // constructor, as can be the case with a non-user-provided default // constructor, emit the zero initialization now. // FIXME. Do I still need this for a copy ctor synthesis? if (E->requiresZeroInitialization()) EmitNullInitialization(Dest, E->getType()); assert(!getContext().getAsConstantArrayType(E->getType()) && "EmitSynthesizedCXXCopyCtor - Copied-in Array"); EmitSynthesizedCXXCopyCtorCall(CD, Dest, Src, E->arg_begin(), E->arg_end()); } static CharUnits CalculateCookiePadding(CodeGenFunction &CGF, const CXXNewExpr *E) { if (!E->isArray()) return CharUnits::Zero(); // No cookie is required if the operator new[] being used is the // reserved placement operator new[]. if (E->getOperatorNew()->isReservedGlobalPlacementOperator()) return CharUnits::Zero(); return CGF.CGM.getCXXABI().GetArrayCookieSize(E); } static llvm::Value *EmitCXXNewAllocSize(CodeGenFunction &CGF, const CXXNewExpr *e, unsigned minElements, llvm::Value *&numElements, llvm::Value *&sizeWithoutCookie) { QualType type = e->getAllocatedType(); if (!e->isArray()) { CharUnits typeSize = CGF.getContext().getTypeSizeInChars(type); sizeWithoutCookie = llvm::ConstantInt::get(CGF.SizeTy, typeSize.getQuantity()); return sizeWithoutCookie; } // The width of size_t. unsigned sizeWidth = CGF.SizeTy->getBitWidth(); // Figure out the cookie size. llvm::APInt cookieSize(sizeWidth, CalculateCookiePadding(CGF, e).getQuantity()); // Emit the array size expression. // We multiply the size of all dimensions for NumElements. // e.g for 'int[2][3]', ElemType is 'int' and NumElements is 6. numElements = CGF.EmitScalarExpr(e->getArraySize()); assert(isa(numElements->getType())); // The number of elements can be have an arbitrary integer type; // essentially, we need to multiply it by a constant factor, add a // cookie size, and verify that the result is representable as a // size_t. That's just a gloss, though, and it's wrong in one // important way: if the count is negative, it's an error even if // the cookie size would bring the total size >= 0. bool isSigned = e->getArraySize()->getType()->isSignedIntegerOrEnumerationType(); llvm::IntegerType *numElementsType = cast(numElements->getType()); unsigned numElementsWidth = numElementsType->getBitWidth(); // Compute the constant factor. llvm::APInt arraySizeMultiplier(sizeWidth, 1); while (const ConstantArrayType *CAT = CGF.getContext().getAsConstantArrayType(type)) { type = CAT->getElementType(); arraySizeMultiplier *= CAT->getSize(); } CharUnits typeSize = CGF.getContext().getTypeSizeInChars(type); llvm::APInt typeSizeMultiplier(sizeWidth, typeSize.getQuantity()); typeSizeMultiplier *= arraySizeMultiplier; // This will be a size_t. llvm::Value *size; // If someone is doing 'new int[42]' there is no need to do a dynamic check. // Don't bloat the -O0 code. if (llvm::ConstantInt *numElementsC = dyn_cast(numElements)) { const llvm::APInt &count = numElementsC->getValue(); bool hasAnyOverflow = false; // If 'count' was a negative number, it's an overflow. if (isSigned && count.isNegative()) hasAnyOverflow = true; // We want to do all this arithmetic in size_t. If numElements is // wider than that, check whether it's already too big, and if so, // overflow. else if (numElementsWidth > sizeWidth && numElementsWidth - sizeWidth > count.countLeadingZeros()) hasAnyOverflow = true; // Okay, compute a count at the right width. llvm::APInt adjustedCount = count.zextOrTrunc(sizeWidth); // If there is a brace-initializer, we cannot allocate fewer elements than // there are initializers. If we do, that's treated like an overflow. if (adjustedCount.ult(minElements)) hasAnyOverflow = true; // Scale numElements by that. This might overflow, but we don't // care because it only overflows if allocationSize does, too, and // if that overflows then we shouldn't use this. numElements = llvm::ConstantInt::get(CGF.SizeTy, adjustedCount * arraySizeMultiplier); // Compute the size before cookie, and track whether it overflowed. bool overflow; llvm::APInt allocationSize = adjustedCount.umul_ov(typeSizeMultiplier, overflow); hasAnyOverflow |= overflow; // Add in the cookie, and check whether it's overflowed. if (cookieSize != 0) { // Save the current size without a cookie. This shouldn't be // used if there was overflow. sizeWithoutCookie = llvm::ConstantInt::get(CGF.SizeTy, allocationSize); allocationSize = allocationSize.uadd_ov(cookieSize, overflow); hasAnyOverflow |= overflow; } // On overflow, produce a -1 so operator new will fail. if (hasAnyOverflow) { size = llvm::Constant::getAllOnesValue(CGF.SizeTy); } else { size = llvm::ConstantInt::get(CGF.SizeTy, allocationSize); } // Otherwise, we might need to use the overflow intrinsics. } else { // There are up to five conditions we need to test for: // 1) if isSigned, we need to check whether numElements is negative; // 2) if numElementsWidth > sizeWidth, we need to check whether // numElements is larger than something representable in size_t; // 3) if minElements > 0, we need to check whether numElements is smaller // than that. // 4) we need to compute // sizeWithoutCookie := numElements * typeSizeMultiplier // and check whether it overflows; and // 5) if we need a cookie, we need to compute // size := sizeWithoutCookie + cookieSize // and check whether it overflows. llvm::Value *hasOverflow = nullptr; // If numElementsWidth > sizeWidth, then one way or another, we're // going to have to do a comparison for (2), and this happens to // take care of (1), too. if (numElementsWidth > sizeWidth) { llvm::APInt threshold(numElementsWidth, 1); threshold <<= sizeWidth; llvm::Value *thresholdV = llvm::ConstantInt::get(numElementsType, threshold); hasOverflow = CGF.Builder.CreateICmpUGE(numElements, thresholdV); numElements = CGF.Builder.CreateTrunc(numElements, CGF.SizeTy); // Otherwise, if we're signed, we want to sext up to size_t. } else if (isSigned) { if (numElementsWidth < sizeWidth) numElements = CGF.Builder.CreateSExt(numElements, CGF.SizeTy); // If there's a non-1 type size multiplier, then we can do the // signedness check at the same time as we do the multiply // because a negative number times anything will cause an // unsigned overflow. Otherwise, we have to do it here. But at least // in this case, we can subsume the >= minElements check. if (typeSizeMultiplier == 1) hasOverflow = CGF.Builder.CreateICmpSLT(numElements, llvm::ConstantInt::get(CGF.SizeTy, minElements)); // Otherwise, zext up to size_t if necessary. } else if (numElementsWidth < sizeWidth) { numElements = CGF.Builder.CreateZExt(numElements, CGF.SizeTy); } assert(numElements->getType() == CGF.SizeTy); if (minElements) { // Don't allow allocation of fewer elements than we have initializers. if (!hasOverflow) { hasOverflow = CGF.Builder.CreateICmpULT(numElements, llvm::ConstantInt::get(CGF.SizeTy, minElements)); } else if (numElementsWidth > sizeWidth) { // The other existing overflow subsumes this check. // We do an unsigned comparison, since any signed value < -1 is // taken care of either above or below. hasOverflow = CGF.Builder.CreateOr(hasOverflow, CGF.Builder.CreateICmpULT(numElements, llvm::ConstantInt::get(CGF.SizeTy, minElements))); } } size = numElements; // Multiply by the type size if necessary. This multiplier // includes all the factors for nested arrays. // // This step also causes numElements to be scaled up by the // nested-array factor if necessary. Overflow on this computation // can be ignored because the result shouldn't be used if // allocation fails. if (typeSizeMultiplier != 1) { llvm::Value *umul_with_overflow = CGF.CGM.getIntrinsic(llvm::Intrinsic::umul_with_overflow, CGF.SizeTy); llvm::Value *tsmV = llvm::ConstantInt::get(CGF.SizeTy, typeSizeMultiplier); llvm::Value *result = CGF.Builder.CreateCall2(umul_with_overflow, size, tsmV); llvm::Value *overflowed = CGF.Builder.CreateExtractValue(result, 1); if (hasOverflow) hasOverflow = CGF.Builder.CreateOr(hasOverflow, overflowed); else hasOverflow = overflowed; size = CGF.Builder.CreateExtractValue(result, 0); // Also scale up numElements by the array size multiplier. if (arraySizeMultiplier != 1) { // If the base element type size is 1, then we can re-use the // multiply we just did. if (typeSize.isOne()) { assert(arraySizeMultiplier == typeSizeMultiplier); numElements = size; // Otherwise we need a separate multiply. } else { llvm::Value *asmV = llvm::ConstantInt::get(CGF.SizeTy, arraySizeMultiplier); numElements = CGF.Builder.CreateMul(numElements, asmV); } } } else { // numElements doesn't need to be scaled. assert(arraySizeMultiplier == 1); } // Add in the cookie size if necessary. if (cookieSize != 0) { sizeWithoutCookie = size; llvm::Value *uadd_with_overflow = CGF.CGM.getIntrinsic(llvm::Intrinsic::uadd_with_overflow, CGF.SizeTy); llvm::Value *cookieSizeV = llvm::ConstantInt::get(CGF.SizeTy, cookieSize); llvm::Value *result = CGF.Builder.CreateCall2(uadd_with_overflow, size, cookieSizeV); llvm::Value *overflowed = CGF.Builder.CreateExtractValue(result, 1); if (hasOverflow) hasOverflow = CGF.Builder.CreateOr(hasOverflow, overflowed); else hasOverflow = overflowed; size = CGF.Builder.CreateExtractValue(result, 0); } // If we had any possibility of dynamic overflow, make a select to // overwrite 'size' with an all-ones value, which should cause // operator new to throw. if (hasOverflow) size = CGF.Builder.CreateSelect(hasOverflow, llvm::Constant::getAllOnesValue(CGF.SizeTy), size); } if (cookieSize == 0) sizeWithoutCookie = size; else assert(sizeWithoutCookie && "didn't set sizeWithoutCookie?"); return size; } static void StoreAnyExprIntoOneUnit(CodeGenFunction &CGF, const Expr *Init, QualType AllocType, llvm::Value *NewPtr) { // FIXME: Refactor with EmitExprAsInit. CharUnits Alignment = CGF.getContext().getTypeAlignInChars(AllocType); switch (CGF.getEvaluationKind(AllocType)) { case TEK_Scalar: CGF.EmitScalarInit(Init, nullptr, CGF.MakeAddrLValue(NewPtr, AllocType, Alignment), false); return; case TEK_Complex: CGF.EmitComplexExprIntoLValue(Init, CGF.MakeAddrLValue(NewPtr, AllocType, Alignment), /*isInit*/ true); return; case TEK_Aggregate: { AggValueSlot Slot = AggValueSlot::forAddr(NewPtr, Alignment, AllocType.getQualifiers(), AggValueSlot::IsDestructed, AggValueSlot::DoesNotNeedGCBarriers, AggValueSlot::IsNotAliased); CGF.EmitAggExpr(Init, Slot); return; } } llvm_unreachable("bad evaluation kind"); } void CodeGenFunction::EmitNewArrayInitializer(const CXXNewExpr *E, QualType ElementType, llvm::Value *BeginPtr, llvm::Value *NumElements, llvm::Value *AllocSizeWithoutCookie) { // If we have a type with trivial initialization and no initializer, // there's nothing to do. if (!E->hasInitializer()) return; llvm::Value *CurPtr = BeginPtr; unsigned InitListElements = 0; const Expr *Init = E->getInitializer(); llvm::AllocaInst *EndOfInit = nullptr; QualType::DestructionKind DtorKind = ElementType.isDestructedType(); EHScopeStack::stable_iterator Cleanup; llvm::Instruction *CleanupDominator = nullptr; // If the initializer is an initializer list, first do the explicit elements. if (const InitListExpr *ILE = dyn_cast(Init)) { InitListElements = ILE->getNumInits(); // If this is a multi-dimensional array new, we will initialize multiple // elements with each init list element. QualType AllocType = E->getAllocatedType(); if (const ConstantArrayType *CAT = dyn_cast_or_null( AllocType->getAsArrayTypeUnsafe())) { unsigned AS = CurPtr->getType()->getPointerAddressSpace(); llvm::Type *AllocPtrTy = ConvertTypeForMem(AllocType)->getPointerTo(AS); CurPtr = Builder.CreateBitCast(CurPtr, AllocPtrTy); InitListElements *= getContext().getConstantArrayElementCount(CAT); } // Enter a partial-destruction Cleanup if necessary. if (needsEHCleanup(DtorKind)) { // In principle we could tell the Cleanup where we are more // directly, but the control flow can get so varied here that it // would actually be quite complex. Therefore we go through an // alloca. EndOfInit = CreateTempAlloca(BeginPtr->getType(), "array.init.end"); CleanupDominator = Builder.CreateStore(BeginPtr, EndOfInit); pushIrregularPartialArrayCleanup(BeginPtr, EndOfInit, ElementType, getDestroyer(DtorKind)); Cleanup = EHStack.stable_begin(); } for (unsigned i = 0, e = ILE->getNumInits(); i != e; ++i) { // Tell the cleanup that it needs to destroy up to this // element. TODO: some of these stores can be trivially // observed to be unnecessary. if (EndOfInit) Builder.CreateStore(Builder.CreateBitCast(CurPtr, BeginPtr->getType()), EndOfInit); // FIXME: If the last initializer is an incomplete initializer list for // an array, and we have an array filler, we can fold together the two // initialization loops. StoreAnyExprIntoOneUnit(*this, ILE->getInit(i), ILE->getInit(i)->getType(), CurPtr); CurPtr = Builder.CreateConstInBoundsGEP1_32(CurPtr, 1, "array.exp.next"); } // The remaining elements are filled with the array filler expression. Init = ILE->getArrayFiller(); // Extract the initializer for the individual array elements by pulling // out the array filler from all the nested initializer lists. This avoids // generating a nested loop for the initialization. while (Init && Init->getType()->isConstantArrayType()) { auto *SubILE = dyn_cast(Init); if (!SubILE) break; assert(SubILE->getNumInits() == 0 && "explicit inits in array filler?"); Init = SubILE->getArrayFiller(); } // Switch back to initializing one base element at a time. CurPtr = Builder.CreateBitCast(CurPtr, BeginPtr->getType()); } // Attempt to perform zero-initialization using memset. auto TryMemsetInitialization = [&]() -> bool { // FIXME: If the type is a pointer-to-data-member under the Itanium ABI, // we can initialize with a memset to -1. if (!CGM.getTypes().isZeroInitializable(ElementType)) return false; // Optimization: since zero initialization will just set the memory // to all zeroes, generate a single memset to do it in one shot. // Subtract out the size of any elements we've already initialized. auto *RemainingSize = AllocSizeWithoutCookie; if (InitListElements) { // We know this can't overflow; we check this when doing the allocation. auto *InitializedSize = llvm::ConstantInt::get( RemainingSize->getType(), getContext().getTypeSizeInChars(ElementType).getQuantity() * InitListElements); RemainingSize = Builder.CreateSub(RemainingSize, InitializedSize); } // Create the memset. CharUnits Alignment = getContext().getTypeAlignInChars(ElementType); Builder.CreateMemSet(CurPtr, Builder.getInt8(0), RemainingSize, Alignment.getQuantity(), false); return true; }; // If all elements have already been initialized, skip any further // initialization. llvm::ConstantInt *ConstNum = dyn_cast(NumElements); if (ConstNum && ConstNum->getZExtValue() <= InitListElements) { // If there was a Cleanup, deactivate it. if (CleanupDominator) DeactivateCleanupBlock(Cleanup, CleanupDominator); return; } assert(Init && "have trailing elements to initialize but no initializer"); // If this is a constructor call, try to optimize it out, and failing that // emit a single loop to initialize all remaining elements. if (const CXXConstructExpr *CCE = dyn_cast(Init)) { CXXConstructorDecl *Ctor = CCE->getConstructor(); if (Ctor->isTrivial()) { // If new expression did not specify value-initialization, then there // is no initialization. if (!CCE->requiresZeroInitialization() || Ctor->getParent()->isEmpty()) return; if (TryMemsetInitialization()) return; } // Store the new Cleanup position for irregular Cleanups. // // FIXME: Share this cleanup with the constructor call emission rather than // having it create a cleanup of its own. if (EndOfInit) Builder.CreateStore(CurPtr, EndOfInit); // Emit a constructor call loop to initialize the remaining elements. if (InitListElements) NumElements = Builder.CreateSub( NumElements, llvm::ConstantInt::get(NumElements->getType(), InitListElements)); EmitCXXAggrConstructorCall(Ctor, NumElements, CurPtr, CCE->arg_begin(), CCE->arg_end(), CCE->requiresZeroInitialization()); return; } // If this is value-initialization, we can usually use memset. ImplicitValueInitExpr IVIE(ElementType); if (isa(Init)) { if (TryMemsetInitialization()) return; // Switch to an ImplicitValueInitExpr for the element type. This handles // only one case: multidimensional array new of pointers to members. In // all other cases, we already have an initializer for the array element. Init = &IVIE; } // At this point we should have found an initializer for the individual // elements of the array. assert(getContext().hasSameUnqualifiedType(ElementType, Init->getType()) && "got wrong type of element to initialize"); // If we have an empty initializer list, we can usually use memset. if (auto *ILE = dyn_cast(Init)) if (ILE->getNumInits() == 0 && TryMemsetInitialization()) return; // Create the loop blocks. llvm::BasicBlock *EntryBB = Builder.GetInsertBlock(); llvm::BasicBlock *LoopBB = createBasicBlock("new.loop"); llvm::BasicBlock *ContBB = createBasicBlock("new.loop.end"); // Find the end of the array, hoisted out of the loop. llvm::Value *EndPtr = Builder.CreateInBoundsGEP(BeginPtr, NumElements, "array.end"); // If the number of elements isn't constant, we have to now check if there is // anything left to initialize. if (!ConstNum) { llvm::Value *IsEmpty = Builder.CreateICmpEQ(CurPtr, EndPtr, "array.isempty"); Builder.CreateCondBr(IsEmpty, ContBB, LoopBB); } // Enter the loop. EmitBlock(LoopBB); // Set up the current-element phi. llvm::PHINode *CurPtrPhi = Builder.CreatePHI(CurPtr->getType(), 2, "array.cur"); CurPtrPhi->addIncoming(CurPtr, EntryBB); CurPtr = CurPtrPhi; // Store the new Cleanup position for irregular Cleanups. if (EndOfInit) Builder.CreateStore(CurPtr, EndOfInit); // Enter a partial-destruction Cleanup if necessary. if (!CleanupDominator && needsEHCleanup(DtorKind)) { pushRegularPartialArrayCleanup(BeginPtr, CurPtr, ElementType, getDestroyer(DtorKind)); Cleanup = EHStack.stable_begin(); CleanupDominator = Builder.CreateUnreachable(); } // Emit the initializer into this element. StoreAnyExprIntoOneUnit(*this, Init, Init->getType(), CurPtr); // Leave the Cleanup if we entered one. if (CleanupDominator) { DeactivateCleanupBlock(Cleanup, CleanupDominator); CleanupDominator->eraseFromParent(); } // Advance to the next element by adjusting the pointer type as necessary. llvm::Value *NextPtr = Builder.CreateConstInBoundsGEP1_32(CurPtr, 1, "array.next"); // Check whether we've gotten to the end of the array and, if so, // exit the loop. llvm::Value *IsEnd = Builder.CreateICmpEQ(NextPtr, EndPtr, "array.atend"); Builder.CreateCondBr(IsEnd, ContBB, LoopBB); CurPtrPhi->addIncoming(NextPtr, Builder.GetInsertBlock()); EmitBlock(ContBB); } static void EmitNewInitializer(CodeGenFunction &CGF, const CXXNewExpr *E, QualType ElementType, llvm::Value *NewPtr, llvm::Value *NumElements, llvm::Value *AllocSizeWithoutCookie) { if (E->isArray()) CGF.EmitNewArrayInitializer(E, ElementType, NewPtr, NumElements, AllocSizeWithoutCookie); else if (const Expr *Init = E->getInitializer()) StoreAnyExprIntoOneUnit(CGF, Init, E->getAllocatedType(), NewPtr); } /// Emit a call to an operator new or operator delete function, as implicitly /// created by new-expressions and delete-expressions. static RValue EmitNewDeleteCall(CodeGenFunction &CGF, const FunctionDecl *Callee, const FunctionProtoType *CalleeType, const CallArgList &Args) { llvm::Instruction *CallOrInvoke; llvm::Value *CalleeAddr = CGF.CGM.GetAddrOfFunction(Callee); RValue RV = CGF.EmitCall(CGF.CGM.getTypes().arrangeFreeFunctionCall(Args, CalleeType), CalleeAddr, ReturnValueSlot(), Args, Callee, &CallOrInvoke); /// C++1y [expr.new]p10: /// [In a new-expression,] an implementation is allowed to omit a call /// to a replaceable global allocation function. /// /// We model such elidable calls with the 'builtin' attribute. llvm::Function *Fn = dyn_cast(CalleeAddr); if (Callee->isReplaceableGlobalAllocationFunction() && Fn && Fn->hasFnAttribute(llvm::Attribute::NoBuiltin)) { // FIXME: Add addAttribute to CallSite. if (llvm::CallInst *CI = dyn_cast(CallOrInvoke)) CI->addAttribute(llvm::AttributeSet::FunctionIndex, llvm::Attribute::Builtin); else if (llvm::InvokeInst *II = dyn_cast(CallOrInvoke)) II->addAttribute(llvm::AttributeSet::FunctionIndex, llvm::Attribute::Builtin); else llvm_unreachable("unexpected kind of call instruction"); } return RV; } RValue CodeGenFunction::EmitBuiltinNewDeleteCall(const FunctionProtoType *Type, const Expr *Arg, bool IsDelete) { CallArgList Args; const Stmt *ArgS = Arg; EmitCallArgs(Args, *Type->param_type_begin(), ConstExprIterator(&ArgS), ConstExprIterator(&ArgS + 1)); // Find the allocation or deallocation function that we're calling. ASTContext &Ctx = getContext(); DeclarationName Name = Ctx.DeclarationNames .getCXXOperatorName(IsDelete ? OO_Delete : OO_New); for (auto *Decl : Ctx.getTranslationUnitDecl()->lookup(Name)) if (auto *FD = dyn_cast(Decl)) if (Ctx.hasSameType(FD->getType(), QualType(Type, 0))) return EmitNewDeleteCall(*this, cast(Decl), Type, Args); llvm_unreachable("predeclared global operator new/delete is missing"); } namespace { /// A cleanup to call the given 'operator delete' function upon /// abnormal exit from a new expression. class CallDeleteDuringNew : public EHScopeStack::Cleanup { size_t NumPlacementArgs; const FunctionDecl *OperatorDelete; llvm::Value *Ptr; llvm::Value *AllocSize; RValue *getPlacementArgs() { return reinterpret_cast(this+1); } public: static size_t getExtraSize(size_t NumPlacementArgs) { return NumPlacementArgs * sizeof(RValue); } CallDeleteDuringNew(size_t NumPlacementArgs, const FunctionDecl *OperatorDelete, llvm::Value *Ptr, llvm::Value *AllocSize) : NumPlacementArgs(NumPlacementArgs), OperatorDelete(OperatorDelete), Ptr(Ptr), AllocSize(AllocSize) {} void setPlacementArg(unsigned I, RValue Arg) { assert(I < NumPlacementArgs && "index out of range"); getPlacementArgs()[I] = Arg; } void Emit(CodeGenFunction &CGF, Flags flags) override { const FunctionProtoType *FPT = OperatorDelete->getType()->getAs(); assert(FPT->getNumParams() == NumPlacementArgs + 1 || (FPT->getNumParams() == 2 && NumPlacementArgs == 0)); CallArgList DeleteArgs; // The first argument is always a void*. FunctionProtoType::param_type_iterator AI = FPT->param_type_begin(); DeleteArgs.add(RValue::get(Ptr), *AI++); // A member 'operator delete' can take an extra 'size_t' argument. if (FPT->getNumParams() == NumPlacementArgs + 2) DeleteArgs.add(RValue::get(AllocSize), *AI++); // Pass the rest of the arguments, which must match exactly. for (unsigned I = 0; I != NumPlacementArgs; ++I) DeleteArgs.add(getPlacementArgs()[I], *AI++); // Call 'operator delete'. EmitNewDeleteCall(CGF, OperatorDelete, FPT, DeleteArgs); } }; /// A cleanup to call the given 'operator delete' function upon /// abnormal exit from a new expression when the new expression is /// conditional. class CallDeleteDuringConditionalNew : public EHScopeStack::Cleanup { size_t NumPlacementArgs; const FunctionDecl *OperatorDelete; DominatingValue::saved_type Ptr; DominatingValue::saved_type AllocSize; DominatingValue::saved_type *getPlacementArgs() { return reinterpret_cast::saved_type*>(this+1); } public: static size_t getExtraSize(size_t NumPlacementArgs) { return NumPlacementArgs * sizeof(DominatingValue::saved_type); } CallDeleteDuringConditionalNew(size_t NumPlacementArgs, const FunctionDecl *OperatorDelete, DominatingValue::saved_type Ptr, DominatingValue::saved_type AllocSize) : NumPlacementArgs(NumPlacementArgs), OperatorDelete(OperatorDelete), Ptr(Ptr), AllocSize(AllocSize) {} void setPlacementArg(unsigned I, DominatingValue::saved_type Arg) { assert(I < NumPlacementArgs && "index out of range"); getPlacementArgs()[I] = Arg; } void Emit(CodeGenFunction &CGF, Flags flags) override { const FunctionProtoType *FPT = OperatorDelete->getType()->getAs(); assert(FPT->getNumParams() == NumPlacementArgs + 1 || (FPT->getNumParams() == 2 && NumPlacementArgs == 0)); CallArgList DeleteArgs; // The first argument is always a void*. FunctionProtoType::param_type_iterator AI = FPT->param_type_begin(); DeleteArgs.add(Ptr.restore(CGF), *AI++); // A member 'operator delete' can take an extra 'size_t' argument. if (FPT->getNumParams() == NumPlacementArgs + 2) { RValue RV = AllocSize.restore(CGF); DeleteArgs.add(RV, *AI++); } // Pass the rest of the arguments, which must match exactly. for (unsigned I = 0; I != NumPlacementArgs; ++I) { RValue RV = getPlacementArgs()[I].restore(CGF); DeleteArgs.add(RV, *AI++); } // Call 'operator delete'. EmitNewDeleteCall(CGF, OperatorDelete, FPT, DeleteArgs); } }; } /// Enter a cleanup to call 'operator delete' if the initializer in a /// new-expression throws. static void EnterNewDeleteCleanup(CodeGenFunction &CGF, const CXXNewExpr *E, llvm::Value *NewPtr, llvm::Value *AllocSize, const CallArgList &NewArgs) { // If we're not inside a conditional branch, then the cleanup will // dominate and we can do the easier (and more efficient) thing. if (!CGF.isInConditionalBranch()) { CallDeleteDuringNew *Cleanup = CGF.EHStack .pushCleanupWithExtra(EHCleanup, E->getNumPlacementArgs(), E->getOperatorDelete(), NewPtr, AllocSize); for (unsigned I = 0, N = E->getNumPlacementArgs(); I != N; ++I) Cleanup->setPlacementArg(I, NewArgs[I+1].RV); return; } // Otherwise, we need to save all this stuff. DominatingValue::saved_type SavedNewPtr = DominatingValue::save(CGF, RValue::get(NewPtr)); DominatingValue::saved_type SavedAllocSize = DominatingValue::save(CGF, RValue::get(AllocSize)); CallDeleteDuringConditionalNew *Cleanup = CGF.EHStack .pushCleanupWithExtra(EHCleanup, E->getNumPlacementArgs(), E->getOperatorDelete(), SavedNewPtr, SavedAllocSize); for (unsigned I = 0, N = E->getNumPlacementArgs(); I != N; ++I) Cleanup->setPlacementArg(I, DominatingValue::save(CGF, NewArgs[I+1].RV)); CGF.initFullExprCleanup(); } llvm::Value *CodeGenFunction::EmitCXXNewExpr(const CXXNewExpr *E) { // The element type being allocated. QualType allocType = getContext().getBaseElementType(E->getAllocatedType()); // 1. Build a call to the allocation function. FunctionDecl *allocator = E->getOperatorNew(); const FunctionProtoType *allocatorType = allocator->getType()->castAs(); CallArgList allocatorArgs; // The allocation size is the first argument. QualType sizeType = getContext().getSizeType(); // If there is a brace-initializer, cannot allocate fewer elements than inits. unsigned minElements = 0; if (E->isArray() && E->hasInitializer()) { if (const InitListExpr *ILE = dyn_cast(E->getInitializer())) minElements = ILE->getNumInits(); } llvm::Value *numElements = nullptr; llvm::Value *allocSizeWithoutCookie = nullptr; llvm::Value *allocSize = EmitCXXNewAllocSize(*this, E, minElements, numElements, allocSizeWithoutCookie); allocatorArgs.add(RValue::get(allocSize), sizeType); // We start at 1 here because the first argument (the allocation size) // has already been emitted. EmitCallArgs(allocatorArgs, allocatorType->isVariadic(), allocatorType->param_type_begin() + 1, allocatorType->param_type_end(), E->placement_arg_begin(), E->placement_arg_end()); // Emit the allocation call. If the allocator is a global placement // operator, just "inline" it directly. RValue RV; if (allocator->isReservedGlobalPlacementOperator()) { assert(allocatorArgs.size() == 2); RV = allocatorArgs[1].RV; // TODO: kill any unnecessary computations done for the size // argument. } else { RV = EmitNewDeleteCall(*this, allocator, allocatorType, allocatorArgs); } // Emit a null check on the allocation result if the allocation // function is allowed to return null (because it has a non-throwing // exception spec; for this part, we inline // CXXNewExpr::shouldNullCheckAllocation()) and we have an // interesting initializer. bool nullCheck = allocatorType->isNothrow(getContext()) && (!allocType.isPODType(getContext()) || E->hasInitializer()); llvm::BasicBlock *nullCheckBB = nullptr; llvm::BasicBlock *contBB = nullptr; llvm::Value *allocation = RV.getScalarVal(); unsigned AS = allocation->getType()->getPointerAddressSpace(); // The null-check means that the initializer is conditionally // evaluated. ConditionalEvaluation conditional(*this); if (nullCheck) { conditional.begin(*this); nullCheckBB = Builder.GetInsertBlock(); llvm::BasicBlock *notNullBB = createBasicBlock("new.notnull"); contBB = createBasicBlock("new.cont"); llvm::Value *isNull = Builder.CreateIsNull(allocation, "new.isnull"); Builder.CreateCondBr(isNull, contBB, notNullBB); EmitBlock(notNullBB); } // If there's an operator delete, enter a cleanup to call it if an // exception is thrown. EHScopeStack::stable_iterator operatorDeleteCleanup; llvm::Instruction *cleanupDominator = nullptr; if (E->getOperatorDelete() && !E->getOperatorDelete()->isReservedGlobalPlacementOperator()) { EnterNewDeleteCleanup(*this, E, allocation, allocSize, allocatorArgs); operatorDeleteCleanup = EHStack.stable_begin(); cleanupDominator = Builder.CreateUnreachable(); } assert((allocSize == allocSizeWithoutCookie) == CalculateCookiePadding(*this, E).isZero()); if (allocSize != allocSizeWithoutCookie) { assert(E->isArray()); allocation = CGM.getCXXABI().InitializeArrayCookie(*this, allocation, numElements, E, allocType); } llvm::Type *elementPtrTy = ConvertTypeForMem(allocType)->getPointerTo(AS); llvm::Value *result = Builder.CreateBitCast(allocation, elementPtrTy); EmitNewInitializer(*this, E, allocType, result, numElements, allocSizeWithoutCookie); if (E->isArray()) { // NewPtr is a pointer to the base element type. If we're // allocating an array of arrays, we'll need to cast back to the // array pointer type. llvm::Type *resultType = ConvertTypeForMem(E->getType()); if (result->getType() != resultType) result = Builder.CreateBitCast(result, resultType); } // Deactivate the 'operator delete' cleanup if we finished // initialization. if (operatorDeleteCleanup.isValid()) { DeactivateCleanupBlock(operatorDeleteCleanup, cleanupDominator); cleanupDominator->eraseFromParent(); } if (nullCheck) { conditional.end(*this); llvm::BasicBlock *notNullBB = Builder.GetInsertBlock(); EmitBlock(contBB); llvm::PHINode *PHI = Builder.CreatePHI(result->getType(), 2); PHI->addIncoming(result, notNullBB); PHI->addIncoming(llvm::Constant::getNullValue(result->getType()), nullCheckBB); result = PHI; } return result; } void CodeGenFunction::EmitDeleteCall(const FunctionDecl *DeleteFD, llvm::Value *Ptr, QualType DeleteTy) { assert(DeleteFD->getOverloadedOperator() == OO_Delete); const FunctionProtoType *DeleteFTy = DeleteFD->getType()->getAs(); CallArgList DeleteArgs; // Check if we need to pass the size to the delete operator. llvm::Value *Size = nullptr; QualType SizeTy; if (DeleteFTy->getNumParams() == 2) { SizeTy = DeleteFTy->getParamType(1); CharUnits DeleteTypeSize = getContext().getTypeSizeInChars(DeleteTy); Size = llvm::ConstantInt::get(ConvertType(SizeTy), DeleteTypeSize.getQuantity()); } QualType ArgTy = DeleteFTy->getParamType(0); llvm::Value *DeletePtr = Builder.CreateBitCast(Ptr, ConvertType(ArgTy)); DeleteArgs.add(RValue::get(DeletePtr), ArgTy); if (Size) DeleteArgs.add(RValue::get(Size), SizeTy); // Emit the call to delete. EmitNewDeleteCall(*this, DeleteFD, DeleteFTy, DeleteArgs); } namespace { /// Calls the given 'operator delete' on a single object. struct CallObjectDelete : EHScopeStack::Cleanup { llvm::Value *Ptr; const FunctionDecl *OperatorDelete; QualType ElementType; CallObjectDelete(llvm::Value *Ptr, const FunctionDecl *OperatorDelete, QualType ElementType) : Ptr(Ptr), OperatorDelete(OperatorDelete), ElementType(ElementType) {} void Emit(CodeGenFunction &CGF, Flags flags) override { CGF.EmitDeleteCall(OperatorDelete, Ptr, ElementType); } }; } /// Emit the code for deleting a single object. static void EmitObjectDelete(CodeGenFunction &CGF, const FunctionDecl *OperatorDelete, llvm::Value *Ptr, QualType ElementType, bool UseGlobalDelete) { // Find the destructor for the type, if applicable. If the // destructor is virtual, we'll just emit the vcall and return. const CXXDestructorDecl *Dtor = nullptr; if (const RecordType *RT = ElementType->getAs()) { CXXRecordDecl *RD = cast(RT->getDecl()); if (RD->hasDefinition() && !RD->hasTrivialDestructor()) { Dtor = RD->getDestructor(); if (Dtor->isVirtual()) { if (UseGlobalDelete) { // If we're supposed to call the global delete, make sure we do so // even if the destructor throws. // Derive the complete-object pointer, which is what we need // to pass to the deallocation function. llvm::Value *completePtr = CGF.CGM.getCXXABI().adjustToCompleteObject(CGF, Ptr, ElementType); CGF.EHStack.pushCleanup(NormalAndEHCleanup, completePtr, OperatorDelete, ElementType); } // FIXME: Provide a source location here. CXXDtorType DtorType = UseGlobalDelete ? Dtor_Complete : Dtor_Deleting; CGF.CGM.getCXXABI().EmitVirtualDestructorCall(CGF, Dtor, DtorType, SourceLocation(), Ptr); if (UseGlobalDelete) { CGF.PopCleanupBlock(); } return; } } } // Make sure that we call delete even if the dtor throws. // This doesn't have to a conditional cleanup because we're going // to pop it off in a second. CGF.EHStack.pushCleanup(NormalAndEHCleanup, Ptr, OperatorDelete, ElementType); if (Dtor) CGF.EmitCXXDestructorCall(Dtor, Dtor_Complete, /*ForVirtualBase=*/false, /*Delegating=*/false, Ptr); else if (CGF.getLangOpts().ObjCAutoRefCount && ElementType->isObjCLifetimeType()) { switch (ElementType.getObjCLifetime()) { case Qualifiers::OCL_None: case Qualifiers::OCL_ExplicitNone: case Qualifiers::OCL_Autoreleasing: break; case Qualifiers::OCL_Strong: { // Load the pointer value. llvm::Value *PtrValue = CGF.Builder.CreateLoad(Ptr, ElementType.isVolatileQualified()); CGF.EmitARCRelease(PtrValue, ARCPreciseLifetime); break; } case Qualifiers::OCL_Weak: CGF.EmitARCDestroyWeak(Ptr); break; } } CGF.PopCleanupBlock(); } namespace { /// Calls the given 'operator delete' on an array of objects. struct CallArrayDelete : EHScopeStack::Cleanup { llvm::Value *Ptr; const FunctionDecl *OperatorDelete; llvm::Value *NumElements; QualType ElementType; CharUnits CookieSize; CallArrayDelete(llvm::Value *Ptr, const FunctionDecl *OperatorDelete, llvm::Value *NumElements, QualType ElementType, CharUnits CookieSize) : Ptr(Ptr), OperatorDelete(OperatorDelete), NumElements(NumElements), ElementType(ElementType), CookieSize(CookieSize) {} void Emit(CodeGenFunction &CGF, Flags flags) override { const FunctionProtoType *DeleteFTy = OperatorDelete->getType()->getAs(); assert(DeleteFTy->getNumParams() == 1 || DeleteFTy->getNumParams() == 2); CallArgList Args; // Pass the pointer as the first argument. QualType VoidPtrTy = DeleteFTy->getParamType(0); llvm::Value *DeletePtr = CGF.Builder.CreateBitCast(Ptr, CGF.ConvertType(VoidPtrTy)); Args.add(RValue::get(DeletePtr), VoidPtrTy); // Pass the original requested size as the second argument. if (DeleteFTy->getNumParams() == 2) { QualType size_t = DeleteFTy->getParamType(1); llvm::IntegerType *SizeTy = cast(CGF.ConvertType(size_t)); CharUnits ElementTypeSize = CGF.CGM.getContext().getTypeSizeInChars(ElementType); // The size of an element, multiplied by the number of elements. llvm::Value *Size = llvm::ConstantInt::get(SizeTy, ElementTypeSize.getQuantity()); Size = CGF.Builder.CreateMul(Size, NumElements); // Plus the size of the cookie if applicable. if (!CookieSize.isZero()) { llvm::Value *CookieSizeV = llvm::ConstantInt::get(SizeTy, CookieSize.getQuantity()); Size = CGF.Builder.CreateAdd(Size, CookieSizeV); } Args.add(RValue::get(Size), size_t); } // Emit the call to delete. EmitNewDeleteCall(CGF, OperatorDelete, DeleteFTy, Args); } }; } /// Emit the code for deleting an array of objects. static void EmitArrayDelete(CodeGenFunction &CGF, const CXXDeleteExpr *E, llvm::Value *deletedPtr, QualType elementType) { llvm::Value *numElements = nullptr; llvm::Value *allocatedPtr = nullptr; CharUnits cookieSize; CGF.CGM.getCXXABI().ReadArrayCookie(CGF, deletedPtr, E, elementType, numElements, allocatedPtr, cookieSize); assert(allocatedPtr && "ReadArrayCookie didn't set allocated pointer"); // Make sure that we call delete even if one of the dtors throws. const FunctionDecl *operatorDelete = E->getOperatorDelete(); CGF.EHStack.pushCleanup(NormalAndEHCleanup, allocatedPtr, operatorDelete, numElements, elementType, cookieSize); // Destroy the elements. if (QualType::DestructionKind dtorKind = elementType.isDestructedType()) { assert(numElements && "no element count for a type with a destructor!"); llvm::Value *arrayEnd = CGF.Builder.CreateInBoundsGEP(deletedPtr, numElements, "delete.end"); // Note that it is legal to allocate a zero-length array, and we // can never fold the check away because the length should always // come from a cookie. CGF.emitArrayDestroy(deletedPtr, arrayEnd, elementType, CGF.getDestroyer(dtorKind), /*checkZeroLength*/ true, CGF.needsEHCleanup(dtorKind)); } // Pop the cleanup block. CGF.PopCleanupBlock(); } void CodeGenFunction::EmitCXXDeleteExpr(const CXXDeleteExpr *E) { const Expr *Arg = E->getArgument(); llvm::Value *Ptr = EmitScalarExpr(Arg); // Null check the pointer. llvm::BasicBlock *DeleteNotNull = createBasicBlock("delete.notnull"); llvm::BasicBlock *DeleteEnd = createBasicBlock("delete.end"); llvm::Value *IsNull = Builder.CreateIsNull(Ptr, "isnull"); Builder.CreateCondBr(IsNull, DeleteEnd, DeleteNotNull); EmitBlock(DeleteNotNull); // We might be deleting a pointer to array. If so, GEP down to the // first non-array element. // (this assumes that A(*)[3][7] is converted to [3 x [7 x %A]]*) QualType DeleteTy = Arg->getType()->getAs()->getPointeeType(); if (DeleteTy->isConstantArrayType()) { llvm::Value *Zero = Builder.getInt32(0); SmallVector GEP; GEP.push_back(Zero); // point at the outermost array // For each layer of array type we're pointing at: while (const ConstantArrayType *Arr = getContext().getAsConstantArrayType(DeleteTy)) { // 1. Unpeel the array type. DeleteTy = Arr->getElementType(); // 2. GEP to the first element of the array. GEP.push_back(Zero); } Ptr = Builder.CreateInBoundsGEP(Ptr, GEP, "del.first"); } assert(ConvertTypeForMem(DeleteTy) == cast(Ptr->getType())->getElementType()); if (E->isArrayForm()) { EmitArrayDelete(*this, E, Ptr, DeleteTy); } else { EmitObjectDelete(*this, E->getOperatorDelete(), Ptr, DeleteTy, E->isGlobalDelete()); } EmitBlock(DeleteEnd); } static bool isGLValueFromPointerDeref(const Expr *E) { E = E->IgnoreParens(); if (const auto *CE = dyn_cast(E)) { if (!CE->getSubExpr()->isGLValue()) return false; return isGLValueFromPointerDeref(CE->getSubExpr()); } if (const auto *OVE = dyn_cast(E)) return isGLValueFromPointerDeref(OVE->getSourceExpr()); if (const auto *BO = dyn_cast(E)) if (BO->getOpcode() == BO_Comma) return isGLValueFromPointerDeref(BO->getRHS()); if (const auto *ACO = dyn_cast(E)) return isGLValueFromPointerDeref(ACO->getTrueExpr()) || isGLValueFromPointerDeref(ACO->getFalseExpr()); // C++11 [expr.sub]p1: // The expression E1[E2] is identical (by definition) to *((E1)+(E2)) if (isa(E)) return true; if (const auto *UO = dyn_cast(E)) if (UO->getOpcode() == UO_Deref) return true; return false; } static llvm::Value *EmitTypeidFromVTable(CodeGenFunction &CGF, const Expr *E, llvm::Type *StdTypeInfoPtrTy) { // Get the vtable pointer. llvm::Value *ThisPtr = CGF.EmitLValue(E).getAddress(); // C++ [expr.typeid]p2: // If the glvalue expression is obtained by applying the unary * operator to // a pointer and the pointer is a null pointer value, the typeid expression // throws the std::bad_typeid exception. // // However, this paragraph's intent is not clear. We choose a very generous // interpretation which implores us to consider comma operators, conditional // operators, parentheses and other such constructs. QualType SrcRecordTy = E->getType(); if (CGF.CGM.getCXXABI().shouldTypeidBeNullChecked( isGLValueFromPointerDeref(E), SrcRecordTy)) { llvm::BasicBlock *BadTypeidBlock = CGF.createBasicBlock("typeid.bad_typeid"); llvm::BasicBlock *EndBlock = CGF.createBasicBlock("typeid.end"); llvm::Value *IsNull = CGF.Builder.CreateIsNull(ThisPtr); CGF.Builder.CreateCondBr(IsNull, BadTypeidBlock, EndBlock); CGF.EmitBlock(BadTypeidBlock); CGF.CGM.getCXXABI().EmitBadTypeidCall(CGF); CGF.EmitBlock(EndBlock); } return CGF.CGM.getCXXABI().EmitTypeid(CGF, SrcRecordTy, ThisPtr, StdTypeInfoPtrTy); } llvm::Value *CodeGenFunction::EmitCXXTypeidExpr(const CXXTypeidExpr *E) { llvm::Type *StdTypeInfoPtrTy = ConvertType(E->getType())->getPointerTo(); if (E->isTypeOperand()) { llvm::Constant *TypeInfo = CGM.GetAddrOfRTTIDescriptor(E->getTypeOperand(getContext())); return Builder.CreateBitCast(TypeInfo, StdTypeInfoPtrTy); } // C++ [expr.typeid]p2: // When typeid is applied to a glvalue expression whose type is a // polymorphic class type, the result refers to a std::type_info object // representing the type of the most derived object (that is, the dynamic // type) to which the glvalue refers. if (E->isPotentiallyEvaluated()) return EmitTypeidFromVTable(*this, E->getExprOperand(), StdTypeInfoPtrTy); QualType OperandTy = E->getExprOperand()->getType(); return Builder.CreateBitCast(CGM.GetAddrOfRTTIDescriptor(OperandTy), StdTypeInfoPtrTy); } static llvm::Value *EmitDynamicCastToNull(CodeGenFunction &CGF, QualType DestTy) { llvm::Type *DestLTy = CGF.ConvertType(DestTy); if (DestTy->isPointerType()) return llvm::Constant::getNullValue(DestLTy); /// C++ [expr.dynamic.cast]p9: /// A failed cast to reference type throws std::bad_cast if (!CGF.CGM.getCXXABI().EmitBadCastCall(CGF)) return nullptr; CGF.EmitBlock(CGF.createBasicBlock("dynamic_cast.end")); return llvm::UndefValue::get(DestLTy); } llvm::Value *CodeGenFunction::EmitDynamicCast(llvm::Value *Value, const CXXDynamicCastExpr *DCE) { QualType DestTy = DCE->getTypeAsWritten(); if (DCE->isAlwaysNull()) if (llvm::Value *T = EmitDynamicCastToNull(*this, DestTy)) return T; QualType SrcTy = DCE->getSubExpr()->getType(); // C++ [expr.dynamic.cast]p7: // If T is "pointer to cv void," then the result is a pointer to the most // derived object pointed to by v. const PointerType *DestPTy = DestTy->getAs(); bool isDynamicCastToVoid; QualType SrcRecordTy; QualType DestRecordTy; if (DestPTy) { isDynamicCastToVoid = DestPTy->getPointeeType()->isVoidType(); SrcRecordTy = SrcTy->castAs()->getPointeeType(); DestRecordTy = DestPTy->getPointeeType(); } else { isDynamicCastToVoid = false; SrcRecordTy = SrcTy; DestRecordTy = DestTy->castAs()->getPointeeType(); } assert(SrcRecordTy->isRecordType() && "source type must be a record type!"); // C++ [expr.dynamic.cast]p4: // If the value of v is a null pointer value in the pointer case, the result // is the null pointer value of type T. bool ShouldNullCheckSrcValue = CGM.getCXXABI().shouldDynamicCastCallBeNullChecked(SrcTy->isPointerType(), SrcRecordTy); llvm::BasicBlock *CastNull = nullptr; llvm::BasicBlock *CastNotNull = nullptr; llvm::BasicBlock *CastEnd = createBasicBlock("dynamic_cast.end"); if (ShouldNullCheckSrcValue) { CastNull = createBasicBlock("dynamic_cast.null"); CastNotNull = createBasicBlock("dynamic_cast.notnull"); llvm::Value *IsNull = Builder.CreateIsNull(Value); Builder.CreateCondBr(IsNull, CastNull, CastNotNull); EmitBlock(CastNotNull); } if (isDynamicCastToVoid) { Value = CGM.getCXXABI().EmitDynamicCastToVoid(*this, Value, SrcRecordTy, DestTy); } else { assert(DestRecordTy->isRecordType() && "destination type must be a record type!"); Value = CGM.getCXXABI().EmitDynamicCastCall(*this, Value, SrcRecordTy, DestTy, DestRecordTy, CastEnd); } if (ShouldNullCheckSrcValue) { EmitBranch(CastEnd); EmitBlock(CastNull); EmitBranch(CastEnd); } EmitBlock(CastEnd); if (ShouldNullCheckSrcValue) { llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2); PHI->addIncoming(Value, CastNotNull); PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()), CastNull); Value = PHI; } return Value; } void CodeGenFunction::EmitLambdaExpr(const LambdaExpr *E, AggValueSlot Slot) { RunCleanupsScope Scope(*this); LValue SlotLV = MakeAddrLValue(Slot.getAddr(), E->getType(), Slot.getAlignment()); CXXRecordDecl::field_iterator CurField = E->getLambdaClass()->field_begin(); for (LambdaExpr::capture_init_iterator i = E->capture_init_begin(), e = E->capture_init_end(); i != e; ++i, ++CurField) { // Emit initialization LValue LV = EmitLValueForFieldInitialization(SlotLV, *CurField); ArrayRef ArrayIndexes; if (CurField->getType()->isArrayType()) ArrayIndexes = E->getCaptureInitIndexVars(i); EmitInitializerForField(*CurField, LV, *i, ArrayIndexes); } } @ 1.1.1.5.4.1 log @file CGExprCXX.cpp was added on branch yamt-pagecache on 2014-05-22 16:18:26 +0000 @ text @d1 1872 @ 1.1.1.5.4.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 1872 //===--- CGExprCXX.cpp - Emit LLVM Code for C++ expressions ---------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This contains code dealing with code generation of C++ expressions // //===----------------------------------------------------------------------===// #include "CodeGenFunction.h" #include "CGCUDARuntime.h" #include "CGCXXABI.h" #include "CGDebugInfo.h" #include "CGObjCRuntime.h" #include "clang/CodeGen/CGFunctionInfo.h" #include "clang/Frontend/CodeGenOptions.h" #include "llvm/IR/Intrinsics.h" #include "llvm/Support/CallSite.h" using namespace clang; using namespace CodeGen; RValue CodeGenFunction::EmitCXXMemberCall(const CXXMethodDecl *MD, SourceLocation CallLoc, llvm::Value *Callee, ReturnValueSlot ReturnValue, llvm::Value *This, llvm::Value *ImplicitParam, QualType ImplicitParamTy, CallExpr::const_arg_iterator ArgBeg, CallExpr::const_arg_iterator ArgEnd) { assert(MD->isInstance() && "Trying to emit a member call expr on a static method!"); // C++11 [class.mfct.non-static]p2: // If a non-static member function of a class X is called for an object that // is not of type X, or of a type derived from X, the behavior is undefined. EmitTypeCheck(isa(MD) ? TCK_ConstructorCall : TCK_MemberCall, CallLoc, This, getContext().getRecordType(MD->getParent())); CallArgList Args; // Push the this ptr. Args.add(RValue::get(This), MD->getThisType(getContext())); // If there is an implicit parameter (e.g. VTT), emit it. if (ImplicitParam) { Args.add(RValue::get(ImplicitParam), ImplicitParamTy); } const FunctionProtoType *FPT = MD->getType()->castAs(); RequiredArgs required = RequiredArgs::forPrototypePlus(FPT, Args.size()); // And the rest of the call args. EmitCallArgs(Args, FPT, ArgBeg, ArgEnd); return EmitCall(CGM.getTypes().arrangeCXXMethodCall(Args, FPT, required), Callee, ReturnValue, Args, MD); } static CXXRecordDecl *getCXXRecord(const Expr *E) { QualType T = E->getType(); if (const PointerType *PTy = T->getAs()) T = PTy->getPointeeType(); const RecordType *Ty = T->castAs(); return cast(Ty->getDecl()); } // Note: This function also emit constructor calls to support a MSVC // extensions allowing explicit constructor function call. RValue CodeGenFunction::EmitCXXMemberCallExpr(const CXXMemberCallExpr *CE, ReturnValueSlot ReturnValue) { const Expr *callee = CE->getCallee()->IgnoreParens(); if (isa(callee)) return EmitCXXMemberPointerCallExpr(CE, ReturnValue); const MemberExpr *ME = cast(callee); const CXXMethodDecl *MD = cast(ME->getMemberDecl()); if (MD->isStatic()) { // The method is static, emit it as we would a regular call. llvm::Value *Callee = CGM.GetAddrOfFunction(MD); return EmitCall(getContext().getPointerType(MD->getType()), Callee, CE->getLocStart(), ReturnValue, CE->arg_begin(), CE->arg_end()); } // Compute the object pointer. const Expr *Base = ME->getBase(); bool CanUseVirtualCall = MD->isVirtual() && !ME->hasQualifier(); const CXXMethodDecl *DevirtualizedMethod = NULL; if (CanUseVirtualCall && CanDevirtualizeMemberFunctionCall(Base, MD)) { const CXXRecordDecl *BestDynamicDecl = Base->getBestDynamicClassType(); DevirtualizedMethod = MD->getCorrespondingMethodInClass(BestDynamicDecl); assert(DevirtualizedMethod); const CXXRecordDecl *DevirtualizedClass = DevirtualizedMethod->getParent(); const Expr *Inner = Base->ignoreParenBaseCasts(); if (getCXXRecord(Inner) == DevirtualizedClass) // If the class of the Inner expression is where the dynamic method // is defined, build the this pointer from it. Base = Inner; else if (getCXXRecord(Base) != DevirtualizedClass) { // If the method is defined in a class that is not the best dynamic // one or the one of the full expression, we would have to build // a derived-to-base cast to compute the correct this pointer, but // we don't have support for that yet, so do a virtual call. DevirtualizedMethod = NULL; } // If the return types are not the same, this might be a case where more // code needs to run to compensate for it. For example, the derived // method might return a type that inherits form from the return // type of MD and has a prefix. // For now we just avoid devirtualizing these covariant cases. if (DevirtualizedMethod && DevirtualizedMethod->getReturnType().getCanonicalType() != MD->getReturnType().getCanonicalType()) DevirtualizedMethod = NULL; } llvm::Value *This; if (ME->isArrow()) This = EmitScalarExpr(Base); else This = EmitLValue(Base).getAddress(); if (MD->isTrivial()) { if (isa(MD)) return RValue::get(0); if (isa(MD) && cast(MD)->isDefaultConstructor()) return RValue::get(0); if (MD->isCopyAssignmentOperator() || MD->isMoveAssignmentOperator()) { // We don't like to generate the trivial copy/move assignment operator // when it isn't necessary; just produce the proper effect here. llvm::Value *RHS = EmitLValue(*CE->arg_begin()).getAddress(); EmitAggregateAssign(This, RHS, CE->getType()); return RValue::get(This); } if (isa(MD) && cast(MD)->isCopyOrMoveConstructor()) { // Trivial move and copy ctor are the same. llvm::Value *RHS = EmitLValue(*CE->arg_begin()).getAddress(); EmitSynthesizedCXXCopyCtorCall(cast(MD), This, RHS, CE->arg_begin(), CE->arg_end()); return RValue::get(This); } llvm_unreachable("unknown trivial member function"); } // Compute the function type we're calling. const CXXMethodDecl *CalleeDecl = DevirtualizedMethod ? DevirtualizedMethod : MD; const CGFunctionInfo *FInfo = 0; if (const CXXDestructorDecl *Dtor = dyn_cast(CalleeDecl)) FInfo = &CGM.getTypes().arrangeCXXDestructor(Dtor, Dtor_Complete); else if (const CXXConstructorDecl *Ctor = dyn_cast(CalleeDecl)) FInfo = &CGM.getTypes().arrangeCXXConstructorDeclaration(Ctor, Ctor_Complete); else FInfo = &CGM.getTypes().arrangeCXXMethodDeclaration(CalleeDecl); llvm::FunctionType *Ty = CGM.getTypes().GetFunctionType(*FInfo); // C++ [class.virtual]p12: // Explicit qualification with the scope operator (5.1) suppresses the // virtual call mechanism. // // We also don't emit a virtual call if the base expression has a record type // because then we know what the type is. bool UseVirtualCall = CanUseVirtualCall && !DevirtualizedMethod; llvm::Value *Callee; if (const CXXDestructorDecl *Dtor = dyn_cast(MD)) { assert(CE->arg_begin() == CE->arg_end() && "Destructor shouldn't have explicit parameters"); assert(ReturnValue.isNull() && "Destructor shouldn't have return value"); if (UseVirtualCall) { CGM.getCXXABI().EmitVirtualDestructorCall(*this, Dtor, Dtor_Complete, CE->getExprLoc(), This); } else { if (getLangOpts().AppleKext && MD->isVirtual() && ME->hasQualifier()) Callee = BuildAppleKextVirtualCall(MD, ME->getQualifier(), Ty); else if (!DevirtualizedMethod) Callee = CGM.GetAddrOfCXXDestructor(Dtor, Dtor_Complete, FInfo, Ty); else { const CXXDestructorDecl *DDtor = cast(DevirtualizedMethod); Callee = CGM.GetAddrOfFunction(GlobalDecl(DDtor, Dtor_Complete), Ty); } EmitCXXMemberCall(MD, CE->getExprLoc(), Callee, ReturnValue, This, /*ImplicitParam=*/0, QualType(), 0, 0); } return RValue::get(0); } if (const CXXConstructorDecl *Ctor = dyn_cast(MD)) { Callee = CGM.GetAddrOfFunction(GlobalDecl(Ctor, Ctor_Complete), Ty); } else if (UseVirtualCall) { Callee = CGM.getCXXABI().getVirtualFunctionPointer(*this, MD, This, Ty); } else { if (getLangOpts().AppleKext && MD->isVirtual() && ME->hasQualifier()) Callee = BuildAppleKextVirtualCall(MD, ME->getQualifier(), Ty); else if (!DevirtualizedMethod) Callee = CGM.GetAddrOfFunction(MD, Ty); else { Callee = CGM.GetAddrOfFunction(DevirtualizedMethod, Ty); } } if (MD->isVirtual()) This = CGM.getCXXABI().adjustThisArgumentForVirtualCall(*this, MD, This); return EmitCXXMemberCall(MD, CE->getExprLoc(), Callee, ReturnValue, This, /*ImplicitParam=*/0, QualType(), CE->arg_begin(), CE->arg_end()); } RValue CodeGenFunction::EmitCXXMemberPointerCallExpr(const CXXMemberCallExpr *E, ReturnValueSlot ReturnValue) { const BinaryOperator *BO = cast(E->getCallee()->IgnoreParens()); const Expr *BaseExpr = BO->getLHS(); const Expr *MemFnExpr = BO->getRHS(); const MemberPointerType *MPT = MemFnExpr->getType()->castAs(); const FunctionProtoType *FPT = MPT->getPointeeType()->castAs(); const CXXRecordDecl *RD = cast(MPT->getClass()->getAs()->getDecl()); // Get the member function pointer. llvm::Value *MemFnPtr = EmitScalarExpr(MemFnExpr); // Emit the 'this' pointer. llvm::Value *This; if (BO->getOpcode() == BO_PtrMemI) This = EmitScalarExpr(BaseExpr); else This = EmitLValue(BaseExpr).getAddress(); EmitTypeCheck(TCK_MemberCall, E->getExprLoc(), This, QualType(MPT->getClass(), 0)); // Ask the ABI to load the callee. Note that This is modified. llvm::Value *Callee = CGM.getCXXABI().EmitLoadOfMemberFunctionPointer(*this, BO, This, MemFnPtr, MPT); CallArgList Args; QualType ThisType = getContext().getPointerType(getContext().getTagDeclType(RD)); // Push the this ptr. Args.add(RValue::get(This), ThisType); RequiredArgs required = RequiredArgs::forPrototypePlus(FPT, 1); // And the rest of the call args EmitCallArgs(Args, FPT, E->arg_begin(), E->arg_end()); return EmitCall(CGM.getTypes().arrangeCXXMethodCall(Args, FPT, required), Callee, ReturnValue, Args); } RValue CodeGenFunction::EmitCXXOperatorMemberCallExpr(const CXXOperatorCallExpr *E, const CXXMethodDecl *MD, ReturnValueSlot ReturnValue) { assert(MD->isInstance() && "Trying to emit a member call expr on a static method!"); LValue LV = EmitLValue(E->getArg(0)); llvm::Value *This = LV.getAddress(); if ((MD->isCopyAssignmentOperator() || MD->isMoveAssignmentOperator()) && MD->isTrivial()) { llvm::Value *Src = EmitLValue(E->getArg(1)).getAddress(); QualType Ty = E->getType(); EmitAggregateAssign(This, Src, Ty); return RValue::get(This); } llvm::Value *Callee = EmitCXXOperatorMemberCallee(E, MD, This); return EmitCXXMemberCall(MD, E->getExprLoc(), Callee, ReturnValue, This, /*ImplicitParam=*/0, QualType(), E->arg_begin() + 1, E->arg_end()); } RValue CodeGenFunction::EmitCUDAKernelCallExpr(const CUDAKernelCallExpr *E, ReturnValueSlot ReturnValue) { return CGM.getCUDARuntime().EmitCUDAKernelCallExpr(*this, E, ReturnValue); } static void EmitNullBaseClassInitialization(CodeGenFunction &CGF, llvm::Value *DestPtr, const CXXRecordDecl *Base) { if (Base->isEmpty()) return; DestPtr = CGF.EmitCastToVoidPtr(DestPtr); const ASTRecordLayout &Layout = CGF.getContext().getASTRecordLayout(Base); CharUnits Size = Layout.getNonVirtualSize(); CharUnits Align = Layout.getNonVirtualAlignment(); llvm::Value *SizeVal = CGF.CGM.getSize(Size); // If the type contains a pointer to data member we can't memset it to zero. // Instead, create a null constant and copy it to the destination. // TODO: there are other patterns besides zero that we can usefully memset, // like -1, which happens to be the pattern used by member-pointers. // TODO: isZeroInitializable can be over-conservative in the case where a // virtual base contains a member pointer. if (!CGF.CGM.getTypes().isZeroInitializable(Base)) { llvm::Constant *NullConstant = CGF.CGM.EmitNullConstantForBase(Base); llvm::GlobalVariable *NullVariable = new llvm::GlobalVariable(CGF.CGM.getModule(), NullConstant->getType(), /*isConstant=*/true, llvm::GlobalVariable::PrivateLinkage, NullConstant, Twine()); NullVariable->setAlignment(Align.getQuantity()); llvm::Value *SrcPtr = CGF.EmitCastToVoidPtr(NullVariable); // Get and call the appropriate llvm.memcpy overload. CGF.Builder.CreateMemCpy(DestPtr, SrcPtr, SizeVal, Align.getQuantity()); return; } // Otherwise, just memset the whole thing to zero. This is legal // because in LLVM, all default initializers (other than the ones we just // handled above) are guaranteed to have a bit pattern of all zeros. CGF.Builder.CreateMemSet(DestPtr, CGF.Builder.getInt8(0), SizeVal, Align.getQuantity()); } void CodeGenFunction::EmitCXXConstructExpr(const CXXConstructExpr *E, AggValueSlot Dest) { assert(!Dest.isIgnored() && "Must have a destination!"); const CXXConstructorDecl *CD = E->getConstructor(); // If we require zero initialization before (or instead of) calling the // constructor, as can be the case with a non-user-provided default // constructor, emit the zero initialization now, unless destination is // already zeroed. if (E->requiresZeroInitialization() && !Dest.isZeroed()) { switch (E->getConstructionKind()) { case CXXConstructExpr::CK_Delegating: case CXXConstructExpr::CK_Complete: EmitNullInitialization(Dest.getAddr(), E->getType()); break; case CXXConstructExpr::CK_VirtualBase: case CXXConstructExpr::CK_NonVirtualBase: EmitNullBaseClassInitialization(*this, Dest.getAddr(), CD->getParent()); break; } } // If this is a call to a trivial default constructor, do nothing. if (CD->isTrivial() && CD->isDefaultConstructor()) return; // Elide the constructor if we're constructing from a temporary. // The temporary check is required because Sema sets this on NRVO // returns. if (getLangOpts().ElideConstructors && E->isElidable()) { assert(getContext().hasSameUnqualifiedType(E->getType(), E->getArg(0)->getType())); if (E->getArg(0)->isTemporaryObject(getContext(), CD->getParent())) { EmitAggExpr(E->getArg(0), Dest); return; } } if (const ConstantArrayType *arrayType = getContext().getAsConstantArrayType(E->getType())) { EmitCXXAggrConstructorCall(CD, arrayType, Dest.getAddr(), E->arg_begin(), E->arg_end()); } else { CXXCtorType Type = Ctor_Complete; bool ForVirtualBase = false; bool Delegating = false; switch (E->getConstructionKind()) { case CXXConstructExpr::CK_Delegating: // We should be emitting a constructor; GlobalDecl will assert this Type = CurGD.getCtorType(); Delegating = true; break; case CXXConstructExpr::CK_Complete: Type = Ctor_Complete; break; case CXXConstructExpr::CK_VirtualBase: ForVirtualBase = true; // fall-through case CXXConstructExpr::CK_NonVirtualBase: Type = Ctor_Base; } // Call the constructor. EmitCXXConstructorCall(CD, Type, ForVirtualBase, Delegating, Dest.getAddr(), E->arg_begin(), E->arg_end()); } } void CodeGenFunction::EmitSynthesizedCXXCopyCtor(llvm::Value *Dest, llvm::Value *Src, const Expr *Exp) { if (const ExprWithCleanups *E = dyn_cast(Exp)) Exp = E->getSubExpr(); assert(isa(Exp) && "EmitSynthesizedCXXCopyCtor - unknown copy ctor expr"); const CXXConstructExpr* E = cast(Exp); const CXXConstructorDecl *CD = E->getConstructor(); RunCleanupsScope Scope(*this); // If we require zero initialization before (or instead of) calling the // constructor, as can be the case with a non-user-provided default // constructor, emit the zero initialization now. // FIXME. Do I still need this for a copy ctor synthesis? if (E->requiresZeroInitialization()) EmitNullInitialization(Dest, E->getType()); assert(!getContext().getAsConstantArrayType(E->getType()) && "EmitSynthesizedCXXCopyCtor - Copied-in Array"); EmitSynthesizedCXXCopyCtorCall(CD, Dest, Src, E->arg_begin(), E->arg_end()); } static CharUnits CalculateCookiePadding(CodeGenFunction &CGF, const CXXNewExpr *E) { if (!E->isArray()) return CharUnits::Zero(); // No cookie is required if the operator new[] being used is the // reserved placement operator new[]. if (E->getOperatorNew()->isReservedGlobalPlacementOperator()) return CharUnits::Zero(); return CGF.CGM.getCXXABI().GetArrayCookieSize(E); } static llvm::Value *EmitCXXNewAllocSize(CodeGenFunction &CGF, const CXXNewExpr *e, unsigned minElements, llvm::Value *&numElements, llvm::Value *&sizeWithoutCookie) { QualType type = e->getAllocatedType(); if (!e->isArray()) { CharUnits typeSize = CGF.getContext().getTypeSizeInChars(type); sizeWithoutCookie = llvm::ConstantInt::get(CGF.SizeTy, typeSize.getQuantity()); return sizeWithoutCookie; } // The width of size_t. unsigned sizeWidth = CGF.SizeTy->getBitWidth(); // Figure out the cookie size. llvm::APInt cookieSize(sizeWidth, CalculateCookiePadding(CGF, e).getQuantity()); // Emit the array size expression. // We multiply the size of all dimensions for NumElements. // e.g for 'int[2][3]', ElemType is 'int' and NumElements is 6. numElements = CGF.EmitScalarExpr(e->getArraySize()); assert(isa(numElements->getType())); // The number of elements can be have an arbitrary integer type; // essentially, we need to multiply it by a constant factor, add a // cookie size, and verify that the result is representable as a // size_t. That's just a gloss, though, and it's wrong in one // important way: if the count is negative, it's an error even if // the cookie size would bring the total size >= 0. bool isSigned = e->getArraySize()->getType()->isSignedIntegerOrEnumerationType(); llvm::IntegerType *numElementsType = cast(numElements->getType()); unsigned numElementsWidth = numElementsType->getBitWidth(); // Compute the constant factor. llvm::APInt arraySizeMultiplier(sizeWidth, 1); while (const ConstantArrayType *CAT = CGF.getContext().getAsConstantArrayType(type)) { type = CAT->getElementType(); arraySizeMultiplier *= CAT->getSize(); } CharUnits typeSize = CGF.getContext().getTypeSizeInChars(type); llvm::APInt typeSizeMultiplier(sizeWidth, typeSize.getQuantity()); typeSizeMultiplier *= arraySizeMultiplier; // This will be a size_t. llvm::Value *size; // If someone is doing 'new int[42]' there is no need to do a dynamic check. // Don't bloat the -O0 code. if (llvm::ConstantInt *numElementsC = dyn_cast(numElements)) { const llvm::APInt &count = numElementsC->getValue(); bool hasAnyOverflow = false; // If 'count' was a negative number, it's an overflow. if (isSigned && count.isNegative()) hasAnyOverflow = true; // We want to do all this arithmetic in size_t. If numElements is // wider than that, check whether it's already too big, and if so, // overflow. else if (numElementsWidth > sizeWidth && numElementsWidth - sizeWidth > count.countLeadingZeros()) hasAnyOverflow = true; // Okay, compute a count at the right width. llvm::APInt adjustedCount = count.zextOrTrunc(sizeWidth); // If there is a brace-initializer, we cannot allocate fewer elements than // there are initializers. If we do, that's treated like an overflow. if (adjustedCount.ult(minElements)) hasAnyOverflow = true; // Scale numElements by that. This might overflow, but we don't // care because it only overflows if allocationSize does, too, and // if that overflows then we shouldn't use this. numElements = llvm::ConstantInt::get(CGF.SizeTy, adjustedCount * arraySizeMultiplier); // Compute the size before cookie, and track whether it overflowed. bool overflow; llvm::APInt allocationSize = adjustedCount.umul_ov(typeSizeMultiplier, overflow); hasAnyOverflow |= overflow; // Add in the cookie, and check whether it's overflowed. if (cookieSize != 0) { // Save the current size without a cookie. This shouldn't be // used if there was overflow. sizeWithoutCookie = llvm::ConstantInt::get(CGF.SizeTy, allocationSize); allocationSize = allocationSize.uadd_ov(cookieSize, overflow); hasAnyOverflow |= overflow; } // On overflow, produce a -1 so operator new will fail. if (hasAnyOverflow) { size = llvm::Constant::getAllOnesValue(CGF.SizeTy); } else { size = llvm::ConstantInt::get(CGF.SizeTy, allocationSize); } // Otherwise, we might need to use the overflow intrinsics. } else { // There are up to five conditions we need to test for: // 1) if isSigned, we need to check whether numElements is negative; // 2) if numElementsWidth > sizeWidth, we need to check whether // numElements is larger than something representable in size_t; // 3) if minElements > 0, we need to check whether numElements is smaller // than that. // 4) we need to compute // sizeWithoutCookie := numElements * typeSizeMultiplier // and check whether it overflows; and // 5) if we need a cookie, we need to compute // size := sizeWithoutCookie + cookieSize // and check whether it overflows. llvm::Value *hasOverflow = 0; // If numElementsWidth > sizeWidth, then one way or another, we're // going to have to do a comparison for (2), and this happens to // take care of (1), too. if (numElementsWidth > sizeWidth) { llvm::APInt threshold(numElementsWidth, 1); threshold <<= sizeWidth; llvm::Value *thresholdV = llvm::ConstantInt::get(numElementsType, threshold); hasOverflow = CGF.Builder.CreateICmpUGE(numElements, thresholdV); numElements = CGF.Builder.CreateTrunc(numElements, CGF.SizeTy); // Otherwise, if we're signed, we want to sext up to size_t. } else if (isSigned) { if (numElementsWidth < sizeWidth) numElements = CGF.Builder.CreateSExt(numElements, CGF.SizeTy); // If there's a non-1 type size multiplier, then we can do the // signedness check at the same time as we do the multiply // because a negative number times anything will cause an // unsigned overflow. Otherwise, we have to do it here. But at least // in this case, we can subsume the >= minElements check. if (typeSizeMultiplier == 1) hasOverflow = CGF.Builder.CreateICmpSLT(numElements, llvm::ConstantInt::get(CGF.SizeTy, minElements)); // Otherwise, zext up to size_t if necessary. } else if (numElementsWidth < sizeWidth) { numElements = CGF.Builder.CreateZExt(numElements, CGF.SizeTy); } assert(numElements->getType() == CGF.SizeTy); if (minElements) { // Don't allow allocation of fewer elements than we have initializers. if (!hasOverflow) { hasOverflow = CGF.Builder.CreateICmpULT(numElements, llvm::ConstantInt::get(CGF.SizeTy, minElements)); } else if (numElementsWidth > sizeWidth) { // The other existing overflow subsumes this check. // We do an unsigned comparison, since any signed value < -1 is // taken care of either above or below. hasOverflow = CGF.Builder.CreateOr(hasOverflow, CGF.Builder.CreateICmpULT(numElements, llvm::ConstantInt::get(CGF.SizeTy, minElements))); } } size = numElements; // Multiply by the type size if necessary. This multiplier // includes all the factors for nested arrays. // // This step also causes numElements to be scaled up by the // nested-array factor if necessary. Overflow on this computation // can be ignored because the result shouldn't be used if // allocation fails. if (typeSizeMultiplier != 1) { llvm::Value *umul_with_overflow = CGF.CGM.getIntrinsic(llvm::Intrinsic::umul_with_overflow, CGF.SizeTy); llvm::Value *tsmV = llvm::ConstantInt::get(CGF.SizeTy, typeSizeMultiplier); llvm::Value *result = CGF.Builder.CreateCall2(umul_with_overflow, size, tsmV); llvm::Value *overflowed = CGF.Builder.CreateExtractValue(result, 1); if (hasOverflow) hasOverflow = CGF.Builder.CreateOr(hasOverflow, overflowed); else hasOverflow = overflowed; size = CGF.Builder.CreateExtractValue(result, 0); // Also scale up numElements by the array size multiplier. if (arraySizeMultiplier != 1) { // If the base element type size is 1, then we can re-use the // multiply we just did. if (typeSize.isOne()) { assert(arraySizeMultiplier == typeSizeMultiplier); numElements = size; // Otherwise we need a separate multiply. } else { llvm::Value *asmV = llvm::ConstantInt::get(CGF.SizeTy, arraySizeMultiplier); numElements = CGF.Builder.CreateMul(numElements, asmV); } } } else { // numElements doesn't need to be scaled. assert(arraySizeMultiplier == 1); } // Add in the cookie size if necessary. if (cookieSize != 0) { sizeWithoutCookie = size; llvm::Value *uadd_with_overflow = CGF.CGM.getIntrinsic(llvm::Intrinsic::uadd_with_overflow, CGF.SizeTy); llvm::Value *cookieSizeV = llvm::ConstantInt::get(CGF.SizeTy, cookieSize); llvm::Value *result = CGF.Builder.CreateCall2(uadd_with_overflow, size, cookieSizeV); llvm::Value *overflowed = CGF.Builder.CreateExtractValue(result, 1); if (hasOverflow) hasOverflow = CGF.Builder.CreateOr(hasOverflow, overflowed); else hasOverflow = overflowed; size = CGF.Builder.CreateExtractValue(result, 0); } // If we had any possibility of dynamic overflow, make a select to // overwrite 'size' with an all-ones value, which should cause // operator new to throw. if (hasOverflow) size = CGF.Builder.CreateSelect(hasOverflow, llvm::Constant::getAllOnesValue(CGF.SizeTy), size); } if (cookieSize == 0) sizeWithoutCookie = size; else assert(sizeWithoutCookie && "didn't set sizeWithoutCookie?"); return size; } static void StoreAnyExprIntoOneUnit(CodeGenFunction &CGF, const Expr *Init, QualType AllocType, llvm::Value *NewPtr) { // FIXME: Refactor with EmitExprAsInit. CharUnits Alignment = CGF.getContext().getTypeAlignInChars(AllocType); switch (CGF.getEvaluationKind(AllocType)) { case TEK_Scalar: CGF.EmitScalarInit(Init, 0, CGF.MakeAddrLValue(NewPtr, AllocType, Alignment), false); return; case TEK_Complex: CGF.EmitComplexExprIntoLValue(Init, CGF.MakeAddrLValue(NewPtr, AllocType, Alignment), /*isInit*/ true); return; case TEK_Aggregate: { AggValueSlot Slot = AggValueSlot::forAddr(NewPtr, Alignment, AllocType.getQualifiers(), AggValueSlot::IsDestructed, AggValueSlot::DoesNotNeedGCBarriers, AggValueSlot::IsNotAliased); CGF.EmitAggExpr(Init, Slot); return; } } llvm_unreachable("bad evaluation kind"); } void CodeGenFunction::EmitNewArrayInitializer(const CXXNewExpr *E, QualType elementType, llvm::Value *beginPtr, llvm::Value *numElements) { if (!E->hasInitializer()) return; // We have a POD type. llvm::Value *explicitPtr = beginPtr; // Find the end of the array, hoisted out of the loop. llvm::Value *endPtr = Builder.CreateInBoundsGEP(beginPtr, numElements, "array.end"); unsigned initializerElements = 0; const Expr *Init = E->getInitializer(); llvm::AllocaInst *endOfInit = 0; QualType::DestructionKind dtorKind = elementType.isDestructedType(); EHScopeStack::stable_iterator cleanup; llvm::Instruction *cleanupDominator = 0; // If the initializer is an initializer list, first do the explicit elements. if (const InitListExpr *ILE = dyn_cast(Init)) { initializerElements = ILE->getNumInits(); // If this is a multi-dimensional array new, we will initialize multiple // elements with each init list element. QualType AllocType = E->getAllocatedType(); if (const ConstantArrayType *CAT = dyn_cast_or_null( AllocType->getAsArrayTypeUnsafe())) { unsigned AS = explicitPtr->getType()->getPointerAddressSpace(); llvm::Type *AllocPtrTy = ConvertTypeForMem(AllocType)->getPointerTo(AS); explicitPtr = Builder.CreateBitCast(explicitPtr, AllocPtrTy); initializerElements *= getContext().getConstantArrayElementCount(CAT); } // Enter a partial-destruction cleanup if necessary. if (needsEHCleanup(dtorKind)) { // In principle we could tell the cleanup where we are more // directly, but the control flow can get so varied here that it // would actually be quite complex. Therefore we go through an // alloca. endOfInit = CreateTempAlloca(beginPtr->getType(), "array.endOfInit"); cleanupDominator = Builder.CreateStore(beginPtr, endOfInit); pushIrregularPartialArrayCleanup(beginPtr, endOfInit, elementType, getDestroyer(dtorKind)); cleanup = EHStack.stable_begin(); } for (unsigned i = 0, e = ILE->getNumInits(); i != e; ++i) { // Tell the cleanup that it needs to destroy up to this // element. TODO: some of these stores can be trivially // observed to be unnecessary. if (endOfInit) Builder.CreateStore(explicitPtr, endOfInit); StoreAnyExprIntoOneUnit(*this, ILE->getInit(i), ILE->getInit(i)->getType(), explicitPtr); explicitPtr = Builder.CreateConstGEP1_32(explicitPtr, 1, "array.exp.next"); } // The remaining elements are filled with the array filler expression. Init = ILE->getArrayFiller(); explicitPtr = Builder.CreateBitCast(explicitPtr, beginPtr->getType()); } // Create the continuation block. llvm::BasicBlock *contBB = createBasicBlock("new.loop.end"); // If the number of elements isn't constant, we have to now check if there is // anything left to initialize. if (llvm::ConstantInt *constNum = dyn_cast(numElements)) { // If all elements have already been initialized, skip the whole loop. if (constNum->getZExtValue() <= initializerElements) { // If there was a cleanup, deactivate it. if (cleanupDominator) DeactivateCleanupBlock(cleanup, cleanupDominator); return; } } else { llvm::BasicBlock *nonEmptyBB = createBasicBlock("new.loop.nonempty"); llvm::Value *isEmpty = Builder.CreateICmpEQ(explicitPtr, endPtr, "array.isempty"); Builder.CreateCondBr(isEmpty, contBB, nonEmptyBB); EmitBlock(nonEmptyBB); } // Enter the loop. llvm::BasicBlock *entryBB = Builder.GetInsertBlock(); llvm::BasicBlock *loopBB = createBasicBlock("new.loop"); EmitBlock(loopBB); // Set up the current-element phi. llvm::PHINode *curPtr = Builder.CreatePHI(explicitPtr->getType(), 2, "array.cur"); curPtr->addIncoming(explicitPtr, entryBB); // Store the new cleanup position for irregular cleanups. if (endOfInit) Builder.CreateStore(curPtr, endOfInit); // Enter a partial-destruction cleanup if necessary. if (!cleanupDominator && needsEHCleanup(dtorKind)) { pushRegularPartialArrayCleanup(beginPtr, curPtr, elementType, getDestroyer(dtorKind)); cleanup = EHStack.stable_begin(); cleanupDominator = Builder.CreateUnreachable(); } // Emit the initializer into this element. StoreAnyExprIntoOneUnit(*this, Init, E->getAllocatedType(), curPtr); // Leave the cleanup if we entered one. if (cleanupDominator) { DeactivateCleanupBlock(cleanup, cleanupDominator); cleanupDominator->eraseFromParent(); } // FIXME: The code below intends to initialize the individual array base // elements, one at a time - but when dealing with multi-dimensional arrays - // the pointer arithmetic can get confused - so the fix below entails casting // to the allocated type to ensure that we get the pointer arithmetic right. // It seems like the right approach here, it to really initialize the // individual array base elements one at a time since it'll generate less // code. I think the problem is that the wrong type is being passed into // StoreAnyExprIntoOneUnit, but directly fixing that doesn't really work, // because the Init expression has the wrong type at this point. // So... this is ok for a quick fix, but we can and should do a lot better // here long-term. // Advance to the next element by adjusting the pointer type as necessary. // For new int[10][20][30], alloc type is int[20][30], base type is 'int'. QualType AllocType = E->getAllocatedType(); llvm::Type *AllocPtrTy = ConvertTypeForMem(AllocType)->getPointerTo( curPtr->getType()->getPointerAddressSpace()); llvm::Value *curPtrAllocTy = Builder.CreateBitCast(curPtr, AllocPtrTy); llvm::Value *nextPtrAllocTy = Builder.CreateConstGEP1_32(curPtrAllocTy, 1, "array.next"); // Cast it back to the base type so that we can compare it to the endPtr. llvm::Value *nextPtr = Builder.CreateBitCast(nextPtrAllocTy, endPtr->getType()); // Check whether we've gotten to the end of the array and, if so, // exit the loop. llvm::Value *isEnd = Builder.CreateICmpEQ(nextPtr, endPtr, "array.atend"); Builder.CreateCondBr(isEnd, contBB, loopBB); curPtr->addIncoming(nextPtr, Builder.GetInsertBlock()); EmitBlock(contBB); } static void EmitZeroMemSet(CodeGenFunction &CGF, QualType T, llvm::Value *NewPtr, llvm::Value *Size) { CGF.EmitCastToVoidPtr(NewPtr); CharUnits Alignment = CGF.getContext().getTypeAlignInChars(T); CGF.Builder.CreateMemSet(NewPtr, CGF.Builder.getInt8(0), Size, Alignment.getQuantity(), false); } static void EmitNewInitializer(CodeGenFunction &CGF, const CXXNewExpr *E, QualType ElementType, llvm::Value *NewPtr, llvm::Value *NumElements, llvm::Value *AllocSizeWithoutCookie) { const Expr *Init = E->getInitializer(); if (E->isArray()) { if (const CXXConstructExpr *CCE = dyn_cast_or_null(Init)){ CXXConstructorDecl *Ctor = CCE->getConstructor(); if (Ctor->isTrivial()) { // If new expression did not specify value-initialization, then there // is no initialization. if (!CCE->requiresZeroInitialization() || Ctor->getParent()->isEmpty()) return; if (CGF.CGM.getTypes().isZeroInitializable(ElementType)) { // Optimization: since zero initialization will just set the memory // to all zeroes, generate a single memset to do it in one shot. EmitZeroMemSet(CGF, ElementType, NewPtr, AllocSizeWithoutCookie); return; } } CGF.EmitCXXAggrConstructorCall(Ctor, NumElements, NewPtr, CCE->arg_begin(), CCE->arg_end(), CCE->requiresZeroInitialization()); return; } else if (Init && isa(Init) && CGF.CGM.getTypes().isZeroInitializable(ElementType)) { // Optimization: since zero initialization will just set the memory // to all zeroes, generate a single memset to do it in one shot. EmitZeroMemSet(CGF, ElementType, NewPtr, AllocSizeWithoutCookie); return; } CGF.EmitNewArrayInitializer(E, ElementType, NewPtr, NumElements); return; } if (!Init) return; StoreAnyExprIntoOneUnit(CGF, Init, E->getAllocatedType(), NewPtr); } /// Emit a call to an operator new or operator delete function, as implicitly /// created by new-expressions and delete-expressions. static RValue EmitNewDeleteCall(CodeGenFunction &CGF, const FunctionDecl *Callee, const FunctionProtoType *CalleeType, const CallArgList &Args) { llvm::Instruction *CallOrInvoke; llvm::Value *CalleeAddr = CGF.CGM.GetAddrOfFunction(Callee); RValue RV = CGF.EmitCall(CGF.CGM.getTypes().arrangeFreeFunctionCall(Args, CalleeType), CalleeAddr, ReturnValueSlot(), Args, Callee, &CallOrInvoke); /// C++1y [expr.new]p10: /// [In a new-expression,] an implementation is allowed to omit a call /// to a replaceable global allocation function. /// /// We model such elidable calls with the 'builtin' attribute. llvm::Function *Fn = dyn_cast(CalleeAddr); if (Callee->isReplaceableGlobalAllocationFunction() && Fn && Fn->hasFnAttribute(llvm::Attribute::NoBuiltin)) { // FIXME: Add addAttribute to CallSite. if (llvm::CallInst *CI = dyn_cast(CallOrInvoke)) CI->addAttribute(llvm::AttributeSet::FunctionIndex, llvm::Attribute::Builtin); else if (llvm::InvokeInst *II = dyn_cast(CallOrInvoke)) II->addAttribute(llvm::AttributeSet::FunctionIndex, llvm::Attribute::Builtin); else llvm_unreachable("unexpected kind of call instruction"); } return RV; } namespace { /// A cleanup to call the given 'operator delete' function upon /// abnormal exit from a new expression. class CallDeleteDuringNew : public EHScopeStack::Cleanup { size_t NumPlacementArgs; const FunctionDecl *OperatorDelete; llvm::Value *Ptr; llvm::Value *AllocSize; RValue *getPlacementArgs() { return reinterpret_cast(this+1); } public: static size_t getExtraSize(size_t NumPlacementArgs) { return NumPlacementArgs * sizeof(RValue); } CallDeleteDuringNew(size_t NumPlacementArgs, const FunctionDecl *OperatorDelete, llvm::Value *Ptr, llvm::Value *AllocSize) : NumPlacementArgs(NumPlacementArgs), OperatorDelete(OperatorDelete), Ptr(Ptr), AllocSize(AllocSize) {} void setPlacementArg(unsigned I, RValue Arg) { assert(I < NumPlacementArgs && "index out of range"); getPlacementArgs()[I] = Arg; } void Emit(CodeGenFunction &CGF, Flags flags) { const FunctionProtoType *FPT = OperatorDelete->getType()->getAs(); assert(FPT->getNumParams() == NumPlacementArgs + 1 || (FPT->getNumParams() == 2 && NumPlacementArgs == 0)); CallArgList DeleteArgs; // The first argument is always a void*. FunctionProtoType::param_type_iterator AI = FPT->param_type_begin(); DeleteArgs.add(RValue::get(Ptr), *AI++); // A member 'operator delete' can take an extra 'size_t' argument. if (FPT->getNumParams() == NumPlacementArgs + 2) DeleteArgs.add(RValue::get(AllocSize), *AI++); // Pass the rest of the arguments, which must match exactly. for (unsigned I = 0; I != NumPlacementArgs; ++I) DeleteArgs.add(getPlacementArgs()[I], *AI++); // Call 'operator delete'. EmitNewDeleteCall(CGF, OperatorDelete, FPT, DeleteArgs); } }; /// A cleanup to call the given 'operator delete' function upon /// abnormal exit from a new expression when the new expression is /// conditional. class CallDeleteDuringConditionalNew : public EHScopeStack::Cleanup { size_t NumPlacementArgs; const FunctionDecl *OperatorDelete; DominatingValue::saved_type Ptr; DominatingValue::saved_type AllocSize; DominatingValue::saved_type *getPlacementArgs() { return reinterpret_cast::saved_type*>(this+1); } public: static size_t getExtraSize(size_t NumPlacementArgs) { return NumPlacementArgs * sizeof(DominatingValue::saved_type); } CallDeleteDuringConditionalNew(size_t NumPlacementArgs, const FunctionDecl *OperatorDelete, DominatingValue::saved_type Ptr, DominatingValue::saved_type AllocSize) : NumPlacementArgs(NumPlacementArgs), OperatorDelete(OperatorDelete), Ptr(Ptr), AllocSize(AllocSize) {} void setPlacementArg(unsigned I, DominatingValue::saved_type Arg) { assert(I < NumPlacementArgs && "index out of range"); getPlacementArgs()[I] = Arg; } void Emit(CodeGenFunction &CGF, Flags flags) { const FunctionProtoType *FPT = OperatorDelete->getType()->getAs(); assert(FPT->getNumParams() == NumPlacementArgs + 1 || (FPT->getNumParams() == 2 && NumPlacementArgs == 0)); CallArgList DeleteArgs; // The first argument is always a void*. FunctionProtoType::param_type_iterator AI = FPT->param_type_begin(); DeleteArgs.add(Ptr.restore(CGF), *AI++); // A member 'operator delete' can take an extra 'size_t' argument. if (FPT->getNumParams() == NumPlacementArgs + 2) { RValue RV = AllocSize.restore(CGF); DeleteArgs.add(RV, *AI++); } // Pass the rest of the arguments, which must match exactly. for (unsigned I = 0; I != NumPlacementArgs; ++I) { RValue RV = getPlacementArgs()[I].restore(CGF); DeleteArgs.add(RV, *AI++); } // Call 'operator delete'. EmitNewDeleteCall(CGF, OperatorDelete, FPT, DeleteArgs); } }; } /// Enter a cleanup to call 'operator delete' if the initializer in a /// new-expression throws. static void EnterNewDeleteCleanup(CodeGenFunction &CGF, const CXXNewExpr *E, llvm::Value *NewPtr, llvm::Value *AllocSize, const CallArgList &NewArgs) { // If we're not inside a conditional branch, then the cleanup will // dominate and we can do the easier (and more efficient) thing. if (!CGF.isInConditionalBranch()) { CallDeleteDuringNew *Cleanup = CGF.EHStack .pushCleanupWithExtra(EHCleanup, E->getNumPlacementArgs(), E->getOperatorDelete(), NewPtr, AllocSize); for (unsigned I = 0, N = E->getNumPlacementArgs(); I != N; ++I) Cleanup->setPlacementArg(I, NewArgs[I+1].RV); return; } // Otherwise, we need to save all this stuff. DominatingValue::saved_type SavedNewPtr = DominatingValue::save(CGF, RValue::get(NewPtr)); DominatingValue::saved_type SavedAllocSize = DominatingValue::save(CGF, RValue::get(AllocSize)); CallDeleteDuringConditionalNew *Cleanup = CGF.EHStack .pushCleanupWithExtra(EHCleanup, E->getNumPlacementArgs(), E->getOperatorDelete(), SavedNewPtr, SavedAllocSize); for (unsigned I = 0, N = E->getNumPlacementArgs(); I != N; ++I) Cleanup->setPlacementArg(I, DominatingValue::save(CGF, NewArgs[I+1].RV)); CGF.initFullExprCleanup(); } llvm::Value *CodeGenFunction::EmitCXXNewExpr(const CXXNewExpr *E) { // The element type being allocated. QualType allocType = getContext().getBaseElementType(E->getAllocatedType()); // 1. Build a call to the allocation function. FunctionDecl *allocator = E->getOperatorNew(); const FunctionProtoType *allocatorType = allocator->getType()->castAs(); CallArgList allocatorArgs; // The allocation size is the first argument. QualType sizeType = getContext().getSizeType(); // If there is a brace-initializer, cannot allocate fewer elements than inits. unsigned minElements = 0; if (E->isArray() && E->hasInitializer()) { if (const InitListExpr *ILE = dyn_cast(E->getInitializer())) minElements = ILE->getNumInits(); } llvm::Value *numElements = 0; llvm::Value *allocSizeWithoutCookie = 0; llvm::Value *allocSize = EmitCXXNewAllocSize(*this, E, minElements, numElements, allocSizeWithoutCookie); allocatorArgs.add(RValue::get(allocSize), sizeType); // We start at 1 here because the first argument (the allocation size) // has already been emitted. EmitCallArgs(allocatorArgs, allocatorType->isVariadic(), allocatorType->param_type_begin() + 1, allocatorType->param_type_end(), E->placement_arg_begin(), E->placement_arg_end()); // Emit the allocation call. If the allocator is a global placement // operator, just "inline" it directly. RValue RV; if (allocator->isReservedGlobalPlacementOperator()) { assert(allocatorArgs.size() == 2); RV = allocatorArgs[1].RV; // TODO: kill any unnecessary computations done for the size // argument. } else { RV = EmitNewDeleteCall(*this, allocator, allocatorType, allocatorArgs); } // Emit a null check on the allocation result if the allocation // function is allowed to return null (because it has a non-throwing // exception spec; for this part, we inline // CXXNewExpr::shouldNullCheckAllocation()) and we have an // interesting initializer. bool nullCheck = allocatorType->isNothrow(getContext()) && (!allocType.isPODType(getContext()) || E->hasInitializer()); llvm::BasicBlock *nullCheckBB = 0; llvm::BasicBlock *contBB = 0; llvm::Value *allocation = RV.getScalarVal(); unsigned AS = allocation->getType()->getPointerAddressSpace(); // The null-check means that the initializer is conditionally // evaluated. ConditionalEvaluation conditional(*this); if (nullCheck) { conditional.begin(*this); nullCheckBB = Builder.GetInsertBlock(); llvm::BasicBlock *notNullBB = createBasicBlock("new.notnull"); contBB = createBasicBlock("new.cont"); llvm::Value *isNull = Builder.CreateIsNull(allocation, "new.isnull"); Builder.CreateCondBr(isNull, contBB, notNullBB); EmitBlock(notNullBB); } // If there's an operator delete, enter a cleanup to call it if an // exception is thrown. EHScopeStack::stable_iterator operatorDeleteCleanup; llvm::Instruction *cleanupDominator = 0; if (E->getOperatorDelete() && !E->getOperatorDelete()->isReservedGlobalPlacementOperator()) { EnterNewDeleteCleanup(*this, E, allocation, allocSize, allocatorArgs); operatorDeleteCleanup = EHStack.stable_begin(); cleanupDominator = Builder.CreateUnreachable(); } assert((allocSize == allocSizeWithoutCookie) == CalculateCookiePadding(*this, E).isZero()); if (allocSize != allocSizeWithoutCookie) { assert(E->isArray()); allocation = CGM.getCXXABI().InitializeArrayCookie(*this, allocation, numElements, E, allocType); } llvm::Type *elementPtrTy = ConvertTypeForMem(allocType)->getPointerTo(AS); llvm::Value *result = Builder.CreateBitCast(allocation, elementPtrTy); EmitNewInitializer(*this, E, allocType, result, numElements, allocSizeWithoutCookie); if (E->isArray()) { // NewPtr is a pointer to the base element type. If we're // allocating an array of arrays, we'll need to cast back to the // array pointer type. llvm::Type *resultType = ConvertTypeForMem(E->getType()); if (result->getType() != resultType) result = Builder.CreateBitCast(result, resultType); } // Deactivate the 'operator delete' cleanup if we finished // initialization. if (operatorDeleteCleanup.isValid()) { DeactivateCleanupBlock(operatorDeleteCleanup, cleanupDominator); cleanupDominator->eraseFromParent(); } if (nullCheck) { conditional.end(*this); llvm::BasicBlock *notNullBB = Builder.GetInsertBlock(); EmitBlock(contBB); llvm::PHINode *PHI = Builder.CreatePHI(result->getType(), 2); PHI->addIncoming(result, notNullBB); PHI->addIncoming(llvm::Constant::getNullValue(result->getType()), nullCheckBB); result = PHI; } return result; } void CodeGenFunction::EmitDeleteCall(const FunctionDecl *DeleteFD, llvm::Value *Ptr, QualType DeleteTy) { assert(DeleteFD->getOverloadedOperator() == OO_Delete); const FunctionProtoType *DeleteFTy = DeleteFD->getType()->getAs(); CallArgList DeleteArgs; // Check if we need to pass the size to the delete operator. llvm::Value *Size = 0; QualType SizeTy; if (DeleteFTy->getNumParams() == 2) { SizeTy = DeleteFTy->getParamType(1); CharUnits DeleteTypeSize = getContext().getTypeSizeInChars(DeleteTy); Size = llvm::ConstantInt::get(ConvertType(SizeTy), DeleteTypeSize.getQuantity()); } QualType ArgTy = DeleteFTy->getParamType(0); llvm::Value *DeletePtr = Builder.CreateBitCast(Ptr, ConvertType(ArgTy)); DeleteArgs.add(RValue::get(DeletePtr), ArgTy); if (Size) DeleteArgs.add(RValue::get(Size), SizeTy); // Emit the call to delete. EmitNewDeleteCall(*this, DeleteFD, DeleteFTy, DeleteArgs); } namespace { /// Calls the given 'operator delete' on a single object. struct CallObjectDelete : EHScopeStack::Cleanup { llvm::Value *Ptr; const FunctionDecl *OperatorDelete; QualType ElementType; CallObjectDelete(llvm::Value *Ptr, const FunctionDecl *OperatorDelete, QualType ElementType) : Ptr(Ptr), OperatorDelete(OperatorDelete), ElementType(ElementType) {} void Emit(CodeGenFunction &CGF, Flags flags) { CGF.EmitDeleteCall(OperatorDelete, Ptr, ElementType); } }; } /// Emit the code for deleting a single object. static void EmitObjectDelete(CodeGenFunction &CGF, const FunctionDecl *OperatorDelete, llvm::Value *Ptr, QualType ElementType, bool UseGlobalDelete) { // Find the destructor for the type, if applicable. If the // destructor is virtual, we'll just emit the vcall and return. const CXXDestructorDecl *Dtor = 0; if (const RecordType *RT = ElementType->getAs()) { CXXRecordDecl *RD = cast(RT->getDecl()); if (RD->hasDefinition() && !RD->hasTrivialDestructor()) { Dtor = RD->getDestructor(); if (Dtor->isVirtual()) { if (UseGlobalDelete) { // If we're supposed to call the global delete, make sure we do so // even if the destructor throws. // Derive the complete-object pointer, which is what we need // to pass to the deallocation function. llvm::Value *completePtr = CGF.CGM.getCXXABI().adjustToCompleteObject(CGF, Ptr, ElementType); CGF.EHStack.pushCleanup(NormalAndEHCleanup, completePtr, OperatorDelete, ElementType); } // FIXME: Provide a source location here. CXXDtorType DtorType = UseGlobalDelete ? Dtor_Complete : Dtor_Deleting; CGF.CGM.getCXXABI().EmitVirtualDestructorCall(CGF, Dtor, DtorType, SourceLocation(), Ptr); if (UseGlobalDelete) { CGF.PopCleanupBlock(); } return; } } } // Make sure that we call delete even if the dtor throws. // This doesn't have to a conditional cleanup because we're going // to pop it off in a second. CGF.EHStack.pushCleanup(NormalAndEHCleanup, Ptr, OperatorDelete, ElementType); if (Dtor) CGF.EmitCXXDestructorCall(Dtor, Dtor_Complete, /*ForVirtualBase=*/false, /*Delegating=*/false, Ptr); else if (CGF.getLangOpts().ObjCAutoRefCount && ElementType->isObjCLifetimeType()) { switch (ElementType.getObjCLifetime()) { case Qualifiers::OCL_None: case Qualifiers::OCL_ExplicitNone: case Qualifiers::OCL_Autoreleasing: break; case Qualifiers::OCL_Strong: { // Load the pointer value. llvm::Value *PtrValue = CGF.Builder.CreateLoad(Ptr, ElementType.isVolatileQualified()); CGF.EmitARCRelease(PtrValue, ARCPreciseLifetime); break; } case Qualifiers::OCL_Weak: CGF.EmitARCDestroyWeak(Ptr); break; } } CGF.PopCleanupBlock(); } namespace { /// Calls the given 'operator delete' on an array of objects. struct CallArrayDelete : EHScopeStack::Cleanup { llvm::Value *Ptr; const FunctionDecl *OperatorDelete; llvm::Value *NumElements; QualType ElementType; CharUnits CookieSize; CallArrayDelete(llvm::Value *Ptr, const FunctionDecl *OperatorDelete, llvm::Value *NumElements, QualType ElementType, CharUnits CookieSize) : Ptr(Ptr), OperatorDelete(OperatorDelete), NumElements(NumElements), ElementType(ElementType), CookieSize(CookieSize) {} void Emit(CodeGenFunction &CGF, Flags flags) { const FunctionProtoType *DeleteFTy = OperatorDelete->getType()->getAs(); assert(DeleteFTy->getNumParams() == 1 || DeleteFTy->getNumParams() == 2); CallArgList Args; // Pass the pointer as the first argument. QualType VoidPtrTy = DeleteFTy->getParamType(0); llvm::Value *DeletePtr = CGF.Builder.CreateBitCast(Ptr, CGF.ConvertType(VoidPtrTy)); Args.add(RValue::get(DeletePtr), VoidPtrTy); // Pass the original requested size as the second argument. if (DeleteFTy->getNumParams() == 2) { QualType size_t = DeleteFTy->getParamType(1); llvm::IntegerType *SizeTy = cast(CGF.ConvertType(size_t)); CharUnits ElementTypeSize = CGF.CGM.getContext().getTypeSizeInChars(ElementType); // The size of an element, multiplied by the number of elements. llvm::Value *Size = llvm::ConstantInt::get(SizeTy, ElementTypeSize.getQuantity()); Size = CGF.Builder.CreateMul(Size, NumElements); // Plus the size of the cookie if applicable. if (!CookieSize.isZero()) { llvm::Value *CookieSizeV = llvm::ConstantInt::get(SizeTy, CookieSize.getQuantity()); Size = CGF.Builder.CreateAdd(Size, CookieSizeV); } Args.add(RValue::get(Size), size_t); } // Emit the call to delete. EmitNewDeleteCall(CGF, OperatorDelete, DeleteFTy, Args); } }; } /// Emit the code for deleting an array of objects. static void EmitArrayDelete(CodeGenFunction &CGF, const CXXDeleteExpr *E, llvm::Value *deletedPtr, QualType elementType) { llvm::Value *numElements = 0; llvm::Value *allocatedPtr = 0; CharUnits cookieSize; CGF.CGM.getCXXABI().ReadArrayCookie(CGF, deletedPtr, E, elementType, numElements, allocatedPtr, cookieSize); assert(allocatedPtr && "ReadArrayCookie didn't set allocated pointer"); // Make sure that we call delete even if one of the dtors throws. const FunctionDecl *operatorDelete = E->getOperatorDelete(); CGF.EHStack.pushCleanup(NormalAndEHCleanup, allocatedPtr, operatorDelete, numElements, elementType, cookieSize); // Destroy the elements. if (QualType::DestructionKind dtorKind = elementType.isDestructedType()) { assert(numElements && "no element count for a type with a destructor!"); llvm::Value *arrayEnd = CGF.Builder.CreateInBoundsGEP(deletedPtr, numElements, "delete.end"); // Note that it is legal to allocate a zero-length array, and we // can never fold the check away because the length should always // come from a cookie. CGF.emitArrayDestroy(deletedPtr, arrayEnd, elementType, CGF.getDestroyer(dtorKind), /*checkZeroLength*/ true, CGF.needsEHCleanup(dtorKind)); } // Pop the cleanup block. CGF.PopCleanupBlock(); } void CodeGenFunction::EmitCXXDeleteExpr(const CXXDeleteExpr *E) { const Expr *Arg = E->getArgument(); llvm::Value *Ptr = EmitScalarExpr(Arg); // Null check the pointer. llvm::BasicBlock *DeleteNotNull = createBasicBlock("delete.notnull"); llvm::BasicBlock *DeleteEnd = createBasicBlock("delete.end"); llvm::Value *IsNull = Builder.CreateIsNull(Ptr, "isnull"); Builder.CreateCondBr(IsNull, DeleteEnd, DeleteNotNull); EmitBlock(DeleteNotNull); // We might be deleting a pointer to array. If so, GEP down to the // first non-array element. // (this assumes that A(*)[3][7] is converted to [3 x [7 x %A]]*) QualType DeleteTy = Arg->getType()->getAs()->getPointeeType(); if (DeleteTy->isConstantArrayType()) { llvm::Value *Zero = Builder.getInt32(0); SmallVector GEP; GEP.push_back(Zero); // point at the outermost array // For each layer of array type we're pointing at: while (const ConstantArrayType *Arr = getContext().getAsConstantArrayType(DeleteTy)) { // 1. Unpeel the array type. DeleteTy = Arr->getElementType(); // 2. GEP to the first element of the array. GEP.push_back(Zero); } Ptr = Builder.CreateInBoundsGEP(Ptr, GEP, "del.first"); } assert(ConvertTypeForMem(DeleteTy) == cast(Ptr->getType())->getElementType()); if (E->isArrayForm()) { EmitArrayDelete(*this, E, Ptr, DeleteTy); } else { EmitObjectDelete(*this, E->getOperatorDelete(), Ptr, DeleteTy, E->isGlobalDelete()); } EmitBlock(DeleteEnd); } static llvm::Constant *getBadTypeidFn(CodeGenFunction &CGF) { // void __cxa_bad_typeid(); llvm::FunctionType *FTy = llvm::FunctionType::get(CGF.VoidTy, false); return CGF.CGM.CreateRuntimeFunction(FTy, "__cxa_bad_typeid"); } static void EmitBadTypeidCall(CodeGenFunction &CGF) { llvm::Value *Fn = getBadTypeidFn(CGF); CGF.EmitRuntimeCallOrInvoke(Fn).setDoesNotReturn(); CGF.Builder.CreateUnreachable(); } static llvm::Value *EmitTypeidFromVTable(CodeGenFunction &CGF, const Expr *E, llvm::Type *StdTypeInfoPtrTy) { // Get the vtable pointer. llvm::Value *ThisPtr = CGF.EmitLValue(E).getAddress(); // C++ [expr.typeid]p2: // If the glvalue expression is obtained by applying the unary * operator to // a pointer and the pointer is a null pointer value, the typeid expression // throws the std::bad_typeid exception. if (const UnaryOperator *UO = dyn_cast(E->IgnoreParens())) { if (UO->getOpcode() == UO_Deref) { llvm::BasicBlock *BadTypeidBlock = CGF.createBasicBlock("typeid.bad_typeid"); llvm::BasicBlock *EndBlock = CGF.createBasicBlock("typeid.end"); llvm::Value *IsNull = CGF.Builder.CreateIsNull(ThisPtr); CGF.Builder.CreateCondBr(IsNull, BadTypeidBlock, EndBlock); CGF.EmitBlock(BadTypeidBlock); EmitBadTypeidCall(CGF); CGF.EmitBlock(EndBlock); } } llvm::Value *Value = CGF.GetVTablePtr(ThisPtr, StdTypeInfoPtrTy->getPointerTo()); // Load the type info. Value = CGF.Builder.CreateConstInBoundsGEP1_64(Value, -1ULL); return CGF.Builder.CreateLoad(Value); } llvm::Value *CodeGenFunction::EmitCXXTypeidExpr(const CXXTypeidExpr *E) { llvm::Type *StdTypeInfoPtrTy = ConvertType(E->getType())->getPointerTo(); if (E->isTypeOperand()) { llvm::Constant *TypeInfo = CGM.GetAddrOfRTTIDescriptor(E->getTypeOperand(getContext())); return Builder.CreateBitCast(TypeInfo, StdTypeInfoPtrTy); } // C++ [expr.typeid]p2: // When typeid is applied to a glvalue expression whose type is a // polymorphic class type, the result refers to a std::type_info object // representing the type of the most derived object (that is, the dynamic // type) to which the glvalue refers. if (E->isPotentiallyEvaluated()) return EmitTypeidFromVTable(*this, E->getExprOperand(), StdTypeInfoPtrTy); QualType OperandTy = E->getExprOperand()->getType(); return Builder.CreateBitCast(CGM.GetAddrOfRTTIDescriptor(OperandTy), StdTypeInfoPtrTy); } static llvm::Constant *getDynamicCastFn(CodeGenFunction &CGF) { // void *__dynamic_cast(const void *sub, // const abi::__class_type_info *src, // const abi::__class_type_info *dst, // std::ptrdiff_t src2dst_offset); llvm::Type *Int8PtrTy = CGF.Int8PtrTy; llvm::Type *PtrDiffTy = CGF.ConvertType(CGF.getContext().getPointerDiffType()); llvm::Type *Args[4] = { Int8PtrTy, Int8PtrTy, Int8PtrTy, PtrDiffTy }; llvm::FunctionType *FTy = llvm::FunctionType::get(Int8PtrTy, Args, false); // Mark the function as nounwind readonly. llvm::Attribute::AttrKind FuncAttrs[] = { llvm::Attribute::NoUnwind, llvm::Attribute::ReadOnly }; llvm::AttributeSet Attrs = llvm::AttributeSet::get( CGF.getLLVMContext(), llvm::AttributeSet::FunctionIndex, FuncAttrs); return CGF.CGM.CreateRuntimeFunction(FTy, "__dynamic_cast", Attrs); } static llvm::Constant *getBadCastFn(CodeGenFunction &CGF) { // void __cxa_bad_cast(); llvm::FunctionType *FTy = llvm::FunctionType::get(CGF.VoidTy, false); return CGF.CGM.CreateRuntimeFunction(FTy, "__cxa_bad_cast"); } static void EmitBadCastCall(CodeGenFunction &CGF) { llvm::Value *Fn = getBadCastFn(CGF); CGF.EmitRuntimeCallOrInvoke(Fn).setDoesNotReturn(); CGF.Builder.CreateUnreachable(); } /// \brief Compute the src2dst_offset hint as described in the /// Itanium C++ ABI [2.9.7] static CharUnits computeOffsetHint(ASTContext &Context, const CXXRecordDecl *Src, const CXXRecordDecl *Dst) { CXXBasePaths Paths(/*FindAmbiguities=*/true, /*RecordPaths=*/true, /*DetectVirtual=*/false); // If Dst is not derived from Src we can skip the whole computation below and // return that Src is not a public base of Dst. Record all inheritance paths. if (!Dst->isDerivedFrom(Src, Paths)) return CharUnits::fromQuantity(-2ULL); unsigned NumPublicPaths = 0; CharUnits Offset; // Now walk all possible inheritance paths. for (CXXBasePaths::paths_iterator I = Paths.begin(), E = Paths.end(); I != E; ++I) { if (I->Access != AS_public) // Ignore non-public inheritance. continue; ++NumPublicPaths; for (CXXBasePath::iterator J = I->begin(), JE = I->end(); J != JE; ++J) { // If the path contains a virtual base class we can't give any hint. // -1: no hint. if (J->Base->isVirtual()) return CharUnits::fromQuantity(-1ULL); if (NumPublicPaths > 1) // Won't use offsets, skip computation. continue; // Accumulate the base class offsets. const ASTRecordLayout &L = Context.getASTRecordLayout(J->Class); Offset += L.getBaseClassOffset(J->Base->getType()->getAsCXXRecordDecl()); } } // -2: Src is not a public base of Dst. if (NumPublicPaths == 0) return CharUnits::fromQuantity(-2ULL); // -3: Src is a multiple public base type but never a virtual base type. if (NumPublicPaths > 1) return CharUnits::fromQuantity(-3ULL); // Otherwise, the Src type is a unique public nonvirtual base type of Dst. // Return the offset of Src from the origin of Dst. return Offset; } static llvm::Value * EmitDynamicCastCall(CodeGenFunction &CGF, llvm::Value *Value, QualType SrcTy, QualType DestTy, llvm::BasicBlock *CastEnd) { llvm::Type *PtrDiffLTy = CGF.ConvertType(CGF.getContext().getPointerDiffType()); llvm::Type *DestLTy = CGF.ConvertType(DestTy); if (const PointerType *PTy = DestTy->getAs()) { if (PTy->getPointeeType()->isVoidType()) { // C++ [expr.dynamic.cast]p7: // If T is "pointer to cv void," then the result is a pointer to the // most derived object pointed to by v. // Get the vtable pointer. llvm::Value *VTable = CGF.GetVTablePtr(Value, PtrDiffLTy->getPointerTo()); // Get the offset-to-top from the vtable. llvm::Value *OffsetToTop = CGF.Builder.CreateConstInBoundsGEP1_64(VTable, -2ULL); OffsetToTop = CGF.Builder.CreateLoad(OffsetToTop, "offset.to.top"); // Finally, add the offset to the pointer. Value = CGF.EmitCastToVoidPtr(Value); Value = CGF.Builder.CreateInBoundsGEP(Value, OffsetToTop); return CGF.Builder.CreateBitCast(Value, DestLTy); } } QualType SrcRecordTy; QualType DestRecordTy; if (const PointerType *DestPTy = DestTy->getAs()) { SrcRecordTy = SrcTy->castAs()->getPointeeType(); DestRecordTy = DestPTy->getPointeeType(); } else { SrcRecordTy = SrcTy; DestRecordTy = DestTy->castAs()->getPointeeType(); } assert(SrcRecordTy->isRecordType() && "source type must be a record type!"); assert(DestRecordTy->isRecordType() && "dest type must be a record type!"); llvm::Value *SrcRTTI = CGF.CGM.GetAddrOfRTTIDescriptor(SrcRecordTy.getUnqualifiedType()); llvm::Value *DestRTTI = CGF.CGM.GetAddrOfRTTIDescriptor(DestRecordTy.getUnqualifiedType()); // Compute the offset hint. const CXXRecordDecl *SrcDecl = SrcRecordTy->getAsCXXRecordDecl(); const CXXRecordDecl *DestDecl = DestRecordTy->getAsCXXRecordDecl(); llvm::Value *OffsetHint = llvm::ConstantInt::get(PtrDiffLTy, computeOffsetHint(CGF.getContext(), SrcDecl, DestDecl).getQuantity()); // Emit the call to __dynamic_cast. Value = CGF.EmitCastToVoidPtr(Value); llvm::Value *args[] = { Value, SrcRTTI, DestRTTI, OffsetHint }; Value = CGF.EmitNounwindRuntimeCall(getDynamicCastFn(CGF), args); Value = CGF.Builder.CreateBitCast(Value, DestLTy); /// C++ [expr.dynamic.cast]p9: /// A failed cast to reference type throws std::bad_cast if (DestTy->isReferenceType()) { llvm::BasicBlock *BadCastBlock = CGF.createBasicBlock("dynamic_cast.bad_cast"); llvm::Value *IsNull = CGF.Builder.CreateIsNull(Value); CGF.Builder.CreateCondBr(IsNull, BadCastBlock, CastEnd); CGF.EmitBlock(BadCastBlock); EmitBadCastCall(CGF); } return Value; } static llvm::Value *EmitDynamicCastToNull(CodeGenFunction &CGF, QualType DestTy) { llvm::Type *DestLTy = CGF.ConvertType(DestTy); if (DestTy->isPointerType()) return llvm::Constant::getNullValue(DestLTy); /// C++ [expr.dynamic.cast]p9: /// A failed cast to reference type throws std::bad_cast EmitBadCastCall(CGF); CGF.EmitBlock(CGF.createBasicBlock("dynamic_cast.end")); return llvm::UndefValue::get(DestLTy); } llvm::Value *CodeGenFunction::EmitDynamicCast(llvm::Value *Value, const CXXDynamicCastExpr *DCE) { QualType DestTy = DCE->getTypeAsWritten(); if (DCE->isAlwaysNull()) return EmitDynamicCastToNull(*this, DestTy); QualType SrcTy = DCE->getSubExpr()->getType(); // C++ [expr.dynamic.cast]p4: // If the value of v is a null pointer value in the pointer case, the result // is the null pointer value of type T. bool ShouldNullCheckSrcValue = SrcTy->isPointerType(); llvm::BasicBlock *CastNull = 0; llvm::BasicBlock *CastNotNull = 0; llvm::BasicBlock *CastEnd = createBasicBlock("dynamic_cast.end"); if (ShouldNullCheckSrcValue) { CastNull = createBasicBlock("dynamic_cast.null"); CastNotNull = createBasicBlock("dynamic_cast.notnull"); llvm::Value *IsNull = Builder.CreateIsNull(Value); Builder.CreateCondBr(IsNull, CastNull, CastNotNull); EmitBlock(CastNotNull); } Value = EmitDynamicCastCall(*this, Value, SrcTy, DestTy, CastEnd); if (ShouldNullCheckSrcValue) { EmitBranch(CastEnd); EmitBlock(CastNull); EmitBranch(CastEnd); } EmitBlock(CastEnd); if (ShouldNullCheckSrcValue) { llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2); PHI->addIncoming(Value, CastNotNull); PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()), CastNull); Value = PHI; } return Value; } void CodeGenFunction::EmitLambdaExpr(const LambdaExpr *E, AggValueSlot Slot) { RunCleanupsScope Scope(*this); LValue SlotLV = MakeAddrLValue(Slot.getAddr(), E->getType(), Slot.getAlignment()); CXXRecordDecl::field_iterator CurField = E->getLambdaClass()->field_begin(); for (LambdaExpr::capture_init_iterator i = E->capture_init_begin(), e = E->capture_init_end(); i != e; ++i, ++CurField) { // Emit initialization LValue LV = EmitLValueForFieldInitialization(SlotLV, *CurField); ArrayRef ArrayIndexes; if (CurField->getType()->isArrayType()) ArrayIndexes = E->getCaptureInitIndexVars(i); EmitInitializerForField(*CurField, LV, *i, ArrayIndexes); } } @