1 //===- InstCombineCalls.cpp -----------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the visitCall and visitInvoke functions.
12 //===----------------------------------------------------------------------===//
14 #include "InstCombine.h"
15 #include "llvm/ADT/Statistic.h"
16 #include "llvm/Analysis/MemoryBuiltins.h"
17 #include "llvm/IR/CallSite.h"
18 #include "llvm/IR/DataLayout.h"
19 #include "llvm/IR/PatternMatch.h"
20 #include "llvm/Transforms/Utils/BuildLibCalls.h"
21 #include "llvm/Transforms/Utils/Local.h"
23 using namespace PatternMatch;
25 #define DEBUG_TYPE "instcombine"
27 STATISTIC(NumSimplified, "Number of library calls simplified");
29 /// getPromotedType - Return the specified type promoted as it would be to pass
30 /// though a va_arg area.
31 static Type *getPromotedType(Type *Ty) {
32 if (IntegerType* ITy = dyn_cast<IntegerType>(Ty)) {
33 if (ITy->getBitWidth() < 32)
34 return Type::getInt32Ty(Ty->getContext());
39 /// reduceToSingleValueType - Given an aggregate type which ultimately holds a
40 /// single scalar element, like {{{type}}} or [1 x type], return type.
41 static Type *reduceToSingleValueType(Type *T) {
42 while (!T->isSingleValueType()) {
43 if (StructType *STy = dyn_cast<StructType>(T)) {
44 if (STy->getNumElements() == 1)
45 T = STy->getElementType(0);
48 } else if (ArrayType *ATy = dyn_cast<ArrayType>(T)) {
49 if (ATy->getNumElements() == 1)
50 T = ATy->getElementType();
60 Instruction *InstCombiner::SimplifyMemTransfer(MemIntrinsic *MI) {
61 unsigned DstAlign = getKnownAlignment(MI->getArgOperand(0), DL);
62 unsigned SrcAlign = getKnownAlignment(MI->getArgOperand(1), DL);
63 unsigned MinAlign = std::min(DstAlign, SrcAlign);
64 unsigned CopyAlign = MI->getAlignment();
66 if (CopyAlign < MinAlign) {
67 MI->setAlignment(ConstantInt::get(MI->getAlignmentType(),
72 // If MemCpyInst length is 1/2/4/8 bytes then replace memcpy with
74 ConstantInt *MemOpLength = dyn_cast<ConstantInt>(MI->getArgOperand(2));
75 if (MemOpLength == 0) return 0;
77 // Source and destination pointer types are always "i8*" for intrinsic. See
78 // if the size is something we can handle with a single primitive load/store.
79 // A single load+store correctly handles overlapping memory in the memmove
81 uint64_t Size = MemOpLength->getLimitedValue();
82 assert(Size && "0-sized memory transferring should be removed already.");
84 if (Size > 8 || (Size&(Size-1)))
85 return 0; // If not 1/2/4/8 bytes, exit.
87 // Use an integer load+store unless we can find something better.
89 cast<PointerType>(MI->getArgOperand(1)->getType())->getAddressSpace();
91 cast<PointerType>(MI->getArgOperand(0)->getType())->getAddressSpace();
93 IntegerType* IntType = IntegerType::get(MI->getContext(), Size<<3);
94 Type *NewSrcPtrTy = PointerType::get(IntType, SrcAddrSp);
95 Type *NewDstPtrTy = PointerType::get(IntType, DstAddrSp);
97 // Memcpy forces the use of i8* for the source and destination. That means
98 // that if you're using memcpy to move one double around, you'll get a cast
99 // from double* to i8*. We'd much rather use a double load+store rather than
100 // an i64 load+store, here because this improves the odds that the source or
101 // dest address will be promotable. See if we can find a better type than the
103 Value *StrippedDest = MI->getArgOperand(0)->stripPointerCasts();
105 if (StrippedDest != MI->getArgOperand(0)) {
106 Type *SrcETy = cast<PointerType>(StrippedDest->getType())
108 if (DL && SrcETy->isSized() && DL->getTypeStoreSize(SrcETy) == Size) {
109 // The SrcETy might be something like {{{double}}} or [1 x double]. Rip
110 // down through these levels if so.
111 SrcETy = reduceToSingleValueType(SrcETy);
113 if (SrcETy->isSingleValueType()) {
114 NewSrcPtrTy = PointerType::get(SrcETy, SrcAddrSp);
115 NewDstPtrTy = PointerType::get(SrcETy, DstAddrSp);
117 // If the memcpy has metadata describing the members, see if we can
118 // get the TBAA tag describing our copy.
119 if (MDNode *M = MI->getMetadata(LLVMContext::MD_tbaa_struct)) {
120 if (M->getNumOperands() == 3 &&
122 isa<ConstantInt>(M->getOperand(0)) &&
123 cast<ConstantInt>(M->getOperand(0))->isNullValue() &&
125 isa<ConstantInt>(M->getOperand(1)) &&
126 cast<ConstantInt>(M->getOperand(1))->getValue() == Size &&
128 isa<MDNode>(M->getOperand(2)))
129 CopyMD = cast<MDNode>(M->getOperand(2));
135 // If the memcpy/memmove provides better alignment info than we can
137 SrcAlign = std::max(SrcAlign, CopyAlign);
138 DstAlign = std::max(DstAlign, CopyAlign);
140 Value *Src = Builder->CreateBitCast(MI->getArgOperand(1), NewSrcPtrTy);
141 Value *Dest = Builder->CreateBitCast(MI->getArgOperand(0), NewDstPtrTy);
142 LoadInst *L = Builder->CreateLoad(Src, MI->isVolatile());
143 L->setAlignment(SrcAlign);
145 L->setMetadata(LLVMContext::MD_tbaa, CopyMD);
146 StoreInst *S = Builder->CreateStore(L, Dest, MI->isVolatile());
147 S->setAlignment(DstAlign);
149 S->setMetadata(LLVMContext::MD_tbaa, CopyMD);
151 // Set the size of the copy to 0, it will be deleted on the next iteration.
152 MI->setArgOperand(2, Constant::getNullValue(MemOpLength->getType()));
156 Instruction *InstCombiner::SimplifyMemSet(MemSetInst *MI) {
157 unsigned Alignment = getKnownAlignment(MI->getDest(), DL);
158 if (MI->getAlignment() < Alignment) {
159 MI->setAlignment(ConstantInt::get(MI->getAlignmentType(),
164 // Extract the length and alignment and fill if they are constant.
165 ConstantInt *LenC = dyn_cast<ConstantInt>(MI->getLength());
166 ConstantInt *FillC = dyn_cast<ConstantInt>(MI->getValue());
167 if (!LenC || !FillC || !FillC->getType()->isIntegerTy(8))
169 uint64_t Len = LenC->getLimitedValue();
170 Alignment = MI->getAlignment();
171 assert(Len && "0-sized memory setting should be removed already.");
173 // memset(s,c,n) -> store s, c (for n=1,2,4,8)
174 if (Len <= 8 && isPowerOf2_32((uint32_t)Len)) {
175 Type *ITy = IntegerType::get(MI->getContext(), Len*8); // n=1 -> i8.
177 Value *Dest = MI->getDest();
178 unsigned DstAddrSp = cast<PointerType>(Dest->getType())->getAddressSpace();
179 Type *NewDstPtrTy = PointerType::get(ITy, DstAddrSp);
180 Dest = Builder->CreateBitCast(Dest, NewDstPtrTy);
182 // Alignment 0 is identity for alignment 1 for memset, but not store.
183 if (Alignment == 0) Alignment = 1;
185 // Extract the fill value and store.
186 uint64_t Fill = FillC->getZExtValue()*0x0101010101010101ULL;
187 StoreInst *S = Builder->CreateStore(ConstantInt::get(ITy, Fill), Dest,
189 S->setAlignment(Alignment);
191 // Set the size of the copy to 0, it will be deleted on the next iteration.
192 MI->setLength(Constant::getNullValue(LenC->getType()));
199 /// visitCallInst - CallInst simplification. This mostly only handles folding
200 /// of intrinsic instructions. For normal calls, it allows visitCallSite to do
201 /// the heavy lifting.
203 Instruction *InstCombiner::visitCallInst(CallInst &CI) {
204 if (isFreeCall(&CI, TLI))
205 return visitFree(CI);
207 // If the caller function is nounwind, mark the call as nounwind, even if the
209 if (CI.getParent()->getParent()->doesNotThrow() &&
210 !CI.doesNotThrow()) {
211 CI.setDoesNotThrow();
215 IntrinsicInst *II = dyn_cast<IntrinsicInst>(&CI);
216 if (!II) return visitCallSite(&CI);
218 // Intrinsics cannot occur in an invoke, so handle them here instead of in
220 if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(II)) {
221 bool Changed = false;
223 // memmove/cpy/set of zero bytes is a noop.
224 if (Constant *NumBytes = dyn_cast<Constant>(MI->getLength())) {
225 if (NumBytes->isNullValue())
226 return EraseInstFromFunction(CI);
228 if (ConstantInt *CI = dyn_cast<ConstantInt>(NumBytes))
229 if (CI->getZExtValue() == 1) {
230 // Replace the instruction with just byte operations. We would
231 // transform other cases to loads/stores, but we don't know if
232 // alignment is sufficient.
236 // No other transformations apply to volatile transfers.
237 if (MI->isVolatile())
240 // If we have a memmove and the source operation is a constant global,
241 // then the source and dest pointers can't alias, so we can change this
242 // into a call to memcpy.
243 if (MemMoveInst *MMI = dyn_cast<MemMoveInst>(MI)) {
244 if (GlobalVariable *GVSrc = dyn_cast<GlobalVariable>(MMI->getSource()))
245 if (GVSrc->isConstant()) {
246 Module *M = CI.getParent()->getParent()->getParent();
247 Intrinsic::ID MemCpyID = Intrinsic::memcpy;
248 Type *Tys[3] = { CI.getArgOperand(0)->getType(),
249 CI.getArgOperand(1)->getType(),
250 CI.getArgOperand(2)->getType() };
251 CI.setCalledFunction(Intrinsic::getDeclaration(M, MemCpyID, Tys));
256 if (MemTransferInst *MTI = dyn_cast<MemTransferInst>(MI)) {
257 // memmove(x,x,size) -> noop.
258 if (MTI->getSource() == MTI->getDest())
259 return EraseInstFromFunction(CI);
262 // If we can determine a pointer alignment that is bigger than currently
263 // set, update the alignment.
264 if (isa<MemTransferInst>(MI)) {
265 if (Instruction *I = SimplifyMemTransfer(MI))
267 } else if (MemSetInst *MSI = dyn_cast<MemSetInst>(MI)) {
268 if (Instruction *I = SimplifyMemSet(MSI))
272 if (Changed) return II;
275 switch (II->getIntrinsicID()) {
277 case Intrinsic::objectsize: {
279 if (getObjectSize(II->getArgOperand(0), Size, DL, TLI))
280 return ReplaceInstUsesWith(CI, ConstantInt::get(CI.getType(), Size));
283 case Intrinsic::bswap: {
284 Value *IIOperand = II->getArgOperand(0);
287 // bswap(bswap(x)) -> x
288 if (match(IIOperand, m_BSwap(m_Value(X))))
289 return ReplaceInstUsesWith(CI, X);
291 // bswap(trunc(bswap(x))) -> trunc(lshr(x, c))
292 if (match(IIOperand, m_Trunc(m_BSwap(m_Value(X))))) {
293 unsigned C = X->getType()->getPrimitiveSizeInBits() -
294 IIOperand->getType()->getPrimitiveSizeInBits();
295 Value *CV = ConstantInt::get(X->getType(), C);
296 Value *V = Builder->CreateLShr(X, CV);
297 return new TruncInst(V, IIOperand->getType());
302 case Intrinsic::powi:
303 if (ConstantInt *Power = dyn_cast<ConstantInt>(II->getArgOperand(1))) {
306 return ReplaceInstUsesWith(CI, ConstantFP::get(CI.getType(), 1.0));
309 return ReplaceInstUsesWith(CI, II->getArgOperand(0));
310 // powi(x, -1) -> 1/x
311 if (Power->isAllOnesValue())
312 return BinaryOperator::CreateFDiv(ConstantFP::get(CI.getType(), 1.0),
313 II->getArgOperand(0));
316 case Intrinsic::cttz: {
317 // If all bits below the first known one are known zero,
318 // this value is constant.
319 IntegerType *IT = dyn_cast<IntegerType>(II->getArgOperand(0)->getType());
320 // FIXME: Try to simplify vectors of integers.
322 uint32_t BitWidth = IT->getBitWidth();
323 APInt KnownZero(BitWidth, 0);
324 APInt KnownOne(BitWidth, 0);
325 ComputeMaskedBits(II->getArgOperand(0), KnownZero, KnownOne);
326 unsigned TrailingZeros = KnownOne.countTrailingZeros();
327 APInt Mask(APInt::getLowBitsSet(BitWidth, TrailingZeros));
328 if ((Mask & KnownZero) == Mask)
329 return ReplaceInstUsesWith(CI, ConstantInt::get(IT,
330 APInt(BitWidth, TrailingZeros)));
334 case Intrinsic::ctlz: {
335 // If all bits above the first known one are known zero,
336 // this value is constant.
337 IntegerType *IT = dyn_cast<IntegerType>(II->getArgOperand(0)->getType());
338 // FIXME: Try to simplify vectors of integers.
340 uint32_t BitWidth = IT->getBitWidth();
341 APInt KnownZero(BitWidth, 0);
342 APInt KnownOne(BitWidth, 0);
343 ComputeMaskedBits(II->getArgOperand(0), KnownZero, KnownOne);
344 unsigned LeadingZeros = KnownOne.countLeadingZeros();
345 APInt Mask(APInt::getHighBitsSet(BitWidth, LeadingZeros));
346 if ((Mask & KnownZero) == Mask)
347 return ReplaceInstUsesWith(CI, ConstantInt::get(IT,
348 APInt(BitWidth, LeadingZeros)));
352 case Intrinsic::uadd_with_overflow: {
353 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1);
354 IntegerType *IT = cast<IntegerType>(II->getArgOperand(0)->getType());
355 uint32_t BitWidth = IT->getBitWidth();
356 APInt LHSKnownZero(BitWidth, 0);
357 APInt LHSKnownOne(BitWidth, 0);
358 ComputeMaskedBits(LHS, LHSKnownZero, LHSKnownOne);
359 bool LHSKnownNegative = LHSKnownOne[BitWidth - 1];
360 bool LHSKnownPositive = LHSKnownZero[BitWidth - 1];
362 if (LHSKnownNegative || LHSKnownPositive) {
363 APInt RHSKnownZero(BitWidth, 0);
364 APInt RHSKnownOne(BitWidth, 0);
365 ComputeMaskedBits(RHS, RHSKnownZero, RHSKnownOne);
366 bool RHSKnownNegative = RHSKnownOne[BitWidth - 1];
367 bool RHSKnownPositive = RHSKnownZero[BitWidth - 1];
368 if (LHSKnownNegative && RHSKnownNegative) {
369 // The sign bit is set in both cases: this MUST overflow.
370 // Create a simple add instruction, and insert it into the struct.
371 Value *Add = Builder->CreateAdd(LHS, RHS);
374 UndefValue::get(LHS->getType()),
375 ConstantInt::getTrue(II->getContext())
377 StructType *ST = cast<StructType>(II->getType());
378 Constant *Struct = ConstantStruct::get(ST, V);
379 return InsertValueInst::Create(Struct, Add, 0);
382 if (LHSKnownPositive && RHSKnownPositive) {
383 // The sign bit is clear in both cases: this CANNOT overflow.
384 // Create a simple add instruction, and insert it into the struct.
385 Value *Add = Builder->CreateNUWAdd(LHS, RHS);
388 UndefValue::get(LHS->getType()),
389 ConstantInt::getFalse(II->getContext())
391 StructType *ST = cast<StructType>(II->getType());
392 Constant *Struct = ConstantStruct::get(ST, V);
393 return InsertValueInst::Create(Struct, Add, 0);
397 // FALL THROUGH uadd into sadd
398 case Intrinsic::sadd_with_overflow:
399 // Canonicalize constants into the RHS.
400 if (isa<Constant>(II->getArgOperand(0)) &&
401 !isa<Constant>(II->getArgOperand(1))) {
402 Value *LHS = II->getArgOperand(0);
403 II->setArgOperand(0, II->getArgOperand(1));
404 II->setArgOperand(1, LHS);
408 // X + undef -> undef
409 if (isa<UndefValue>(II->getArgOperand(1)))
410 return ReplaceInstUsesWith(CI, UndefValue::get(II->getType()));
412 if (ConstantInt *RHS = dyn_cast<ConstantInt>(II->getArgOperand(1))) {
413 // X + 0 -> {X, false}
416 UndefValue::get(II->getArgOperand(0)->getType()),
417 ConstantInt::getFalse(II->getContext())
420 ConstantStruct::get(cast<StructType>(II->getType()), V);
421 return InsertValueInst::Create(Struct, II->getArgOperand(0), 0);
425 case Intrinsic::usub_with_overflow:
426 case Intrinsic::ssub_with_overflow:
427 // undef - X -> undef
428 // X - undef -> undef
429 if (isa<UndefValue>(II->getArgOperand(0)) ||
430 isa<UndefValue>(II->getArgOperand(1)))
431 return ReplaceInstUsesWith(CI, UndefValue::get(II->getType()));
433 if (ConstantInt *RHS = dyn_cast<ConstantInt>(II->getArgOperand(1))) {
434 // X - 0 -> {X, false}
437 UndefValue::get(II->getArgOperand(0)->getType()),
438 ConstantInt::getFalse(II->getContext())
441 ConstantStruct::get(cast<StructType>(II->getType()), V);
442 return InsertValueInst::Create(Struct, II->getArgOperand(0), 0);
446 case Intrinsic::umul_with_overflow: {
447 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1);
448 unsigned BitWidth = cast<IntegerType>(LHS->getType())->getBitWidth();
450 APInt LHSKnownZero(BitWidth, 0);
451 APInt LHSKnownOne(BitWidth, 0);
452 ComputeMaskedBits(LHS, LHSKnownZero, LHSKnownOne);
453 APInt RHSKnownZero(BitWidth, 0);
454 APInt RHSKnownOne(BitWidth, 0);
455 ComputeMaskedBits(RHS, RHSKnownZero, RHSKnownOne);
457 // Get the largest possible values for each operand.
458 APInt LHSMax = ~LHSKnownZero;
459 APInt RHSMax = ~RHSKnownZero;
461 // If multiplying the maximum values does not overflow then we can turn
462 // this into a plain NUW mul.
464 LHSMax.umul_ov(RHSMax, Overflow);
466 Value *Mul = Builder->CreateNUWMul(LHS, RHS, "umul_with_overflow");
468 UndefValue::get(LHS->getType()),
471 Constant *Struct = ConstantStruct::get(cast<StructType>(II->getType()),V);
472 return InsertValueInst::Create(Struct, Mul, 0);
475 case Intrinsic::smul_with_overflow:
476 // Canonicalize constants into the RHS.
477 if (isa<Constant>(II->getArgOperand(0)) &&
478 !isa<Constant>(II->getArgOperand(1))) {
479 Value *LHS = II->getArgOperand(0);
480 II->setArgOperand(0, II->getArgOperand(1));
481 II->setArgOperand(1, LHS);
485 // X * undef -> undef
486 if (isa<UndefValue>(II->getArgOperand(1)))
487 return ReplaceInstUsesWith(CI, UndefValue::get(II->getType()));
489 if (ConstantInt *RHSI = dyn_cast<ConstantInt>(II->getArgOperand(1))) {
492 return ReplaceInstUsesWith(CI, Constant::getNullValue(II->getType()));
494 // X * 1 -> {X, false}
495 if (RHSI->equalsInt(1)) {
497 UndefValue::get(II->getArgOperand(0)->getType()),
498 ConstantInt::getFalse(II->getContext())
501 ConstantStruct::get(cast<StructType>(II->getType()), V);
502 return InsertValueInst::Create(Struct, II->getArgOperand(0), 0);
506 case Intrinsic::ppc_altivec_lvx:
507 case Intrinsic::ppc_altivec_lvxl:
508 // Turn PPC lvx -> load if the pointer is known aligned.
509 if (getOrEnforceKnownAlignment(II->getArgOperand(0), 16, DL) >= 16) {
510 Value *Ptr = Builder->CreateBitCast(II->getArgOperand(0),
511 PointerType::getUnqual(II->getType()));
512 return new LoadInst(Ptr);
515 case Intrinsic::ppc_altivec_stvx:
516 case Intrinsic::ppc_altivec_stvxl:
517 // Turn stvx -> store if the pointer is known aligned.
518 if (getOrEnforceKnownAlignment(II->getArgOperand(1), 16, DL) >= 16) {
520 PointerType::getUnqual(II->getArgOperand(0)->getType());
521 Value *Ptr = Builder->CreateBitCast(II->getArgOperand(1), OpPtrTy);
522 return new StoreInst(II->getArgOperand(0), Ptr);
525 case Intrinsic::x86_sse_storeu_ps:
526 case Intrinsic::x86_sse2_storeu_pd:
527 case Intrinsic::x86_sse2_storeu_dq:
528 // Turn X86 storeu -> store if the pointer is known aligned.
529 if (getOrEnforceKnownAlignment(II->getArgOperand(0), 16, DL) >= 16) {
531 PointerType::getUnqual(II->getArgOperand(1)->getType());
532 Value *Ptr = Builder->CreateBitCast(II->getArgOperand(0), OpPtrTy);
533 return new StoreInst(II->getArgOperand(1), Ptr);
537 case Intrinsic::x86_sse_cvtss2si:
538 case Intrinsic::x86_sse_cvtss2si64:
539 case Intrinsic::x86_sse_cvttss2si:
540 case Intrinsic::x86_sse_cvttss2si64:
541 case Intrinsic::x86_sse2_cvtsd2si:
542 case Intrinsic::x86_sse2_cvtsd2si64:
543 case Intrinsic::x86_sse2_cvttsd2si:
544 case Intrinsic::x86_sse2_cvttsd2si64: {
545 // These intrinsics only demand the 0th element of their input vectors. If
546 // we can simplify the input based on that, do so now.
548 cast<VectorType>(II->getArgOperand(0)->getType())->getNumElements();
549 APInt DemandedElts(VWidth, 1);
550 APInt UndefElts(VWidth, 0);
551 if (Value *V = SimplifyDemandedVectorElts(II->getArgOperand(0),
552 DemandedElts, UndefElts)) {
553 II->setArgOperand(0, V);
560 case Intrinsic::x86_sse41_pmovsxbw:
561 case Intrinsic::x86_sse41_pmovsxwd:
562 case Intrinsic::x86_sse41_pmovsxdq:
563 case Intrinsic::x86_sse41_pmovzxbw:
564 case Intrinsic::x86_sse41_pmovzxwd:
565 case Intrinsic::x86_sse41_pmovzxdq: {
566 // pmov{s|z}x ignores the upper half of their input vectors.
568 cast<VectorType>(II->getArgOperand(0)->getType())->getNumElements();
569 unsigned LowHalfElts = VWidth / 2;
570 APInt InputDemandedElts(APInt::getBitsSet(VWidth, 0, LowHalfElts));
571 APInt UndefElts(VWidth, 0);
572 if (Value *TmpV = SimplifyDemandedVectorElts(II->getArgOperand(0),
575 II->setArgOperand(0, TmpV);
581 case Intrinsic::x86_sse4a_insertqi: {
582 // insertqi x, y, 64, 0 can just copy y's lower bits and leave the top
584 // TODO: eventually we should lower this intrinsic to IR
585 if (auto CIWidth = dyn_cast<ConstantInt>(II->getArgOperand(2))) {
586 if (auto CIStart = dyn_cast<ConstantInt>(II->getArgOperand(3))) {
587 if (CIWidth->equalsInt(64) && CIStart->isZero()) {
588 Value *Vec = II->getArgOperand(1);
589 Value *Undef = UndefValue::get(Vec->getType());
590 const uint32_t Mask[] = { 0, 2 };
591 return ReplaceInstUsesWith(
593 Builder->CreateShuffleVector(
594 Vec, Undef, ConstantDataVector::get(
595 II->getContext(), ArrayRef<uint32_t>(Mask))));
597 } else if (auto Source =
598 dyn_cast<IntrinsicInst>(II->getArgOperand(0))) {
599 if (Source->hasOneUse() &&
600 Source->getArgOperand(1) == II->getArgOperand(1)) {
601 // If the source of the insert has only one use and it's another
602 // insert (and they're both inserting from the same vector), try to
603 // bundle both together.
605 dyn_cast<ConstantInt>(Source->getArgOperand(2));
607 dyn_cast<ConstantInt>(Source->getArgOperand(3));
608 if (CISourceStart && CISourceWidth) {
609 unsigned Start = CIStart->getZExtValue();
610 unsigned Width = CIWidth->getZExtValue();
611 unsigned End = Start + Width;
612 unsigned SourceStart = CISourceStart->getZExtValue();
613 unsigned SourceWidth = CISourceWidth->getZExtValue();
614 unsigned SourceEnd = SourceStart + SourceWidth;
615 unsigned NewStart, NewWidth;
616 bool ShouldReplace = false;
617 if (Start <= SourceStart && SourceStart <= End) {
619 NewWidth = std::max(End, SourceEnd) - NewStart;
620 ShouldReplace = true;
621 } else if (SourceStart <= Start && Start <= SourceEnd) {
622 NewStart = SourceStart;
623 NewWidth = std::max(SourceEnd, End) - NewStart;
624 ShouldReplace = true;
628 Constant *ConstantWidth = ConstantInt::get(
629 II->getArgOperand(2)->getType(), NewWidth, false);
630 Constant *ConstantStart = ConstantInt::get(
631 II->getArgOperand(3)->getType(), NewStart, false);
632 Value *Args[4] = { Source->getArgOperand(0),
633 II->getArgOperand(1), ConstantWidth,
635 Module *M = CI.getParent()->getParent()->getParent();
637 Intrinsic::getDeclaration(M, Intrinsic::x86_sse4a_insertqi);
638 return ReplaceInstUsesWith(CI, Builder->CreateCall(F, Args));
648 case Intrinsic::x86_avx_vpermilvar_ps:
649 case Intrinsic::x86_avx_vpermilvar_ps_256:
650 case Intrinsic::x86_avx_vpermilvar_pd:
651 case Intrinsic::x86_avx_vpermilvar_pd_256: {
652 // Convert vpermil* to shufflevector if the mask is constant.
653 Value *V = II->getArgOperand(1);
654 if (auto C = dyn_cast<ConstantDataVector>(V)) {
655 auto V1 = II->getArgOperand(0);
656 auto V2 = UndefValue::get(V1->getType());
657 auto Shuffle = Builder->CreateShuffleVector(V1, V2, C);
658 return ReplaceInstUsesWith(CI, Shuffle);
663 case Intrinsic::ppc_altivec_vperm:
664 // Turn vperm(V1,V2,mask) -> shuffle(V1,V2,mask) if mask is a constant.
665 if (Constant *Mask = dyn_cast<Constant>(II->getArgOperand(2))) {
666 assert(Mask->getType()->getVectorNumElements() == 16 &&
667 "Bad type for intrinsic!");
669 // Check that all of the elements are integer constants or undefs.
670 bool AllEltsOk = true;
671 for (unsigned i = 0; i != 16; ++i) {
672 Constant *Elt = Mask->getAggregateElement(i);
674 !(isa<ConstantInt>(Elt) || isa<UndefValue>(Elt))) {
681 // Cast the input vectors to byte vectors.
682 Value *Op0 = Builder->CreateBitCast(II->getArgOperand(0),
684 Value *Op1 = Builder->CreateBitCast(II->getArgOperand(1),
686 Value *Result = UndefValue::get(Op0->getType());
688 // Only extract each element once.
689 Value *ExtractedElts[32];
690 memset(ExtractedElts, 0, sizeof(ExtractedElts));
692 for (unsigned i = 0; i != 16; ++i) {
693 if (isa<UndefValue>(Mask->getAggregateElement(i)))
696 cast<ConstantInt>(Mask->getAggregateElement(i))->getZExtValue();
697 Idx &= 31; // Match the hardware behavior.
699 if (ExtractedElts[Idx] == 0) {
701 Builder->CreateExtractElement(Idx < 16 ? Op0 : Op1,
702 Builder->getInt32(Idx&15));
705 // Insert this value into the result vector.
706 Result = Builder->CreateInsertElement(Result, ExtractedElts[Idx],
707 Builder->getInt32(i));
709 return CastInst::Create(Instruction::BitCast, Result, CI.getType());
714 case Intrinsic::arm_neon_vld1:
715 case Intrinsic::arm_neon_vld2:
716 case Intrinsic::arm_neon_vld3:
717 case Intrinsic::arm_neon_vld4:
718 case Intrinsic::arm_neon_vld2lane:
719 case Intrinsic::arm_neon_vld3lane:
720 case Intrinsic::arm_neon_vld4lane:
721 case Intrinsic::arm_neon_vst1:
722 case Intrinsic::arm_neon_vst2:
723 case Intrinsic::arm_neon_vst3:
724 case Intrinsic::arm_neon_vst4:
725 case Intrinsic::arm_neon_vst2lane:
726 case Intrinsic::arm_neon_vst3lane:
727 case Intrinsic::arm_neon_vst4lane: {
728 unsigned MemAlign = getKnownAlignment(II->getArgOperand(0), DL);
729 unsigned AlignArg = II->getNumArgOperands() - 1;
730 ConstantInt *IntrAlign = dyn_cast<ConstantInt>(II->getArgOperand(AlignArg));
731 if (IntrAlign && IntrAlign->getZExtValue() < MemAlign) {
732 II->setArgOperand(AlignArg,
733 ConstantInt::get(Type::getInt32Ty(II->getContext()),
740 case Intrinsic::arm_neon_vmulls:
741 case Intrinsic::arm_neon_vmullu:
742 case Intrinsic::arm64_neon_smull:
743 case Intrinsic::arm64_neon_umull: {
744 Value *Arg0 = II->getArgOperand(0);
745 Value *Arg1 = II->getArgOperand(1);
747 // Handle mul by zero first:
748 if (isa<ConstantAggregateZero>(Arg0) || isa<ConstantAggregateZero>(Arg1)) {
749 return ReplaceInstUsesWith(CI, ConstantAggregateZero::get(II->getType()));
752 // Check for constant LHS & RHS - in this case we just simplify.
753 bool Zext = (II->getIntrinsicID() == Intrinsic::arm_neon_vmullu ||
754 II->getIntrinsicID() == Intrinsic::arm64_neon_umull);
755 VectorType *NewVT = cast<VectorType>(II->getType());
756 if (Constant *CV0 = dyn_cast<Constant>(Arg0)) {
757 if (Constant *CV1 = dyn_cast<Constant>(Arg1)) {
758 CV0 = ConstantExpr::getIntegerCast(CV0, NewVT, /*isSigned=*/!Zext);
759 CV1 = ConstantExpr::getIntegerCast(CV1, NewVT, /*isSigned=*/!Zext);
761 return ReplaceInstUsesWith(CI, ConstantExpr::getMul(CV0, CV1));
764 // Couldn't simplify - canonicalize constant to the RHS.
765 std::swap(Arg0, Arg1);
768 // Handle mul by one:
769 if (Constant *CV1 = dyn_cast<Constant>(Arg1))
770 if (ConstantInt *Splat =
771 dyn_cast_or_null<ConstantInt>(CV1->getSplatValue()))
773 return CastInst::CreateIntegerCast(Arg0, II->getType(),
779 case Intrinsic::stackrestore: {
780 // If the save is right next to the restore, remove the restore. This can
781 // happen when variable allocas are DCE'd.
782 if (IntrinsicInst *SS = dyn_cast<IntrinsicInst>(II->getArgOperand(0))) {
783 if (SS->getIntrinsicID() == Intrinsic::stacksave) {
784 BasicBlock::iterator BI = SS;
786 return EraseInstFromFunction(CI);
790 // Scan down this block to see if there is another stack restore in the
791 // same block without an intervening call/alloca.
792 BasicBlock::iterator BI = II;
793 TerminatorInst *TI = II->getParent()->getTerminator();
794 bool CannotRemove = false;
795 for (++BI; &*BI != TI; ++BI) {
796 if (isa<AllocaInst>(BI)) {
800 if (CallInst *BCI = dyn_cast<CallInst>(BI)) {
801 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(BCI)) {
802 // If there is a stackrestore below this one, remove this one.
803 if (II->getIntrinsicID() == Intrinsic::stackrestore)
804 return EraseInstFromFunction(CI);
805 // Otherwise, ignore the intrinsic.
807 // If we found a non-intrinsic call, we can't remove the stack
815 // If the stack restore is in a return, resume, or unwind block and if there
816 // are no allocas or calls between the restore and the return, nuke the
818 if (!CannotRemove && (isa<ReturnInst>(TI) || isa<ResumeInst>(TI)))
819 return EraseInstFromFunction(CI);
824 return visitCallSite(II);
827 // InvokeInst simplification
829 Instruction *InstCombiner::visitInvokeInst(InvokeInst &II) {
830 return visitCallSite(&II);
833 /// isSafeToEliminateVarargsCast - If this cast does not affect the value
834 /// passed through the varargs area, we can eliminate the use of the cast.
835 static bool isSafeToEliminateVarargsCast(const CallSite CS,
836 const CastInst * const CI,
837 const DataLayout * const DL,
839 if (!CI->isLosslessCast())
842 // The size of ByVal or InAlloca arguments is derived from the type, so we
843 // can't change to a type with a different size. If the size were
844 // passed explicitly we could avoid this check.
845 if (!CS.isByValOrInAllocaArgument(ix))
849 cast<PointerType>(CI->getOperand(0)->getType())->getElementType();
850 Type* DstTy = cast<PointerType>(CI->getType())->getElementType();
851 if (!SrcTy->isSized() || !DstTy->isSized())
853 if (!DL || DL->getTypeAllocSize(SrcTy) != DL->getTypeAllocSize(DstTy))
858 // Try to fold some different type of calls here.
859 // Currently we're only working with the checking functions, memcpy_chk,
860 // mempcpy_chk, memmove_chk, memset_chk, strcpy_chk, stpcpy_chk, strncpy_chk,
861 // strcat_chk and strncat_chk.
862 Instruction *InstCombiner::tryOptimizeCall(CallInst *CI, const DataLayout *DL) {
863 if (CI->getCalledFunction() == 0) return 0;
865 if (Value *With = Simplifier->optimizeCall(CI)) {
867 return CI->use_empty() ? CI : ReplaceInstUsesWith(*CI, With);
873 static IntrinsicInst *FindInitTrampolineFromAlloca(Value *TrampMem) {
874 // Strip off at most one level of pointer casts, looking for an alloca. This
875 // is good enough in practice and simpler than handling any number of casts.
876 Value *Underlying = TrampMem->stripPointerCasts();
877 if (Underlying != TrampMem &&
878 (!Underlying->hasOneUse() || Underlying->user_back() != TrampMem))
880 if (!isa<AllocaInst>(Underlying))
883 IntrinsicInst *InitTrampoline = 0;
884 for (User *U : TrampMem->users()) {
885 IntrinsicInst *II = dyn_cast<IntrinsicInst>(U);
888 if (II->getIntrinsicID() == Intrinsic::init_trampoline) {
890 // More than one init_trampoline writes to this value. Give up.
895 if (II->getIntrinsicID() == Intrinsic::adjust_trampoline)
896 // Allow any number of calls to adjust.trampoline.
901 // No call to init.trampoline found.
905 // Check that the alloca is being used in the expected way.
906 if (InitTrampoline->getOperand(0) != TrampMem)
909 return InitTrampoline;
912 static IntrinsicInst *FindInitTrampolineFromBB(IntrinsicInst *AdjustTramp,
914 // Visit all the previous instructions in the basic block, and try to find a
915 // init.trampoline which has a direct path to the adjust.trampoline.
916 for (BasicBlock::iterator I = AdjustTramp,
917 E = AdjustTramp->getParent()->begin(); I != E; ) {
918 Instruction *Inst = --I;
919 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I))
920 if (II->getIntrinsicID() == Intrinsic::init_trampoline &&
921 II->getOperand(0) == TrampMem)
923 if (Inst->mayWriteToMemory())
929 // Given a call to llvm.adjust.trampoline, find and return the corresponding
930 // call to llvm.init.trampoline if the call to the trampoline can be optimized
931 // to a direct call to a function. Otherwise return NULL.
933 static IntrinsicInst *FindInitTrampoline(Value *Callee) {
934 Callee = Callee->stripPointerCasts();
935 IntrinsicInst *AdjustTramp = dyn_cast<IntrinsicInst>(Callee);
937 AdjustTramp->getIntrinsicID() != Intrinsic::adjust_trampoline)
940 Value *TrampMem = AdjustTramp->getOperand(0);
942 if (IntrinsicInst *IT = FindInitTrampolineFromAlloca(TrampMem))
944 if (IntrinsicInst *IT = FindInitTrampolineFromBB(AdjustTramp, TrampMem))
949 // visitCallSite - Improvements for call and invoke instructions.
951 Instruction *InstCombiner::visitCallSite(CallSite CS) {
952 if (isAllocLikeFn(CS.getInstruction(), TLI))
953 return visitAllocSite(*CS.getInstruction());
955 bool Changed = false;
957 // If the callee is a pointer to a function, attempt to move any casts to the
958 // arguments of the call/invoke.
959 Value *Callee = CS.getCalledValue();
960 if (!isa<Function>(Callee) && transformConstExprCastCall(CS))
963 if (Function *CalleeF = dyn_cast<Function>(Callee))
964 // If the call and callee calling conventions don't match, this call must
965 // be unreachable, as the call is undefined.
966 if (CalleeF->getCallingConv() != CS.getCallingConv() &&
967 // Only do this for calls to a function with a body. A prototype may
968 // not actually end up matching the implementation's calling conv for a
969 // variety of reasons (e.g. it may be written in assembly).
970 !CalleeF->isDeclaration()) {
971 Instruction *OldCall = CS.getInstruction();
972 new StoreInst(ConstantInt::getTrue(Callee->getContext()),
973 UndefValue::get(Type::getInt1PtrTy(Callee->getContext())),
975 // If OldCall does not return void then replaceAllUsesWith undef.
976 // This allows ValueHandlers and custom metadata to adjust itself.
977 if (!OldCall->getType()->isVoidTy())
978 ReplaceInstUsesWith(*OldCall, UndefValue::get(OldCall->getType()));
979 if (isa<CallInst>(OldCall))
980 return EraseInstFromFunction(*OldCall);
982 // We cannot remove an invoke, because it would change the CFG, just
983 // change the callee to a null pointer.
984 cast<InvokeInst>(OldCall)->setCalledFunction(
985 Constant::getNullValue(CalleeF->getType()));
989 if (isa<ConstantPointerNull>(Callee) || isa<UndefValue>(Callee)) {
990 // If CS does not return void then replaceAllUsesWith undef.
991 // This allows ValueHandlers and custom metadata to adjust itself.
992 if (!CS.getInstruction()->getType()->isVoidTy())
993 ReplaceInstUsesWith(*CS.getInstruction(),
994 UndefValue::get(CS.getInstruction()->getType()));
996 if (isa<InvokeInst>(CS.getInstruction())) {
997 // Can't remove an invoke because we cannot change the CFG.
1001 // This instruction is not reachable, just remove it. We insert a store to
1002 // undef so that we know that this code is not reachable, despite the fact
1003 // that we can't modify the CFG here.
1004 new StoreInst(ConstantInt::getTrue(Callee->getContext()),
1005 UndefValue::get(Type::getInt1PtrTy(Callee->getContext())),
1006 CS.getInstruction());
1008 return EraseInstFromFunction(*CS.getInstruction());
1011 if (IntrinsicInst *II = FindInitTrampoline(Callee))
1012 return transformCallThroughTrampoline(CS, II);
1014 PointerType *PTy = cast<PointerType>(Callee->getType());
1015 FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
1016 if (FTy->isVarArg()) {
1017 int ix = FTy->getNumParams();
1018 // See if we can optimize any arguments passed through the varargs area of
1020 for (CallSite::arg_iterator I = CS.arg_begin() + FTy->getNumParams(),
1021 E = CS.arg_end(); I != E; ++I, ++ix) {
1022 CastInst *CI = dyn_cast<CastInst>(*I);
1023 if (CI && isSafeToEliminateVarargsCast(CS, CI, DL, ix)) {
1024 *I = CI->getOperand(0);
1030 if (isa<InlineAsm>(Callee) && !CS.doesNotThrow()) {
1031 // Inline asm calls cannot throw - mark them 'nounwind'.
1032 CS.setDoesNotThrow();
1036 // Try to optimize the call if possible, we require DataLayout for most of
1037 // this. None of these calls are seen as possibly dead so go ahead and
1038 // delete the instruction now.
1039 if (CallInst *CI = dyn_cast<CallInst>(CS.getInstruction())) {
1040 Instruction *I = tryOptimizeCall(CI, DL);
1041 // If we changed something return the result, etc. Otherwise let
1042 // the fallthrough check.
1043 if (I) return EraseInstFromFunction(*I);
1046 return Changed ? CS.getInstruction() : 0;
1049 // transformConstExprCastCall - If the callee is a constexpr cast of a function,
1050 // attempt to move the cast to the arguments of the call/invoke.
1052 bool InstCombiner::transformConstExprCastCall(CallSite CS) {
1054 dyn_cast<Function>(CS.getCalledValue()->stripPointerCasts());
1057 Instruction *Caller = CS.getInstruction();
1058 const AttributeSet &CallerPAL = CS.getAttributes();
1060 // Okay, this is a cast from a function to a different type. Unless doing so
1061 // would cause a type conversion of one of our arguments, change this call to
1062 // be a direct call with arguments casted to the appropriate types.
1064 FunctionType *FT = Callee->getFunctionType();
1065 Type *OldRetTy = Caller->getType();
1066 Type *NewRetTy = FT->getReturnType();
1068 // Check to see if we are changing the return type...
1069 if (OldRetTy != NewRetTy) {
1071 if (NewRetTy->isStructTy())
1072 return false; // TODO: Handle multiple return values.
1074 if (!CastInst::isBitCastable(NewRetTy, OldRetTy)) {
1075 if (Callee->isDeclaration())
1076 return false; // Cannot transform this return value.
1078 if (!Caller->use_empty() &&
1079 // void -> non-void is handled specially
1080 !NewRetTy->isVoidTy())
1081 return false; // Cannot transform this return value.
1084 if (!CallerPAL.isEmpty() && !Caller->use_empty()) {
1085 AttrBuilder RAttrs(CallerPAL, AttributeSet::ReturnIndex);
1087 hasAttributes(AttributeFuncs::
1088 typeIncompatible(NewRetTy, AttributeSet::ReturnIndex),
1089 AttributeSet::ReturnIndex))
1090 return false; // Attribute not compatible with transformed value.
1093 // If the callsite is an invoke instruction, and the return value is used by
1094 // a PHI node in a successor, we cannot change the return type of the call
1095 // because there is no place to put the cast instruction (without breaking
1096 // the critical edge). Bail out in this case.
1097 if (!Caller->use_empty())
1098 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller))
1099 for (User *U : II->users())
1100 if (PHINode *PN = dyn_cast<PHINode>(U))
1101 if (PN->getParent() == II->getNormalDest() ||
1102 PN->getParent() == II->getUnwindDest())
1106 unsigned NumActualArgs = CS.arg_size();
1107 unsigned NumCommonArgs = std::min(FT->getNumParams(), NumActualArgs);
1109 CallSite::arg_iterator AI = CS.arg_begin();
1110 for (unsigned i = 0, e = NumCommonArgs; i != e; ++i, ++AI) {
1111 Type *ParamTy = FT->getParamType(i);
1112 Type *ActTy = (*AI)->getType();
1114 if (!CastInst::isBitCastable(ActTy, ParamTy))
1115 return false; // Cannot transform this parameter value.
1117 if (AttrBuilder(CallerPAL.getParamAttributes(i + 1), i + 1).
1118 hasAttributes(AttributeFuncs::
1119 typeIncompatible(ParamTy, i + 1), i + 1))
1120 return false; // Attribute not compatible with transformed value.
1122 if (CS.isInAllocaArgument(i))
1123 return false; // Cannot transform to and from inalloca.
1125 // If the parameter is passed as a byval argument, then we have to have a
1126 // sized type and the sized type has to have the same size as the old type.
1127 if (ParamTy != ActTy &&
1128 CallerPAL.getParamAttributes(i + 1).hasAttribute(i + 1,
1129 Attribute::ByVal)) {
1130 PointerType *ParamPTy = dyn_cast<PointerType>(ParamTy);
1131 if (ParamPTy == 0 || !ParamPTy->getElementType()->isSized() || DL == 0)
1134 Type *CurElTy = ActTy->getPointerElementType();
1135 if (DL->getTypeAllocSize(CurElTy) !=
1136 DL->getTypeAllocSize(ParamPTy->getElementType()))
1141 if (Callee->isDeclaration()) {
1142 // Do not delete arguments unless we have a function body.
1143 if (FT->getNumParams() < NumActualArgs && !FT->isVarArg())
1146 // If the callee is just a declaration, don't change the varargsness of the
1147 // call. We don't want to introduce a varargs call where one doesn't
1149 PointerType *APTy = cast<PointerType>(CS.getCalledValue()->getType());
1150 if (FT->isVarArg()!=cast<FunctionType>(APTy->getElementType())->isVarArg())
1153 // If both the callee and the cast type are varargs, we still have to make
1154 // sure the number of fixed parameters are the same or we have the same
1155 // ABI issues as if we introduce a varargs call.
1156 if (FT->isVarArg() &&
1157 cast<FunctionType>(APTy->getElementType())->isVarArg() &&
1158 FT->getNumParams() !=
1159 cast<FunctionType>(APTy->getElementType())->getNumParams())
1163 if (FT->getNumParams() < NumActualArgs && FT->isVarArg() &&
1164 !CallerPAL.isEmpty())
1165 // In this case we have more arguments than the new function type, but we
1166 // won't be dropping them. Check that these extra arguments have attributes
1167 // that are compatible with being a vararg call argument.
1168 for (unsigned i = CallerPAL.getNumSlots(); i; --i) {
1169 unsigned Index = CallerPAL.getSlotIndex(i - 1);
1170 if (Index <= FT->getNumParams())
1173 // Check if it has an attribute that's incompatible with varargs.
1174 AttributeSet PAttrs = CallerPAL.getSlotAttributes(i - 1);
1175 if (PAttrs.hasAttribute(Index, Attribute::StructRet))
1180 // Okay, we decided that this is a safe thing to do: go ahead and start
1181 // inserting cast instructions as necessary.
1182 std::vector<Value*> Args;
1183 Args.reserve(NumActualArgs);
1184 SmallVector<AttributeSet, 8> attrVec;
1185 attrVec.reserve(NumCommonArgs);
1187 // Get any return attributes.
1188 AttrBuilder RAttrs(CallerPAL, AttributeSet::ReturnIndex);
1190 // If the return value is not being used, the type may not be compatible
1191 // with the existing attributes. Wipe out any problematic attributes.
1193 removeAttributes(AttributeFuncs::
1194 typeIncompatible(NewRetTy, AttributeSet::ReturnIndex),
1195 AttributeSet::ReturnIndex);
1197 // Add the new return attributes.
1198 if (RAttrs.hasAttributes())
1199 attrVec.push_back(AttributeSet::get(Caller->getContext(),
1200 AttributeSet::ReturnIndex, RAttrs));
1202 AI = CS.arg_begin();
1203 for (unsigned i = 0; i != NumCommonArgs; ++i, ++AI) {
1204 Type *ParamTy = FT->getParamType(i);
1206 if ((*AI)->getType() == ParamTy) {
1207 Args.push_back(*AI);
1209 Args.push_back(Builder->CreateBitCast(*AI, ParamTy));
1212 // Add any parameter attributes.
1213 AttrBuilder PAttrs(CallerPAL.getParamAttributes(i + 1), i + 1);
1214 if (PAttrs.hasAttributes())
1215 attrVec.push_back(AttributeSet::get(Caller->getContext(), i + 1,
1219 // If the function takes more arguments than the call was taking, add them
1221 for (unsigned i = NumCommonArgs; i != FT->getNumParams(); ++i)
1222 Args.push_back(Constant::getNullValue(FT->getParamType(i)));
1224 // If we are removing arguments to the function, emit an obnoxious warning.
1225 if (FT->getNumParams() < NumActualArgs) {
1226 // TODO: if (!FT->isVarArg()) this call may be unreachable. PR14722
1227 if (FT->isVarArg()) {
1228 // Add all of the arguments in their promoted form to the arg list.
1229 for (unsigned i = FT->getNumParams(); i != NumActualArgs; ++i, ++AI) {
1230 Type *PTy = getPromotedType((*AI)->getType());
1231 if (PTy != (*AI)->getType()) {
1232 // Must promote to pass through va_arg area!
1233 Instruction::CastOps opcode =
1234 CastInst::getCastOpcode(*AI, false, PTy, false);
1235 Args.push_back(Builder->CreateCast(opcode, *AI, PTy));
1237 Args.push_back(*AI);
1240 // Add any parameter attributes.
1241 AttrBuilder PAttrs(CallerPAL.getParamAttributes(i + 1), i + 1);
1242 if (PAttrs.hasAttributes())
1243 attrVec.push_back(AttributeSet::get(FT->getContext(), i + 1,
1249 AttributeSet FnAttrs = CallerPAL.getFnAttributes();
1250 if (CallerPAL.hasAttributes(AttributeSet::FunctionIndex))
1251 attrVec.push_back(AttributeSet::get(Callee->getContext(), FnAttrs));
1253 if (NewRetTy->isVoidTy())
1254 Caller->setName(""); // Void type should not have a name.
1256 const AttributeSet &NewCallerPAL = AttributeSet::get(Callee->getContext(),
1260 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
1261 NC = Builder->CreateInvoke(Callee, II->getNormalDest(),
1262 II->getUnwindDest(), Args);
1264 cast<InvokeInst>(NC)->setCallingConv(II->getCallingConv());
1265 cast<InvokeInst>(NC)->setAttributes(NewCallerPAL);
1267 CallInst *CI = cast<CallInst>(Caller);
1268 NC = Builder->CreateCall(Callee, Args);
1270 if (CI->isTailCall())
1271 cast<CallInst>(NC)->setTailCall();
1272 cast<CallInst>(NC)->setCallingConv(CI->getCallingConv());
1273 cast<CallInst>(NC)->setAttributes(NewCallerPAL);
1276 // Insert a cast of the return type as necessary.
1278 if (OldRetTy != NV->getType() && !Caller->use_empty()) {
1279 if (!NV->getType()->isVoidTy()) {
1280 NV = NC = CastInst::Create(CastInst::BitCast, NC, OldRetTy);
1281 NC->setDebugLoc(Caller->getDebugLoc());
1283 // If this is an invoke instruction, we should insert it after the first
1284 // non-phi, instruction in the normal successor block.
1285 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
1286 BasicBlock::iterator I = II->getNormalDest()->getFirstInsertionPt();
1287 InsertNewInstBefore(NC, *I);
1289 // Otherwise, it's a call, just insert cast right after the call.
1290 InsertNewInstBefore(NC, *Caller);
1292 Worklist.AddUsersToWorkList(*Caller);
1294 NV = UndefValue::get(Caller->getType());
1298 if (!Caller->use_empty())
1299 ReplaceInstUsesWith(*Caller, NV);
1300 else if (Caller->hasValueHandle())
1301 ValueHandleBase::ValueIsRAUWd(Caller, NV);
1303 EraseInstFromFunction(*Caller);
1307 // transformCallThroughTrampoline - Turn a call to a function created by
1308 // init_trampoline / adjust_trampoline intrinsic pair into a direct call to the
1309 // underlying function.
1312 InstCombiner::transformCallThroughTrampoline(CallSite CS,
1313 IntrinsicInst *Tramp) {
1314 Value *Callee = CS.getCalledValue();
1315 PointerType *PTy = cast<PointerType>(Callee->getType());
1316 FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
1317 const AttributeSet &Attrs = CS.getAttributes();
1319 // If the call already has the 'nest' attribute somewhere then give up -
1320 // otherwise 'nest' would occur twice after splicing in the chain.
1321 if (Attrs.hasAttrSomewhere(Attribute::Nest))
1325 "transformCallThroughTrampoline called with incorrect CallSite.");
1327 Function *NestF =cast<Function>(Tramp->getArgOperand(1)->stripPointerCasts());
1328 PointerType *NestFPTy = cast<PointerType>(NestF->getType());
1329 FunctionType *NestFTy = cast<FunctionType>(NestFPTy->getElementType());
1331 const AttributeSet &NestAttrs = NestF->getAttributes();
1332 if (!NestAttrs.isEmpty()) {
1333 unsigned NestIdx = 1;
1335 AttributeSet NestAttr;
1337 // Look for a parameter marked with the 'nest' attribute.
1338 for (FunctionType::param_iterator I = NestFTy->param_begin(),
1339 E = NestFTy->param_end(); I != E; ++NestIdx, ++I)
1340 if (NestAttrs.hasAttribute(NestIdx, Attribute::Nest)) {
1341 // Record the parameter type and any other attributes.
1343 NestAttr = NestAttrs.getParamAttributes(NestIdx);
1348 Instruction *Caller = CS.getInstruction();
1349 std::vector<Value*> NewArgs;
1350 NewArgs.reserve(CS.arg_size() + 1);
1352 SmallVector<AttributeSet, 8> NewAttrs;
1353 NewAttrs.reserve(Attrs.getNumSlots() + 1);
1355 // Insert the nest argument into the call argument list, which may
1356 // mean appending it. Likewise for attributes.
1358 // Add any result attributes.
1359 if (Attrs.hasAttributes(AttributeSet::ReturnIndex))
1360 NewAttrs.push_back(AttributeSet::get(Caller->getContext(),
1361 Attrs.getRetAttributes()));
1365 CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end();
1367 if (Idx == NestIdx) {
1368 // Add the chain argument and attributes.
1369 Value *NestVal = Tramp->getArgOperand(2);
1370 if (NestVal->getType() != NestTy)
1371 NestVal = Builder->CreateBitCast(NestVal, NestTy, "nest");
1372 NewArgs.push_back(NestVal);
1373 NewAttrs.push_back(AttributeSet::get(Caller->getContext(),
1380 // Add the original argument and attributes.
1381 NewArgs.push_back(*I);
1382 AttributeSet Attr = Attrs.getParamAttributes(Idx);
1383 if (Attr.hasAttributes(Idx)) {
1384 AttrBuilder B(Attr, Idx);
1385 NewAttrs.push_back(AttributeSet::get(Caller->getContext(),
1386 Idx + (Idx >= NestIdx), B));
1393 // Add any function attributes.
1394 if (Attrs.hasAttributes(AttributeSet::FunctionIndex))
1395 NewAttrs.push_back(AttributeSet::get(FTy->getContext(),
1396 Attrs.getFnAttributes()));
1398 // The trampoline may have been bitcast to a bogus type (FTy).
1399 // Handle this by synthesizing a new function type, equal to FTy
1400 // with the chain parameter inserted.
1402 std::vector<Type*> NewTypes;
1403 NewTypes.reserve(FTy->getNumParams()+1);
1405 // Insert the chain's type into the list of parameter types, which may
1406 // mean appending it.
1409 FunctionType::param_iterator I = FTy->param_begin(),
1410 E = FTy->param_end();
1414 // Add the chain's type.
1415 NewTypes.push_back(NestTy);
1420 // Add the original type.
1421 NewTypes.push_back(*I);
1427 // Replace the trampoline call with a direct call. Let the generic
1428 // code sort out any function type mismatches.
1429 FunctionType *NewFTy = FunctionType::get(FTy->getReturnType(), NewTypes,
1431 Constant *NewCallee =
1432 NestF->getType() == PointerType::getUnqual(NewFTy) ?
1433 NestF : ConstantExpr::getBitCast(NestF,
1434 PointerType::getUnqual(NewFTy));
1435 const AttributeSet &NewPAL =
1436 AttributeSet::get(FTy->getContext(), NewAttrs);
1438 Instruction *NewCaller;
1439 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
1440 NewCaller = InvokeInst::Create(NewCallee,
1441 II->getNormalDest(), II->getUnwindDest(),
1443 cast<InvokeInst>(NewCaller)->setCallingConv(II->getCallingConv());
1444 cast<InvokeInst>(NewCaller)->setAttributes(NewPAL);
1446 NewCaller = CallInst::Create(NewCallee, NewArgs);
1447 if (cast<CallInst>(Caller)->isTailCall())
1448 cast<CallInst>(NewCaller)->setTailCall();
1449 cast<CallInst>(NewCaller)->
1450 setCallingConv(cast<CallInst>(Caller)->getCallingConv());
1451 cast<CallInst>(NewCaller)->setAttributes(NewPAL);
1458 // Replace the trampoline call with a direct call. Since there is no 'nest'
1459 // parameter, there is no need to adjust the argument list. Let the generic
1460 // code sort out any function type mismatches.
1461 Constant *NewCallee =
1462 NestF->getType() == PTy ? NestF :
1463 ConstantExpr::getBitCast(NestF, PTy);
1464 CS.setCalledFunction(NewCallee);
1465 return CS.getInstruction();