CGExprScalar.cpp revision 6a03e345bb3c971750920e34a0d7d1ea7c9eceb7
1//===--- CGExprScalar.cpp - Emit LLVM Code for Scalar Exprs ---------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 10// This contains code to emit Expr nodes with scalar LLVM types as LLVM code. 11// 12//===----------------------------------------------------------------------===// 13 14#include "CodeGenFunction.h" 15#include "CGObjCRuntime.h" 16#include "CodeGenModule.h" 17#include "clang/AST/ASTContext.h" 18#include "clang/AST/DeclObjC.h" 19#include "clang/AST/RecordLayout.h" 20#include "clang/AST/StmtVisitor.h" 21#include "clang/Basic/TargetInfo.h" 22#include "llvm/Constants.h" 23#include "llvm/Function.h" 24#include "llvm/GlobalVariable.h" 25#include "llvm/Intrinsics.h" 26#include "llvm/Module.h" 27#include "llvm/Support/CFG.h" 28#include "llvm/Target/TargetData.h" 29#include <cstdarg> 30 31using namespace clang; 32using namespace CodeGen; 33using llvm::Value; 34 35//===----------------------------------------------------------------------===// 36// Scalar Expression Emitter 37//===----------------------------------------------------------------------===// 38 39struct BinOpInfo { 40 Value *LHS; 41 Value *RHS; 42 QualType Ty; // Computation Type. 43 const BinaryOperator *E; 44}; 45 46namespace { 47class ScalarExprEmitter 48 : public StmtVisitor<ScalarExprEmitter, Value*> { 49 CodeGenFunction &CGF; 50 CGBuilderTy &Builder; 51 bool IgnoreResultAssign; 52 llvm::LLVMContext &VMContext; 53public: 54 55 ScalarExprEmitter(CodeGenFunction &cgf, bool ira=false) 56 : CGF(cgf), Builder(CGF.Builder), IgnoreResultAssign(ira), 57 VMContext(cgf.getLLVMContext()) { 58 } 59 60 //===--------------------------------------------------------------------===// 61 // Utilities 62 //===--------------------------------------------------------------------===// 63 64 bool TestAndClearIgnoreResultAssign() { 65 bool I = IgnoreResultAssign; 66 IgnoreResultAssign = false; 67 return I; 68 } 69 70 const llvm::Type *ConvertType(QualType T) { return CGF.ConvertType(T); } 71 LValue EmitLValue(const Expr *E) { return CGF.EmitLValue(E); } 72 LValue EmitCheckedLValue(const Expr *E) { return CGF.EmitCheckedLValue(E); } 73 74 Value *EmitLoadOfLValue(LValue LV, QualType T) { 75 return CGF.EmitLoadOfLValue(LV, T).getScalarVal(); 76 } 77 78 /// EmitLoadOfLValue - Given an expression with complex type that represents a 79 /// value l-value, this method emits the address of the l-value, then loads 80 /// and returns the result. 81 Value *EmitLoadOfLValue(const Expr *E) { 82 return EmitLoadOfLValue(EmitCheckedLValue(E), E->getType()); 83 } 84 85 /// EmitConversionToBool - Convert the specified expression value to a 86 /// boolean (i1) truth value. This is equivalent to "Val != 0". 87 Value *EmitConversionToBool(Value *Src, QualType DstTy); 88 89 /// EmitScalarConversion - Emit a conversion from the specified type to the 90 /// specified destination type, both of which are LLVM scalar types. 91 Value *EmitScalarConversion(Value *Src, QualType SrcTy, QualType DstTy); 92 93 /// EmitComplexToScalarConversion - Emit a conversion from the specified 94 /// complex type to the specified destination type, where the destination type 95 /// is an LLVM scalar type. 96 Value *EmitComplexToScalarConversion(CodeGenFunction::ComplexPairTy Src, 97 QualType SrcTy, QualType DstTy); 98 99 //===--------------------------------------------------------------------===// 100 // Visitor Methods 101 //===--------------------------------------------------------------------===// 102 103 Value *VisitStmt(Stmt *S) { 104 S->dump(CGF.getContext().getSourceManager()); 105 assert(0 && "Stmt can't have complex result type!"); 106 return 0; 107 } 108 Value *VisitExpr(Expr *S); 109 110 Value *VisitParenExpr(ParenExpr *PE) { return Visit(PE->getSubExpr()); } 111 112 // Leaves. 113 Value *VisitIntegerLiteral(const IntegerLiteral *E) { 114 return llvm::ConstantInt::get(VMContext, E->getValue()); 115 } 116 Value *VisitFloatingLiteral(const FloatingLiteral *E) { 117 return llvm::ConstantFP::get(VMContext, E->getValue()); 118 } 119 Value *VisitCharacterLiteral(const CharacterLiteral *E) { 120 return llvm::ConstantInt::get(ConvertType(E->getType()), E->getValue()); 121 } 122 Value *VisitCXXBoolLiteralExpr(const CXXBoolLiteralExpr *E) { 123 return llvm::ConstantInt::get(ConvertType(E->getType()), E->getValue()); 124 } 125 Value *VisitCXXZeroInitValueExpr(const CXXZeroInitValueExpr *E) { 126 return llvm::Constant::getNullValue(ConvertType(E->getType())); 127 } 128 Value *VisitGNUNullExpr(const GNUNullExpr *E) { 129 return llvm::Constant::getNullValue(ConvertType(E->getType())); 130 } 131 Value *VisitTypesCompatibleExpr(const TypesCompatibleExpr *E) { 132 return llvm::ConstantInt::get(ConvertType(E->getType()), 133 CGF.getContext().typesAreCompatible( 134 E->getArgType1(), E->getArgType2())); 135 } 136 Value *VisitSizeOfAlignOfExpr(const SizeOfAlignOfExpr *E); 137 Value *VisitAddrLabelExpr(const AddrLabelExpr *E) { 138 llvm::Value *V = CGF.GetAddrOfLabel(E->getLabel()); 139 return Builder.CreateBitCast(V, ConvertType(E->getType())); 140 } 141 142 // l-values. 143 Value *VisitDeclRefExpr(DeclRefExpr *E) { 144 Expr::EvalResult Result; 145 if (E->Evaluate(Result, CGF.getContext()) && Result.Val.isInt()) { 146 assert(!Result.HasSideEffects && "Constant declref with side-effect?!"); 147 return llvm::ConstantInt::get(VMContext, Result.Val.getInt()); 148 } 149 return EmitLoadOfLValue(E); 150 } 151 Value *VisitObjCSelectorExpr(ObjCSelectorExpr *E) { 152 return CGF.EmitObjCSelectorExpr(E); 153 } 154 Value *VisitObjCProtocolExpr(ObjCProtocolExpr *E) { 155 return CGF.EmitObjCProtocolExpr(E); 156 } 157 Value *VisitObjCIvarRefExpr(ObjCIvarRefExpr *E) { 158 return EmitLoadOfLValue(E); 159 } 160 Value *VisitObjCPropertyRefExpr(ObjCPropertyRefExpr *E) { 161 return EmitLoadOfLValue(E); 162 } 163 Value *VisitObjCImplicitSetterGetterRefExpr( 164 ObjCImplicitSetterGetterRefExpr *E) { 165 return EmitLoadOfLValue(E); 166 } 167 Value *VisitObjCMessageExpr(ObjCMessageExpr *E) { 168 return CGF.EmitObjCMessageExpr(E).getScalarVal(); 169 } 170 171 Value *VisitObjCIsaExpr(ObjCIsaExpr *E) { 172 LValue LV = CGF.EmitObjCIsaExpr(E); 173 Value *V = CGF.EmitLoadOfLValue(LV, E->getType()).getScalarVal(); 174 return V; 175 } 176 177 Value *VisitArraySubscriptExpr(ArraySubscriptExpr *E); 178 Value *VisitShuffleVectorExpr(ShuffleVectorExpr *E); 179 Value *VisitMemberExpr(MemberExpr *E); 180 Value *VisitExtVectorElementExpr(Expr *E) { return EmitLoadOfLValue(E); } 181 Value *VisitCompoundLiteralExpr(CompoundLiteralExpr *E) { 182 return EmitLoadOfLValue(E); 183 } 184 185 Value *VisitInitListExpr(InitListExpr *E); 186 187 Value *VisitImplicitValueInitExpr(const ImplicitValueInitExpr *E) { 188 return llvm::Constant::getNullValue(ConvertType(E->getType())); 189 } 190 Value *VisitCastExpr(CastExpr *E) { 191 // Make sure to evaluate VLA bounds now so that we have them for later. 192 if (E->getType()->isVariablyModifiedType()) 193 CGF.EmitVLASize(E->getType()); 194 195 return EmitCastExpr(E); 196 } 197 Value *EmitCastExpr(CastExpr *E); 198 199 Value *VisitCallExpr(const CallExpr *E) { 200 if (E->getCallReturnType()->isReferenceType()) 201 return EmitLoadOfLValue(E); 202 203 return CGF.EmitCallExpr(E).getScalarVal(); 204 } 205 206 Value *VisitStmtExpr(const StmtExpr *E); 207 208 Value *VisitBlockDeclRefExpr(const BlockDeclRefExpr *E); 209 210 // Unary Operators. 211 Value *VisitPrePostIncDec(const UnaryOperator *E, bool isInc, bool isPre) { 212 LValue LV = EmitLValue(E->getSubExpr()); 213 return CGF.EmitScalarPrePostIncDec(E, LV, isInc, isPre); 214 } 215 Value *VisitUnaryPostDec(const UnaryOperator *E) { 216 return VisitPrePostIncDec(E, false, false); 217 } 218 Value *VisitUnaryPostInc(const UnaryOperator *E) { 219 return VisitPrePostIncDec(E, true, false); 220 } 221 Value *VisitUnaryPreDec(const UnaryOperator *E) { 222 return VisitPrePostIncDec(E, false, true); 223 } 224 Value *VisitUnaryPreInc(const UnaryOperator *E) { 225 return VisitPrePostIncDec(E, true, true); 226 } 227 Value *VisitUnaryAddrOf(const UnaryOperator *E) { 228 return EmitLValue(E->getSubExpr()).getAddress(); 229 } 230 Value *VisitUnaryDeref(const Expr *E) { return EmitLoadOfLValue(E); } 231 Value *VisitUnaryPlus(const UnaryOperator *E) { 232 // This differs from gcc, though, most likely due to a bug in gcc. 233 TestAndClearIgnoreResultAssign(); 234 return Visit(E->getSubExpr()); 235 } 236 Value *VisitUnaryMinus (const UnaryOperator *E); 237 Value *VisitUnaryNot (const UnaryOperator *E); 238 Value *VisitUnaryLNot (const UnaryOperator *E); 239 Value *VisitUnaryReal (const UnaryOperator *E); 240 Value *VisitUnaryImag (const UnaryOperator *E); 241 Value *VisitUnaryExtension(const UnaryOperator *E) { 242 return Visit(E->getSubExpr()); 243 } 244 Value *VisitUnaryOffsetOf(const UnaryOperator *E); 245 246 // C++ 247 Value *VisitCXXDefaultArgExpr(CXXDefaultArgExpr *DAE) { 248 return Visit(DAE->getExpr()); 249 } 250 Value *VisitCXXThisExpr(CXXThisExpr *TE) { 251 return CGF.LoadCXXThis(); 252 } 253 254 Value *VisitCXXExprWithTemporaries(CXXExprWithTemporaries *E) { 255 return CGF.EmitCXXExprWithTemporaries(E).getScalarVal(); 256 } 257 Value *VisitCXXNewExpr(const CXXNewExpr *E) { 258 return CGF.EmitCXXNewExpr(E); 259 } 260 Value *VisitCXXDeleteExpr(const CXXDeleteExpr *E) { 261 CGF.EmitCXXDeleteExpr(E); 262 return 0; 263 } 264 Value *VisitUnaryTypeTraitExpr(const UnaryTypeTraitExpr *E) { 265 return llvm::ConstantInt::get(Builder.getInt1Ty(), 266 E->EvaluateTrait(CGF.getContext())); 267 } 268 269 Value *VisitCXXPseudoDestructorExpr(const CXXPseudoDestructorExpr *E) { 270 // C++ [expr.pseudo]p1: 271 // The result shall only be used as the operand for the function call 272 // operator (), and the result of such a call has type void. The only 273 // effect is the evaluation of the postfix-expression before the dot or 274 // arrow. 275 CGF.EmitScalarExpr(E->getBase()); 276 return 0; 277 } 278 279 Value *VisitCXXNullPtrLiteralExpr(const CXXNullPtrLiteralExpr *E) { 280 return llvm::Constant::getNullValue(ConvertType(E->getType())); 281 } 282 283 Value *VisitCXXThrowExpr(const CXXThrowExpr *E) { 284 CGF.EmitCXXThrowExpr(E); 285 return 0; 286 } 287 288 // Binary Operators. 289 Value *EmitMul(const BinOpInfo &Ops) { 290 if (CGF.getContext().getLangOptions().OverflowChecking 291 && Ops.Ty->isSignedIntegerType()) 292 return EmitOverflowCheckedBinOp(Ops); 293 if (Ops.LHS->getType()->isFPOrFPVectorTy()) 294 return Builder.CreateFMul(Ops.LHS, Ops.RHS, "mul"); 295 return Builder.CreateMul(Ops.LHS, Ops.RHS, "mul"); 296 } 297 /// Create a binary op that checks for overflow. 298 /// Currently only supports +, - and *. 299 Value *EmitOverflowCheckedBinOp(const BinOpInfo &Ops); 300 Value *EmitDiv(const BinOpInfo &Ops); 301 Value *EmitRem(const BinOpInfo &Ops); 302 Value *EmitAdd(const BinOpInfo &Ops); 303 Value *EmitSub(const BinOpInfo &Ops); 304 Value *EmitShl(const BinOpInfo &Ops); 305 Value *EmitShr(const BinOpInfo &Ops); 306 Value *EmitAnd(const BinOpInfo &Ops) { 307 return Builder.CreateAnd(Ops.LHS, Ops.RHS, "and"); 308 } 309 Value *EmitXor(const BinOpInfo &Ops) { 310 return Builder.CreateXor(Ops.LHS, Ops.RHS, "xor"); 311 } 312 Value *EmitOr (const BinOpInfo &Ops) { 313 return Builder.CreateOr(Ops.LHS, Ops.RHS, "or"); 314 } 315 316 BinOpInfo EmitBinOps(const BinaryOperator *E); 317 LValue EmitCompoundAssignLValue(const CompoundAssignOperator *E, 318 Value *(ScalarExprEmitter::*F)(const BinOpInfo &), 319 Value *&BitFieldResult); 320 321 Value *EmitCompoundAssign(const CompoundAssignOperator *E, 322 Value *(ScalarExprEmitter::*F)(const BinOpInfo &)); 323 324 // Binary operators and binary compound assignment operators. 325#define HANDLEBINOP(OP) \ 326 Value *VisitBin ## OP(const BinaryOperator *E) { \ 327 return Emit ## OP(EmitBinOps(E)); \ 328 } \ 329 Value *VisitBin ## OP ## Assign(const CompoundAssignOperator *E) { \ 330 return EmitCompoundAssign(E, &ScalarExprEmitter::Emit ## OP); \ 331 } 332 HANDLEBINOP(Mul) 333 HANDLEBINOP(Div) 334 HANDLEBINOP(Rem) 335 HANDLEBINOP(Add) 336 HANDLEBINOP(Sub) 337 HANDLEBINOP(Shl) 338 HANDLEBINOP(Shr) 339 HANDLEBINOP(And) 340 HANDLEBINOP(Xor) 341 HANDLEBINOP(Or) 342#undef HANDLEBINOP 343 344 // Comparisons. 345 Value *EmitCompare(const BinaryOperator *E, unsigned UICmpOpc, 346 unsigned SICmpOpc, unsigned FCmpOpc); 347#define VISITCOMP(CODE, UI, SI, FP) \ 348 Value *VisitBin##CODE(const BinaryOperator *E) { \ 349 return EmitCompare(E, llvm::ICmpInst::UI, llvm::ICmpInst::SI, \ 350 llvm::FCmpInst::FP); } 351 VISITCOMP(LT, ICMP_ULT, ICMP_SLT, FCMP_OLT) 352 VISITCOMP(GT, ICMP_UGT, ICMP_SGT, FCMP_OGT) 353 VISITCOMP(LE, ICMP_ULE, ICMP_SLE, FCMP_OLE) 354 VISITCOMP(GE, ICMP_UGE, ICMP_SGE, FCMP_OGE) 355 VISITCOMP(EQ, ICMP_EQ , ICMP_EQ , FCMP_OEQ) 356 VISITCOMP(NE, ICMP_NE , ICMP_NE , FCMP_UNE) 357#undef VISITCOMP 358 359 Value *VisitBinAssign (const BinaryOperator *E); 360 361 Value *VisitBinLAnd (const BinaryOperator *E); 362 Value *VisitBinLOr (const BinaryOperator *E); 363 Value *VisitBinComma (const BinaryOperator *E); 364 365 Value *VisitBinPtrMemD(const Expr *E) { return EmitLoadOfLValue(E); } 366 Value *VisitBinPtrMemI(const Expr *E) { return EmitLoadOfLValue(E); } 367 368 // Other Operators. 369 Value *VisitBlockExpr(const BlockExpr *BE); 370 Value *VisitConditionalOperator(const ConditionalOperator *CO); 371 Value *VisitChooseExpr(ChooseExpr *CE); 372 Value *VisitVAArgExpr(VAArgExpr *VE); 373 Value *VisitObjCStringLiteral(const ObjCStringLiteral *E) { 374 return CGF.EmitObjCStringLiteral(E); 375 } 376}; 377} // end anonymous namespace. 378 379//===----------------------------------------------------------------------===// 380// Utilities 381//===----------------------------------------------------------------------===// 382 383/// EmitConversionToBool - Convert the specified expression value to a 384/// boolean (i1) truth value. This is equivalent to "Val != 0". 385Value *ScalarExprEmitter::EmitConversionToBool(Value *Src, QualType SrcType) { 386 assert(SrcType.isCanonical() && "EmitScalarConversion strips typedefs"); 387 388 if (SrcType->isRealFloatingType()) { 389 // Compare against 0.0 for fp scalars. 390 llvm::Value *Zero = llvm::Constant::getNullValue(Src->getType()); 391 return Builder.CreateFCmpUNE(Src, Zero, "tobool"); 392 } 393 394 if (SrcType->isMemberPointerType()) { 395 // Compare against -1. 396 llvm::Value *NegativeOne = llvm::Constant::getAllOnesValue(Src->getType()); 397 return Builder.CreateICmpNE(Src, NegativeOne, "tobool"); 398 } 399 400 assert((SrcType->isIntegerType() || isa<llvm::PointerType>(Src->getType())) && 401 "Unknown scalar type to convert"); 402 403 // Because of the type rules of C, we often end up computing a logical value, 404 // then zero extending it to int, then wanting it as a logical value again. 405 // Optimize this common case. 406 if (llvm::ZExtInst *ZI = dyn_cast<llvm::ZExtInst>(Src)) { 407 if (ZI->getOperand(0)->getType() == 408 llvm::Type::getInt1Ty(CGF.getLLVMContext())) { 409 Value *Result = ZI->getOperand(0); 410 // If there aren't any more uses, zap the instruction to save space. 411 // Note that there can be more uses, for example if this 412 // is the result of an assignment. 413 if (ZI->use_empty()) 414 ZI->eraseFromParent(); 415 return Result; 416 } 417 } 418 419 // Compare against an integer or pointer null. 420 llvm::Value *Zero = llvm::Constant::getNullValue(Src->getType()); 421 return Builder.CreateICmpNE(Src, Zero, "tobool"); 422} 423 424/// EmitScalarConversion - Emit a conversion from the specified type to the 425/// specified destination type, both of which are LLVM scalar types. 426Value *ScalarExprEmitter::EmitScalarConversion(Value *Src, QualType SrcType, 427 QualType DstType) { 428 SrcType = CGF.getContext().getCanonicalType(SrcType); 429 DstType = CGF.getContext().getCanonicalType(DstType); 430 if (SrcType == DstType) return Src; 431 432 if (DstType->isVoidType()) return 0; 433 434 llvm::LLVMContext &VMContext = CGF.getLLVMContext(); 435 436 // Handle conversions to bool first, they are special: comparisons against 0. 437 if (DstType->isBooleanType()) 438 return EmitConversionToBool(Src, SrcType); 439 440 const llvm::Type *DstTy = ConvertType(DstType); 441 442 // Ignore conversions like int -> uint. 443 if (Src->getType() == DstTy) 444 return Src; 445 446 // Handle pointer conversions next: pointers can only be converted to/from 447 // other pointers and integers. Check for pointer types in terms of LLVM, as 448 // some native types (like Obj-C id) may map to a pointer type. 449 if (isa<llvm::PointerType>(DstTy)) { 450 // The source value may be an integer, or a pointer. 451 if (isa<llvm::PointerType>(Src->getType())) 452 return Builder.CreateBitCast(Src, DstTy, "conv"); 453 454 assert(SrcType->isIntegerType() && "Not ptr->ptr or int->ptr conversion?"); 455 // First, convert to the correct width so that we control the kind of 456 // extension. 457 const llvm::Type *MiddleTy = 458 llvm::IntegerType::get(VMContext, CGF.LLVMPointerWidth); 459 bool InputSigned = SrcType->isSignedIntegerType(); 460 llvm::Value* IntResult = 461 Builder.CreateIntCast(Src, MiddleTy, InputSigned, "conv"); 462 // Then, cast to pointer. 463 return Builder.CreateIntToPtr(IntResult, DstTy, "conv"); 464 } 465 466 if (isa<llvm::PointerType>(Src->getType())) { 467 // Must be an ptr to int cast. 468 assert(isa<llvm::IntegerType>(DstTy) && "not ptr->int?"); 469 return Builder.CreatePtrToInt(Src, DstTy, "conv"); 470 } 471 472 // A scalar can be splatted to an extended vector of the same element type 473 if (DstType->isExtVectorType() && !SrcType->isVectorType()) { 474 // Cast the scalar to element type 475 QualType EltTy = DstType->getAs<ExtVectorType>()->getElementType(); 476 llvm::Value *Elt = EmitScalarConversion(Src, SrcType, EltTy); 477 478 // Insert the element in element zero of an undef vector 479 llvm::Value *UnV = llvm::UndefValue::get(DstTy); 480 llvm::Value *Idx = 481 llvm::ConstantInt::get(llvm::Type::getInt32Ty(VMContext), 0); 482 UnV = Builder.CreateInsertElement(UnV, Elt, Idx, "tmp"); 483 484 // Splat the element across to all elements 485 llvm::SmallVector<llvm::Constant*, 16> Args; 486 unsigned NumElements = cast<llvm::VectorType>(DstTy)->getNumElements(); 487 for (unsigned i = 0; i < NumElements; i++) 488 Args.push_back(llvm::ConstantInt::get( 489 llvm::Type::getInt32Ty(VMContext), 0)); 490 491 llvm::Constant *Mask = llvm::ConstantVector::get(&Args[0], NumElements); 492 llvm::Value *Yay = Builder.CreateShuffleVector(UnV, UnV, Mask, "splat"); 493 return Yay; 494 } 495 496 // Allow bitcast from vector to integer/fp of the same size. 497 if (isa<llvm::VectorType>(Src->getType()) || 498 isa<llvm::VectorType>(DstTy)) 499 return Builder.CreateBitCast(Src, DstTy, "conv"); 500 501 // Finally, we have the arithmetic types: real int/float. 502 if (isa<llvm::IntegerType>(Src->getType())) { 503 bool InputSigned = SrcType->isSignedIntegerType(); 504 if (isa<llvm::IntegerType>(DstTy)) 505 return Builder.CreateIntCast(Src, DstTy, InputSigned, "conv"); 506 else if (InputSigned) 507 return Builder.CreateSIToFP(Src, DstTy, "conv"); 508 else 509 return Builder.CreateUIToFP(Src, DstTy, "conv"); 510 } 511 512 assert(Src->getType()->isFloatingPointTy() && "Unknown real conversion"); 513 if (isa<llvm::IntegerType>(DstTy)) { 514 if (DstType->isSignedIntegerType()) 515 return Builder.CreateFPToSI(Src, DstTy, "conv"); 516 else 517 return Builder.CreateFPToUI(Src, DstTy, "conv"); 518 } 519 520 assert(DstTy->isFloatingPointTy() && "Unknown real conversion"); 521 if (DstTy->getTypeID() < Src->getType()->getTypeID()) 522 return Builder.CreateFPTrunc(Src, DstTy, "conv"); 523 else 524 return Builder.CreateFPExt(Src, DstTy, "conv"); 525} 526 527/// EmitComplexToScalarConversion - Emit a conversion from the specified complex 528/// type to the specified destination type, where the destination type is an 529/// LLVM scalar type. 530Value *ScalarExprEmitter:: 531EmitComplexToScalarConversion(CodeGenFunction::ComplexPairTy Src, 532 QualType SrcTy, QualType DstTy) { 533 // Get the source element type. 534 SrcTy = SrcTy->getAs<ComplexType>()->getElementType(); 535 536 // Handle conversions to bool first, they are special: comparisons against 0. 537 if (DstTy->isBooleanType()) { 538 // Complex != 0 -> (Real != 0) | (Imag != 0) 539 Src.first = EmitScalarConversion(Src.first, SrcTy, DstTy); 540 Src.second = EmitScalarConversion(Src.second, SrcTy, DstTy); 541 return Builder.CreateOr(Src.first, Src.second, "tobool"); 542 } 543 544 // C99 6.3.1.7p2: "When a value of complex type is converted to a real type, 545 // the imaginary part of the complex value is discarded and the value of the 546 // real part is converted according to the conversion rules for the 547 // corresponding real type. 548 return EmitScalarConversion(Src.first, SrcTy, DstTy); 549} 550 551 552//===----------------------------------------------------------------------===// 553// Visitor Methods 554//===----------------------------------------------------------------------===// 555 556Value *ScalarExprEmitter::VisitExpr(Expr *E) { 557 CGF.ErrorUnsupported(E, "scalar expression"); 558 if (E->getType()->isVoidType()) 559 return 0; 560 return llvm::UndefValue::get(CGF.ConvertType(E->getType())); 561} 562 563Value *ScalarExprEmitter::VisitShuffleVectorExpr(ShuffleVectorExpr *E) { 564 llvm::SmallVector<llvm::Constant*, 32> indices; 565 for (unsigned i = 2; i < E->getNumSubExprs(); i++) { 566 indices.push_back(cast<llvm::Constant>(CGF.EmitScalarExpr(E->getExpr(i)))); 567 } 568 Value* V1 = CGF.EmitScalarExpr(E->getExpr(0)); 569 Value* V2 = CGF.EmitScalarExpr(E->getExpr(1)); 570 Value* SV = llvm::ConstantVector::get(indices.begin(), indices.size()); 571 return Builder.CreateShuffleVector(V1, V2, SV, "shuffle"); 572} 573Value *ScalarExprEmitter::VisitMemberExpr(MemberExpr *E) { 574 Expr::EvalResult Result; 575 if (E->Evaluate(Result, CGF.getContext()) && Result.Val.isInt()) { 576 if (E->isArrow()) 577 CGF.EmitScalarExpr(E->getBase()); 578 else 579 EmitLValue(E->getBase()); 580 return llvm::ConstantInt::get(VMContext, Result.Val.getInt()); 581 } 582 return EmitLoadOfLValue(E); 583} 584 585Value *ScalarExprEmitter::VisitArraySubscriptExpr(ArraySubscriptExpr *E) { 586 TestAndClearIgnoreResultAssign(); 587 588 // Emit subscript expressions in rvalue context's. For most cases, this just 589 // loads the lvalue formed by the subscript expr. However, we have to be 590 // careful, because the base of a vector subscript is occasionally an rvalue, 591 // so we can't get it as an lvalue. 592 if (!E->getBase()->getType()->isVectorType()) 593 return EmitLoadOfLValue(E); 594 595 // Handle the vector case. The base must be a vector, the index must be an 596 // integer value. 597 Value *Base = Visit(E->getBase()); 598 Value *Idx = Visit(E->getIdx()); 599 bool IdxSigned = E->getIdx()->getType()->isSignedIntegerType(); 600 Idx = Builder.CreateIntCast(Idx, 601 llvm::Type::getInt32Ty(CGF.getLLVMContext()), 602 IdxSigned, 603 "vecidxcast"); 604 return Builder.CreateExtractElement(Base, Idx, "vecext"); 605} 606 607static llvm::Constant *getMaskElt(llvm::ShuffleVectorInst *SVI, unsigned Idx, 608 unsigned Off, const llvm::Type *I32Ty) { 609 int MV = SVI->getMaskValue(Idx); 610 if (MV == -1) 611 return llvm::UndefValue::get(I32Ty); 612 return llvm::ConstantInt::get(I32Ty, Off+MV); 613} 614 615Value *ScalarExprEmitter::VisitInitListExpr(InitListExpr *E) { 616 bool Ignore = TestAndClearIgnoreResultAssign(); 617 (void)Ignore; 618 assert (Ignore == false && "init list ignored"); 619 unsigned NumInitElements = E->getNumInits(); 620 621 if (E->hadArrayRangeDesignator()) 622 CGF.ErrorUnsupported(E, "GNU array range designator extension"); 623 624 const llvm::VectorType *VType = 625 dyn_cast<llvm::VectorType>(ConvertType(E->getType())); 626 627 // We have a scalar in braces. Just use the first element. 628 if (!VType) 629 return Visit(E->getInit(0)); 630 631 unsigned ResElts = VType->getNumElements(); 632 const llvm::Type *I32Ty = llvm::Type::getInt32Ty(CGF.getLLVMContext()); 633 634 // Loop over initializers collecting the Value for each, and remembering 635 // whether the source was swizzle (ExtVectorElementExpr). This will allow 636 // us to fold the shuffle for the swizzle into the shuffle for the vector 637 // initializer, since LLVM optimizers generally do not want to touch 638 // shuffles. 639 unsigned CurIdx = 0; 640 bool VIsUndefShuffle = false; 641 llvm::Value *V = llvm::UndefValue::get(VType); 642 for (unsigned i = 0; i != NumInitElements; ++i) { 643 Expr *IE = E->getInit(i); 644 Value *Init = Visit(IE); 645 llvm::SmallVector<llvm::Constant*, 16> Args; 646 647 const llvm::VectorType *VVT = dyn_cast<llvm::VectorType>(Init->getType()); 648 649 // Handle scalar elements. If the scalar initializer is actually one 650 // element of a different vector of the same width, use shuffle instead of 651 // extract+insert. 652 if (!VVT) { 653 if (isa<ExtVectorElementExpr>(IE)) { 654 llvm::ExtractElementInst *EI = cast<llvm::ExtractElementInst>(Init); 655 656 if (EI->getVectorOperandType()->getNumElements() == ResElts) { 657 llvm::ConstantInt *C = cast<llvm::ConstantInt>(EI->getIndexOperand()); 658 Value *LHS = 0, *RHS = 0; 659 if (CurIdx == 0) { 660 // insert into undef -> shuffle (src, undef) 661 Args.push_back(C); 662 for (unsigned j = 1; j != ResElts; ++j) 663 Args.push_back(llvm::UndefValue::get(I32Ty)); 664 665 LHS = EI->getVectorOperand(); 666 RHS = V; 667 VIsUndefShuffle = true; 668 } else if (VIsUndefShuffle) { 669 // insert into undefshuffle && size match -> shuffle (v, src) 670 llvm::ShuffleVectorInst *SVV = cast<llvm::ShuffleVectorInst>(V); 671 for (unsigned j = 0; j != CurIdx; ++j) 672 Args.push_back(getMaskElt(SVV, j, 0, I32Ty)); 673 Args.push_back(llvm::ConstantInt::get(I32Ty, 674 ResElts + C->getZExtValue())); 675 for (unsigned j = CurIdx + 1; j != ResElts; ++j) 676 Args.push_back(llvm::UndefValue::get(I32Ty)); 677 678 LHS = cast<llvm::ShuffleVectorInst>(V)->getOperand(0); 679 RHS = EI->getVectorOperand(); 680 VIsUndefShuffle = false; 681 } 682 if (!Args.empty()) { 683 llvm::Constant *Mask = llvm::ConstantVector::get(&Args[0], ResElts); 684 V = Builder.CreateShuffleVector(LHS, RHS, Mask); 685 ++CurIdx; 686 continue; 687 } 688 } 689 } 690 Value *Idx = llvm::ConstantInt::get(I32Ty, CurIdx); 691 V = Builder.CreateInsertElement(V, Init, Idx, "vecinit"); 692 VIsUndefShuffle = false; 693 ++CurIdx; 694 continue; 695 } 696 697 unsigned InitElts = VVT->getNumElements(); 698 699 // If the initializer is an ExtVecEltExpr (a swizzle), and the swizzle's 700 // input is the same width as the vector being constructed, generate an 701 // optimized shuffle of the swizzle input into the result. 702 unsigned Offset = (CurIdx == 0) ? 0 : ResElts; 703 if (isa<ExtVectorElementExpr>(IE)) { 704 llvm::ShuffleVectorInst *SVI = cast<llvm::ShuffleVectorInst>(Init); 705 Value *SVOp = SVI->getOperand(0); 706 const llvm::VectorType *OpTy = cast<llvm::VectorType>(SVOp->getType()); 707 708 if (OpTy->getNumElements() == ResElts) { 709 for (unsigned j = 0; j != CurIdx; ++j) { 710 // If the current vector initializer is a shuffle with undef, merge 711 // this shuffle directly into it. 712 if (VIsUndefShuffle) { 713 Args.push_back(getMaskElt(cast<llvm::ShuffleVectorInst>(V), j, 0, 714 I32Ty)); 715 } else { 716 Args.push_back(llvm::ConstantInt::get(I32Ty, j)); 717 } 718 } 719 for (unsigned j = 0, je = InitElts; j != je; ++j) 720 Args.push_back(getMaskElt(SVI, j, Offset, I32Ty)); 721 for (unsigned j = CurIdx + InitElts; j != ResElts; ++j) 722 Args.push_back(llvm::UndefValue::get(I32Ty)); 723 724 if (VIsUndefShuffle) 725 V = cast<llvm::ShuffleVectorInst>(V)->getOperand(0); 726 727 Init = SVOp; 728 } 729 } 730 731 // Extend init to result vector length, and then shuffle its contribution 732 // to the vector initializer into V. 733 if (Args.empty()) { 734 for (unsigned j = 0; j != InitElts; ++j) 735 Args.push_back(llvm::ConstantInt::get(I32Ty, j)); 736 for (unsigned j = InitElts; j != ResElts; ++j) 737 Args.push_back(llvm::UndefValue::get(I32Ty)); 738 llvm::Constant *Mask = llvm::ConstantVector::get(&Args[0], ResElts); 739 Init = Builder.CreateShuffleVector(Init, llvm::UndefValue::get(VVT), 740 Mask, "vext"); 741 742 Args.clear(); 743 for (unsigned j = 0; j != CurIdx; ++j) 744 Args.push_back(llvm::ConstantInt::get(I32Ty, j)); 745 for (unsigned j = 0; j != InitElts; ++j) 746 Args.push_back(llvm::ConstantInt::get(I32Ty, j+Offset)); 747 for (unsigned j = CurIdx + InitElts; j != ResElts; ++j) 748 Args.push_back(llvm::UndefValue::get(I32Ty)); 749 } 750 751 // If V is undef, make sure it ends up on the RHS of the shuffle to aid 752 // merging subsequent shuffles into this one. 753 if (CurIdx == 0) 754 std::swap(V, Init); 755 llvm::Constant *Mask = llvm::ConstantVector::get(&Args[0], ResElts); 756 V = Builder.CreateShuffleVector(V, Init, Mask, "vecinit"); 757 VIsUndefShuffle = isa<llvm::UndefValue>(Init); 758 CurIdx += InitElts; 759 } 760 761 // FIXME: evaluate codegen vs. shuffling against constant null vector. 762 // Emit remaining default initializers. 763 const llvm::Type *EltTy = VType->getElementType(); 764 765 // Emit remaining default initializers 766 for (/* Do not initialize i*/; CurIdx < ResElts; ++CurIdx) { 767 Value *Idx = llvm::ConstantInt::get(I32Ty, CurIdx); 768 llvm::Value *Init = llvm::Constant::getNullValue(EltTy); 769 V = Builder.CreateInsertElement(V, Init, Idx, "vecinit"); 770 } 771 return V; 772} 773 774static bool ShouldNullCheckClassCastValue(const CastExpr *CE) { 775 const Expr *E = CE->getSubExpr(); 776 777 if (CE->getCastKind() == CastExpr::CK_UncheckedDerivedToBase) 778 return false; 779 780 if (isa<CXXThisExpr>(E)) { 781 // We always assume that 'this' is never null. 782 return false; 783 } 784 785 if (const ImplicitCastExpr *ICE = dyn_cast<ImplicitCastExpr>(CE)) { 786 // And that lvalue casts are never null. 787 if (ICE->isLvalueCast()) 788 return false; 789 } 790 791 return true; 792} 793 794// VisitCastExpr - Emit code for an explicit or implicit cast. Implicit casts 795// have to handle a more broad range of conversions than explicit casts, as they 796// handle things like function to ptr-to-function decay etc. 797Value *ScalarExprEmitter::EmitCastExpr(CastExpr *CE) { 798 Expr *E = CE->getSubExpr(); 799 QualType DestTy = CE->getType(); 800 CastExpr::CastKind Kind = CE->getCastKind(); 801 802 if (!DestTy->isVoidType()) 803 TestAndClearIgnoreResultAssign(); 804 805 // Since almost all cast kinds apply to scalars, this switch doesn't have 806 // a default case, so the compiler will warn on a missing case. The cases 807 // are in the same order as in the CastKind enum. 808 switch (Kind) { 809 case CastExpr::CK_Unknown: 810 // FIXME: All casts should have a known kind! 811 //assert(0 && "Unknown cast kind!"); 812 break; 813 814 case CastExpr::CK_AnyPointerToObjCPointerCast: 815 case CastExpr::CK_AnyPointerToBlockPointerCast: 816 case CastExpr::CK_BitCast: { 817 Value *Src = Visit(const_cast<Expr*>(E)); 818 return Builder.CreateBitCast(Src, ConvertType(DestTy)); 819 } 820 case CastExpr::CK_NoOp: 821 case CastExpr::CK_UserDefinedConversion: 822 return Visit(const_cast<Expr*>(E)); 823 824 case CastExpr::CK_BaseToDerived: { 825 const CXXRecordDecl *BaseClassDecl = 826 E->getType()->getCXXRecordDeclForPointerType(); 827 const CXXRecordDecl *DerivedClassDecl = 828 DestTy->getCXXRecordDeclForPointerType(); 829 830 Value *Src = Visit(const_cast<Expr*>(E)); 831 832 bool NullCheckValue = ShouldNullCheckClassCastValue(CE); 833 return CGF.GetAddressOfDerivedClass(Src, BaseClassDecl, DerivedClassDecl, 834 NullCheckValue); 835 } 836 case CastExpr::CK_UncheckedDerivedToBase: 837 case CastExpr::CK_DerivedToBase: { 838 const RecordType *DerivedClassTy = 839 E->getType()->getAs<PointerType>()->getPointeeType()->getAs<RecordType>(); 840 CXXRecordDecl *DerivedClassDecl = 841 cast<CXXRecordDecl>(DerivedClassTy->getDecl()); 842 843 const RecordType *BaseClassTy = 844 DestTy->getAs<PointerType>()->getPointeeType()->getAs<RecordType>(); 845 CXXRecordDecl *BaseClassDecl = cast<CXXRecordDecl>(BaseClassTy->getDecl()); 846 847 Value *Src = Visit(const_cast<Expr*>(E)); 848 849 bool NullCheckValue = ShouldNullCheckClassCastValue(CE); 850 return CGF.GetAddressOfBaseClass(Src, DerivedClassDecl, BaseClassDecl, 851 NullCheckValue); 852 } 853 case CastExpr::CK_Dynamic: { 854 Value *V = Visit(const_cast<Expr*>(E)); 855 const CXXDynamicCastExpr *DCE = cast<CXXDynamicCastExpr>(CE); 856 return CGF.EmitDynamicCast(V, DCE); 857 } 858 case CastExpr::CK_ToUnion: 859 assert(0 && "Should be unreachable!"); 860 break; 861 862 case CastExpr::CK_ArrayToPointerDecay: { 863 assert(E->getType()->isArrayType() && 864 "Array to pointer decay must have array source type!"); 865 866 Value *V = EmitLValue(E).getAddress(); // Bitfields can't be arrays. 867 868 // Note that VLA pointers are always decayed, so we don't need to do 869 // anything here. 870 if (!E->getType()->isVariableArrayType()) { 871 assert(isa<llvm::PointerType>(V->getType()) && "Expected pointer"); 872 assert(isa<llvm::ArrayType>(cast<llvm::PointerType>(V->getType()) 873 ->getElementType()) && 874 "Expected pointer to array"); 875 V = Builder.CreateStructGEP(V, 0, "arraydecay"); 876 } 877 878 return V; 879 } 880 case CastExpr::CK_FunctionToPointerDecay: 881 return EmitLValue(E).getAddress(); 882 883 case CastExpr::CK_NullToMemberPointer: 884 return CGF.CGM.EmitNullConstant(DestTy); 885 886 case CastExpr::CK_BaseToDerivedMemberPointer: 887 case CastExpr::CK_DerivedToBaseMemberPointer: { 888 Value *Src = Visit(E); 889 890 // See if we need to adjust the pointer. 891 const CXXRecordDecl *BaseDecl = 892 cast<CXXRecordDecl>(E->getType()->getAs<MemberPointerType>()-> 893 getClass()->getAs<RecordType>()->getDecl()); 894 const CXXRecordDecl *DerivedDecl = 895 cast<CXXRecordDecl>(CE->getType()->getAs<MemberPointerType>()-> 896 getClass()->getAs<RecordType>()->getDecl()); 897 if (CE->getCastKind() == CastExpr::CK_DerivedToBaseMemberPointer) 898 std::swap(DerivedDecl, BaseDecl); 899 900 if (llvm::Constant *Adj = 901 CGF.CGM.GetNonVirtualBaseClassOffset(DerivedDecl, BaseDecl)) { 902 if (CE->getCastKind() == CastExpr::CK_DerivedToBaseMemberPointer) 903 Src = Builder.CreateSub(Src, Adj, "adj"); 904 else 905 Src = Builder.CreateAdd(Src, Adj, "adj"); 906 } 907 return Src; 908 } 909 910 case CastExpr::CK_ConstructorConversion: 911 assert(0 && "Should be unreachable!"); 912 break; 913 914 case CastExpr::CK_IntegralToPointer: { 915 Value *Src = Visit(const_cast<Expr*>(E)); 916 917 // First, convert to the correct width so that we control the kind of 918 // extension. 919 const llvm::Type *MiddleTy = 920 llvm::IntegerType::get(VMContext, CGF.LLVMPointerWidth); 921 bool InputSigned = E->getType()->isSignedIntegerType(); 922 llvm::Value* IntResult = 923 Builder.CreateIntCast(Src, MiddleTy, InputSigned, "conv"); 924 925 return Builder.CreateIntToPtr(IntResult, ConvertType(DestTy)); 926 } 927 case CastExpr::CK_PointerToIntegral: { 928 Value *Src = Visit(const_cast<Expr*>(E)); 929 return Builder.CreatePtrToInt(Src, ConvertType(DestTy)); 930 } 931 case CastExpr::CK_ToVoid: { 932 CGF.EmitAnyExpr(E, 0, false, true); 933 return 0; 934 } 935 case CastExpr::CK_VectorSplat: { 936 const llvm::Type *DstTy = ConvertType(DestTy); 937 Value *Elt = Visit(const_cast<Expr*>(E)); 938 939 // Insert the element in element zero of an undef vector 940 llvm::Value *UnV = llvm::UndefValue::get(DstTy); 941 llvm::Value *Idx = 942 llvm::ConstantInt::get(llvm::Type::getInt32Ty(VMContext), 0); 943 UnV = Builder.CreateInsertElement(UnV, Elt, Idx, "tmp"); 944 945 // Splat the element across to all elements 946 llvm::SmallVector<llvm::Constant*, 16> Args; 947 unsigned NumElements = cast<llvm::VectorType>(DstTy)->getNumElements(); 948 for (unsigned i = 0; i < NumElements; i++) 949 Args.push_back(llvm::ConstantInt::get( 950 llvm::Type::getInt32Ty(VMContext), 0)); 951 952 llvm::Constant *Mask = llvm::ConstantVector::get(&Args[0], NumElements); 953 llvm::Value *Yay = Builder.CreateShuffleVector(UnV, UnV, Mask, "splat"); 954 return Yay; 955 } 956 case CastExpr::CK_IntegralCast: 957 case CastExpr::CK_IntegralToFloating: 958 case CastExpr::CK_FloatingToIntegral: 959 case CastExpr::CK_FloatingCast: 960 return EmitScalarConversion(Visit(E), E->getType(), DestTy); 961 962 case CastExpr::CK_MemberPointerToBoolean: 963 return CGF.EvaluateExprAsBool(E); 964 } 965 966 // Handle cases where the source is an non-complex type. 967 968 if (!CGF.hasAggregateLLVMType(E->getType())) { 969 Value *Src = Visit(const_cast<Expr*>(E)); 970 971 // Use EmitScalarConversion to perform the conversion. 972 return EmitScalarConversion(Src, E->getType(), DestTy); 973 } 974 975 if (E->getType()->isAnyComplexType()) { 976 // Handle cases where the source is a complex type. 977 bool IgnoreImag = true; 978 bool IgnoreImagAssign = true; 979 bool IgnoreReal = IgnoreResultAssign; 980 bool IgnoreRealAssign = IgnoreResultAssign; 981 if (DestTy->isBooleanType()) 982 IgnoreImagAssign = IgnoreImag = false; 983 else if (DestTy->isVoidType()) { 984 IgnoreReal = IgnoreImag = false; 985 IgnoreRealAssign = IgnoreImagAssign = true; 986 } 987 CodeGenFunction::ComplexPairTy V 988 = CGF.EmitComplexExpr(E, IgnoreReal, IgnoreImag, IgnoreRealAssign, 989 IgnoreImagAssign); 990 return EmitComplexToScalarConversion(V, E->getType(), DestTy); 991 } 992 993 // Okay, this is a cast from an aggregate. It must be a cast to void. Just 994 // evaluate the result and return. 995 CGF.EmitAggExpr(E, 0, false, true); 996 return 0; 997} 998 999Value *ScalarExprEmitter::VisitStmtExpr(const StmtExpr *E) { 1000 return CGF.EmitCompoundStmt(*E->getSubStmt(), 1001 !E->getType()->isVoidType()).getScalarVal(); 1002} 1003 1004Value *ScalarExprEmitter::VisitBlockDeclRefExpr(const BlockDeclRefExpr *E) { 1005 llvm::Value *V = CGF.GetAddrOfBlockDecl(E); 1006 if (E->getType().isObjCGCWeak()) 1007 return CGF.CGM.getObjCRuntime().EmitObjCWeakRead(CGF, V); 1008 return Builder.CreateLoad(V, "tmp"); 1009} 1010 1011//===----------------------------------------------------------------------===// 1012// Unary Operators 1013//===----------------------------------------------------------------------===// 1014 1015Value *ScalarExprEmitter::VisitUnaryMinus(const UnaryOperator *E) { 1016 TestAndClearIgnoreResultAssign(); 1017 Value *Op = Visit(E->getSubExpr()); 1018 if (Op->getType()->isFPOrFPVectorTy()) 1019 return Builder.CreateFNeg(Op, "neg"); 1020 return Builder.CreateNeg(Op, "neg"); 1021} 1022 1023Value *ScalarExprEmitter::VisitUnaryNot(const UnaryOperator *E) { 1024 TestAndClearIgnoreResultAssign(); 1025 Value *Op = Visit(E->getSubExpr()); 1026 return Builder.CreateNot(Op, "neg"); 1027} 1028 1029Value *ScalarExprEmitter::VisitUnaryLNot(const UnaryOperator *E) { 1030 // Compare operand to zero. 1031 Value *BoolVal = CGF.EvaluateExprAsBool(E->getSubExpr()); 1032 1033 // Invert value. 1034 // TODO: Could dynamically modify easy computations here. For example, if 1035 // the operand is an icmp ne, turn into icmp eq. 1036 BoolVal = Builder.CreateNot(BoolVal, "lnot"); 1037 1038 // ZExt result to the expr type. 1039 return Builder.CreateZExt(BoolVal, ConvertType(E->getType()), "lnot.ext"); 1040} 1041 1042/// VisitSizeOfAlignOfExpr - Return the size or alignment of the type of 1043/// argument of the sizeof expression as an integer. 1044Value * 1045ScalarExprEmitter::VisitSizeOfAlignOfExpr(const SizeOfAlignOfExpr *E) { 1046 QualType TypeToSize = E->getTypeOfArgument(); 1047 if (E->isSizeOf()) { 1048 if (const VariableArrayType *VAT = 1049 CGF.getContext().getAsVariableArrayType(TypeToSize)) { 1050 if (E->isArgumentType()) { 1051 // sizeof(type) - make sure to emit the VLA size. 1052 CGF.EmitVLASize(TypeToSize); 1053 } else { 1054 // C99 6.5.3.4p2: If the argument is an expression of type 1055 // VLA, it is evaluated. 1056 CGF.EmitAnyExpr(E->getArgumentExpr()); 1057 } 1058 1059 return CGF.GetVLASize(VAT); 1060 } 1061 } 1062 1063 // If this isn't sizeof(vla), the result must be constant; use the constant 1064 // folding logic so we don't have to duplicate it here. 1065 Expr::EvalResult Result; 1066 E->Evaluate(Result, CGF.getContext()); 1067 return llvm::ConstantInt::get(VMContext, Result.Val.getInt()); 1068} 1069 1070Value *ScalarExprEmitter::VisitUnaryReal(const UnaryOperator *E) { 1071 Expr *Op = E->getSubExpr(); 1072 if (Op->getType()->isAnyComplexType()) 1073 return CGF.EmitComplexExpr(Op, false, true, false, true).first; 1074 return Visit(Op); 1075} 1076Value *ScalarExprEmitter::VisitUnaryImag(const UnaryOperator *E) { 1077 Expr *Op = E->getSubExpr(); 1078 if (Op->getType()->isAnyComplexType()) 1079 return CGF.EmitComplexExpr(Op, true, false, true, false).second; 1080 1081 // __imag on a scalar returns zero. Emit the subexpr to ensure side 1082 // effects are evaluated, but not the actual value. 1083 if (E->isLvalue(CGF.getContext()) == Expr::LV_Valid) 1084 CGF.EmitLValue(Op); 1085 else 1086 CGF.EmitScalarExpr(Op, true); 1087 return llvm::Constant::getNullValue(ConvertType(E->getType())); 1088} 1089 1090Value *ScalarExprEmitter::VisitUnaryOffsetOf(const UnaryOperator *E) { 1091 Value* ResultAsPtr = EmitLValue(E->getSubExpr()).getAddress(); 1092 const llvm::Type* ResultType = ConvertType(E->getType()); 1093 return Builder.CreatePtrToInt(ResultAsPtr, ResultType, "offsetof"); 1094} 1095 1096//===----------------------------------------------------------------------===// 1097// Binary Operators 1098//===----------------------------------------------------------------------===// 1099 1100BinOpInfo ScalarExprEmitter::EmitBinOps(const BinaryOperator *E) { 1101 TestAndClearIgnoreResultAssign(); 1102 BinOpInfo Result; 1103 Result.LHS = Visit(E->getLHS()); 1104 Result.RHS = Visit(E->getRHS()); 1105 Result.Ty = E->getType(); 1106 Result.E = E; 1107 return Result; 1108} 1109 1110LValue ScalarExprEmitter::EmitCompoundAssignLValue( 1111 const CompoundAssignOperator *E, 1112 Value *(ScalarExprEmitter::*Func)(const BinOpInfo &), 1113 Value *&BitFieldResult) { 1114 QualType LHSTy = E->getLHS()->getType(); 1115 BitFieldResult = 0; 1116 BinOpInfo OpInfo; 1117 1118 if (E->getComputationResultType()->isAnyComplexType()) { 1119 // This needs to go through the complex expression emitter, but it's a tad 1120 // complicated to do that... I'm leaving it out for now. (Note that we do 1121 // actually need the imaginary part of the RHS for multiplication and 1122 // division.) 1123 CGF.ErrorUnsupported(E, "complex compound assignment"); 1124 llvm::UndefValue::get(CGF.ConvertType(E->getType())); 1125 return LValue(); 1126 } 1127 1128 // Emit the RHS first. __block variables need to have the rhs evaluated 1129 // first, plus this should improve codegen a little. 1130 OpInfo.RHS = Visit(E->getRHS()); 1131 OpInfo.Ty = E->getComputationResultType(); 1132 OpInfo.E = E; 1133 // Load/convert the LHS. 1134 LValue LHSLV = EmitCheckedLValue(E->getLHS()); 1135 OpInfo.LHS = EmitLoadOfLValue(LHSLV, LHSTy); 1136 OpInfo.LHS = EmitScalarConversion(OpInfo.LHS, LHSTy, 1137 E->getComputationLHSType()); 1138 1139 // Expand the binary operator. 1140 Value *Result = (this->*Func)(OpInfo); 1141 1142 // Convert the result back to the LHS type. 1143 Result = EmitScalarConversion(Result, E->getComputationResultType(), LHSTy); 1144 1145 // Store the result value into the LHS lvalue. Bit-fields are handled 1146 // specially because the result is altered by the store, i.e., [C99 6.5.16p1] 1147 // 'An assignment expression has the value of the left operand after the 1148 // assignment...'. 1149 if (LHSLV.isBitField()) { 1150 if (!LHSLV.isVolatileQualified()) { 1151 CGF.EmitStoreThroughBitfieldLValue(RValue::get(Result), LHSLV, LHSTy, 1152 &Result); 1153 BitFieldResult = Result; 1154 return LHSLV; 1155 } else 1156 CGF.EmitStoreThroughBitfieldLValue(RValue::get(Result), LHSLV, LHSTy); 1157 } else 1158 CGF.EmitStoreThroughLValue(RValue::get(Result), LHSLV, LHSTy); 1159 return LHSLV; 1160} 1161 1162Value *ScalarExprEmitter::EmitCompoundAssign(const CompoundAssignOperator *E, 1163 Value *(ScalarExprEmitter::*Func)(const BinOpInfo &)) { 1164 bool Ignore = TestAndClearIgnoreResultAssign(); 1165 Value *BitFieldResult; 1166 LValue LHSLV = EmitCompoundAssignLValue(E, Func, BitFieldResult); 1167 if (BitFieldResult) 1168 return BitFieldResult; 1169 1170 if (Ignore) 1171 return 0; 1172 return EmitLoadOfLValue(LHSLV, E->getType()); 1173} 1174 1175 1176Value *ScalarExprEmitter::EmitDiv(const BinOpInfo &Ops) { 1177 if (Ops.LHS->getType()->isFPOrFPVectorTy()) 1178 return Builder.CreateFDiv(Ops.LHS, Ops.RHS, "div"); 1179 else if (Ops.Ty->isUnsignedIntegerType()) 1180 return Builder.CreateUDiv(Ops.LHS, Ops.RHS, "div"); 1181 else 1182 return Builder.CreateSDiv(Ops.LHS, Ops.RHS, "div"); 1183} 1184 1185Value *ScalarExprEmitter::EmitRem(const BinOpInfo &Ops) { 1186 // Rem in C can't be a floating point type: C99 6.5.5p2. 1187 if (Ops.Ty->isUnsignedIntegerType()) 1188 return Builder.CreateURem(Ops.LHS, Ops.RHS, "rem"); 1189 else 1190 return Builder.CreateSRem(Ops.LHS, Ops.RHS, "rem"); 1191} 1192 1193Value *ScalarExprEmitter::EmitOverflowCheckedBinOp(const BinOpInfo &Ops) { 1194 unsigned IID; 1195 unsigned OpID = 0; 1196 1197 switch (Ops.E->getOpcode()) { 1198 case BinaryOperator::Add: 1199 case BinaryOperator::AddAssign: 1200 OpID = 1; 1201 IID = llvm::Intrinsic::sadd_with_overflow; 1202 break; 1203 case BinaryOperator::Sub: 1204 case BinaryOperator::SubAssign: 1205 OpID = 2; 1206 IID = llvm::Intrinsic::ssub_with_overflow; 1207 break; 1208 case BinaryOperator::Mul: 1209 case BinaryOperator::MulAssign: 1210 OpID = 3; 1211 IID = llvm::Intrinsic::smul_with_overflow; 1212 break; 1213 default: 1214 assert(false && "Unsupported operation for overflow detection"); 1215 IID = 0; 1216 } 1217 OpID <<= 1; 1218 OpID |= 1; 1219 1220 const llvm::Type *opTy = CGF.CGM.getTypes().ConvertType(Ops.Ty); 1221 1222 llvm::Function *intrinsic = CGF.CGM.getIntrinsic(IID, &opTy, 1); 1223 1224 Value *resultAndOverflow = Builder.CreateCall2(intrinsic, Ops.LHS, Ops.RHS); 1225 Value *result = Builder.CreateExtractValue(resultAndOverflow, 0); 1226 Value *overflow = Builder.CreateExtractValue(resultAndOverflow, 1); 1227 1228 // Branch in case of overflow. 1229 llvm::BasicBlock *initialBB = Builder.GetInsertBlock(); 1230 llvm::BasicBlock *overflowBB = 1231 CGF.createBasicBlock("overflow", CGF.CurFn); 1232 llvm::BasicBlock *continueBB = 1233 CGF.createBasicBlock("overflow.continue", CGF.CurFn); 1234 1235 Builder.CreateCondBr(overflow, overflowBB, continueBB); 1236 1237 // Handle overflow 1238 1239 Builder.SetInsertPoint(overflowBB); 1240 1241 // Handler is: 1242 // long long *__overflow_handler)(long long a, long long b, char op, 1243 // char width) 1244 std::vector<const llvm::Type*> handerArgTypes; 1245 handerArgTypes.push_back(llvm::Type::getInt64Ty(VMContext)); 1246 handerArgTypes.push_back(llvm::Type::getInt64Ty(VMContext)); 1247 handerArgTypes.push_back(llvm::Type::getInt8Ty(VMContext)); 1248 handerArgTypes.push_back(llvm::Type::getInt8Ty(VMContext)); 1249 llvm::FunctionType *handlerTy = llvm::FunctionType::get( 1250 llvm::Type::getInt64Ty(VMContext), handerArgTypes, false); 1251 llvm::Value *handlerFunction = 1252 CGF.CGM.getModule().getOrInsertGlobal("__overflow_handler", 1253 llvm::PointerType::getUnqual(handlerTy)); 1254 handlerFunction = Builder.CreateLoad(handlerFunction); 1255 1256 llvm::Value *handlerResult = Builder.CreateCall4(handlerFunction, 1257 Builder.CreateSExt(Ops.LHS, llvm::Type::getInt64Ty(VMContext)), 1258 Builder.CreateSExt(Ops.RHS, llvm::Type::getInt64Ty(VMContext)), 1259 llvm::ConstantInt::get(llvm::Type::getInt8Ty(VMContext), OpID), 1260 llvm::ConstantInt::get(llvm::Type::getInt8Ty(VMContext), 1261 cast<llvm::IntegerType>(opTy)->getBitWidth())); 1262 1263 handlerResult = Builder.CreateTrunc(handlerResult, opTy); 1264 1265 Builder.CreateBr(continueBB); 1266 1267 // Set up the continuation 1268 Builder.SetInsertPoint(continueBB); 1269 // Get the correct result 1270 llvm::PHINode *phi = Builder.CreatePHI(opTy); 1271 phi->reserveOperandSpace(2); 1272 phi->addIncoming(result, initialBB); 1273 phi->addIncoming(handlerResult, overflowBB); 1274 1275 return phi; 1276} 1277 1278Value *ScalarExprEmitter::EmitAdd(const BinOpInfo &Ops) { 1279 if (!Ops.Ty->isAnyPointerType()) { 1280 if (CGF.getContext().getLangOptions().OverflowChecking && 1281 Ops.Ty->isSignedIntegerType()) 1282 return EmitOverflowCheckedBinOp(Ops); 1283 1284 if (Ops.LHS->getType()->isFPOrFPVectorTy()) 1285 return Builder.CreateFAdd(Ops.LHS, Ops.RHS, "add"); 1286 1287 // Signed integer overflow is undefined behavior. 1288 if (Ops.Ty->isSignedIntegerType()) 1289 return Builder.CreateNSWAdd(Ops.LHS, Ops.RHS, "add"); 1290 1291 return Builder.CreateAdd(Ops.LHS, Ops.RHS, "add"); 1292 } 1293 1294 if (Ops.Ty->isPointerType() && 1295 Ops.Ty->getAs<PointerType>()->isVariableArrayType()) { 1296 // The amount of the addition needs to account for the VLA size 1297 CGF.ErrorUnsupported(Ops.E, "VLA pointer addition"); 1298 } 1299 Value *Ptr, *Idx; 1300 Expr *IdxExp; 1301 const PointerType *PT = Ops.E->getLHS()->getType()->getAs<PointerType>(); 1302 const ObjCObjectPointerType *OPT = 1303 Ops.E->getLHS()->getType()->getAs<ObjCObjectPointerType>(); 1304 if (PT || OPT) { 1305 Ptr = Ops.LHS; 1306 Idx = Ops.RHS; 1307 IdxExp = Ops.E->getRHS(); 1308 } else { // int + pointer 1309 PT = Ops.E->getRHS()->getType()->getAs<PointerType>(); 1310 OPT = Ops.E->getRHS()->getType()->getAs<ObjCObjectPointerType>(); 1311 assert((PT || OPT) && "Invalid add expr"); 1312 Ptr = Ops.RHS; 1313 Idx = Ops.LHS; 1314 IdxExp = Ops.E->getLHS(); 1315 } 1316 1317 unsigned Width = cast<llvm::IntegerType>(Idx->getType())->getBitWidth(); 1318 if (Width < CGF.LLVMPointerWidth) { 1319 // Zero or sign extend the pointer value based on whether the index is 1320 // signed or not. 1321 const llvm::Type *IdxType = 1322 llvm::IntegerType::get(VMContext, CGF.LLVMPointerWidth); 1323 if (IdxExp->getType()->isSignedIntegerType()) 1324 Idx = Builder.CreateSExt(Idx, IdxType, "idx.ext"); 1325 else 1326 Idx = Builder.CreateZExt(Idx, IdxType, "idx.ext"); 1327 } 1328 const QualType ElementType = PT ? PT->getPointeeType() : OPT->getPointeeType(); 1329 // Handle interface types, which are not represented with a concrete type. 1330 if (const ObjCInterfaceType *OIT = dyn_cast<ObjCInterfaceType>(ElementType)) { 1331 llvm::Value *InterfaceSize = 1332 llvm::ConstantInt::get(Idx->getType(), 1333 CGF.getContext().getTypeSizeInChars(OIT).getQuantity()); 1334 Idx = Builder.CreateMul(Idx, InterfaceSize); 1335 const llvm::Type *i8Ty = llvm::Type::getInt8PtrTy(VMContext); 1336 Value *Casted = Builder.CreateBitCast(Ptr, i8Ty); 1337 Value *Res = Builder.CreateGEP(Casted, Idx, "add.ptr"); 1338 return Builder.CreateBitCast(Res, Ptr->getType()); 1339 } 1340 1341 // Explicitly handle GNU void* and function pointer arithmetic extensions. The 1342 // GNU void* casts amount to no-ops since our void* type is i8*, but this is 1343 // future proof. 1344 if (ElementType->isVoidType() || ElementType->isFunctionType()) { 1345 const llvm::Type *i8Ty = llvm::Type::getInt8PtrTy(VMContext); 1346 Value *Casted = Builder.CreateBitCast(Ptr, i8Ty); 1347 Value *Res = Builder.CreateGEP(Casted, Idx, "add.ptr"); 1348 return Builder.CreateBitCast(Res, Ptr->getType()); 1349 } 1350 1351 return Builder.CreateInBoundsGEP(Ptr, Idx, "add.ptr"); 1352} 1353 1354Value *ScalarExprEmitter::EmitSub(const BinOpInfo &Ops) { 1355 if (!isa<llvm::PointerType>(Ops.LHS->getType())) { 1356 if (CGF.getContext().getLangOptions().OverflowChecking 1357 && Ops.Ty->isSignedIntegerType()) 1358 return EmitOverflowCheckedBinOp(Ops); 1359 1360 if (Ops.LHS->getType()->isFPOrFPVectorTy()) 1361 return Builder.CreateFSub(Ops.LHS, Ops.RHS, "sub"); 1362 1363 // Signed integer overflow is undefined behavior. 1364 if (Ops.Ty->isSignedIntegerType()) 1365 return Builder.CreateNSWSub(Ops.LHS, Ops.RHS, "sub"); 1366 1367 return Builder.CreateSub(Ops.LHS, Ops.RHS, "sub"); 1368 } 1369 1370 if (Ops.E->getLHS()->getType()->isPointerType() && 1371 Ops.E->getLHS()->getType()->getAs<PointerType>()->isVariableArrayType()) { 1372 // The amount of the addition needs to account for the VLA size for 1373 // ptr-int 1374 // The amount of the division needs to account for the VLA size for 1375 // ptr-ptr. 1376 CGF.ErrorUnsupported(Ops.E, "VLA pointer subtraction"); 1377 } 1378 1379 const QualType LHSType = Ops.E->getLHS()->getType(); 1380 const QualType LHSElementType = LHSType->getPointeeType(); 1381 if (!isa<llvm::PointerType>(Ops.RHS->getType())) { 1382 // pointer - int 1383 Value *Idx = Ops.RHS; 1384 unsigned Width = cast<llvm::IntegerType>(Idx->getType())->getBitWidth(); 1385 if (Width < CGF.LLVMPointerWidth) { 1386 // Zero or sign extend the pointer value based on whether the index is 1387 // signed or not. 1388 const llvm::Type *IdxType = 1389 llvm::IntegerType::get(VMContext, CGF.LLVMPointerWidth); 1390 if (Ops.E->getRHS()->getType()->isSignedIntegerType()) 1391 Idx = Builder.CreateSExt(Idx, IdxType, "idx.ext"); 1392 else 1393 Idx = Builder.CreateZExt(Idx, IdxType, "idx.ext"); 1394 } 1395 Idx = Builder.CreateNeg(Idx, "sub.ptr.neg"); 1396 1397 // Handle interface types, which are not represented with a concrete type. 1398 if (const ObjCInterfaceType *OIT = 1399 dyn_cast<ObjCInterfaceType>(LHSElementType)) { 1400 llvm::Value *InterfaceSize = 1401 llvm::ConstantInt::get(Idx->getType(), 1402 CGF.getContext(). 1403 getTypeSizeInChars(OIT).getQuantity()); 1404 Idx = Builder.CreateMul(Idx, InterfaceSize); 1405 const llvm::Type *i8Ty = llvm::Type::getInt8PtrTy(VMContext); 1406 Value *LHSCasted = Builder.CreateBitCast(Ops.LHS, i8Ty); 1407 Value *Res = Builder.CreateGEP(LHSCasted, Idx, "add.ptr"); 1408 return Builder.CreateBitCast(Res, Ops.LHS->getType()); 1409 } 1410 1411 // Explicitly handle GNU void* and function pointer arithmetic 1412 // extensions. The GNU void* casts amount to no-ops since our void* type is 1413 // i8*, but this is future proof. 1414 if (LHSElementType->isVoidType() || LHSElementType->isFunctionType()) { 1415 const llvm::Type *i8Ty = llvm::Type::getInt8PtrTy(VMContext); 1416 Value *LHSCasted = Builder.CreateBitCast(Ops.LHS, i8Ty); 1417 Value *Res = Builder.CreateGEP(LHSCasted, Idx, "sub.ptr"); 1418 return Builder.CreateBitCast(Res, Ops.LHS->getType()); 1419 } 1420 1421 return Builder.CreateInBoundsGEP(Ops.LHS, Idx, "sub.ptr"); 1422 } else { 1423 // pointer - pointer 1424 Value *LHS = Ops.LHS; 1425 Value *RHS = Ops.RHS; 1426 1427 CharUnits ElementSize; 1428 1429 // Handle GCC extension for pointer arithmetic on void* and function pointer 1430 // types. 1431 if (LHSElementType->isVoidType() || LHSElementType->isFunctionType()) { 1432 ElementSize = CharUnits::One(); 1433 } else { 1434 ElementSize = CGF.getContext().getTypeSizeInChars(LHSElementType); 1435 } 1436 1437 const llvm::Type *ResultType = ConvertType(Ops.Ty); 1438 LHS = Builder.CreatePtrToInt(LHS, ResultType, "sub.ptr.lhs.cast"); 1439 RHS = Builder.CreatePtrToInt(RHS, ResultType, "sub.ptr.rhs.cast"); 1440 Value *BytesBetween = Builder.CreateSub(LHS, RHS, "sub.ptr.sub"); 1441 1442 // Optimize out the shift for element size of 1. 1443 if (ElementSize.isOne()) 1444 return BytesBetween; 1445 1446 // Otherwise, do a full sdiv. This uses the "exact" form of sdiv, since 1447 // pointer difference in C is only defined in the case where both operands 1448 // are pointing to elements of an array. 1449 Value *BytesPerElt = 1450 llvm::ConstantInt::get(ResultType, ElementSize.getQuantity()); 1451 return Builder.CreateExactSDiv(BytesBetween, BytesPerElt, "sub.ptr.div"); 1452 } 1453} 1454 1455Value *ScalarExprEmitter::EmitShl(const BinOpInfo &Ops) { 1456 // LLVM requires the LHS and RHS to be the same type: promote or truncate the 1457 // RHS to the same size as the LHS. 1458 Value *RHS = Ops.RHS; 1459 if (Ops.LHS->getType() != RHS->getType()) 1460 RHS = Builder.CreateIntCast(RHS, Ops.LHS->getType(), false, "sh_prom"); 1461 1462 if (CGF.CatchUndefined 1463 && isa<llvm::IntegerType>(Ops.LHS->getType())) { 1464 unsigned Width = cast<llvm::IntegerType>(Ops.LHS->getType())->getBitWidth(); 1465 llvm::BasicBlock *Cont = CGF.createBasicBlock("cont"); 1466 CGF.Builder.CreateCondBr(Builder.CreateICmpULT(RHS, 1467 llvm::ConstantInt::get(RHS->getType(), Width)), 1468 Cont, CGF.getTrapBB()); 1469 CGF.EmitBlock(Cont); 1470 } 1471 1472 return Builder.CreateShl(Ops.LHS, RHS, "shl"); 1473} 1474 1475Value *ScalarExprEmitter::EmitShr(const BinOpInfo &Ops) { 1476 // LLVM requires the LHS and RHS to be the same type: promote or truncate the 1477 // RHS to the same size as the LHS. 1478 Value *RHS = Ops.RHS; 1479 if (Ops.LHS->getType() != RHS->getType()) 1480 RHS = Builder.CreateIntCast(RHS, Ops.LHS->getType(), false, "sh_prom"); 1481 1482 if (CGF.CatchUndefined 1483 && isa<llvm::IntegerType>(Ops.LHS->getType())) { 1484 unsigned Width = cast<llvm::IntegerType>(Ops.LHS->getType())->getBitWidth(); 1485 llvm::BasicBlock *Cont = CGF.createBasicBlock("cont"); 1486 CGF.Builder.CreateCondBr(Builder.CreateICmpULT(RHS, 1487 llvm::ConstantInt::get(RHS->getType(), Width)), 1488 Cont, CGF.getTrapBB()); 1489 CGF.EmitBlock(Cont); 1490 } 1491 1492 if (Ops.Ty->isUnsignedIntegerType()) 1493 return Builder.CreateLShr(Ops.LHS, RHS, "shr"); 1494 return Builder.CreateAShr(Ops.LHS, RHS, "shr"); 1495} 1496 1497Value *ScalarExprEmitter::EmitCompare(const BinaryOperator *E,unsigned UICmpOpc, 1498 unsigned SICmpOpc, unsigned FCmpOpc) { 1499 TestAndClearIgnoreResultAssign(); 1500 Value *Result; 1501 QualType LHSTy = E->getLHS()->getType(); 1502 if (LHSTy->isMemberFunctionPointerType()) { 1503 Value *LHSPtr = CGF.EmitAnyExprToTemp(E->getLHS()).getAggregateAddr(); 1504 Value *RHSPtr = CGF.EmitAnyExprToTemp(E->getRHS()).getAggregateAddr(); 1505 llvm::Value *LHSFunc = Builder.CreateStructGEP(LHSPtr, 0); 1506 LHSFunc = Builder.CreateLoad(LHSFunc); 1507 llvm::Value *RHSFunc = Builder.CreateStructGEP(RHSPtr, 0); 1508 RHSFunc = Builder.CreateLoad(RHSFunc); 1509 Value *ResultF = Builder.CreateICmp((llvm::ICmpInst::Predicate)UICmpOpc, 1510 LHSFunc, RHSFunc, "cmp.func"); 1511 Value *NullPtr = llvm::Constant::getNullValue(LHSFunc->getType()); 1512 Value *ResultNull = Builder.CreateICmp((llvm::ICmpInst::Predicate)UICmpOpc, 1513 LHSFunc, NullPtr, "cmp.null"); 1514 llvm::Value *LHSAdj = Builder.CreateStructGEP(LHSPtr, 1); 1515 LHSAdj = Builder.CreateLoad(LHSAdj); 1516 llvm::Value *RHSAdj = Builder.CreateStructGEP(RHSPtr, 1); 1517 RHSAdj = Builder.CreateLoad(RHSAdj); 1518 Value *ResultA = Builder.CreateICmp((llvm::ICmpInst::Predicate)UICmpOpc, 1519 LHSAdj, RHSAdj, "cmp.adj"); 1520 if (E->getOpcode() == BinaryOperator::EQ) { 1521 Result = Builder.CreateOr(ResultNull, ResultA, "or.na"); 1522 Result = Builder.CreateAnd(Result, ResultF, "and.f"); 1523 } else { 1524 assert(E->getOpcode() == BinaryOperator::NE && 1525 "Member pointer comparison other than == or != ?"); 1526 Result = Builder.CreateAnd(ResultNull, ResultA, "and.na"); 1527 Result = Builder.CreateOr(Result, ResultF, "or.f"); 1528 } 1529 } else if (!LHSTy->isAnyComplexType()) { 1530 Value *LHS = Visit(E->getLHS()); 1531 Value *RHS = Visit(E->getRHS()); 1532 1533 if (LHS->getType()->isFPOrFPVectorTy()) { 1534 Result = Builder.CreateFCmp((llvm::CmpInst::Predicate)FCmpOpc, 1535 LHS, RHS, "cmp"); 1536 } else if (LHSTy->isSignedIntegerType()) { 1537 Result = Builder.CreateICmp((llvm::ICmpInst::Predicate)SICmpOpc, 1538 LHS, RHS, "cmp"); 1539 } else { 1540 // Unsigned integers and pointers. 1541 Result = Builder.CreateICmp((llvm::ICmpInst::Predicate)UICmpOpc, 1542 LHS, RHS, "cmp"); 1543 } 1544 1545 // If this is a vector comparison, sign extend the result to the appropriate 1546 // vector integer type and return it (don't convert to bool). 1547 if (LHSTy->isVectorType()) 1548 return Builder.CreateSExt(Result, ConvertType(E->getType()), "sext"); 1549 1550 } else { 1551 // Complex Comparison: can only be an equality comparison. 1552 CodeGenFunction::ComplexPairTy LHS = CGF.EmitComplexExpr(E->getLHS()); 1553 CodeGenFunction::ComplexPairTy RHS = CGF.EmitComplexExpr(E->getRHS()); 1554 1555 QualType CETy = LHSTy->getAs<ComplexType>()->getElementType(); 1556 1557 Value *ResultR, *ResultI; 1558 if (CETy->isRealFloatingType()) { 1559 ResultR = Builder.CreateFCmp((llvm::FCmpInst::Predicate)FCmpOpc, 1560 LHS.first, RHS.first, "cmp.r"); 1561 ResultI = Builder.CreateFCmp((llvm::FCmpInst::Predicate)FCmpOpc, 1562 LHS.second, RHS.second, "cmp.i"); 1563 } else { 1564 // Complex comparisons can only be equality comparisons. As such, signed 1565 // and unsigned opcodes are the same. 1566 ResultR = Builder.CreateICmp((llvm::ICmpInst::Predicate)UICmpOpc, 1567 LHS.first, RHS.first, "cmp.r"); 1568 ResultI = Builder.CreateICmp((llvm::ICmpInst::Predicate)UICmpOpc, 1569 LHS.second, RHS.second, "cmp.i"); 1570 } 1571 1572 if (E->getOpcode() == BinaryOperator::EQ) { 1573 Result = Builder.CreateAnd(ResultR, ResultI, "and.ri"); 1574 } else { 1575 assert(E->getOpcode() == BinaryOperator::NE && 1576 "Complex comparison other than == or != ?"); 1577 Result = Builder.CreateOr(ResultR, ResultI, "or.ri"); 1578 } 1579 } 1580 1581 return EmitScalarConversion(Result, CGF.getContext().BoolTy, E->getType()); 1582} 1583 1584Value *ScalarExprEmitter::VisitBinAssign(const BinaryOperator *E) { 1585 bool Ignore = TestAndClearIgnoreResultAssign(); 1586 1587 // __block variables need to have the rhs evaluated first, plus this should 1588 // improve codegen just a little. 1589 Value *RHS = Visit(E->getRHS()); 1590 LValue LHS = EmitCheckedLValue(E->getLHS()); 1591 1592 // Store the value into the LHS. Bit-fields are handled specially 1593 // because the result is altered by the store, i.e., [C99 6.5.16p1] 1594 // 'An assignment expression has the value of the left operand after 1595 // the assignment...'. 1596 if (LHS.isBitField()) { 1597 if (!LHS.isVolatileQualified()) { 1598 CGF.EmitStoreThroughBitfieldLValue(RValue::get(RHS), LHS, E->getType(), 1599 &RHS); 1600 return RHS; 1601 } else 1602 CGF.EmitStoreThroughBitfieldLValue(RValue::get(RHS), LHS, E->getType()); 1603 } else 1604 CGF.EmitStoreThroughLValue(RValue::get(RHS), LHS, E->getType()); 1605 if (Ignore) 1606 return 0; 1607 return EmitLoadOfLValue(LHS, E->getType()); 1608} 1609 1610Value *ScalarExprEmitter::VisitBinLAnd(const BinaryOperator *E) { 1611 const llvm::Type *ResTy = ConvertType(E->getType()); 1612 1613 // If we have 0 && RHS, see if we can elide RHS, if so, just return 0. 1614 // If we have 1 && X, just emit X without inserting the control flow. 1615 if (int Cond = CGF.ConstantFoldsToSimpleInteger(E->getLHS())) { 1616 if (Cond == 1) { // If we have 1 && X, just emit X. 1617 Value *RHSCond = CGF.EvaluateExprAsBool(E->getRHS()); 1618 // ZExt result to int or bool. 1619 return Builder.CreateZExtOrBitCast(RHSCond, ResTy, "land.ext"); 1620 } 1621 1622 // 0 && RHS: If it is safe, just elide the RHS, and return 0/false. 1623 if (!CGF.ContainsLabel(E->getRHS())) 1624 return llvm::Constant::getNullValue(ResTy); 1625 } 1626 1627 llvm::BasicBlock *ContBlock = CGF.createBasicBlock("land.end"); 1628 llvm::BasicBlock *RHSBlock = CGF.createBasicBlock("land.rhs"); 1629 1630 // Branch on the LHS first. If it is false, go to the failure (cont) block. 1631 CGF.EmitBranchOnBoolExpr(E->getLHS(), RHSBlock, ContBlock); 1632 1633 // Any edges into the ContBlock are now from an (indeterminate number of) 1634 // edges from this first condition. All of these values will be false. Start 1635 // setting up the PHI node in the Cont Block for this. 1636 llvm::PHINode *PN = llvm::PHINode::Create(llvm::Type::getInt1Ty(VMContext), 1637 "", ContBlock); 1638 PN->reserveOperandSpace(2); // Normal case, two inputs. 1639 for (llvm::pred_iterator PI = pred_begin(ContBlock), PE = pred_end(ContBlock); 1640 PI != PE; ++PI) 1641 PN->addIncoming(llvm::ConstantInt::getFalse(VMContext), *PI); 1642 1643 CGF.BeginConditionalBranch(); 1644 CGF.EmitBlock(RHSBlock); 1645 Value *RHSCond = CGF.EvaluateExprAsBool(E->getRHS()); 1646 CGF.EndConditionalBranch(); 1647 1648 // Reaquire the RHS block, as there may be subblocks inserted. 1649 RHSBlock = Builder.GetInsertBlock(); 1650 1651 // Emit an unconditional branch from this block to ContBlock. Insert an entry 1652 // into the phi node for the edge with the value of RHSCond. 1653 CGF.EmitBlock(ContBlock); 1654 PN->addIncoming(RHSCond, RHSBlock); 1655 1656 // ZExt result to int. 1657 return Builder.CreateZExtOrBitCast(PN, ResTy, "land.ext"); 1658} 1659 1660Value *ScalarExprEmitter::VisitBinLOr(const BinaryOperator *E) { 1661 const llvm::Type *ResTy = ConvertType(E->getType()); 1662 1663 // If we have 1 || RHS, see if we can elide RHS, if so, just return 1. 1664 // If we have 0 || X, just emit X without inserting the control flow. 1665 if (int Cond = CGF.ConstantFoldsToSimpleInteger(E->getLHS())) { 1666 if (Cond == -1) { // If we have 0 || X, just emit X. 1667 Value *RHSCond = CGF.EvaluateExprAsBool(E->getRHS()); 1668 // ZExt result to int or bool. 1669 return Builder.CreateZExtOrBitCast(RHSCond, ResTy, "lor.ext"); 1670 } 1671 1672 // 1 || RHS: If it is safe, just elide the RHS, and return 1/true. 1673 if (!CGF.ContainsLabel(E->getRHS())) 1674 return llvm::ConstantInt::get(ResTy, 1); 1675 } 1676 1677 llvm::BasicBlock *ContBlock = CGF.createBasicBlock("lor.end"); 1678 llvm::BasicBlock *RHSBlock = CGF.createBasicBlock("lor.rhs"); 1679 1680 // Branch on the LHS first. If it is true, go to the success (cont) block. 1681 CGF.EmitBranchOnBoolExpr(E->getLHS(), ContBlock, RHSBlock); 1682 1683 // Any edges into the ContBlock are now from an (indeterminate number of) 1684 // edges from this first condition. All of these values will be true. Start 1685 // setting up the PHI node in the Cont Block for this. 1686 llvm::PHINode *PN = llvm::PHINode::Create(llvm::Type::getInt1Ty(VMContext), 1687 "", ContBlock); 1688 PN->reserveOperandSpace(2); // Normal case, two inputs. 1689 for (llvm::pred_iterator PI = pred_begin(ContBlock), PE = pred_end(ContBlock); 1690 PI != PE; ++PI) 1691 PN->addIncoming(llvm::ConstantInt::getTrue(VMContext), *PI); 1692 1693 CGF.BeginConditionalBranch(); 1694 1695 // Emit the RHS condition as a bool value. 1696 CGF.EmitBlock(RHSBlock); 1697 Value *RHSCond = CGF.EvaluateExprAsBool(E->getRHS()); 1698 1699 CGF.EndConditionalBranch(); 1700 1701 // Reaquire the RHS block, as there may be subblocks inserted. 1702 RHSBlock = Builder.GetInsertBlock(); 1703 1704 // Emit an unconditional branch from this block to ContBlock. Insert an entry 1705 // into the phi node for the edge with the value of RHSCond. 1706 CGF.EmitBlock(ContBlock); 1707 PN->addIncoming(RHSCond, RHSBlock); 1708 1709 // ZExt result to int. 1710 return Builder.CreateZExtOrBitCast(PN, ResTy, "lor.ext"); 1711} 1712 1713Value *ScalarExprEmitter::VisitBinComma(const BinaryOperator *E) { 1714 CGF.EmitStmt(E->getLHS()); 1715 CGF.EnsureInsertPoint(); 1716 return Visit(E->getRHS()); 1717} 1718 1719//===----------------------------------------------------------------------===// 1720// Other Operators 1721//===----------------------------------------------------------------------===// 1722 1723/// isCheapEnoughToEvaluateUnconditionally - Return true if the specified 1724/// expression is cheap enough and side-effect-free enough to evaluate 1725/// unconditionally instead of conditionally. This is used to convert control 1726/// flow into selects in some cases. 1727static bool isCheapEnoughToEvaluateUnconditionally(const Expr *E, 1728 CodeGenFunction &CGF) { 1729 if (const ParenExpr *PE = dyn_cast<ParenExpr>(E)) 1730 return isCheapEnoughToEvaluateUnconditionally(PE->getSubExpr(), CGF); 1731 1732 // TODO: Allow anything we can constant fold to an integer or fp constant. 1733 if (isa<IntegerLiteral>(E) || isa<CharacterLiteral>(E) || 1734 isa<FloatingLiteral>(E)) 1735 return true; 1736 1737 // Non-volatile automatic variables too, to get "cond ? X : Y" where 1738 // X and Y are local variables. 1739 if (const DeclRefExpr *DRE = dyn_cast<DeclRefExpr>(E)) 1740 if (const VarDecl *VD = dyn_cast<VarDecl>(DRE->getDecl())) 1741 if (VD->hasLocalStorage() && !(CGF.getContext() 1742 .getCanonicalType(VD->getType()) 1743 .isVolatileQualified())) 1744 return true; 1745 1746 return false; 1747} 1748 1749 1750Value *ScalarExprEmitter:: 1751VisitConditionalOperator(const ConditionalOperator *E) { 1752 TestAndClearIgnoreResultAssign(); 1753 // If the condition constant folds and can be elided, try to avoid emitting 1754 // the condition and the dead arm. 1755 if (int Cond = CGF.ConstantFoldsToSimpleInteger(E->getCond())){ 1756 Expr *Live = E->getLHS(), *Dead = E->getRHS(); 1757 if (Cond == -1) 1758 std::swap(Live, Dead); 1759 1760 // If the dead side doesn't have labels we need, and if the Live side isn't 1761 // the gnu missing ?: extension (which we could handle, but don't bother 1762 // to), just emit the Live part. 1763 if ((!Dead || !CGF.ContainsLabel(Dead)) && // No labels in dead part 1764 Live) // Live part isn't missing. 1765 return Visit(Live); 1766 } 1767 1768 1769 // If this is a really simple expression (like x ? 4 : 5), emit this as a 1770 // select instead of as control flow. We can only do this if it is cheap and 1771 // safe to evaluate the LHS and RHS unconditionally. 1772 if (E->getLHS() && isCheapEnoughToEvaluateUnconditionally(E->getLHS(), 1773 CGF) && 1774 isCheapEnoughToEvaluateUnconditionally(E->getRHS(), CGF)) { 1775 llvm::Value *CondV = CGF.EvaluateExprAsBool(E->getCond()); 1776 llvm::Value *LHS = Visit(E->getLHS()); 1777 llvm::Value *RHS = Visit(E->getRHS()); 1778 return Builder.CreateSelect(CondV, LHS, RHS, "cond"); 1779 } 1780 1781 1782 llvm::BasicBlock *LHSBlock = CGF.createBasicBlock("cond.true"); 1783 llvm::BasicBlock *RHSBlock = CGF.createBasicBlock("cond.false"); 1784 llvm::BasicBlock *ContBlock = CGF.createBasicBlock("cond.end"); 1785 Value *CondVal = 0; 1786 1787 // If we don't have the GNU missing condition extension, emit a branch on bool 1788 // the normal way. 1789 if (E->getLHS()) { 1790 // Otherwise, just use EmitBranchOnBoolExpr to get small and simple code for 1791 // the branch on bool. 1792 CGF.EmitBranchOnBoolExpr(E->getCond(), LHSBlock, RHSBlock); 1793 } else { 1794 // Otherwise, for the ?: extension, evaluate the conditional and then 1795 // convert it to bool the hard way. We do this explicitly because we need 1796 // the unconverted value for the missing middle value of the ?:. 1797 CondVal = CGF.EmitScalarExpr(E->getCond()); 1798 1799 // In some cases, EmitScalarConversion will delete the "CondVal" expression 1800 // if there are no extra uses (an optimization). Inhibit this by making an 1801 // extra dead use, because we're going to add a use of CondVal later. We 1802 // don't use the builder for this, because we don't want it to get optimized 1803 // away. This leaves dead code, but the ?: extension isn't common. 1804 new llvm::BitCastInst(CondVal, CondVal->getType(), "dummy?:holder", 1805 Builder.GetInsertBlock()); 1806 1807 Value *CondBoolVal = 1808 CGF.EmitScalarConversion(CondVal, E->getCond()->getType(), 1809 CGF.getContext().BoolTy); 1810 Builder.CreateCondBr(CondBoolVal, LHSBlock, RHSBlock); 1811 } 1812 1813 CGF.BeginConditionalBranch(); 1814 CGF.EmitBlock(LHSBlock); 1815 1816 // Handle the GNU extension for missing LHS. 1817 Value *LHS; 1818 if (E->getLHS()) 1819 LHS = Visit(E->getLHS()); 1820 else // Perform promotions, to handle cases like "short ?: int" 1821 LHS = EmitScalarConversion(CondVal, E->getCond()->getType(), E->getType()); 1822 1823 CGF.EndConditionalBranch(); 1824 LHSBlock = Builder.GetInsertBlock(); 1825 CGF.EmitBranch(ContBlock); 1826 1827 CGF.BeginConditionalBranch(); 1828 CGF.EmitBlock(RHSBlock); 1829 1830 Value *RHS = Visit(E->getRHS()); 1831 CGF.EndConditionalBranch(); 1832 RHSBlock = Builder.GetInsertBlock(); 1833 CGF.EmitBranch(ContBlock); 1834 1835 CGF.EmitBlock(ContBlock); 1836 1837 // If the LHS or RHS is a throw expression, it will be legitimately null. 1838 if (!LHS) 1839 return RHS; 1840 if (!RHS) 1841 return LHS; 1842 1843 // Create a PHI node for the real part. 1844 llvm::PHINode *PN = Builder.CreatePHI(LHS->getType(), "cond"); 1845 PN->reserveOperandSpace(2); 1846 PN->addIncoming(LHS, LHSBlock); 1847 PN->addIncoming(RHS, RHSBlock); 1848 return PN; 1849} 1850 1851Value *ScalarExprEmitter::VisitChooseExpr(ChooseExpr *E) { 1852 return Visit(E->getChosenSubExpr(CGF.getContext())); 1853} 1854 1855Value *ScalarExprEmitter::VisitVAArgExpr(VAArgExpr *VE) { 1856 llvm::Value *ArgValue = CGF.EmitVAListRef(VE->getSubExpr()); 1857 llvm::Value *ArgPtr = CGF.EmitVAArg(ArgValue, VE->getType()); 1858 1859 // If EmitVAArg fails, we fall back to the LLVM instruction. 1860 if (!ArgPtr) 1861 return Builder.CreateVAArg(ArgValue, ConvertType(VE->getType())); 1862 1863 // FIXME Volatility. 1864 return Builder.CreateLoad(ArgPtr); 1865} 1866 1867Value *ScalarExprEmitter::VisitBlockExpr(const BlockExpr *BE) { 1868 return CGF.BuildBlockLiteralTmp(BE); 1869} 1870 1871//===----------------------------------------------------------------------===// 1872// Entry Point into this File 1873//===----------------------------------------------------------------------===// 1874 1875/// EmitScalarExpr - Emit the computation of the specified expression of scalar 1876/// type, ignoring the result. 1877Value *CodeGenFunction::EmitScalarExpr(const Expr *E, bool IgnoreResultAssign) { 1878 assert(E && !hasAggregateLLVMType(E->getType()) && 1879 "Invalid scalar expression to emit"); 1880 1881 return ScalarExprEmitter(*this, IgnoreResultAssign) 1882 .Visit(const_cast<Expr*>(E)); 1883} 1884 1885/// EmitScalarConversion - Emit a conversion from the specified type to the 1886/// specified destination type, both of which are LLVM scalar types. 1887Value *CodeGenFunction::EmitScalarConversion(Value *Src, QualType SrcTy, 1888 QualType DstTy) { 1889 assert(!hasAggregateLLVMType(SrcTy) && !hasAggregateLLVMType(DstTy) && 1890 "Invalid scalar expression to emit"); 1891 return ScalarExprEmitter(*this).EmitScalarConversion(Src, SrcTy, DstTy); 1892} 1893 1894/// EmitComplexToScalarConversion - Emit a conversion from the specified complex 1895/// type to the specified destination type, where the destination type is an 1896/// LLVM scalar type. 1897Value *CodeGenFunction::EmitComplexToScalarConversion(ComplexPairTy Src, 1898 QualType SrcTy, 1899 QualType DstTy) { 1900 assert(SrcTy->isAnyComplexType() && !hasAggregateLLVMType(DstTy) && 1901 "Invalid complex -> scalar conversion"); 1902 return ScalarExprEmitter(*this).EmitComplexToScalarConversion(Src, SrcTy, 1903 DstTy); 1904} 1905 1906LValue CodeGenFunction::EmitObjCIsaExpr(const ObjCIsaExpr *E) { 1907 llvm::Value *V; 1908 // object->isa or (*object).isa 1909 // Generate code as for: *(Class*)object 1910 // build Class* type 1911 const llvm::Type *ClassPtrTy = ConvertType(E->getType()); 1912 1913 Expr *BaseExpr = E->getBase(); 1914 if (BaseExpr->isLvalue(getContext()) != Expr::LV_Valid) { 1915 V = CreateTempAlloca(ClassPtrTy, "resval"); 1916 llvm::Value *Src = EmitScalarExpr(BaseExpr); 1917 Builder.CreateStore(Src, V); 1918 LValue LV = LValue::MakeAddr(V, MakeQualifiers(E->getType())); 1919 V = ScalarExprEmitter(*this).EmitLoadOfLValue(LV, E->getType()); 1920 } 1921 else { 1922 if (E->isArrow()) 1923 V = ScalarExprEmitter(*this).EmitLoadOfLValue(BaseExpr); 1924 else 1925 V = EmitLValue(BaseExpr).getAddress(); 1926 } 1927 1928 // build Class* type 1929 ClassPtrTy = ClassPtrTy->getPointerTo(); 1930 V = Builder.CreateBitCast(V, ClassPtrTy); 1931 LValue LV = LValue::MakeAddr(V, MakeQualifiers(E->getType())); 1932 return LV; 1933} 1934 1935 1936LValue CodeGenFunction::EmitCompoundAssignOperatorLValue( 1937 const CompoundAssignOperator *E) { 1938 ScalarExprEmitter Scalar(*this); 1939 Value *BitFieldResult = 0; 1940 switch (E->getOpcode()) { 1941#define COMPOUND_OP(Op) \ 1942 case BinaryOperator::Op##Assign: \ 1943 return Scalar.EmitCompoundAssignLValue(E, &ScalarExprEmitter::Emit##Op, \ 1944 BitFieldResult) 1945 COMPOUND_OP(Mul); 1946 COMPOUND_OP(Div); 1947 COMPOUND_OP(Rem); 1948 COMPOUND_OP(Add); 1949 COMPOUND_OP(Sub); 1950 COMPOUND_OP(Shl); 1951 COMPOUND_OP(Shr); 1952 COMPOUND_OP(And); 1953 COMPOUND_OP(Xor); 1954 COMPOUND_OP(Or); 1955#undef COMPOUND_OP 1956 1957 case BinaryOperator::PtrMemD: 1958 case BinaryOperator::PtrMemI: 1959 case BinaryOperator::Mul: 1960 case BinaryOperator::Div: 1961 case BinaryOperator::Rem: 1962 case BinaryOperator::Add: 1963 case BinaryOperator::Sub: 1964 case BinaryOperator::Shl: 1965 case BinaryOperator::Shr: 1966 case BinaryOperator::LT: 1967 case BinaryOperator::GT: 1968 case BinaryOperator::LE: 1969 case BinaryOperator::GE: 1970 case BinaryOperator::EQ: 1971 case BinaryOperator::NE: 1972 case BinaryOperator::And: 1973 case BinaryOperator::Xor: 1974 case BinaryOperator::Or: 1975 case BinaryOperator::LAnd: 1976 case BinaryOperator::LOr: 1977 case BinaryOperator::Assign: 1978 case BinaryOperator::Comma: 1979 assert(false && "Not valid compound assignment operators"); 1980 break; 1981 } 1982 1983 llvm_unreachable("Unhandled compound assignment operator"); 1984} 1985