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 "LLVMContextImpl.h"
16 #include "llvm/Constants.h"
17 #include "llvm/DerivedTypes.h"
18 #include "llvm/Function.h"
19 #include "llvm/Instructions.h"
20 #include "llvm/Module.h"
21 #include "llvm/Operator.h"
22 #include "llvm/Support/ErrorHandling.h"
23 #include "llvm/Support/CallSite.h"
24 #include "llvm/Support/ConstantRange.h"
25 #include "llvm/Support/MathExtras.h"
28 //===----------------------------------------------------------------------===//
30 //===----------------------------------------------------------------------===//
32 User::op_iterator CallSite::getCallee() const {
33 Instruction *II(getInstruction());
35 ? cast<CallInst>(II)->op_end() - 1 // Skip Callee
36 : cast<InvokeInst>(II)->op_end() - 3; // Skip BB, BB, Callee
39 //===----------------------------------------------------------------------===//
40 // TerminatorInst Class
41 //===----------------------------------------------------------------------===//
43 // Out of line virtual method, so the vtable, etc has a home.
44 TerminatorInst::~TerminatorInst() {
47 //===----------------------------------------------------------------------===//
48 // UnaryInstruction Class
49 //===----------------------------------------------------------------------===//
51 // Out of line virtual method, so the vtable, etc has a home.
52 UnaryInstruction::~UnaryInstruction() {
55 //===----------------------------------------------------------------------===//
57 //===----------------------------------------------------------------------===//
59 /// areInvalidOperands - Return a string if the specified operands are invalid
60 /// for a select operation, otherwise return null.
61 const char *SelectInst::areInvalidOperands(Value *Op0, Value *Op1, Value *Op2) {
62 if (Op1->getType() != Op2->getType())
63 return "both values to select must have same type";
65 if (VectorType *VT = dyn_cast<VectorType>(Op0->getType())) {
67 if (VT->getElementType() != Type::getInt1Ty(Op0->getContext()))
68 return "vector select condition element type must be i1";
69 VectorType *ET = dyn_cast<VectorType>(Op1->getType());
71 return "selected values for vector select must be vectors";
72 if (ET->getNumElements() != VT->getNumElements())
73 return "vector select requires selected vectors to have "
74 "the same vector length as select condition";
75 } else if (Op0->getType() != Type::getInt1Ty(Op0->getContext())) {
76 return "select condition must be i1 or <n x i1>";
82 //===----------------------------------------------------------------------===//
84 //===----------------------------------------------------------------------===//
86 PHINode::PHINode(const PHINode &PN)
87 : Instruction(PN.getType(), Instruction::PHI,
88 allocHungoffUses(PN.getNumOperands()), PN.getNumOperands()),
89 ReservedSpace(PN.getNumOperands()) {
90 std::copy(PN.op_begin(), PN.op_end(), op_begin());
91 std::copy(PN.block_begin(), PN.block_end(), block_begin());
92 SubclassOptionalData = PN.SubclassOptionalData;
99 Use *PHINode::allocHungoffUses(unsigned N) const {
100 // Allocate the array of Uses of the incoming values, followed by a pointer
101 // (with bottom bit set) to the User, followed by the array of pointers to
102 // the incoming basic blocks.
103 size_t size = N * sizeof(Use) + sizeof(Use::UserRef)
104 + N * sizeof(BasicBlock*);
105 Use *Begin = static_cast<Use*>(::operator new(size));
106 Use *End = Begin + N;
107 (void) new(End) Use::UserRef(const_cast<PHINode*>(this), 1);
108 return Use::initTags(Begin, End);
111 // removeIncomingValue - Remove an incoming value. This is useful if a
112 // predecessor basic block is deleted.
113 Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
114 Value *Removed = getIncomingValue(Idx);
116 // Move everything after this operand down.
118 // FIXME: we could just swap with the end of the list, then erase. However,
119 // clients might not expect this to happen. The code as it is thrashes the
120 // use/def lists, which is kinda lame.
121 std::copy(op_begin() + Idx + 1, op_end(), op_begin() + Idx);
122 std::copy(block_begin() + Idx + 1, block_end(), block_begin() + Idx);
124 // Nuke the last value.
128 // If the PHI node is dead, because it has zero entries, nuke it now.
129 if (getNumOperands() == 0 && DeletePHIIfEmpty) {
130 // If anyone is using this PHI, make them use a dummy value instead...
131 replaceAllUsesWith(UndefValue::get(getType()));
137 /// growOperands - grow operands - This grows the operand list in response
138 /// to a push_back style of operation. This grows the number of ops by 1.5
141 void PHINode::growOperands() {
142 unsigned e = getNumOperands();
143 unsigned NumOps = e + e / 2;
144 if (NumOps < 2) NumOps = 2; // 2 op PHI nodes are VERY common.
146 Use *OldOps = op_begin();
147 BasicBlock **OldBlocks = block_begin();
149 ReservedSpace = NumOps;
150 OperandList = allocHungoffUses(ReservedSpace);
152 std::copy(OldOps, OldOps + e, op_begin());
153 std::copy(OldBlocks, OldBlocks + e, block_begin());
155 Use::zap(OldOps, OldOps + e, true);
158 /// hasConstantValue - If the specified PHI node always merges together the same
159 /// value, return the value, otherwise return null.
160 Value *PHINode::hasConstantValue() const {
161 // Exploit the fact that phi nodes always have at least one entry.
162 Value *ConstantValue = getIncomingValue(0);
163 for (unsigned i = 1, e = getNumIncomingValues(); i != e; ++i)
164 if (getIncomingValue(i) != ConstantValue)
165 return 0; // Incoming values not all the same.
166 return ConstantValue;
169 //===----------------------------------------------------------------------===//
170 // LandingPadInst Implementation
171 //===----------------------------------------------------------------------===//
173 void LandingPadInst::init(Value *PersFn, unsigned NumReservedValues,
174 const Twine &NameStr) {
175 ReservedSpace = NumReservedValues;
177 OperandList = allocHungoffUses(ReservedSpace);
178 OperandList[0] = PersFn;
182 LandingPadInst::LandingPadInst(const LandingPadInst &LP)
183 : Instruction(LP.getType(), Instruction::LandingPad,
184 allocHungoffUses(LP.getNumOperands()), LP.getNumOperands()),
185 ReservedSpace(LP.getNumOperands()) {
186 Use *OL = OperandList, *InOL = LP.OperandList;
187 for (unsigned I = 0, E = ReservedSpace; I != E; ++I)
190 for (SmallVectorImpl<ClauseType>::const_iterator
191 I = LP.ClauseIdxs.begin(), E = LP.ClauseIdxs.end(); I != E; ++I)
192 ClauseIdxs.push_back(*I);
194 IsCleanup = LP.IsCleanup;
195 SubclassOptionalData = LP.SubclassOptionalData;
198 LandingPadInst::~LandingPadInst() {
202 /// growOperands - grow operands - This grows the operand list in response to a
203 /// push_back style of operation. This grows the number of ops by 2 times.
204 void LandingPadInst::growOperands() {
205 unsigned e = getNumOperands();
206 ReservedSpace = e * 2;
208 Use *NewOps = allocHungoffUses(ReservedSpace);
209 Use *OldOps = OperandList;
210 for (unsigned i = 0; i != e; ++i)
211 NewOps[i] = OldOps[i];
213 OperandList = NewOps;
214 Use::zap(OldOps, OldOps + e, true);
217 void LandingPadInst::reserveClauses(unsigned Size) {
218 unsigned e = getNumOperands() + Size;
219 if (ReservedSpace >= e) return;
222 Use *NewOps = allocHungoffUses(ReservedSpace);
223 Use *OldOps = OperandList;
224 for (unsigned i = 0; i != e; ++i)
225 NewOps[i] = OldOps[i];
227 OperandList = NewOps;
228 Use::zap(OldOps, OldOps + e, true);
231 void LandingPadInst::addClause(ClauseType CT, Value *ClauseVal) {
232 unsigned OpNo = getNumOperands();
233 if (OpNo + 1 > ReservedSpace)
235 assert(OpNo < ReservedSpace && "Growing didn't work!");
236 ClauseIdxs.push_back(CT);
238 OperandList[OpNo] = ClauseVal;
241 //===----------------------------------------------------------------------===//
242 // CallInst Implementation
243 //===----------------------------------------------------------------------===//
245 CallInst::~CallInst() {
248 void CallInst::init(Value *Func, ArrayRef<Value *> Args, const Twine &NameStr) {
249 assert(NumOperands == Args.size() + 1 && "NumOperands not set up?");
254 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
256 assert((Args.size() == FTy->getNumParams() ||
257 (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&
258 "Calling a function with bad signature!");
260 for (unsigned i = 0; i != Args.size(); ++i)
261 assert((i >= FTy->getNumParams() ||
262 FTy->getParamType(i) == Args[i]->getType()) &&
263 "Calling a function with a bad signature!");
266 std::copy(Args.begin(), Args.end(), op_begin());
270 void CallInst::init(Value *Func, const Twine &NameStr) {
271 assert(NumOperands == 1 && "NumOperands not set up?");
276 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
278 assert(FTy->getNumParams() == 0 && "Calling a function with bad signature");
284 CallInst::CallInst(Value *Func, const Twine &Name,
285 Instruction *InsertBefore)
286 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
287 ->getElementType())->getReturnType(),
289 OperandTraits<CallInst>::op_end(this) - 1,
294 CallInst::CallInst(Value *Func, const Twine &Name,
295 BasicBlock *InsertAtEnd)
296 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
297 ->getElementType())->getReturnType(),
299 OperandTraits<CallInst>::op_end(this) - 1,
304 CallInst::CallInst(const CallInst &CI)
305 : Instruction(CI.getType(), Instruction::Call,
306 OperandTraits<CallInst>::op_end(this) - CI.getNumOperands(),
307 CI.getNumOperands()) {
308 setAttributes(CI.getAttributes());
309 setTailCall(CI.isTailCall());
310 setCallingConv(CI.getCallingConv());
312 std::copy(CI.op_begin(), CI.op_end(), op_begin());
313 SubclassOptionalData = CI.SubclassOptionalData;
316 void CallInst::addAttribute(unsigned i, Attributes attr) {
317 AttrListPtr PAL = getAttributes();
318 PAL = PAL.addAttr(i, attr);
322 void CallInst::removeAttribute(unsigned i, Attributes attr) {
323 AttrListPtr PAL = getAttributes();
324 PAL = PAL.removeAttr(i, attr);
328 bool CallInst::paramHasAttr(unsigned i, Attributes attr) const {
329 if (AttributeList.paramHasAttr(i, attr))
331 if (const Function *F = getCalledFunction())
332 return F->paramHasAttr(i, attr);
336 /// IsConstantOne - Return true only if val is constant int 1
337 static bool IsConstantOne(Value *val) {
338 assert(val && "IsConstantOne does not work with NULL val");
339 return isa<ConstantInt>(val) && cast<ConstantInt>(val)->isOne();
342 static Instruction *createMalloc(Instruction *InsertBefore,
343 BasicBlock *InsertAtEnd, Type *IntPtrTy,
344 Type *AllocTy, Value *AllocSize,
345 Value *ArraySize, Function *MallocF,
347 assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&
348 "createMalloc needs either InsertBefore or InsertAtEnd");
350 // malloc(type) becomes:
351 // bitcast (i8* malloc(typeSize)) to type*
352 // malloc(type, arraySize) becomes:
353 // bitcast (i8 *malloc(typeSize*arraySize)) to type*
355 ArraySize = ConstantInt::get(IntPtrTy, 1);
356 else if (ArraySize->getType() != IntPtrTy) {
358 ArraySize = CastInst::CreateIntegerCast(ArraySize, IntPtrTy, false,
361 ArraySize = CastInst::CreateIntegerCast(ArraySize, IntPtrTy, false,
365 if (!IsConstantOne(ArraySize)) {
366 if (IsConstantOne(AllocSize)) {
367 AllocSize = ArraySize; // Operand * 1 = Operand
368 } else if (Constant *CO = dyn_cast<Constant>(ArraySize)) {
369 Constant *Scale = ConstantExpr::getIntegerCast(CO, IntPtrTy,
371 // Malloc arg is constant product of type size and array size
372 AllocSize = ConstantExpr::getMul(Scale, cast<Constant>(AllocSize));
374 // Multiply type size by the array size...
376 AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
377 "mallocsize", InsertBefore);
379 AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
380 "mallocsize", InsertAtEnd);
384 assert(AllocSize->getType() == IntPtrTy && "malloc arg is wrong size");
385 // Create the call to Malloc.
386 BasicBlock* BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
387 Module* M = BB->getParent()->getParent();
388 Type *BPTy = Type::getInt8PtrTy(BB->getContext());
389 Value *MallocFunc = MallocF;
391 // prototype malloc as "void *malloc(size_t)"
392 MallocFunc = M->getOrInsertFunction("malloc", BPTy, IntPtrTy, NULL);
393 PointerType *AllocPtrType = PointerType::getUnqual(AllocTy);
394 CallInst *MCall = NULL;
395 Instruction *Result = NULL;
397 MCall = CallInst::Create(MallocFunc, AllocSize, "malloccall", InsertBefore);
399 if (Result->getType() != AllocPtrType)
400 // Create a cast instruction to convert to the right type...
401 Result = new BitCastInst(MCall, AllocPtrType, Name, InsertBefore);
403 MCall = CallInst::Create(MallocFunc, AllocSize, "malloccall");
405 if (Result->getType() != AllocPtrType) {
406 InsertAtEnd->getInstList().push_back(MCall);
407 // Create a cast instruction to convert to the right type...
408 Result = new BitCastInst(MCall, AllocPtrType, Name);
411 MCall->setTailCall();
412 if (Function *F = dyn_cast<Function>(MallocFunc)) {
413 MCall->setCallingConv(F->getCallingConv());
414 if (!F->doesNotAlias(0)) F->setDoesNotAlias(0);
416 assert(!MCall->getType()->isVoidTy() && "Malloc has void return type");
421 /// CreateMalloc - Generate the IR for a call to malloc:
422 /// 1. Compute the malloc call's argument as the specified type's size,
423 /// possibly multiplied by the array size if the array size is not
425 /// 2. Call malloc with that argument.
426 /// 3. Bitcast the result of the malloc call to the specified type.
427 Instruction *CallInst::CreateMalloc(Instruction *InsertBefore,
428 Type *IntPtrTy, Type *AllocTy,
429 Value *AllocSize, Value *ArraySize,
432 return createMalloc(InsertBefore, NULL, IntPtrTy, AllocTy, AllocSize,
433 ArraySize, MallocF, Name);
436 /// CreateMalloc - Generate the IR for a call to malloc:
437 /// 1. Compute the malloc call's argument as the specified type's size,
438 /// possibly multiplied by the array size if the array size is not
440 /// 2. Call malloc with that argument.
441 /// 3. Bitcast the result of the malloc call to the specified type.
442 /// Note: This function does not add the bitcast to the basic block, that is the
443 /// responsibility of the caller.
444 Instruction *CallInst::CreateMalloc(BasicBlock *InsertAtEnd,
445 Type *IntPtrTy, Type *AllocTy,
446 Value *AllocSize, Value *ArraySize,
447 Function *MallocF, const Twine &Name) {
448 return createMalloc(NULL, InsertAtEnd, IntPtrTy, AllocTy, AllocSize,
449 ArraySize, MallocF, Name);
452 static Instruction* createFree(Value* Source, Instruction *InsertBefore,
453 BasicBlock *InsertAtEnd) {
454 assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&
455 "createFree needs either InsertBefore or InsertAtEnd");
456 assert(Source->getType()->isPointerTy() &&
457 "Can not free something of nonpointer type!");
459 BasicBlock* BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
460 Module* M = BB->getParent()->getParent();
462 Type *VoidTy = Type::getVoidTy(M->getContext());
463 Type *IntPtrTy = Type::getInt8PtrTy(M->getContext());
464 // prototype free as "void free(void*)"
465 Value *FreeFunc = M->getOrInsertFunction("free", VoidTy, IntPtrTy, NULL);
466 CallInst* Result = NULL;
467 Value *PtrCast = Source;
469 if (Source->getType() != IntPtrTy)
470 PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertBefore);
471 Result = CallInst::Create(FreeFunc, PtrCast, "", InsertBefore);
473 if (Source->getType() != IntPtrTy)
474 PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertAtEnd);
475 Result = CallInst::Create(FreeFunc, PtrCast, "");
477 Result->setTailCall();
478 if (Function *F = dyn_cast<Function>(FreeFunc))
479 Result->setCallingConv(F->getCallingConv());
484 /// CreateFree - Generate the IR for a call to the builtin free function.
485 Instruction * CallInst::CreateFree(Value* Source, Instruction *InsertBefore) {
486 return createFree(Source, InsertBefore, NULL);
489 /// CreateFree - Generate the IR for a call to the builtin free function.
490 /// Note: This function does not add the call to the basic block, that is the
491 /// responsibility of the caller.
492 Instruction* CallInst::CreateFree(Value* Source, BasicBlock *InsertAtEnd) {
493 Instruction* FreeCall = createFree(Source, NULL, InsertAtEnd);
494 assert(FreeCall && "CreateFree did not create a CallInst");
498 //===----------------------------------------------------------------------===//
499 // InvokeInst Implementation
500 //===----------------------------------------------------------------------===//
502 void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
503 ArrayRef<Value *> Args, const Twine &NameStr) {
504 assert(NumOperands == 3 + Args.size() && "NumOperands not set up?");
507 Op<-1>() = IfException;
511 cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
513 assert(((Args.size() == FTy->getNumParams()) ||
514 (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&
515 "Invoking a function with bad signature");
517 for (unsigned i = 0, e = Args.size(); i != e; i++)
518 assert((i >= FTy->getNumParams() ||
519 FTy->getParamType(i) == Args[i]->getType()) &&
520 "Invoking a function with a bad signature!");
523 std::copy(Args.begin(), Args.end(), op_begin());
527 InvokeInst::InvokeInst(const InvokeInst &II)
528 : TerminatorInst(II.getType(), Instruction::Invoke,
529 OperandTraits<InvokeInst>::op_end(this)
530 - II.getNumOperands(),
531 II.getNumOperands()) {
532 setAttributes(II.getAttributes());
533 setCallingConv(II.getCallingConv());
534 std::copy(II.op_begin(), II.op_end(), op_begin());
535 SubclassOptionalData = II.SubclassOptionalData;
538 BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
539 return getSuccessor(idx);
541 unsigned InvokeInst::getNumSuccessorsV() const {
542 return getNumSuccessors();
544 void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
545 return setSuccessor(idx, B);
548 bool InvokeInst::paramHasAttr(unsigned i, Attributes attr) const {
549 if (AttributeList.paramHasAttr(i, attr))
551 if (const Function *F = getCalledFunction())
552 return F->paramHasAttr(i, attr);
556 void InvokeInst::addAttribute(unsigned i, Attributes attr) {
557 AttrListPtr PAL = getAttributes();
558 PAL = PAL.addAttr(i, attr);
562 void InvokeInst::removeAttribute(unsigned i, Attributes attr) {
563 AttrListPtr PAL = getAttributes();
564 PAL = PAL.removeAttr(i, attr);
568 LandingPadInst *InvokeInst::getLandingPad() const {
569 return cast<LandingPadInst>(getUnwindDest()->getFirstNonPHI());
572 //===----------------------------------------------------------------------===//
573 // ReturnInst Implementation
574 //===----------------------------------------------------------------------===//
576 ReturnInst::ReturnInst(const ReturnInst &RI)
577 : TerminatorInst(Type::getVoidTy(RI.getContext()), Instruction::Ret,
578 OperandTraits<ReturnInst>::op_end(this) -
580 RI.getNumOperands()) {
581 if (RI.getNumOperands())
582 Op<0>() = RI.Op<0>();
583 SubclassOptionalData = RI.SubclassOptionalData;
586 ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, Instruction *InsertBefore)
587 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret,
588 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
593 ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, BasicBlock *InsertAtEnd)
594 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret,
595 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
600 ReturnInst::ReturnInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
601 : TerminatorInst(Type::getVoidTy(Context), Instruction::Ret,
602 OperandTraits<ReturnInst>::op_end(this), 0, InsertAtEnd) {
605 unsigned ReturnInst::getNumSuccessorsV() const {
606 return getNumSuccessors();
609 /// Out-of-line ReturnInst method, put here so the C++ compiler can choose to
610 /// emit the vtable for the class in this translation unit.
611 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
612 llvm_unreachable("ReturnInst has no successors!");
615 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
616 llvm_unreachable("ReturnInst has no successors!");
620 ReturnInst::~ReturnInst() {
623 //===----------------------------------------------------------------------===//
624 // UnwindInst Implementation
625 //===----------------------------------------------------------------------===//
627 UnwindInst::UnwindInst(LLVMContext &Context, Instruction *InsertBefore)
628 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unwind,
629 0, 0, InsertBefore) {
631 UnwindInst::UnwindInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
632 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unwind,
637 unsigned UnwindInst::getNumSuccessorsV() const {
638 return getNumSuccessors();
641 void UnwindInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
642 llvm_unreachable("UnwindInst has no successors!");
645 BasicBlock *UnwindInst::getSuccessorV(unsigned idx) const {
646 llvm_unreachable("UnwindInst has no successors!");
650 //===----------------------------------------------------------------------===//
651 // ResumeInst Implementation
652 //===----------------------------------------------------------------------===//
654 ResumeInst::ResumeInst(const ResumeInst &RI)
655 : TerminatorInst(Type::getVoidTy(RI.getContext()), Instruction::Resume,
656 OperandTraits<ResumeInst>::op_begin(this), 1) {
657 Op<0>() = RI.Op<0>();
658 SubclassOptionalData = RI.SubclassOptionalData;
661 ResumeInst::ResumeInst(LLVMContext &C, Value *Exn, Instruction *InsertBefore)
662 : TerminatorInst(Type::getVoidTy(C), Instruction::Resume,
663 OperandTraits<ResumeInst>::op_begin(this), 1, InsertBefore) {
667 ResumeInst::ResumeInst(LLVMContext &C, Value *Exn, BasicBlock *InsertAtEnd)
668 : TerminatorInst(Type::getVoidTy(C), Instruction::Resume,
669 OperandTraits<ResumeInst>::op_begin(this), 1, InsertAtEnd) {
673 unsigned ResumeInst::getNumSuccessorsV() const {
674 return getNumSuccessors();
677 void ResumeInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
678 llvm_unreachable("ResumeInst has no successors!");
681 BasicBlock *ResumeInst::getSuccessorV(unsigned idx) const {
682 llvm_unreachable("ResumeInst has no successors!");
686 //===----------------------------------------------------------------------===//
687 // UnreachableInst Implementation
688 //===----------------------------------------------------------------------===//
690 UnreachableInst::UnreachableInst(LLVMContext &Context,
691 Instruction *InsertBefore)
692 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unreachable,
693 0, 0, InsertBefore) {
695 UnreachableInst::UnreachableInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
696 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unreachable,
700 unsigned UnreachableInst::getNumSuccessorsV() const {
701 return getNumSuccessors();
704 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
705 llvm_unreachable("UnreachableInst has no successors!");
708 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
709 llvm_unreachable("UnreachableInst has no successors!");
713 //===----------------------------------------------------------------------===//
714 // BranchInst Implementation
715 //===----------------------------------------------------------------------===//
717 void BranchInst::AssertOK() {
719 assert(getCondition()->getType()->isIntegerTy(1) &&
720 "May only branch on boolean predicates!");
723 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
724 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
725 OperandTraits<BranchInst>::op_end(this) - 1,
727 assert(IfTrue != 0 && "Branch destination may not be null!");
730 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
731 Instruction *InsertBefore)
732 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
733 OperandTraits<BranchInst>::op_end(this) - 3,
743 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
744 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
745 OperandTraits<BranchInst>::op_end(this) - 1,
747 assert(IfTrue != 0 && "Branch destination may not be null!");
751 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
752 BasicBlock *InsertAtEnd)
753 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
754 OperandTraits<BranchInst>::op_end(this) - 3,
765 BranchInst::BranchInst(const BranchInst &BI) :
766 TerminatorInst(Type::getVoidTy(BI.getContext()), Instruction::Br,
767 OperandTraits<BranchInst>::op_end(this) - BI.getNumOperands(),
768 BI.getNumOperands()) {
769 Op<-1>() = BI.Op<-1>();
770 if (BI.getNumOperands() != 1) {
771 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
772 Op<-3>() = BI.Op<-3>();
773 Op<-2>() = BI.Op<-2>();
775 SubclassOptionalData = BI.SubclassOptionalData;
778 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
779 return getSuccessor(idx);
781 unsigned BranchInst::getNumSuccessorsV() const {
782 return getNumSuccessors();
784 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
785 setSuccessor(idx, B);
789 //===----------------------------------------------------------------------===//
790 // AllocaInst Implementation
791 //===----------------------------------------------------------------------===//
793 static Value *getAISize(LLVMContext &Context, Value *Amt) {
795 Amt = ConstantInt::get(Type::getInt32Ty(Context), 1);
797 assert(!isa<BasicBlock>(Amt) &&
798 "Passed basic block into allocation size parameter! Use other ctor");
799 assert(Amt->getType()->isIntegerTy() &&
800 "Allocation array size is not an integer!");
805 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize,
806 const Twine &Name, Instruction *InsertBefore)
807 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
808 getAISize(Ty->getContext(), ArraySize), InsertBefore) {
810 assert(!Ty->isVoidTy() && "Cannot allocate void!");
814 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize,
815 const Twine &Name, BasicBlock *InsertAtEnd)
816 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
817 getAISize(Ty->getContext(), ArraySize), InsertAtEnd) {
819 assert(!Ty->isVoidTy() && "Cannot allocate void!");
823 AllocaInst::AllocaInst(Type *Ty, const Twine &Name,
824 Instruction *InsertBefore)
825 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
826 getAISize(Ty->getContext(), 0), InsertBefore) {
828 assert(!Ty->isVoidTy() && "Cannot allocate void!");
832 AllocaInst::AllocaInst(Type *Ty, const Twine &Name,
833 BasicBlock *InsertAtEnd)
834 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
835 getAISize(Ty->getContext(), 0), InsertAtEnd) {
837 assert(!Ty->isVoidTy() && "Cannot allocate void!");
841 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize, unsigned Align,
842 const Twine &Name, Instruction *InsertBefore)
843 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
844 getAISize(Ty->getContext(), ArraySize), InsertBefore) {
846 assert(!Ty->isVoidTy() && "Cannot allocate void!");
850 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize, unsigned Align,
851 const Twine &Name, BasicBlock *InsertAtEnd)
852 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
853 getAISize(Ty->getContext(), ArraySize), InsertAtEnd) {
855 assert(!Ty->isVoidTy() && "Cannot allocate void!");
859 // Out of line virtual method, so the vtable, etc has a home.
860 AllocaInst::~AllocaInst() {
863 void AllocaInst::setAlignment(unsigned Align) {
864 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
865 assert(Align <= MaximumAlignment &&
866 "Alignment is greater than MaximumAlignment!");
867 setInstructionSubclassData(Log2_32(Align) + 1);
868 assert(getAlignment() == Align && "Alignment representation error!");
871 bool AllocaInst::isArrayAllocation() const {
872 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
877 Type *AllocaInst::getAllocatedType() const {
878 return getType()->getElementType();
881 /// isStaticAlloca - Return true if this alloca is in the entry block of the
882 /// function and is a constant size. If so, the code generator will fold it
883 /// into the prolog/epilog code, so it is basically free.
884 bool AllocaInst::isStaticAlloca() const {
885 // Must be constant size.
886 if (!isa<ConstantInt>(getArraySize())) return false;
888 // Must be in the entry block.
889 const BasicBlock *Parent = getParent();
890 return Parent == &Parent->getParent()->front();
893 //===----------------------------------------------------------------------===//
894 // LoadInst Implementation
895 //===----------------------------------------------------------------------===//
897 void LoadInst::AssertOK() {
898 assert(getOperand(0)->getType()->isPointerTy() &&
899 "Ptr must have pointer type.");
902 LoadInst::LoadInst(Value *Ptr, const Twine &Name, Instruction *InsertBef)
903 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
904 Load, Ptr, InsertBef) {
911 LoadInst::LoadInst(Value *Ptr, const Twine &Name, BasicBlock *InsertAE)
912 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
913 Load, Ptr, InsertAE) {
920 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
921 Instruction *InsertBef)
922 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
923 Load, Ptr, InsertBef) {
924 setVolatile(isVolatile);
930 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
931 unsigned Align, Instruction *InsertBef)
932 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
933 Load, Ptr, InsertBef) {
934 setVolatile(isVolatile);
940 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
941 unsigned Align, BasicBlock *InsertAE)
942 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
943 Load, Ptr, InsertAE) {
944 setVolatile(isVolatile);
950 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
951 BasicBlock *InsertAE)
952 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
953 Load, Ptr, InsertAE) {
954 setVolatile(isVolatile);
962 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
963 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
964 Load, Ptr, InsertBef) {
968 if (Name && Name[0]) setName(Name);
971 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
972 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
973 Load, Ptr, InsertAE) {
977 if (Name && Name[0]) setName(Name);
980 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
981 Instruction *InsertBef)
982 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
983 Load, Ptr, InsertBef) {
984 setVolatile(isVolatile);
987 if (Name && Name[0]) setName(Name);
990 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
991 BasicBlock *InsertAE)
992 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
993 Load, Ptr, InsertAE) {
994 setVolatile(isVolatile);
997 if (Name && Name[0]) setName(Name);
1000 void LoadInst::setAlignment(unsigned Align) {
1001 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1002 assert(Align <= MaximumAlignment &&
1003 "Alignment is greater than MaximumAlignment!");
1004 setInstructionSubclassData((getSubclassDataFromInstruction() & 1) |
1005 ((Log2_32(Align)+1)<<1));
1006 assert(getAlignment() == Align && "Alignment representation error!");
1009 //===----------------------------------------------------------------------===//
1010 // StoreInst Implementation
1011 //===----------------------------------------------------------------------===//
1013 void StoreInst::AssertOK() {
1014 assert(getOperand(0) && getOperand(1) && "Both operands must be non-null!");
1015 assert(getOperand(1)->getType()->isPointerTy() &&
1016 "Ptr must have pointer type!");
1017 assert(getOperand(0)->getType() ==
1018 cast<PointerType>(getOperand(1)->getType())->getElementType()
1019 && "Ptr must be a pointer to Val type!");
1023 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
1024 : Instruction(Type::getVoidTy(val->getContext()), Store,
1025 OperandTraits<StoreInst>::op_begin(this),
1026 OperandTraits<StoreInst>::operands(this),
1035 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
1036 : Instruction(Type::getVoidTy(val->getContext()), Store,
1037 OperandTraits<StoreInst>::op_begin(this),
1038 OperandTraits<StoreInst>::operands(this),
1047 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1048 Instruction *InsertBefore)
1049 : Instruction(Type::getVoidTy(val->getContext()), Store,
1050 OperandTraits<StoreInst>::op_begin(this),
1051 OperandTraits<StoreInst>::operands(this),
1055 setVolatile(isVolatile);
1060 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1061 unsigned Align, Instruction *InsertBefore)
1062 : Instruction(Type::getVoidTy(val->getContext()), Store,
1063 OperandTraits<StoreInst>::op_begin(this),
1064 OperandTraits<StoreInst>::operands(this),
1068 setVolatile(isVolatile);
1069 setAlignment(Align);
1073 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1074 unsigned Align, BasicBlock *InsertAtEnd)
1075 : Instruction(Type::getVoidTy(val->getContext()), Store,
1076 OperandTraits<StoreInst>::op_begin(this),
1077 OperandTraits<StoreInst>::operands(this),
1081 setVolatile(isVolatile);
1082 setAlignment(Align);
1086 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1087 BasicBlock *InsertAtEnd)
1088 : Instruction(Type::getVoidTy(val->getContext()), Store,
1089 OperandTraits<StoreInst>::op_begin(this),
1090 OperandTraits<StoreInst>::operands(this),
1094 setVolatile(isVolatile);
1099 void StoreInst::setAlignment(unsigned Align) {
1100 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1101 assert(Align <= MaximumAlignment &&
1102 "Alignment is greater than MaximumAlignment!");
1103 setInstructionSubclassData((getSubclassDataFromInstruction() & 1) |
1104 ((Log2_32(Align)+1) << 1));
1105 assert(getAlignment() == Align && "Alignment representation error!");
1108 //===----------------------------------------------------------------------===//
1109 // FenceInst Implementation
1110 //===----------------------------------------------------------------------===//
1112 FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
1113 SynchronizationScope SynchScope,
1114 Instruction *InsertBefore)
1115 : Instruction(Type::getVoidTy(C), Fence, 0, 0, InsertBefore) {
1116 setOrdering(Ordering);
1117 setSynchScope(SynchScope);
1120 FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
1121 SynchronizationScope SynchScope,
1122 BasicBlock *InsertAtEnd)
1123 : Instruction(Type::getVoidTy(C), Fence, 0, 0, InsertAtEnd) {
1124 setOrdering(Ordering);
1125 setSynchScope(SynchScope);
1128 //===----------------------------------------------------------------------===//
1129 // GetElementPtrInst Implementation
1130 //===----------------------------------------------------------------------===//
1132 void GetElementPtrInst::init(Value *Ptr, ArrayRef<Value *> IdxList,
1133 const Twine &Name) {
1134 assert(NumOperands == 1 + IdxList.size() && "NumOperands not initialized?");
1135 OperandList[0] = Ptr;
1136 std::copy(IdxList.begin(), IdxList.end(), op_begin() + 1);
1140 GetElementPtrInst::GetElementPtrInst(const GetElementPtrInst &GEPI)
1141 : Instruction(GEPI.getType(), GetElementPtr,
1142 OperandTraits<GetElementPtrInst>::op_end(this)
1143 - GEPI.getNumOperands(),
1144 GEPI.getNumOperands()) {
1145 std::copy(GEPI.op_begin(), GEPI.op_end(), op_begin());
1146 SubclassOptionalData = GEPI.SubclassOptionalData;
1149 /// getIndexedType - Returns the type of the element that would be accessed with
1150 /// a gep instruction with the specified parameters.
1152 /// The Idxs pointer should point to a continuous piece of memory containing the
1153 /// indices, either as Value* or uint64_t.
1155 /// A null type is returned if the indices are invalid for the specified
1158 template <typename IndexTy>
1159 static Type *getIndexedTypeInternal(Type *Ptr, ArrayRef<IndexTy> IdxList) {
1160 PointerType *PTy = dyn_cast<PointerType>(Ptr);
1161 if (!PTy) return 0; // Type isn't a pointer type!
1162 Type *Agg = PTy->getElementType();
1164 // Handle the special case of the empty set index set, which is always valid.
1165 if (IdxList.empty())
1168 // If there is at least one index, the top level type must be sized, otherwise
1169 // it cannot be 'stepped over'.
1170 if (!Agg->isSized())
1173 unsigned CurIdx = 1;
1174 for (; CurIdx != IdxList.size(); ++CurIdx) {
1175 CompositeType *CT = dyn_cast<CompositeType>(Agg);
1176 if (!CT || CT->isPointerTy()) return 0;
1177 IndexTy Index = IdxList[CurIdx];
1178 if (!CT->indexValid(Index)) return 0;
1179 Agg = CT->getTypeAtIndex(Index);
1181 return CurIdx == IdxList.size() ? Agg : 0;
1184 Type *GetElementPtrInst::getIndexedType(Type *Ptr, ArrayRef<Value *> IdxList) {
1185 return getIndexedTypeInternal(Ptr, IdxList);
1188 Type *GetElementPtrInst::getIndexedType(Type *Ptr,
1189 ArrayRef<Constant *> IdxList) {
1190 return getIndexedTypeInternal(Ptr, IdxList);
1193 Type *GetElementPtrInst::getIndexedType(Type *Ptr, ArrayRef<uint64_t> IdxList) {
1194 return getIndexedTypeInternal(Ptr, IdxList);
1197 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
1198 /// zeros. If so, the result pointer and the first operand have the same
1199 /// value, just potentially different types.
1200 bool GetElementPtrInst::hasAllZeroIndices() const {
1201 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1202 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
1203 if (!CI->isZero()) return false;
1211 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
1212 /// constant integers. If so, the result pointer and the first operand have
1213 /// a constant offset between them.
1214 bool GetElementPtrInst::hasAllConstantIndices() const {
1215 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1216 if (!isa<ConstantInt>(getOperand(i)))
1222 void GetElementPtrInst::setIsInBounds(bool B) {
1223 cast<GEPOperator>(this)->setIsInBounds(B);
1226 bool GetElementPtrInst::isInBounds() const {
1227 return cast<GEPOperator>(this)->isInBounds();
1230 //===----------------------------------------------------------------------===//
1231 // ExtractElementInst Implementation
1232 //===----------------------------------------------------------------------===//
1234 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1236 Instruction *InsertBef)
1237 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1239 OperandTraits<ExtractElementInst>::op_begin(this),
1241 assert(isValidOperands(Val, Index) &&
1242 "Invalid extractelement instruction operands!");
1248 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1250 BasicBlock *InsertAE)
1251 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1253 OperandTraits<ExtractElementInst>::op_begin(this),
1255 assert(isValidOperands(Val, Index) &&
1256 "Invalid extractelement instruction operands!");
1264 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
1265 if (!Val->getType()->isVectorTy() || !Index->getType()->isIntegerTy(32))
1271 //===----------------------------------------------------------------------===//
1272 // InsertElementInst Implementation
1273 //===----------------------------------------------------------------------===//
1275 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1277 Instruction *InsertBef)
1278 : Instruction(Vec->getType(), InsertElement,
1279 OperandTraits<InsertElementInst>::op_begin(this),
1281 assert(isValidOperands(Vec, Elt, Index) &&
1282 "Invalid insertelement instruction operands!");
1289 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1291 BasicBlock *InsertAE)
1292 : Instruction(Vec->getType(), InsertElement,
1293 OperandTraits<InsertElementInst>::op_begin(this),
1295 assert(isValidOperands(Vec, Elt, Index) &&
1296 "Invalid insertelement instruction operands!");
1304 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
1305 const Value *Index) {
1306 if (!Vec->getType()->isVectorTy())
1307 return false; // First operand of insertelement must be vector type.
1309 if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
1310 return false;// Second operand of insertelement must be vector element type.
1312 if (!Index->getType()->isIntegerTy(32))
1313 return false; // Third operand of insertelement must be i32.
1318 //===----------------------------------------------------------------------===//
1319 // ShuffleVectorInst Implementation
1320 //===----------------------------------------------------------------------===//
1322 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1324 Instruction *InsertBefore)
1325 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1326 cast<VectorType>(Mask->getType())->getNumElements()),
1328 OperandTraits<ShuffleVectorInst>::op_begin(this),
1329 OperandTraits<ShuffleVectorInst>::operands(this),
1331 assert(isValidOperands(V1, V2, Mask) &&
1332 "Invalid shuffle vector instruction operands!");
1339 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1341 BasicBlock *InsertAtEnd)
1342 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1343 cast<VectorType>(Mask->getType())->getNumElements()),
1345 OperandTraits<ShuffleVectorInst>::op_begin(this),
1346 OperandTraits<ShuffleVectorInst>::operands(this),
1348 assert(isValidOperands(V1, V2, Mask) &&
1349 "Invalid shuffle vector instruction operands!");
1357 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1358 const Value *Mask) {
1359 if (!V1->getType()->isVectorTy() || V1->getType() != V2->getType())
1362 VectorType *MaskTy = dyn_cast<VectorType>(Mask->getType());
1363 if (MaskTy == 0 || !MaskTy->getElementType()->isIntegerTy(32))
1366 // Check to see if Mask is valid.
1367 if (const ConstantVector *MV = dyn_cast<ConstantVector>(Mask)) {
1368 VectorType *VTy = cast<VectorType>(V1->getType());
1369 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
1370 if (ConstantInt* CI = dyn_cast<ConstantInt>(MV->getOperand(i))) {
1371 if (CI->uge(VTy->getNumElements()*2))
1373 } else if (!isa<UndefValue>(MV->getOperand(i))) {
1378 else if (!isa<UndefValue>(Mask) && !isa<ConstantAggregateZero>(Mask))
1384 /// getMaskValue - Return the index from the shuffle mask for the specified
1385 /// output result. This is either -1 if the element is undef or a number less
1386 /// than 2*numelements.
1387 int ShuffleVectorInst::getMaskValue(unsigned i) const {
1388 const Constant *Mask = cast<Constant>(getOperand(2));
1389 if (isa<UndefValue>(Mask)) return -1;
1390 if (isa<ConstantAggregateZero>(Mask)) return 0;
1391 const ConstantVector *MaskCV = cast<ConstantVector>(Mask);
1392 assert(i < MaskCV->getNumOperands() && "Index out of range");
1394 if (isa<UndefValue>(MaskCV->getOperand(i)))
1396 return cast<ConstantInt>(MaskCV->getOperand(i))->getZExtValue();
1399 //===----------------------------------------------------------------------===//
1400 // InsertValueInst Class
1401 //===----------------------------------------------------------------------===//
1403 void InsertValueInst::init(Value *Agg, Value *Val, ArrayRef<unsigned> Idxs,
1404 const Twine &Name) {
1405 assert(NumOperands == 2 && "NumOperands not initialized?");
1407 // There's no fundamental reason why we require at least one index
1408 // (other than weirdness with &*IdxBegin being invalid; see
1409 // getelementptr's init routine for example). But there's no
1410 // present need to support it.
1411 assert(Idxs.size() > 0 && "InsertValueInst must have at least one index");
1413 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs) ==
1414 Val->getType() && "Inserted value must match indexed type!");
1418 Indices.append(Idxs.begin(), Idxs.end());
1422 InsertValueInst::InsertValueInst(const InsertValueInst &IVI)
1423 : Instruction(IVI.getType(), InsertValue,
1424 OperandTraits<InsertValueInst>::op_begin(this), 2),
1425 Indices(IVI.Indices) {
1426 Op<0>() = IVI.getOperand(0);
1427 Op<1>() = IVI.getOperand(1);
1428 SubclassOptionalData = IVI.SubclassOptionalData;
1431 //===----------------------------------------------------------------------===//
1432 // ExtractValueInst Class
1433 //===----------------------------------------------------------------------===//
1435 void ExtractValueInst::init(ArrayRef<unsigned> Idxs, const Twine &Name) {
1436 assert(NumOperands == 1 && "NumOperands not initialized?");
1438 // There's no fundamental reason why we require at least one index.
1439 // But there's no present need to support it.
1440 assert(Idxs.size() > 0 && "ExtractValueInst must have at least one index");
1442 Indices.append(Idxs.begin(), Idxs.end());
1446 ExtractValueInst::ExtractValueInst(const ExtractValueInst &EVI)
1447 : UnaryInstruction(EVI.getType(), ExtractValue, EVI.getOperand(0)),
1448 Indices(EVI.Indices) {
1449 SubclassOptionalData = EVI.SubclassOptionalData;
1452 // getIndexedType - Returns the type of the element that would be extracted
1453 // with an extractvalue instruction with the specified parameters.
1455 // A null type is returned if the indices are invalid for the specified
1458 Type *ExtractValueInst::getIndexedType(Type *Agg,
1459 ArrayRef<unsigned> Idxs) {
1460 for (unsigned CurIdx = 0; CurIdx != Idxs.size(); ++CurIdx) {
1461 unsigned Index = Idxs[CurIdx];
1462 // We can't use CompositeType::indexValid(Index) here.
1463 // indexValid() always returns true for arrays because getelementptr allows
1464 // out-of-bounds indices. Since we don't allow those for extractvalue and
1465 // insertvalue we need to check array indexing manually.
1466 // Since the only other types we can index into are struct types it's just
1467 // as easy to check those manually as well.
1468 if (ArrayType *AT = dyn_cast<ArrayType>(Agg)) {
1469 if (Index >= AT->getNumElements())
1471 } else if (StructType *ST = dyn_cast<StructType>(Agg)) {
1472 if (Index >= ST->getNumElements())
1475 // Not a valid type to index into.
1479 Agg = cast<CompositeType>(Agg)->getTypeAtIndex(Index);
1481 return const_cast<Type*>(Agg);
1484 //===----------------------------------------------------------------------===//
1485 // BinaryOperator Class
1486 //===----------------------------------------------------------------------===//
1488 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1489 Type *Ty, const Twine &Name,
1490 Instruction *InsertBefore)
1491 : Instruction(Ty, iType,
1492 OperandTraits<BinaryOperator>::op_begin(this),
1493 OperandTraits<BinaryOperator>::operands(this),
1501 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1502 Type *Ty, const Twine &Name,
1503 BasicBlock *InsertAtEnd)
1504 : Instruction(Ty, iType,
1505 OperandTraits<BinaryOperator>::op_begin(this),
1506 OperandTraits<BinaryOperator>::operands(this),
1515 void BinaryOperator::init(BinaryOps iType) {
1516 Value *LHS = getOperand(0), *RHS = getOperand(1);
1517 (void)LHS; (void)RHS; // Silence warnings.
1518 assert(LHS->getType() == RHS->getType() &&
1519 "Binary operator operand types must match!");
1524 assert(getType() == LHS->getType() &&
1525 "Arithmetic operation should return same type as operands!");
1526 assert(getType()->isIntOrIntVectorTy() &&
1527 "Tried to create an integer operation on a non-integer type!");
1529 case FAdd: case FSub:
1531 assert(getType() == LHS->getType() &&
1532 "Arithmetic operation should return same type as operands!");
1533 assert(getType()->isFPOrFPVectorTy() &&
1534 "Tried to create a floating-point operation on a "
1535 "non-floating-point type!");
1539 assert(getType() == LHS->getType() &&
1540 "Arithmetic operation should return same type as operands!");
1541 assert((getType()->isIntegerTy() || (getType()->isVectorTy() &&
1542 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1543 "Incorrect operand type (not integer) for S/UDIV");
1546 assert(getType() == LHS->getType() &&
1547 "Arithmetic operation should return same type as operands!");
1548 assert(getType()->isFPOrFPVectorTy() &&
1549 "Incorrect operand type (not floating point) for FDIV");
1553 assert(getType() == LHS->getType() &&
1554 "Arithmetic operation should return same type as operands!");
1555 assert((getType()->isIntegerTy() || (getType()->isVectorTy() &&
1556 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1557 "Incorrect operand type (not integer) for S/UREM");
1560 assert(getType() == LHS->getType() &&
1561 "Arithmetic operation should return same type as operands!");
1562 assert(getType()->isFPOrFPVectorTy() &&
1563 "Incorrect operand type (not floating point) for FREM");
1568 assert(getType() == LHS->getType() &&
1569 "Shift operation should return same type as operands!");
1570 assert((getType()->isIntegerTy() ||
1571 (getType()->isVectorTy() &&
1572 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1573 "Tried to create a shift operation on a non-integral type!");
1577 assert(getType() == LHS->getType() &&
1578 "Logical operation should return same type as operands!");
1579 assert((getType()->isIntegerTy() ||
1580 (getType()->isVectorTy() &&
1581 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1582 "Tried to create a logical operation on a non-integral type!");
1590 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1592 Instruction *InsertBefore) {
1593 assert(S1->getType() == S2->getType() &&
1594 "Cannot create binary operator with two operands of differing type!");
1595 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1598 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1600 BasicBlock *InsertAtEnd) {
1601 BinaryOperator *Res = Create(Op, S1, S2, Name);
1602 InsertAtEnd->getInstList().push_back(Res);
1606 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1607 Instruction *InsertBefore) {
1608 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1609 return new BinaryOperator(Instruction::Sub,
1611 Op->getType(), Name, InsertBefore);
1614 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1615 BasicBlock *InsertAtEnd) {
1616 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1617 return new BinaryOperator(Instruction::Sub,
1619 Op->getType(), Name, InsertAtEnd);
1622 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1623 Instruction *InsertBefore) {
1624 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1625 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertBefore);
1628 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1629 BasicBlock *InsertAtEnd) {
1630 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1631 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertAtEnd);
1634 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1635 Instruction *InsertBefore) {
1636 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1637 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertBefore);
1640 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1641 BasicBlock *InsertAtEnd) {
1642 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1643 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertAtEnd);
1646 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1647 Instruction *InsertBefore) {
1648 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1649 return new BinaryOperator(Instruction::FSub,
1651 Op->getType(), Name, InsertBefore);
1654 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1655 BasicBlock *InsertAtEnd) {
1656 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1657 return new BinaryOperator(Instruction::FSub,
1659 Op->getType(), Name, InsertAtEnd);
1662 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1663 Instruction *InsertBefore) {
1665 if (VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1666 C = Constant::getAllOnesValue(PTy->getElementType());
1667 C = ConstantVector::get(
1668 std::vector<Constant*>(PTy->getNumElements(), C));
1670 C = Constant::getAllOnesValue(Op->getType());
1673 return new BinaryOperator(Instruction::Xor, Op, C,
1674 Op->getType(), Name, InsertBefore);
1677 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1678 BasicBlock *InsertAtEnd) {
1680 if (VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1681 // Create a vector of all ones values.
1682 Constant *Elt = Constant::getAllOnesValue(PTy->getElementType());
1683 AllOnes = ConstantVector::get(
1684 std::vector<Constant*>(PTy->getNumElements(), Elt));
1686 AllOnes = Constant::getAllOnesValue(Op->getType());
1689 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1690 Op->getType(), Name, InsertAtEnd);
1694 // isConstantAllOnes - Helper function for several functions below
1695 static inline bool isConstantAllOnes(const Value *V) {
1696 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V))
1697 return CI->isAllOnesValue();
1698 if (const ConstantVector *CV = dyn_cast<ConstantVector>(V))
1699 return CV->isAllOnesValue();
1703 bool BinaryOperator::isNeg(const Value *V) {
1704 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1705 if (Bop->getOpcode() == Instruction::Sub)
1706 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0)))
1707 return C->isNegativeZeroValue();
1711 bool BinaryOperator::isFNeg(const Value *V) {
1712 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1713 if (Bop->getOpcode() == Instruction::FSub)
1714 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0)))
1715 return C->isNegativeZeroValue();
1719 bool BinaryOperator::isNot(const Value *V) {
1720 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1721 return (Bop->getOpcode() == Instruction::Xor &&
1722 (isConstantAllOnes(Bop->getOperand(1)) ||
1723 isConstantAllOnes(Bop->getOperand(0))));
1727 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1728 return cast<BinaryOperator>(BinOp)->getOperand(1);
1731 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1732 return getNegArgument(const_cast<Value*>(BinOp));
1735 Value *BinaryOperator::getFNegArgument(Value *BinOp) {
1736 return cast<BinaryOperator>(BinOp)->getOperand(1);
1739 const Value *BinaryOperator::getFNegArgument(const Value *BinOp) {
1740 return getFNegArgument(const_cast<Value*>(BinOp));
1743 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1744 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1745 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1746 Value *Op0 = BO->getOperand(0);
1747 Value *Op1 = BO->getOperand(1);
1748 if (isConstantAllOnes(Op0)) return Op1;
1750 assert(isConstantAllOnes(Op1));
1754 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1755 return getNotArgument(const_cast<Value*>(BinOp));
1759 // swapOperands - Exchange the two operands to this instruction. This
1760 // instruction is safe to use on any binary instruction and does not
1761 // modify the semantics of the instruction. If the instruction is
1762 // order dependent (SetLT f.e.) the opcode is changed.
1764 bool BinaryOperator::swapOperands() {
1765 if (!isCommutative())
1766 return true; // Can't commute operands
1767 Op<0>().swap(Op<1>());
1771 void BinaryOperator::setHasNoUnsignedWrap(bool b) {
1772 cast<OverflowingBinaryOperator>(this)->setHasNoUnsignedWrap(b);
1775 void BinaryOperator::setHasNoSignedWrap(bool b) {
1776 cast<OverflowingBinaryOperator>(this)->setHasNoSignedWrap(b);
1779 void BinaryOperator::setIsExact(bool b) {
1780 cast<PossiblyExactOperator>(this)->setIsExact(b);
1783 bool BinaryOperator::hasNoUnsignedWrap() const {
1784 return cast<OverflowingBinaryOperator>(this)->hasNoUnsignedWrap();
1787 bool BinaryOperator::hasNoSignedWrap() const {
1788 return cast<OverflowingBinaryOperator>(this)->hasNoSignedWrap();
1791 bool BinaryOperator::isExact() const {
1792 return cast<PossiblyExactOperator>(this)->isExact();
1795 //===----------------------------------------------------------------------===//
1797 //===----------------------------------------------------------------------===//
1799 // Just determine if this cast only deals with integral->integral conversion.
1800 bool CastInst::isIntegerCast() const {
1801 switch (getOpcode()) {
1802 default: return false;
1803 case Instruction::ZExt:
1804 case Instruction::SExt:
1805 case Instruction::Trunc:
1807 case Instruction::BitCast:
1808 return getOperand(0)->getType()->isIntegerTy() &&
1809 getType()->isIntegerTy();
1813 bool CastInst::isLosslessCast() const {
1814 // Only BitCast can be lossless, exit fast if we're not BitCast
1815 if (getOpcode() != Instruction::BitCast)
1818 // Identity cast is always lossless
1819 Type* SrcTy = getOperand(0)->getType();
1820 Type* DstTy = getType();
1824 // Pointer to pointer is always lossless.
1825 if (SrcTy->isPointerTy())
1826 return DstTy->isPointerTy();
1827 return false; // Other types have no identity values
1830 /// This function determines if the CastInst does not require any bits to be
1831 /// changed in order to effect the cast. Essentially, it identifies cases where
1832 /// no code gen is necessary for the cast, hence the name no-op cast. For
1833 /// example, the following are all no-op casts:
1834 /// # bitcast i32* %x to i8*
1835 /// # bitcast <2 x i32> %x to <4 x i16>
1836 /// # ptrtoint i32* %x to i32 ; on 32-bit plaforms only
1837 /// @brief Determine if the described cast is a no-op.
1838 bool CastInst::isNoopCast(Instruction::CastOps Opcode,
1844 assert(!"Invalid CastOp");
1845 case Instruction::Trunc:
1846 case Instruction::ZExt:
1847 case Instruction::SExt:
1848 case Instruction::FPTrunc:
1849 case Instruction::FPExt:
1850 case Instruction::UIToFP:
1851 case Instruction::SIToFP:
1852 case Instruction::FPToUI:
1853 case Instruction::FPToSI:
1854 return false; // These always modify bits
1855 case Instruction::BitCast:
1856 return true; // BitCast never modifies bits.
1857 case Instruction::PtrToInt:
1858 return IntPtrTy->getScalarSizeInBits() ==
1859 DestTy->getScalarSizeInBits();
1860 case Instruction::IntToPtr:
1861 return IntPtrTy->getScalarSizeInBits() ==
1862 SrcTy->getScalarSizeInBits();
1866 /// @brief Determine if a cast is a no-op.
1867 bool CastInst::isNoopCast(Type *IntPtrTy) const {
1868 return isNoopCast(getOpcode(), getOperand(0)->getType(), getType(), IntPtrTy);
1871 /// This function determines if a pair of casts can be eliminated and what
1872 /// opcode should be used in the elimination. This assumes that there are two
1873 /// instructions like this:
1874 /// * %F = firstOpcode SrcTy %x to MidTy
1875 /// * %S = secondOpcode MidTy %F to DstTy
1876 /// The function returns a resultOpcode so these two casts can be replaced with:
1877 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
1878 /// If no such cast is permited, the function returns 0.
1879 unsigned CastInst::isEliminableCastPair(
1880 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
1881 Type *SrcTy, Type *MidTy, Type *DstTy, Type *IntPtrTy)
1883 // Define the 144 possibilities for these two cast instructions. The values
1884 // in this matrix determine what to do in a given situation and select the
1885 // case in the switch below. The rows correspond to firstOp, the columns
1886 // correspond to secondOp. In looking at the table below, keep in mind
1887 // the following cast properties:
1889 // Size Compare Source Destination
1890 // Operator Src ? Size Type Sign Type Sign
1891 // -------- ------------ ------------------- ---------------------
1892 // TRUNC > Integer Any Integral Any
1893 // ZEXT < Integral Unsigned Integer Any
1894 // SEXT < Integral Signed Integer Any
1895 // FPTOUI n/a FloatPt n/a Integral Unsigned
1896 // FPTOSI n/a FloatPt n/a Integral Signed
1897 // UITOFP n/a Integral Unsigned FloatPt n/a
1898 // SITOFP n/a Integral Signed FloatPt n/a
1899 // FPTRUNC > FloatPt n/a FloatPt n/a
1900 // FPEXT < FloatPt n/a FloatPt n/a
1901 // PTRTOINT n/a Pointer n/a Integral Unsigned
1902 // INTTOPTR n/a Integral Unsigned Pointer n/a
1903 // BITCAST = FirstClass n/a FirstClass n/a
1905 // NOTE: some transforms are safe, but we consider them to be non-profitable.
1906 // For example, we could merge "fptoui double to i32" + "zext i32 to i64",
1907 // into "fptoui double to i64", but this loses information about the range
1908 // of the produced value (we no longer know the top-part is all zeros).
1909 // Further this conversion is often much more expensive for typical hardware,
1910 // and causes issues when building libgcc. We disallow fptosi+sext for the
1912 const unsigned numCastOps =
1913 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
1914 static const uint8_t CastResults[numCastOps][numCastOps] = {
1915 // T F F U S F F P I B -+
1916 // R Z S P P I I T P 2 N T |
1917 // U E E 2 2 2 2 R E I T C +- secondOp
1918 // N X X U S F F N X N 2 V |
1919 // C T T I I P P C T T P T -+
1920 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
1921 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
1922 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
1923 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
1924 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
1925 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
1926 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
1927 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
1928 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
1929 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
1930 { 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
1931 { 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
1934 // If either of the casts are a bitcast from scalar to vector, disallow the
1936 if ((firstOp == Instruction::BitCast &&
1937 isa<VectorType>(SrcTy) != isa<VectorType>(MidTy)) ||
1938 (secondOp == Instruction::BitCast &&
1939 isa<VectorType>(MidTy) != isa<VectorType>(DstTy)))
1940 return 0; // Disallowed
1942 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
1943 [secondOp-Instruction::CastOpsBegin];
1946 // categorically disallowed
1949 // allowed, use first cast's opcode
1952 // allowed, use second cast's opcode
1955 // no-op cast in second op implies firstOp as long as the DestTy
1956 // is integer and we are not converting between a vector and a
1958 if (!SrcTy->isVectorTy() && DstTy->isIntegerTy())
1962 // no-op cast in second op implies firstOp as long as the DestTy
1963 // is floating point.
1964 if (DstTy->isFloatingPointTy())
1968 // no-op cast in first op implies secondOp as long as the SrcTy
1970 if (SrcTy->isIntegerTy())
1974 // no-op cast in first op implies secondOp as long as the SrcTy
1975 // is a floating point.
1976 if (SrcTy->isFloatingPointTy())
1980 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size
1983 unsigned PtrSize = IntPtrTy->getScalarSizeInBits();
1984 unsigned MidSize = MidTy->getScalarSizeInBits();
1985 if (MidSize >= PtrSize)
1986 return Instruction::BitCast;
1990 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
1991 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
1992 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
1993 unsigned SrcSize = SrcTy->getScalarSizeInBits();
1994 unsigned DstSize = DstTy->getScalarSizeInBits();
1995 if (SrcSize == DstSize)
1996 return Instruction::BitCast;
1997 else if (SrcSize < DstSize)
2001 case 9: // zext, sext -> zext, because sext can't sign extend after zext
2002 return Instruction::ZExt;
2004 // fpext followed by ftrunc is allowed if the bit size returned to is
2005 // the same as the original, in which case its just a bitcast
2007 return Instruction::BitCast;
2008 return 0; // If the types are not the same we can't eliminate it.
2010 // bitcast followed by ptrtoint is allowed as long as the bitcast
2011 // is a pointer to pointer cast.
2012 if (SrcTy->isPointerTy() && MidTy->isPointerTy())
2016 // inttoptr, bitcast -> intptr if bitcast is a ptr to ptr cast
2017 if (MidTy->isPointerTy() && DstTy->isPointerTy())
2021 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
2024 unsigned PtrSize = IntPtrTy->getScalarSizeInBits();
2025 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2026 unsigned DstSize = DstTy->getScalarSizeInBits();
2027 if (SrcSize <= PtrSize && SrcSize == DstSize)
2028 return Instruction::BitCast;
2032 // cast combination can't happen (error in input). This is for all cases
2033 // where the MidTy is not the same for the two cast instructions.
2034 assert(!"Invalid Cast Combination");
2037 assert(!"Error in CastResults table!!!");
2043 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2044 const Twine &Name, Instruction *InsertBefore) {
2045 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2046 // Construct and return the appropriate CastInst subclass
2048 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
2049 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
2050 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
2051 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
2052 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
2053 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
2054 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
2055 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
2056 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
2057 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
2058 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
2059 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
2061 assert(!"Invalid opcode provided");
2066 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2067 const Twine &Name, BasicBlock *InsertAtEnd) {
2068 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2069 // Construct and return the appropriate CastInst subclass
2071 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
2072 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
2073 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
2074 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
2075 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
2076 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
2077 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
2078 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
2079 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
2080 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
2081 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
2082 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
2084 assert(!"Invalid opcode provided");
2089 CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
2091 Instruction *InsertBefore) {
2092 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2093 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2094 return Create(Instruction::ZExt, S, Ty, Name, InsertBefore);
2097 CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
2099 BasicBlock *InsertAtEnd) {
2100 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2101 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2102 return Create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
2105 CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
2107 Instruction *InsertBefore) {
2108 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2109 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2110 return Create(Instruction::SExt, S, Ty, Name, InsertBefore);
2113 CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
2115 BasicBlock *InsertAtEnd) {
2116 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2117 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2118 return Create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
2121 CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
2123 Instruction *InsertBefore) {
2124 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2125 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2126 return Create(Instruction::Trunc, S, Ty, Name, InsertBefore);
2129 CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
2131 BasicBlock *InsertAtEnd) {
2132 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2133 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2134 return Create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
2137 CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
2139 BasicBlock *InsertAtEnd) {
2140 assert(S->getType()->isPointerTy() && "Invalid cast");
2141 assert((Ty->isIntegerTy() || Ty->isPointerTy()) &&
2144 if (Ty->isIntegerTy())
2145 return Create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
2146 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2149 /// @brief Create a BitCast or a PtrToInt cast instruction
2150 CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
2152 Instruction *InsertBefore) {
2153 assert(S->getType()->isPointerTy() && "Invalid cast");
2154 assert((Ty->isIntegerTy() || Ty->isPointerTy()) &&
2157 if (Ty->isIntegerTy())
2158 return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
2159 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2162 CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
2163 bool isSigned, const Twine &Name,
2164 Instruction *InsertBefore) {
2165 assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&
2166 "Invalid integer cast");
2167 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2168 unsigned DstBits = Ty->getScalarSizeInBits();
2169 Instruction::CastOps opcode =
2170 (SrcBits == DstBits ? Instruction::BitCast :
2171 (SrcBits > DstBits ? Instruction::Trunc :
2172 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2173 return Create(opcode, C, Ty, Name, InsertBefore);
2176 CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
2177 bool isSigned, const Twine &Name,
2178 BasicBlock *InsertAtEnd) {
2179 assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&
2181 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2182 unsigned DstBits = Ty->getScalarSizeInBits();
2183 Instruction::CastOps opcode =
2184 (SrcBits == DstBits ? Instruction::BitCast :
2185 (SrcBits > DstBits ? Instruction::Trunc :
2186 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2187 return Create(opcode, C, Ty, Name, InsertAtEnd);
2190 CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
2192 Instruction *InsertBefore) {
2193 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
2195 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2196 unsigned DstBits = Ty->getScalarSizeInBits();
2197 Instruction::CastOps opcode =
2198 (SrcBits == DstBits ? Instruction::BitCast :
2199 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2200 return Create(opcode, C, Ty, Name, InsertBefore);
2203 CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
2205 BasicBlock *InsertAtEnd) {
2206 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
2208 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2209 unsigned DstBits = Ty->getScalarSizeInBits();
2210 Instruction::CastOps opcode =
2211 (SrcBits == DstBits ? Instruction::BitCast :
2212 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2213 return Create(opcode, C, Ty, Name, InsertAtEnd);
2216 // Check whether it is valid to call getCastOpcode for these types.
2217 // This routine must be kept in sync with getCastOpcode.
2218 bool CastInst::isCastable(Type *SrcTy, Type *DestTy) {
2219 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2222 if (SrcTy == DestTy)
2225 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy))
2226 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy))
2227 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2228 // An element by element cast. Valid if casting the elements is valid.
2229 SrcTy = SrcVecTy->getElementType();
2230 DestTy = DestVecTy->getElementType();
2233 // Get the bit sizes, we'll need these
2234 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2235 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2237 // Run through the possibilities ...
2238 if (DestTy->isIntegerTy()) { // Casting to integral
2239 if (SrcTy->isIntegerTy()) { // Casting from integral
2241 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2243 } else if (SrcTy->isVectorTy()) { // Casting from vector
2244 return DestBits == SrcBits;
2245 } else { // Casting from something else
2246 return SrcTy->isPointerTy();
2248 } else if (DestTy->isFloatingPointTy()) { // Casting to floating pt
2249 if (SrcTy->isIntegerTy()) { // Casting from integral
2251 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2253 } else if (SrcTy->isVectorTy()) { // Casting from vector
2254 return DestBits == SrcBits;
2255 } else { // Casting from something else
2258 } else if (DestTy->isVectorTy()) { // Casting to vector
2259 return DestBits == SrcBits;
2260 } else if (DestTy->isPointerTy()) { // Casting to pointer
2261 if (SrcTy->isPointerTy()) { // Casting from pointer
2263 } else if (SrcTy->isIntegerTy()) { // Casting from integral
2265 } else { // Casting from something else
2268 } else if (DestTy->isX86_MMXTy()) {
2269 if (SrcTy->isVectorTy()) {
2270 return DestBits == SrcBits; // 64-bit vector to MMX
2274 } else { // Casting to something else
2279 // Provide a way to get a "cast" where the cast opcode is inferred from the
2280 // types and size of the operand. This, basically, is a parallel of the
2281 // logic in the castIsValid function below. This axiom should hold:
2282 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
2283 // should not assert in castIsValid. In other words, this produces a "correct"
2284 // casting opcode for the arguments passed to it.
2285 // This routine must be kept in sync with isCastable.
2286 Instruction::CastOps
2287 CastInst::getCastOpcode(
2288 const Value *Src, bool SrcIsSigned, Type *DestTy, bool DestIsSigned) {
2289 Type *SrcTy = Src->getType();
2291 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2292 "Only first class types are castable!");
2294 if (SrcTy == DestTy)
2297 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy))
2298 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy))
2299 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2300 // An element by element cast. Find the appropriate opcode based on the
2302 SrcTy = SrcVecTy->getElementType();
2303 DestTy = DestVecTy->getElementType();
2306 // Get the bit sizes, we'll need these
2307 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2308 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2310 // Run through the possibilities ...
2311 if (DestTy->isIntegerTy()) { // Casting to integral
2312 if (SrcTy->isIntegerTy()) { // Casting from integral
2313 if (DestBits < SrcBits)
2314 return Trunc; // int -> smaller int
2315 else if (DestBits > SrcBits) { // its an extension
2317 return SExt; // signed -> SEXT
2319 return ZExt; // unsigned -> ZEXT
2321 return BitCast; // Same size, No-op cast
2323 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2325 return FPToSI; // FP -> sint
2327 return FPToUI; // FP -> uint
2328 } else if (SrcTy->isVectorTy()) {
2329 assert(DestBits == SrcBits &&
2330 "Casting vector to integer of different width");
2331 return BitCast; // Same size, no-op cast
2333 assert(SrcTy->isPointerTy() &&
2334 "Casting from a value that is not first-class type");
2335 return PtrToInt; // ptr -> int
2337 } else if (DestTy->isFloatingPointTy()) { // Casting to floating pt
2338 if (SrcTy->isIntegerTy()) { // Casting from integral
2340 return SIToFP; // sint -> FP
2342 return UIToFP; // uint -> FP
2343 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2344 if (DestBits < SrcBits) {
2345 return FPTrunc; // FP -> smaller FP
2346 } else if (DestBits > SrcBits) {
2347 return FPExt; // FP -> larger FP
2349 return BitCast; // same size, no-op cast
2351 } else if (SrcTy->isVectorTy()) {
2352 assert(DestBits == SrcBits &&
2353 "Casting vector to floating point of different width");
2354 return BitCast; // same size, no-op cast
2356 llvm_unreachable("Casting pointer or non-first class to float");
2358 } else if (DestTy->isVectorTy()) {
2359 assert(DestBits == SrcBits &&
2360 "Illegal cast to vector (wrong type or size)");
2362 } else if (DestTy->isPointerTy()) {
2363 if (SrcTy->isPointerTy()) {
2364 return BitCast; // ptr -> ptr
2365 } else if (SrcTy->isIntegerTy()) {
2366 return IntToPtr; // int -> ptr
2368 assert(!"Casting pointer to other than pointer or int");
2370 } else if (DestTy->isX86_MMXTy()) {
2371 if (SrcTy->isVectorTy()) {
2372 assert(DestBits == SrcBits && "Casting vector of wrong width to X86_MMX");
2373 return BitCast; // 64-bit vector to MMX
2375 assert(!"Illegal cast to X86_MMX");
2378 assert(!"Casting to type that is not first-class");
2381 // If we fall through to here we probably hit an assertion cast above
2382 // and assertions are not turned on. Anything we return is an error, so
2383 // BitCast is as good a choice as any.
2387 //===----------------------------------------------------------------------===//
2388 // CastInst SubClass Constructors
2389 //===----------------------------------------------------------------------===//
2391 /// Check that the construction parameters for a CastInst are correct. This
2392 /// could be broken out into the separate constructors but it is useful to have
2393 /// it in one place and to eliminate the redundant code for getting the sizes
2394 /// of the types involved.
2396 CastInst::castIsValid(Instruction::CastOps op, Value *S, Type *DstTy) {
2398 // Check for type sanity on the arguments
2399 Type *SrcTy = S->getType();
2400 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType() ||
2401 SrcTy->isAggregateType() || DstTy->isAggregateType())
2404 // Get the size of the types in bits, we'll need this later
2405 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2406 unsigned DstBitSize = DstTy->getScalarSizeInBits();
2408 // If these are vector types, get the lengths of the vectors (using zero for
2409 // scalar types means that checking that vector lengths match also checks that
2410 // scalars are not being converted to vectors or vectors to scalars).
2411 unsigned SrcLength = SrcTy->isVectorTy() ?
2412 cast<VectorType>(SrcTy)->getNumElements() : 0;
2413 unsigned DstLength = DstTy->isVectorTy() ?
2414 cast<VectorType>(DstTy)->getNumElements() : 0;
2416 // Switch on the opcode provided
2418 default: return false; // This is an input error
2419 case Instruction::Trunc:
2420 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2421 SrcLength == DstLength && SrcBitSize > DstBitSize;
2422 case Instruction::ZExt:
2423 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2424 SrcLength == DstLength && SrcBitSize < DstBitSize;
2425 case Instruction::SExt:
2426 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2427 SrcLength == DstLength && SrcBitSize < DstBitSize;
2428 case Instruction::FPTrunc:
2429 return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
2430 SrcLength == DstLength && SrcBitSize > DstBitSize;
2431 case Instruction::FPExt:
2432 return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
2433 SrcLength == DstLength && SrcBitSize < DstBitSize;
2434 case Instruction::UIToFP:
2435 case Instruction::SIToFP:
2436 return SrcTy->isIntOrIntVectorTy() && DstTy->isFPOrFPVectorTy() &&
2437 SrcLength == DstLength;
2438 case Instruction::FPToUI:
2439 case Instruction::FPToSI:
2440 return SrcTy->isFPOrFPVectorTy() && DstTy->isIntOrIntVectorTy() &&
2441 SrcLength == DstLength;
2442 case Instruction::PtrToInt:
2443 return SrcTy->isPointerTy() && DstTy->isIntegerTy();
2444 case Instruction::IntToPtr:
2445 return SrcTy->isIntegerTy() && DstTy->isPointerTy();
2446 case Instruction::BitCast:
2447 // BitCast implies a no-op cast of type only. No bits change.
2448 // However, you can't cast pointers to anything but pointers.
2449 if (SrcTy->isPointerTy() != DstTy->isPointerTy())
2452 // Now we know we're not dealing with a pointer/non-pointer mismatch. In all
2453 // these cases, the cast is okay if the source and destination bit widths
2455 return SrcTy->getPrimitiveSizeInBits() == DstTy->getPrimitiveSizeInBits();
2459 TruncInst::TruncInst(
2460 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2461 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2462 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2465 TruncInst::TruncInst(
2466 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2467 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2468 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2472 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2473 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2474 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2478 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2479 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2480 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2483 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2484 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2485 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2489 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2490 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2491 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2494 FPTruncInst::FPTruncInst(
2495 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2496 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2497 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2500 FPTruncInst::FPTruncInst(
2501 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2502 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2503 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2506 FPExtInst::FPExtInst(
2507 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2508 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2509 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2512 FPExtInst::FPExtInst(
2513 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2514 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2515 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2518 UIToFPInst::UIToFPInst(
2519 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2520 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2521 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2524 UIToFPInst::UIToFPInst(
2525 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2526 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2527 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2530 SIToFPInst::SIToFPInst(
2531 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2532 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2533 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2536 SIToFPInst::SIToFPInst(
2537 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2538 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2539 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2542 FPToUIInst::FPToUIInst(
2543 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2544 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2545 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2548 FPToUIInst::FPToUIInst(
2549 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2550 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2551 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2554 FPToSIInst::FPToSIInst(
2555 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2556 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2557 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2560 FPToSIInst::FPToSIInst(
2561 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2562 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2563 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2566 PtrToIntInst::PtrToIntInst(
2567 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2568 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2569 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2572 PtrToIntInst::PtrToIntInst(
2573 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2574 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2575 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2578 IntToPtrInst::IntToPtrInst(
2579 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2580 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2581 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2584 IntToPtrInst::IntToPtrInst(
2585 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2586 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2587 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2590 BitCastInst::BitCastInst(
2591 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2592 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2593 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2596 BitCastInst::BitCastInst(
2597 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2598 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2599 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2602 //===----------------------------------------------------------------------===//
2604 //===----------------------------------------------------------------------===//
2606 void CmpInst::Anchor() const {}
2608 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
2609 Value *LHS, Value *RHS, const Twine &Name,
2610 Instruction *InsertBefore)
2611 : Instruction(ty, op,
2612 OperandTraits<CmpInst>::op_begin(this),
2613 OperandTraits<CmpInst>::operands(this),
2617 setPredicate((Predicate)predicate);
2621 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
2622 Value *LHS, Value *RHS, const Twine &Name,
2623 BasicBlock *InsertAtEnd)
2624 : Instruction(ty, op,
2625 OperandTraits<CmpInst>::op_begin(this),
2626 OperandTraits<CmpInst>::operands(this),
2630 setPredicate((Predicate)predicate);
2635 CmpInst::Create(OtherOps Op, unsigned short predicate,
2636 Value *S1, Value *S2,
2637 const Twine &Name, Instruction *InsertBefore) {
2638 if (Op == Instruction::ICmp) {
2640 return new ICmpInst(InsertBefore, CmpInst::Predicate(predicate),
2643 return new ICmpInst(CmpInst::Predicate(predicate),
2648 return new FCmpInst(InsertBefore, CmpInst::Predicate(predicate),
2651 return new FCmpInst(CmpInst::Predicate(predicate),
2656 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2657 const Twine &Name, BasicBlock *InsertAtEnd) {
2658 if (Op == Instruction::ICmp) {
2659 return new ICmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
2662 return new FCmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
2666 void CmpInst::swapOperands() {
2667 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2670 cast<FCmpInst>(this)->swapOperands();
2673 bool CmpInst::isCommutative() const {
2674 if (const ICmpInst *IC = dyn_cast<ICmpInst>(this))
2675 return IC->isCommutative();
2676 return cast<FCmpInst>(this)->isCommutative();
2679 bool CmpInst::isEquality() const {
2680 if (const ICmpInst *IC = dyn_cast<ICmpInst>(this))
2681 return IC->isEquality();
2682 return cast<FCmpInst>(this)->isEquality();
2686 CmpInst::Predicate CmpInst::getInversePredicate(Predicate pred) {
2688 default: assert(!"Unknown cmp predicate!");
2689 case ICMP_EQ: return ICMP_NE;
2690 case ICMP_NE: return ICMP_EQ;
2691 case ICMP_UGT: return ICMP_ULE;
2692 case ICMP_ULT: return ICMP_UGE;
2693 case ICMP_UGE: return ICMP_ULT;
2694 case ICMP_ULE: return ICMP_UGT;
2695 case ICMP_SGT: return ICMP_SLE;
2696 case ICMP_SLT: return ICMP_SGE;
2697 case ICMP_SGE: return ICMP_SLT;
2698 case ICMP_SLE: return ICMP_SGT;
2700 case FCMP_OEQ: return FCMP_UNE;
2701 case FCMP_ONE: return FCMP_UEQ;
2702 case FCMP_OGT: return FCMP_ULE;
2703 case FCMP_OLT: return FCMP_UGE;
2704 case FCMP_OGE: return FCMP_ULT;
2705 case FCMP_OLE: return FCMP_UGT;
2706 case FCMP_UEQ: return FCMP_ONE;
2707 case FCMP_UNE: return FCMP_OEQ;
2708 case FCMP_UGT: return FCMP_OLE;
2709 case FCMP_ULT: return FCMP_OGE;
2710 case FCMP_UGE: return FCMP_OLT;
2711 case FCMP_ULE: return FCMP_OGT;
2712 case FCMP_ORD: return FCMP_UNO;
2713 case FCMP_UNO: return FCMP_ORD;
2714 case FCMP_TRUE: return FCMP_FALSE;
2715 case FCMP_FALSE: return FCMP_TRUE;
2719 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
2721 default: assert(! "Unknown icmp predicate!");
2722 case ICMP_EQ: case ICMP_NE:
2723 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2725 case ICMP_UGT: return ICMP_SGT;
2726 case ICMP_ULT: return ICMP_SLT;
2727 case ICMP_UGE: return ICMP_SGE;
2728 case ICMP_ULE: return ICMP_SLE;
2732 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
2734 default: assert(! "Unknown icmp predicate!");
2735 case ICMP_EQ: case ICMP_NE:
2736 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
2738 case ICMP_SGT: return ICMP_UGT;
2739 case ICMP_SLT: return ICMP_ULT;
2740 case ICMP_SGE: return ICMP_UGE;
2741 case ICMP_SLE: return ICMP_ULE;
2745 /// Initialize a set of values that all satisfy the condition with C.
2748 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
2751 uint32_t BitWidth = C.getBitWidth();
2753 default: llvm_unreachable("Invalid ICmp opcode to ConstantRange ctor!");
2754 case ICmpInst::ICMP_EQ: Upper++; break;
2755 case ICmpInst::ICMP_NE: Lower++; break;
2756 case ICmpInst::ICMP_ULT:
2757 Lower = APInt::getMinValue(BitWidth);
2758 // Check for an empty-set condition.
2760 return ConstantRange(BitWidth, /*isFullSet=*/false);
2762 case ICmpInst::ICMP_SLT:
2763 Lower = APInt::getSignedMinValue(BitWidth);
2764 // Check for an empty-set condition.
2766 return ConstantRange(BitWidth, /*isFullSet=*/false);
2768 case ICmpInst::ICMP_UGT:
2769 Lower++; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2770 // Check for an empty-set condition.
2772 return ConstantRange(BitWidth, /*isFullSet=*/false);
2774 case ICmpInst::ICMP_SGT:
2775 Lower++; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2776 // Check for an empty-set condition.
2778 return ConstantRange(BitWidth, /*isFullSet=*/false);
2780 case ICmpInst::ICMP_ULE:
2781 Lower = APInt::getMinValue(BitWidth); Upper++;
2782 // Check for a full-set condition.
2784 return ConstantRange(BitWidth, /*isFullSet=*/true);
2786 case ICmpInst::ICMP_SLE:
2787 Lower = APInt::getSignedMinValue(BitWidth); Upper++;
2788 // Check for a full-set condition.
2790 return ConstantRange(BitWidth, /*isFullSet=*/true);
2792 case ICmpInst::ICMP_UGE:
2793 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2794 // Check for a full-set condition.
2796 return ConstantRange(BitWidth, /*isFullSet=*/true);
2798 case ICmpInst::ICMP_SGE:
2799 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2800 // Check for a full-set condition.
2802 return ConstantRange(BitWidth, /*isFullSet=*/true);
2805 return ConstantRange(Lower, Upper);
2808 CmpInst::Predicate CmpInst::getSwappedPredicate(Predicate pred) {
2810 default: assert(!"Unknown cmp predicate!");
2811 case ICMP_EQ: case ICMP_NE:
2813 case ICMP_SGT: return ICMP_SLT;
2814 case ICMP_SLT: return ICMP_SGT;
2815 case ICMP_SGE: return ICMP_SLE;
2816 case ICMP_SLE: return ICMP_SGE;
2817 case ICMP_UGT: return ICMP_ULT;
2818 case ICMP_ULT: return ICMP_UGT;
2819 case ICMP_UGE: return ICMP_ULE;
2820 case ICMP_ULE: return ICMP_UGE;
2822 case FCMP_FALSE: case FCMP_TRUE:
2823 case FCMP_OEQ: case FCMP_ONE:
2824 case FCMP_UEQ: case FCMP_UNE:
2825 case FCMP_ORD: case FCMP_UNO:
2827 case FCMP_OGT: return FCMP_OLT;
2828 case FCMP_OLT: return FCMP_OGT;
2829 case FCMP_OGE: return FCMP_OLE;
2830 case FCMP_OLE: return FCMP_OGE;
2831 case FCMP_UGT: return FCMP_ULT;
2832 case FCMP_ULT: return FCMP_UGT;
2833 case FCMP_UGE: return FCMP_ULE;
2834 case FCMP_ULE: return FCMP_UGE;
2838 bool CmpInst::isUnsigned(unsigned short predicate) {
2839 switch (predicate) {
2840 default: return false;
2841 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
2842 case ICmpInst::ICMP_UGE: return true;
2846 bool CmpInst::isSigned(unsigned short predicate) {
2847 switch (predicate) {
2848 default: return false;
2849 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
2850 case ICmpInst::ICMP_SGE: return true;
2854 bool CmpInst::isOrdered(unsigned short predicate) {
2855 switch (predicate) {
2856 default: return false;
2857 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
2858 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
2859 case FCmpInst::FCMP_ORD: return true;
2863 bool CmpInst::isUnordered(unsigned short predicate) {
2864 switch (predicate) {
2865 default: return false;
2866 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
2867 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
2868 case FCmpInst::FCMP_UNO: return true;
2872 bool CmpInst::isTrueWhenEqual(unsigned short predicate) {
2874 default: return false;
2875 case ICMP_EQ: case ICMP_UGE: case ICMP_ULE: case ICMP_SGE: case ICMP_SLE:
2876 case FCMP_TRUE: case FCMP_UEQ: case FCMP_UGE: case FCMP_ULE: return true;
2880 bool CmpInst::isFalseWhenEqual(unsigned short predicate) {
2882 case ICMP_NE: case ICMP_UGT: case ICMP_ULT: case ICMP_SGT: case ICMP_SLT:
2883 case FCMP_FALSE: case FCMP_ONE: case FCMP_OGT: case FCMP_OLT: return true;
2884 default: return false;
2889 //===----------------------------------------------------------------------===//
2890 // SwitchInst Implementation
2891 //===----------------------------------------------------------------------===//
2893 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumReserved) {
2894 assert(Value && Default && NumReserved);
2895 ReservedSpace = NumReserved;
2897 OperandList = allocHungoffUses(ReservedSpace);
2899 OperandList[0] = Value;
2900 OperandList[1] = Default;
2903 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2904 /// switch on and a default destination. The number of additional cases can
2905 /// be specified here to make memory allocation more efficient. This
2906 /// constructor can also autoinsert before another instruction.
2907 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2908 Instruction *InsertBefore)
2909 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
2910 0, 0, InsertBefore) {
2911 init(Value, Default, 2+NumCases*2);
2914 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2915 /// switch on and a default destination. The number of additional cases can
2916 /// be specified here to make memory allocation more efficient. This
2917 /// constructor also autoinserts at the end of the specified BasicBlock.
2918 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2919 BasicBlock *InsertAtEnd)
2920 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
2921 0, 0, InsertAtEnd) {
2922 init(Value, Default, 2+NumCases*2);
2925 SwitchInst::SwitchInst(const SwitchInst &SI)
2926 : TerminatorInst(SI.getType(), Instruction::Switch, 0, 0) {
2927 init(SI.getCondition(), SI.getDefaultDest(), SI.getNumOperands());
2928 NumOperands = SI.getNumOperands();
2929 Use *OL = OperandList, *InOL = SI.OperandList;
2930 for (unsigned i = 2, E = SI.getNumOperands(); i != E; i += 2) {
2932 OL[i+1] = InOL[i+1];
2934 SubclassOptionalData = SI.SubclassOptionalData;
2937 SwitchInst::~SwitchInst() {
2942 /// addCase - Add an entry to the switch instruction...
2944 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
2945 unsigned OpNo = NumOperands;
2946 if (OpNo+2 > ReservedSpace)
2947 growOperands(); // Get more space!
2948 // Initialize some new operands.
2949 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
2950 NumOperands = OpNo+2;
2951 OperandList[OpNo] = OnVal;
2952 OperandList[OpNo+1] = Dest;
2955 /// removeCase - This method removes the specified successor from the switch
2956 /// instruction. Note that this cannot be used to remove the default
2957 /// destination (successor #0).
2959 void SwitchInst::removeCase(unsigned idx) {
2960 assert(idx != 0 && "Cannot remove the default case!");
2961 assert(idx*2 < getNumOperands() && "Successor index out of range!!!");
2963 unsigned NumOps = getNumOperands();
2964 Use *OL = OperandList;
2966 // Overwrite this case with the end of the list.
2967 if ((idx + 1) * 2 != NumOps) {
2968 OL[idx * 2] = OL[NumOps - 2];
2969 OL[idx * 2 + 1] = OL[NumOps - 1];
2972 // Nuke the last value.
2973 OL[NumOps-2].set(0);
2974 OL[NumOps-2+1].set(0);
2975 NumOperands = NumOps-2;
2978 /// growOperands - grow operands - This grows the operand list in response
2979 /// to a push_back style of operation. This grows the number of ops by 3 times.
2981 void SwitchInst::growOperands() {
2982 unsigned e = getNumOperands();
2983 unsigned NumOps = e*3;
2985 ReservedSpace = NumOps;
2986 Use *NewOps = allocHungoffUses(NumOps);
2987 Use *OldOps = OperandList;
2988 for (unsigned i = 0; i != e; ++i) {
2989 NewOps[i] = OldOps[i];
2991 OperandList = NewOps;
2992 Use::zap(OldOps, OldOps + e, true);
2996 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
2997 return getSuccessor(idx);
2999 unsigned SwitchInst::getNumSuccessorsV() const {
3000 return getNumSuccessors();
3002 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3003 setSuccessor(idx, B);
3006 //===----------------------------------------------------------------------===//
3007 // IndirectBrInst Implementation
3008 //===----------------------------------------------------------------------===//
3010 void IndirectBrInst::init(Value *Address, unsigned NumDests) {
3011 assert(Address && Address->getType()->isPointerTy() &&
3012 "Address of indirectbr must be a pointer");
3013 ReservedSpace = 1+NumDests;
3015 OperandList = allocHungoffUses(ReservedSpace);
3017 OperandList[0] = Address;
3021 /// growOperands - grow operands - This grows the operand list in response
3022 /// to a push_back style of operation. This grows the number of ops by 2 times.
3024 void IndirectBrInst::growOperands() {
3025 unsigned e = getNumOperands();
3026 unsigned NumOps = e*2;
3028 ReservedSpace = NumOps;
3029 Use *NewOps = allocHungoffUses(NumOps);
3030 Use *OldOps = OperandList;
3031 for (unsigned i = 0; i != e; ++i)
3032 NewOps[i] = OldOps[i];
3033 OperandList = NewOps;
3034 Use::zap(OldOps, OldOps + e, true);
3037 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3038 Instruction *InsertBefore)
3039 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3040 0, 0, InsertBefore) {
3041 init(Address, NumCases);
3044 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3045 BasicBlock *InsertAtEnd)
3046 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3047 0, 0, InsertAtEnd) {
3048 init(Address, NumCases);
3051 IndirectBrInst::IndirectBrInst(const IndirectBrInst &IBI)
3052 : TerminatorInst(Type::getVoidTy(IBI.getContext()), Instruction::IndirectBr,
3053 allocHungoffUses(IBI.getNumOperands()),
3054 IBI.getNumOperands()) {
3055 Use *OL = OperandList, *InOL = IBI.OperandList;
3056 for (unsigned i = 0, E = IBI.getNumOperands(); i != E; ++i)
3058 SubclassOptionalData = IBI.SubclassOptionalData;
3061 IndirectBrInst::~IndirectBrInst() {
3065 /// addDestination - Add a destination.
3067 void IndirectBrInst::addDestination(BasicBlock *DestBB) {
3068 unsigned OpNo = NumOperands;
3069 if (OpNo+1 > ReservedSpace)
3070 growOperands(); // Get more space!
3071 // Initialize some new operands.
3072 assert(OpNo < ReservedSpace && "Growing didn't work!");
3073 NumOperands = OpNo+1;
3074 OperandList[OpNo] = DestBB;
3077 /// removeDestination - This method removes the specified successor from the
3078 /// indirectbr instruction.
3079 void IndirectBrInst::removeDestination(unsigned idx) {
3080 assert(idx < getNumOperands()-1 && "Successor index out of range!");
3082 unsigned NumOps = getNumOperands();
3083 Use *OL = OperandList;
3085 // Replace this value with the last one.
3086 OL[idx+1] = OL[NumOps-1];
3088 // Nuke the last value.
3089 OL[NumOps-1].set(0);
3090 NumOperands = NumOps-1;
3093 BasicBlock *IndirectBrInst::getSuccessorV(unsigned idx) const {
3094 return getSuccessor(idx);
3096 unsigned IndirectBrInst::getNumSuccessorsV() const {
3097 return getNumSuccessors();
3099 void IndirectBrInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3100 setSuccessor(idx, B);
3103 //===----------------------------------------------------------------------===//
3104 // clone_impl() implementations
3105 //===----------------------------------------------------------------------===//
3107 // Define these methods here so vtables don't get emitted into every translation
3108 // unit that uses these classes.
3110 GetElementPtrInst *GetElementPtrInst::clone_impl() const {
3111 return new (getNumOperands()) GetElementPtrInst(*this);
3114 BinaryOperator *BinaryOperator::clone_impl() const {
3115 return Create(getOpcode(), Op<0>(), Op<1>());
3118 FCmpInst* FCmpInst::clone_impl() const {
3119 return new FCmpInst(getPredicate(), Op<0>(), Op<1>());
3122 ICmpInst* ICmpInst::clone_impl() const {
3123 return new ICmpInst(getPredicate(), Op<0>(), Op<1>());
3126 ExtractValueInst *ExtractValueInst::clone_impl() const {
3127 return new ExtractValueInst(*this);
3130 InsertValueInst *InsertValueInst::clone_impl() const {
3131 return new InsertValueInst(*this);
3134 AllocaInst *AllocaInst::clone_impl() const {
3135 return new AllocaInst(getAllocatedType(),
3136 (Value*)getOperand(0),
3140 LoadInst *LoadInst::clone_impl() const {
3141 return new LoadInst(getOperand(0),
3142 Twine(), isVolatile(),
3146 StoreInst *StoreInst::clone_impl() const {
3147 return new StoreInst(getOperand(0), getOperand(1),
3148 isVolatile(), getAlignment());
3151 FenceInst *FenceInst::clone_impl() const {
3152 return new FenceInst(getContext(), getOrdering(), getSynchScope());
3155 TruncInst *TruncInst::clone_impl() const {
3156 return new TruncInst(getOperand(0), getType());
3159 ZExtInst *ZExtInst::clone_impl() const {
3160 return new ZExtInst(getOperand(0), getType());
3163 SExtInst *SExtInst::clone_impl() const {
3164 return new SExtInst(getOperand(0), getType());
3167 FPTruncInst *FPTruncInst::clone_impl() const {
3168 return new FPTruncInst(getOperand(0), getType());
3171 FPExtInst *FPExtInst::clone_impl() const {
3172 return new FPExtInst(getOperand(0), getType());
3175 UIToFPInst *UIToFPInst::clone_impl() const {
3176 return new UIToFPInst(getOperand(0), getType());
3179 SIToFPInst *SIToFPInst::clone_impl() const {
3180 return new SIToFPInst(getOperand(0), getType());
3183 FPToUIInst *FPToUIInst::clone_impl() const {
3184 return new FPToUIInst(getOperand(0), getType());
3187 FPToSIInst *FPToSIInst::clone_impl() const {
3188 return new FPToSIInst(getOperand(0), getType());
3191 PtrToIntInst *PtrToIntInst::clone_impl() const {
3192 return new PtrToIntInst(getOperand(0), getType());
3195 IntToPtrInst *IntToPtrInst::clone_impl() const {
3196 return new IntToPtrInst(getOperand(0), getType());
3199 BitCastInst *BitCastInst::clone_impl() const {
3200 return new BitCastInst(getOperand(0), getType());
3203 CallInst *CallInst::clone_impl() const {
3204 return new(getNumOperands()) CallInst(*this);
3207 SelectInst *SelectInst::clone_impl() const {
3208 return SelectInst::Create(getOperand(0), getOperand(1), getOperand(2));
3211 VAArgInst *VAArgInst::clone_impl() const {
3212 return new VAArgInst(getOperand(0), getType());
3215 ExtractElementInst *ExtractElementInst::clone_impl() const {
3216 return ExtractElementInst::Create(getOperand(0), getOperand(1));
3219 InsertElementInst *InsertElementInst::clone_impl() const {
3220 return InsertElementInst::Create(getOperand(0),
3225 ShuffleVectorInst *ShuffleVectorInst::clone_impl() const {
3226 return new ShuffleVectorInst(getOperand(0),
3231 PHINode *PHINode::clone_impl() const {
3232 return new PHINode(*this);
3235 LandingPadInst *LandingPadInst::clone_impl() const {
3236 return new LandingPadInst(*this);
3239 ReturnInst *ReturnInst::clone_impl() const {
3240 return new(getNumOperands()) ReturnInst(*this);
3243 BranchInst *BranchInst::clone_impl() const {
3244 return new(getNumOperands()) BranchInst(*this);
3247 SwitchInst *SwitchInst::clone_impl() const {
3248 return new SwitchInst(*this);
3251 IndirectBrInst *IndirectBrInst::clone_impl() const {
3252 return new IndirectBrInst(*this);
3256 InvokeInst *InvokeInst::clone_impl() const {
3257 return new(getNumOperands()) InvokeInst(*this);
3260 ResumeInst *ResumeInst::clone_impl() const {
3261 return new(1) ResumeInst(*this);
3264 UnwindInst *UnwindInst::clone_impl() const {
3265 LLVMContext &Context = getContext();
3266 return new UnwindInst(Context);
3269 UnreachableInst *UnreachableInst::clone_impl() const {
3270 LLVMContext &Context = getContext();
3271 return new UnreachableInst(Context);