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/IntrinsicInst.h"
16 #include "llvm/Support/CallSite.h"
17 #include "llvm/Target/TargetData.h"
18 #include "llvm/Analysis/MemoryBuiltins.h"
19 #include "llvm/Transforms/Utils/BuildLibCalls.h"
20 #include "llvm/Transforms/Utils/Local.h"
23 /// getPromotedType - Return the specified type promoted as it would be to pass
24 /// though a va_arg area.
25 static const Type *getPromotedType(const Type *Ty) {
26 if (const IntegerType* ITy = dyn_cast<IntegerType>(Ty)) {
27 if (ITy->getBitWidth() < 32)
28 return Type::getInt32Ty(Ty->getContext());
34 Instruction *InstCombiner::SimplifyMemTransfer(MemIntrinsic *MI) {
35 unsigned DstAlign = getKnownAlignment(MI->getArgOperand(0), TD);
36 unsigned SrcAlign = getKnownAlignment(MI->getArgOperand(1), TD);
37 unsigned MinAlign = std::min(DstAlign, SrcAlign);
38 unsigned CopyAlign = MI->getAlignment();
40 if (CopyAlign < MinAlign) {
41 MI->setAlignment(ConstantInt::get(MI->getAlignmentType(),
46 // If MemCpyInst length is 1/2/4/8 bytes then replace memcpy with
48 ConstantInt *MemOpLength = dyn_cast<ConstantInt>(MI->getArgOperand(2));
49 if (MemOpLength == 0) return 0;
51 // Source and destination pointer types are always "i8*" for intrinsic. See
52 // if the size is something we can handle with a single primitive load/store.
53 // A single load+store correctly handles overlapping memory in the memmove
55 unsigned Size = MemOpLength->getZExtValue();
56 if (Size == 0) return MI; // Delete this mem transfer.
58 if (Size > 8 || (Size&(Size-1)))
59 return 0; // If not 1/2/4/8 bytes, exit.
61 // Use an integer load+store unless we can find something better.
63 cast<PointerType>(MI->getArgOperand(1)->getType())->getAddressSpace();
65 cast<PointerType>(MI->getArgOperand(0)->getType())->getAddressSpace();
67 const IntegerType* IntType = IntegerType::get(MI->getContext(), Size<<3);
68 Type *NewSrcPtrTy = PointerType::get(IntType, SrcAddrSp);
69 Type *NewDstPtrTy = PointerType::get(IntType, DstAddrSp);
71 // Memcpy forces the use of i8* for the source and destination. That means
72 // that if you're using memcpy to move one double around, you'll get a cast
73 // from double* to i8*. We'd much rather use a double load+store rather than
74 // an i64 load+store, here because this improves the odds that the source or
75 // dest address will be promotable. See if we can find a better type than the
77 Value *StrippedDest = MI->getArgOperand(0)->stripPointerCasts();
78 if (StrippedDest != MI->getArgOperand(0)) {
79 const Type *SrcETy = cast<PointerType>(StrippedDest->getType())
81 if (TD && SrcETy->isSized() && TD->getTypeStoreSize(SrcETy) == Size) {
82 // The SrcETy might be something like {{{double}}} or [1 x double]. Rip
83 // down through these levels if so.
84 while (!SrcETy->isSingleValueType()) {
85 if (const StructType *STy = dyn_cast<StructType>(SrcETy)) {
86 if (STy->getNumElements() == 1)
87 SrcETy = STy->getElementType(0);
90 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(SrcETy)) {
91 if (ATy->getNumElements() == 1)
92 SrcETy = ATy->getElementType();
99 if (SrcETy->isSingleValueType()) {
100 NewSrcPtrTy = PointerType::get(SrcETy, SrcAddrSp);
101 NewDstPtrTy = PointerType::get(SrcETy, DstAddrSp);
107 // If the memcpy/memmove provides better alignment info than we can
109 SrcAlign = std::max(SrcAlign, CopyAlign);
110 DstAlign = std::max(DstAlign, CopyAlign);
112 Value *Src = Builder->CreateBitCast(MI->getArgOperand(1), NewSrcPtrTy);
113 Value *Dest = Builder->CreateBitCast(MI->getArgOperand(0), NewDstPtrTy);
114 LoadInst *L = Builder->CreateLoad(Src, MI->isVolatile());
115 L->setAlignment(SrcAlign);
116 StoreInst *S = Builder->CreateStore(L, Dest, MI->isVolatile());
117 S->setAlignment(DstAlign);
119 // Set the size of the copy to 0, it will be deleted on the next iteration.
120 MI->setArgOperand(2, Constant::getNullValue(MemOpLength->getType()));
124 Instruction *InstCombiner::SimplifyMemSet(MemSetInst *MI) {
125 unsigned Alignment = getKnownAlignment(MI->getDest(), TD);
126 if (MI->getAlignment() < Alignment) {
127 MI->setAlignment(ConstantInt::get(MI->getAlignmentType(),
132 // Extract the length and alignment and fill if they are constant.
133 ConstantInt *LenC = dyn_cast<ConstantInt>(MI->getLength());
134 ConstantInt *FillC = dyn_cast<ConstantInt>(MI->getValue());
135 if (!LenC || !FillC || !FillC->getType()->isIntegerTy(8))
137 uint64_t Len = LenC->getZExtValue();
138 Alignment = MI->getAlignment();
140 // If the length is zero, this is a no-op
141 if (Len == 0) return MI; // memset(d,c,0,a) -> noop
143 // memset(s,c,n) -> store s, c (for n=1,2,4,8)
144 if (Len <= 8 && isPowerOf2_32((uint32_t)Len)) {
145 const Type *ITy = IntegerType::get(MI->getContext(), Len*8); // n=1 -> i8.
147 Value *Dest = MI->getDest();
148 unsigned DstAddrSp = cast<PointerType>(Dest->getType())->getAddressSpace();
149 Type *NewDstPtrTy = PointerType::get(ITy, DstAddrSp);
150 Dest = Builder->CreateBitCast(Dest, NewDstPtrTy);
152 // Alignment 0 is identity for alignment 1 for memset, but not store.
153 if (Alignment == 0) Alignment = 1;
155 // Extract the fill value and store.
156 uint64_t Fill = FillC->getZExtValue()*0x0101010101010101ULL;
157 StoreInst *S = Builder->CreateStore(ConstantInt::get(ITy, Fill), Dest,
159 S->setAlignment(Alignment);
161 // Set the size of the copy to 0, it will be deleted on the next iteration.
162 MI->setLength(Constant::getNullValue(LenC->getType()));
169 /// visitCallInst - CallInst simplification. This mostly only handles folding
170 /// of intrinsic instructions. For normal calls, it allows visitCallSite to do
171 /// the heavy lifting.
173 Instruction *InstCombiner::visitCallInst(CallInst &CI) {
175 return visitFree(CI);
177 return visitMalloc(CI);
179 // If the caller function is nounwind, mark the call as nounwind, even if the
181 if (CI.getParent()->getParent()->doesNotThrow() &&
182 !CI.doesNotThrow()) {
183 CI.setDoesNotThrow();
187 IntrinsicInst *II = dyn_cast<IntrinsicInst>(&CI);
188 if (!II) return visitCallSite(&CI);
190 // Intrinsics cannot occur in an invoke, so handle them here instead of in
192 if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(II)) {
193 bool Changed = false;
195 // memmove/cpy/set of zero bytes is a noop.
196 if (Constant *NumBytes = dyn_cast<Constant>(MI->getLength())) {
197 if (NumBytes->isNullValue())
198 return EraseInstFromFunction(CI);
200 if (ConstantInt *CI = dyn_cast<ConstantInt>(NumBytes))
201 if (CI->getZExtValue() == 1) {
202 // Replace the instruction with just byte operations. We would
203 // transform other cases to loads/stores, but we don't know if
204 // alignment is sufficient.
208 // No other transformations apply to volatile transfers.
209 if (MI->isVolatile())
212 // If we have a memmove and the source operation is a constant global,
213 // then the source and dest pointers can't alias, so we can change this
214 // into a call to memcpy.
215 if (MemMoveInst *MMI = dyn_cast<MemMoveInst>(MI)) {
216 if (GlobalVariable *GVSrc = dyn_cast<GlobalVariable>(MMI->getSource()))
217 if (GVSrc->isConstant()) {
218 Module *M = CI.getParent()->getParent()->getParent();
219 Intrinsic::ID MemCpyID = Intrinsic::memcpy;
220 const Type *Tys[3] = { CI.getArgOperand(0)->getType(),
221 CI.getArgOperand(1)->getType(),
222 CI.getArgOperand(2)->getType() };
223 CI.setCalledFunction(Intrinsic::getDeclaration(M, MemCpyID, Tys, 3));
228 if (MemTransferInst *MTI = dyn_cast<MemTransferInst>(MI)) {
229 // memmove(x,x,size) -> noop.
230 if (MTI->getSource() == MTI->getDest())
231 return EraseInstFromFunction(CI);
234 // If we can determine a pointer alignment that is bigger than currently
235 // set, update the alignment.
236 if (isa<MemTransferInst>(MI)) {
237 if (Instruction *I = SimplifyMemTransfer(MI))
239 } else if (MemSetInst *MSI = dyn_cast<MemSetInst>(MI)) {
240 if (Instruction *I = SimplifyMemSet(MSI))
244 if (Changed) return II;
247 switch (II->getIntrinsicID()) {
249 case Intrinsic::objectsize: {
250 // We need target data for just about everything so depend on it.
253 const Type *ReturnTy = CI.getType();
254 uint64_t DontKnow = II->getArgOperand(1) == Builder->getTrue() ? 0 : -1ULL;
256 // Get to the real allocated thing and offset as fast as possible.
257 Value *Op1 = II->getArgOperand(0)->stripPointerCasts();
260 uint64_t Size = -1ULL;
262 // Try to look through constant GEPs.
263 if (GEPOperator *GEP = dyn_cast<GEPOperator>(Op1)) {
264 if (!GEP->hasAllConstantIndices()) break;
266 // Get the current byte offset into the thing. Use the original
267 // operand in case we're looking through a bitcast.
268 SmallVector<Value*, 8> Ops(GEP->idx_begin(), GEP->idx_end());
269 Offset = TD->getIndexedOffset(GEP->getPointerOperandType(),
270 Ops.data(), Ops.size());
272 Op1 = GEP->getPointerOperand()->stripPointerCasts();
274 // Make sure we're not a constant offset from an external
276 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Op1))
277 if (!GV->hasDefinitiveInitializer()) break;
280 // If we've stripped down to a single global variable that we
281 // can know the size of then just return that.
282 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Op1)) {
283 if (GV->hasDefinitiveInitializer()) {
284 Constant *C = GV->getInitializer();
285 Size = TD->getTypeAllocSize(C->getType());
287 // Can't determine size of the GV.
288 Constant *RetVal = ConstantInt::get(ReturnTy, DontKnow);
289 return ReplaceInstUsesWith(CI, RetVal);
291 } else if (AllocaInst *AI = dyn_cast<AllocaInst>(Op1)) {
293 if (AI->getAllocatedType()->isSized()) {
294 Size = TD->getTypeAllocSize(AI->getAllocatedType());
295 if (AI->isArrayAllocation()) {
296 const ConstantInt *C = dyn_cast<ConstantInt>(AI->getArraySize());
298 Size *= C->getZExtValue();
301 } else if (CallInst *MI = extractMallocCall(Op1)) {
302 // Get allocation size.
303 const Type* MallocType = getMallocAllocatedType(MI);
304 if (MallocType && MallocType->isSized())
305 if (Value *NElems = getMallocArraySize(MI, TD, true))
306 if (ConstantInt *NElements = dyn_cast<ConstantInt>(NElems))
307 Size = NElements->getZExtValue() * TD->getTypeAllocSize(MallocType);
310 // Do not return "I don't know" here. Later optimization passes could
311 // make it possible to evaluate objectsize to a constant.
316 // Out of bound reference? Negative index normalized to large
317 // index? Just return "I don't know".
318 return ReplaceInstUsesWith(CI, ConstantInt::get(ReturnTy, DontKnow));
320 return ReplaceInstUsesWith(CI, ConstantInt::get(ReturnTy, Size-Offset));
322 case Intrinsic::bswap:
323 // bswap(bswap(x)) -> x
324 if (IntrinsicInst *Operand = dyn_cast<IntrinsicInst>(II->getArgOperand(0)))
325 if (Operand->getIntrinsicID() == Intrinsic::bswap)
326 return ReplaceInstUsesWith(CI, Operand->getArgOperand(0));
328 // bswap(trunc(bswap(x))) -> trunc(lshr(x, c))
329 if (TruncInst *TI = dyn_cast<TruncInst>(II->getArgOperand(0))) {
330 if (IntrinsicInst *Operand = dyn_cast<IntrinsicInst>(TI->getOperand(0)))
331 if (Operand->getIntrinsicID() == Intrinsic::bswap) {
332 unsigned C = Operand->getType()->getPrimitiveSizeInBits() -
333 TI->getType()->getPrimitiveSizeInBits();
334 Value *CV = ConstantInt::get(Operand->getType(), C);
335 Value *V = Builder->CreateLShr(Operand->getArgOperand(0), CV);
336 return new TruncInst(V, TI->getType());
341 case Intrinsic::powi:
342 if (ConstantInt *Power = dyn_cast<ConstantInt>(II->getArgOperand(1))) {
345 return ReplaceInstUsesWith(CI, ConstantFP::get(CI.getType(), 1.0));
348 return ReplaceInstUsesWith(CI, II->getArgOperand(0));
349 // powi(x, -1) -> 1/x
350 if (Power->isAllOnesValue())
351 return BinaryOperator::CreateFDiv(ConstantFP::get(CI.getType(), 1.0),
352 II->getArgOperand(0));
355 case Intrinsic::cttz: {
356 // If all bits below the first known one are known zero,
357 // this value is constant.
358 const IntegerType *IT = cast<IntegerType>(II->getArgOperand(0)->getType());
359 uint32_t BitWidth = IT->getBitWidth();
360 APInt KnownZero(BitWidth, 0);
361 APInt KnownOne(BitWidth, 0);
362 ComputeMaskedBits(II->getArgOperand(0), APInt::getAllOnesValue(BitWidth),
363 KnownZero, KnownOne);
364 unsigned TrailingZeros = KnownOne.countTrailingZeros();
365 APInt Mask(APInt::getLowBitsSet(BitWidth, TrailingZeros));
366 if ((Mask & KnownZero) == Mask)
367 return ReplaceInstUsesWith(CI, ConstantInt::get(IT,
368 APInt(BitWidth, TrailingZeros)));
372 case Intrinsic::ctlz: {
373 // If all bits above the first known one are known zero,
374 // this value is constant.
375 const IntegerType *IT = cast<IntegerType>(II->getArgOperand(0)->getType());
376 uint32_t BitWidth = IT->getBitWidth();
377 APInt KnownZero(BitWidth, 0);
378 APInt KnownOne(BitWidth, 0);
379 ComputeMaskedBits(II->getArgOperand(0), APInt::getAllOnesValue(BitWidth),
380 KnownZero, KnownOne);
381 unsigned LeadingZeros = KnownOne.countLeadingZeros();
382 APInt Mask(APInt::getHighBitsSet(BitWidth, LeadingZeros));
383 if ((Mask & KnownZero) == Mask)
384 return ReplaceInstUsesWith(CI, ConstantInt::get(IT,
385 APInt(BitWidth, LeadingZeros)));
389 case Intrinsic::uadd_with_overflow: {
390 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1);
391 const IntegerType *IT = cast<IntegerType>(II->getArgOperand(0)->getType());
392 uint32_t BitWidth = IT->getBitWidth();
393 APInt Mask = APInt::getSignBit(BitWidth);
394 APInt LHSKnownZero(BitWidth, 0);
395 APInt LHSKnownOne(BitWidth, 0);
396 ComputeMaskedBits(LHS, Mask, LHSKnownZero, LHSKnownOne);
397 bool LHSKnownNegative = LHSKnownOne[BitWidth - 1];
398 bool LHSKnownPositive = LHSKnownZero[BitWidth - 1];
400 if (LHSKnownNegative || LHSKnownPositive) {
401 APInt RHSKnownZero(BitWidth, 0);
402 APInt RHSKnownOne(BitWidth, 0);
403 ComputeMaskedBits(RHS, Mask, RHSKnownZero, RHSKnownOne);
404 bool RHSKnownNegative = RHSKnownOne[BitWidth - 1];
405 bool RHSKnownPositive = RHSKnownZero[BitWidth - 1];
406 if (LHSKnownNegative && RHSKnownNegative) {
407 // The sign bit is set in both cases: this MUST overflow.
408 // Create a simple add instruction, and insert it into the struct.
409 Value *Add = Builder->CreateAdd(LHS, RHS);
412 UndefValue::get(LHS->getType()),
413 ConstantInt::getTrue(II->getContext())
415 Constant *Struct = ConstantStruct::get(II->getContext(), V, 2, false);
416 return InsertValueInst::Create(Struct, Add, 0);
419 if (LHSKnownPositive && RHSKnownPositive) {
420 // The sign bit is clear in both cases: this CANNOT overflow.
421 // Create a simple add instruction, and insert it into the struct.
422 Value *Add = Builder->CreateNUWAdd(LHS, RHS);
425 UndefValue::get(LHS->getType()),
426 ConstantInt::getFalse(II->getContext())
428 Constant *Struct = ConstantStruct::get(II->getContext(), V, 2, false);
429 return InsertValueInst::Create(Struct, Add, 0);
433 // FALL THROUGH uadd into sadd
434 case Intrinsic::sadd_with_overflow:
435 // Canonicalize constants into the RHS.
436 if (isa<Constant>(II->getArgOperand(0)) &&
437 !isa<Constant>(II->getArgOperand(1))) {
438 Value *LHS = II->getArgOperand(0);
439 II->setArgOperand(0, II->getArgOperand(1));
440 II->setArgOperand(1, LHS);
444 // X + undef -> undef
445 if (isa<UndefValue>(II->getArgOperand(1)))
446 return ReplaceInstUsesWith(CI, UndefValue::get(II->getType()));
448 if (ConstantInt *RHS = dyn_cast<ConstantInt>(II->getArgOperand(1))) {
449 // X + 0 -> {X, false}
452 UndefValue::get(II->getArgOperand(0)->getType()),
453 ConstantInt::getFalse(II->getContext())
455 Constant *Struct = ConstantStruct::get(II->getContext(), V, 2, false);
456 return InsertValueInst::Create(Struct, II->getArgOperand(0), 0);
460 case Intrinsic::usub_with_overflow:
461 case Intrinsic::ssub_with_overflow:
462 // undef - X -> undef
463 // X - undef -> undef
464 if (isa<UndefValue>(II->getArgOperand(0)) ||
465 isa<UndefValue>(II->getArgOperand(1)))
466 return ReplaceInstUsesWith(CI, UndefValue::get(II->getType()));
468 if (ConstantInt *RHS = dyn_cast<ConstantInt>(II->getArgOperand(1))) {
469 // X - 0 -> {X, false}
472 UndefValue::get(II->getArgOperand(0)->getType()),
473 ConstantInt::getFalse(II->getContext())
475 Constant *Struct = ConstantStruct::get(II->getContext(), V, 2, false);
476 return InsertValueInst::Create(Struct, II->getArgOperand(0), 0);
480 case Intrinsic::umul_with_overflow: {
481 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1);
482 unsigned BitWidth = cast<IntegerType>(LHS->getType())->getBitWidth();
483 APInt Mask = APInt::getAllOnesValue(BitWidth);
485 APInt LHSKnownZero(BitWidth, 0);
486 APInt LHSKnownOne(BitWidth, 0);
487 ComputeMaskedBits(LHS, Mask, LHSKnownZero, LHSKnownOne);
488 APInt RHSKnownZero(BitWidth, 0);
489 APInt RHSKnownOne(BitWidth, 0);
490 ComputeMaskedBits(RHS, Mask, RHSKnownZero, RHSKnownOne);
492 // Get the largest possible values for each operand.
493 APInt LHSMax = ~LHSKnownZero;
494 APInt RHSMax = ~RHSKnownZero;
496 // If multiplying the maximum values does not overflow then we can turn
497 // this into a plain NUW mul.
499 LHSMax.umul_ov(RHSMax, Overflow);
501 Value *Mul = Builder->CreateNUWMul(LHS, RHS, "umul_with_overflow");
503 UndefValue::get(LHS->getType()),
506 Constant *Struct = ConstantStruct::get(II->getContext(), V, 2, false);
507 return InsertValueInst::Create(Struct, Mul, 0);
510 case Intrinsic::smul_with_overflow:
511 // Canonicalize constants into the RHS.
512 if (isa<Constant>(II->getArgOperand(0)) &&
513 !isa<Constant>(II->getArgOperand(1))) {
514 Value *LHS = II->getArgOperand(0);
515 II->setArgOperand(0, II->getArgOperand(1));
516 II->setArgOperand(1, LHS);
520 // X * undef -> undef
521 if (isa<UndefValue>(II->getArgOperand(1)))
522 return ReplaceInstUsesWith(CI, UndefValue::get(II->getType()));
524 if (ConstantInt *RHSI = dyn_cast<ConstantInt>(II->getArgOperand(1))) {
527 return ReplaceInstUsesWith(CI, Constant::getNullValue(II->getType()));
529 // X * 1 -> {X, false}
530 if (RHSI->equalsInt(1)) {
532 UndefValue::get(II->getArgOperand(0)->getType()),
533 ConstantInt::getFalse(II->getContext())
535 Constant *Struct = ConstantStruct::get(II->getContext(), V, 2, false);
536 return InsertValueInst::Create(Struct, II->getArgOperand(0), 0);
540 case Intrinsic::ppc_altivec_lvx:
541 case Intrinsic::ppc_altivec_lvxl:
542 // Turn PPC lvx -> load if the pointer is known aligned.
543 if (getOrEnforceKnownAlignment(II->getArgOperand(0), 16, TD) >= 16) {
544 Value *Ptr = Builder->CreateBitCast(II->getArgOperand(0),
545 PointerType::getUnqual(II->getType()));
546 return new LoadInst(Ptr);
549 case Intrinsic::ppc_altivec_stvx:
550 case Intrinsic::ppc_altivec_stvxl:
551 // Turn stvx -> store if the pointer is known aligned.
552 if (getOrEnforceKnownAlignment(II->getArgOperand(1), 16, TD) >= 16) {
553 const Type *OpPtrTy =
554 PointerType::getUnqual(II->getArgOperand(0)->getType());
555 Value *Ptr = Builder->CreateBitCast(II->getArgOperand(1), OpPtrTy);
556 return new StoreInst(II->getArgOperand(0), Ptr);
559 case Intrinsic::x86_sse_storeu_ps:
560 case Intrinsic::x86_sse2_storeu_pd:
561 case Intrinsic::x86_sse2_storeu_dq:
562 // Turn X86 storeu -> store if the pointer is known aligned.
563 if (getOrEnforceKnownAlignment(II->getArgOperand(0), 16, TD) >= 16) {
564 const Type *OpPtrTy =
565 PointerType::getUnqual(II->getArgOperand(1)->getType());
566 Value *Ptr = Builder->CreateBitCast(II->getArgOperand(0), OpPtrTy);
567 return new StoreInst(II->getArgOperand(1), Ptr);
571 case Intrinsic::x86_sse_cvtss2si:
572 case Intrinsic::x86_sse_cvtss2si64:
573 case Intrinsic::x86_sse_cvttss2si:
574 case Intrinsic::x86_sse_cvttss2si64:
575 case Intrinsic::x86_sse2_cvtsd2si:
576 case Intrinsic::x86_sse2_cvtsd2si64:
577 case Intrinsic::x86_sse2_cvttsd2si:
578 case Intrinsic::x86_sse2_cvttsd2si64: {
579 // These intrinsics only demand the 0th element of their input vectors. If
580 // we can simplify the input based on that, do so now.
582 cast<VectorType>(II->getArgOperand(0)->getType())->getNumElements();
583 APInt DemandedElts(VWidth, 1);
584 APInt UndefElts(VWidth, 0);
585 if (Value *V = SimplifyDemandedVectorElts(II->getArgOperand(0),
586 DemandedElts, UndefElts)) {
587 II->setArgOperand(0, V);
594 case Intrinsic::x86_sse41_pmovsxbw:
595 case Intrinsic::x86_sse41_pmovsxwd:
596 case Intrinsic::x86_sse41_pmovsxdq:
597 case Intrinsic::x86_sse41_pmovzxbw:
598 case Intrinsic::x86_sse41_pmovzxwd:
599 case Intrinsic::x86_sse41_pmovzxdq: {
601 cast<VectorType>(II->getArgOperand(0)->getType())->getNumElements();
602 unsigned LowHalfElts = VWidth / 2;
603 APInt InputDemandedElts(APInt::getBitsSet(VWidth, 0, LowHalfElts));
604 APInt UndefElts(VWidth, 0);
605 if (Value *TmpV = SimplifyDemandedVectorElts(II->getArgOperand(0),
608 II->setArgOperand(0, TmpV);
614 case Intrinsic::ppc_altivec_vperm:
615 // Turn vperm(V1,V2,mask) -> shuffle(V1,V2,mask) if mask is a constant.
616 if (ConstantVector *Mask = dyn_cast<ConstantVector>(II->getArgOperand(2))) {
617 assert(Mask->getNumOperands() == 16 && "Bad type for intrinsic!");
619 // Check that all of the elements are integer constants or undefs.
620 bool AllEltsOk = true;
621 for (unsigned i = 0; i != 16; ++i) {
622 if (!isa<ConstantInt>(Mask->getOperand(i)) &&
623 !isa<UndefValue>(Mask->getOperand(i))) {
630 // Cast the input vectors to byte vectors.
631 Value *Op0 = Builder->CreateBitCast(II->getArgOperand(0),
633 Value *Op1 = Builder->CreateBitCast(II->getArgOperand(1),
635 Value *Result = UndefValue::get(Op0->getType());
637 // Only extract each element once.
638 Value *ExtractedElts[32];
639 memset(ExtractedElts, 0, sizeof(ExtractedElts));
641 for (unsigned i = 0; i != 16; ++i) {
642 if (isa<UndefValue>(Mask->getOperand(i)))
644 unsigned Idx=cast<ConstantInt>(Mask->getOperand(i))->getZExtValue();
645 Idx &= 31; // Match the hardware behavior.
647 if (ExtractedElts[Idx] == 0) {
649 Builder->CreateExtractElement(Idx < 16 ? Op0 : Op1,
650 ConstantInt::get(Type::getInt32Ty(II->getContext()),
651 Idx&15, false), "tmp");
654 // Insert this value into the result vector.
655 Result = Builder->CreateInsertElement(Result, ExtractedElts[Idx],
656 ConstantInt::get(Type::getInt32Ty(II->getContext()),
659 return CastInst::Create(Instruction::BitCast, Result, CI.getType());
664 case Intrinsic::arm_neon_vld1:
665 case Intrinsic::arm_neon_vld2:
666 case Intrinsic::arm_neon_vld3:
667 case Intrinsic::arm_neon_vld4:
668 case Intrinsic::arm_neon_vld2lane:
669 case Intrinsic::arm_neon_vld3lane:
670 case Intrinsic::arm_neon_vld4lane:
671 case Intrinsic::arm_neon_vst1:
672 case Intrinsic::arm_neon_vst2:
673 case Intrinsic::arm_neon_vst3:
674 case Intrinsic::arm_neon_vst4:
675 case Intrinsic::arm_neon_vst2lane:
676 case Intrinsic::arm_neon_vst3lane:
677 case Intrinsic::arm_neon_vst4lane: {
678 unsigned MemAlign = getKnownAlignment(II->getArgOperand(0), TD);
679 unsigned AlignArg = II->getNumArgOperands() - 1;
680 ConstantInt *IntrAlign = dyn_cast<ConstantInt>(II->getArgOperand(AlignArg));
681 if (IntrAlign && IntrAlign->getZExtValue() < MemAlign) {
682 II->setArgOperand(AlignArg,
683 ConstantInt::get(Type::getInt32Ty(II->getContext()),
690 case Intrinsic::stackrestore: {
691 // If the save is right next to the restore, remove the restore. This can
692 // happen when variable allocas are DCE'd.
693 if (IntrinsicInst *SS = dyn_cast<IntrinsicInst>(II->getArgOperand(0))) {
694 if (SS->getIntrinsicID() == Intrinsic::stacksave) {
695 BasicBlock::iterator BI = SS;
697 return EraseInstFromFunction(CI);
701 // Scan down this block to see if there is another stack restore in the
702 // same block without an intervening call/alloca.
703 BasicBlock::iterator BI = II;
704 TerminatorInst *TI = II->getParent()->getTerminator();
705 bool CannotRemove = false;
706 for (++BI; &*BI != TI; ++BI) {
707 if (isa<AllocaInst>(BI) || isMalloc(BI)) {
711 if (CallInst *BCI = dyn_cast<CallInst>(BI)) {
712 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(BCI)) {
713 // If there is a stackrestore below this one, remove this one.
714 if (II->getIntrinsicID() == Intrinsic::stackrestore)
715 return EraseInstFromFunction(CI);
716 // Otherwise, ignore the intrinsic.
718 // If we found a non-intrinsic call, we can't remove the stack
726 // If the stack restore is in a return/unwind block and if there are no
727 // allocas or calls between the restore and the return, nuke the restore.
728 if (!CannotRemove && (isa<ReturnInst>(TI) || isa<UnwindInst>(TI)))
729 return EraseInstFromFunction(CI);
734 return visitCallSite(II);
737 // InvokeInst simplification
739 Instruction *InstCombiner::visitInvokeInst(InvokeInst &II) {
740 return visitCallSite(&II);
743 /// isSafeToEliminateVarargsCast - If this cast does not affect the value
744 /// passed through the varargs area, we can eliminate the use of the cast.
745 static bool isSafeToEliminateVarargsCast(const CallSite CS,
746 const CastInst * const CI,
747 const TargetData * const TD,
749 if (!CI->isLosslessCast())
752 // The size of ByVal arguments is derived from the type, so we
753 // can't change to a type with a different size. If the size were
754 // passed explicitly we could avoid this check.
755 if (!CS.paramHasAttr(ix, Attribute::ByVal))
759 cast<PointerType>(CI->getOperand(0)->getType())->getElementType();
760 const Type* DstTy = cast<PointerType>(CI->getType())->getElementType();
761 if (!SrcTy->isSized() || !DstTy->isSized())
763 if (!TD || TD->getTypeAllocSize(SrcTy) != TD->getTypeAllocSize(DstTy))
769 class InstCombineFortifiedLibCalls : public SimplifyFortifiedLibCalls {
772 void replaceCall(Value *With) {
773 NewInstruction = IC->ReplaceInstUsesWith(*CI, With);
775 bool isFoldable(unsigned SizeCIOp, unsigned SizeArgOp, bool isString) const {
776 if (CI->getArgOperand(SizeCIOp) == CI->getArgOperand(SizeArgOp))
778 if (ConstantInt *SizeCI =
779 dyn_cast<ConstantInt>(CI->getArgOperand(SizeCIOp))) {
780 if (SizeCI->isAllOnesValue())
783 uint64_t Len = GetStringLength(CI->getArgOperand(SizeArgOp));
784 // If the length is 0 we don't know how long it is and so we can't
786 if (Len == 0) return false;
787 return SizeCI->getZExtValue() >= Len;
789 if (ConstantInt *Arg = dyn_cast<ConstantInt>(
790 CI->getArgOperand(SizeArgOp)))
791 return SizeCI->getZExtValue() >= Arg->getZExtValue();
796 InstCombineFortifiedLibCalls(InstCombiner *IC) : IC(IC), NewInstruction(0) { }
797 Instruction *NewInstruction;
799 } // end anonymous namespace
801 // Try to fold some different type of calls here.
802 // Currently we're only working with the checking functions, memcpy_chk,
803 // mempcpy_chk, memmove_chk, memset_chk, strcpy_chk, stpcpy_chk, strncpy_chk,
804 // strcat_chk and strncat_chk.
805 Instruction *InstCombiner::tryOptimizeCall(CallInst *CI, const TargetData *TD) {
806 if (CI->getCalledFunction() == 0) return 0;
808 InstCombineFortifiedLibCalls Simplifier(this);
809 Simplifier.fold(CI, TD);
810 return Simplifier.NewInstruction;
813 // visitCallSite - Improvements for call and invoke instructions.
815 Instruction *InstCombiner::visitCallSite(CallSite CS) {
816 bool Changed = false;
818 // If the callee is a pointer to a function, attempt to move any casts to the
819 // arguments of the call/invoke.
820 Value *Callee = CS.getCalledValue();
821 if (!isa<Function>(Callee) && transformConstExprCastCall(CS))
824 if (Function *CalleeF = dyn_cast<Function>(Callee))
825 // If the call and callee calling conventions don't match, this call must
826 // be unreachable, as the call is undefined.
827 if (CalleeF->getCallingConv() != CS.getCallingConv() &&
828 // Only do this for calls to a function with a body. A prototype may
829 // not actually end up matching the implementation's calling conv for a
830 // variety of reasons (e.g. it may be written in assembly).
831 !CalleeF->isDeclaration()) {
832 Instruction *OldCall = CS.getInstruction();
833 new StoreInst(ConstantInt::getTrue(Callee->getContext()),
834 UndefValue::get(Type::getInt1PtrTy(Callee->getContext())),
836 // If OldCall dues not return void then replaceAllUsesWith undef.
837 // This allows ValueHandlers and custom metadata to adjust itself.
838 if (!OldCall->getType()->isVoidTy())
839 ReplaceInstUsesWith(*OldCall, UndefValue::get(OldCall->getType()));
840 if (isa<CallInst>(OldCall))
841 return EraseInstFromFunction(*OldCall);
843 // We cannot remove an invoke, because it would change the CFG, just
844 // change the callee to a null pointer.
845 cast<InvokeInst>(OldCall)->setCalledFunction(
846 Constant::getNullValue(CalleeF->getType()));
850 if (isa<ConstantPointerNull>(Callee) || isa<UndefValue>(Callee)) {
851 // This instruction is not reachable, just remove it. We insert a store to
852 // undef so that we know that this code is not reachable, despite the fact
853 // that we can't modify the CFG here.
854 new StoreInst(ConstantInt::getTrue(Callee->getContext()),
855 UndefValue::get(Type::getInt1PtrTy(Callee->getContext())),
856 CS.getInstruction());
858 // If CS does not return void then replaceAllUsesWith undef.
859 // This allows ValueHandlers and custom metadata to adjust itself.
860 if (!CS.getInstruction()->getType()->isVoidTy())
861 ReplaceInstUsesWith(*CS.getInstruction(),
862 UndefValue::get(CS.getInstruction()->getType()));
864 if (InvokeInst *II = dyn_cast<InvokeInst>(CS.getInstruction())) {
865 // Don't break the CFG, insert a dummy cond branch.
866 BranchInst::Create(II->getNormalDest(), II->getUnwindDest(),
867 ConstantInt::getTrue(Callee->getContext()), II);
869 return EraseInstFromFunction(*CS.getInstruction());
872 if (BitCastInst *BC = dyn_cast<BitCastInst>(Callee))
873 if (IntrinsicInst *In = dyn_cast<IntrinsicInst>(BC->getOperand(0)))
874 if (In->getIntrinsicID() == Intrinsic::init_trampoline)
875 return transformCallThroughTrampoline(CS);
877 const PointerType *PTy = cast<PointerType>(Callee->getType());
878 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
879 if (FTy->isVarArg()) {
880 int ix = FTy->getNumParams() + (isa<InvokeInst>(Callee) ? 3 : 1);
881 // See if we can optimize any arguments passed through the varargs area of
883 for (CallSite::arg_iterator I = CS.arg_begin()+FTy->getNumParams(),
884 E = CS.arg_end(); I != E; ++I, ++ix) {
885 CastInst *CI = dyn_cast<CastInst>(*I);
886 if (CI && isSafeToEliminateVarargsCast(CS, CI, TD, ix)) {
887 *I = CI->getOperand(0);
893 if (isa<InlineAsm>(Callee) && !CS.doesNotThrow()) {
894 // Inline asm calls cannot throw - mark them 'nounwind'.
895 CS.setDoesNotThrow();
899 // Try to optimize the call if possible, we require TargetData for most of
900 // this. None of these calls are seen as possibly dead so go ahead and
901 // delete the instruction now.
902 if (CallInst *CI = dyn_cast<CallInst>(CS.getInstruction())) {
903 Instruction *I = tryOptimizeCall(CI, TD);
904 // If we changed something return the result, etc. Otherwise let
905 // the fallthrough check.
906 if (I) return EraseInstFromFunction(*I);
909 return Changed ? CS.getInstruction() : 0;
912 // transformConstExprCastCall - If the callee is a constexpr cast of a function,
913 // attempt to move the cast to the arguments of the call/invoke.
915 bool InstCombiner::transformConstExprCastCall(CallSite CS) {
917 dyn_cast<Function>(CS.getCalledValue()->stripPointerCasts());
920 Instruction *Caller = CS.getInstruction();
921 const AttrListPtr &CallerPAL = CS.getAttributes();
923 // Okay, this is a cast from a function to a different type. Unless doing so
924 // would cause a type conversion of one of our arguments, change this call to
925 // be a direct call with arguments casted to the appropriate types.
927 const FunctionType *FT = Callee->getFunctionType();
928 const Type *OldRetTy = Caller->getType();
929 const Type *NewRetTy = FT->getReturnType();
931 if (NewRetTy->isStructTy())
932 return false; // TODO: Handle multiple return values.
934 // Check to see if we are changing the return type...
935 if (OldRetTy != NewRetTy) {
936 if (Callee->isDeclaration() &&
937 // Conversion is ok if changing from one pointer type to another or from
938 // a pointer to an integer of the same size.
939 !((OldRetTy->isPointerTy() || !TD ||
940 OldRetTy == TD->getIntPtrType(Caller->getContext())) &&
941 (NewRetTy->isPointerTy() || !TD ||
942 NewRetTy == TD->getIntPtrType(Caller->getContext()))))
943 return false; // Cannot transform this return value.
945 if (!Caller->use_empty() &&
946 // void -> non-void is handled specially
947 !NewRetTy->isVoidTy() && !CastInst::isCastable(NewRetTy, OldRetTy))
948 return false; // Cannot transform this return value.
950 if (!CallerPAL.isEmpty() && !Caller->use_empty()) {
951 Attributes RAttrs = CallerPAL.getRetAttributes();
952 if (RAttrs & Attribute::typeIncompatible(NewRetTy))
953 return false; // Attribute not compatible with transformed value.
956 // If the callsite is an invoke instruction, and the return value is used by
957 // a PHI node in a successor, we cannot change the return type of the call
958 // because there is no place to put the cast instruction (without breaking
959 // the critical edge). Bail out in this case.
960 if (!Caller->use_empty())
961 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller))
962 for (Value::use_iterator UI = II->use_begin(), E = II->use_end();
964 if (PHINode *PN = dyn_cast<PHINode>(*UI))
965 if (PN->getParent() == II->getNormalDest() ||
966 PN->getParent() == II->getUnwindDest())
970 unsigned NumActualArgs = unsigned(CS.arg_end()-CS.arg_begin());
971 unsigned NumCommonArgs = std::min(FT->getNumParams(), NumActualArgs);
973 CallSite::arg_iterator AI = CS.arg_begin();
974 for (unsigned i = 0, e = NumCommonArgs; i != e; ++i, ++AI) {
975 const Type *ParamTy = FT->getParamType(i);
976 const Type *ActTy = (*AI)->getType();
978 if (!CastInst::isCastable(ActTy, ParamTy))
979 return false; // Cannot transform this parameter value.
981 unsigned Attrs = CallerPAL.getParamAttributes(i + 1);
982 if (Attrs & Attribute::typeIncompatible(ParamTy))
983 return false; // Attribute not compatible with transformed value.
985 // If the parameter is passed as a byval argument, then we have to have a
986 // sized type and the sized type has to have the same size as the old type.
987 if (ParamTy != ActTy && (Attrs & Attribute::ByVal)) {
988 const PointerType *ParamPTy = dyn_cast<PointerType>(ParamTy);
989 if (ParamPTy == 0 || !ParamPTy->getElementType()->isSized() || TD == 0)
992 const Type *CurElTy = cast<PointerType>(ActTy)->getElementType();
993 if (TD->getTypeAllocSize(CurElTy) !=
994 TD->getTypeAllocSize(ParamPTy->getElementType()))
998 // Converting from one pointer type to another or between a pointer and an
999 // integer of the same size is safe even if we do not have a body.
1000 bool isConvertible = ActTy == ParamTy ||
1001 (TD && ((ParamTy->isPointerTy() ||
1002 ParamTy == TD->getIntPtrType(Caller->getContext())) &&
1003 (ActTy->isPointerTy() ||
1004 ActTy == TD->getIntPtrType(Caller->getContext()))));
1005 if (Callee->isDeclaration() && !isConvertible) return false;
1008 if (Callee->isDeclaration()) {
1009 // Do not delete arguments unless we have a function body.
1010 if (FT->getNumParams() < NumActualArgs && !FT->isVarArg())
1013 // If the callee is just a declaration, don't change the varargsness of the
1014 // call. We don't want to introduce a varargs call where one doesn't
1016 const PointerType *APTy = cast<PointerType>(CS.getCalledValue()->getType());
1017 if (FT->isVarArg()!=cast<FunctionType>(APTy->getElementType())->isVarArg())
1021 if (FT->getNumParams() < NumActualArgs && FT->isVarArg() &&
1022 !CallerPAL.isEmpty())
1023 // In this case we have more arguments than the new function type, but we
1024 // won't be dropping them. Check that these extra arguments have attributes
1025 // that are compatible with being a vararg call argument.
1026 for (unsigned i = CallerPAL.getNumSlots(); i; --i) {
1027 if (CallerPAL.getSlot(i - 1).Index <= FT->getNumParams())
1029 Attributes PAttrs = CallerPAL.getSlot(i - 1).Attrs;
1030 if (PAttrs & Attribute::VarArgsIncompatible)
1035 // Okay, we decided that this is a safe thing to do: go ahead and start
1036 // inserting cast instructions as necessary.
1037 std::vector<Value*> Args;
1038 Args.reserve(NumActualArgs);
1039 SmallVector<AttributeWithIndex, 8> attrVec;
1040 attrVec.reserve(NumCommonArgs);
1042 // Get any return attributes.
1043 Attributes RAttrs = CallerPAL.getRetAttributes();
1045 // If the return value is not being used, the type may not be compatible
1046 // with the existing attributes. Wipe out any problematic attributes.
1047 RAttrs &= ~Attribute::typeIncompatible(NewRetTy);
1049 // Add the new return attributes.
1051 attrVec.push_back(AttributeWithIndex::get(0, RAttrs));
1053 AI = CS.arg_begin();
1054 for (unsigned i = 0; i != NumCommonArgs; ++i, ++AI) {
1055 const Type *ParamTy = FT->getParamType(i);
1056 if ((*AI)->getType() == ParamTy) {
1057 Args.push_back(*AI);
1059 Instruction::CastOps opcode = CastInst::getCastOpcode(*AI,
1060 false, ParamTy, false);
1061 Args.push_back(Builder->CreateCast(opcode, *AI, ParamTy, "tmp"));
1064 // Add any parameter attributes.
1065 if (Attributes PAttrs = CallerPAL.getParamAttributes(i + 1))
1066 attrVec.push_back(AttributeWithIndex::get(i + 1, PAttrs));
1069 // If the function takes more arguments than the call was taking, add them
1071 for (unsigned i = NumCommonArgs; i != FT->getNumParams(); ++i)
1072 Args.push_back(Constant::getNullValue(FT->getParamType(i)));
1074 // If we are removing arguments to the function, emit an obnoxious warning.
1075 if (FT->getNumParams() < NumActualArgs) {
1076 if (!FT->isVarArg()) {
1077 errs() << "WARNING: While resolving call to function '"
1078 << Callee->getName() << "' arguments were dropped!\n";
1080 // Add all of the arguments in their promoted form to the arg list.
1081 for (unsigned i = FT->getNumParams(); i != NumActualArgs; ++i, ++AI) {
1082 const Type *PTy = getPromotedType((*AI)->getType());
1083 if (PTy != (*AI)->getType()) {
1084 // Must promote to pass through va_arg area!
1085 Instruction::CastOps opcode =
1086 CastInst::getCastOpcode(*AI, false, PTy, false);
1087 Args.push_back(Builder->CreateCast(opcode, *AI, PTy, "tmp"));
1089 Args.push_back(*AI);
1092 // Add any parameter attributes.
1093 if (Attributes PAttrs = CallerPAL.getParamAttributes(i + 1))
1094 attrVec.push_back(AttributeWithIndex::get(i + 1, PAttrs));
1099 if (Attributes FnAttrs = CallerPAL.getFnAttributes())
1100 attrVec.push_back(AttributeWithIndex::get(~0, FnAttrs));
1102 if (NewRetTy->isVoidTy())
1103 Caller->setName(""); // Void type should not have a name.
1105 const AttrListPtr &NewCallerPAL = AttrListPtr::get(attrVec.begin(),
1109 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
1110 NC = Builder->CreateInvoke(Callee, II->getNormalDest(),
1111 II->getUnwindDest(), Args.begin(), Args.end());
1113 cast<InvokeInst>(NC)->setCallingConv(II->getCallingConv());
1114 cast<InvokeInst>(NC)->setAttributes(NewCallerPAL);
1116 CallInst *CI = cast<CallInst>(Caller);
1117 NC = Builder->CreateCall(Callee, Args.begin(), Args.end());
1119 if (CI->isTailCall())
1120 cast<CallInst>(NC)->setTailCall();
1121 cast<CallInst>(NC)->setCallingConv(CI->getCallingConv());
1122 cast<CallInst>(NC)->setAttributes(NewCallerPAL);
1125 // Insert a cast of the return type as necessary.
1127 if (OldRetTy != NV->getType() && !Caller->use_empty()) {
1128 if (!NV->getType()->isVoidTy()) {
1129 Instruction::CastOps opcode =
1130 CastInst::getCastOpcode(NC, false, OldRetTy, false);
1131 NV = NC = CastInst::Create(opcode, NC, OldRetTy, "tmp");
1133 // If this is an invoke instruction, we should insert it after the first
1134 // non-phi, instruction in the normal successor block.
1135 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
1136 BasicBlock::iterator I = II->getNormalDest()->getFirstNonPHI();
1137 InsertNewInstBefore(NC, *I);
1139 // Otherwise, it's a call, just insert cast right after the call.
1140 InsertNewInstBefore(NC, *Caller);
1142 Worklist.AddUsersToWorkList(*Caller);
1144 NV = UndefValue::get(Caller->getType());
1148 if (!Caller->use_empty())
1149 ReplaceInstUsesWith(*Caller, NV);
1151 EraseInstFromFunction(*Caller);
1155 // transformCallThroughTrampoline - Turn a call to a function created by the
1156 // init_trampoline intrinsic into a direct call to the underlying function.
1158 Instruction *InstCombiner::transformCallThroughTrampoline(CallSite CS) {
1159 Value *Callee = CS.getCalledValue();
1160 const PointerType *PTy = cast<PointerType>(Callee->getType());
1161 const FunctionType *FTy = cast<FunctionType>(PTy->getElementType());
1162 const AttrListPtr &Attrs = CS.getAttributes();
1164 // If the call already has the 'nest' attribute somewhere then give up -
1165 // otherwise 'nest' would occur twice after splicing in the chain.
1166 if (Attrs.hasAttrSomewhere(Attribute::Nest))
1169 IntrinsicInst *Tramp =
1170 cast<IntrinsicInst>(cast<BitCastInst>(Callee)->getOperand(0));
1172 Function *NestF =cast<Function>(Tramp->getArgOperand(1)->stripPointerCasts());
1173 const PointerType *NestFPTy = cast<PointerType>(NestF->getType());
1174 const FunctionType *NestFTy = cast<FunctionType>(NestFPTy->getElementType());
1176 const AttrListPtr &NestAttrs = NestF->getAttributes();
1177 if (!NestAttrs.isEmpty()) {
1178 unsigned NestIdx = 1;
1179 const Type *NestTy = 0;
1180 Attributes NestAttr = Attribute::None;
1182 // Look for a parameter marked with the 'nest' attribute.
1183 for (FunctionType::param_iterator I = NestFTy->param_begin(),
1184 E = NestFTy->param_end(); I != E; ++NestIdx, ++I)
1185 if (NestAttrs.paramHasAttr(NestIdx, Attribute::Nest)) {
1186 // Record the parameter type and any other attributes.
1188 NestAttr = NestAttrs.getParamAttributes(NestIdx);
1193 Instruction *Caller = CS.getInstruction();
1194 std::vector<Value*> NewArgs;
1195 NewArgs.reserve(unsigned(CS.arg_end()-CS.arg_begin())+1);
1197 SmallVector<AttributeWithIndex, 8> NewAttrs;
1198 NewAttrs.reserve(Attrs.getNumSlots() + 1);
1200 // Insert the nest argument into the call argument list, which may
1201 // mean appending it. Likewise for attributes.
1203 // Add any result attributes.
1204 if (Attributes Attr = Attrs.getRetAttributes())
1205 NewAttrs.push_back(AttributeWithIndex::get(0, Attr));
1209 CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end();
1211 if (Idx == NestIdx) {
1212 // Add the chain argument and attributes.
1213 Value *NestVal = Tramp->getArgOperand(2);
1214 if (NestVal->getType() != NestTy)
1215 NestVal = Builder->CreateBitCast(NestVal, NestTy, "nest");
1216 NewArgs.push_back(NestVal);
1217 NewAttrs.push_back(AttributeWithIndex::get(NestIdx, NestAttr));
1223 // Add the original argument and attributes.
1224 NewArgs.push_back(*I);
1225 if (Attributes Attr = Attrs.getParamAttributes(Idx))
1227 (AttributeWithIndex::get(Idx + (Idx >= NestIdx), Attr));
1233 // Add any function attributes.
1234 if (Attributes Attr = Attrs.getFnAttributes())
1235 NewAttrs.push_back(AttributeWithIndex::get(~0, Attr));
1237 // The trampoline may have been bitcast to a bogus type (FTy).
1238 // Handle this by synthesizing a new function type, equal to FTy
1239 // with the chain parameter inserted.
1241 std::vector<const Type*> NewTypes;
1242 NewTypes.reserve(FTy->getNumParams()+1);
1244 // Insert the chain's type into the list of parameter types, which may
1245 // mean appending it.
1248 FunctionType::param_iterator I = FTy->param_begin(),
1249 E = FTy->param_end();
1253 // Add the chain's type.
1254 NewTypes.push_back(NestTy);
1259 // Add the original type.
1260 NewTypes.push_back(*I);
1266 // Replace the trampoline call with a direct call. Let the generic
1267 // code sort out any function type mismatches.
1268 FunctionType *NewFTy = FunctionType::get(FTy->getReturnType(), NewTypes,
1270 Constant *NewCallee =
1271 NestF->getType() == PointerType::getUnqual(NewFTy) ?
1272 NestF : ConstantExpr::getBitCast(NestF,
1273 PointerType::getUnqual(NewFTy));
1274 const AttrListPtr &NewPAL = AttrListPtr::get(NewAttrs.begin(),
1277 Instruction *NewCaller;
1278 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
1279 NewCaller = InvokeInst::Create(NewCallee,
1280 II->getNormalDest(), II->getUnwindDest(),
1281 NewArgs.begin(), NewArgs.end());
1282 cast<InvokeInst>(NewCaller)->setCallingConv(II->getCallingConv());
1283 cast<InvokeInst>(NewCaller)->setAttributes(NewPAL);
1285 NewCaller = CallInst::Create(NewCallee, NewArgs.begin(), NewArgs.end());
1286 if (cast<CallInst>(Caller)->isTailCall())
1287 cast<CallInst>(NewCaller)->setTailCall();
1288 cast<CallInst>(NewCaller)->
1289 setCallingConv(cast<CallInst>(Caller)->getCallingConv());
1290 cast<CallInst>(NewCaller)->setAttributes(NewPAL);
1297 // Replace the trampoline call with a direct call. Since there is no 'nest'
1298 // parameter, there is no need to adjust the argument list. Let the generic
1299 // code sort out any function type mismatches.
1300 Constant *NewCallee =
1301 NestF->getType() == PTy ? NestF :
1302 ConstantExpr::getBitCast(NestF, PTy);
1303 CS.setCalledFunction(NewCallee);
1304 return CS.getInstruction();