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 LandingPadInst::LandingPadInst(Type *RetTy, Value *PersonalityFn,
174 unsigned NumReservedValues, const Twine &NameStr,
175 Instruction *InsertBefore)
176 : Instruction(RetTy, Instruction::LandingPad, 0, 0, InsertBefore) {
177 init(PersonalityFn, 1 + NumReservedValues, NameStr);
180 LandingPadInst::LandingPadInst(Type *RetTy, Value *PersonalityFn,
181 unsigned NumReservedValues, const Twine &NameStr,
182 BasicBlock *InsertAtEnd)
183 : Instruction(RetTy, Instruction::LandingPad, 0, 0, InsertAtEnd) {
184 init(PersonalityFn, 1 + NumReservedValues, NameStr);
187 LandingPadInst::LandingPadInst(const LandingPadInst &LP)
188 : Instruction(LP.getType(), Instruction::LandingPad,
189 allocHungoffUses(LP.getNumOperands()), LP.getNumOperands()),
190 ReservedSpace(LP.getNumOperands()) {
191 Use *OL = OperandList, *InOL = LP.OperandList;
192 for (unsigned I = 0, E = ReservedSpace; I != E; ++I)
195 setCleanup(LP.isCleanup());
198 LandingPadInst::~LandingPadInst() {
202 LandingPadInst *LandingPadInst::Create(Type *RetTy, Value *PersonalityFn,
203 unsigned NumReservedClauses,
204 const Twine &NameStr,
205 Instruction *InsertBefore) {
206 return new LandingPadInst(RetTy, PersonalityFn, NumReservedClauses, NameStr,
210 LandingPadInst *LandingPadInst::Create(Type *RetTy, Value *PersonalityFn,
211 unsigned NumReservedClauses,
212 const Twine &NameStr,
213 BasicBlock *InsertAtEnd) {
214 return new LandingPadInst(RetTy, PersonalityFn, NumReservedClauses, NameStr,
218 void LandingPadInst::init(Value *PersFn, unsigned NumReservedValues,
219 const Twine &NameStr) {
220 ReservedSpace = NumReservedValues;
222 OperandList = allocHungoffUses(ReservedSpace);
223 OperandList[0] = PersFn;
228 /// growOperands - grow operands - This grows the operand list in response to a
229 /// push_back style of operation. This grows the number of ops by 2 times.
230 void LandingPadInst::growOperands(unsigned Size) {
231 unsigned e = getNumOperands();
232 if (ReservedSpace >= e + Size) return;
233 ReservedSpace = (e + Size / 2) * 2;
235 Use *NewOps = allocHungoffUses(ReservedSpace);
236 Use *OldOps = OperandList;
237 for (unsigned i = 0; i != e; ++i)
238 NewOps[i] = OldOps[i];
240 OperandList = NewOps;
241 Use::zap(OldOps, OldOps + e, true);
244 void LandingPadInst::addClause(Value *Val) {
245 unsigned OpNo = getNumOperands();
247 assert(OpNo < ReservedSpace && "Growing didn't work!");
249 OperandList[OpNo] = Val;
252 //===----------------------------------------------------------------------===//
253 // CallInst Implementation
254 //===----------------------------------------------------------------------===//
256 CallInst::~CallInst() {
259 void CallInst::init(Value *Func, ArrayRef<Value *> Args, const Twine &NameStr) {
260 assert(NumOperands == Args.size() + 1 && "NumOperands not set up?");
265 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
267 assert((Args.size() == FTy->getNumParams() ||
268 (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&
269 "Calling a function with bad signature!");
271 for (unsigned i = 0; i != Args.size(); ++i)
272 assert((i >= FTy->getNumParams() ||
273 FTy->getParamType(i) == Args[i]->getType()) &&
274 "Calling a function with a bad signature!");
277 std::copy(Args.begin(), Args.end(), op_begin());
281 void CallInst::init(Value *Func, const Twine &NameStr) {
282 assert(NumOperands == 1 && "NumOperands not set up?");
287 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
289 assert(FTy->getNumParams() == 0 && "Calling a function with bad signature");
295 CallInst::CallInst(Value *Func, const Twine &Name,
296 Instruction *InsertBefore)
297 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
298 ->getElementType())->getReturnType(),
300 OperandTraits<CallInst>::op_end(this) - 1,
305 CallInst::CallInst(Value *Func, const Twine &Name,
306 BasicBlock *InsertAtEnd)
307 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
308 ->getElementType())->getReturnType(),
310 OperandTraits<CallInst>::op_end(this) - 1,
315 CallInst::CallInst(const CallInst &CI)
316 : Instruction(CI.getType(), Instruction::Call,
317 OperandTraits<CallInst>::op_end(this) - CI.getNumOperands(),
318 CI.getNumOperands()) {
319 setAttributes(CI.getAttributes());
320 setTailCall(CI.isTailCall());
321 setCallingConv(CI.getCallingConv());
323 std::copy(CI.op_begin(), CI.op_end(), op_begin());
324 SubclassOptionalData = CI.SubclassOptionalData;
327 void CallInst::addAttribute(unsigned i, Attributes attr) {
328 AttrListPtr PAL = getAttributes();
329 PAL = PAL.addAttr(i, attr);
333 void CallInst::removeAttribute(unsigned i, Attributes attr) {
334 AttrListPtr PAL = getAttributes();
335 PAL = PAL.removeAttr(i, attr);
339 bool CallInst::paramHasAttr(unsigned i, Attributes attr) const {
340 if (AttributeList.paramHasAttr(i, attr))
342 if (const Function *F = getCalledFunction())
343 return F->paramHasAttr(i, attr);
347 /// IsConstantOne - Return true only if val is constant int 1
348 static bool IsConstantOne(Value *val) {
349 assert(val && "IsConstantOne does not work with NULL val");
350 return isa<ConstantInt>(val) && cast<ConstantInt>(val)->isOne();
353 static Instruction *createMalloc(Instruction *InsertBefore,
354 BasicBlock *InsertAtEnd, Type *IntPtrTy,
355 Type *AllocTy, Value *AllocSize,
356 Value *ArraySize, Function *MallocF,
358 assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&
359 "createMalloc needs either InsertBefore or InsertAtEnd");
361 // malloc(type) becomes:
362 // bitcast (i8* malloc(typeSize)) to type*
363 // malloc(type, arraySize) becomes:
364 // bitcast (i8 *malloc(typeSize*arraySize)) to type*
366 ArraySize = ConstantInt::get(IntPtrTy, 1);
367 else if (ArraySize->getType() != IntPtrTy) {
369 ArraySize = CastInst::CreateIntegerCast(ArraySize, IntPtrTy, false,
372 ArraySize = CastInst::CreateIntegerCast(ArraySize, IntPtrTy, false,
376 if (!IsConstantOne(ArraySize)) {
377 if (IsConstantOne(AllocSize)) {
378 AllocSize = ArraySize; // Operand * 1 = Operand
379 } else if (Constant *CO = dyn_cast<Constant>(ArraySize)) {
380 Constant *Scale = ConstantExpr::getIntegerCast(CO, IntPtrTy,
382 // Malloc arg is constant product of type size and array size
383 AllocSize = ConstantExpr::getMul(Scale, cast<Constant>(AllocSize));
385 // Multiply type size by the array size...
387 AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
388 "mallocsize", InsertBefore);
390 AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
391 "mallocsize", InsertAtEnd);
395 assert(AllocSize->getType() == IntPtrTy && "malloc arg is wrong size");
396 // Create the call to Malloc.
397 BasicBlock* BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
398 Module* M = BB->getParent()->getParent();
399 Type *BPTy = Type::getInt8PtrTy(BB->getContext());
400 Value *MallocFunc = MallocF;
402 // prototype malloc as "void *malloc(size_t)"
403 MallocFunc = M->getOrInsertFunction("malloc", BPTy, IntPtrTy, NULL);
404 PointerType *AllocPtrType = PointerType::getUnqual(AllocTy);
405 CallInst *MCall = NULL;
406 Instruction *Result = NULL;
408 MCall = CallInst::Create(MallocFunc, AllocSize, "malloccall", InsertBefore);
410 if (Result->getType() != AllocPtrType)
411 // Create a cast instruction to convert to the right type...
412 Result = new BitCastInst(MCall, AllocPtrType, Name, InsertBefore);
414 MCall = CallInst::Create(MallocFunc, AllocSize, "malloccall");
416 if (Result->getType() != AllocPtrType) {
417 InsertAtEnd->getInstList().push_back(MCall);
418 // Create a cast instruction to convert to the right type...
419 Result = new BitCastInst(MCall, AllocPtrType, Name);
422 MCall->setTailCall();
423 if (Function *F = dyn_cast<Function>(MallocFunc)) {
424 MCall->setCallingConv(F->getCallingConv());
425 if (!F->doesNotAlias(0)) F->setDoesNotAlias(0);
427 assert(!MCall->getType()->isVoidTy() && "Malloc has void return type");
432 /// CreateMalloc - Generate the IR for a call to malloc:
433 /// 1. Compute the malloc call's argument as the specified type's size,
434 /// possibly multiplied by the array size if the array size is not
436 /// 2. Call malloc with that argument.
437 /// 3. Bitcast the result of the malloc call to the specified type.
438 Instruction *CallInst::CreateMalloc(Instruction *InsertBefore,
439 Type *IntPtrTy, Type *AllocTy,
440 Value *AllocSize, Value *ArraySize,
443 return createMalloc(InsertBefore, NULL, IntPtrTy, AllocTy, AllocSize,
444 ArraySize, MallocF, Name);
447 /// CreateMalloc - Generate the IR for a call to malloc:
448 /// 1. Compute the malloc call's argument as the specified type's size,
449 /// possibly multiplied by the array size if the array size is not
451 /// 2. Call malloc with that argument.
452 /// 3. Bitcast the result of the malloc call to the specified type.
453 /// Note: This function does not add the bitcast to the basic block, that is the
454 /// responsibility of the caller.
455 Instruction *CallInst::CreateMalloc(BasicBlock *InsertAtEnd,
456 Type *IntPtrTy, Type *AllocTy,
457 Value *AllocSize, Value *ArraySize,
458 Function *MallocF, const Twine &Name) {
459 return createMalloc(NULL, InsertAtEnd, IntPtrTy, AllocTy, AllocSize,
460 ArraySize, MallocF, Name);
463 static Instruction* createFree(Value* Source, Instruction *InsertBefore,
464 BasicBlock *InsertAtEnd) {
465 assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&
466 "createFree needs either InsertBefore or InsertAtEnd");
467 assert(Source->getType()->isPointerTy() &&
468 "Can not free something of nonpointer type!");
470 BasicBlock* BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
471 Module* M = BB->getParent()->getParent();
473 Type *VoidTy = Type::getVoidTy(M->getContext());
474 Type *IntPtrTy = Type::getInt8PtrTy(M->getContext());
475 // prototype free as "void free(void*)"
476 Value *FreeFunc = M->getOrInsertFunction("free", VoidTy, IntPtrTy, NULL);
477 CallInst* Result = NULL;
478 Value *PtrCast = Source;
480 if (Source->getType() != IntPtrTy)
481 PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertBefore);
482 Result = CallInst::Create(FreeFunc, PtrCast, "", InsertBefore);
484 if (Source->getType() != IntPtrTy)
485 PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertAtEnd);
486 Result = CallInst::Create(FreeFunc, PtrCast, "");
488 Result->setTailCall();
489 if (Function *F = dyn_cast<Function>(FreeFunc))
490 Result->setCallingConv(F->getCallingConv());
495 /// CreateFree - Generate the IR for a call to the builtin free function.
496 Instruction * CallInst::CreateFree(Value* Source, Instruction *InsertBefore) {
497 return createFree(Source, InsertBefore, NULL);
500 /// CreateFree - Generate the IR for a call to the builtin free function.
501 /// Note: This function does not add the call to the basic block, that is the
502 /// responsibility of the caller.
503 Instruction* CallInst::CreateFree(Value* Source, BasicBlock *InsertAtEnd) {
504 Instruction* FreeCall = createFree(Source, NULL, InsertAtEnd);
505 assert(FreeCall && "CreateFree did not create a CallInst");
509 //===----------------------------------------------------------------------===//
510 // InvokeInst Implementation
511 //===----------------------------------------------------------------------===//
513 void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
514 ArrayRef<Value *> Args, const Twine &NameStr) {
515 assert(NumOperands == 3 + Args.size() && "NumOperands not set up?");
518 Op<-1>() = IfException;
522 cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
524 assert(((Args.size() == FTy->getNumParams()) ||
525 (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&
526 "Invoking a function with bad signature");
528 for (unsigned i = 0, e = Args.size(); i != e; i++)
529 assert((i >= FTy->getNumParams() ||
530 FTy->getParamType(i) == Args[i]->getType()) &&
531 "Invoking a function with a bad signature!");
534 std::copy(Args.begin(), Args.end(), op_begin());
538 InvokeInst::InvokeInst(const InvokeInst &II)
539 : TerminatorInst(II.getType(), Instruction::Invoke,
540 OperandTraits<InvokeInst>::op_end(this)
541 - II.getNumOperands(),
542 II.getNumOperands()) {
543 setAttributes(II.getAttributes());
544 setCallingConv(II.getCallingConv());
545 std::copy(II.op_begin(), II.op_end(), op_begin());
546 SubclassOptionalData = II.SubclassOptionalData;
549 BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
550 return getSuccessor(idx);
552 unsigned InvokeInst::getNumSuccessorsV() const {
553 return getNumSuccessors();
555 void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
556 return setSuccessor(idx, B);
559 bool InvokeInst::paramHasAttr(unsigned i, Attributes attr) const {
560 if (AttributeList.paramHasAttr(i, attr))
562 if (const Function *F = getCalledFunction())
563 return F->paramHasAttr(i, attr);
567 void InvokeInst::addAttribute(unsigned i, Attributes attr) {
568 AttrListPtr PAL = getAttributes();
569 PAL = PAL.addAttr(i, attr);
573 void InvokeInst::removeAttribute(unsigned i, Attributes attr) {
574 AttrListPtr PAL = getAttributes();
575 PAL = PAL.removeAttr(i, attr);
579 LandingPadInst *InvokeInst::getLandingPadInst() const {
580 return cast<LandingPadInst>(getUnwindDest()->getFirstNonPHI());
583 //===----------------------------------------------------------------------===//
584 // ReturnInst Implementation
585 //===----------------------------------------------------------------------===//
587 ReturnInst::ReturnInst(const ReturnInst &RI)
588 : TerminatorInst(Type::getVoidTy(RI.getContext()), Instruction::Ret,
589 OperandTraits<ReturnInst>::op_end(this) -
591 RI.getNumOperands()) {
592 if (RI.getNumOperands())
593 Op<0>() = RI.Op<0>();
594 SubclassOptionalData = RI.SubclassOptionalData;
597 ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, Instruction *InsertBefore)
598 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret,
599 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
604 ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, BasicBlock *InsertAtEnd)
605 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret,
606 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
611 ReturnInst::ReturnInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
612 : TerminatorInst(Type::getVoidTy(Context), Instruction::Ret,
613 OperandTraits<ReturnInst>::op_end(this), 0, InsertAtEnd) {
616 unsigned ReturnInst::getNumSuccessorsV() const {
617 return getNumSuccessors();
620 /// Out-of-line ReturnInst method, put here so the C++ compiler can choose to
621 /// emit the vtable for the class in this translation unit.
622 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
623 llvm_unreachable("ReturnInst has no successors!");
626 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
627 llvm_unreachable("ReturnInst has no successors!");
630 ReturnInst::~ReturnInst() {
633 //===----------------------------------------------------------------------===//
634 // ResumeInst Implementation
635 //===----------------------------------------------------------------------===//
637 ResumeInst::ResumeInst(const ResumeInst &RI)
638 : TerminatorInst(Type::getVoidTy(RI.getContext()), Instruction::Resume,
639 OperandTraits<ResumeInst>::op_begin(this), 1) {
640 Op<0>() = RI.Op<0>();
643 ResumeInst::ResumeInst(Value *Exn, Instruction *InsertBefore)
644 : TerminatorInst(Type::getVoidTy(Exn->getContext()), Instruction::Resume,
645 OperandTraits<ResumeInst>::op_begin(this), 1, InsertBefore) {
649 ResumeInst::ResumeInst(Value *Exn, BasicBlock *InsertAtEnd)
650 : TerminatorInst(Type::getVoidTy(Exn->getContext()), Instruction::Resume,
651 OperandTraits<ResumeInst>::op_begin(this), 1, InsertAtEnd) {
655 unsigned ResumeInst::getNumSuccessorsV() const {
656 return getNumSuccessors();
659 void ResumeInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
660 llvm_unreachable("ResumeInst has no successors!");
663 BasicBlock *ResumeInst::getSuccessorV(unsigned idx) const {
664 llvm_unreachable("ResumeInst has no successors!");
667 //===----------------------------------------------------------------------===//
668 // UnreachableInst Implementation
669 //===----------------------------------------------------------------------===//
671 UnreachableInst::UnreachableInst(LLVMContext &Context,
672 Instruction *InsertBefore)
673 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unreachable,
674 0, 0, InsertBefore) {
676 UnreachableInst::UnreachableInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
677 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unreachable,
681 unsigned UnreachableInst::getNumSuccessorsV() const {
682 return getNumSuccessors();
685 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
686 llvm_unreachable("UnreachableInst has no successors!");
689 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
690 llvm_unreachable("UnreachableInst has no successors!");
693 //===----------------------------------------------------------------------===//
694 // BranchInst Implementation
695 //===----------------------------------------------------------------------===//
697 void BranchInst::AssertOK() {
699 assert(getCondition()->getType()->isIntegerTy(1) &&
700 "May only branch on boolean predicates!");
703 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
704 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
705 OperandTraits<BranchInst>::op_end(this) - 1,
707 assert(IfTrue != 0 && "Branch destination may not be null!");
710 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
711 Instruction *InsertBefore)
712 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
713 OperandTraits<BranchInst>::op_end(this) - 3,
723 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
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!");
731 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
732 BasicBlock *InsertAtEnd)
733 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
734 OperandTraits<BranchInst>::op_end(this) - 3,
745 BranchInst::BranchInst(const BranchInst &BI) :
746 TerminatorInst(Type::getVoidTy(BI.getContext()), Instruction::Br,
747 OperandTraits<BranchInst>::op_end(this) - BI.getNumOperands(),
748 BI.getNumOperands()) {
749 Op<-1>() = BI.Op<-1>();
750 if (BI.getNumOperands() != 1) {
751 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
752 Op<-3>() = BI.Op<-3>();
753 Op<-2>() = BI.Op<-2>();
755 SubclassOptionalData = BI.SubclassOptionalData;
758 void BranchInst::swapSuccessors() {
759 assert(isConditional() &&
760 "Cannot swap successors of an unconditional branch");
761 Op<-1>().swap(Op<-2>());
763 // Update profile metadata if present and it matches our structural
765 MDNode *ProfileData = getMetadata(LLVMContext::MD_prof);
766 if (!ProfileData || ProfileData->getNumOperands() != 3)
769 // The first operand is the name. Fetch them backwards and build a new one.
771 ProfileData->getOperand(0),
772 ProfileData->getOperand(2),
773 ProfileData->getOperand(1)
775 setMetadata(LLVMContext::MD_prof,
776 MDNode::get(ProfileData->getContext(), Ops));
779 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
780 return getSuccessor(idx);
782 unsigned BranchInst::getNumSuccessorsV() const {
783 return getNumSuccessors();
785 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
786 setSuccessor(idx, B);
790 //===----------------------------------------------------------------------===//
791 // AllocaInst Implementation
792 //===----------------------------------------------------------------------===//
794 static Value *getAISize(LLVMContext &Context, Value *Amt) {
796 Amt = ConstantInt::get(Type::getInt32Ty(Context), 1);
798 assert(!isa<BasicBlock>(Amt) &&
799 "Passed basic block into allocation size parameter! Use other ctor");
800 assert(Amt->getType()->isIntegerTy() &&
801 "Allocation array size is not an integer!");
806 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize,
807 const Twine &Name, Instruction *InsertBefore)
808 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
809 getAISize(Ty->getContext(), ArraySize), InsertBefore) {
811 assert(!Ty->isVoidTy() && "Cannot allocate void!");
815 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize,
816 const Twine &Name, BasicBlock *InsertAtEnd)
817 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
818 getAISize(Ty->getContext(), ArraySize), InsertAtEnd) {
820 assert(!Ty->isVoidTy() && "Cannot allocate void!");
824 AllocaInst::AllocaInst(Type *Ty, const Twine &Name,
825 Instruction *InsertBefore)
826 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
827 getAISize(Ty->getContext(), 0), InsertBefore) {
829 assert(!Ty->isVoidTy() && "Cannot allocate void!");
833 AllocaInst::AllocaInst(Type *Ty, const Twine &Name,
834 BasicBlock *InsertAtEnd)
835 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
836 getAISize(Ty->getContext(), 0), InsertAtEnd) {
838 assert(!Ty->isVoidTy() && "Cannot allocate void!");
842 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize, unsigned Align,
843 const Twine &Name, Instruction *InsertBefore)
844 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
845 getAISize(Ty->getContext(), ArraySize), InsertBefore) {
847 assert(!Ty->isVoidTy() && "Cannot allocate void!");
851 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize, unsigned Align,
852 const Twine &Name, BasicBlock *InsertAtEnd)
853 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
854 getAISize(Ty->getContext(), ArraySize), InsertAtEnd) {
856 assert(!Ty->isVoidTy() && "Cannot allocate void!");
860 // Out of line virtual method, so the vtable, etc has a home.
861 AllocaInst::~AllocaInst() {
864 void AllocaInst::setAlignment(unsigned Align) {
865 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
866 assert(Align <= MaximumAlignment &&
867 "Alignment is greater than MaximumAlignment!");
868 setInstructionSubclassData(Log2_32(Align) + 1);
869 assert(getAlignment() == Align && "Alignment representation error!");
872 bool AllocaInst::isArrayAllocation() const {
873 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
878 Type *AllocaInst::getAllocatedType() const {
879 return getType()->getElementType();
882 /// isStaticAlloca - Return true if this alloca is in the entry block of the
883 /// function and is a constant size. If so, the code generator will fold it
884 /// into the prolog/epilog code, so it is basically free.
885 bool AllocaInst::isStaticAlloca() const {
886 // Must be constant size.
887 if (!isa<ConstantInt>(getArraySize())) return false;
889 // Must be in the entry block.
890 const BasicBlock *Parent = getParent();
891 return Parent == &Parent->getParent()->front();
894 //===----------------------------------------------------------------------===//
895 // LoadInst Implementation
896 //===----------------------------------------------------------------------===//
898 void LoadInst::AssertOK() {
899 assert(getOperand(0)->getType()->isPointerTy() &&
900 "Ptr must have pointer type.");
901 assert(!(isAtomic() && getAlignment() == 0) &&
902 "Alignment required for atomic load");
905 LoadInst::LoadInst(Value *Ptr, const Twine &Name, Instruction *InsertBef)
906 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
907 Load, Ptr, InsertBef) {
910 setAtomic(NotAtomic);
915 LoadInst::LoadInst(Value *Ptr, const Twine &Name, BasicBlock *InsertAE)
916 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
917 Load, Ptr, InsertAE) {
920 setAtomic(NotAtomic);
925 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
926 Instruction *InsertBef)
927 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
928 Load, Ptr, InsertBef) {
929 setVolatile(isVolatile);
931 setAtomic(NotAtomic);
936 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
937 BasicBlock *InsertAE)
938 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
939 Load, Ptr, InsertAE) {
940 setVolatile(isVolatile);
942 setAtomic(NotAtomic);
947 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
948 unsigned Align, Instruction *InsertBef)
949 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
950 Load, Ptr, InsertBef) {
951 setVolatile(isVolatile);
953 setAtomic(NotAtomic);
958 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
959 unsigned Align, BasicBlock *InsertAE)
960 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
961 Load, Ptr, InsertAE) {
962 setVolatile(isVolatile);
964 setAtomic(NotAtomic);
969 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
970 unsigned Align, AtomicOrdering Order,
971 SynchronizationScope SynchScope,
972 Instruction *InsertBef)
973 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
974 Load, Ptr, InsertBef) {
975 setVolatile(isVolatile);
977 setAtomic(Order, SynchScope);
982 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
983 unsigned Align, AtomicOrdering Order,
984 SynchronizationScope SynchScope,
985 BasicBlock *InsertAE)
986 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
987 Load, Ptr, InsertAE) {
988 setVolatile(isVolatile);
990 setAtomic(Order, SynchScope);
995 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
996 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
997 Load, Ptr, InsertBef) {
1000 setAtomic(NotAtomic);
1002 if (Name && Name[0]) setName(Name);
1005 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
1006 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1007 Load, Ptr, InsertAE) {
1010 setAtomic(NotAtomic);
1012 if (Name && Name[0]) setName(Name);
1015 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
1016 Instruction *InsertBef)
1017 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1018 Load, Ptr, InsertBef) {
1019 setVolatile(isVolatile);
1021 setAtomic(NotAtomic);
1023 if (Name && Name[0]) setName(Name);
1026 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
1027 BasicBlock *InsertAE)
1028 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1029 Load, Ptr, InsertAE) {
1030 setVolatile(isVolatile);
1032 setAtomic(NotAtomic);
1034 if (Name && Name[0]) setName(Name);
1037 void LoadInst::setAlignment(unsigned Align) {
1038 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1039 assert(Align <= MaximumAlignment &&
1040 "Alignment is greater than MaximumAlignment!");
1041 setInstructionSubclassData((getSubclassDataFromInstruction() & ~(31 << 1)) |
1042 ((Log2_32(Align)+1)<<1));
1043 assert(getAlignment() == Align && "Alignment representation error!");
1046 //===----------------------------------------------------------------------===//
1047 // StoreInst Implementation
1048 //===----------------------------------------------------------------------===//
1050 void StoreInst::AssertOK() {
1051 assert(getOperand(0) && getOperand(1) && "Both operands must be non-null!");
1052 assert(getOperand(1)->getType()->isPointerTy() &&
1053 "Ptr must have pointer type!");
1054 assert(getOperand(0)->getType() ==
1055 cast<PointerType>(getOperand(1)->getType())->getElementType()
1056 && "Ptr must be a pointer to Val type!");
1057 assert(!(isAtomic() && getAlignment() == 0) &&
1058 "Alignment required for atomic load");
1062 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
1063 : Instruction(Type::getVoidTy(val->getContext()), Store,
1064 OperandTraits<StoreInst>::op_begin(this),
1065 OperandTraits<StoreInst>::operands(this),
1071 setAtomic(NotAtomic);
1075 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
1076 : Instruction(Type::getVoidTy(val->getContext()), Store,
1077 OperandTraits<StoreInst>::op_begin(this),
1078 OperandTraits<StoreInst>::operands(this),
1084 setAtomic(NotAtomic);
1088 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1089 Instruction *InsertBefore)
1090 : Instruction(Type::getVoidTy(val->getContext()), Store,
1091 OperandTraits<StoreInst>::op_begin(this),
1092 OperandTraits<StoreInst>::operands(this),
1096 setVolatile(isVolatile);
1098 setAtomic(NotAtomic);
1102 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1103 unsigned Align, Instruction *InsertBefore)
1104 : Instruction(Type::getVoidTy(val->getContext()), Store,
1105 OperandTraits<StoreInst>::op_begin(this),
1106 OperandTraits<StoreInst>::operands(this),
1110 setVolatile(isVolatile);
1111 setAlignment(Align);
1112 setAtomic(NotAtomic);
1116 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1117 unsigned Align, AtomicOrdering Order,
1118 SynchronizationScope SynchScope,
1119 Instruction *InsertBefore)
1120 : Instruction(Type::getVoidTy(val->getContext()), Store,
1121 OperandTraits<StoreInst>::op_begin(this),
1122 OperandTraits<StoreInst>::operands(this),
1126 setVolatile(isVolatile);
1127 setAlignment(Align);
1128 setAtomic(Order, SynchScope);
1132 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1133 BasicBlock *InsertAtEnd)
1134 : Instruction(Type::getVoidTy(val->getContext()), Store,
1135 OperandTraits<StoreInst>::op_begin(this),
1136 OperandTraits<StoreInst>::operands(this),
1140 setVolatile(isVolatile);
1142 setAtomic(NotAtomic);
1146 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1147 unsigned Align, BasicBlock *InsertAtEnd)
1148 : Instruction(Type::getVoidTy(val->getContext()), Store,
1149 OperandTraits<StoreInst>::op_begin(this),
1150 OperandTraits<StoreInst>::operands(this),
1154 setVolatile(isVolatile);
1155 setAlignment(Align);
1156 setAtomic(NotAtomic);
1160 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1161 unsigned Align, AtomicOrdering Order,
1162 SynchronizationScope SynchScope,
1163 BasicBlock *InsertAtEnd)
1164 : Instruction(Type::getVoidTy(val->getContext()), Store,
1165 OperandTraits<StoreInst>::op_begin(this),
1166 OperandTraits<StoreInst>::operands(this),
1170 setVolatile(isVolatile);
1171 setAlignment(Align);
1172 setAtomic(Order, SynchScope);
1176 void StoreInst::setAlignment(unsigned Align) {
1177 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1178 assert(Align <= MaximumAlignment &&
1179 "Alignment is greater than MaximumAlignment!");
1180 setInstructionSubclassData((getSubclassDataFromInstruction() & ~(31 << 1)) |
1181 ((Log2_32(Align)+1) << 1));
1182 assert(getAlignment() == Align && "Alignment representation error!");
1185 //===----------------------------------------------------------------------===//
1186 // AtomicCmpXchgInst Implementation
1187 //===----------------------------------------------------------------------===//
1189 void AtomicCmpXchgInst::Init(Value *Ptr, Value *Cmp, Value *NewVal,
1190 AtomicOrdering Ordering,
1191 SynchronizationScope SynchScope) {
1195 setOrdering(Ordering);
1196 setSynchScope(SynchScope);
1198 assert(getOperand(0) && getOperand(1) && getOperand(2) &&
1199 "All operands must be non-null!");
1200 assert(getOperand(0)->getType()->isPointerTy() &&
1201 "Ptr must have pointer type!");
1202 assert(getOperand(1)->getType() ==
1203 cast<PointerType>(getOperand(0)->getType())->getElementType()
1204 && "Ptr must be a pointer to Cmp type!");
1205 assert(getOperand(2)->getType() ==
1206 cast<PointerType>(getOperand(0)->getType())->getElementType()
1207 && "Ptr must be a pointer to NewVal type!");
1208 assert(Ordering != NotAtomic &&
1209 "AtomicCmpXchg instructions must be atomic!");
1212 AtomicCmpXchgInst::AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
1213 AtomicOrdering Ordering,
1214 SynchronizationScope SynchScope,
1215 Instruction *InsertBefore)
1216 : Instruction(Cmp->getType(), AtomicCmpXchg,
1217 OperandTraits<AtomicCmpXchgInst>::op_begin(this),
1218 OperandTraits<AtomicCmpXchgInst>::operands(this),
1220 Init(Ptr, Cmp, NewVal, Ordering, SynchScope);
1223 AtomicCmpXchgInst::AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
1224 AtomicOrdering Ordering,
1225 SynchronizationScope SynchScope,
1226 BasicBlock *InsertAtEnd)
1227 : Instruction(Cmp->getType(), AtomicCmpXchg,
1228 OperandTraits<AtomicCmpXchgInst>::op_begin(this),
1229 OperandTraits<AtomicCmpXchgInst>::operands(this),
1231 Init(Ptr, Cmp, NewVal, Ordering, SynchScope);
1234 //===----------------------------------------------------------------------===//
1235 // AtomicRMWInst Implementation
1236 //===----------------------------------------------------------------------===//
1238 void AtomicRMWInst::Init(BinOp Operation, Value *Ptr, Value *Val,
1239 AtomicOrdering Ordering,
1240 SynchronizationScope SynchScope) {
1243 setOperation(Operation);
1244 setOrdering(Ordering);
1245 setSynchScope(SynchScope);
1247 assert(getOperand(0) && getOperand(1) &&
1248 "All operands must be non-null!");
1249 assert(getOperand(0)->getType()->isPointerTy() &&
1250 "Ptr must have pointer type!");
1251 assert(getOperand(1)->getType() ==
1252 cast<PointerType>(getOperand(0)->getType())->getElementType()
1253 && "Ptr must be a pointer to Val type!");
1254 assert(Ordering != NotAtomic &&
1255 "AtomicRMW instructions must be atomic!");
1258 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
1259 AtomicOrdering Ordering,
1260 SynchronizationScope SynchScope,
1261 Instruction *InsertBefore)
1262 : Instruction(Val->getType(), AtomicRMW,
1263 OperandTraits<AtomicRMWInst>::op_begin(this),
1264 OperandTraits<AtomicRMWInst>::operands(this),
1266 Init(Operation, Ptr, Val, Ordering, SynchScope);
1269 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
1270 AtomicOrdering Ordering,
1271 SynchronizationScope SynchScope,
1272 BasicBlock *InsertAtEnd)
1273 : Instruction(Val->getType(), AtomicRMW,
1274 OperandTraits<AtomicRMWInst>::op_begin(this),
1275 OperandTraits<AtomicRMWInst>::operands(this),
1277 Init(Operation, Ptr, Val, Ordering, SynchScope);
1280 //===----------------------------------------------------------------------===//
1281 // FenceInst Implementation
1282 //===----------------------------------------------------------------------===//
1284 FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
1285 SynchronizationScope SynchScope,
1286 Instruction *InsertBefore)
1287 : Instruction(Type::getVoidTy(C), Fence, 0, 0, InsertBefore) {
1288 setOrdering(Ordering);
1289 setSynchScope(SynchScope);
1292 FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
1293 SynchronizationScope SynchScope,
1294 BasicBlock *InsertAtEnd)
1295 : Instruction(Type::getVoidTy(C), Fence, 0, 0, InsertAtEnd) {
1296 setOrdering(Ordering);
1297 setSynchScope(SynchScope);
1300 //===----------------------------------------------------------------------===//
1301 // GetElementPtrInst Implementation
1302 //===----------------------------------------------------------------------===//
1304 void GetElementPtrInst::init(Value *Ptr, ArrayRef<Value *> IdxList,
1305 const Twine &Name) {
1306 assert(NumOperands == 1 + IdxList.size() && "NumOperands not initialized?");
1307 OperandList[0] = Ptr;
1308 std::copy(IdxList.begin(), IdxList.end(), op_begin() + 1);
1312 GetElementPtrInst::GetElementPtrInst(const GetElementPtrInst &GEPI)
1313 : Instruction(GEPI.getType(), GetElementPtr,
1314 OperandTraits<GetElementPtrInst>::op_end(this)
1315 - GEPI.getNumOperands(),
1316 GEPI.getNumOperands()) {
1317 std::copy(GEPI.op_begin(), GEPI.op_end(), op_begin());
1318 SubclassOptionalData = GEPI.SubclassOptionalData;
1321 /// getIndexedType - Returns the type of the element that would be accessed with
1322 /// a gep instruction with the specified parameters.
1324 /// The Idxs pointer should point to a continuous piece of memory containing the
1325 /// indices, either as Value* or uint64_t.
1327 /// A null type is returned if the indices are invalid for the specified
1330 template <typename IndexTy>
1331 static Type *getIndexedTypeInternal(Type *Ptr, ArrayRef<IndexTy> IdxList) {
1332 if (Ptr->isVectorTy()) {
1333 assert(IdxList.size() == 1 &&
1334 "GEP with vector pointers must have a single index");
1335 PointerType *PTy = dyn_cast<PointerType>(
1336 cast<VectorType>(Ptr)->getElementType());
1337 assert(PTy && "Gep with invalid vector pointer found");
1338 return PTy->getElementType();
1341 PointerType *PTy = dyn_cast<PointerType>(Ptr);
1342 if (!PTy) return 0; // Type isn't a pointer type!
1343 Type *Agg = PTy->getElementType();
1345 // Handle the special case of the empty set index set, which is always valid.
1346 if (IdxList.empty())
1349 // If there is at least one index, the top level type must be sized, otherwise
1350 // it cannot be 'stepped over'.
1351 if (!Agg->isSized())
1354 unsigned CurIdx = 1;
1355 for (; CurIdx != IdxList.size(); ++CurIdx) {
1356 CompositeType *CT = dyn_cast<CompositeType>(Agg);
1357 if (!CT || CT->isPointerTy()) return 0;
1358 IndexTy Index = IdxList[CurIdx];
1359 if (!CT->indexValid(Index)) return 0;
1360 Agg = CT->getTypeAtIndex(Index);
1362 return CurIdx == IdxList.size() ? Agg : 0;
1365 Type *GetElementPtrInst::getIndexedType(Type *Ptr, ArrayRef<Value *> IdxList) {
1366 return getIndexedTypeInternal(Ptr, IdxList);
1369 Type *GetElementPtrInst::getIndexedType(Type *Ptr,
1370 ArrayRef<Constant *> IdxList) {
1371 return getIndexedTypeInternal(Ptr, IdxList);
1374 Type *GetElementPtrInst::getIndexedType(Type *Ptr, ArrayRef<uint64_t> IdxList) {
1375 return getIndexedTypeInternal(Ptr, IdxList);
1378 unsigned GetElementPtrInst::getAddressSpace(Value *Ptr) {
1379 Type *Ty = Ptr->getType();
1381 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
1382 Ty = VTy->getElementType();
1384 if (PointerType *PTy = dyn_cast<PointerType>(Ty))
1385 return PTy->getAddressSpace();
1387 llvm_unreachable("Invalid GEP pointer type");
1390 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
1391 /// zeros. If so, the result pointer and the first operand have the same
1392 /// value, just potentially different types.
1393 bool GetElementPtrInst::hasAllZeroIndices() const {
1394 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1395 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
1396 if (!CI->isZero()) return false;
1404 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
1405 /// constant integers. If so, the result pointer and the first operand have
1406 /// a constant offset between them.
1407 bool GetElementPtrInst::hasAllConstantIndices() const {
1408 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1409 if (!isa<ConstantInt>(getOperand(i)))
1415 void GetElementPtrInst::setIsInBounds(bool B) {
1416 cast<GEPOperator>(this)->setIsInBounds(B);
1419 bool GetElementPtrInst::isInBounds() const {
1420 return cast<GEPOperator>(this)->isInBounds();
1423 //===----------------------------------------------------------------------===//
1424 // ExtractElementInst Implementation
1425 //===----------------------------------------------------------------------===//
1427 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1429 Instruction *InsertBef)
1430 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1432 OperandTraits<ExtractElementInst>::op_begin(this),
1434 assert(isValidOperands(Val, Index) &&
1435 "Invalid extractelement instruction operands!");
1441 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1443 BasicBlock *InsertAE)
1444 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1446 OperandTraits<ExtractElementInst>::op_begin(this),
1448 assert(isValidOperands(Val, Index) &&
1449 "Invalid extractelement instruction operands!");
1457 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
1458 if (!Val->getType()->isVectorTy() || !Index->getType()->isIntegerTy(32))
1464 //===----------------------------------------------------------------------===//
1465 // InsertElementInst Implementation
1466 //===----------------------------------------------------------------------===//
1468 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1470 Instruction *InsertBef)
1471 : Instruction(Vec->getType(), InsertElement,
1472 OperandTraits<InsertElementInst>::op_begin(this),
1474 assert(isValidOperands(Vec, Elt, Index) &&
1475 "Invalid insertelement instruction operands!");
1482 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1484 BasicBlock *InsertAE)
1485 : Instruction(Vec->getType(), InsertElement,
1486 OperandTraits<InsertElementInst>::op_begin(this),
1488 assert(isValidOperands(Vec, Elt, Index) &&
1489 "Invalid insertelement instruction operands!");
1497 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
1498 const Value *Index) {
1499 if (!Vec->getType()->isVectorTy())
1500 return false; // First operand of insertelement must be vector type.
1502 if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
1503 return false;// Second operand of insertelement must be vector element type.
1505 if (!Index->getType()->isIntegerTy(32))
1506 return false; // Third operand of insertelement must be i32.
1511 //===----------------------------------------------------------------------===//
1512 // ShuffleVectorInst Implementation
1513 //===----------------------------------------------------------------------===//
1515 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1517 Instruction *InsertBefore)
1518 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1519 cast<VectorType>(Mask->getType())->getNumElements()),
1521 OperandTraits<ShuffleVectorInst>::op_begin(this),
1522 OperandTraits<ShuffleVectorInst>::operands(this),
1524 assert(isValidOperands(V1, V2, Mask) &&
1525 "Invalid shuffle vector instruction operands!");
1532 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1534 BasicBlock *InsertAtEnd)
1535 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1536 cast<VectorType>(Mask->getType())->getNumElements()),
1538 OperandTraits<ShuffleVectorInst>::op_begin(this),
1539 OperandTraits<ShuffleVectorInst>::operands(this),
1541 assert(isValidOperands(V1, V2, Mask) &&
1542 "Invalid shuffle vector instruction operands!");
1550 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1551 const Value *Mask) {
1552 // V1 and V2 must be vectors of the same type.
1553 if (!V1->getType()->isVectorTy() || V1->getType() != V2->getType())
1556 // Mask must be vector of i32.
1557 VectorType *MaskTy = dyn_cast<VectorType>(Mask->getType());
1558 if (MaskTy == 0 || !MaskTy->getElementType()->isIntegerTy(32))
1561 // Check to see if Mask is valid.
1562 if (isa<UndefValue>(Mask) || isa<ConstantAggregateZero>(Mask))
1565 if (const ConstantVector *MV = dyn_cast<ConstantVector>(Mask)) {
1566 unsigned V1Size = cast<VectorType>(V1->getType())->getNumElements();
1567 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
1568 if (ConstantInt *CI = dyn_cast<ConstantInt>(MV->getOperand(i))) {
1569 if (CI->uge(V1Size*2))
1571 } else if (!isa<UndefValue>(MV->getOperand(i))) {
1578 if (const ConstantDataSequential *CDS =
1579 dyn_cast<ConstantDataSequential>(Mask)) {
1580 unsigned V1Size = cast<VectorType>(V1->getType())->getNumElements();
1581 for (unsigned i = 0, e = MaskTy->getNumElements(); i != e; ++i)
1582 if (CDS->getElementAsInteger(i) >= V1Size*2)
1587 // The bitcode reader can create a place holder for a forward reference
1588 // used as the shuffle mask. When this occurs, the shuffle mask will
1589 // fall into this case and fail. To avoid this error, do this bit of
1590 // ugliness to allow such a mask pass.
1591 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(Mask))
1592 if (CE->getOpcode() == Instruction::UserOp1)
1598 /// getMaskValue - Return the index from the shuffle mask for the specified
1599 /// output result. This is either -1 if the element is undef or a number less
1600 /// than 2*numelements.
1601 int ShuffleVectorInst::getMaskValue(Constant *Mask, unsigned i) {
1602 assert(i < Mask->getType()->getVectorNumElements() && "Index out of range");
1603 if (ConstantDataSequential *CDS =dyn_cast<ConstantDataSequential>(Mask))
1604 return CDS->getElementAsInteger(i);
1605 Constant *C = Mask->getAggregateElement(i);
1606 if (isa<UndefValue>(C))
1608 return cast<ConstantInt>(C)->getZExtValue();
1611 /// getShuffleMask - Return the full mask for this instruction, where each
1612 /// element is the element number and undef's are returned as -1.
1613 void ShuffleVectorInst::getShuffleMask(Constant *Mask,
1614 SmallVectorImpl<int> &Result) {
1615 unsigned NumElts = Mask->getType()->getVectorNumElements();
1617 if (ConstantDataSequential *CDS=dyn_cast<ConstantDataSequential>(Mask)) {
1618 for (unsigned i = 0; i != NumElts; ++i)
1619 Result.push_back(CDS->getElementAsInteger(i));
1622 for (unsigned i = 0; i != NumElts; ++i) {
1623 Constant *C = Mask->getAggregateElement(i);
1624 Result.push_back(isa<UndefValue>(C) ? -1 :
1625 cast<ConstantInt>(C)->getZExtValue());
1630 //===----------------------------------------------------------------------===//
1631 // InsertValueInst Class
1632 //===----------------------------------------------------------------------===//
1634 void InsertValueInst::init(Value *Agg, Value *Val, ArrayRef<unsigned> Idxs,
1635 const Twine &Name) {
1636 assert(NumOperands == 2 && "NumOperands not initialized?");
1638 // There's no fundamental reason why we require at least one index
1639 // (other than weirdness with &*IdxBegin being invalid; see
1640 // getelementptr's init routine for example). But there's no
1641 // present need to support it.
1642 assert(Idxs.size() > 0 && "InsertValueInst must have at least one index");
1644 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs) ==
1645 Val->getType() && "Inserted value must match indexed type!");
1649 Indices.append(Idxs.begin(), Idxs.end());
1653 InsertValueInst::InsertValueInst(const InsertValueInst &IVI)
1654 : Instruction(IVI.getType(), InsertValue,
1655 OperandTraits<InsertValueInst>::op_begin(this), 2),
1656 Indices(IVI.Indices) {
1657 Op<0>() = IVI.getOperand(0);
1658 Op<1>() = IVI.getOperand(1);
1659 SubclassOptionalData = IVI.SubclassOptionalData;
1662 //===----------------------------------------------------------------------===//
1663 // ExtractValueInst Class
1664 //===----------------------------------------------------------------------===//
1666 void ExtractValueInst::init(ArrayRef<unsigned> Idxs, const Twine &Name) {
1667 assert(NumOperands == 1 && "NumOperands not initialized?");
1669 // There's no fundamental reason why we require at least one index.
1670 // But there's no present need to support it.
1671 assert(Idxs.size() > 0 && "ExtractValueInst must have at least one index");
1673 Indices.append(Idxs.begin(), Idxs.end());
1677 ExtractValueInst::ExtractValueInst(const ExtractValueInst &EVI)
1678 : UnaryInstruction(EVI.getType(), ExtractValue, EVI.getOperand(0)),
1679 Indices(EVI.Indices) {
1680 SubclassOptionalData = EVI.SubclassOptionalData;
1683 // getIndexedType - Returns the type of the element that would be extracted
1684 // with an extractvalue instruction with the specified parameters.
1686 // A null type is returned if the indices are invalid for the specified
1689 Type *ExtractValueInst::getIndexedType(Type *Agg,
1690 ArrayRef<unsigned> Idxs) {
1691 for (unsigned CurIdx = 0; CurIdx != Idxs.size(); ++CurIdx) {
1692 unsigned Index = Idxs[CurIdx];
1693 // We can't use CompositeType::indexValid(Index) here.
1694 // indexValid() always returns true for arrays because getelementptr allows
1695 // out-of-bounds indices. Since we don't allow those for extractvalue and
1696 // insertvalue we need to check array indexing manually.
1697 // Since the only other types we can index into are struct types it's just
1698 // as easy to check those manually as well.
1699 if (ArrayType *AT = dyn_cast<ArrayType>(Agg)) {
1700 if (Index >= AT->getNumElements())
1702 } else if (StructType *ST = dyn_cast<StructType>(Agg)) {
1703 if (Index >= ST->getNumElements())
1706 // Not a valid type to index into.
1710 Agg = cast<CompositeType>(Agg)->getTypeAtIndex(Index);
1712 return const_cast<Type*>(Agg);
1715 //===----------------------------------------------------------------------===//
1716 // BinaryOperator Class
1717 //===----------------------------------------------------------------------===//
1719 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1720 Type *Ty, const Twine &Name,
1721 Instruction *InsertBefore)
1722 : Instruction(Ty, iType,
1723 OperandTraits<BinaryOperator>::op_begin(this),
1724 OperandTraits<BinaryOperator>::operands(this),
1732 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1733 Type *Ty, const Twine &Name,
1734 BasicBlock *InsertAtEnd)
1735 : Instruction(Ty, iType,
1736 OperandTraits<BinaryOperator>::op_begin(this),
1737 OperandTraits<BinaryOperator>::operands(this),
1746 void BinaryOperator::init(BinaryOps iType) {
1747 Value *LHS = getOperand(0), *RHS = getOperand(1);
1748 (void)LHS; (void)RHS; // Silence warnings.
1749 assert(LHS->getType() == RHS->getType() &&
1750 "Binary operator operand types must match!");
1755 assert(getType() == LHS->getType() &&
1756 "Arithmetic operation should return same type as operands!");
1757 assert(getType()->isIntOrIntVectorTy() &&
1758 "Tried to create an integer operation on a non-integer type!");
1760 case FAdd: case FSub:
1762 assert(getType() == LHS->getType() &&
1763 "Arithmetic operation should return same type as operands!");
1764 assert(getType()->isFPOrFPVectorTy() &&
1765 "Tried to create a floating-point operation on a "
1766 "non-floating-point type!");
1770 assert(getType() == LHS->getType() &&
1771 "Arithmetic operation should return same type as operands!");
1772 assert((getType()->isIntegerTy() || (getType()->isVectorTy() &&
1773 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1774 "Incorrect operand type (not integer) for S/UDIV");
1777 assert(getType() == LHS->getType() &&
1778 "Arithmetic operation should return same type as operands!");
1779 assert(getType()->isFPOrFPVectorTy() &&
1780 "Incorrect operand type (not floating point) for FDIV");
1784 assert(getType() == LHS->getType() &&
1785 "Arithmetic operation should return same type as operands!");
1786 assert((getType()->isIntegerTy() || (getType()->isVectorTy() &&
1787 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1788 "Incorrect operand type (not integer) for S/UREM");
1791 assert(getType() == LHS->getType() &&
1792 "Arithmetic operation should return same type as operands!");
1793 assert(getType()->isFPOrFPVectorTy() &&
1794 "Incorrect operand type (not floating point) for FREM");
1799 assert(getType() == LHS->getType() &&
1800 "Shift operation should return same type as operands!");
1801 assert((getType()->isIntegerTy() ||
1802 (getType()->isVectorTy() &&
1803 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1804 "Tried to create a shift operation on a non-integral type!");
1808 assert(getType() == LHS->getType() &&
1809 "Logical operation should return same type as operands!");
1810 assert((getType()->isIntegerTy() ||
1811 (getType()->isVectorTy() &&
1812 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1813 "Tried to create a logical operation on a non-integral type!");
1821 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1823 Instruction *InsertBefore) {
1824 assert(S1->getType() == S2->getType() &&
1825 "Cannot create binary operator with two operands of differing type!");
1826 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1829 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1831 BasicBlock *InsertAtEnd) {
1832 BinaryOperator *Res = Create(Op, S1, S2, Name);
1833 InsertAtEnd->getInstList().push_back(Res);
1837 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1838 Instruction *InsertBefore) {
1839 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1840 return new BinaryOperator(Instruction::Sub,
1842 Op->getType(), Name, InsertBefore);
1845 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1846 BasicBlock *InsertAtEnd) {
1847 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1848 return new BinaryOperator(Instruction::Sub,
1850 Op->getType(), Name, InsertAtEnd);
1853 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1854 Instruction *InsertBefore) {
1855 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1856 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertBefore);
1859 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1860 BasicBlock *InsertAtEnd) {
1861 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1862 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertAtEnd);
1865 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1866 Instruction *InsertBefore) {
1867 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1868 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertBefore);
1871 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1872 BasicBlock *InsertAtEnd) {
1873 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1874 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertAtEnd);
1877 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1878 Instruction *InsertBefore) {
1879 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1880 return new BinaryOperator(Instruction::FSub, zero, Op,
1881 Op->getType(), Name, InsertBefore);
1884 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1885 BasicBlock *InsertAtEnd) {
1886 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1887 return new BinaryOperator(Instruction::FSub, zero, Op,
1888 Op->getType(), Name, InsertAtEnd);
1891 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1892 Instruction *InsertBefore) {
1893 Constant *C = Constant::getAllOnesValue(Op->getType());
1894 return new BinaryOperator(Instruction::Xor, Op, C,
1895 Op->getType(), Name, InsertBefore);
1898 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1899 BasicBlock *InsertAtEnd) {
1900 Constant *AllOnes = Constant::getAllOnesValue(Op->getType());
1901 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1902 Op->getType(), Name, InsertAtEnd);
1906 // isConstantAllOnes - Helper function for several functions below
1907 static inline bool isConstantAllOnes(const Value *V) {
1908 if (const Constant *C = dyn_cast<Constant>(V))
1909 return C->isAllOnesValue();
1913 bool BinaryOperator::isNeg(const Value *V) {
1914 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1915 if (Bop->getOpcode() == Instruction::Sub)
1916 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0)))
1917 return C->isNegativeZeroValue();
1921 bool BinaryOperator::isFNeg(const Value *V) {
1922 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1923 if (Bop->getOpcode() == Instruction::FSub)
1924 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0)))
1925 return C->isNegativeZeroValue();
1929 bool BinaryOperator::isNot(const Value *V) {
1930 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1931 return (Bop->getOpcode() == Instruction::Xor &&
1932 (isConstantAllOnes(Bop->getOperand(1)) ||
1933 isConstantAllOnes(Bop->getOperand(0))));
1937 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1938 return cast<BinaryOperator>(BinOp)->getOperand(1);
1941 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1942 return getNegArgument(const_cast<Value*>(BinOp));
1945 Value *BinaryOperator::getFNegArgument(Value *BinOp) {
1946 return cast<BinaryOperator>(BinOp)->getOperand(1);
1949 const Value *BinaryOperator::getFNegArgument(const Value *BinOp) {
1950 return getFNegArgument(const_cast<Value*>(BinOp));
1953 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1954 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1955 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1956 Value *Op0 = BO->getOperand(0);
1957 Value *Op1 = BO->getOperand(1);
1958 if (isConstantAllOnes(Op0)) return Op1;
1960 assert(isConstantAllOnes(Op1));
1964 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1965 return getNotArgument(const_cast<Value*>(BinOp));
1969 // swapOperands - Exchange the two operands to this instruction. This
1970 // instruction is safe to use on any binary instruction and does not
1971 // modify the semantics of the instruction. If the instruction is
1972 // order dependent (SetLT f.e.) the opcode is changed.
1974 bool BinaryOperator::swapOperands() {
1975 if (!isCommutative())
1976 return true; // Can't commute operands
1977 Op<0>().swap(Op<1>());
1981 void BinaryOperator::setHasNoUnsignedWrap(bool b) {
1982 cast<OverflowingBinaryOperator>(this)->setHasNoUnsignedWrap(b);
1985 void BinaryOperator::setHasNoSignedWrap(bool b) {
1986 cast<OverflowingBinaryOperator>(this)->setHasNoSignedWrap(b);
1989 void BinaryOperator::setIsExact(bool b) {
1990 cast<PossiblyExactOperator>(this)->setIsExact(b);
1993 bool BinaryOperator::hasNoUnsignedWrap() const {
1994 return cast<OverflowingBinaryOperator>(this)->hasNoUnsignedWrap();
1997 bool BinaryOperator::hasNoSignedWrap() const {
1998 return cast<OverflowingBinaryOperator>(this)->hasNoSignedWrap();
2001 bool BinaryOperator::isExact() const {
2002 return cast<PossiblyExactOperator>(this)->isExact();
2005 //===----------------------------------------------------------------------===//
2006 // FPMathOperator Class
2007 //===----------------------------------------------------------------------===//
2009 /// getFPAccuracy - Get the maximum error permitted by this operation in ULPs.
2010 /// An accuracy of 0.0 means that the operation should be performed with the
2011 /// default precision.
2012 float FPMathOperator::getFPAccuracy() const {
2014 cast<Instruction>(this)->getMetadata(LLVMContext::MD_fpmath);
2017 ConstantFP *Accuracy = cast<ConstantFP>(MD->getOperand(0));
2018 return Accuracy->getValueAPF().convertToFloat();
2022 //===----------------------------------------------------------------------===//
2024 //===----------------------------------------------------------------------===//
2026 void CastInst::anchor() {}
2028 // Just determine if this cast only deals with integral->integral conversion.
2029 bool CastInst::isIntegerCast() const {
2030 switch (getOpcode()) {
2031 default: return false;
2032 case Instruction::ZExt:
2033 case Instruction::SExt:
2034 case Instruction::Trunc:
2036 case Instruction::BitCast:
2037 return getOperand(0)->getType()->isIntegerTy() &&
2038 getType()->isIntegerTy();
2042 bool CastInst::isLosslessCast() const {
2043 // Only BitCast can be lossless, exit fast if we're not BitCast
2044 if (getOpcode() != Instruction::BitCast)
2047 // Identity cast is always lossless
2048 Type* SrcTy = getOperand(0)->getType();
2049 Type* DstTy = getType();
2053 // Pointer to pointer is always lossless.
2054 if (SrcTy->isPointerTy())
2055 return DstTy->isPointerTy();
2056 return false; // Other types have no identity values
2059 /// This function determines if the CastInst does not require any bits to be
2060 /// changed in order to effect the cast. Essentially, it identifies cases where
2061 /// no code gen is necessary for the cast, hence the name no-op cast. For
2062 /// example, the following are all no-op casts:
2063 /// # bitcast i32* %x to i8*
2064 /// # bitcast <2 x i32> %x to <4 x i16>
2065 /// # ptrtoint i32* %x to i32 ; on 32-bit plaforms only
2066 /// @brief Determine if the described cast is a no-op.
2067 bool CastInst::isNoopCast(Instruction::CastOps Opcode,
2072 default: llvm_unreachable("Invalid CastOp");
2073 case Instruction::Trunc:
2074 case Instruction::ZExt:
2075 case Instruction::SExt:
2076 case Instruction::FPTrunc:
2077 case Instruction::FPExt:
2078 case Instruction::UIToFP:
2079 case Instruction::SIToFP:
2080 case Instruction::FPToUI:
2081 case Instruction::FPToSI:
2082 return false; // These always modify bits
2083 case Instruction::BitCast:
2084 return true; // BitCast never modifies bits.
2085 case Instruction::PtrToInt:
2086 return IntPtrTy->getScalarSizeInBits() ==
2087 DestTy->getScalarSizeInBits();
2088 case Instruction::IntToPtr:
2089 return IntPtrTy->getScalarSizeInBits() ==
2090 SrcTy->getScalarSizeInBits();
2094 /// @brief Determine if a cast is a no-op.
2095 bool CastInst::isNoopCast(Type *IntPtrTy) const {
2096 return isNoopCast(getOpcode(), getOperand(0)->getType(), getType(), IntPtrTy);
2099 /// This function determines if a pair of casts can be eliminated and what
2100 /// opcode should be used in the elimination. This assumes that there are two
2101 /// instructions like this:
2102 /// * %F = firstOpcode SrcTy %x to MidTy
2103 /// * %S = secondOpcode MidTy %F to DstTy
2104 /// The function returns a resultOpcode so these two casts can be replaced with:
2105 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
2106 /// If no such cast is permited, the function returns 0.
2107 unsigned CastInst::isEliminableCastPair(
2108 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
2109 Type *SrcTy, Type *MidTy, Type *DstTy, Type *IntPtrTy) {
2110 // Define the 144 possibilities for these two cast instructions. The values
2111 // in this matrix determine what to do in a given situation and select the
2112 // case in the switch below. The rows correspond to firstOp, the columns
2113 // correspond to secondOp. In looking at the table below, keep in mind
2114 // the following cast properties:
2116 // Size Compare Source Destination
2117 // Operator Src ? Size Type Sign Type Sign
2118 // -------- ------------ ------------------- ---------------------
2119 // TRUNC > Integer Any Integral Any
2120 // ZEXT < Integral Unsigned Integer Any
2121 // SEXT < Integral Signed Integer Any
2122 // FPTOUI n/a FloatPt n/a Integral Unsigned
2123 // FPTOSI n/a FloatPt n/a Integral Signed
2124 // UITOFP n/a Integral Unsigned FloatPt n/a
2125 // SITOFP n/a Integral Signed FloatPt n/a
2126 // FPTRUNC > FloatPt n/a FloatPt n/a
2127 // FPEXT < FloatPt n/a FloatPt n/a
2128 // PTRTOINT n/a Pointer n/a Integral Unsigned
2129 // INTTOPTR n/a Integral Unsigned Pointer n/a
2130 // BITCAST = FirstClass n/a FirstClass n/a
2132 // NOTE: some transforms are safe, but we consider them to be non-profitable.
2133 // For example, we could merge "fptoui double to i32" + "zext i32 to i64",
2134 // into "fptoui double to i64", but this loses information about the range
2135 // of the produced value (we no longer know the top-part is all zeros).
2136 // Further this conversion is often much more expensive for typical hardware,
2137 // and causes issues when building libgcc. We disallow fptosi+sext for the
2139 const unsigned numCastOps =
2140 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
2141 static const uint8_t CastResults[numCastOps][numCastOps] = {
2142 // T F F U S F F P I B -+
2143 // R Z S P P I I T P 2 N T |
2144 // U E E 2 2 2 2 R E I T C +- secondOp
2145 // N X X U S F F N X N 2 V |
2146 // C T T I I P P C T T P T -+
2147 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
2148 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
2149 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
2150 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
2151 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
2152 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
2153 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
2154 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
2155 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
2156 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
2157 { 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
2158 { 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
2161 // If either of the casts are a bitcast from scalar to vector, disallow the
2162 // merging. However, bitcast of A->B->A are allowed.
2163 bool isFirstBitcast = (firstOp == Instruction::BitCast);
2164 bool isSecondBitcast = (secondOp == Instruction::BitCast);
2165 bool chainedBitcast = (SrcTy == DstTy && isFirstBitcast && isSecondBitcast);
2167 // Check if any of the bitcasts convert scalars<->vectors.
2168 if ((isFirstBitcast && isa<VectorType>(SrcTy) != isa<VectorType>(MidTy)) ||
2169 (isSecondBitcast && isa<VectorType>(MidTy) != isa<VectorType>(DstTy)))
2170 // Unless we are bitcasing to the original type, disallow optimizations.
2171 if (!chainedBitcast) return 0;
2173 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
2174 [secondOp-Instruction::CastOpsBegin];
2177 // categorically disallowed
2180 // allowed, use first cast's opcode
2183 // allowed, use second cast's opcode
2186 // no-op cast in second op implies firstOp as long as the DestTy
2187 // is integer and we are not converting between a vector and a
2189 if (!SrcTy->isVectorTy() && DstTy->isIntegerTy())
2193 // no-op cast in second op implies firstOp as long as the DestTy
2194 // is floating point.
2195 if (DstTy->isFloatingPointTy())
2199 // no-op cast in first op implies secondOp as long as the SrcTy
2201 if (SrcTy->isIntegerTy())
2205 // no-op cast in first op implies secondOp as long as the SrcTy
2206 // is a floating point.
2207 if (SrcTy->isFloatingPointTy())
2211 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size
2214 unsigned PtrSize = IntPtrTy->getScalarSizeInBits();
2215 unsigned MidSize = MidTy->getScalarSizeInBits();
2216 if (MidSize >= PtrSize)
2217 return Instruction::BitCast;
2221 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
2222 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
2223 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
2224 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2225 unsigned DstSize = DstTy->getScalarSizeInBits();
2226 if (SrcSize == DstSize)
2227 return Instruction::BitCast;
2228 else if (SrcSize < DstSize)
2232 case 9: // zext, sext -> zext, because sext can't sign extend after zext
2233 return Instruction::ZExt;
2235 // fpext followed by ftrunc is allowed if the bit size returned to is
2236 // the same as the original, in which case its just a bitcast
2238 return Instruction::BitCast;
2239 return 0; // If the types are not the same we can't eliminate it.
2241 // bitcast followed by ptrtoint is allowed as long as the bitcast
2242 // is a pointer to pointer cast.
2243 if (SrcTy->isPointerTy() && MidTy->isPointerTy())
2247 // inttoptr, bitcast -> intptr if bitcast is a ptr to ptr cast
2248 if (MidTy->isPointerTy() && DstTy->isPointerTy())
2252 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
2255 unsigned PtrSize = IntPtrTy->getScalarSizeInBits();
2256 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2257 unsigned DstSize = DstTy->getScalarSizeInBits();
2258 if (SrcSize <= PtrSize && SrcSize == DstSize)
2259 return Instruction::BitCast;
2263 // cast combination can't happen (error in input). This is for all cases
2264 // where the MidTy is not the same for the two cast instructions.
2265 llvm_unreachable("Invalid Cast Combination");
2267 llvm_unreachable("Error in CastResults table!!!");
2271 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2272 const Twine &Name, Instruction *InsertBefore) {
2273 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2274 // Construct and return the appropriate CastInst subclass
2276 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
2277 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
2278 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
2279 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
2280 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
2281 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
2282 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
2283 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
2284 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
2285 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
2286 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
2287 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
2288 default: llvm_unreachable("Invalid opcode provided");
2292 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2293 const Twine &Name, BasicBlock *InsertAtEnd) {
2294 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2295 // Construct and return the appropriate CastInst subclass
2297 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
2298 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
2299 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
2300 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
2301 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
2302 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
2303 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
2304 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
2305 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
2306 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
2307 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
2308 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
2309 default: llvm_unreachable("Invalid opcode provided");
2313 CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
2315 Instruction *InsertBefore) {
2316 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2317 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2318 return Create(Instruction::ZExt, S, Ty, Name, InsertBefore);
2321 CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
2323 BasicBlock *InsertAtEnd) {
2324 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2325 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2326 return Create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
2329 CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
2331 Instruction *InsertBefore) {
2332 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2333 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2334 return Create(Instruction::SExt, S, Ty, Name, InsertBefore);
2337 CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
2339 BasicBlock *InsertAtEnd) {
2340 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2341 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2342 return Create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
2345 CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
2347 Instruction *InsertBefore) {
2348 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2349 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2350 return Create(Instruction::Trunc, S, Ty, Name, InsertBefore);
2353 CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
2355 BasicBlock *InsertAtEnd) {
2356 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2357 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2358 return Create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
2361 CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
2363 BasicBlock *InsertAtEnd) {
2364 assert(S->getType()->isPointerTy() && "Invalid cast");
2365 assert((Ty->isIntegerTy() || Ty->isPointerTy()) &&
2368 if (Ty->isIntegerTy())
2369 return Create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
2370 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2373 /// @brief Create a BitCast or a PtrToInt cast instruction
2374 CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
2376 Instruction *InsertBefore) {
2377 assert(S->getType()->isPointerTy() && "Invalid cast");
2378 assert((Ty->isIntegerTy() || Ty->isPointerTy()) &&
2381 if (Ty->isIntegerTy())
2382 return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
2383 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2386 CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
2387 bool isSigned, const Twine &Name,
2388 Instruction *InsertBefore) {
2389 assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&
2390 "Invalid integer cast");
2391 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2392 unsigned DstBits = Ty->getScalarSizeInBits();
2393 Instruction::CastOps opcode =
2394 (SrcBits == DstBits ? Instruction::BitCast :
2395 (SrcBits > DstBits ? Instruction::Trunc :
2396 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2397 return Create(opcode, C, Ty, Name, InsertBefore);
2400 CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
2401 bool isSigned, const Twine &Name,
2402 BasicBlock *InsertAtEnd) {
2403 assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&
2405 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2406 unsigned DstBits = Ty->getScalarSizeInBits();
2407 Instruction::CastOps opcode =
2408 (SrcBits == DstBits ? Instruction::BitCast :
2409 (SrcBits > DstBits ? Instruction::Trunc :
2410 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2411 return Create(opcode, C, Ty, Name, InsertAtEnd);
2414 CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
2416 Instruction *InsertBefore) {
2417 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
2419 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2420 unsigned DstBits = Ty->getScalarSizeInBits();
2421 Instruction::CastOps opcode =
2422 (SrcBits == DstBits ? Instruction::BitCast :
2423 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2424 return Create(opcode, C, Ty, Name, InsertBefore);
2427 CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
2429 BasicBlock *InsertAtEnd) {
2430 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
2432 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2433 unsigned DstBits = Ty->getScalarSizeInBits();
2434 Instruction::CastOps opcode =
2435 (SrcBits == DstBits ? Instruction::BitCast :
2436 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2437 return Create(opcode, C, Ty, Name, InsertAtEnd);
2440 // Check whether it is valid to call getCastOpcode for these types.
2441 // This routine must be kept in sync with getCastOpcode.
2442 bool CastInst::isCastable(Type *SrcTy, Type *DestTy) {
2443 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2446 if (SrcTy == DestTy)
2449 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy))
2450 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy))
2451 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2452 // An element by element cast. Valid if casting the elements is valid.
2453 SrcTy = SrcVecTy->getElementType();
2454 DestTy = DestVecTy->getElementType();
2457 // Get the bit sizes, we'll need these
2458 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2459 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2461 // Run through the possibilities ...
2462 if (DestTy->isIntegerTy()) { // Casting to integral
2463 if (SrcTy->isIntegerTy()) { // Casting from integral
2465 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2467 } else if (SrcTy->isVectorTy()) { // Casting from vector
2468 return DestBits == SrcBits;
2469 } else { // Casting from something else
2470 return SrcTy->isPointerTy();
2472 } else if (DestTy->isFloatingPointTy()) { // Casting to floating pt
2473 if (SrcTy->isIntegerTy()) { // Casting from integral
2475 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2477 } else if (SrcTy->isVectorTy()) { // Casting from vector
2478 return DestBits == SrcBits;
2479 } else { // Casting from something else
2482 } else if (DestTy->isVectorTy()) { // Casting to vector
2483 return DestBits == SrcBits;
2484 } else if (DestTy->isPointerTy()) { // Casting to pointer
2485 if (SrcTy->isPointerTy()) { // Casting from pointer
2487 } else if (SrcTy->isIntegerTy()) { // Casting from integral
2489 } else { // Casting from something else
2492 } else if (DestTy->isX86_MMXTy()) {
2493 if (SrcTy->isVectorTy()) {
2494 return DestBits == SrcBits; // 64-bit vector to MMX
2498 } else { // Casting to something else
2503 // Provide a way to get a "cast" where the cast opcode is inferred from the
2504 // types and size of the operand. This, basically, is a parallel of the
2505 // logic in the castIsValid function below. This axiom should hold:
2506 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
2507 // should not assert in castIsValid. In other words, this produces a "correct"
2508 // casting opcode for the arguments passed to it.
2509 // This routine must be kept in sync with isCastable.
2510 Instruction::CastOps
2511 CastInst::getCastOpcode(
2512 const Value *Src, bool SrcIsSigned, Type *DestTy, bool DestIsSigned) {
2513 Type *SrcTy = Src->getType();
2515 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2516 "Only first class types are castable!");
2518 if (SrcTy == DestTy)
2521 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy))
2522 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy))
2523 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2524 // An element by element cast. Find the appropriate opcode based on the
2526 SrcTy = SrcVecTy->getElementType();
2527 DestTy = DestVecTy->getElementType();
2530 // Get the bit sizes, we'll need these
2531 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2532 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2534 // Run through the possibilities ...
2535 if (DestTy->isIntegerTy()) { // Casting to integral
2536 if (SrcTy->isIntegerTy()) { // Casting from integral
2537 if (DestBits < SrcBits)
2538 return Trunc; // int -> smaller int
2539 else if (DestBits > SrcBits) { // its an extension
2541 return SExt; // signed -> SEXT
2543 return ZExt; // unsigned -> ZEXT
2545 return BitCast; // Same size, No-op cast
2547 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2549 return FPToSI; // FP -> sint
2551 return FPToUI; // FP -> uint
2552 } else if (SrcTy->isVectorTy()) {
2553 assert(DestBits == SrcBits &&
2554 "Casting vector to integer of different width");
2555 return BitCast; // Same size, no-op cast
2557 assert(SrcTy->isPointerTy() &&
2558 "Casting from a value that is not first-class type");
2559 return PtrToInt; // ptr -> int
2561 } else if (DestTy->isFloatingPointTy()) { // Casting to floating pt
2562 if (SrcTy->isIntegerTy()) { // Casting from integral
2564 return SIToFP; // sint -> FP
2566 return UIToFP; // uint -> FP
2567 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2568 if (DestBits < SrcBits) {
2569 return FPTrunc; // FP -> smaller FP
2570 } else if (DestBits > SrcBits) {
2571 return FPExt; // FP -> larger FP
2573 return BitCast; // same size, no-op cast
2575 } else if (SrcTy->isVectorTy()) {
2576 assert(DestBits == SrcBits &&
2577 "Casting vector to floating point of different width");
2578 return BitCast; // same size, no-op cast
2580 llvm_unreachable("Casting pointer or non-first class to float");
2581 } else if (DestTy->isVectorTy()) {
2582 assert(DestBits == SrcBits &&
2583 "Illegal cast to vector (wrong type or size)");
2585 } else if (DestTy->isPointerTy()) {
2586 if (SrcTy->isPointerTy()) {
2587 return BitCast; // ptr -> ptr
2588 } else if (SrcTy->isIntegerTy()) {
2589 return IntToPtr; // int -> ptr
2591 llvm_unreachable("Casting pointer to other than pointer or int");
2592 } else if (DestTy->isX86_MMXTy()) {
2593 if (SrcTy->isVectorTy()) {
2594 assert(DestBits == SrcBits && "Casting vector of wrong width to X86_MMX");
2595 return BitCast; // 64-bit vector to MMX
2597 llvm_unreachable("Illegal cast to X86_MMX");
2599 llvm_unreachable("Casting to type that is not first-class");
2602 //===----------------------------------------------------------------------===//
2603 // CastInst SubClass Constructors
2604 //===----------------------------------------------------------------------===//
2606 /// Check that the construction parameters for a CastInst are correct. This
2607 /// could be broken out into the separate constructors but it is useful to have
2608 /// it in one place and to eliminate the redundant code for getting the sizes
2609 /// of the types involved.
2611 CastInst::castIsValid(Instruction::CastOps op, Value *S, Type *DstTy) {
2613 // Check for type sanity on the arguments
2614 Type *SrcTy = S->getType();
2615 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType() ||
2616 SrcTy->isAggregateType() || DstTy->isAggregateType())
2619 // Get the size of the types in bits, we'll need this later
2620 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2621 unsigned DstBitSize = DstTy->getScalarSizeInBits();
2623 // If these are vector types, get the lengths of the vectors (using zero for
2624 // scalar types means that checking that vector lengths match also checks that
2625 // scalars are not being converted to vectors or vectors to scalars).
2626 unsigned SrcLength = SrcTy->isVectorTy() ?
2627 cast<VectorType>(SrcTy)->getNumElements() : 0;
2628 unsigned DstLength = DstTy->isVectorTy() ?
2629 cast<VectorType>(DstTy)->getNumElements() : 0;
2631 // Switch on the opcode provided
2633 default: return false; // This is an input error
2634 case Instruction::Trunc:
2635 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2636 SrcLength == DstLength && SrcBitSize > DstBitSize;
2637 case Instruction::ZExt:
2638 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2639 SrcLength == DstLength && SrcBitSize < DstBitSize;
2640 case Instruction::SExt:
2641 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2642 SrcLength == DstLength && SrcBitSize < DstBitSize;
2643 case Instruction::FPTrunc:
2644 return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
2645 SrcLength == DstLength && SrcBitSize > DstBitSize;
2646 case Instruction::FPExt:
2647 return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
2648 SrcLength == DstLength && SrcBitSize < DstBitSize;
2649 case Instruction::UIToFP:
2650 case Instruction::SIToFP:
2651 return SrcTy->isIntOrIntVectorTy() && DstTy->isFPOrFPVectorTy() &&
2652 SrcLength == DstLength;
2653 case Instruction::FPToUI:
2654 case Instruction::FPToSI:
2655 return SrcTy->isFPOrFPVectorTy() && DstTy->isIntOrIntVectorTy() &&
2656 SrcLength == DstLength;
2657 case Instruction::PtrToInt:
2658 if (isa<VectorType>(SrcTy) != isa<VectorType>(DstTy))
2660 if (VectorType *VT = dyn_cast<VectorType>(SrcTy))
2661 if (VT->getNumElements() != cast<VectorType>(DstTy)->getNumElements())
2663 return SrcTy->getScalarType()->isPointerTy() &&
2664 DstTy->getScalarType()->isIntegerTy();
2665 case Instruction::IntToPtr:
2666 if (isa<VectorType>(SrcTy) != isa<VectorType>(DstTy))
2668 if (VectorType *VT = dyn_cast<VectorType>(SrcTy))
2669 if (VT->getNumElements() != cast<VectorType>(DstTy)->getNumElements())
2671 return SrcTy->getScalarType()->isIntegerTy() &&
2672 DstTy->getScalarType()->isPointerTy();
2673 case Instruction::BitCast:
2674 // BitCast implies a no-op cast of type only. No bits change.
2675 // However, you can't cast pointers to anything but pointers.
2676 if (SrcTy->isPointerTy() != DstTy->isPointerTy())
2679 // Now we know we're not dealing with a pointer/non-pointer mismatch. In all
2680 // these cases, the cast is okay if the source and destination bit widths
2682 return SrcTy->getPrimitiveSizeInBits() == DstTy->getPrimitiveSizeInBits();
2686 TruncInst::TruncInst(
2687 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2688 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2689 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2692 TruncInst::TruncInst(
2693 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2694 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2695 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2699 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2700 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2701 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2705 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2706 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2707 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2710 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2711 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2712 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2716 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2717 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2718 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2721 FPTruncInst::FPTruncInst(
2722 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2723 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2724 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2727 FPTruncInst::FPTruncInst(
2728 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2729 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2730 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2733 FPExtInst::FPExtInst(
2734 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2735 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2736 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2739 FPExtInst::FPExtInst(
2740 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2741 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2742 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2745 UIToFPInst::UIToFPInst(
2746 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2747 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2748 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2751 UIToFPInst::UIToFPInst(
2752 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2753 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2754 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2757 SIToFPInst::SIToFPInst(
2758 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2759 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2760 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2763 SIToFPInst::SIToFPInst(
2764 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2765 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2766 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2769 FPToUIInst::FPToUIInst(
2770 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2771 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2772 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2775 FPToUIInst::FPToUIInst(
2776 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2777 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2778 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2781 FPToSIInst::FPToSIInst(
2782 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2783 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2784 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2787 FPToSIInst::FPToSIInst(
2788 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2789 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2790 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2793 PtrToIntInst::PtrToIntInst(
2794 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2795 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2796 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2799 PtrToIntInst::PtrToIntInst(
2800 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2801 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2802 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2805 IntToPtrInst::IntToPtrInst(
2806 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2807 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2808 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2811 IntToPtrInst::IntToPtrInst(
2812 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2813 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2814 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2817 BitCastInst::BitCastInst(
2818 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2819 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2820 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2823 BitCastInst::BitCastInst(
2824 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2825 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2826 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2829 //===----------------------------------------------------------------------===//
2831 //===----------------------------------------------------------------------===//
2833 void CmpInst::Anchor() const {}
2835 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
2836 Value *LHS, Value *RHS, const Twine &Name,
2837 Instruction *InsertBefore)
2838 : Instruction(ty, op,
2839 OperandTraits<CmpInst>::op_begin(this),
2840 OperandTraits<CmpInst>::operands(this),
2844 setPredicate((Predicate)predicate);
2848 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
2849 Value *LHS, Value *RHS, const Twine &Name,
2850 BasicBlock *InsertAtEnd)
2851 : Instruction(ty, op,
2852 OperandTraits<CmpInst>::op_begin(this),
2853 OperandTraits<CmpInst>::operands(this),
2857 setPredicate((Predicate)predicate);
2862 CmpInst::Create(OtherOps Op, unsigned short predicate,
2863 Value *S1, Value *S2,
2864 const Twine &Name, Instruction *InsertBefore) {
2865 if (Op == Instruction::ICmp) {
2867 return new ICmpInst(InsertBefore, CmpInst::Predicate(predicate),
2870 return new ICmpInst(CmpInst::Predicate(predicate),
2875 return new FCmpInst(InsertBefore, CmpInst::Predicate(predicate),
2878 return new FCmpInst(CmpInst::Predicate(predicate),
2883 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2884 const Twine &Name, BasicBlock *InsertAtEnd) {
2885 if (Op == Instruction::ICmp) {
2886 return new ICmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
2889 return new FCmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
2893 void CmpInst::swapOperands() {
2894 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2897 cast<FCmpInst>(this)->swapOperands();
2900 bool CmpInst::isCommutative() const {
2901 if (const ICmpInst *IC = dyn_cast<ICmpInst>(this))
2902 return IC->isCommutative();
2903 return cast<FCmpInst>(this)->isCommutative();
2906 bool CmpInst::isEquality() const {
2907 if (const ICmpInst *IC = dyn_cast<ICmpInst>(this))
2908 return IC->isEquality();
2909 return cast<FCmpInst>(this)->isEquality();
2913 CmpInst::Predicate CmpInst::getInversePredicate(Predicate pred) {
2915 default: llvm_unreachable("Unknown cmp predicate!");
2916 case ICMP_EQ: return ICMP_NE;
2917 case ICMP_NE: return ICMP_EQ;
2918 case ICMP_UGT: return ICMP_ULE;
2919 case ICMP_ULT: return ICMP_UGE;
2920 case ICMP_UGE: return ICMP_ULT;
2921 case ICMP_ULE: return ICMP_UGT;
2922 case ICMP_SGT: return ICMP_SLE;
2923 case ICMP_SLT: return ICMP_SGE;
2924 case ICMP_SGE: return ICMP_SLT;
2925 case ICMP_SLE: return ICMP_SGT;
2927 case FCMP_OEQ: return FCMP_UNE;
2928 case FCMP_ONE: return FCMP_UEQ;
2929 case FCMP_OGT: return FCMP_ULE;
2930 case FCMP_OLT: return FCMP_UGE;
2931 case FCMP_OGE: return FCMP_ULT;
2932 case FCMP_OLE: return FCMP_UGT;
2933 case FCMP_UEQ: return FCMP_ONE;
2934 case FCMP_UNE: return FCMP_OEQ;
2935 case FCMP_UGT: return FCMP_OLE;
2936 case FCMP_ULT: return FCMP_OGE;
2937 case FCMP_UGE: return FCMP_OLT;
2938 case FCMP_ULE: return FCMP_OGT;
2939 case FCMP_ORD: return FCMP_UNO;
2940 case FCMP_UNO: return FCMP_ORD;
2941 case FCMP_TRUE: return FCMP_FALSE;
2942 case FCMP_FALSE: return FCMP_TRUE;
2946 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
2948 default: llvm_unreachable("Unknown icmp predicate!");
2949 case ICMP_EQ: case ICMP_NE:
2950 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2952 case ICMP_UGT: return ICMP_SGT;
2953 case ICMP_ULT: return ICMP_SLT;
2954 case ICMP_UGE: return ICMP_SGE;
2955 case ICMP_ULE: return ICMP_SLE;
2959 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
2961 default: llvm_unreachable("Unknown icmp predicate!");
2962 case ICMP_EQ: case ICMP_NE:
2963 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
2965 case ICMP_SGT: return ICMP_UGT;
2966 case ICMP_SLT: return ICMP_ULT;
2967 case ICMP_SGE: return ICMP_UGE;
2968 case ICMP_SLE: return ICMP_ULE;
2972 /// Initialize a set of values that all satisfy the condition with C.
2975 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
2978 uint32_t BitWidth = C.getBitWidth();
2980 default: llvm_unreachable("Invalid ICmp opcode to ConstantRange ctor!");
2981 case ICmpInst::ICMP_EQ: Upper++; break;
2982 case ICmpInst::ICMP_NE: Lower++; break;
2983 case ICmpInst::ICMP_ULT:
2984 Lower = APInt::getMinValue(BitWidth);
2985 // Check for an empty-set condition.
2987 return ConstantRange(BitWidth, /*isFullSet=*/false);
2989 case ICmpInst::ICMP_SLT:
2990 Lower = APInt::getSignedMinValue(BitWidth);
2991 // Check for an empty-set condition.
2993 return ConstantRange(BitWidth, /*isFullSet=*/false);
2995 case ICmpInst::ICMP_UGT:
2996 Lower++; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2997 // Check for an empty-set condition.
2999 return ConstantRange(BitWidth, /*isFullSet=*/false);
3001 case ICmpInst::ICMP_SGT:
3002 Lower++; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
3003 // Check for an empty-set condition.
3005 return ConstantRange(BitWidth, /*isFullSet=*/false);
3007 case ICmpInst::ICMP_ULE:
3008 Lower = APInt::getMinValue(BitWidth); Upper++;
3009 // Check for a full-set condition.
3011 return ConstantRange(BitWidth, /*isFullSet=*/true);
3013 case ICmpInst::ICMP_SLE:
3014 Lower = APInt::getSignedMinValue(BitWidth); Upper++;
3015 // Check for a full-set condition.
3017 return ConstantRange(BitWidth, /*isFullSet=*/true);
3019 case ICmpInst::ICMP_UGE:
3020 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
3021 // Check for a full-set condition.
3023 return ConstantRange(BitWidth, /*isFullSet=*/true);
3025 case ICmpInst::ICMP_SGE:
3026 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
3027 // Check for a full-set condition.
3029 return ConstantRange(BitWidth, /*isFullSet=*/true);
3032 return ConstantRange(Lower, Upper);
3035 CmpInst::Predicate CmpInst::getSwappedPredicate(Predicate pred) {
3037 default: llvm_unreachable("Unknown cmp predicate!");
3038 case ICMP_EQ: case ICMP_NE:
3040 case ICMP_SGT: return ICMP_SLT;
3041 case ICMP_SLT: return ICMP_SGT;
3042 case ICMP_SGE: return ICMP_SLE;
3043 case ICMP_SLE: return ICMP_SGE;
3044 case ICMP_UGT: return ICMP_ULT;
3045 case ICMP_ULT: return ICMP_UGT;
3046 case ICMP_UGE: return ICMP_ULE;
3047 case ICMP_ULE: return ICMP_UGE;
3049 case FCMP_FALSE: case FCMP_TRUE:
3050 case FCMP_OEQ: case FCMP_ONE:
3051 case FCMP_UEQ: case FCMP_UNE:
3052 case FCMP_ORD: case FCMP_UNO:
3054 case FCMP_OGT: return FCMP_OLT;
3055 case FCMP_OLT: return FCMP_OGT;
3056 case FCMP_OGE: return FCMP_OLE;
3057 case FCMP_OLE: return FCMP_OGE;
3058 case FCMP_UGT: return FCMP_ULT;
3059 case FCMP_ULT: return FCMP_UGT;
3060 case FCMP_UGE: return FCMP_ULE;
3061 case FCMP_ULE: return FCMP_UGE;
3065 bool CmpInst::isUnsigned(unsigned short predicate) {
3066 switch (predicate) {
3067 default: return false;
3068 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
3069 case ICmpInst::ICMP_UGE: return true;
3073 bool CmpInst::isSigned(unsigned short predicate) {
3074 switch (predicate) {
3075 default: return false;
3076 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
3077 case ICmpInst::ICMP_SGE: return true;
3081 bool CmpInst::isOrdered(unsigned short predicate) {
3082 switch (predicate) {
3083 default: return false;
3084 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
3085 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
3086 case FCmpInst::FCMP_ORD: return true;
3090 bool CmpInst::isUnordered(unsigned short predicate) {
3091 switch (predicate) {
3092 default: return false;
3093 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
3094 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
3095 case FCmpInst::FCMP_UNO: return true;
3099 bool CmpInst::isTrueWhenEqual(unsigned short predicate) {
3101 default: return false;
3102 case ICMP_EQ: case ICMP_UGE: case ICMP_ULE: case ICMP_SGE: case ICMP_SLE:
3103 case FCMP_TRUE: case FCMP_UEQ: case FCMP_UGE: case FCMP_ULE: return true;
3107 bool CmpInst::isFalseWhenEqual(unsigned short predicate) {
3109 case ICMP_NE: case ICMP_UGT: case ICMP_ULT: case ICMP_SGT: case ICMP_SLT:
3110 case FCMP_FALSE: case FCMP_ONE: case FCMP_OGT: case FCMP_OLT: return true;
3111 default: return false;
3116 //===----------------------------------------------------------------------===//
3117 // SwitchInst Implementation
3118 //===----------------------------------------------------------------------===//
3120 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumReserved) {
3121 assert(Value && Default && NumReserved);
3122 ReservedSpace = NumReserved;
3124 OperandList = allocHungoffUses(ReservedSpace);
3126 OperandList[0] = Value;
3127 OperandList[1] = Default;
3130 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
3131 /// switch on and a default destination. The number of additional cases can
3132 /// be specified here to make memory allocation more efficient. This
3133 /// constructor can also autoinsert before another instruction.
3134 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
3135 Instruction *InsertBefore)
3136 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
3137 0, 0, InsertBefore) {
3138 init(Value, Default, 2+NumCases*2);
3141 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
3142 /// switch on and a default destination. The number of additional cases can
3143 /// be specified here to make memory allocation more efficient. This
3144 /// constructor also autoinserts at the end of the specified BasicBlock.
3145 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
3146 BasicBlock *InsertAtEnd)
3147 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
3148 0, 0, InsertAtEnd) {
3149 init(Value, Default, 2+NumCases*2);
3152 SwitchInst::SwitchInst(const SwitchInst &SI)
3153 : TerminatorInst(SI.getType(), Instruction::Switch, 0, 0) {
3154 init(SI.getCondition(), SI.getDefaultDest(), SI.getNumOperands());
3155 NumOperands = SI.getNumOperands();
3156 Use *OL = OperandList, *InOL = SI.OperandList;
3157 for (unsigned i = 2, E = SI.getNumOperands(); i != E; i += 2) {
3159 OL[i+1] = InOL[i+1];
3161 TheSubsets = SI.TheSubsets;
3162 SubclassOptionalData = SI.SubclassOptionalData;
3165 SwitchInst::~SwitchInst() {
3170 /// addCase - Add an entry to the switch instruction...
3172 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
3173 IntegersSubsetToBB Mapping;
3175 // FIXME: Currently we work with ConstantInt based cases.
3176 // So inititalize IntItem container directly from ConstantInt.
3177 Mapping.add(IntItem::fromConstantInt(OnVal));
3178 IntegersSubset CaseRanges = Mapping.getCase();
3179 addCase(CaseRanges, Dest);
3182 void SwitchInst::addCase(IntegersSubset& OnVal, BasicBlock *Dest) {
3183 unsigned NewCaseIdx = getNumCases();
3184 unsigned OpNo = NumOperands;
3185 if (OpNo+2 > ReservedSpace)
3186 growOperands(); // Get more space!
3187 // Initialize some new operands.
3188 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
3189 NumOperands = OpNo+2;
3191 SubsetsIt TheSubsetsIt = TheSubsets.insert(TheSubsets.end(), OnVal);
3193 CaseIt Case(this, NewCaseIdx, TheSubsetsIt);
3194 Case.updateCaseValueOperand(OnVal);
3195 Case.setSuccessor(Dest);
3198 /// removeCase - This method removes the specified case and its successor
3199 /// from the switch instruction.
3200 void SwitchInst::removeCase(CaseIt i) {
3201 unsigned idx = i.getCaseIndex();
3203 assert(2 + idx*2 < getNumOperands() && "Case index out of range!!!");
3205 unsigned NumOps = getNumOperands();
3206 Use *OL = OperandList;
3208 // Overwrite this case with the end of the list.
3209 if (2 + (idx + 1) * 2 != NumOps) {
3210 OL[2 + idx * 2] = OL[NumOps - 2];
3211 OL[2 + idx * 2 + 1] = OL[NumOps - 1];
3214 // Nuke the last value.
3215 OL[NumOps-2].set(0);
3216 OL[NumOps-2+1].set(0);
3218 // Do the same with TheCases collection:
3219 *i.SubsetIt = TheSubsets.back();
3220 TheSubsets.pop_back();
3222 NumOperands = NumOps-2;
3225 /// growOperands - grow operands - This grows the operand list in response
3226 /// to a push_back style of operation. This grows the number of ops by 3 times.
3228 void SwitchInst::growOperands() {
3229 unsigned e = getNumOperands();
3230 unsigned NumOps = e*3;
3232 ReservedSpace = NumOps;
3233 Use *NewOps = allocHungoffUses(NumOps);
3234 Use *OldOps = OperandList;
3235 for (unsigned i = 0; i != e; ++i) {
3236 NewOps[i] = OldOps[i];
3238 OperandList = NewOps;
3239 Use::zap(OldOps, OldOps + e, true);
3243 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
3244 return getSuccessor(idx);
3246 unsigned SwitchInst::getNumSuccessorsV() const {
3247 return getNumSuccessors();
3249 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3250 setSuccessor(idx, B);
3253 //===----------------------------------------------------------------------===//
3254 // IndirectBrInst Implementation
3255 //===----------------------------------------------------------------------===//
3257 void IndirectBrInst::init(Value *Address, unsigned NumDests) {
3258 assert(Address && Address->getType()->isPointerTy() &&
3259 "Address of indirectbr must be a pointer");
3260 ReservedSpace = 1+NumDests;
3262 OperandList = allocHungoffUses(ReservedSpace);
3264 OperandList[0] = Address;
3268 /// growOperands - grow operands - This grows the operand list in response
3269 /// to a push_back style of operation. This grows the number of ops by 2 times.
3271 void IndirectBrInst::growOperands() {
3272 unsigned e = getNumOperands();
3273 unsigned NumOps = e*2;
3275 ReservedSpace = NumOps;
3276 Use *NewOps = allocHungoffUses(NumOps);
3277 Use *OldOps = OperandList;
3278 for (unsigned i = 0; i != e; ++i)
3279 NewOps[i] = OldOps[i];
3280 OperandList = NewOps;
3281 Use::zap(OldOps, OldOps + e, true);
3284 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3285 Instruction *InsertBefore)
3286 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3287 0, 0, InsertBefore) {
3288 init(Address, NumCases);
3291 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3292 BasicBlock *InsertAtEnd)
3293 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3294 0, 0, InsertAtEnd) {
3295 init(Address, NumCases);
3298 IndirectBrInst::IndirectBrInst(const IndirectBrInst &IBI)
3299 : TerminatorInst(Type::getVoidTy(IBI.getContext()), Instruction::IndirectBr,
3300 allocHungoffUses(IBI.getNumOperands()),
3301 IBI.getNumOperands()) {
3302 Use *OL = OperandList, *InOL = IBI.OperandList;
3303 for (unsigned i = 0, E = IBI.getNumOperands(); i != E; ++i)
3305 SubclassOptionalData = IBI.SubclassOptionalData;
3308 IndirectBrInst::~IndirectBrInst() {
3312 /// addDestination - Add a destination.
3314 void IndirectBrInst::addDestination(BasicBlock *DestBB) {
3315 unsigned OpNo = NumOperands;
3316 if (OpNo+1 > ReservedSpace)
3317 growOperands(); // Get more space!
3318 // Initialize some new operands.
3319 assert(OpNo < ReservedSpace && "Growing didn't work!");
3320 NumOperands = OpNo+1;
3321 OperandList[OpNo] = DestBB;
3324 /// removeDestination - This method removes the specified successor from the
3325 /// indirectbr instruction.
3326 void IndirectBrInst::removeDestination(unsigned idx) {
3327 assert(idx < getNumOperands()-1 && "Successor index out of range!");
3329 unsigned NumOps = getNumOperands();
3330 Use *OL = OperandList;
3332 // Replace this value with the last one.
3333 OL[idx+1] = OL[NumOps-1];
3335 // Nuke the last value.
3336 OL[NumOps-1].set(0);
3337 NumOperands = NumOps-1;
3340 BasicBlock *IndirectBrInst::getSuccessorV(unsigned idx) const {
3341 return getSuccessor(idx);
3343 unsigned IndirectBrInst::getNumSuccessorsV() const {
3344 return getNumSuccessors();
3346 void IndirectBrInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3347 setSuccessor(idx, B);
3350 //===----------------------------------------------------------------------===//
3351 // clone_impl() implementations
3352 //===----------------------------------------------------------------------===//
3354 // Define these methods here so vtables don't get emitted into every translation
3355 // unit that uses these classes.
3357 GetElementPtrInst *GetElementPtrInst::clone_impl() const {
3358 return new (getNumOperands()) GetElementPtrInst(*this);
3361 BinaryOperator *BinaryOperator::clone_impl() const {
3362 return Create(getOpcode(), Op<0>(), Op<1>());
3365 FCmpInst* FCmpInst::clone_impl() const {
3366 return new FCmpInst(getPredicate(), Op<0>(), Op<1>());
3369 ICmpInst* ICmpInst::clone_impl() const {
3370 return new ICmpInst(getPredicate(), Op<0>(), Op<1>());
3373 ExtractValueInst *ExtractValueInst::clone_impl() const {
3374 return new ExtractValueInst(*this);
3377 InsertValueInst *InsertValueInst::clone_impl() const {
3378 return new InsertValueInst(*this);
3381 AllocaInst *AllocaInst::clone_impl() const {
3382 return new AllocaInst(getAllocatedType(),
3383 (Value*)getOperand(0),
3387 LoadInst *LoadInst::clone_impl() const {
3388 return new LoadInst(getOperand(0), Twine(), isVolatile(),
3389 getAlignment(), getOrdering(), getSynchScope());
3392 StoreInst *StoreInst::clone_impl() const {
3393 return new StoreInst(getOperand(0), getOperand(1), isVolatile(),
3394 getAlignment(), getOrdering(), getSynchScope());
3398 AtomicCmpXchgInst *AtomicCmpXchgInst::clone_impl() const {
3399 AtomicCmpXchgInst *Result =
3400 new AtomicCmpXchgInst(getOperand(0), getOperand(1), getOperand(2),
3401 getOrdering(), getSynchScope());
3402 Result->setVolatile(isVolatile());
3406 AtomicRMWInst *AtomicRMWInst::clone_impl() const {
3407 AtomicRMWInst *Result =
3408 new AtomicRMWInst(getOperation(),getOperand(0), getOperand(1),
3409 getOrdering(), getSynchScope());
3410 Result->setVolatile(isVolatile());
3414 FenceInst *FenceInst::clone_impl() const {
3415 return new FenceInst(getContext(), getOrdering(), getSynchScope());
3418 TruncInst *TruncInst::clone_impl() const {
3419 return new TruncInst(getOperand(0), getType());
3422 ZExtInst *ZExtInst::clone_impl() const {
3423 return new ZExtInst(getOperand(0), getType());
3426 SExtInst *SExtInst::clone_impl() const {
3427 return new SExtInst(getOperand(0), getType());
3430 FPTruncInst *FPTruncInst::clone_impl() const {
3431 return new FPTruncInst(getOperand(0), getType());
3434 FPExtInst *FPExtInst::clone_impl() const {
3435 return new FPExtInst(getOperand(0), getType());
3438 UIToFPInst *UIToFPInst::clone_impl() const {
3439 return new UIToFPInst(getOperand(0), getType());
3442 SIToFPInst *SIToFPInst::clone_impl() const {
3443 return new SIToFPInst(getOperand(0), getType());
3446 FPToUIInst *FPToUIInst::clone_impl() const {
3447 return new FPToUIInst(getOperand(0), getType());
3450 FPToSIInst *FPToSIInst::clone_impl() const {
3451 return new FPToSIInst(getOperand(0), getType());
3454 PtrToIntInst *PtrToIntInst::clone_impl() const {
3455 return new PtrToIntInst(getOperand(0), getType());
3458 IntToPtrInst *IntToPtrInst::clone_impl() const {
3459 return new IntToPtrInst(getOperand(0), getType());
3462 BitCastInst *BitCastInst::clone_impl() const {
3463 return new BitCastInst(getOperand(0), getType());
3466 CallInst *CallInst::clone_impl() const {
3467 return new(getNumOperands()) CallInst(*this);
3470 SelectInst *SelectInst::clone_impl() const {
3471 return SelectInst::Create(getOperand(0), getOperand(1), getOperand(2));
3474 VAArgInst *VAArgInst::clone_impl() const {
3475 return new VAArgInst(getOperand(0), getType());
3478 ExtractElementInst *ExtractElementInst::clone_impl() const {
3479 return ExtractElementInst::Create(getOperand(0), getOperand(1));
3482 InsertElementInst *InsertElementInst::clone_impl() const {
3483 return InsertElementInst::Create(getOperand(0), getOperand(1), getOperand(2));
3486 ShuffleVectorInst *ShuffleVectorInst::clone_impl() const {
3487 return new ShuffleVectorInst(getOperand(0), getOperand(1), getOperand(2));
3490 PHINode *PHINode::clone_impl() const {
3491 return new PHINode(*this);
3494 LandingPadInst *LandingPadInst::clone_impl() const {
3495 return new LandingPadInst(*this);
3498 ReturnInst *ReturnInst::clone_impl() const {
3499 return new(getNumOperands()) ReturnInst(*this);
3502 BranchInst *BranchInst::clone_impl() const {
3503 return new(getNumOperands()) BranchInst(*this);
3506 SwitchInst *SwitchInst::clone_impl() const {
3507 return new SwitchInst(*this);
3510 IndirectBrInst *IndirectBrInst::clone_impl() const {
3511 return new IndirectBrInst(*this);
3515 InvokeInst *InvokeInst::clone_impl() const {
3516 return new(getNumOperands()) InvokeInst(*this);
3519 ResumeInst *ResumeInst::clone_impl() const {
3520 return new(1) ResumeInst(*this);
3523 UnreachableInst *UnreachableInst::clone_impl() const {
3524 LLVMContext &Context = getContext();
3525 return new UnreachableInst(Context);