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