1 //===-- Instructions.cpp - Implement the LLVM instructions ----------------===//
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 all of the non-inline methods for the LLVM instruction
13 //===----------------------------------------------------------------------===//
15 #include "llvm/IR/Instructions.h"
16 #include "LLVMContextImpl.h"
17 #include "llvm/IR/CallSite.h"
18 #include "llvm/IR/ConstantRange.h"
19 #include "llvm/IR/Constants.h"
20 #include "llvm/IR/DataLayout.h"
21 #include "llvm/IR/DerivedTypes.h"
22 #include "llvm/IR/Function.h"
23 #include "llvm/IR/Module.h"
24 #include "llvm/IR/Operator.h"
25 #include "llvm/Support/ErrorHandling.h"
26 #include "llvm/Support/MathExtras.h"
29 //===----------------------------------------------------------------------===//
31 //===----------------------------------------------------------------------===//
33 User::op_iterator CallSite::getCallee() const {
34 Instruction *II(getInstruction());
36 ? cast<CallInst>(II)->op_end() - 1 // Skip Callee
37 : cast<InvokeInst>(II)->op_end() - 3; // Skip BB, BB, Callee
40 //===----------------------------------------------------------------------===//
41 // TerminatorInst Class
42 //===----------------------------------------------------------------------===//
44 // Out of line virtual method, so the vtable, etc has a home.
45 TerminatorInst::~TerminatorInst() {
48 //===----------------------------------------------------------------------===//
49 // UnaryInstruction Class
50 //===----------------------------------------------------------------------===//
52 // Out of line virtual method, so the vtable, etc has a home.
53 UnaryInstruction::~UnaryInstruction() {
56 //===----------------------------------------------------------------------===//
58 //===----------------------------------------------------------------------===//
60 /// areInvalidOperands - Return a string if the specified operands are invalid
61 /// for a select operation, otherwise return null.
62 const char *SelectInst::areInvalidOperands(Value *Op0, Value *Op1, Value *Op2) {
63 if (Op1->getType() != Op2->getType())
64 return "both values to select must have same type";
66 if (VectorType *VT = dyn_cast<VectorType>(Op0->getType())) {
68 if (VT->getElementType() != Type::getInt1Ty(Op0->getContext()))
69 return "vector select condition element type must be i1";
70 VectorType *ET = dyn_cast<VectorType>(Op1->getType());
72 return "selected values for vector select must be vectors";
73 if (ET->getNumElements() != VT->getNumElements())
74 return "vector select requires selected vectors to have "
75 "the same vector length as select condition";
76 } else if (Op0->getType() != Type::getInt1Ty(Op0->getContext())) {
77 return "select condition must be i1 or <n x i1>";
83 //===----------------------------------------------------------------------===//
85 //===----------------------------------------------------------------------===//
87 PHINode::PHINode(const PHINode &PN)
88 : Instruction(PN.getType(), Instruction::PHI,
89 allocHungoffUses(PN.getNumOperands()), PN.getNumOperands()),
90 ReservedSpace(PN.getNumOperands()) {
91 std::copy(PN.op_begin(), PN.op_end(), op_begin());
92 std::copy(PN.block_begin(), PN.block_end(), block_begin());
93 SubclassOptionalData = PN.SubclassOptionalData;
100 Use *PHINode::allocHungoffUses(unsigned N) const {
101 // Allocate the array of Uses of the incoming values, followed by a pointer
102 // (with bottom bit set) to the User, followed by the array of pointers to
103 // the incoming basic blocks.
104 size_t size = N * sizeof(Use) + sizeof(Use::UserRef)
105 + N * sizeof(BasicBlock*);
106 Use *Begin = static_cast<Use*>(::operator new(size));
107 Use *End = Begin + N;
108 (void) new(End) Use::UserRef(const_cast<PHINode*>(this), 1);
109 return Use::initTags(Begin, End);
112 // removeIncomingValue - Remove an incoming value. This is useful if a
113 // predecessor basic block is deleted.
114 Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
115 Value *Removed = getIncomingValue(Idx);
117 // Move everything after this operand down.
119 // FIXME: we could just swap with the end of the list, then erase. However,
120 // clients might not expect this to happen. The code as it is thrashes the
121 // use/def lists, which is kinda lame.
122 std::copy(op_begin() + Idx + 1, op_end(), op_begin() + Idx);
123 std::copy(block_begin() + Idx + 1, block_end(), block_begin() + Idx);
125 // Nuke the last value.
126 Op<-1>().set(nullptr);
129 // If the PHI node is dead, because it has zero entries, nuke it now.
130 if (getNumOperands() == 0 && DeletePHIIfEmpty) {
131 // If anyone is using this PHI, make them use a dummy value instead...
132 replaceAllUsesWith(UndefValue::get(getType()));
138 /// growOperands - grow operands - This grows the operand list in response
139 /// to a push_back style of operation. This grows the number of ops by 1.5
142 void PHINode::growOperands() {
143 unsigned e = getNumOperands();
144 unsigned NumOps = e + e / 2;
145 if (NumOps < 2) NumOps = 2; // 2 op PHI nodes are VERY common.
147 Use *OldOps = op_begin();
148 BasicBlock **OldBlocks = block_begin();
150 ReservedSpace = NumOps;
151 OperandList = allocHungoffUses(ReservedSpace);
153 std::copy(OldOps, OldOps + e, op_begin());
154 std::copy(OldBlocks, OldBlocks + e, block_begin());
156 Use::zap(OldOps, OldOps + e, true);
159 /// hasConstantValue - If the specified PHI node always merges together the same
160 /// value, return the value, otherwise return null.
161 Value *PHINode::hasConstantValue() const {
162 // Exploit the fact that phi nodes always have at least one entry.
163 Value *ConstantValue = getIncomingValue(0);
164 for (unsigned i = 1, e = getNumIncomingValues(); i != e; ++i)
165 if (getIncomingValue(i) != ConstantValue && getIncomingValue(i) != this) {
166 if (ConstantValue != this)
167 return nullptr; // Incoming values not all the same.
168 // The case where the first value is this PHI.
169 ConstantValue = getIncomingValue(i);
171 if (ConstantValue == this)
172 return UndefValue::get(getType());
173 return ConstantValue;
176 //===----------------------------------------------------------------------===//
177 // LandingPadInst Implementation
178 //===----------------------------------------------------------------------===//
180 LandingPadInst::LandingPadInst(Type *RetTy, Value *PersonalityFn,
181 unsigned NumReservedValues, const Twine &NameStr,
182 Instruction *InsertBefore)
183 : Instruction(RetTy, Instruction::LandingPad, nullptr, 0, InsertBefore) {
184 init(PersonalityFn, 1 + NumReservedValues, NameStr);
187 LandingPadInst::LandingPadInst(Type *RetTy, Value *PersonalityFn,
188 unsigned NumReservedValues, const Twine &NameStr,
189 BasicBlock *InsertAtEnd)
190 : Instruction(RetTy, Instruction::LandingPad, nullptr, 0, InsertAtEnd) {
191 init(PersonalityFn, 1 + NumReservedValues, NameStr);
194 LandingPadInst::LandingPadInst(const LandingPadInst &LP)
195 : Instruction(LP.getType(), Instruction::LandingPad,
196 allocHungoffUses(LP.getNumOperands()), LP.getNumOperands()),
197 ReservedSpace(LP.getNumOperands()) {
198 Use *OL = OperandList, *InOL = LP.OperandList;
199 for (unsigned I = 0, E = ReservedSpace; I != E; ++I)
202 setCleanup(LP.isCleanup());
205 LandingPadInst::~LandingPadInst() {
209 LandingPadInst *LandingPadInst::Create(Type *RetTy, Value *PersonalityFn,
210 unsigned NumReservedClauses,
211 const Twine &NameStr,
212 Instruction *InsertBefore) {
213 return new LandingPadInst(RetTy, PersonalityFn, NumReservedClauses, NameStr,
217 LandingPadInst *LandingPadInst::Create(Type *RetTy, Value *PersonalityFn,
218 unsigned NumReservedClauses,
219 const Twine &NameStr,
220 BasicBlock *InsertAtEnd) {
221 return new LandingPadInst(RetTy, PersonalityFn, NumReservedClauses, NameStr,
225 void LandingPadInst::init(Value *PersFn, unsigned NumReservedValues,
226 const Twine &NameStr) {
227 ReservedSpace = NumReservedValues;
229 OperandList = allocHungoffUses(ReservedSpace);
230 OperandList[0] = PersFn;
235 /// growOperands - grow operands - This grows the operand list in response to a
236 /// push_back style of operation. This grows the number of ops by 2 times.
237 void LandingPadInst::growOperands(unsigned Size) {
238 unsigned e = getNumOperands();
239 if (ReservedSpace >= e + Size) return;
240 ReservedSpace = (e + Size / 2) * 2;
242 Use *NewOps = allocHungoffUses(ReservedSpace);
243 Use *OldOps = OperandList;
244 for (unsigned i = 0; i != e; ++i)
245 NewOps[i] = OldOps[i];
247 OperandList = NewOps;
248 Use::zap(OldOps, OldOps + e, true);
251 void LandingPadInst::addClause(Constant *Val) {
252 unsigned OpNo = getNumOperands();
254 assert(OpNo < ReservedSpace && "Growing didn't work!");
256 OperandList[OpNo] = Val;
259 //===----------------------------------------------------------------------===//
260 // CallInst Implementation
261 //===----------------------------------------------------------------------===//
263 CallInst::~CallInst() {
266 void CallInst::init(Value *Func, ArrayRef<Value *> Args, const Twine &NameStr) {
267 assert(NumOperands == Args.size() + 1 && "NumOperands not set up?");
272 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
274 assert((Args.size() == FTy->getNumParams() ||
275 (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&
276 "Calling a function with bad signature!");
278 for (unsigned i = 0; i != Args.size(); ++i)
279 assert((i >= FTy->getNumParams() ||
280 FTy->getParamType(i) == Args[i]->getType()) &&
281 "Calling a function with a bad signature!");
284 std::copy(Args.begin(), Args.end(), op_begin());
288 void CallInst::init(Value *Func, const Twine &NameStr) {
289 assert(NumOperands == 1 && "NumOperands not set up?");
294 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
296 assert(FTy->getNumParams() == 0 && "Calling a function with bad signature");
302 CallInst::CallInst(Value *Func, const Twine &Name,
303 Instruction *InsertBefore)
304 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
305 ->getElementType())->getReturnType(),
307 OperandTraits<CallInst>::op_end(this) - 1,
312 CallInst::CallInst(Value *Func, const Twine &Name,
313 BasicBlock *InsertAtEnd)
314 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
315 ->getElementType())->getReturnType(),
317 OperandTraits<CallInst>::op_end(this) - 1,
322 CallInst::CallInst(const CallInst &CI)
323 : Instruction(CI.getType(), Instruction::Call,
324 OperandTraits<CallInst>::op_end(this) - CI.getNumOperands(),
325 CI.getNumOperands()) {
326 setAttributes(CI.getAttributes());
327 setTailCallKind(CI.getTailCallKind());
328 setCallingConv(CI.getCallingConv());
330 std::copy(CI.op_begin(), CI.op_end(), op_begin());
331 SubclassOptionalData = CI.SubclassOptionalData;
334 void CallInst::addAttribute(unsigned i, Attribute::AttrKind attr) {
335 AttributeSet PAL = getAttributes();
336 PAL = PAL.addAttribute(getContext(), i, attr);
340 void CallInst::removeAttribute(unsigned i, Attribute attr) {
341 AttributeSet PAL = getAttributes();
343 LLVMContext &Context = getContext();
344 PAL = PAL.removeAttributes(Context, i,
345 AttributeSet::get(Context, i, B));
349 void CallInst::addDereferenceableAttr(unsigned i, uint64_t Bytes) {
350 AttributeSet PAL = getAttributes();
351 PAL = PAL.addDereferenceableAttr(getContext(), i, Bytes);
355 bool CallInst::hasFnAttrImpl(Attribute::AttrKind A) const {
356 if (AttributeList.hasAttribute(AttributeSet::FunctionIndex, A))
358 if (const Function *F = getCalledFunction())
359 return F->getAttributes().hasAttribute(AttributeSet::FunctionIndex, A);
363 bool CallInst::paramHasAttr(unsigned i, Attribute::AttrKind A) const {
364 if (AttributeList.hasAttribute(i, A))
366 if (const Function *F = getCalledFunction())
367 return F->getAttributes().hasAttribute(i, A);
371 /// IsConstantOne - Return true only if val is constant int 1
372 static bool IsConstantOne(Value *val) {
373 assert(val && "IsConstantOne does not work with nullptr val");
374 const ConstantInt *CVal = dyn_cast<ConstantInt>(val);
375 return CVal && CVal->isOne();
378 static Instruction *createMalloc(Instruction *InsertBefore,
379 BasicBlock *InsertAtEnd, Type *IntPtrTy,
380 Type *AllocTy, Value *AllocSize,
381 Value *ArraySize, Function *MallocF,
383 assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&
384 "createMalloc needs either InsertBefore or InsertAtEnd");
386 // malloc(type) becomes:
387 // bitcast (i8* malloc(typeSize)) to type*
388 // malloc(type, arraySize) becomes:
389 // bitcast (i8 *malloc(typeSize*arraySize)) to type*
391 ArraySize = ConstantInt::get(IntPtrTy, 1);
392 else if (ArraySize->getType() != IntPtrTy) {
394 ArraySize = CastInst::CreateIntegerCast(ArraySize, IntPtrTy, false,
397 ArraySize = CastInst::CreateIntegerCast(ArraySize, IntPtrTy, false,
401 if (!IsConstantOne(ArraySize)) {
402 if (IsConstantOne(AllocSize)) {
403 AllocSize = ArraySize; // Operand * 1 = Operand
404 } else if (Constant *CO = dyn_cast<Constant>(ArraySize)) {
405 Constant *Scale = ConstantExpr::getIntegerCast(CO, IntPtrTy,
407 // Malloc arg is constant product of type size and array size
408 AllocSize = ConstantExpr::getMul(Scale, cast<Constant>(AllocSize));
410 // Multiply type size by the array size...
412 AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
413 "mallocsize", InsertBefore);
415 AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
416 "mallocsize", InsertAtEnd);
420 assert(AllocSize->getType() == IntPtrTy && "malloc arg is wrong size");
421 // Create the call to Malloc.
422 BasicBlock* BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
423 Module* M = BB->getParent()->getParent();
424 Type *BPTy = Type::getInt8PtrTy(BB->getContext());
425 Value *MallocFunc = MallocF;
427 // prototype malloc as "void *malloc(size_t)"
428 MallocFunc = M->getOrInsertFunction("malloc", BPTy, IntPtrTy, nullptr);
429 PointerType *AllocPtrType = PointerType::getUnqual(AllocTy);
430 CallInst *MCall = nullptr;
431 Instruction *Result = nullptr;
433 MCall = CallInst::Create(MallocFunc, AllocSize, "malloccall", InsertBefore);
435 if (Result->getType() != AllocPtrType)
436 // Create a cast instruction to convert to the right type...
437 Result = new BitCastInst(MCall, AllocPtrType, Name, InsertBefore);
439 MCall = CallInst::Create(MallocFunc, AllocSize, "malloccall");
441 if (Result->getType() != AllocPtrType) {
442 InsertAtEnd->getInstList().push_back(MCall);
443 // Create a cast instruction to convert to the right type...
444 Result = new BitCastInst(MCall, AllocPtrType, Name);
447 MCall->setTailCall();
448 if (Function *F = dyn_cast<Function>(MallocFunc)) {
449 MCall->setCallingConv(F->getCallingConv());
450 if (!F->doesNotAlias(0)) F->setDoesNotAlias(0);
452 assert(!MCall->getType()->isVoidTy() && "Malloc has void return type");
457 /// CreateMalloc - Generate the IR for a call to malloc:
458 /// 1. Compute the malloc call's argument as the specified type's size,
459 /// possibly multiplied by the array size if the array size is not
461 /// 2. Call malloc with that argument.
462 /// 3. Bitcast the result of the malloc call to the specified type.
463 Instruction *CallInst::CreateMalloc(Instruction *InsertBefore,
464 Type *IntPtrTy, Type *AllocTy,
465 Value *AllocSize, Value *ArraySize,
468 return createMalloc(InsertBefore, nullptr, IntPtrTy, AllocTy, AllocSize,
469 ArraySize, MallocF, Name);
472 /// CreateMalloc - Generate the IR for a call to malloc:
473 /// 1. Compute the malloc call's argument as the specified type's size,
474 /// possibly multiplied by the array size if the array size is not
476 /// 2. Call malloc with that argument.
477 /// 3. Bitcast the result of the malloc call to the specified type.
478 /// Note: This function does not add the bitcast to the basic block, that is the
479 /// responsibility of the caller.
480 Instruction *CallInst::CreateMalloc(BasicBlock *InsertAtEnd,
481 Type *IntPtrTy, Type *AllocTy,
482 Value *AllocSize, Value *ArraySize,
483 Function *MallocF, const Twine &Name) {
484 return createMalloc(nullptr, InsertAtEnd, IntPtrTy, AllocTy, AllocSize,
485 ArraySize, MallocF, Name);
488 static Instruction* createFree(Value* Source, Instruction *InsertBefore,
489 BasicBlock *InsertAtEnd) {
490 assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&
491 "createFree needs either InsertBefore or InsertAtEnd");
492 assert(Source->getType()->isPointerTy() &&
493 "Can not free something of nonpointer type!");
495 BasicBlock* BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
496 Module* M = BB->getParent()->getParent();
498 Type *VoidTy = Type::getVoidTy(M->getContext());
499 Type *IntPtrTy = Type::getInt8PtrTy(M->getContext());
500 // prototype free as "void free(void*)"
501 Value *FreeFunc = M->getOrInsertFunction("free", VoidTy, IntPtrTy, nullptr);
502 CallInst* Result = nullptr;
503 Value *PtrCast = Source;
505 if (Source->getType() != IntPtrTy)
506 PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertBefore);
507 Result = CallInst::Create(FreeFunc, PtrCast, "", InsertBefore);
509 if (Source->getType() != IntPtrTy)
510 PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertAtEnd);
511 Result = CallInst::Create(FreeFunc, PtrCast, "");
513 Result->setTailCall();
514 if (Function *F = dyn_cast<Function>(FreeFunc))
515 Result->setCallingConv(F->getCallingConv());
520 /// CreateFree - Generate the IR for a call to the builtin free function.
521 Instruction * CallInst::CreateFree(Value* Source, Instruction *InsertBefore) {
522 return createFree(Source, InsertBefore, nullptr);
525 /// CreateFree - Generate the IR for a call to the builtin free function.
526 /// Note: This function does not add the call to the basic block, that is the
527 /// responsibility of the caller.
528 Instruction* CallInst::CreateFree(Value* Source, BasicBlock *InsertAtEnd) {
529 Instruction* FreeCall = createFree(Source, nullptr, InsertAtEnd);
530 assert(FreeCall && "CreateFree did not create a CallInst");
534 //===----------------------------------------------------------------------===//
535 // InvokeInst Implementation
536 //===----------------------------------------------------------------------===//
538 void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
539 ArrayRef<Value *> Args, const Twine &NameStr) {
540 assert(NumOperands == 3 + Args.size() && "NumOperands not set up?");
543 Op<-1>() = IfException;
547 cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
549 assert(((Args.size() == FTy->getNumParams()) ||
550 (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&
551 "Invoking a function with bad signature");
553 for (unsigned i = 0, e = Args.size(); i != e; i++)
554 assert((i >= FTy->getNumParams() ||
555 FTy->getParamType(i) == Args[i]->getType()) &&
556 "Invoking a function with a bad signature!");
559 std::copy(Args.begin(), Args.end(), op_begin());
563 InvokeInst::InvokeInst(const InvokeInst &II)
564 : TerminatorInst(II.getType(), Instruction::Invoke,
565 OperandTraits<InvokeInst>::op_end(this)
566 - II.getNumOperands(),
567 II.getNumOperands()) {
568 setAttributes(II.getAttributes());
569 setCallingConv(II.getCallingConv());
570 std::copy(II.op_begin(), II.op_end(), op_begin());
571 SubclassOptionalData = II.SubclassOptionalData;
574 BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
575 return getSuccessor(idx);
577 unsigned InvokeInst::getNumSuccessorsV() const {
578 return getNumSuccessors();
580 void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
581 return setSuccessor(idx, B);
584 bool InvokeInst::hasFnAttrImpl(Attribute::AttrKind A) const {
585 if (AttributeList.hasAttribute(AttributeSet::FunctionIndex, A))
587 if (const Function *F = getCalledFunction())
588 return F->getAttributes().hasAttribute(AttributeSet::FunctionIndex, A);
592 bool InvokeInst::paramHasAttr(unsigned i, Attribute::AttrKind A) const {
593 if (AttributeList.hasAttribute(i, A))
595 if (const Function *F = getCalledFunction())
596 return F->getAttributes().hasAttribute(i, A);
600 void InvokeInst::addAttribute(unsigned i, Attribute::AttrKind attr) {
601 AttributeSet PAL = getAttributes();
602 PAL = PAL.addAttribute(getContext(), i, attr);
606 void InvokeInst::removeAttribute(unsigned i, Attribute attr) {
607 AttributeSet PAL = getAttributes();
609 PAL = PAL.removeAttributes(getContext(), i,
610 AttributeSet::get(getContext(), i, B));
614 void InvokeInst::addDereferenceableAttr(unsigned i, uint64_t Bytes) {
615 AttributeSet PAL = getAttributes();
616 PAL = PAL.addDereferenceableAttr(getContext(), i, Bytes);
620 LandingPadInst *InvokeInst::getLandingPadInst() const {
621 return cast<LandingPadInst>(getUnwindDest()->getFirstNonPHI());
624 //===----------------------------------------------------------------------===//
625 // ReturnInst Implementation
626 //===----------------------------------------------------------------------===//
628 ReturnInst::ReturnInst(const ReturnInst &RI)
629 : TerminatorInst(Type::getVoidTy(RI.getContext()), Instruction::Ret,
630 OperandTraits<ReturnInst>::op_end(this) -
632 RI.getNumOperands()) {
633 if (RI.getNumOperands())
634 Op<0>() = RI.Op<0>();
635 SubclassOptionalData = RI.SubclassOptionalData;
638 ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, Instruction *InsertBefore)
639 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret,
640 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
645 ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, BasicBlock *InsertAtEnd)
646 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret,
647 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
652 ReturnInst::ReturnInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
653 : TerminatorInst(Type::getVoidTy(Context), Instruction::Ret,
654 OperandTraits<ReturnInst>::op_end(this), 0, InsertAtEnd) {
657 unsigned ReturnInst::getNumSuccessorsV() const {
658 return getNumSuccessors();
661 /// Out-of-line ReturnInst method, put here so the C++ compiler can choose to
662 /// emit the vtable for the class in this translation unit.
663 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
664 llvm_unreachable("ReturnInst has no successors!");
667 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
668 llvm_unreachable("ReturnInst has no successors!");
671 ReturnInst::~ReturnInst() {
674 //===----------------------------------------------------------------------===//
675 // ResumeInst Implementation
676 //===----------------------------------------------------------------------===//
678 ResumeInst::ResumeInst(const ResumeInst &RI)
679 : TerminatorInst(Type::getVoidTy(RI.getContext()), Instruction::Resume,
680 OperandTraits<ResumeInst>::op_begin(this), 1) {
681 Op<0>() = RI.Op<0>();
684 ResumeInst::ResumeInst(Value *Exn, Instruction *InsertBefore)
685 : TerminatorInst(Type::getVoidTy(Exn->getContext()), Instruction::Resume,
686 OperandTraits<ResumeInst>::op_begin(this), 1, InsertBefore) {
690 ResumeInst::ResumeInst(Value *Exn, BasicBlock *InsertAtEnd)
691 : TerminatorInst(Type::getVoidTy(Exn->getContext()), Instruction::Resume,
692 OperandTraits<ResumeInst>::op_begin(this), 1, InsertAtEnd) {
696 unsigned ResumeInst::getNumSuccessorsV() const {
697 return getNumSuccessors();
700 void ResumeInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
701 llvm_unreachable("ResumeInst has no successors!");
704 BasicBlock *ResumeInst::getSuccessorV(unsigned idx) const {
705 llvm_unreachable("ResumeInst has no successors!");
708 //===----------------------------------------------------------------------===//
709 // UnreachableInst Implementation
710 //===----------------------------------------------------------------------===//
712 UnreachableInst::UnreachableInst(LLVMContext &Context,
713 Instruction *InsertBefore)
714 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unreachable,
715 nullptr, 0, InsertBefore) {
717 UnreachableInst::UnreachableInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
718 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unreachable,
719 nullptr, 0, InsertAtEnd) {
722 unsigned UnreachableInst::getNumSuccessorsV() const {
723 return getNumSuccessors();
726 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
727 llvm_unreachable("UnreachableInst has no successors!");
730 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
731 llvm_unreachable("UnreachableInst has no successors!");
734 //===----------------------------------------------------------------------===//
735 // BranchInst Implementation
736 //===----------------------------------------------------------------------===//
738 void BranchInst::AssertOK() {
740 assert(getCondition()->getType()->isIntegerTy(1) &&
741 "May only branch on boolean predicates!");
744 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
745 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
746 OperandTraits<BranchInst>::op_end(this) - 1,
748 assert(IfTrue && "Branch destination may not be null!");
751 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
752 Instruction *InsertBefore)
753 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
754 OperandTraits<BranchInst>::op_end(this) - 3,
764 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
765 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
766 OperandTraits<BranchInst>::op_end(this) - 1,
768 assert(IfTrue && "Branch destination may not be null!");
772 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
773 BasicBlock *InsertAtEnd)
774 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
775 OperandTraits<BranchInst>::op_end(this) - 3,
786 BranchInst::BranchInst(const BranchInst &BI) :
787 TerminatorInst(Type::getVoidTy(BI.getContext()), Instruction::Br,
788 OperandTraits<BranchInst>::op_end(this) - BI.getNumOperands(),
789 BI.getNumOperands()) {
790 Op<-1>() = BI.Op<-1>();
791 if (BI.getNumOperands() != 1) {
792 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
793 Op<-3>() = BI.Op<-3>();
794 Op<-2>() = BI.Op<-2>();
796 SubclassOptionalData = BI.SubclassOptionalData;
799 void BranchInst::swapSuccessors() {
800 assert(isConditional() &&
801 "Cannot swap successors of an unconditional branch");
802 Op<-1>().swap(Op<-2>());
804 // Update profile metadata if present and it matches our structural
806 MDNode *ProfileData = getMetadata(LLVMContext::MD_prof);
807 if (!ProfileData || ProfileData->getNumOperands() != 3)
810 // The first operand is the name. Fetch them backwards and build a new one.
811 Metadata *Ops[] = {ProfileData->getOperand(0), ProfileData->getOperand(2),
812 ProfileData->getOperand(1)};
813 setMetadata(LLVMContext::MD_prof,
814 MDNode::get(ProfileData->getContext(), Ops));
817 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
818 return getSuccessor(idx);
820 unsigned BranchInst::getNumSuccessorsV() const {
821 return getNumSuccessors();
823 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
824 setSuccessor(idx, B);
828 //===----------------------------------------------------------------------===//
829 // AllocaInst Implementation
830 //===----------------------------------------------------------------------===//
832 static Value *getAISize(LLVMContext &Context, Value *Amt) {
834 Amt = ConstantInt::get(Type::getInt32Ty(Context), 1);
836 assert(!isa<BasicBlock>(Amt) &&
837 "Passed basic block into allocation size parameter! Use other ctor");
838 assert(Amt->getType()->isIntegerTy() &&
839 "Allocation array size is not an integer!");
844 AllocaInst::AllocaInst(Type *Ty, const Twine &Name, Instruction *InsertBefore)
845 : AllocaInst(Ty, /*ArraySize=*/nullptr, Name, InsertBefore) {}
847 AllocaInst::AllocaInst(Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd)
848 : AllocaInst(Ty, /*ArraySize=*/nullptr, Name, InsertAtEnd) {}
850 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize, const Twine &Name,
851 Instruction *InsertBefore)
852 : AllocaInst(Ty, ArraySize, /*Align=*/0, Name, InsertBefore) {}
854 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize, const Twine &Name,
855 BasicBlock *InsertAtEnd)
856 : AllocaInst(Ty, ArraySize, /*Align=*/0, Name, InsertAtEnd) {}
858 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize, unsigned Align,
859 const Twine &Name, Instruction *InsertBefore)
860 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
861 getAISize(Ty->getContext(), ArraySize), InsertBefore) {
863 assert(!Ty->isVoidTy() && "Cannot allocate void!");
867 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize, unsigned Align,
868 const Twine &Name, BasicBlock *InsertAtEnd)
869 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
870 getAISize(Ty->getContext(), ArraySize), InsertAtEnd) {
872 assert(!Ty->isVoidTy() && "Cannot allocate void!");
876 // Out of line virtual method, so the vtable, etc has a home.
877 AllocaInst::~AllocaInst() {
880 void AllocaInst::setAlignment(unsigned Align) {
881 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
882 assert(Align <= MaximumAlignment &&
883 "Alignment is greater than MaximumAlignment!");
884 setInstructionSubclassData((getSubclassDataFromInstruction() & ~31) |
885 (Log2_32(Align) + 1));
886 assert(getAlignment() == Align && "Alignment representation error!");
889 bool AllocaInst::isArrayAllocation() const {
890 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
895 Type *AllocaInst::getAllocatedType() const {
896 return getType()->getElementType();
899 /// isStaticAlloca - Return true if this alloca is in the entry block of the
900 /// function and is a constant size. If so, the code generator will fold it
901 /// into the prolog/epilog code, so it is basically free.
902 bool AllocaInst::isStaticAlloca() const {
903 // Must be constant size.
904 if (!isa<ConstantInt>(getArraySize())) return false;
906 // Must be in the entry block.
907 const BasicBlock *Parent = getParent();
908 return Parent == &Parent->getParent()->front() && !isUsedWithInAlloca();
911 //===----------------------------------------------------------------------===//
912 // LoadInst Implementation
913 //===----------------------------------------------------------------------===//
915 void LoadInst::AssertOK() {
916 assert(getOperand(0)->getType()->isPointerTy() &&
917 "Ptr must have pointer type.");
918 assert(!(isAtomic() && getAlignment() == 0) &&
919 "Alignment required for atomic load");
922 LoadInst::LoadInst(Value *Ptr, const Twine &Name, Instruction *InsertBef)
923 : LoadInst(Ptr, Name, /*isVolatile=*/false, InsertBef) {}
925 LoadInst::LoadInst(Value *Ptr, const Twine &Name, BasicBlock *InsertAE)
926 : LoadInst(Ptr, Name, /*isVolatile=*/false, InsertAE) {}
928 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
929 Instruction *InsertBef)
930 : LoadInst(Ptr, Name, isVolatile, /*Align=*/0, InsertBef) {}
932 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
933 BasicBlock *InsertAE)
934 : LoadInst(Ptr, Name, isVolatile, /*Align=*/0, InsertAE) {}
936 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
937 unsigned Align, Instruction *InsertBef)
938 : LoadInst(Ptr, Name, isVolatile, Align, NotAtomic, CrossThread,
941 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
942 unsigned Align, BasicBlock *InsertAE)
943 : LoadInst(Ptr, Name, isVolatile, Align, NotAtomic, CrossThread, InsertAE) {
946 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
947 unsigned Align, AtomicOrdering Order,
948 SynchronizationScope SynchScope,
949 Instruction *InsertBef)
950 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
951 Load, Ptr, InsertBef) {
952 setVolatile(isVolatile);
954 setAtomic(Order, SynchScope);
959 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
960 unsigned Align, AtomicOrdering Order,
961 SynchronizationScope SynchScope,
962 BasicBlock *InsertAE)
963 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
964 Load, Ptr, InsertAE) {
965 setVolatile(isVolatile);
967 setAtomic(Order, SynchScope);
972 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
973 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
974 Load, Ptr, InsertBef) {
977 setAtomic(NotAtomic);
979 if (Name && Name[0]) setName(Name);
982 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
983 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
984 Load, Ptr, InsertAE) {
987 setAtomic(NotAtomic);
989 if (Name && Name[0]) setName(Name);
992 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
993 Instruction *InsertBef)
994 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
995 Load, Ptr, InsertBef) {
996 setVolatile(isVolatile);
998 setAtomic(NotAtomic);
1000 if (Name && Name[0]) setName(Name);
1003 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
1004 BasicBlock *InsertAE)
1005 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1006 Load, Ptr, InsertAE) {
1007 setVolatile(isVolatile);
1009 setAtomic(NotAtomic);
1011 if (Name && Name[0]) setName(Name);
1014 void LoadInst::setAlignment(unsigned Align) {
1015 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1016 assert(Align <= MaximumAlignment &&
1017 "Alignment is greater than MaximumAlignment!");
1018 setInstructionSubclassData((getSubclassDataFromInstruction() & ~(31 << 1)) |
1019 ((Log2_32(Align)+1)<<1));
1020 assert(getAlignment() == Align && "Alignment representation error!");
1023 //===----------------------------------------------------------------------===//
1024 // StoreInst Implementation
1025 //===----------------------------------------------------------------------===//
1027 void StoreInst::AssertOK() {
1028 assert(getOperand(0) && getOperand(1) && "Both operands must be non-null!");
1029 assert(getOperand(1)->getType()->isPointerTy() &&
1030 "Ptr must have pointer type!");
1031 assert(getOperand(0)->getType() ==
1032 cast<PointerType>(getOperand(1)->getType())->getElementType()
1033 && "Ptr must be a pointer to Val type!");
1034 assert(!(isAtomic() && getAlignment() == 0) &&
1035 "Alignment required for atomic store");
1038 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
1039 : StoreInst(val, addr, /*isVolatile=*/false, InsertBefore) {}
1041 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
1042 : StoreInst(val, addr, /*isVolatile=*/false, InsertAtEnd) {}
1044 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1045 Instruction *InsertBefore)
1046 : StoreInst(val, addr, isVolatile, /*Align=*/0, InsertBefore) {}
1048 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1049 BasicBlock *InsertAtEnd)
1050 : StoreInst(val, addr, isVolatile, /*Align=*/0, InsertAtEnd) {}
1052 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile, unsigned Align,
1053 Instruction *InsertBefore)
1054 : StoreInst(val, addr, isVolatile, Align, NotAtomic, CrossThread,
1057 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile, unsigned Align,
1058 BasicBlock *InsertAtEnd)
1059 : StoreInst(val, addr, isVolatile, Align, NotAtomic, CrossThread,
1062 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1063 unsigned Align, AtomicOrdering Order,
1064 SynchronizationScope SynchScope,
1065 Instruction *InsertBefore)
1066 : Instruction(Type::getVoidTy(val->getContext()), Store,
1067 OperandTraits<StoreInst>::op_begin(this),
1068 OperandTraits<StoreInst>::operands(this),
1072 setVolatile(isVolatile);
1073 setAlignment(Align);
1074 setAtomic(Order, SynchScope);
1078 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1079 unsigned Align, AtomicOrdering Order,
1080 SynchronizationScope SynchScope,
1081 BasicBlock *InsertAtEnd)
1082 : Instruction(Type::getVoidTy(val->getContext()), Store,
1083 OperandTraits<StoreInst>::op_begin(this),
1084 OperandTraits<StoreInst>::operands(this),
1088 setVolatile(isVolatile);
1089 setAlignment(Align);
1090 setAtomic(Order, SynchScope);
1094 void StoreInst::setAlignment(unsigned Align) {
1095 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1096 assert(Align <= MaximumAlignment &&
1097 "Alignment is greater than MaximumAlignment!");
1098 setInstructionSubclassData((getSubclassDataFromInstruction() & ~(31 << 1)) |
1099 ((Log2_32(Align)+1) << 1));
1100 assert(getAlignment() == Align && "Alignment representation error!");
1103 //===----------------------------------------------------------------------===//
1104 // AtomicCmpXchgInst Implementation
1105 //===----------------------------------------------------------------------===//
1107 void AtomicCmpXchgInst::Init(Value *Ptr, Value *Cmp, Value *NewVal,
1108 AtomicOrdering SuccessOrdering,
1109 AtomicOrdering FailureOrdering,
1110 SynchronizationScope SynchScope) {
1114 setSuccessOrdering(SuccessOrdering);
1115 setFailureOrdering(FailureOrdering);
1116 setSynchScope(SynchScope);
1118 assert(getOperand(0) && getOperand(1) && getOperand(2) &&
1119 "All operands must be non-null!");
1120 assert(getOperand(0)->getType()->isPointerTy() &&
1121 "Ptr must have pointer type!");
1122 assert(getOperand(1)->getType() ==
1123 cast<PointerType>(getOperand(0)->getType())->getElementType()
1124 && "Ptr must be a pointer to Cmp type!");
1125 assert(getOperand(2)->getType() ==
1126 cast<PointerType>(getOperand(0)->getType())->getElementType()
1127 && "Ptr must be a pointer to NewVal type!");
1128 assert(SuccessOrdering != NotAtomic &&
1129 "AtomicCmpXchg instructions must be atomic!");
1130 assert(FailureOrdering != NotAtomic &&
1131 "AtomicCmpXchg instructions must be atomic!");
1132 assert(SuccessOrdering >= FailureOrdering &&
1133 "AtomicCmpXchg success ordering must be at least as strong as fail");
1134 assert(FailureOrdering != Release && FailureOrdering != AcquireRelease &&
1135 "AtomicCmpXchg failure ordering cannot include release semantics");
1138 AtomicCmpXchgInst::AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
1139 AtomicOrdering SuccessOrdering,
1140 AtomicOrdering FailureOrdering,
1141 SynchronizationScope SynchScope,
1142 Instruction *InsertBefore)
1144 StructType::get(Cmp->getType(), Type::getInt1Ty(Cmp->getContext()),
1146 AtomicCmpXchg, OperandTraits<AtomicCmpXchgInst>::op_begin(this),
1147 OperandTraits<AtomicCmpXchgInst>::operands(this), InsertBefore) {
1148 Init(Ptr, Cmp, NewVal, SuccessOrdering, FailureOrdering, SynchScope);
1151 AtomicCmpXchgInst::AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
1152 AtomicOrdering SuccessOrdering,
1153 AtomicOrdering FailureOrdering,
1154 SynchronizationScope SynchScope,
1155 BasicBlock *InsertAtEnd)
1157 StructType::get(Cmp->getType(), Type::getInt1Ty(Cmp->getContext()),
1159 AtomicCmpXchg, OperandTraits<AtomicCmpXchgInst>::op_begin(this),
1160 OperandTraits<AtomicCmpXchgInst>::operands(this), InsertAtEnd) {
1161 Init(Ptr, Cmp, NewVal, SuccessOrdering, FailureOrdering, SynchScope);
1164 //===----------------------------------------------------------------------===//
1165 // AtomicRMWInst Implementation
1166 //===----------------------------------------------------------------------===//
1168 void AtomicRMWInst::Init(BinOp Operation, Value *Ptr, Value *Val,
1169 AtomicOrdering Ordering,
1170 SynchronizationScope SynchScope) {
1173 setOperation(Operation);
1174 setOrdering(Ordering);
1175 setSynchScope(SynchScope);
1177 assert(getOperand(0) && getOperand(1) &&
1178 "All operands must be non-null!");
1179 assert(getOperand(0)->getType()->isPointerTy() &&
1180 "Ptr must have pointer type!");
1181 assert(getOperand(1)->getType() ==
1182 cast<PointerType>(getOperand(0)->getType())->getElementType()
1183 && "Ptr must be a pointer to Val type!");
1184 assert(Ordering != NotAtomic &&
1185 "AtomicRMW instructions must be atomic!");
1188 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
1189 AtomicOrdering Ordering,
1190 SynchronizationScope SynchScope,
1191 Instruction *InsertBefore)
1192 : Instruction(Val->getType(), AtomicRMW,
1193 OperandTraits<AtomicRMWInst>::op_begin(this),
1194 OperandTraits<AtomicRMWInst>::operands(this),
1196 Init(Operation, Ptr, Val, Ordering, SynchScope);
1199 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
1200 AtomicOrdering Ordering,
1201 SynchronizationScope SynchScope,
1202 BasicBlock *InsertAtEnd)
1203 : Instruction(Val->getType(), AtomicRMW,
1204 OperandTraits<AtomicRMWInst>::op_begin(this),
1205 OperandTraits<AtomicRMWInst>::operands(this),
1207 Init(Operation, Ptr, Val, Ordering, SynchScope);
1210 //===----------------------------------------------------------------------===//
1211 // FenceInst Implementation
1212 //===----------------------------------------------------------------------===//
1214 FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
1215 SynchronizationScope SynchScope,
1216 Instruction *InsertBefore)
1217 : Instruction(Type::getVoidTy(C), Fence, nullptr, 0, InsertBefore) {
1218 setOrdering(Ordering);
1219 setSynchScope(SynchScope);
1222 FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
1223 SynchronizationScope SynchScope,
1224 BasicBlock *InsertAtEnd)
1225 : Instruction(Type::getVoidTy(C), Fence, nullptr, 0, InsertAtEnd) {
1226 setOrdering(Ordering);
1227 setSynchScope(SynchScope);
1230 //===----------------------------------------------------------------------===//
1231 // GetElementPtrInst Implementation
1232 //===----------------------------------------------------------------------===//
1234 void GetElementPtrInst::init(Value *Ptr, ArrayRef<Value *> IdxList,
1235 const Twine &Name) {
1236 assert(NumOperands == 1 + IdxList.size() && "NumOperands not initialized?");
1237 OperandList[0] = Ptr;
1238 std::copy(IdxList.begin(), IdxList.end(), op_begin() + 1);
1242 GetElementPtrInst::GetElementPtrInst(const GetElementPtrInst &GEPI)
1243 : Instruction(GEPI.getType(), GetElementPtr,
1244 OperandTraits<GetElementPtrInst>::op_end(this)
1245 - GEPI.getNumOperands(),
1246 GEPI.getNumOperands()) {
1247 std::copy(GEPI.op_begin(), GEPI.op_end(), op_begin());
1248 SubclassOptionalData = GEPI.SubclassOptionalData;
1251 /// getIndexedType - Returns the type of the element that would be accessed with
1252 /// a gep instruction with the specified parameters.
1254 /// The Idxs pointer should point to a continuous piece of memory containing the
1255 /// indices, either as Value* or uint64_t.
1257 /// A null type is returned if the indices are invalid for the specified
1260 template <typename IndexTy>
1261 static Type *getIndexedTypeInternal(Type *Ptr, ArrayRef<IndexTy> IdxList) {
1262 PointerType *PTy = dyn_cast<PointerType>(Ptr->getScalarType());
1263 if (!PTy) return nullptr; // Type isn't a pointer type!
1264 Type *Agg = PTy->getElementType();
1266 // Handle the special case of the empty set index set, which is always valid.
1267 if (IdxList.empty())
1270 // If there is at least one index, the top level type must be sized, otherwise
1271 // it cannot be 'stepped over'.
1272 if (!Agg->isSized())
1275 unsigned CurIdx = 1;
1276 for (; CurIdx != IdxList.size(); ++CurIdx) {
1277 CompositeType *CT = dyn_cast<CompositeType>(Agg);
1278 if (!CT || CT->isPointerTy()) return nullptr;
1279 IndexTy Index = IdxList[CurIdx];
1280 if (!CT->indexValid(Index)) return nullptr;
1281 Agg = CT->getTypeAtIndex(Index);
1283 return CurIdx == IdxList.size() ? Agg : nullptr;
1286 Type *GetElementPtrInst::getIndexedType(Type *Ptr, ArrayRef<Value *> IdxList) {
1287 return getIndexedTypeInternal(Ptr, IdxList);
1290 Type *GetElementPtrInst::getIndexedType(Type *Ptr,
1291 ArrayRef<Constant *> IdxList) {
1292 return getIndexedTypeInternal(Ptr, IdxList);
1295 Type *GetElementPtrInst::getIndexedType(Type *Ptr, ArrayRef<uint64_t> IdxList) {
1296 return getIndexedTypeInternal(Ptr, IdxList);
1299 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
1300 /// zeros. If so, the result pointer and the first operand have the same
1301 /// value, just potentially different types.
1302 bool GetElementPtrInst::hasAllZeroIndices() const {
1303 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1304 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
1305 if (!CI->isZero()) return false;
1313 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
1314 /// constant integers. If so, the result pointer and the first operand have
1315 /// a constant offset between them.
1316 bool GetElementPtrInst::hasAllConstantIndices() const {
1317 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1318 if (!isa<ConstantInt>(getOperand(i)))
1324 void GetElementPtrInst::setIsInBounds(bool B) {
1325 cast<GEPOperator>(this)->setIsInBounds(B);
1328 bool GetElementPtrInst::isInBounds() const {
1329 return cast<GEPOperator>(this)->isInBounds();
1332 bool GetElementPtrInst::accumulateConstantOffset(const DataLayout &DL,
1333 APInt &Offset) const {
1334 // Delegate to the generic GEPOperator implementation.
1335 return cast<GEPOperator>(this)->accumulateConstantOffset(DL, Offset);
1338 //===----------------------------------------------------------------------===//
1339 // ExtractElementInst Implementation
1340 //===----------------------------------------------------------------------===//
1342 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1344 Instruction *InsertBef)
1345 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1347 OperandTraits<ExtractElementInst>::op_begin(this),
1349 assert(isValidOperands(Val, Index) &&
1350 "Invalid extractelement instruction operands!");
1356 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1358 BasicBlock *InsertAE)
1359 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1361 OperandTraits<ExtractElementInst>::op_begin(this),
1363 assert(isValidOperands(Val, Index) &&
1364 "Invalid extractelement instruction operands!");
1372 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
1373 if (!Val->getType()->isVectorTy() || !Index->getType()->isIntegerTy())
1379 //===----------------------------------------------------------------------===//
1380 // InsertElementInst Implementation
1381 //===----------------------------------------------------------------------===//
1383 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1385 Instruction *InsertBef)
1386 : Instruction(Vec->getType(), InsertElement,
1387 OperandTraits<InsertElementInst>::op_begin(this),
1389 assert(isValidOperands(Vec, Elt, Index) &&
1390 "Invalid insertelement instruction operands!");
1397 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1399 BasicBlock *InsertAE)
1400 : Instruction(Vec->getType(), InsertElement,
1401 OperandTraits<InsertElementInst>::op_begin(this),
1403 assert(isValidOperands(Vec, Elt, Index) &&
1404 "Invalid insertelement instruction operands!");
1412 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
1413 const Value *Index) {
1414 if (!Vec->getType()->isVectorTy())
1415 return false; // First operand of insertelement must be vector type.
1417 if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
1418 return false;// Second operand of insertelement must be vector element type.
1420 if (!Index->getType()->isIntegerTy())
1421 return false; // Third operand of insertelement must be i32.
1426 //===----------------------------------------------------------------------===//
1427 // ShuffleVectorInst Implementation
1428 //===----------------------------------------------------------------------===//
1430 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1432 Instruction *InsertBefore)
1433 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1434 cast<VectorType>(Mask->getType())->getNumElements()),
1436 OperandTraits<ShuffleVectorInst>::op_begin(this),
1437 OperandTraits<ShuffleVectorInst>::operands(this),
1439 assert(isValidOperands(V1, V2, Mask) &&
1440 "Invalid shuffle vector instruction operands!");
1447 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1449 BasicBlock *InsertAtEnd)
1450 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1451 cast<VectorType>(Mask->getType())->getNumElements()),
1453 OperandTraits<ShuffleVectorInst>::op_begin(this),
1454 OperandTraits<ShuffleVectorInst>::operands(this),
1456 assert(isValidOperands(V1, V2, Mask) &&
1457 "Invalid shuffle vector instruction operands!");
1465 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1466 const Value *Mask) {
1467 // V1 and V2 must be vectors of the same type.
1468 if (!V1->getType()->isVectorTy() || V1->getType() != V2->getType())
1471 // Mask must be vector of i32.
1472 VectorType *MaskTy = dyn_cast<VectorType>(Mask->getType());
1473 if (!MaskTy || !MaskTy->getElementType()->isIntegerTy(32))
1476 // Check to see if Mask is valid.
1477 if (isa<UndefValue>(Mask) || isa<ConstantAggregateZero>(Mask))
1480 if (const ConstantVector *MV = dyn_cast<ConstantVector>(Mask)) {
1481 unsigned V1Size = cast<VectorType>(V1->getType())->getNumElements();
1482 for (Value *Op : MV->operands()) {
1483 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op)) {
1484 if (CI->uge(V1Size*2))
1486 } else if (!isa<UndefValue>(Op)) {
1493 if (const ConstantDataSequential *CDS =
1494 dyn_cast<ConstantDataSequential>(Mask)) {
1495 unsigned V1Size = cast<VectorType>(V1->getType())->getNumElements();
1496 for (unsigned i = 0, e = MaskTy->getNumElements(); i != e; ++i)
1497 if (CDS->getElementAsInteger(i) >= V1Size*2)
1502 // The bitcode reader can create a place holder for a forward reference
1503 // used as the shuffle mask. When this occurs, the shuffle mask will
1504 // fall into this case and fail. To avoid this error, do this bit of
1505 // ugliness to allow such a mask pass.
1506 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(Mask))
1507 if (CE->getOpcode() == Instruction::UserOp1)
1513 /// getMaskValue - Return the index from the shuffle mask for the specified
1514 /// output result. This is either -1 if the element is undef or a number less
1515 /// than 2*numelements.
1516 int ShuffleVectorInst::getMaskValue(Constant *Mask, unsigned i) {
1517 assert(i < Mask->getType()->getVectorNumElements() && "Index out of range");
1518 if (ConstantDataSequential *CDS =dyn_cast<ConstantDataSequential>(Mask))
1519 return CDS->getElementAsInteger(i);
1520 Constant *C = Mask->getAggregateElement(i);
1521 if (isa<UndefValue>(C))
1523 return cast<ConstantInt>(C)->getZExtValue();
1526 /// getShuffleMask - Return the full mask for this instruction, where each
1527 /// element is the element number and undef's are returned as -1.
1528 void ShuffleVectorInst::getShuffleMask(Constant *Mask,
1529 SmallVectorImpl<int> &Result) {
1530 unsigned NumElts = Mask->getType()->getVectorNumElements();
1532 if (ConstantDataSequential *CDS=dyn_cast<ConstantDataSequential>(Mask)) {
1533 for (unsigned i = 0; i != NumElts; ++i)
1534 Result.push_back(CDS->getElementAsInteger(i));
1537 for (unsigned i = 0; i != NumElts; ++i) {
1538 Constant *C = Mask->getAggregateElement(i);
1539 Result.push_back(isa<UndefValue>(C) ? -1 :
1540 cast<ConstantInt>(C)->getZExtValue());
1545 //===----------------------------------------------------------------------===//
1546 // InsertValueInst Class
1547 //===----------------------------------------------------------------------===//
1549 void InsertValueInst::init(Value *Agg, Value *Val, ArrayRef<unsigned> Idxs,
1550 const Twine &Name) {
1551 assert(NumOperands == 2 && "NumOperands not initialized?");
1553 // There's no fundamental reason why we require at least one index
1554 // (other than weirdness with &*IdxBegin being invalid; see
1555 // getelementptr's init routine for example). But there's no
1556 // present need to support it.
1557 assert(Idxs.size() > 0 && "InsertValueInst must have at least one index");
1559 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs) ==
1560 Val->getType() && "Inserted value must match indexed type!");
1564 Indices.append(Idxs.begin(), Idxs.end());
1568 InsertValueInst::InsertValueInst(const InsertValueInst &IVI)
1569 : Instruction(IVI.getType(), InsertValue,
1570 OperandTraits<InsertValueInst>::op_begin(this), 2),
1571 Indices(IVI.Indices) {
1572 Op<0>() = IVI.getOperand(0);
1573 Op<1>() = IVI.getOperand(1);
1574 SubclassOptionalData = IVI.SubclassOptionalData;
1577 //===----------------------------------------------------------------------===//
1578 // ExtractValueInst Class
1579 //===----------------------------------------------------------------------===//
1581 void ExtractValueInst::init(ArrayRef<unsigned> Idxs, const Twine &Name) {
1582 assert(NumOperands == 1 && "NumOperands not initialized?");
1584 // There's no fundamental reason why we require at least one index.
1585 // But there's no present need to support it.
1586 assert(Idxs.size() > 0 && "ExtractValueInst must have at least one index");
1588 Indices.append(Idxs.begin(), Idxs.end());
1592 ExtractValueInst::ExtractValueInst(const ExtractValueInst &EVI)
1593 : UnaryInstruction(EVI.getType(), ExtractValue, EVI.getOperand(0)),
1594 Indices(EVI.Indices) {
1595 SubclassOptionalData = EVI.SubclassOptionalData;
1598 // getIndexedType - Returns the type of the element that would be extracted
1599 // with an extractvalue instruction with the specified parameters.
1601 // A null type is returned if the indices are invalid for the specified
1604 Type *ExtractValueInst::getIndexedType(Type *Agg,
1605 ArrayRef<unsigned> Idxs) {
1606 for (unsigned Index : Idxs) {
1607 // We can't use CompositeType::indexValid(Index) here.
1608 // indexValid() always returns true for arrays because getelementptr allows
1609 // out-of-bounds indices. Since we don't allow those for extractvalue and
1610 // insertvalue we need to check array indexing manually.
1611 // Since the only other types we can index into are struct types it's just
1612 // as easy to check those manually as well.
1613 if (ArrayType *AT = dyn_cast<ArrayType>(Agg)) {
1614 if (Index >= AT->getNumElements())
1616 } else if (StructType *ST = dyn_cast<StructType>(Agg)) {
1617 if (Index >= ST->getNumElements())
1620 // Not a valid type to index into.
1624 Agg = cast<CompositeType>(Agg)->getTypeAtIndex(Index);
1626 return const_cast<Type*>(Agg);
1629 //===----------------------------------------------------------------------===//
1630 // BinaryOperator Class
1631 //===----------------------------------------------------------------------===//
1633 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1634 Type *Ty, const Twine &Name,
1635 Instruction *InsertBefore)
1636 : Instruction(Ty, iType,
1637 OperandTraits<BinaryOperator>::op_begin(this),
1638 OperandTraits<BinaryOperator>::operands(this),
1646 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1647 Type *Ty, const Twine &Name,
1648 BasicBlock *InsertAtEnd)
1649 : Instruction(Ty, iType,
1650 OperandTraits<BinaryOperator>::op_begin(this),
1651 OperandTraits<BinaryOperator>::operands(this),
1660 void BinaryOperator::init(BinaryOps iType) {
1661 Value *LHS = getOperand(0), *RHS = getOperand(1);
1662 (void)LHS; (void)RHS; // Silence warnings.
1663 assert(LHS->getType() == RHS->getType() &&
1664 "Binary operator operand types must match!");
1669 assert(getType() == LHS->getType() &&
1670 "Arithmetic operation should return same type as operands!");
1671 assert(getType()->isIntOrIntVectorTy() &&
1672 "Tried to create an integer operation on a non-integer type!");
1674 case FAdd: case FSub:
1676 assert(getType() == LHS->getType() &&
1677 "Arithmetic operation should return same type as operands!");
1678 assert(getType()->isFPOrFPVectorTy() &&
1679 "Tried to create a floating-point operation on a "
1680 "non-floating-point type!");
1684 assert(getType() == LHS->getType() &&
1685 "Arithmetic operation should return same type as operands!");
1686 assert((getType()->isIntegerTy() || (getType()->isVectorTy() &&
1687 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1688 "Incorrect operand type (not integer) for S/UDIV");
1691 assert(getType() == LHS->getType() &&
1692 "Arithmetic operation should return same type as operands!");
1693 assert(getType()->isFPOrFPVectorTy() &&
1694 "Incorrect operand type (not floating point) for FDIV");
1698 assert(getType() == LHS->getType() &&
1699 "Arithmetic operation should return same type as operands!");
1700 assert((getType()->isIntegerTy() || (getType()->isVectorTy() &&
1701 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1702 "Incorrect operand type (not integer) for S/UREM");
1705 assert(getType() == LHS->getType() &&
1706 "Arithmetic operation should return same type as operands!");
1707 assert(getType()->isFPOrFPVectorTy() &&
1708 "Incorrect operand type (not floating point) for FREM");
1713 assert(getType() == LHS->getType() &&
1714 "Shift operation should return same type as operands!");
1715 assert((getType()->isIntegerTy() ||
1716 (getType()->isVectorTy() &&
1717 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1718 "Tried to create a shift operation on a non-integral type!");
1722 assert(getType() == LHS->getType() &&
1723 "Logical operation should return same type as operands!");
1724 assert((getType()->isIntegerTy() ||
1725 (getType()->isVectorTy() &&
1726 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1727 "Tried to create a logical operation on a non-integral type!");
1735 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1737 Instruction *InsertBefore) {
1738 assert(S1->getType() == S2->getType() &&
1739 "Cannot create binary operator with two operands of differing type!");
1740 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1743 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1745 BasicBlock *InsertAtEnd) {
1746 BinaryOperator *Res = Create(Op, S1, S2, Name);
1747 InsertAtEnd->getInstList().push_back(Res);
1751 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1752 Instruction *InsertBefore) {
1753 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1754 return new BinaryOperator(Instruction::Sub,
1756 Op->getType(), Name, InsertBefore);
1759 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1760 BasicBlock *InsertAtEnd) {
1761 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1762 return new BinaryOperator(Instruction::Sub,
1764 Op->getType(), Name, InsertAtEnd);
1767 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1768 Instruction *InsertBefore) {
1769 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1770 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertBefore);
1773 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1774 BasicBlock *InsertAtEnd) {
1775 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1776 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertAtEnd);
1779 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1780 Instruction *InsertBefore) {
1781 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1782 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertBefore);
1785 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1786 BasicBlock *InsertAtEnd) {
1787 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1788 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertAtEnd);
1791 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1792 Instruction *InsertBefore) {
1793 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1794 return new BinaryOperator(Instruction::FSub, zero, Op,
1795 Op->getType(), Name, InsertBefore);
1798 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1799 BasicBlock *InsertAtEnd) {
1800 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1801 return new BinaryOperator(Instruction::FSub, zero, Op,
1802 Op->getType(), Name, InsertAtEnd);
1805 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1806 Instruction *InsertBefore) {
1807 Constant *C = Constant::getAllOnesValue(Op->getType());
1808 return new BinaryOperator(Instruction::Xor, Op, C,
1809 Op->getType(), Name, InsertBefore);
1812 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1813 BasicBlock *InsertAtEnd) {
1814 Constant *AllOnes = Constant::getAllOnesValue(Op->getType());
1815 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1816 Op->getType(), Name, InsertAtEnd);
1820 // isConstantAllOnes - Helper function for several functions below
1821 static inline bool isConstantAllOnes(const Value *V) {
1822 if (const Constant *C = dyn_cast<Constant>(V))
1823 return C->isAllOnesValue();
1827 bool BinaryOperator::isNeg(const Value *V) {
1828 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1829 if (Bop->getOpcode() == Instruction::Sub)
1830 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0)))
1831 return C->isNegativeZeroValue();
1835 bool BinaryOperator::isFNeg(const Value *V, bool IgnoreZeroSign) {
1836 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1837 if (Bop->getOpcode() == Instruction::FSub)
1838 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0))) {
1839 if (!IgnoreZeroSign)
1840 IgnoreZeroSign = cast<Instruction>(V)->hasNoSignedZeros();
1841 return !IgnoreZeroSign ? C->isNegativeZeroValue() : C->isZeroValue();
1846 bool BinaryOperator::isNot(const Value *V) {
1847 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1848 return (Bop->getOpcode() == Instruction::Xor &&
1849 (isConstantAllOnes(Bop->getOperand(1)) ||
1850 isConstantAllOnes(Bop->getOperand(0))));
1854 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1855 return cast<BinaryOperator>(BinOp)->getOperand(1);
1858 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1859 return getNegArgument(const_cast<Value*>(BinOp));
1862 Value *BinaryOperator::getFNegArgument(Value *BinOp) {
1863 return cast<BinaryOperator>(BinOp)->getOperand(1);
1866 const Value *BinaryOperator::getFNegArgument(const Value *BinOp) {
1867 return getFNegArgument(const_cast<Value*>(BinOp));
1870 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1871 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1872 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1873 Value *Op0 = BO->getOperand(0);
1874 Value *Op1 = BO->getOperand(1);
1875 if (isConstantAllOnes(Op0)) return Op1;
1877 assert(isConstantAllOnes(Op1));
1881 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1882 return getNotArgument(const_cast<Value*>(BinOp));
1886 // swapOperands - Exchange the two operands to this instruction. This
1887 // instruction is safe to use on any binary instruction and does not
1888 // modify the semantics of the instruction. If the instruction is
1889 // order dependent (SetLT f.e.) the opcode is changed.
1891 bool BinaryOperator::swapOperands() {
1892 if (!isCommutative())
1893 return true; // Can't commute operands
1894 Op<0>().swap(Op<1>());
1898 void BinaryOperator::setHasNoUnsignedWrap(bool b) {
1899 cast<OverflowingBinaryOperator>(this)->setHasNoUnsignedWrap(b);
1902 void BinaryOperator::setHasNoSignedWrap(bool b) {
1903 cast<OverflowingBinaryOperator>(this)->setHasNoSignedWrap(b);
1906 void BinaryOperator::setIsExact(bool b) {
1907 cast<PossiblyExactOperator>(this)->setIsExact(b);
1910 bool BinaryOperator::hasNoUnsignedWrap() const {
1911 return cast<OverflowingBinaryOperator>(this)->hasNoUnsignedWrap();
1914 bool BinaryOperator::hasNoSignedWrap() const {
1915 return cast<OverflowingBinaryOperator>(this)->hasNoSignedWrap();
1918 bool BinaryOperator::isExact() const {
1919 return cast<PossiblyExactOperator>(this)->isExact();
1922 void BinaryOperator::copyIRFlags(const Value *V) {
1923 // Copy the wrapping flags.
1924 if (auto *OB = dyn_cast<OverflowingBinaryOperator>(V)) {
1925 setHasNoSignedWrap(OB->hasNoSignedWrap());
1926 setHasNoUnsignedWrap(OB->hasNoUnsignedWrap());
1929 // Copy the exact flag.
1930 if (auto *PE = dyn_cast<PossiblyExactOperator>(V))
1931 setIsExact(PE->isExact());
1933 // Copy the fast-math flags.
1934 if (auto *FP = dyn_cast<FPMathOperator>(V))
1935 copyFastMathFlags(FP->getFastMathFlags());
1938 void BinaryOperator::andIRFlags(const Value *V) {
1939 if (auto *OB = dyn_cast<OverflowingBinaryOperator>(V)) {
1940 setHasNoSignedWrap(hasNoSignedWrap() & OB->hasNoSignedWrap());
1941 setHasNoUnsignedWrap(hasNoUnsignedWrap() & OB->hasNoUnsignedWrap());
1944 if (auto *PE = dyn_cast<PossiblyExactOperator>(V))
1945 setIsExact(isExact() & PE->isExact());
1947 if (auto *FP = dyn_cast<FPMathOperator>(V)) {
1948 FastMathFlags FM = getFastMathFlags();
1949 FM &= FP->getFastMathFlags();
1950 copyFastMathFlags(FM);
1955 //===----------------------------------------------------------------------===//
1956 // FPMathOperator Class
1957 //===----------------------------------------------------------------------===//
1959 /// getFPAccuracy - Get the maximum error permitted by this operation in ULPs.
1960 /// An accuracy of 0.0 means that the operation should be performed with the
1961 /// default precision.
1962 float FPMathOperator::getFPAccuracy() const {
1964 cast<Instruction>(this)->getMetadata(LLVMContext::MD_fpmath);
1967 ConstantFP *Accuracy = mdconst::extract<ConstantFP>(MD->getOperand(0));
1968 return Accuracy->getValueAPF().convertToFloat();
1972 //===----------------------------------------------------------------------===//
1974 //===----------------------------------------------------------------------===//
1976 void CastInst::anchor() {}
1978 // Just determine if this cast only deals with integral->integral conversion.
1979 bool CastInst::isIntegerCast() const {
1980 switch (getOpcode()) {
1981 default: return false;
1982 case Instruction::ZExt:
1983 case Instruction::SExt:
1984 case Instruction::Trunc:
1986 case Instruction::BitCast:
1987 return getOperand(0)->getType()->isIntegerTy() &&
1988 getType()->isIntegerTy();
1992 bool CastInst::isLosslessCast() const {
1993 // Only BitCast can be lossless, exit fast if we're not BitCast
1994 if (getOpcode() != Instruction::BitCast)
1997 // Identity cast is always lossless
1998 Type* SrcTy = getOperand(0)->getType();
1999 Type* DstTy = getType();
2003 // Pointer to pointer is always lossless.
2004 if (SrcTy->isPointerTy())
2005 return DstTy->isPointerTy();
2006 return false; // Other types have no identity values
2009 /// This function determines if the CastInst does not require any bits to be
2010 /// changed in order to effect the cast. Essentially, it identifies cases where
2011 /// no code gen is necessary for the cast, hence the name no-op cast. For
2012 /// example, the following are all no-op casts:
2013 /// # bitcast i32* %x to i8*
2014 /// # bitcast <2 x i32> %x to <4 x i16>
2015 /// # ptrtoint i32* %x to i32 ; on 32-bit plaforms only
2016 /// @brief Determine if the described cast is a no-op.
2017 bool CastInst::isNoopCast(Instruction::CastOps Opcode,
2022 default: llvm_unreachable("Invalid CastOp");
2023 case Instruction::Trunc:
2024 case Instruction::ZExt:
2025 case Instruction::SExt:
2026 case Instruction::FPTrunc:
2027 case Instruction::FPExt:
2028 case Instruction::UIToFP:
2029 case Instruction::SIToFP:
2030 case Instruction::FPToUI:
2031 case Instruction::FPToSI:
2032 case Instruction::AddrSpaceCast:
2033 // TODO: Target informations may give a more accurate answer here.
2035 case Instruction::BitCast:
2036 return true; // BitCast never modifies bits.
2037 case Instruction::PtrToInt:
2038 return IntPtrTy->getScalarSizeInBits() ==
2039 DestTy->getScalarSizeInBits();
2040 case Instruction::IntToPtr:
2041 return IntPtrTy->getScalarSizeInBits() ==
2042 SrcTy->getScalarSizeInBits();
2046 /// @brief Determine if a cast is a no-op.
2047 bool CastInst::isNoopCast(Type *IntPtrTy) const {
2048 return isNoopCast(getOpcode(), getOperand(0)->getType(), getType(), IntPtrTy);
2051 bool CastInst::isNoopCast(const DataLayout *DL) const {
2053 // Assume maximum pointer size.
2054 return isNoopCast(Type::getInt64Ty(getContext()));
2057 Type *PtrOpTy = nullptr;
2058 if (getOpcode() == Instruction::PtrToInt)
2059 PtrOpTy = getOperand(0)->getType();
2060 else if (getOpcode() == Instruction::IntToPtr)
2061 PtrOpTy = getType();
2063 Type *IntPtrTy = PtrOpTy
2064 ? DL->getIntPtrType(PtrOpTy)
2065 : DL->getIntPtrType(getContext(), 0);
2067 return isNoopCast(getOpcode(), getOperand(0)->getType(), getType(), IntPtrTy);
2070 /// This function determines if a pair of casts can be eliminated and what
2071 /// opcode should be used in the elimination. This assumes that there are two
2072 /// instructions like this:
2073 /// * %F = firstOpcode SrcTy %x to MidTy
2074 /// * %S = secondOpcode MidTy %F to DstTy
2075 /// The function returns a resultOpcode so these two casts can be replaced with:
2076 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
2077 /// If no such cast is permited, the function returns 0.
2078 unsigned CastInst::isEliminableCastPair(
2079 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
2080 Type *SrcTy, Type *MidTy, Type *DstTy, Type *SrcIntPtrTy, Type *MidIntPtrTy,
2081 Type *DstIntPtrTy) {
2082 // Define the 144 possibilities for these two cast instructions. The values
2083 // in this matrix determine what to do in a given situation and select the
2084 // case in the switch below. The rows correspond to firstOp, the columns
2085 // correspond to secondOp. In looking at the table below, keep in mind
2086 // the following cast properties:
2088 // Size Compare Source Destination
2089 // Operator Src ? Size Type Sign Type Sign
2090 // -------- ------------ ------------------- ---------------------
2091 // TRUNC > Integer Any Integral Any
2092 // ZEXT < Integral Unsigned Integer Any
2093 // SEXT < Integral Signed Integer Any
2094 // FPTOUI n/a FloatPt n/a Integral Unsigned
2095 // FPTOSI n/a FloatPt n/a Integral Signed
2096 // UITOFP n/a Integral Unsigned FloatPt n/a
2097 // SITOFP n/a Integral Signed FloatPt n/a
2098 // FPTRUNC > FloatPt n/a FloatPt n/a
2099 // FPEXT < FloatPt n/a FloatPt n/a
2100 // PTRTOINT n/a Pointer n/a Integral Unsigned
2101 // INTTOPTR n/a Integral Unsigned Pointer n/a
2102 // BITCAST = FirstClass n/a FirstClass n/a
2103 // ADDRSPCST n/a Pointer n/a Pointer n/a
2105 // NOTE: some transforms are safe, but we consider them to be non-profitable.
2106 // For example, we could merge "fptoui double to i32" + "zext i32 to i64",
2107 // into "fptoui double to i64", but this loses information about the range
2108 // of the produced value (we no longer know the top-part is all zeros).
2109 // Further this conversion is often much more expensive for typical hardware,
2110 // and causes issues when building libgcc. We disallow fptosi+sext for the
2112 const unsigned numCastOps =
2113 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
2114 static const uint8_t CastResults[numCastOps][numCastOps] = {
2115 // T F F U S F F P I B A -+
2116 // R Z S P P I I T P 2 N T S |
2117 // U E E 2 2 2 2 R E I T C C +- secondOp
2118 // N X X U S F F N X N 2 V V |
2119 // C T T I I P P C T T P T T -+
2120 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3, 0}, // Trunc -+
2121 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3, 0}, // ZExt |
2122 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3, 0}, // SExt |
2123 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3, 0}, // FPToUI |
2124 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3, 0}, // FPToSI |
2125 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4, 0}, // UIToFP +- firstOp
2126 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4, 0}, // SIToFP |
2127 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4, 0}, // FPTrunc |
2128 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4, 0}, // FPExt |
2129 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3, 0}, // PtrToInt |
2130 { 99,99,99,99,99,99,99,99,99,11,99,15, 0}, // IntToPtr |
2131 { 5, 5, 5, 6, 6, 5, 5, 6, 6,16, 5, 1,14}, // BitCast |
2132 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,13,12}, // AddrSpaceCast -+
2135 // If either of the casts are a bitcast from scalar to vector, disallow the
2136 // merging. However, bitcast of A->B->A are allowed.
2137 bool isFirstBitcast = (firstOp == Instruction::BitCast);
2138 bool isSecondBitcast = (secondOp == Instruction::BitCast);
2139 bool chainedBitcast = (SrcTy == DstTy && isFirstBitcast && isSecondBitcast);
2141 // Check if any of the bitcasts convert scalars<->vectors.
2142 if ((isFirstBitcast && isa<VectorType>(SrcTy) != isa<VectorType>(MidTy)) ||
2143 (isSecondBitcast && isa<VectorType>(MidTy) != isa<VectorType>(DstTy)))
2144 // Unless we are bitcasing to the original type, disallow optimizations.
2145 if (!chainedBitcast) return 0;
2147 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
2148 [secondOp-Instruction::CastOpsBegin];
2151 // Categorically disallowed.
2154 // Allowed, use first cast's opcode.
2157 // Allowed, use second cast's opcode.
2160 // No-op cast in second op implies firstOp as long as the DestTy
2161 // is integer and we are not converting between a vector and a
2163 if (!SrcTy->isVectorTy() && DstTy->isIntegerTy())
2167 // No-op cast in second op implies firstOp as long as the DestTy
2168 // is floating point.
2169 if (DstTy->isFloatingPointTy())
2173 // No-op cast in first op implies secondOp as long as the SrcTy
2175 if (SrcTy->isIntegerTy())
2179 // No-op cast in first op implies secondOp as long as the SrcTy
2180 // is a floating point.
2181 if (SrcTy->isFloatingPointTy())
2185 // Cannot simplify if address spaces are different!
2186 if (SrcTy->getPointerAddressSpace() != DstTy->getPointerAddressSpace())
2189 unsigned MidSize = MidTy->getScalarSizeInBits();
2190 // We can still fold this without knowing the actual sizes as long we
2191 // know that the intermediate pointer is the largest possible
2193 // FIXME: Is this always true?
2195 return Instruction::BitCast;
2197 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size.
2198 if (!SrcIntPtrTy || DstIntPtrTy != SrcIntPtrTy)
2200 unsigned PtrSize = SrcIntPtrTy->getScalarSizeInBits();
2201 if (MidSize >= PtrSize)
2202 return Instruction::BitCast;
2206 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
2207 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
2208 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
2209 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2210 unsigned DstSize = DstTy->getScalarSizeInBits();
2211 if (SrcSize == DstSize)
2212 return Instruction::BitCast;
2213 else if (SrcSize < DstSize)
2218 // zext, sext -> zext, because sext can't sign extend after zext
2219 return Instruction::ZExt;
2221 // fpext followed by ftrunc is allowed if the bit size returned to is
2222 // the same as the original, in which case its just a bitcast
2224 return Instruction::BitCast;
2225 return 0; // If the types are not the same we can't eliminate it.
2227 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
2230 unsigned PtrSize = MidIntPtrTy->getScalarSizeInBits();
2231 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2232 unsigned DstSize = DstTy->getScalarSizeInBits();
2233 if (SrcSize <= PtrSize && SrcSize == DstSize)
2234 return Instruction::BitCast;
2238 // addrspacecast, addrspacecast -> bitcast, if SrcAS == DstAS
2239 // addrspacecast, addrspacecast -> addrspacecast, if SrcAS != DstAS
2240 if (SrcTy->getPointerAddressSpace() != DstTy->getPointerAddressSpace())
2241 return Instruction::AddrSpaceCast;
2242 return Instruction::BitCast;
2245 // FIXME: this state can be merged with (1), but the following assert
2246 // is useful to check the correcteness of the sequence due to semantic
2247 // change of bitcast.
2249 SrcTy->isPtrOrPtrVectorTy() &&
2250 MidTy->isPtrOrPtrVectorTy() &&
2251 DstTy->isPtrOrPtrVectorTy() &&
2252 SrcTy->getPointerAddressSpace() != MidTy->getPointerAddressSpace() &&
2253 MidTy->getPointerAddressSpace() == DstTy->getPointerAddressSpace() &&
2254 "Illegal addrspacecast, bitcast sequence!");
2255 // Allowed, use first cast's opcode
2258 // bitcast, addrspacecast -> addrspacecast if the element type of
2259 // bitcast's source is the same as that of addrspacecast's destination.
2260 if (SrcTy->getPointerElementType() == DstTy->getPointerElementType())
2261 return Instruction::AddrSpaceCast;
2265 // FIXME: this state can be merged with (1), but the following assert
2266 // is useful to check the correcteness of the sequence due to semantic
2267 // change of bitcast.
2269 SrcTy->isIntOrIntVectorTy() &&
2270 MidTy->isPtrOrPtrVectorTy() &&
2271 DstTy->isPtrOrPtrVectorTy() &&
2272 MidTy->getPointerAddressSpace() == DstTy->getPointerAddressSpace() &&
2273 "Illegal inttoptr, bitcast sequence!");
2274 // Allowed, use first cast's opcode
2277 // FIXME: this state can be merged with (2), but the following assert
2278 // is useful to check the correcteness of the sequence due to semantic
2279 // change of bitcast.
2281 SrcTy->isPtrOrPtrVectorTy() &&
2282 MidTy->isPtrOrPtrVectorTy() &&
2283 DstTy->isIntOrIntVectorTy() &&
2284 SrcTy->getPointerAddressSpace() == MidTy->getPointerAddressSpace() &&
2285 "Illegal bitcast, ptrtoint sequence!");
2286 // Allowed, use second cast's opcode
2289 // Cast combination can't happen (error in input). This is for all cases
2290 // where the MidTy is not the same for the two cast instructions.
2291 llvm_unreachable("Invalid Cast Combination");
2293 llvm_unreachable("Error in CastResults table!!!");
2297 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2298 const Twine &Name, Instruction *InsertBefore) {
2299 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2300 // Construct and return the appropriate CastInst subclass
2302 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
2303 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
2304 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
2305 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
2306 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
2307 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
2308 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
2309 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
2310 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
2311 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
2312 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
2313 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
2314 case AddrSpaceCast: return new AddrSpaceCastInst (S, Ty, Name, InsertBefore);
2315 default: llvm_unreachable("Invalid opcode provided");
2319 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2320 const Twine &Name, BasicBlock *InsertAtEnd) {
2321 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2322 // Construct and return the appropriate CastInst subclass
2324 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
2325 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
2326 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
2327 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
2328 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
2329 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
2330 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
2331 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
2332 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
2333 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
2334 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
2335 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
2336 case AddrSpaceCast: return new AddrSpaceCastInst (S, Ty, Name, InsertAtEnd);
2337 default: llvm_unreachable("Invalid opcode provided");
2341 CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
2343 Instruction *InsertBefore) {
2344 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2345 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2346 return Create(Instruction::ZExt, S, Ty, Name, InsertBefore);
2349 CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
2351 BasicBlock *InsertAtEnd) {
2352 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2353 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2354 return Create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
2357 CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
2359 Instruction *InsertBefore) {
2360 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2361 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2362 return Create(Instruction::SExt, S, Ty, Name, InsertBefore);
2365 CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
2367 BasicBlock *InsertAtEnd) {
2368 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2369 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2370 return Create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
2373 CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
2375 Instruction *InsertBefore) {
2376 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2377 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2378 return Create(Instruction::Trunc, S, Ty, Name, InsertBefore);
2381 CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
2383 BasicBlock *InsertAtEnd) {
2384 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2385 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2386 return Create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
2389 CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
2391 BasicBlock *InsertAtEnd) {
2392 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
2393 assert((Ty->isIntOrIntVectorTy() || Ty->isPtrOrPtrVectorTy()) &&
2395 assert(Ty->isVectorTy() == S->getType()->isVectorTy() && "Invalid cast");
2396 assert((!Ty->isVectorTy() ||
2397 Ty->getVectorNumElements() == S->getType()->getVectorNumElements()) &&
2400 if (Ty->isIntOrIntVectorTy())
2401 return Create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
2403 return CreatePointerBitCastOrAddrSpaceCast(S, Ty, Name, InsertAtEnd);
2406 /// @brief Create a BitCast or a PtrToInt cast instruction
2407 CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
2409 Instruction *InsertBefore) {
2410 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
2411 assert((Ty->isIntOrIntVectorTy() || Ty->isPtrOrPtrVectorTy()) &&
2413 assert(Ty->isVectorTy() == S->getType()->isVectorTy() && "Invalid cast");
2414 assert((!Ty->isVectorTy() ||
2415 Ty->getVectorNumElements() == S->getType()->getVectorNumElements()) &&
2418 if (Ty->isIntOrIntVectorTy())
2419 return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
2421 return CreatePointerBitCastOrAddrSpaceCast(S, Ty, Name, InsertBefore);
2424 CastInst *CastInst::CreatePointerBitCastOrAddrSpaceCast(
2427 BasicBlock *InsertAtEnd) {
2428 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
2429 assert(Ty->isPtrOrPtrVectorTy() && "Invalid cast");
2431 if (S->getType()->getPointerAddressSpace() != Ty->getPointerAddressSpace())
2432 return Create(Instruction::AddrSpaceCast, S, Ty, Name, InsertAtEnd);
2434 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2437 CastInst *CastInst::CreatePointerBitCastOrAddrSpaceCast(
2440 Instruction *InsertBefore) {
2441 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
2442 assert(Ty->isPtrOrPtrVectorTy() && "Invalid cast");
2444 if (S->getType()->getPointerAddressSpace() != Ty->getPointerAddressSpace())
2445 return Create(Instruction::AddrSpaceCast, S, Ty, Name, InsertBefore);
2447 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2450 CastInst *CastInst::CreateBitOrPointerCast(Value *S, Type *Ty,
2452 Instruction *InsertBefore) {
2453 if (S->getType()->isPointerTy() && Ty->isIntegerTy())
2454 return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
2455 if (S->getType()->isIntegerTy() && Ty->isPointerTy())
2456 return Create(Instruction::IntToPtr, S, Ty, Name, InsertBefore);
2458 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2461 CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
2462 bool isSigned, const Twine &Name,
2463 Instruction *InsertBefore) {
2464 assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&
2465 "Invalid integer cast");
2466 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2467 unsigned DstBits = Ty->getScalarSizeInBits();
2468 Instruction::CastOps opcode =
2469 (SrcBits == DstBits ? Instruction::BitCast :
2470 (SrcBits > DstBits ? Instruction::Trunc :
2471 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2472 return Create(opcode, C, Ty, Name, InsertBefore);
2475 CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
2476 bool isSigned, const Twine &Name,
2477 BasicBlock *InsertAtEnd) {
2478 assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&
2480 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2481 unsigned DstBits = Ty->getScalarSizeInBits();
2482 Instruction::CastOps opcode =
2483 (SrcBits == DstBits ? Instruction::BitCast :
2484 (SrcBits > DstBits ? Instruction::Trunc :
2485 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2486 return Create(opcode, C, Ty, Name, InsertAtEnd);
2489 CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
2491 Instruction *InsertBefore) {
2492 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
2494 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2495 unsigned DstBits = Ty->getScalarSizeInBits();
2496 Instruction::CastOps opcode =
2497 (SrcBits == DstBits ? Instruction::BitCast :
2498 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2499 return Create(opcode, C, Ty, Name, InsertBefore);
2502 CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
2504 BasicBlock *InsertAtEnd) {
2505 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
2507 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2508 unsigned DstBits = Ty->getScalarSizeInBits();
2509 Instruction::CastOps opcode =
2510 (SrcBits == DstBits ? Instruction::BitCast :
2511 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2512 return Create(opcode, C, Ty, Name, InsertAtEnd);
2515 // Check whether it is valid to call getCastOpcode for these types.
2516 // This routine must be kept in sync with getCastOpcode.
2517 bool CastInst::isCastable(Type *SrcTy, Type *DestTy) {
2518 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2521 if (SrcTy == DestTy)
2524 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy))
2525 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy))
2526 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2527 // An element by element cast. Valid if casting the elements is valid.
2528 SrcTy = SrcVecTy->getElementType();
2529 DestTy = DestVecTy->getElementType();
2532 // Get the bit sizes, we'll need these
2533 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2534 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2536 // Run through the possibilities ...
2537 if (DestTy->isIntegerTy()) { // Casting to integral
2538 if (SrcTy->isIntegerTy()) { // Casting from integral
2540 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2542 } else if (SrcTy->isVectorTy()) { // Casting from vector
2543 return DestBits == SrcBits;
2544 } else { // Casting from something else
2545 return SrcTy->isPointerTy();
2547 } else if (DestTy->isFloatingPointTy()) { // Casting to floating pt
2548 if (SrcTy->isIntegerTy()) { // Casting from integral
2550 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2552 } else if (SrcTy->isVectorTy()) { // Casting from vector
2553 return DestBits == SrcBits;
2554 } else { // Casting from something else
2557 } else if (DestTy->isVectorTy()) { // Casting to vector
2558 return DestBits == SrcBits;
2559 } else if (DestTy->isPointerTy()) { // Casting to pointer
2560 if (SrcTy->isPointerTy()) { // Casting from pointer
2562 } else if (SrcTy->isIntegerTy()) { // Casting from integral
2564 } else { // Casting from something else
2567 } else if (DestTy->isX86_MMXTy()) {
2568 if (SrcTy->isVectorTy()) {
2569 return DestBits == SrcBits; // 64-bit vector to MMX
2573 } else { // Casting to something else
2578 bool CastInst::isBitCastable(Type *SrcTy, Type *DestTy) {
2579 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2582 if (SrcTy == DestTy)
2585 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy)) {
2586 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy)) {
2587 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2588 // An element by element cast. Valid if casting the elements is valid.
2589 SrcTy = SrcVecTy->getElementType();
2590 DestTy = DestVecTy->getElementType();
2595 if (PointerType *DestPtrTy = dyn_cast<PointerType>(DestTy)) {
2596 if (PointerType *SrcPtrTy = dyn_cast<PointerType>(SrcTy)) {
2597 return SrcPtrTy->getAddressSpace() == DestPtrTy->getAddressSpace();
2601 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2602 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2604 // Could still have vectors of pointers if the number of elements doesn't
2606 if (SrcBits == 0 || DestBits == 0)
2609 if (SrcBits != DestBits)
2612 if (DestTy->isX86_MMXTy() || SrcTy->isX86_MMXTy())
2618 bool CastInst::isBitOrNoopPointerCastable(Type *SrcTy, Type *DestTy,
2619 const DataLayout *DL) {
2620 if (auto *PtrTy = dyn_cast<PointerType>(SrcTy))
2621 if (auto *IntTy = dyn_cast<IntegerType>(DestTy))
2622 return DL && IntTy->getBitWidth() == DL->getPointerTypeSizeInBits(PtrTy);
2623 if (auto *PtrTy = dyn_cast<PointerType>(DestTy))
2624 if (auto *IntTy = dyn_cast<IntegerType>(SrcTy))
2625 return DL && IntTy->getBitWidth() == DL->getPointerTypeSizeInBits(PtrTy);
2627 return isBitCastable(SrcTy, DestTy);
2630 // Provide a way to get a "cast" where the cast opcode is inferred from the
2631 // types and size of the operand. This, basically, is a parallel of the
2632 // logic in the castIsValid function below. This axiom should hold:
2633 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
2634 // should not assert in castIsValid. In other words, this produces a "correct"
2635 // casting opcode for the arguments passed to it.
2636 // This routine must be kept in sync with isCastable.
2637 Instruction::CastOps
2638 CastInst::getCastOpcode(
2639 const Value *Src, bool SrcIsSigned, Type *DestTy, bool DestIsSigned) {
2640 Type *SrcTy = Src->getType();
2642 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2643 "Only first class types are castable!");
2645 if (SrcTy == DestTy)
2648 // FIXME: Check address space sizes here
2649 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy))
2650 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy))
2651 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2652 // An element by element cast. Find the appropriate opcode based on the
2654 SrcTy = SrcVecTy->getElementType();
2655 DestTy = DestVecTy->getElementType();
2658 // Get the bit sizes, we'll need these
2659 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2660 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2662 // Run through the possibilities ...
2663 if (DestTy->isIntegerTy()) { // Casting to integral
2664 if (SrcTy->isIntegerTy()) { // Casting from integral
2665 if (DestBits < SrcBits)
2666 return Trunc; // int -> smaller int
2667 else if (DestBits > SrcBits) { // its an extension
2669 return SExt; // signed -> SEXT
2671 return ZExt; // unsigned -> ZEXT
2673 return BitCast; // Same size, No-op cast
2675 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2677 return FPToSI; // FP -> sint
2679 return FPToUI; // FP -> uint
2680 } else if (SrcTy->isVectorTy()) {
2681 assert(DestBits == SrcBits &&
2682 "Casting vector to integer of different width");
2683 return BitCast; // Same size, no-op cast
2685 assert(SrcTy->isPointerTy() &&
2686 "Casting from a value that is not first-class type");
2687 return PtrToInt; // ptr -> int
2689 } else if (DestTy->isFloatingPointTy()) { // Casting to floating pt
2690 if (SrcTy->isIntegerTy()) { // Casting from integral
2692 return SIToFP; // sint -> FP
2694 return UIToFP; // uint -> FP
2695 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2696 if (DestBits < SrcBits) {
2697 return FPTrunc; // FP -> smaller FP
2698 } else if (DestBits > SrcBits) {
2699 return FPExt; // FP -> larger FP
2701 return BitCast; // same size, no-op cast
2703 } else if (SrcTy->isVectorTy()) {
2704 assert(DestBits == SrcBits &&
2705 "Casting vector to floating point of different width");
2706 return BitCast; // same size, no-op cast
2708 llvm_unreachable("Casting pointer or non-first class to float");
2709 } else if (DestTy->isVectorTy()) {
2710 assert(DestBits == SrcBits &&
2711 "Illegal cast to vector (wrong type or size)");
2713 } else if (DestTy->isPointerTy()) {
2714 if (SrcTy->isPointerTy()) {
2715 if (DestTy->getPointerAddressSpace() != SrcTy->getPointerAddressSpace())
2716 return AddrSpaceCast;
2717 return BitCast; // ptr -> ptr
2718 } else if (SrcTy->isIntegerTy()) {
2719 return IntToPtr; // int -> ptr
2721 llvm_unreachable("Casting pointer to other than pointer or int");
2722 } else if (DestTy->isX86_MMXTy()) {
2723 if (SrcTy->isVectorTy()) {
2724 assert(DestBits == SrcBits && "Casting vector of wrong width to X86_MMX");
2725 return BitCast; // 64-bit vector to MMX
2727 llvm_unreachable("Illegal cast to X86_MMX");
2729 llvm_unreachable("Casting to type that is not first-class");
2732 //===----------------------------------------------------------------------===//
2733 // CastInst SubClass Constructors
2734 //===----------------------------------------------------------------------===//
2736 /// Check that the construction parameters for a CastInst are correct. This
2737 /// could be broken out into the separate constructors but it is useful to have
2738 /// it in one place and to eliminate the redundant code for getting the sizes
2739 /// of the types involved.
2741 CastInst::castIsValid(Instruction::CastOps op, Value *S, Type *DstTy) {
2743 // Check for type sanity on the arguments
2744 Type *SrcTy = S->getType();
2746 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType() ||
2747 SrcTy->isAggregateType() || DstTy->isAggregateType())
2750 // Get the size of the types in bits, we'll need this later
2751 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2752 unsigned DstBitSize = DstTy->getScalarSizeInBits();
2754 // If these are vector types, get the lengths of the vectors (using zero for
2755 // scalar types means that checking that vector lengths match also checks that
2756 // scalars are not being converted to vectors or vectors to scalars).
2757 unsigned SrcLength = SrcTy->isVectorTy() ?
2758 cast<VectorType>(SrcTy)->getNumElements() : 0;
2759 unsigned DstLength = DstTy->isVectorTy() ?
2760 cast<VectorType>(DstTy)->getNumElements() : 0;
2762 // Switch on the opcode provided
2764 default: return false; // This is an input error
2765 case Instruction::Trunc:
2766 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2767 SrcLength == DstLength && SrcBitSize > DstBitSize;
2768 case Instruction::ZExt:
2769 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2770 SrcLength == DstLength && SrcBitSize < DstBitSize;
2771 case Instruction::SExt:
2772 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2773 SrcLength == DstLength && SrcBitSize < DstBitSize;
2774 case Instruction::FPTrunc:
2775 return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
2776 SrcLength == DstLength && SrcBitSize > DstBitSize;
2777 case Instruction::FPExt:
2778 return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
2779 SrcLength == DstLength && SrcBitSize < DstBitSize;
2780 case Instruction::UIToFP:
2781 case Instruction::SIToFP:
2782 return SrcTy->isIntOrIntVectorTy() && DstTy->isFPOrFPVectorTy() &&
2783 SrcLength == DstLength;
2784 case Instruction::FPToUI:
2785 case Instruction::FPToSI:
2786 return SrcTy->isFPOrFPVectorTy() && DstTy->isIntOrIntVectorTy() &&
2787 SrcLength == DstLength;
2788 case Instruction::PtrToInt:
2789 if (isa<VectorType>(SrcTy) != isa<VectorType>(DstTy))
2791 if (VectorType *VT = dyn_cast<VectorType>(SrcTy))
2792 if (VT->getNumElements() != cast<VectorType>(DstTy)->getNumElements())
2794 return SrcTy->getScalarType()->isPointerTy() &&
2795 DstTy->getScalarType()->isIntegerTy();
2796 case Instruction::IntToPtr:
2797 if (isa<VectorType>(SrcTy) != isa<VectorType>(DstTy))
2799 if (VectorType *VT = dyn_cast<VectorType>(SrcTy))
2800 if (VT->getNumElements() != cast<VectorType>(DstTy)->getNumElements())
2802 return SrcTy->getScalarType()->isIntegerTy() &&
2803 DstTy->getScalarType()->isPointerTy();
2804 case Instruction::BitCast: {
2805 PointerType *SrcPtrTy = dyn_cast<PointerType>(SrcTy->getScalarType());
2806 PointerType *DstPtrTy = dyn_cast<PointerType>(DstTy->getScalarType());
2808 // BitCast implies a no-op cast of type only. No bits change.
2809 // However, you can't cast pointers to anything but pointers.
2810 if (!SrcPtrTy != !DstPtrTy)
2813 // For non-pointer cases, the cast is okay if the source and destination bit
2814 // widths are identical.
2816 return SrcTy->getPrimitiveSizeInBits() == DstTy->getPrimitiveSizeInBits();
2818 // If both are pointers then the address spaces must match.
2819 if (SrcPtrTy->getAddressSpace() != DstPtrTy->getAddressSpace())
2822 // A vector of pointers must have the same number of elements.
2823 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy)) {
2824 if (VectorType *DstVecTy = dyn_cast<VectorType>(DstTy))
2825 return (SrcVecTy->getNumElements() == DstVecTy->getNumElements());
2832 case Instruction::AddrSpaceCast: {
2833 PointerType *SrcPtrTy = dyn_cast<PointerType>(SrcTy->getScalarType());
2837 PointerType *DstPtrTy = dyn_cast<PointerType>(DstTy->getScalarType());
2841 if (SrcPtrTy->getAddressSpace() == DstPtrTy->getAddressSpace())
2844 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy)) {
2845 if (VectorType *DstVecTy = dyn_cast<VectorType>(DstTy))
2846 return (SrcVecTy->getNumElements() == DstVecTy->getNumElements());
2856 TruncInst::TruncInst(
2857 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2858 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2859 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2862 TruncInst::TruncInst(
2863 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2864 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2865 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2869 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2870 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2871 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2875 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2876 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2877 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2880 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2881 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2882 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2886 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2887 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2888 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2891 FPTruncInst::FPTruncInst(
2892 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2893 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2894 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2897 FPTruncInst::FPTruncInst(
2898 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2899 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2900 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2903 FPExtInst::FPExtInst(
2904 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2905 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2906 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2909 FPExtInst::FPExtInst(
2910 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2911 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2912 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2915 UIToFPInst::UIToFPInst(
2916 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2917 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2918 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2921 UIToFPInst::UIToFPInst(
2922 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2923 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2924 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2927 SIToFPInst::SIToFPInst(
2928 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2929 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2930 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2933 SIToFPInst::SIToFPInst(
2934 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2935 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2936 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2939 FPToUIInst::FPToUIInst(
2940 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2941 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2942 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2945 FPToUIInst::FPToUIInst(
2946 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2947 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2948 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2951 FPToSIInst::FPToSIInst(
2952 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2953 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2954 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2957 FPToSIInst::FPToSIInst(
2958 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2959 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2960 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2963 PtrToIntInst::PtrToIntInst(
2964 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2965 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2966 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2969 PtrToIntInst::PtrToIntInst(
2970 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2971 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2972 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2975 IntToPtrInst::IntToPtrInst(
2976 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2977 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2978 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2981 IntToPtrInst::IntToPtrInst(
2982 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2983 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2984 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2987 BitCastInst::BitCastInst(
2988 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2989 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2990 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2993 BitCastInst::BitCastInst(
2994 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2995 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2996 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2999 AddrSpaceCastInst::AddrSpaceCastInst(
3000 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3001 ) : CastInst(Ty, AddrSpaceCast, S, Name, InsertBefore) {
3002 assert(castIsValid(getOpcode(), S, Ty) && "Illegal AddrSpaceCast");
3005 AddrSpaceCastInst::AddrSpaceCastInst(
3006 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3007 ) : CastInst(Ty, AddrSpaceCast, S, Name, InsertAtEnd) {
3008 assert(castIsValid(getOpcode(), S, Ty) && "Illegal AddrSpaceCast");
3011 //===----------------------------------------------------------------------===//
3013 //===----------------------------------------------------------------------===//
3015 void CmpInst::anchor() {}
3017 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
3018 Value *LHS, Value *RHS, const Twine &Name,
3019 Instruction *InsertBefore)
3020 : Instruction(ty, op,
3021 OperandTraits<CmpInst>::op_begin(this),
3022 OperandTraits<CmpInst>::operands(this),
3026 setPredicate((Predicate)predicate);
3030 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
3031 Value *LHS, Value *RHS, const Twine &Name,
3032 BasicBlock *InsertAtEnd)
3033 : Instruction(ty, op,
3034 OperandTraits<CmpInst>::op_begin(this),
3035 OperandTraits<CmpInst>::operands(this),
3039 setPredicate((Predicate)predicate);
3044 CmpInst::Create(OtherOps Op, unsigned short predicate,
3045 Value *S1, Value *S2,
3046 const Twine &Name, Instruction *InsertBefore) {
3047 if (Op == Instruction::ICmp) {
3049 return new ICmpInst(InsertBefore, CmpInst::Predicate(predicate),
3052 return new ICmpInst(CmpInst::Predicate(predicate),
3057 return new FCmpInst(InsertBefore, CmpInst::Predicate(predicate),
3060 return new FCmpInst(CmpInst::Predicate(predicate),
3065 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
3066 const Twine &Name, BasicBlock *InsertAtEnd) {
3067 if (Op == Instruction::ICmp) {
3068 return new ICmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
3071 return new FCmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
3075 void CmpInst::swapOperands() {
3076 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
3079 cast<FCmpInst>(this)->swapOperands();
3082 bool CmpInst::isCommutative() const {
3083 if (const ICmpInst *IC = dyn_cast<ICmpInst>(this))
3084 return IC->isCommutative();
3085 return cast<FCmpInst>(this)->isCommutative();
3088 bool CmpInst::isEquality() const {
3089 if (const ICmpInst *IC = dyn_cast<ICmpInst>(this))
3090 return IC->isEquality();
3091 return cast<FCmpInst>(this)->isEquality();
3095 CmpInst::Predicate CmpInst::getInversePredicate(Predicate pred) {
3097 default: llvm_unreachable("Unknown cmp predicate!");
3098 case ICMP_EQ: return ICMP_NE;
3099 case ICMP_NE: return ICMP_EQ;
3100 case ICMP_UGT: return ICMP_ULE;
3101 case ICMP_ULT: return ICMP_UGE;
3102 case ICMP_UGE: return ICMP_ULT;
3103 case ICMP_ULE: return ICMP_UGT;
3104 case ICMP_SGT: return ICMP_SLE;
3105 case ICMP_SLT: return ICMP_SGE;
3106 case ICMP_SGE: return ICMP_SLT;
3107 case ICMP_SLE: return ICMP_SGT;
3109 case FCMP_OEQ: return FCMP_UNE;
3110 case FCMP_ONE: return FCMP_UEQ;
3111 case FCMP_OGT: return FCMP_ULE;
3112 case FCMP_OLT: return FCMP_UGE;
3113 case FCMP_OGE: return FCMP_ULT;
3114 case FCMP_OLE: return FCMP_UGT;
3115 case FCMP_UEQ: return FCMP_ONE;
3116 case FCMP_UNE: return FCMP_OEQ;
3117 case FCMP_UGT: return FCMP_OLE;
3118 case FCMP_ULT: return FCMP_OGE;
3119 case FCMP_UGE: return FCMP_OLT;
3120 case FCMP_ULE: return FCMP_OGT;
3121 case FCMP_ORD: return FCMP_UNO;
3122 case FCMP_UNO: return FCMP_ORD;
3123 case FCMP_TRUE: return FCMP_FALSE;
3124 case FCMP_FALSE: return FCMP_TRUE;
3128 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
3130 default: llvm_unreachable("Unknown icmp predicate!");
3131 case ICMP_EQ: case ICMP_NE:
3132 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
3134 case ICMP_UGT: return ICMP_SGT;
3135 case ICMP_ULT: return ICMP_SLT;
3136 case ICMP_UGE: return ICMP_SGE;
3137 case ICMP_ULE: return ICMP_SLE;
3141 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
3143 default: llvm_unreachable("Unknown icmp predicate!");
3144 case ICMP_EQ: case ICMP_NE:
3145 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
3147 case ICMP_SGT: return ICMP_UGT;
3148 case ICMP_SLT: return ICMP_ULT;
3149 case ICMP_SGE: return ICMP_UGE;
3150 case ICMP_SLE: return ICMP_ULE;
3154 /// Initialize a set of values that all satisfy the condition with C.
3157 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
3160 uint32_t BitWidth = C.getBitWidth();
3162 default: llvm_unreachable("Invalid ICmp opcode to ConstantRange ctor!");
3163 case ICmpInst::ICMP_EQ: ++Upper; break;
3164 case ICmpInst::ICMP_NE: ++Lower; break;
3165 case ICmpInst::ICMP_ULT:
3166 Lower = APInt::getMinValue(BitWidth);
3167 // Check for an empty-set condition.
3169 return ConstantRange(BitWidth, /*isFullSet=*/false);
3171 case ICmpInst::ICMP_SLT:
3172 Lower = APInt::getSignedMinValue(BitWidth);
3173 // Check for an empty-set condition.
3175 return ConstantRange(BitWidth, /*isFullSet=*/false);
3177 case ICmpInst::ICMP_UGT:
3178 ++Lower; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
3179 // Check for an empty-set condition.
3181 return ConstantRange(BitWidth, /*isFullSet=*/false);
3183 case ICmpInst::ICMP_SGT:
3184 ++Lower; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
3185 // Check for an empty-set condition.
3187 return ConstantRange(BitWidth, /*isFullSet=*/false);
3189 case ICmpInst::ICMP_ULE:
3190 Lower = APInt::getMinValue(BitWidth); ++Upper;
3191 // Check for a full-set condition.
3193 return ConstantRange(BitWidth, /*isFullSet=*/true);
3195 case ICmpInst::ICMP_SLE:
3196 Lower = APInt::getSignedMinValue(BitWidth); ++Upper;
3197 // Check for a full-set condition.
3199 return ConstantRange(BitWidth, /*isFullSet=*/true);
3201 case ICmpInst::ICMP_UGE:
3202 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
3203 // Check for a full-set condition.
3205 return ConstantRange(BitWidth, /*isFullSet=*/true);
3207 case ICmpInst::ICMP_SGE:
3208 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
3209 // Check for a full-set condition.
3211 return ConstantRange(BitWidth, /*isFullSet=*/true);
3214 return ConstantRange(Lower, Upper);
3217 CmpInst::Predicate CmpInst::getSwappedPredicate(Predicate pred) {
3219 default: llvm_unreachable("Unknown cmp predicate!");
3220 case ICMP_EQ: case ICMP_NE:
3222 case ICMP_SGT: return ICMP_SLT;
3223 case ICMP_SLT: return ICMP_SGT;
3224 case ICMP_SGE: return ICMP_SLE;
3225 case ICMP_SLE: return ICMP_SGE;
3226 case ICMP_UGT: return ICMP_ULT;
3227 case ICMP_ULT: return ICMP_UGT;
3228 case ICMP_UGE: return ICMP_ULE;
3229 case ICMP_ULE: return ICMP_UGE;
3231 case FCMP_FALSE: case FCMP_TRUE:
3232 case FCMP_OEQ: case FCMP_ONE:
3233 case FCMP_UEQ: case FCMP_UNE:
3234 case FCMP_ORD: case FCMP_UNO:
3236 case FCMP_OGT: return FCMP_OLT;
3237 case FCMP_OLT: return FCMP_OGT;
3238 case FCMP_OGE: return FCMP_OLE;
3239 case FCMP_OLE: return FCMP_OGE;
3240 case FCMP_UGT: return FCMP_ULT;
3241 case FCMP_ULT: return FCMP_UGT;
3242 case FCMP_UGE: return FCMP_ULE;
3243 case FCMP_ULE: return FCMP_UGE;
3247 bool CmpInst::isUnsigned(unsigned short predicate) {
3248 switch (predicate) {
3249 default: return false;
3250 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
3251 case ICmpInst::ICMP_UGE: return true;
3255 bool CmpInst::isSigned(unsigned short predicate) {
3256 switch (predicate) {
3257 default: return false;
3258 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
3259 case ICmpInst::ICMP_SGE: return true;
3263 bool CmpInst::isOrdered(unsigned short predicate) {
3264 switch (predicate) {
3265 default: return false;
3266 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
3267 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
3268 case FCmpInst::FCMP_ORD: return true;
3272 bool CmpInst::isUnordered(unsigned short predicate) {
3273 switch (predicate) {
3274 default: return false;
3275 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
3276 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
3277 case FCmpInst::FCMP_UNO: return true;
3281 bool CmpInst::isTrueWhenEqual(unsigned short predicate) {
3283 default: return false;
3284 case ICMP_EQ: case ICMP_UGE: case ICMP_ULE: case ICMP_SGE: case ICMP_SLE:
3285 case FCMP_TRUE: case FCMP_UEQ: case FCMP_UGE: case FCMP_ULE: return true;
3289 bool CmpInst::isFalseWhenEqual(unsigned short predicate) {
3291 case ICMP_NE: case ICMP_UGT: case ICMP_ULT: case ICMP_SGT: case ICMP_SLT:
3292 case FCMP_FALSE: case FCMP_ONE: case FCMP_OGT: case FCMP_OLT: return true;
3293 default: return false;
3298 //===----------------------------------------------------------------------===//
3299 // SwitchInst Implementation
3300 //===----------------------------------------------------------------------===//
3302 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumReserved) {
3303 assert(Value && Default && NumReserved);
3304 ReservedSpace = NumReserved;
3306 OperandList = allocHungoffUses(ReservedSpace);
3308 OperandList[0] = Value;
3309 OperandList[1] = Default;
3312 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
3313 /// switch on and a default destination. The number of additional cases can
3314 /// be specified here to make memory allocation more efficient. This
3315 /// constructor can also autoinsert before another instruction.
3316 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
3317 Instruction *InsertBefore)
3318 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
3319 nullptr, 0, InsertBefore) {
3320 init(Value, Default, 2+NumCases*2);
3323 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
3324 /// switch on and a default destination. The number of additional cases can
3325 /// be specified here to make memory allocation more efficient. This
3326 /// constructor also autoinserts at the end of the specified BasicBlock.
3327 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
3328 BasicBlock *InsertAtEnd)
3329 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
3330 nullptr, 0, InsertAtEnd) {
3331 init(Value, Default, 2+NumCases*2);
3334 SwitchInst::SwitchInst(const SwitchInst &SI)
3335 : TerminatorInst(SI.getType(), Instruction::Switch, nullptr, 0) {
3336 init(SI.getCondition(), SI.getDefaultDest(), SI.getNumOperands());
3337 NumOperands = SI.getNumOperands();
3338 Use *OL = OperandList, *InOL = SI.OperandList;
3339 for (unsigned i = 2, E = SI.getNumOperands(); i != E; i += 2) {
3341 OL[i+1] = InOL[i+1];
3343 SubclassOptionalData = SI.SubclassOptionalData;
3346 SwitchInst::~SwitchInst() {
3351 /// addCase - Add an entry to the switch instruction...
3353 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
3354 unsigned NewCaseIdx = getNumCases();
3355 unsigned OpNo = NumOperands;
3356 if (OpNo+2 > ReservedSpace)
3357 growOperands(); // Get more space!
3358 // Initialize some new operands.
3359 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
3360 NumOperands = OpNo+2;
3361 CaseIt Case(this, NewCaseIdx);
3362 Case.setValue(OnVal);
3363 Case.setSuccessor(Dest);
3366 /// removeCase - This method removes the specified case and its successor
3367 /// from the switch instruction.
3368 void SwitchInst::removeCase(CaseIt i) {
3369 unsigned idx = i.getCaseIndex();
3371 assert(2 + idx*2 < getNumOperands() && "Case index out of range!!!");
3373 unsigned NumOps = getNumOperands();
3374 Use *OL = OperandList;
3376 // Overwrite this case with the end of the list.
3377 if (2 + (idx + 1) * 2 != NumOps) {
3378 OL[2 + idx * 2] = OL[NumOps - 2];
3379 OL[2 + idx * 2 + 1] = OL[NumOps - 1];
3382 // Nuke the last value.
3383 OL[NumOps-2].set(nullptr);
3384 OL[NumOps-2+1].set(nullptr);
3385 NumOperands = NumOps-2;
3388 /// growOperands - grow operands - This grows the operand list in response
3389 /// to a push_back style of operation. This grows the number of ops by 3 times.
3391 void SwitchInst::growOperands() {
3392 unsigned e = getNumOperands();
3393 unsigned NumOps = e*3;
3395 ReservedSpace = NumOps;
3396 Use *NewOps = allocHungoffUses(NumOps);
3397 Use *OldOps = OperandList;
3398 for (unsigned i = 0; i != e; ++i) {
3399 NewOps[i] = OldOps[i];
3401 OperandList = NewOps;
3402 Use::zap(OldOps, OldOps + e, true);
3406 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
3407 return getSuccessor(idx);
3409 unsigned SwitchInst::getNumSuccessorsV() const {
3410 return getNumSuccessors();
3412 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3413 setSuccessor(idx, B);
3416 //===----------------------------------------------------------------------===//
3417 // IndirectBrInst Implementation
3418 //===----------------------------------------------------------------------===//
3420 void IndirectBrInst::init(Value *Address, unsigned NumDests) {
3421 assert(Address && Address->getType()->isPointerTy() &&
3422 "Address of indirectbr must be a pointer");
3423 ReservedSpace = 1+NumDests;
3425 OperandList = allocHungoffUses(ReservedSpace);
3427 OperandList[0] = Address;
3431 /// growOperands - grow operands - This grows the operand list in response
3432 /// to a push_back style of operation. This grows the number of ops by 2 times.
3434 void IndirectBrInst::growOperands() {
3435 unsigned e = getNumOperands();
3436 unsigned NumOps = e*2;
3438 ReservedSpace = NumOps;
3439 Use *NewOps = allocHungoffUses(NumOps);
3440 Use *OldOps = OperandList;
3441 for (unsigned i = 0; i != e; ++i)
3442 NewOps[i] = OldOps[i];
3443 OperandList = NewOps;
3444 Use::zap(OldOps, OldOps + e, true);
3447 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3448 Instruction *InsertBefore)
3449 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3450 nullptr, 0, InsertBefore) {
3451 init(Address, NumCases);
3454 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3455 BasicBlock *InsertAtEnd)
3456 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3457 nullptr, 0, InsertAtEnd) {
3458 init(Address, NumCases);
3461 IndirectBrInst::IndirectBrInst(const IndirectBrInst &IBI)
3462 : TerminatorInst(Type::getVoidTy(IBI.getContext()), Instruction::IndirectBr,
3463 allocHungoffUses(IBI.getNumOperands()),
3464 IBI.getNumOperands()) {
3465 Use *OL = OperandList, *InOL = IBI.OperandList;
3466 for (unsigned i = 0, E = IBI.getNumOperands(); i != E; ++i)
3468 SubclassOptionalData = IBI.SubclassOptionalData;
3471 IndirectBrInst::~IndirectBrInst() {
3475 /// addDestination - Add a destination.
3477 void IndirectBrInst::addDestination(BasicBlock *DestBB) {
3478 unsigned OpNo = NumOperands;
3479 if (OpNo+1 > ReservedSpace)
3480 growOperands(); // Get more space!
3481 // Initialize some new operands.
3482 assert(OpNo < ReservedSpace && "Growing didn't work!");
3483 NumOperands = OpNo+1;
3484 OperandList[OpNo] = DestBB;
3487 /// removeDestination - This method removes the specified successor from the
3488 /// indirectbr instruction.
3489 void IndirectBrInst::removeDestination(unsigned idx) {
3490 assert(idx < getNumOperands()-1 && "Successor index out of range!");
3492 unsigned NumOps = getNumOperands();
3493 Use *OL = OperandList;
3495 // Replace this value with the last one.
3496 OL[idx+1] = OL[NumOps-1];
3498 // Nuke the last value.
3499 OL[NumOps-1].set(nullptr);
3500 NumOperands = NumOps-1;
3503 BasicBlock *IndirectBrInst::getSuccessorV(unsigned idx) const {
3504 return getSuccessor(idx);
3506 unsigned IndirectBrInst::getNumSuccessorsV() const {
3507 return getNumSuccessors();
3509 void IndirectBrInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3510 setSuccessor(idx, B);
3513 //===----------------------------------------------------------------------===//
3514 // clone_impl() implementations
3515 //===----------------------------------------------------------------------===//
3517 // Define these methods here so vtables don't get emitted into every translation
3518 // unit that uses these classes.
3520 GetElementPtrInst *GetElementPtrInst::clone_impl() const {
3521 return new (getNumOperands()) GetElementPtrInst(*this);
3524 BinaryOperator *BinaryOperator::clone_impl() const {
3525 return Create(getOpcode(), Op<0>(), Op<1>());
3528 FCmpInst* FCmpInst::clone_impl() const {
3529 return new FCmpInst(getPredicate(), Op<0>(), Op<1>());
3532 ICmpInst* ICmpInst::clone_impl() const {
3533 return new ICmpInst(getPredicate(), Op<0>(), Op<1>());
3536 ExtractValueInst *ExtractValueInst::clone_impl() const {
3537 return new ExtractValueInst(*this);
3540 InsertValueInst *InsertValueInst::clone_impl() const {
3541 return new InsertValueInst(*this);
3544 AllocaInst *AllocaInst::clone_impl() const {
3545 AllocaInst *Result = new AllocaInst(getAllocatedType(),
3546 (Value *)getOperand(0), getAlignment());
3547 Result->setUsedWithInAlloca(isUsedWithInAlloca());
3551 LoadInst *LoadInst::clone_impl() const {
3552 return new LoadInst(getOperand(0), Twine(), isVolatile(),
3553 getAlignment(), getOrdering(), getSynchScope());
3556 StoreInst *StoreInst::clone_impl() const {
3557 return new StoreInst(getOperand(0), getOperand(1), isVolatile(),
3558 getAlignment(), getOrdering(), getSynchScope());
3562 AtomicCmpXchgInst *AtomicCmpXchgInst::clone_impl() const {
3563 AtomicCmpXchgInst *Result =
3564 new AtomicCmpXchgInst(getOperand(0), getOperand(1), getOperand(2),
3565 getSuccessOrdering(), getFailureOrdering(),
3567 Result->setVolatile(isVolatile());
3568 Result->setWeak(isWeak());
3572 AtomicRMWInst *AtomicRMWInst::clone_impl() const {
3573 AtomicRMWInst *Result =
3574 new AtomicRMWInst(getOperation(),getOperand(0), getOperand(1),
3575 getOrdering(), getSynchScope());
3576 Result->setVolatile(isVolatile());
3580 FenceInst *FenceInst::clone_impl() const {
3581 return new FenceInst(getContext(), getOrdering(), getSynchScope());
3584 TruncInst *TruncInst::clone_impl() const {
3585 return new TruncInst(getOperand(0), getType());
3588 ZExtInst *ZExtInst::clone_impl() const {
3589 return new ZExtInst(getOperand(0), getType());
3592 SExtInst *SExtInst::clone_impl() const {
3593 return new SExtInst(getOperand(0), getType());
3596 FPTruncInst *FPTruncInst::clone_impl() const {
3597 return new FPTruncInst(getOperand(0), getType());
3600 FPExtInst *FPExtInst::clone_impl() const {
3601 return new FPExtInst(getOperand(0), getType());
3604 UIToFPInst *UIToFPInst::clone_impl() const {
3605 return new UIToFPInst(getOperand(0), getType());
3608 SIToFPInst *SIToFPInst::clone_impl() const {
3609 return new SIToFPInst(getOperand(0), getType());
3612 FPToUIInst *FPToUIInst::clone_impl() const {
3613 return new FPToUIInst(getOperand(0), getType());
3616 FPToSIInst *FPToSIInst::clone_impl() const {
3617 return new FPToSIInst(getOperand(0), getType());
3620 PtrToIntInst *PtrToIntInst::clone_impl() const {
3621 return new PtrToIntInst(getOperand(0), getType());
3624 IntToPtrInst *IntToPtrInst::clone_impl() const {
3625 return new IntToPtrInst(getOperand(0), getType());
3628 BitCastInst *BitCastInst::clone_impl() const {
3629 return new BitCastInst(getOperand(0), getType());
3632 AddrSpaceCastInst *AddrSpaceCastInst::clone_impl() const {
3633 return new AddrSpaceCastInst(getOperand(0), getType());
3636 CallInst *CallInst::clone_impl() const {
3637 return new(getNumOperands()) CallInst(*this);
3640 SelectInst *SelectInst::clone_impl() const {
3641 return SelectInst::Create(getOperand(0), getOperand(1), getOperand(2));
3644 VAArgInst *VAArgInst::clone_impl() const {
3645 return new VAArgInst(getOperand(0), getType());
3648 ExtractElementInst *ExtractElementInst::clone_impl() const {
3649 return ExtractElementInst::Create(getOperand(0), getOperand(1));
3652 InsertElementInst *InsertElementInst::clone_impl() const {
3653 return InsertElementInst::Create(getOperand(0), getOperand(1), getOperand(2));
3656 ShuffleVectorInst *ShuffleVectorInst::clone_impl() const {
3657 return new ShuffleVectorInst(getOperand(0), getOperand(1), getOperand(2));
3660 PHINode *PHINode::clone_impl() const {
3661 return new PHINode(*this);
3664 LandingPadInst *LandingPadInst::clone_impl() const {
3665 return new LandingPadInst(*this);
3668 ReturnInst *ReturnInst::clone_impl() const {
3669 return new(getNumOperands()) ReturnInst(*this);
3672 BranchInst *BranchInst::clone_impl() const {
3673 return new(getNumOperands()) BranchInst(*this);
3676 SwitchInst *SwitchInst::clone_impl() const {
3677 return new SwitchInst(*this);
3680 IndirectBrInst *IndirectBrInst::clone_impl() const {
3681 return new IndirectBrInst(*this);
3685 InvokeInst *InvokeInst::clone_impl() const {
3686 return new(getNumOperands()) InvokeInst(*this);
3689 ResumeInst *ResumeInst::clone_impl() const {
3690 return new(1) ResumeInst(*this);
3693 UnreachableInst *UnreachableInst::clone_impl() const {
3694 LLVMContext &Context = getContext();
3695 return new UnreachableInst(Context);