1 //===-- Instructions.cpp - Implement the LLVM instructions ----------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements all of the non-inline methods for the LLVM instruction
13 //===----------------------------------------------------------------------===//
15 #include "llvm/IR/Instructions.h"
16 #include "LLVMContextImpl.h"
17 #include "llvm/IR/Constants.h"
18 #include "llvm/IR/DataLayout.h"
19 #include "llvm/IR/DerivedTypes.h"
20 #include "llvm/IR/Function.h"
21 #include "llvm/IR/Module.h"
22 #include "llvm/IR/Operator.h"
23 #include "llvm/Support/CallSite.h"
24 #include "llvm/Support/ConstantRange.h"
25 #include "llvm/Support/ErrorHandling.h"
26 #include "llvm/Support/MathExtras.h"
29 //===----------------------------------------------------------------------===//
31 //===----------------------------------------------------------------------===//
33 User::op_iterator CallSite::getCallee() const {
34 Instruction *II(getInstruction());
36 ? cast<CallInst>(II)->op_end() - 1 // Skip Callee
37 : cast<InvokeInst>(II)->op_end() - 3; // Skip BB, BB, Callee
40 //===----------------------------------------------------------------------===//
41 // TerminatorInst Class
42 //===----------------------------------------------------------------------===//
44 // Out of line virtual method, so the vtable, etc has a home.
45 TerminatorInst::~TerminatorInst() {
48 //===----------------------------------------------------------------------===//
49 // UnaryInstruction Class
50 //===----------------------------------------------------------------------===//
52 // Out of line virtual method, so the vtable, etc has a home.
53 UnaryInstruction::~UnaryInstruction() {
56 //===----------------------------------------------------------------------===//
58 //===----------------------------------------------------------------------===//
60 /// areInvalidOperands - Return a string if the specified operands are invalid
61 /// for a select operation, otherwise return null.
62 const char *SelectInst::areInvalidOperands(Value *Op0, Value *Op1, Value *Op2) {
63 if (Op1->getType() != Op2->getType())
64 return "both values to select must have same type";
66 if (VectorType *VT = dyn_cast<VectorType>(Op0->getType())) {
68 if (VT->getElementType() != Type::getInt1Ty(Op0->getContext()))
69 return "vector select condition element type must be i1";
70 VectorType *ET = dyn_cast<VectorType>(Op1->getType());
72 return "selected values for vector select must be vectors";
73 if (ET->getNumElements() != VT->getNumElements())
74 return "vector select requires selected vectors to have "
75 "the same vector length as select condition";
76 } else if (Op0->getType() != Type::getInt1Ty(Op0->getContext())) {
77 return "select condition must be i1 or <n x i1>";
83 //===----------------------------------------------------------------------===//
85 //===----------------------------------------------------------------------===//
87 PHINode::PHINode(const PHINode &PN)
88 : Instruction(PN.getType(), Instruction::PHI,
89 allocHungoffUses(PN.getNumOperands()), PN.getNumOperands()),
90 ReservedSpace(PN.getNumOperands()) {
91 std::copy(PN.op_begin(), PN.op_end(), op_begin());
92 std::copy(PN.block_begin(), PN.block_end(), block_begin());
93 SubclassOptionalData = PN.SubclassOptionalData;
100 Use *PHINode::allocHungoffUses(unsigned N) const {
101 // Allocate the array of Uses of the incoming values, followed by a pointer
102 // (with bottom bit set) to the User, followed by the array of pointers to
103 // the incoming basic blocks.
104 size_t size = N * sizeof(Use) + sizeof(Use::UserRef)
105 + N * sizeof(BasicBlock*);
106 Use *Begin = static_cast<Use*>(::operator new(size));
107 Use *End = Begin + N;
108 (void) new(End) Use::UserRef(const_cast<PHINode*>(this), 1);
109 return Use::initTags(Begin, End);
112 // removeIncomingValue - Remove an incoming value. This is useful if a
113 // predecessor basic block is deleted.
114 Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
115 Value *Removed = getIncomingValue(Idx);
117 // Move everything after this operand down.
119 // FIXME: we could just swap with the end of the list, then erase. However,
120 // clients might not expect this to happen. The code as it is thrashes the
121 // use/def lists, which is kinda lame.
122 std::copy(op_begin() + Idx + 1, op_end(), op_begin() + Idx);
123 std::copy(block_begin() + Idx + 1, block_end(), block_begin() + Idx);
125 // Nuke the last value.
129 // If the PHI node is dead, because it has zero entries, nuke it now.
130 if (getNumOperands() == 0 && DeletePHIIfEmpty) {
131 // If anyone is using this PHI, make them use a dummy value instead...
132 replaceAllUsesWith(UndefValue::get(getType()));
138 /// growOperands - grow operands - This grows the operand list in response
139 /// to a push_back style of operation. This grows the number of ops by 1.5
142 void PHINode::growOperands() {
143 unsigned e = getNumOperands();
144 unsigned NumOps = e + e / 2;
145 if (NumOps < 2) NumOps = 2; // 2 op PHI nodes are VERY common.
147 Use *OldOps = op_begin();
148 BasicBlock **OldBlocks = block_begin();
150 ReservedSpace = NumOps;
151 OperandList = allocHungoffUses(ReservedSpace);
153 std::copy(OldOps, OldOps + e, op_begin());
154 std::copy(OldBlocks, OldBlocks + e, block_begin());
156 Use::zap(OldOps, OldOps + e, true);
159 /// hasConstantValue - If the specified PHI node always merges together the same
160 /// value, return the value, otherwise return null.
161 Value *PHINode::hasConstantValue() const {
162 // Exploit the fact that phi nodes always have at least one entry.
163 Value *ConstantValue = getIncomingValue(0);
164 for (unsigned i = 1, e = getNumIncomingValues(); i != e; ++i)
165 if (getIncomingValue(i) != ConstantValue && getIncomingValue(i) != this) {
166 if (ConstantValue != this)
167 return 0; // Incoming values not all the same.
168 // The case where the first value is this PHI.
169 ConstantValue = getIncomingValue(i);
171 if (ConstantValue == this)
172 return UndefValue::get(getType());
173 return ConstantValue;
176 //===----------------------------------------------------------------------===//
177 // LandingPadInst Implementation
178 //===----------------------------------------------------------------------===//
180 LandingPadInst::LandingPadInst(Type *RetTy, Value *PersonalityFn,
181 unsigned NumReservedValues, const Twine &NameStr,
182 Instruction *InsertBefore)
183 : Instruction(RetTy, Instruction::LandingPad, 0, 0, InsertBefore) {
184 init(PersonalityFn, 1 + NumReservedValues, NameStr);
187 LandingPadInst::LandingPadInst(Type *RetTy, Value *PersonalityFn,
188 unsigned NumReservedValues, const Twine &NameStr,
189 BasicBlock *InsertAtEnd)
190 : Instruction(RetTy, Instruction::LandingPad, 0, 0, InsertAtEnd) {
191 init(PersonalityFn, 1 + NumReservedValues, NameStr);
194 LandingPadInst::LandingPadInst(const LandingPadInst &LP)
195 : Instruction(LP.getType(), Instruction::LandingPad,
196 allocHungoffUses(LP.getNumOperands()), LP.getNumOperands()),
197 ReservedSpace(LP.getNumOperands()) {
198 Use *OL = OperandList, *InOL = LP.OperandList;
199 for (unsigned I = 0, E = ReservedSpace; I != E; ++I)
202 setCleanup(LP.isCleanup());
205 LandingPadInst::~LandingPadInst() {
209 LandingPadInst *LandingPadInst::Create(Type *RetTy, Value *PersonalityFn,
210 unsigned NumReservedClauses,
211 const Twine &NameStr,
212 Instruction *InsertBefore) {
213 return new LandingPadInst(RetTy, PersonalityFn, NumReservedClauses, NameStr,
217 LandingPadInst *LandingPadInst::Create(Type *RetTy, Value *PersonalityFn,
218 unsigned NumReservedClauses,
219 const Twine &NameStr,
220 BasicBlock *InsertAtEnd) {
221 return new LandingPadInst(RetTy, PersonalityFn, NumReservedClauses, NameStr,
225 void LandingPadInst::init(Value *PersFn, unsigned NumReservedValues,
226 const Twine &NameStr) {
227 ReservedSpace = NumReservedValues;
229 OperandList = allocHungoffUses(ReservedSpace);
230 OperandList[0] = PersFn;
235 /// growOperands - grow operands - This grows the operand list in response to a
236 /// push_back style of operation. This grows the number of ops by 2 times.
237 void LandingPadInst::growOperands(unsigned Size) {
238 unsigned e = getNumOperands();
239 if (ReservedSpace >= e + Size) return;
240 ReservedSpace = (e + Size / 2) * 2;
242 Use *NewOps = allocHungoffUses(ReservedSpace);
243 Use *OldOps = OperandList;
244 for (unsigned i = 0; i != e; ++i)
245 NewOps[i] = OldOps[i];
247 OperandList = NewOps;
248 Use::zap(OldOps, OldOps + e, true);
251 void LandingPadInst::addClause(Value *Val) {
252 unsigned OpNo = getNumOperands();
254 assert(OpNo < ReservedSpace && "Growing didn't work!");
256 OperandList[OpNo] = Val;
259 //===----------------------------------------------------------------------===//
260 // CallInst Implementation
261 //===----------------------------------------------------------------------===//
263 CallInst::~CallInst() {
266 void CallInst::init(Value *Func, ArrayRef<Value *> Args, const Twine &NameStr) {
267 assert(NumOperands == Args.size() + 1 && "NumOperands not set up?");
272 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
274 assert((Args.size() == FTy->getNumParams() ||
275 (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&
276 "Calling a function with bad signature!");
278 for (unsigned i = 0; i != Args.size(); ++i)
279 assert((i >= FTy->getNumParams() ||
280 FTy->getParamType(i) == Args[i]->getType()) &&
281 "Calling a function with a bad signature!");
284 std::copy(Args.begin(), Args.end(), op_begin());
288 void CallInst::init(Value *Func, const Twine &NameStr) {
289 assert(NumOperands == 1 && "NumOperands not set up?");
294 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
296 assert(FTy->getNumParams() == 0 && "Calling a function with bad signature");
302 CallInst::CallInst(Value *Func, const Twine &Name,
303 Instruction *InsertBefore)
304 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
305 ->getElementType())->getReturnType(),
307 OperandTraits<CallInst>::op_end(this) - 1,
312 CallInst::CallInst(Value *Func, const Twine &Name,
313 BasicBlock *InsertAtEnd)
314 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
315 ->getElementType())->getReturnType(),
317 OperandTraits<CallInst>::op_end(this) - 1,
322 CallInst::CallInst(const CallInst &CI)
323 : Instruction(CI.getType(), Instruction::Call,
324 OperandTraits<CallInst>::op_end(this) - CI.getNumOperands(),
325 CI.getNumOperands()) {
326 setAttributes(CI.getAttributes());
327 setTailCall(CI.isTailCall());
328 setCallingConv(CI.getCallingConv());
330 std::copy(CI.op_begin(), CI.op_end(), op_begin());
331 SubclassOptionalData = CI.SubclassOptionalData;
334 void CallInst::addAttribute(unsigned i, Attribute::AttrKind attr) {
335 AttributeSet PAL = getAttributes();
336 PAL = PAL.addAttribute(getContext(), i, attr);
340 void CallInst::removeAttribute(unsigned i, Attribute attr) {
341 AttributeSet PAL = getAttributes();
343 LLVMContext &Context = getContext();
344 PAL = PAL.removeAttributes(Context, i,
345 AttributeSet::get(Context, i, B));
349 bool CallInst::hasFnAttrImpl(Attribute::AttrKind A) const {
350 if (AttributeList.hasAttribute(AttributeSet::FunctionIndex, A))
352 if (const Function *F = getCalledFunction())
353 return F->getAttributes().hasAttribute(AttributeSet::FunctionIndex, A);
357 bool CallInst::paramHasAttr(unsigned i, Attribute::AttrKind A) const {
358 if (AttributeList.hasAttribute(i, A))
360 if (const Function *F = getCalledFunction())
361 return F->getAttributes().hasAttribute(i, A);
365 /// IsConstantOne - Return true only if val is constant int 1
366 static bool IsConstantOne(Value *val) {
367 assert(val && "IsConstantOne does not work with NULL val");
368 return isa<ConstantInt>(val) && cast<ConstantInt>(val)->isOne();
371 static Instruction *createMalloc(Instruction *InsertBefore,
372 BasicBlock *InsertAtEnd, Type *IntPtrTy,
373 Type *AllocTy, Value *AllocSize,
374 Value *ArraySize, Function *MallocF,
376 assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&
377 "createMalloc needs either InsertBefore or InsertAtEnd");
379 // malloc(type) becomes:
380 // bitcast (i8* malloc(typeSize)) to type*
381 // malloc(type, arraySize) becomes:
382 // bitcast (i8 *malloc(typeSize*arraySize)) to type*
384 ArraySize = ConstantInt::get(IntPtrTy, 1);
385 else if (ArraySize->getType() != IntPtrTy) {
387 ArraySize = CastInst::CreateIntegerCast(ArraySize, IntPtrTy, false,
390 ArraySize = CastInst::CreateIntegerCast(ArraySize, IntPtrTy, false,
394 if (!IsConstantOne(ArraySize)) {
395 if (IsConstantOne(AllocSize)) {
396 AllocSize = ArraySize; // Operand * 1 = Operand
397 } else if (Constant *CO = dyn_cast<Constant>(ArraySize)) {
398 Constant *Scale = ConstantExpr::getIntegerCast(CO, IntPtrTy,
400 // Malloc arg is constant product of type size and array size
401 AllocSize = ConstantExpr::getMul(Scale, cast<Constant>(AllocSize));
403 // Multiply type size by the array size...
405 AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
406 "mallocsize", InsertBefore);
408 AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
409 "mallocsize", InsertAtEnd);
413 assert(AllocSize->getType() == IntPtrTy && "malloc arg is wrong size");
414 // Create the call to Malloc.
415 BasicBlock* BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
416 Module* M = BB->getParent()->getParent();
417 Type *BPTy = Type::getInt8PtrTy(BB->getContext());
418 Value *MallocFunc = MallocF;
420 // prototype malloc as "void *malloc(size_t)"
421 MallocFunc = M->getOrInsertFunction("malloc", BPTy, IntPtrTy, NULL);
422 PointerType *AllocPtrType = PointerType::getUnqual(AllocTy);
423 CallInst *MCall = NULL;
424 Instruction *Result = NULL;
426 MCall = CallInst::Create(MallocFunc, AllocSize, "malloccall", InsertBefore);
428 if (Result->getType() != AllocPtrType)
429 // Create a cast instruction to convert to the right type...
430 Result = new BitCastInst(MCall, AllocPtrType, Name, InsertBefore);
432 MCall = CallInst::Create(MallocFunc, AllocSize, "malloccall");
434 if (Result->getType() != AllocPtrType) {
435 InsertAtEnd->getInstList().push_back(MCall);
436 // Create a cast instruction to convert to the right type...
437 Result = new BitCastInst(MCall, AllocPtrType, Name);
440 MCall->setTailCall();
441 if (Function *F = dyn_cast<Function>(MallocFunc)) {
442 MCall->setCallingConv(F->getCallingConv());
443 if (!F->doesNotAlias(0)) F->setDoesNotAlias(0);
445 assert(!MCall->getType()->isVoidTy() && "Malloc has void return type");
450 /// CreateMalloc - Generate the IR for a call to malloc:
451 /// 1. Compute the malloc call's argument as the specified type's size,
452 /// possibly multiplied by the array size if the array size is not
454 /// 2. Call malloc with that argument.
455 /// 3. Bitcast the result of the malloc call to the specified type.
456 Instruction *CallInst::CreateMalloc(Instruction *InsertBefore,
457 Type *IntPtrTy, Type *AllocTy,
458 Value *AllocSize, Value *ArraySize,
461 return createMalloc(InsertBefore, NULL, IntPtrTy, AllocTy, AllocSize,
462 ArraySize, MallocF, Name);
465 /// CreateMalloc - Generate the IR for a call to malloc:
466 /// 1. Compute the malloc call's argument as the specified type's size,
467 /// possibly multiplied by the array size if the array size is not
469 /// 2. Call malloc with that argument.
470 /// 3. Bitcast the result of the malloc call to the specified type.
471 /// Note: This function does not add the bitcast to the basic block, that is the
472 /// responsibility of the caller.
473 Instruction *CallInst::CreateMalloc(BasicBlock *InsertAtEnd,
474 Type *IntPtrTy, Type *AllocTy,
475 Value *AllocSize, Value *ArraySize,
476 Function *MallocF, const Twine &Name) {
477 return createMalloc(NULL, InsertAtEnd, IntPtrTy, AllocTy, AllocSize,
478 ArraySize, MallocF, Name);
481 static Instruction* createFree(Value* Source, Instruction *InsertBefore,
482 BasicBlock *InsertAtEnd) {
483 assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&
484 "createFree needs either InsertBefore or InsertAtEnd");
485 assert(Source->getType()->isPointerTy() &&
486 "Can not free something of nonpointer type!");
488 BasicBlock* BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
489 Module* M = BB->getParent()->getParent();
491 Type *VoidTy = Type::getVoidTy(M->getContext());
492 Type *IntPtrTy = Type::getInt8PtrTy(M->getContext());
493 // prototype free as "void free(void*)"
494 Value *FreeFunc = M->getOrInsertFunction("free", VoidTy, IntPtrTy, NULL);
495 CallInst* Result = NULL;
496 Value *PtrCast = Source;
498 if (Source->getType() != IntPtrTy)
499 PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertBefore);
500 Result = CallInst::Create(FreeFunc, PtrCast, "", InsertBefore);
502 if (Source->getType() != IntPtrTy)
503 PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertAtEnd);
504 Result = CallInst::Create(FreeFunc, PtrCast, "");
506 Result->setTailCall();
507 if (Function *F = dyn_cast<Function>(FreeFunc))
508 Result->setCallingConv(F->getCallingConv());
513 /// CreateFree - Generate the IR for a call to the builtin free function.
514 Instruction * CallInst::CreateFree(Value* Source, Instruction *InsertBefore) {
515 return createFree(Source, InsertBefore, NULL);
518 /// CreateFree - Generate the IR for a call to the builtin free function.
519 /// Note: This function does not add the call to the basic block, that is the
520 /// responsibility of the caller.
521 Instruction* CallInst::CreateFree(Value* Source, BasicBlock *InsertAtEnd) {
522 Instruction* FreeCall = createFree(Source, NULL, InsertAtEnd);
523 assert(FreeCall && "CreateFree did not create a CallInst");
527 //===----------------------------------------------------------------------===//
528 // InvokeInst Implementation
529 //===----------------------------------------------------------------------===//
531 void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
532 ArrayRef<Value *> Args, const Twine &NameStr) {
533 assert(NumOperands == 3 + Args.size() && "NumOperands not set up?");
536 Op<-1>() = IfException;
540 cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
542 assert(((Args.size() == FTy->getNumParams()) ||
543 (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&
544 "Invoking a function with bad signature");
546 for (unsigned i = 0, e = Args.size(); i != e; i++)
547 assert((i >= FTy->getNumParams() ||
548 FTy->getParamType(i) == Args[i]->getType()) &&
549 "Invoking a function with a bad signature!");
552 std::copy(Args.begin(), Args.end(), op_begin());
556 InvokeInst::InvokeInst(const InvokeInst &II)
557 : TerminatorInst(II.getType(), Instruction::Invoke,
558 OperandTraits<InvokeInst>::op_end(this)
559 - II.getNumOperands(),
560 II.getNumOperands()) {
561 setAttributes(II.getAttributes());
562 setCallingConv(II.getCallingConv());
563 std::copy(II.op_begin(), II.op_end(), op_begin());
564 SubclassOptionalData = II.SubclassOptionalData;
567 BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
568 return getSuccessor(idx);
570 unsigned InvokeInst::getNumSuccessorsV() const {
571 return getNumSuccessors();
573 void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
574 return setSuccessor(idx, B);
577 bool InvokeInst::hasFnAttrImpl(Attribute::AttrKind A) const {
578 if (AttributeList.hasAttribute(AttributeSet::FunctionIndex, A))
580 if (const Function *F = getCalledFunction())
581 return F->getAttributes().hasAttribute(AttributeSet::FunctionIndex, A);
585 bool InvokeInst::paramHasAttr(unsigned i, Attribute::AttrKind A) const {
586 if (AttributeList.hasAttribute(i, A))
588 if (const Function *F = getCalledFunction())
589 return F->getAttributes().hasAttribute(i, A);
593 void InvokeInst::addAttribute(unsigned i, Attribute::AttrKind attr) {
594 AttributeSet PAL = getAttributes();
595 PAL = PAL.addAttribute(getContext(), i, attr);
599 void InvokeInst::removeAttribute(unsigned i, Attribute attr) {
600 AttributeSet PAL = getAttributes();
602 PAL = PAL.removeAttributes(getContext(), i,
603 AttributeSet::get(getContext(), i, B));
607 LandingPadInst *InvokeInst::getLandingPadInst() const {
608 return cast<LandingPadInst>(getUnwindDest()->getFirstNonPHI());
611 //===----------------------------------------------------------------------===//
612 // ReturnInst Implementation
613 //===----------------------------------------------------------------------===//
615 ReturnInst::ReturnInst(const ReturnInst &RI)
616 : TerminatorInst(Type::getVoidTy(RI.getContext()), Instruction::Ret,
617 OperandTraits<ReturnInst>::op_end(this) -
619 RI.getNumOperands()) {
620 if (RI.getNumOperands())
621 Op<0>() = RI.Op<0>();
622 SubclassOptionalData = RI.SubclassOptionalData;
625 ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, Instruction *InsertBefore)
626 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret,
627 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
632 ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, BasicBlock *InsertAtEnd)
633 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret,
634 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
639 ReturnInst::ReturnInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
640 : TerminatorInst(Type::getVoidTy(Context), Instruction::Ret,
641 OperandTraits<ReturnInst>::op_end(this), 0, InsertAtEnd) {
644 unsigned ReturnInst::getNumSuccessorsV() const {
645 return getNumSuccessors();
648 /// Out-of-line ReturnInst method, put here so the C++ compiler can choose to
649 /// emit the vtable for the class in this translation unit.
650 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
651 llvm_unreachable("ReturnInst has no successors!");
654 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
655 llvm_unreachable("ReturnInst has no successors!");
658 ReturnInst::~ReturnInst() {
661 //===----------------------------------------------------------------------===//
662 // ResumeInst Implementation
663 //===----------------------------------------------------------------------===//
665 ResumeInst::ResumeInst(const ResumeInst &RI)
666 : TerminatorInst(Type::getVoidTy(RI.getContext()), Instruction::Resume,
667 OperandTraits<ResumeInst>::op_begin(this), 1) {
668 Op<0>() = RI.Op<0>();
671 ResumeInst::ResumeInst(Value *Exn, Instruction *InsertBefore)
672 : TerminatorInst(Type::getVoidTy(Exn->getContext()), Instruction::Resume,
673 OperandTraits<ResumeInst>::op_begin(this), 1, InsertBefore) {
677 ResumeInst::ResumeInst(Value *Exn, BasicBlock *InsertAtEnd)
678 : TerminatorInst(Type::getVoidTy(Exn->getContext()), Instruction::Resume,
679 OperandTraits<ResumeInst>::op_begin(this), 1, InsertAtEnd) {
683 unsigned ResumeInst::getNumSuccessorsV() const {
684 return getNumSuccessors();
687 void ResumeInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
688 llvm_unreachable("ResumeInst has no successors!");
691 BasicBlock *ResumeInst::getSuccessorV(unsigned idx) const {
692 llvm_unreachable("ResumeInst has no successors!");
695 //===----------------------------------------------------------------------===//
696 // UnreachableInst Implementation
697 //===----------------------------------------------------------------------===//
699 UnreachableInst::UnreachableInst(LLVMContext &Context,
700 Instruction *InsertBefore)
701 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unreachable,
702 0, 0, InsertBefore) {
704 UnreachableInst::UnreachableInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
705 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unreachable,
709 unsigned UnreachableInst::getNumSuccessorsV() const {
710 return getNumSuccessors();
713 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
714 llvm_unreachable("UnreachableInst has no successors!");
717 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
718 llvm_unreachable("UnreachableInst has no successors!");
721 //===----------------------------------------------------------------------===//
722 // BranchInst Implementation
723 //===----------------------------------------------------------------------===//
725 void BranchInst::AssertOK() {
727 assert(getCondition()->getType()->isIntegerTy(1) &&
728 "May only branch on boolean predicates!");
731 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
732 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
733 OperandTraits<BranchInst>::op_end(this) - 1,
735 assert(IfTrue != 0 && "Branch destination may not be null!");
738 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
739 Instruction *InsertBefore)
740 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
741 OperandTraits<BranchInst>::op_end(this) - 3,
751 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
752 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
753 OperandTraits<BranchInst>::op_end(this) - 1,
755 assert(IfTrue != 0 && "Branch destination may not be null!");
759 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
760 BasicBlock *InsertAtEnd)
761 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
762 OperandTraits<BranchInst>::op_end(this) - 3,
773 BranchInst::BranchInst(const BranchInst &BI) :
774 TerminatorInst(Type::getVoidTy(BI.getContext()), Instruction::Br,
775 OperandTraits<BranchInst>::op_end(this) - BI.getNumOperands(),
776 BI.getNumOperands()) {
777 Op<-1>() = BI.Op<-1>();
778 if (BI.getNumOperands() != 1) {
779 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
780 Op<-3>() = BI.Op<-3>();
781 Op<-2>() = BI.Op<-2>();
783 SubclassOptionalData = BI.SubclassOptionalData;
786 void BranchInst::swapSuccessors() {
787 assert(isConditional() &&
788 "Cannot swap successors of an unconditional branch");
789 Op<-1>().swap(Op<-2>());
791 // Update profile metadata if present and it matches our structural
793 MDNode *ProfileData = getMetadata(LLVMContext::MD_prof);
794 if (!ProfileData || ProfileData->getNumOperands() != 3)
797 // The first operand is the name. Fetch them backwards and build a new one.
799 ProfileData->getOperand(0),
800 ProfileData->getOperand(2),
801 ProfileData->getOperand(1)
803 setMetadata(LLVMContext::MD_prof,
804 MDNode::get(ProfileData->getContext(), Ops));
807 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
808 return getSuccessor(idx);
810 unsigned BranchInst::getNumSuccessorsV() const {
811 return getNumSuccessors();
813 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
814 setSuccessor(idx, B);
818 //===----------------------------------------------------------------------===//
819 // AllocaInst Implementation
820 //===----------------------------------------------------------------------===//
822 static Value *getAISize(LLVMContext &Context, Value *Amt) {
824 Amt = ConstantInt::get(Type::getInt32Ty(Context), 1);
826 assert(!isa<BasicBlock>(Amt) &&
827 "Passed basic block into allocation size parameter! Use other ctor");
828 assert(Amt->getType()->isIntegerTy() &&
829 "Allocation array size is not an integer!");
834 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize,
835 const Twine &Name, Instruction *InsertBefore)
836 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
837 getAISize(Ty->getContext(), ArraySize), InsertBefore) {
839 assert(!Ty->isVoidTy() && "Cannot allocate void!");
843 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize,
844 const Twine &Name, BasicBlock *InsertAtEnd)
845 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
846 getAISize(Ty->getContext(), ArraySize), InsertAtEnd) {
848 assert(!Ty->isVoidTy() && "Cannot allocate void!");
852 AllocaInst::AllocaInst(Type *Ty, const Twine &Name,
853 Instruction *InsertBefore)
854 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
855 getAISize(Ty->getContext(), 0), InsertBefore) {
857 assert(!Ty->isVoidTy() && "Cannot allocate void!");
861 AllocaInst::AllocaInst(Type *Ty, const Twine &Name,
862 BasicBlock *InsertAtEnd)
863 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
864 getAISize(Ty->getContext(), 0), InsertAtEnd) {
866 assert(!Ty->isVoidTy() && "Cannot allocate void!");
870 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize, unsigned Align,
871 const Twine &Name, Instruction *InsertBefore)
872 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
873 getAISize(Ty->getContext(), ArraySize), InsertBefore) {
875 assert(!Ty->isVoidTy() && "Cannot allocate void!");
879 AllocaInst::AllocaInst(Type *Ty, Value *ArraySize, unsigned Align,
880 const Twine &Name, BasicBlock *InsertAtEnd)
881 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
882 getAISize(Ty->getContext(), ArraySize), InsertAtEnd) {
884 assert(!Ty->isVoidTy() && "Cannot allocate void!");
888 // Out of line virtual method, so the vtable, etc has a home.
889 AllocaInst::~AllocaInst() {
892 void AllocaInst::setAlignment(unsigned Align) {
893 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
894 assert(Align <= MaximumAlignment &&
895 "Alignment is greater than MaximumAlignment!");
896 setInstructionSubclassData((getSubclassDataFromInstruction() & ~31) |
897 (Log2_32(Align) + 1));
898 assert(getAlignment() == Align && "Alignment representation error!");
901 bool AllocaInst::isArrayAllocation() const {
902 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
907 Type *AllocaInst::getAllocatedType() const {
908 return getType()->getElementType();
911 /// isStaticAlloca - Return true if this alloca is in the entry block of the
912 /// function and is a constant size. If so, the code generator will fold it
913 /// into the prolog/epilog code, so it is basically free.
914 bool AllocaInst::isStaticAlloca() const {
915 // Must be constant size.
916 if (!isa<ConstantInt>(getArraySize())) return false;
918 // Must be in the entry block.
919 const BasicBlock *Parent = getParent();
920 return Parent == &Parent->getParent()->front() && !isUsedWithInAlloca();
923 //===----------------------------------------------------------------------===//
924 // LoadInst Implementation
925 //===----------------------------------------------------------------------===//
927 void LoadInst::AssertOK() {
928 assert(getOperand(0)->getType()->isPointerTy() &&
929 "Ptr must have pointer type.");
930 assert(!(isAtomic() && getAlignment() == 0) &&
931 "Alignment required for atomic load");
934 LoadInst::LoadInst(Value *Ptr, const Twine &Name, Instruction *InsertBef)
935 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
936 Load, Ptr, InsertBef) {
939 setAtomic(NotAtomic);
944 LoadInst::LoadInst(Value *Ptr, const Twine &Name, BasicBlock *InsertAE)
945 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
946 Load, Ptr, InsertAE) {
949 setAtomic(NotAtomic);
954 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
955 Instruction *InsertBef)
956 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
957 Load, Ptr, InsertBef) {
958 setVolatile(isVolatile);
960 setAtomic(NotAtomic);
965 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
966 BasicBlock *InsertAE)
967 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
968 Load, Ptr, InsertAE) {
969 setVolatile(isVolatile);
971 setAtomic(NotAtomic);
976 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
977 unsigned Align, Instruction *InsertBef)
978 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
979 Load, Ptr, InsertBef) {
980 setVolatile(isVolatile);
982 setAtomic(NotAtomic);
987 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
988 unsigned Align, BasicBlock *InsertAE)
989 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
990 Load, Ptr, InsertAE) {
991 setVolatile(isVolatile);
993 setAtomic(NotAtomic);
998 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
999 unsigned Align, AtomicOrdering Order,
1000 SynchronizationScope SynchScope,
1001 Instruction *InsertBef)
1002 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1003 Load, Ptr, InsertBef) {
1004 setVolatile(isVolatile);
1005 setAlignment(Align);
1006 setAtomic(Order, SynchScope);
1011 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
1012 unsigned Align, AtomicOrdering Order,
1013 SynchronizationScope SynchScope,
1014 BasicBlock *InsertAE)
1015 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1016 Load, Ptr, InsertAE) {
1017 setVolatile(isVolatile);
1018 setAlignment(Align);
1019 setAtomic(Order, SynchScope);
1024 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
1025 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1026 Load, Ptr, InsertBef) {
1029 setAtomic(NotAtomic);
1031 if (Name && Name[0]) setName(Name);
1034 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
1035 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1036 Load, Ptr, InsertAE) {
1039 setAtomic(NotAtomic);
1041 if (Name && Name[0]) setName(Name);
1044 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
1045 Instruction *InsertBef)
1046 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1047 Load, Ptr, InsertBef) {
1048 setVolatile(isVolatile);
1050 setAtomic(NotAtomic);
1052 if (Name && Name[0]) setName(Name);
1055 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
1056 BasicBlock *InsertAE)
1057 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1058 Load, Ptr, InsertAE) {
1059 setVolatile(isVolatile);
1061 setAtomic(NotAtomic);
1063 if (Name && Name[0]) setName(Name);
1066 void LoadInst::setAlignment(unsigned Align) {
1067 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1068 assert(Align <= MaximumAlignment &&
1069 "Alignment is greater than MaximumAlignment!");
1070 setInstructionSubclassData((getSubclassDataFromInstruction() & ~(31 << 1)) |
1071 ((Log2_32(Align)+1)<<1));
1072 assert(getAlignment() == Align && "Alignment representation error!");
1075 //===----------------------------------------------------------------------===//
1076 // StoreInst Implementation
1077 //===----------------------------------------------------------------------===//
1079 void StoreInst::AssertOK() {
1080 assert(getOperand(0) && getOperand(1) && "Both operands must be non-null!");
1081 assert(getOperand(1)->getType()->isPointerTy() &&
1082 "Ptr must have pointer type!");
1083 assert(getOperand(0)->getType() ==
1084 cast<PointerType>(getOperand(1)->getType())->getElementType()
1085 && "Ptr must be a pointer to Val type!");
1086 assert(!(isAtomic() && getAlignment() == 0) &&
1087 "Alignment required for atomic store");
1091 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
1092 : Instruction(Type::getVoidTy(val->getContext()), Store,
1093 OperandTraits<StoreInst>::op_begin(this),
1094 OperandTraits<StoreInst>::operands(this),
1100 setAtomic(NotAtomic);
1104 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
1105 : Instruction(Type::getVoidTy(val->getContext()), Store,
1106 OperandTraits<StoreInst>::op_begin(this),
1107 OperandTraits<StoreInst>::operands(this),
1113 setAtomic(NotAtomic);
1117 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1118 Instruction *InsertBefore)
1119 : Instruction(Type::getVoidTy(val->getContext()), Store,
1120 OperandTraits<StoreInst>::op_begin(this),
1121 OperandTraits<StoreInst>::operands(this),
1125 setVolatile(isVolatile);
1127 setAtomic(NotAtomic);
1131 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1132 unsigned Align, Instruction *InsertBefore)
1133 : Instruction(Type::getVoidTy(val->getContext()), Store,
1134 OperandTraits<StoreInst>::op_begin(this),
1135 OperandTraits<StoreInst>::operands(this),
1139 setVolatile(isVolatile);
1140 setAlignment(Align);
1141 setAtomic(NotAtomic);
1145 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1146 unsigned Align, AtomicOrdering Order,
1147 SynchronizationScope SynchScope,
1148 Instruction *InsertBefore)
1149 : Instruction(Type::getVoidTy(val->getContext()), Store,
1150 OperandTraits<StoreInst>::op_begin(this),
1151 OperandTraits<StoreInst>::operands(this),
1155 setVolatile(isVolatile);
1156 setAlignment(Align);
1157 setAtomic(Order, SynchScope);
1161 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1162 BasicBlock *InsertAtEnd)
1163 : Instruction(Type::getVoidTy(val->getContext()), Store,
1164 OperandTraits<StoreInst>::op_begin(this),
1165 OperandTraits<StoreInst>::operands(this),
1169 setVolatile(isVolatile);
1171 setAtomic(NotAtomic);
1175 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1176 unsigned Align, BasicBlock *InsertAtEnd)
1177 : Instruction(Type::getVoidTy(val->getContext()), Store,
1178 OperandTraits<StoreInst>::op_begin(this),
1179 OperandTraits<StoreInst>::operands(this),
1183 setVolatile(isVolatile);
1184 setAlignment(Align);
1185 setAtomic(NotAtomic);
1189 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1190 unsigned Align, AtomicOrdering Order,
1191 SynchronizationScope SynchScope,
1192 BasicBlock *InsertAtEnd)
1193 : Instruction(Type::getVoidTy(val->getContext()), Store,
1194 OperandTraits<StoreInst>::op_begin(this),
1195 OperandTraits<StoreInst>::operands(this),
1199 setVolatile(isVolatile);
1200 setAlignment(Align);
1201 setAtomic(Order, SynchScope);
1205 void StoreInst::setAlignment(unsigned Align) {
1206 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1207 assert(Align <= MaximumAlignment &&
1208 "Alignment is greater than MaximumAlignment!");
1209 setInstructionSubclassData((getSubclassDataFromInstruction() & ~(31 << 1)) |
1210 ((Log2_32(Align)+1) << 1));
1211 assert(getAlignment() == Align && "Alignment representation error!");
1214 //===----------------------------------------------------------------------===//
1215 // AtomicCmpXchgInst Implementation
1216 //===----------------------------------------------------------------------===//
1218 void AtomicCmpXchgInst::Init(Value *Ptr, Value *Cmp, Value *NewVal,
1219 AtomicOrdering Ordering,
1220 SynchronizationScope SynchScope) {
1224 setOrdering(Ordering);
1225 setSynchScope(SynchScope);
1227 assert(getOperand(0) && getOperand(1) && getOperand(2) &&
1228 "All operands must be non-null!");
1229 assert(getOperand(0)->getType()->isPointerTy() &&
1230 "Ptr must have pointer type!");
1231 assert(getOperand(1)->getType() ==
1232 cast<PointerType>(getOperand(0)->getType())->getElementType()
1233 && "Ptr must be a pointer to Cmp type!");
1234 assert(getOperand(2)->getType() ==
1235 cast<PointerType>(getOperand(0)->getType())->getElementType()
1236 && "Ptr must be a pointer to NewVal type!");
1237 assert(Ordering != NotAtomic &&
1238 "AtomicCmpXchg instructions must be atomic!");
1241 AtomicCmpXchgInst::AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
1242 AtomicOrdering Ordering,
1243 SynchronizationScope SynchScope,
1244 Instruction *InsertBefore)
1245 : Instruction(Cmp->getType(), AtomicCmpXchg,
1246 OperandTraits<AtomicCmpXchgInst>::op_begin(this),
1247 OperandTraits<AtomicCmpXchgInst>::operands(this),
1249 Init(Ptr, Cmp, NewVal, Ordering, SynchScope);
1252 AtomicCmpXchgInst::AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
1253 AtomicOrdering Ordering,
1254 SynchronizationScope SynchScope,
1255 BasicBlock *InsertAtEnd)
1256 : Instruction(Cmp->getType(), AtomicCmpXchg,
1257 OperandTraits<AtomicCmpXchgInst>::op_begin(this),
1258 OperandTraits<AtomicCmpXchgInst>::operands(this),
1260 Init(Ptr, Cmp, NewVal, Ordering, SynchScope);
1263 //===----------------------------------------------------------------------===//
1264 // AtomicRMWInst Implementation
1265 //===----------------------------------------------------------------------===//
1267 void AtomicRMWInst::Init(BinOp Operation, Value *Ptr, Value *Val,
1268 AtomicOrdering Ordering,
1269 SynchronizationScope SynchScope) {
1272 setOperation(Operation);
1273 setOrdering(Ordering);
1274 setSynchScope(SynchScope);
1276 assert(getOperand(0) && getOperand(1) &&
1277 "All operands must be non-null!");
1278 assert(getOperand(0)->getType()->isPointerTy() &&
1279 "Ptr must have pointer type!");
1280 assert(getOperand(1)->getType() ==
1281 cast<PointerType>(getOperand(0)->getType())->getElementType()
1282 && "Ptr must be a pointer to Val type!");
1283 assert(Ordering != NotAtomic &&
1284 "AtomicRMW instructions must be atomic!");
1287 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
1288 AtomicOrdering Ordering,
1289 SynchronizationScope SynchScope,
1290 Instruction *InsertBefore)
1291 : Instruction(Val->getType(), AtomicRMW,
1292 OperandTraits<AtomicRMWInst>::op_begin(this),
1293 OperandTraits<AtomicRMWInst>::operands(this),
1295 Init(Operation, Ptr, Val, Ordering, SynchScope);
1298 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
1299 AtomicOrdering Ordering,
1300 SynchronizationScope SynchScope,
1301 BasicBlock *InsertAtEnd)
1302 : Instruction(Val->getType(), AtomicRMW,
1303 OperandTraits<AtomicRMWInst>::op_begin(this),
1304 OperandTraits<AtomicRMWInst>::operands(this),
1306 Init(Operation, Ptr, Val, Ordering, SynchScope);
1309 //===----------------------------------------------------------------------===//
1310 // FenceInst Implementation
1311 //===----------------------------------------------------------------------===//
1313 FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
1314 SynchronizationScope SynchScope,
1315 Instruction *InsertBefore)
1316 : Instruction(Type::getVoidTy(C), Fence, 0, 0, InsertBefore) {
1317 setOrdering(Ordering);
1318 setSynchScope(SynchScope);
1321 FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
1322 SynchronizationScope SynchScope,
1323 BasicBlock *InsertAtEnd)
1324 : Instruction(Type::getVoidTy(C), Fence, 0, 0, InsertAtEnd) {
1325 setOrdering(Ordering);
1326 setSynchScope(SynchScope);
1329 //===----------------------------------------------------------------------===//
1330 // GetElementPtrInst Implementation
1331 //===----------------------------------------------------------------------===//
1333 void GetElementPtrInst::init(Value *Ptr, ArrayRef<Value *> IdxList,
1334 const Twine &Name) {
1335 assert(NumOperands == 1 + IdxList.size() && "NumOperands not initialized?");
1336 OperandList[0] = Ptr;
1337 std::copy(IdxList.begin(), IdxList.end(), op_begin() + 1);
1341 GetElementPtrInst::GetElementPtrInst(const GetElementPtrInst &GEPI)
1342 : Instruction(GEPI.getType(), GetElementPtr,
1343 OperandTraits<GetElementPtrInst>::op_end(this)
1344 - GEPI.getNumOperands(),
1345 GEPI.getNumOperands()) {
1346 std::copy(GEPI.op_begin(), GEPI.op_end(), op_begin());
1347 SubclassOptionalData = GEPI.SubclassOptionalData;
1350 /// getIndexedType - Returns the type of the element that would be accessed with
1351 /// a gep instruction with the specified parameters.
1353 /// The Idxs pointer should point to a continuous piece of memory containing the
1354 /// indices, either as Value* or uint64_t.
1356 /// A null type is returned if the indices are invalid for the specified
1359 template <typename IndexTy>
1360 static Type *getIndexedTypeInternal(Type *Ptr, ArrayRef<IndexTy> IdxList) {
1361 PointerType *PTy = dyn_cast<PointerType>(Ptr->getScalarType());
1362 if (!PTy) return 0; // Type isn't a pointer type!
1363 Type *Agg = PTy->getElementType();
1365 // Handle the special case of the empty set index set, which is always valid.
1366 if (IdxList.empty())
1369 // If there is at least one index, the top level type must be sized, otherwise
1370 // it cannot be 'stepped over'.
1371 if (!Agg->isSized())
1374 unsigned CurIdx = 1;
1375 for (; CurIdx != IdxList.size(); ++CurIdx) {
1376 CompositeType *CT = dyn_cast<CompositeType>(Agg);
1377 if (!CT || CT->isPointerTy()) return 0;
1378 IndexTy Index = IdxList[CurIdx];
1379 if (!CT->indexValid(Index)) return 0;
1380 Agg = CT->getTypeAtIndex(Index);
1382 return CurIdx == IdxList.size() ? Agg : 0;
1385 Type *GetElementPtrInst::getIndexedType(Type *Ptr, ArrayRef<Value *> IdxList) {
1386 return getIndexedTypeInternal(Ptr, IdxList);
1389 Type *GetElementPtrInst::getIndexedType(Type *Ptr,
1390 ArrayRef<Constant *> IdxList) {
1391 return getIndexedTypeInternal(Ptr, IdxList);
1394 Type *GetElementPtrInst::getIndexedType(Type *Ptr, ArrayRef<uint64_t> IdxList) {
1395 return getIndexedTypeInternal(Ptr, IdxList);
1398 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
1399 /// zeros. If so, the result pointer and the first operand have the same
1400 /// value, just potentially different types.
1401 bool GetElementPtrInst::hasAllZeroIndices() const {
1402 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1403 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
1404 if (!CI->isZero()) return false;
1412 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
1413 /// constant integers. If so, the result pointer and the first operand have
1414 /// a constant offset between them.
1415 bool GetElementPtrInst::hasAllConstantIndices() const {
1416 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1417 if (!isa<ConstantInt>(getOperand(i)))
1423 void GetElementPtrInst::setIsInBounds(bool B) {
1424 cast<GEPOperator>(this)->setIsInBounds(B);
1427 bool GetElementPtrInst::isInBounds() const {
1428 return cast<GEPOperator>(this)->isInBounds();
1431 bool GetElementPtrInst::accumulateConstantOffset(const DataLayout &DL,
1432 APInt &Offset) const {
1433 // Delegate to the generic GEPOperator implementation.
1434 return cast<GEPOperator>(this)->accumulateConstantOffset(DL, Offset);
1437 //===----------------------------------------------------------------------===//
1438 // ExtractElementInst Implementation
1439 //===----------------------------------------------------------------------===//
1441 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1443 Instruction *InsertBef)
1444 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1446 OperandTraits<ExtractElementInst>::op_begin(this),
1448 assert(isValidOperands(Val, Index) &&
1449 "Invalid extractelement instruction operands!");
1455 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1457 BasicBlock *InsertAE)
1458 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1460 OperandTraits<ExtractElementInst>::op_begin(this),
1462 assert(isValidOperands(Val, Index) &&
1463 "Invalid extractelement instruction operands!");
1471 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
1472 if (!Val->getType()->isVectorTy() || !Index->getType()->isIntegerTy(32))
1478 //===----------------------------------------------------------------------===//
1479 // InsertElementInst Implementation
1480 //===----------------------------------------------------------------------===//
1482 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1484 Instruction *InsertBef)
1485 : Instruction(Vec->getType(), InsertElement,
1486 OperandTraits<InsertElementInst>::op_begin(this),
1488 assert(isValidOperands(Vec, Elt, Index) &&
1489 "Invalid insertelement instruction operands!");
1496 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1498 BasicBlock *InsertAE)
1499 : Instruction(Vec->getType(), InsertElement,
1500 OperandTraits<InsertElementInst>::op_begin(this),
1502 assert(isValidOperands(Vec, Elt, Index) &&
1503 "Invalid insertelement instruction operands!");
1511 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
1512 const Value *Index) {
1513 if (!Vec->getType()->isVectorTy())
1514 return false; // First operand of insertelement must be vector type.
1516 if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
1517 return false;// Second operand of insertelement must be vector element type.
1519 if (!Index->getType()->isIntegerTy(32))
1520 return false; // Third operand of insertelement must be i32.
1525 //===----------------------------------------------------------------------===//
1526 // ShuffleVectorInst Implementation
1527 //===----------------------------------------------------------------------===//
1529 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1531 Instruction *InsertBefore)
1532 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1533 cast<VectorType>(Mask->getType())->getNumElements()),
1535 OperandTraits<ShuffleVectorInst>::op_begin(this),
1536 OperandTraits<ShuffleVectorInst>::operands(this),
1538 assert(isValidOperands(V1, V2, Mask) &&
1539 "Invalid shuffle vector instruction operands!");
1546 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1548 BasicBlock *InsertAtEnd)
1549 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1550 cast<VectorType>(Mask->getType())->getNumElements()),
1552 OperandTraits<ShuffleVectorInst>::op_begin(this),
1553 OperandTraits<ShuffleVectorInst>::operands(this),
1555 assert(isValidOperands(V1, V2, Mask) &&
1556 "Invalid shuffle vector instruction operands!");
1564 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1565 const Value *Mask) {
1566 // V1 and V2 must be vectors of the same type.
1567 if (!V1->getType()->isVectorTy() || V1->getType() != V2->getType())
1570 // Mask must be vector of i32.
1571 VectorType *MaskTy = dyn_cast<VectorType>(Mask->getType());
1572 if (MaskTy == 0 || !MaskTy->getElementType()->isIntegerTy(32))
1575 // Check to see if Mask is valid.
1576 if (isa<UndefValue>(Mask) || isa<ConstantAggregateZero>(Mask))
1579 if (const ConstantVector *MV = dyn_cast<ConstantVector>(Mask)) {
1580 unsigned V1Size = cast<VectorType>(V1->getType())->getNumElements();
1581 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
1582 if (ConstantInt *CI = dyn_cast<ConstantInt>(MV->getOperand(i))) {
1583 if (CI->uge(V1Size*2))
1585 } else if (!isa<UndefValue>(MV->getOperand(i))) {
1592 if (const ConstantDataSequential *CDS =
1593 dyn_cast<ConstantDataSequential>(Mask)) {
1594 unsigned V1Size = cast<VectorType>(V1->getType())->getNumElements();
1595 for (unsigned i = 0, e = MaskTy->getNumElements(); i != e; ++i)
1596 if (CDS->getElementAsInteger(i) >= V1Size*2)
1601 // The bitcode reader can create a place holder for a forward reference
1602 // used as the shuffle mask. When this occurs, the shuffle mask will
1603 // fall into this case and fail. To avoid this error, do this bit of
1604 // ugliness to allow such a mask pass.
1605 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(Mask))
1606 if (CE->getOpcode() == Instruction::UserOp1)
1612 /// getMaskValue - Return the index from the shuffle mask for the specified
1613 /// output result. This is either -1 if the element is undef or a number less
1614 /// than 2*numelements.
1615 int ShuffleVectorInst::getMaskValue(Constant *Mask, unsigned i) {
1616 assert(i < Mask->getType()->getVectorNumElements() && "Index out of range");
1617 if (ConstantDataSequential *CDS =dyn_cast<ConstantDataSequential>(Mask))
1618 return CDS->getElementAsInteger(i);
1619 Constant *C = Mask->getAggregateElement(i);
1620 if (isa<UndefValue>(C))
1622 return cast<ConstantInt>(C)->getZExtValue();
1625 /// getShuffleMask - Return the full mask for this instruction, where each
1626 /// element is the element number and undef's are returned as -1.
1627 void ShuffleVectorInst::getShuffleMask(Constant *Mask,
1628 SmallVectorImpl<int> &Result) {
1629 unsigned NumElts = Mask->getType()->getVectorNumElements();
1631 if (ConstantDataSequential *CDS=dyn_cast<ConstantDataSequential>(Mask)) {
1632 for (unsigned i = 0; i != NumElts; ++i)
1633 Result.push_back(CDS->getElementAsInteger(i));
1636 for (unsigned i = 0; i != NumElts; ++i) {
1637 Constant *C = Mask->getAggregateElement(i);
1638 Result.push_back(isa<UndefValue>(C) ? -1 :
1639 cast<ConstantInt>(C)->getZExtValue());
1644 //===----------------------------------------------------------------------===//
1645 // InsertValueInst Class
1646 //===----------------------------------------------------------------------===//
1648 void InsertValueInst::init(Value *Agg, Value *Val, ArrayRef<unsigned> Idxs,
1649 const Twine &Name) {
1650 assert(NumOperands == 2 && "NumOperands not initialized?");
1652 // There's no fundamental reason why we require at least one index
1653 // (other than weirdness with &*IdxBegin being invalid; see
1654 // getelementptr's init routine for example). But there's no
1655 // present need to support it.
1656 assert(Idxs.size() > 0 && "InsertValueInst must have at least one index");
1658 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs) ==
1659 Val->getType() && "Inserted value must match indexed type!");
1663 Indices.append(Idxs.begin(), Idxs.end());
1667 InsertValueInst::InsertValueInst(const InsertValueInst &IVI)
1668 : Instruction(IVI.getType(), InsertValue,
1669 OperandTraits<InsertValueInst>::op_begin(this), 2),
1670 Indices(IVI.Indices) {
1671 Op<0>() = IVI.getOperand(0);
1672 Op<1>() = IVI.getOperand(1);
1673 SubclassOptionalData = IVI.SubclassOptionalData;
1676 //===----------------------------------------------------------------------===//
1677 // ExtractValueInst Class
1678 //===----------------------------------------------------------------------===//
1680 void ExtractValueInst::init(ArrayRef<unsigned> Idxs, const Twine &Name) {
1681 assert(NumOperands == 1 && "NumOperands not initialized?");
1683 // There's no fundamental reason why we require at least one index.
1684 // But there's no present need to support it.
1685 assert(Idxs.size() > 0 && "ExtractValueInst must have at least one index");
1687 Indices.append(Idxs.begin(), Idxs.end());
1691 ExtractValueInst::ExtractValueInst(const ExtractValueInst &EVI)
1692 : UnaryInstruction(EVI.getType(), ExtractValue, EVI.getOperand(0)),
1693 Indices(EVI.Indices) {
1694 SubclassOptionalData = EVI.SubclassOptionalData;
1697 // getIndexedType - Returns the type of the element that would be extracted
1698 // with an extractvalue instruction with the specified parameters.
1700 // A null type is returned if the indices are invalid for the specified
1703 Type *ExtractValueInst::getIndexedType(Type *Agg,
1704 ArrayRef<unsigned> Idxs) {
1705 for (unsigned CurIdx = 0; CurIdx != Idxs.size(); ++CurIdx) {
1706 unsigned Index = Idxs[CurIdx];
1707 // We can't use CompositeType::indexValid(Index) here.
1708 // indexValid() always returns true for arrays because getelementptr allows
1709 // out-of-bounds indices. Since we don't allow those for extractvalue and
1710 // insertvalue we need to check array indexing manually.
1711 // Since the only other types we can index into are struct types it's just
1712 // as easy to check those manually as well.
1713 if (ArrayType *AT = dyn_cast<ArrayType>(Agg)) {
1714 if (Index >= AT->getNumElements())
1716 } else if (StructType *ST = dyn_cast<StructType>(Agg)) {
1717 if (Index >= ST->getNumElements())
1720 // Not a valid type to index into.
1724 Agg = cast<CompositeType>(Agg)->getTypeAtIndex(Index);
1726 return const_cast<Type*>(Agg);
1729 //===----------------------------------------------------------------------===//
1730 // BinaryOperator Class
1731 //===----------------------------------------------------------------------===//
1733 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1734 Type *Ty, const Twine &Name,
1735 Instruction *InsertBefore)
1736 : Instruction(Ty, iType,
1737 OperandTraits<BinaryOperator>::op_begin(this),
1738 OperandTraits<BinaryOperator>::operands(this),
1746 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1747 Type *Ty, const Twine &Name,
1748 BasicBlock *InsertAtEnd)
1749 : Instruction(Ty, iType,
1750 OperandTraits<BinaryOperator>::op_begin(this),
1751 OperandTraits<BinaryOperator>::operands(this),
1760 void BinaryOperator::init(BinaryOps iType) {
1761 Value *LHS = getOperand(0), *RHS = getOperand(1);
1762 (void)LHS; (void)RHS; // Silence warnings.
1763 assert(LHS->getType() == RHS->getType() &&
1764 "Binary operator operand types must match!");
1769 assert(getType() == LHS->getType() &&
1770 "Arithmetic operation should return same type as operands!");
1771 assert(getType()->isIntOrIntVectorTy() &&
1772 "Tried to create an integer operation on a non-integer type!");
1774 case FAdd: case FSub:
1776 assert(getType() == LHS->getType() &&
1777 "Arithmetic operation should return same type as operands!");
1778 assert(getType()->isFPOrFPVectorTy() &&
1779 "Tried to create a floating-point operation on a "
1780 "non-floating-point type!");
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/UDIV");
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 FDIV");
1798 assert(getType() == LHS->getType() &&
1799 "Arithmetic operation should return same type as operands!");
1800 assert((getType()->isIntegerTy() || (getType()->isVectorTy() &&
1801 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1802 "Incorrect operand type (not integer) for S/UREM");
1805 assert(getType() == LHS->getType() &&
1806 "Arithmetic operation should return same type as operands!");
1807 assert(getType()->isFPOrFPVectorTy() &&
1808 "Incorrect operand type (not floating point) for FREM");
1813 assert(getType() == LHS->getType() &&
1814 "Shift operation should return same type as operands!");
1815 assert((getType()->isIntegerTy() ||
1816 (getType()->isVectorTy() &&
1817 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1818 "Tried to create a shift operation on a non-integral type!");
1822 assert(getType() == LHS->getType() &&
1823 "Logical operation should return same type as operands!");
1824 assert((getType()->isIntegerTy() ||
1825 (getType()->isVectorTy() &&
1826 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1827 "Tried to create a logical operation on a non-integral type!");
1835 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1837 Instruction *InsertBefore) {
1838 assert(S1->getType() == S2->getType() &&
1839 "Cannot create binary operator with two operands of differing type!");
1840 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1843 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1845 BasicBlock *InsertAtEnd) {
1846 BinaryOperator *Res = Create(Op, S1, S2, Name);
1847 InsertAtEnd->getInstList().push_back(Res);
1851 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1852 Instruction *InsertBefore) {
1853 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1854 return new BinaryOperator(Instruction::Sub,
1856 Op->getType(), Name, InsertBefore);
1859 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1860 BasicBlock *InsertAtEnd) {
1861 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1862 return new BinaryOperator(Instruction::Sub,
1864 Op->getType(), Name, InsertAtEnd);
1867 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1868 Instruction *InsertBefore) {
1869 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1870 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertBefore);
1873 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1874 BasicBlock *InsertAtEnd) {
1875 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1876 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertAtEnd);
1879 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1880 Instruction *InsertBefore) {
1881 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1882 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertBefore);
1885 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1886 BasicBlock *InsertAtEnd) {
1887 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1888 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertAtEnd);
1891 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1892 Instruction *InsertBefore) {
1893 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1894 return new BinaryOperator(Instruction::FSub, zero, Op,
1895 Op->getType(), Name, InsertBefore);
1898 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1899 BasicBlock *InsertAtEnd) {
1900 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1901 return new BinaryOperator(Instruction::FSub, zero, Op,
1902 Op->getType(), Name, InsertAtEnd);
1905 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1906 Instruction *InsertBefore) {
1907 Constant *C = Constant::getAllOnesValue(Op->getType());
1908 return new BinaryOperator(Instruction::Xor, Op, C,
1909 Op->getType(), Name, InsertBefore);
1912 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1913 BasicBlock *InsertAtEnd) {
1914 Constant *AllOnes = Constant::getAllOnesValue(Op->getType());
1915 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1916 Op->getType(), Name, InsertAtEnd);
1920 // isConstantAllOnes - Helper function for several functions below
1921 static inline bool isConstantAllOnes(const Value *V) {
1922 if (const Constant *C = dyn_cast<Constant>(V))
1923 return C->isAllOnesValue();
1927 bool BinaryOperator::isNeg(const Value *V) {
1928 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1929 if (Bop->getOpcode() == Instruction::Sub)
1930 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0)))
1931 return C->isNegativeZeroValue();
1935 bool BinaryOperator::isFNeg(const Value *V, bool IgnoreZeroSign) {
1936 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1937 if (Bop->getOpcode() == Instruction::FSub)
1938 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0))) {
1939 if (!IgnoreZeroSign)
1940 IgnoreZeroSign = cast<Instruction>(V)->hasNoSignedZeros();
1941 return !IgnoreZeroSign ? C->isNegativeZeroValue() : C->isZeroValue();
1946 bool BinaryOperator::isNot(const Value *V) {
1947 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1948 return (Bop->getOpcode() == Instruction::Xor &&
1949 (isConstantAllOnes(Bop->getOperand(1)) ||
1950 isConstantAllOnes(Bop->getOperand(0))));
1954 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1955 return cast<BinaryOperator>(BinOp)->getOperand(1);
1958 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1959 return getNegArgument(const_cast<Value*>(BinOp));
1962 Value *BinaryOperator::getFNegArgument(Value *BinOp) {
1963 return cast<BinaryOperator>(BinOp)->getOperand(1);
1966 const Value *BinaryOperator::getFNegArgument(const Value *BinOp) {
1967 return getFNegArgument(const_cast<Value*>(BinOp));
1970 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1971 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1972 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1973 Value *Op0 = BO->getOperand(0);
1974 Value *Op1 = BO->getOperand(1);
1975 if (isConstantAllOnes(Op0)) return Op1;
1977 assert(isConstantAllOnes(Op1));
1981 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1982 return getNotArgument(const_cast<Value*>(BinOp));
1986 // swapOperands - Exchange the two operands to this instruction. This
1987 // instruction is safe to use on any binary instruction and does not
1988 // modify the semantics of the instruction. If the instruction is
1989 // order dependent (SetLT f.e.) the opcode is changed.
1991 bool BinaryOperator::swapOperands() {
1992 if (!isCommutative())
1993 return true; // Can't commute operands
1994 Op<0>().swap(Op<1>());
1998 void BinaryOperator::setHasNoUnsignedWrap(bool b) {
1999 cast<OverflowingBinaryOperator>(this)->setHasNoUnsignedWrap(b);
2002 void BinaryOperator::setHasNoSignedWrap(bool b) {
2003 cast<OverflowingBinaryOperator>(this)->setHasNoSignedWrap(b);
2006 void BinaryOperator::setIsExact(bool b) {
2007 cast<PossiblyExactOperator>(this)->setIsExact(b);
2010 bool BinaryOperator::hasNoUnsignedWrap() const {
2011 return cast<OverflowingBinaryOperator>(this)->hasNoUnsignedWrap();
2014 bool BinaryOperator::hasNoSignedWrap() const {
2015 return cast<OverflowingBinaryOperator>(this)->hasNoSignedWrap();
2018 bool BinaryOperator::isExact() const {
2019 return cast<PossiblyExactOperator>(this)->isExact();
2022 //===----------------------------------------------------------------------===//
2023 // FPMathOperator Class
2024 //===----------------------------------------------------------------------===//
2026 /// getFPAccuracy - Get the maximum error permitted by this operation in ULPs.
2027 /// An accuracy of 0.0 means that the operation should be performed with the
2028 /// default precision.
2029 float FPMathOperator::getFPAccuracy() const {
2031 cast<Instruction>(this)->getMetadata(LLVMContext::MD_fpmath);
2034 ConstantFP *Accuracy = cast<ConstantFP>(MD->getOperand(0));
2035 return Accuracy->getValueAPF().convertToFloat();
2039 //===----------------------------------------------------------------------===//
2041 //===----------------------------------------------------------------------===//
2043 void CastInst::anchor() {}
2045 // Just determine if this cast only deals with integral->integral conversion.
2046 bool CastInst::isIntegerCast() const {
2047 switch (getOpcode()) {
2048 default: return false;
2049 case Instruction::ZExt:
2050 case Instruction::SExt:
2051 case Instruction::Trunc:
2053 case Instruction::BitCast:
2054 return getOperand(0)->getType()->isIntegerTy() &&
2055 getType()->isIntegerTy();
2059 bool CastInst::isLosslessCast() const {
2060 // Only BitCast can be lossless, exit fast if we're not BitCast
2061 if (getOpcode() != Instruction::BitCast)
2064 // Identity cast is always lossless
2065 Type* SrcTy = getOperand(0)->getType();
2066 Type* DstTy = getType();
2070 // Pointer to pointer is always lossless.
2071 if (SrcTy->isPointerTy())
2072 return DstTy->isPointerTy();
2073 return false; // Other types have no identity values
2076 /// This function determines if the CastInst does not require any bits to be
2077 /// changed in order to effect the cast. Essentially, it identifies cases where
2078 /// no code gen is necessary for the cast, hence the name no-op cast. For
2079 /// example, the following are all no-op casts:
2080 /// # bitcast i32* %x to i8*
2081 /// # bitcast <2 x i32> %x to <4 x i16>
2082 /// # ptrtoint i32* %x to i32 ; on 32-bit plaforms only
2083 /// @brief Determine if the described cast is a no-op.
2084 bool CastInst::isNoopCast(Instruction::CastOps Opcode,
2089 default: llvm_unreachable("Invalid CastOp");
2090 case Instruction::Trunc:
2091 case Instruction::ZExt:
2092 case Instruction::SExt:
2093 case Instruction::FPTrunc:
2094 case Instruction::FPExt:
2095 case Instruction::UIToFP:
2096 case Instruction::SIToFP:
2097 case Instruction::FPToUI:
2098 case Instruction::FPToSI:
2099 case Instruction::AddrSpaceCast:
2100 // TODO: Target informations may give a more accurate answer here.
2102 case Instruction::BitCast:
2103 return true; // BitCast never modifies bits.
2104 case Instruction::PtrToInt:
2105 return IntPtrTy->getScalarSizeInBits() ==
2106 DestTy->getScalarSizeInBits();
2107 case Instruction::IntToPtr:
2108 return IntPtrTy->getScalarSizeInBits() ==
2109 SrcTy->getScalarSizeInBits();
2113 /// @brief Determine if a cast is a no-op.
2114 bool CastInst::isNoopCast(Type *IntPtrTy) const {
2115 return isNoopCast(getOpcode(), getOperand(0)->getType(), getType(), IntPtrTy);
2118 /// This function determines if a pair of casts can be eliminated and what
2119 /// opcode should be used in the elimination. This assumes that there are two
2120 /// instructions like this:
2121 /// * %F = firstOpcode SrcTy %x to MidTy
2122 /// * %S = secondOpcode MidTy %F to DstTy
2123 /// The function returns a resultOpcode so these two casts can be replaced with:
2124 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
2125 /// If no such cast is permited, the function returns 0.
2126 unsigned CastInst::isEliminableCastPair(
2127 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
2128 Type *SrcTy, Type *MidTy, Type *DstTy, Type *SrcIntPtrTy, Type *MidIntPtrTy,
2129 Type *DstIntPtrTy) {
2130 // Define the 144 possibilities for these two cast instructions. The values
2131 // in this matrix determine what to do in a given situation and select the
2132 // case in the switch below. The rows correspond to firstOp, the columns
2133 // correspond to secondOp. In looking at the table below, keep in mind
2134 // the following cast properties:
2136 // Size Compare Source Destination
2137 // Operator Src ? Size Type Sign Type Sign
2138 // -------- ------------ ------------------- ---------------------
2139 // TRUNC > Integer Any Integral Any
2140 // ZEXT < Integral Unsigned Integer Any
2141 // SEXT < Integral Signed Integer Any
2142 // FPTOUI n/a FloatPt n/a Integral Unsigned
2143 // FPTOSI n/a FloatPt n/a Integral Signed
2144 // UITOFP n/a Integral Unsigned FloatPt n/a
2145 // SITOFP n/a Integral Signed FloatPt n/a
2146 // FPTRUNC > FloatPt n/a FloatPt n/a
2147 // FPEXT < FloatPt n/a FloatPt n/a
2148 // PTRTOINT n/a Pointer n/a Integral Unsigned
2149 // INTTOPTR n/a Integral Unsigned Pointer n/a
2150 // BITCAST = FirstClass n/a FirstClass n/a
2151 // ADDRSPCST n/a Pointer n/a Pointer n/a
2153 // NOTE: some transforms are safe, but we consider them to be non-profitable.
2154 // For example, we could merge "fptoui double to i32" + "zext i32 to i64",
2155 // into "fptoui double to i64", but this loses information about the range
2156 // of the produced value (we no longer know the top-part is all zeros).
2157 // Further this conversion is often much more expensive for typical hardware,
2158 // and causes issues when building libgcc. We disallow fptosi+sext for the
2160 const unsigned numCastOps =
2161 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
2162 static const uint8_t CastResults[numCastOps][numCastOps] = {
2163 // T F F U S F F P I B A -+
2164 // R Z S P P I I T P 2 N T S |
2165 // U E E 2 2 2 2 R E I T C C +- secondOp
2166 // N X X U S F F N X N 2 V V |
2167 // C T T I I P P C T T P T T -+
2168 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3, 0}, // Trunc -+
2169 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3, 0}, // ZExt |
2170 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3, 0}, // SExt |
2171 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3, 0}, // FPToUI |
2172 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3, 0}, // FPToSI |
2173 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4, 0}, // UIToFP +- firstOp
2174 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4, 0}, // SIToFP |
2175 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4, 0}, // FPTrunc |
2176 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4, 0}, // FPExt |
2177 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3, 0}, // PtrToInt |
2178 { 99,99,99,99,99,99,99,99,99,11,99,15, 0}, // IntToPtr |
2179 { 5, 5, 5, 6, 6, 5, 5, 6, 6,16, 5, 1,14}, // BitCast |
2180 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,13,12}, // AddrSpaceCast -+
2183 // If either of the casts are a bitcast from scalar to vector, disallow the
2184 // merging. However, bitcast of A->B->A are allowed.
2185 bool isFirstBitcast = (firstOp == Instruction::BitCast);
2186 bool isSecondBitcast = (secondOp == Instruction::BitCast);
2187 bool chainedBitcast = (SrcTy == DstTy && isFirstBitcast && isSecondBitcast);
2189 // Check if any of the bitcasts convert scalars<->vectors.
2190 if ((isFirstBitcast && isa<VectorType>(SrcTy) != isa<VectorType>(MidTy)) ||
2191 (isSecondBitcast && isa<VectorType>(MidTy) != isa<VectorType>(DstTy)))
2192 // Unless we are bitcasing to the original type, disallow optimizations.
2193 if (!chainedBitcast) return 0;
2195 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
2196 [secondOp-Instruction::CastOpsBegin];
2199 // Categorically disallowed.
2202 // Allowed, use first cast's opcode.
2205 // Allowed, use second cast's opcode.
2208 // No-op cast in second op implies firstOp as long as the DestTy
2209 // is integer and we are not converting between a vector and a
2211 if (!SrcTy->isVectorTy() && DstTy->isIntegerTy())
2215 // No-op cast in second op implies firstOp as long as the DestTy
2216 // is floating point.
2217 if (DstTy->isFloatingPointTy())
2221 // No-op cast in first op implies secondOp as long as the SrcTy
2223 if (SrcTy->isIntegerTy())
2227 // No-op cast in first op implies secondOp as long as the SrcTy
2228 // is a floating point.
2229 if (SrcTy->isFloatingPointTy())
2233 // Cannot simplify if address spaces are different!
2234 if (SrcTy->getPointerAddressSpace() != DstTy->getPointerAddressSpace())
2237 unsigned MidSize = MidTy->getScalarSizeInBits();
2238 // We can still fold this without knowing the actual sizes as long we
2239 // know that the intermediate pointer is the largest possible
2241 // FIXME: Is this always true?
2243 return Instruction::BitCast;
2245 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size.
2246 if (!SrcIntPtrTy || DstIntPtrTy != SrcIntPtrTy)
2248 unsigned PtrSize = SrcIntPtrTy->getScalarSizeInBits();
2249 if (MidSize >= PtrSize)
2250 return Instruction::BitCast;
2254 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
2255 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
2256 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
2257 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2258 unsigned DstSize = DstTy->getScalarSizeInBits();
2259 if (SrcSize == DstSize)
2260 return Instruction::BitCast;
2261 else if (SrcSize < DstSize)
2266 // zext, sext -> zext, because sext can't sign extend after zext
2267 return Instruction::ZExt;
2269 // fpext followed by ftrunc is allowed if the bit size returned to is
2270 // the same as the original, in which case its just a bitcast
2272 return Instruction::BitCast;
2273 return 0; // If the types are not the same we can't eliminate it.
2275 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
2278 unsigned PtrSize = MidIntPtrTy->getScalarSizeInBits();
2279 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2280 unsigned DstSize = DstTy->getScalarSizeInBits();
2281 if (SrcSize <= PtrSize && SrcSize == DstSize)
2282 return Instruction::BitCast;
2286 // addrspacecast, addrspacecast -> bitcast, if SrcAS == DstAS
2287 // addrspacecast, addrspacecast -> addrspacecast, if SrcAS != DstAS
2288 if (SrcTy->getPointerAddressSpace() != DstTy->getPointerAddressSpace())
2289 return Instruction::AddrSpaceCast;
2290 return Instruction::BitCast;
2293 // FIXME: this state can be merged with (1), but the following assert
2294 // is useful to check the correcteness of the sequence due to semantic
2295 // change of bitcast.
2297 SrcTy->isPtrOrPtrVectorTy() &&
2298 MidTy->isPtrOrPtrVectorTy() &&
2299 DstTy->isPtrOrPtrVectorTy() &&
2300 SrcTy->getPointerAddressSpace() != MidTy->getPointerAddressSpace() &&
2301 MidTy->getPointerAddressSpace() == DstTy->getPointerAddressSpace() &&
2302 "Illegal addrspacecast, bitcast sequence!");
2303 // Allowed, use first cast's opcode
2306 // FIXME: this state can be merged with (2), but the following assert
2307 // is useful to check the correcteness of the sequence due to semantic
2308 // change of bitcast.
2310 SrcTy->isPtrOrPtrVectorTy() &&
2311 MidTy->isPtrOrPtrVectorTy() &&
2312 DstTy->isPtrOrPtrVectorTy() &&
2313 SrcTy->getPointerAddressSpace() == MidTy->getPointerAddressSpace() &&
2314 MidTy->getPointerAddressSpace() != DstTy->getPointerAddressSpace() &&
2315 "Illegal bitcast, addrspacecast sequence!");
2316 // Allowed, use second cast's opcode
2319 // FIXME: this state can be merged with (1), but the following assert
2320 // is useful to check the correcteness of the sequence due to semantic
2321 // change of bitcast.
2323 SrcTy->isIntOrIntVectorTy() &&
2324 MidTy->isPtrOrPtrVectorTy() &&
2325 DstTy->isPtrOrPtrVectorTy() &&
2326 MidTy->getPointerAddressSpace() == DstTy->getPointerAddressSpace() &&
2327 "Illegal inttoptr, bitcast sequence!");
2328 // Allowed, use first cast's opcode
2331 // FIXME: this state can be merged with (2), but the following assert
2332 // is useful to check the correcteness of the sequence due to semantic
2333 // change of bitcast.
2335 SrcTy->isPtrOrPtrVectorTy() &&
2336 MidTy->isPtrOrPtrVectorTy() &&
2337 DstTy->isIntOrIntVectorTy() &&
2338 SrcTy->getPointerAddressSpace() == MidTy->getPointerAddressSpace() &&
2339 "Illegal bitcast, ptrtoint sequence!");
2340 // Allowed, use second cast's opcode
2343 // Cast combination can't happen (error in input). This is for all cases
2344 // where the MidTy is not the same for the two cast instructions.
2345 llvm_unreachable("Invalid Cast Combination");
2347 llvm_unreachable("Error in CastResults table!!!");
2351 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2352 const Twine &Name, Instruction *InsertBefore) {
2353 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2354 // Construct and return the appropriate CastInst subclass
2356 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
2357 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
2358 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
2359 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
2360 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
2361 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
2362 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
2363 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
2364 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
2365 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
2366 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
2367 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
2368 case AddrSpaceCast: return new AddrSpaceCastInst (S, Ty, Name, InsertBefore);
2369 default: llvm_unreachable("Invalid opcode provided");
2373 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2374 const Twine &Name, BasicBlock *InsertAtEnd) {
2375 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2376 // Construct and return the appropriate CastInst subclass
2378 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
2379 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
2380 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
2381 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
2382 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
2383 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
2384 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
2385 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
2386 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
2387 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
2388 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
2389 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
2390 case AddrSpaceCast: return new AddrSpaceCastInst (S, Ty, Name, InsertAtEnd);
2391 default: llvm_unreachable("Invalid opcode provided");
2395 CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
2397 Instruction *InsertBefore) {
2398 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2399 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2400 return Create(Instruction::ZExt, S, Ty, Name, InsertBefore);
2403 CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
2405 BasicBlock *InsertAtEnd) {
2406 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2407 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2408 return Create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
2411 CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
2413 Instruction *InsertBefore) {
2414 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2415 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2416 return Create(Instruction::SExt, S, Ty, Name, InsertBefore);
2419 CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
2421 BasicBlock *InsertAtEnd) {
2422 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2423 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2424 return Create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
2427 CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
2429 Instruction *InsertBefore) {
2430 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2431 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2432 return Create(Instruction::Trunc, S, Ty, Name, InsertBefore);
2435 CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
2437 BasicBlock *InsertAtEnd) {
2438 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2439 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2440 return Create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
2443 CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
2445 BasicBlock *InsertAtEnd) {
2446 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
2447 assert((Ty->isIntOrIntVectorTy() || Ty->isPtrOrPtrVectorTy()) &&
2449 assert(Ty->isVectorTy() == S->getType()->isVectorTy() && "Invalid cast");
2450 assert((!Ty->isVectorTy() ||
2451 Ty->getVectorNumElements() == S->getType()->getVectorNumElements()) &&
2454 if (Ty->isIntOrIntVectorTy())
2455 return Create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
2457 Type *STy = S->getType();
2458 if (STy->getPointerAddressSpace() != Ty->getPointerAddressSpace())
2459 return Create(Instruction::AddrSpaceCast, S, Ty, Name, InsertAtEnd);
2461 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2464 /// @brief Create a BitCast or a PtrToInt cast instruction
2465 CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
2467 Instruction *InsertBefore) {
2468 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
2469 assert((Ty->isIntOrIntVectorTy() || Ty->isPtrOrPtrVectorTy()) &&
2471 assert(Ty->isVectorTy() == S->getType()->isVectorTy() && "Invalid cast");
2472 assert((!Ty->isVectorTy() ||
2473 Ty->getVectorNumElements() == S->getType()->getVectorNumElements()) &&
2476 if (Ty->isIntOrIntVectorTy())
2477 return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
2479 Type *STy = S->getType();
2480 if (STy->getPointerAddressSpace() != Ty->getPointerAddressSpace())
2481 return Create(Instruction::AddrSpaceCast, S, Ty, Name, InsertBefore);
2483 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2486 CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
2487 bool isSigned, const Twine &Name,
2488 Instruction *InsertBefore) {
2489 assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&
2490 "Invalid integer cast");
2491 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2492 unsigned DstBits = Ty->getScalarSizeInBits();
2493 Instruction::CastOps opcode =
2494 (SrcBits == DstBits ? Instruction::BitCast :
2495 (SrcBits > DstBits ? Instruction::Trunc :
2496 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2497 return Create(opcode, C, Ty, Name, InsertBefore);
2500 CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
2501 bool isSigned, const Twine &Name,
2502 BasicBlock *InsertAtEnd) {
2503 assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&
2505 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2506 unsigned DstBits = Ty->getScalarSizeInBits();
2507 Instruction::CastOps opcode =
2508 (SrcBits == DstBits ? Instruction::BitCast :
2509 (SrcBits > DstBits ? Instruction::Trunc :
2510 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2511 return Create(opcode, C, Ty, Name, InsertAtEnd);
2514 CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
2516 Instruction *InsertBefore) {
2517 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
2519 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2520 unsigned DstBits = Ty->getScalarSizeInBits();
2521 Instruction::CastOps opcode =
2522 (SrcBits == DstBits ? Instruction::BitCast :
2523 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2524 return Create(opcode, C, Ty, Name, InsertBefore);
2527 CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
2529 BasicBlock *InsertAtEnd) {
2530 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
2532 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2533 unsigned DstBits = Ty->getScalarSizeInBits();
2534 Instruction::CastOps opcode =
2535 (SrcBits == DstBits ? Instruction::BitCast :
2536 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2537 return Create(opcode, C, Ty, Name, InsertAtEnd);
2540 // Check whether it is valid to call getCastOpcode for these types.
2541 // This routine must be kept in sync with getCastOpcode.
2542 bool CastInst::isCastable(Type *SrcTy, Type *DestTy) {
2543 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2546 if (SrcTy == DestTy)
2549 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy))
2550 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy))
2551 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2552 // An element by element cast. Valid if casting the elements is valid.
2553 SrcTy = SrcVecTy->getElementType();
2554 DestTy = DestVecTy->getElementType();
2557 // Get the bit sizes, we'll need these
2558 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2559 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2561 // Run through the possibilities ...
2562 if (DestTy->isIntegerTy()) { // Casting to integral
2563 if (SrcTy->isIntegerTy()) { // Casting from integral
2565 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2567 } else if (SrcTy->isVectorTy()) { // Casting from vector
2568 return DestBits == SrcBits;
2569 } else { // Casting from something else
2570 return SrcTy->isPointerTy();
2572 } else if (DestTy->isFloatingPointTy()) { // Casting to floating pt
2573 if (SrcTy->isIntegerTy()) { // Casting from integral
2575 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2577 } else if (SrcTy->isVectorTy()) { // Casting from vector
2578 return DestBits == SrcBits;
2579 } else { // Casting from something else
2582 } else if (DestTy->isVectorTy()) { // Casting to vector
2583 return DestBits == SrcBits;
2584 } else if (DestTy->isPointerTy()) { // Casting to pointer
2585 if (SrcTy->isPointerTy()) { // Casting from pointer
2587 } else if (SrcTy->isIntegerTy()) { // Casting from integral
2589 } else { // Casting from something else
2592 } else if (DestTy->isX86_MMXTy()) {
2593 if (SrcTy->isVectorTy()) {
2594 return DestBits == SrcBits; // 64-bit vector to MMX
2598 } else { // Casting to something else
2603 bool CastInst::isBitCastable(Type *SrcTy, Type *DestTy) {
2604 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2607 if (SrcTy == DestTy)
2610 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy)) {
2611 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy)) {
2612 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2613 // An element by element cast. Valid if casting the elements is valid.
2614 SrcTy = SrcVecTy->getElementType();
2615 DestTy = DestVecTy->getElementType();
2620 if (PointerType *DestPtrTy = dyn_cast<PointerType>(DestTy)) {
2621 if (PointerType *SrcPtrTy = dyn_cast<PointerType>(SrcTy)) {
2622 return SrcPtrTy->getAddressSpace() == DestPtrTy->getAddressSpace();
2626 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2627 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2629 // Could still have vectors of pointers if the number of elements doesn't
2631 if (SrcBits == 0 || DestBits == 0)
2634 if (SrcBits != DestBits)
2637 if (DestTy->isX86_MMXTy() || SrcTy->isX86_MMXTy())
2643 // Provide a way to get a "cast" where the cast opcode is inferred from the
2644 // types and size of the operand. This, basically, is a parallel of the
2645 // logic in the castIsValid function below. This axiom should hold:
2646 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
2647 // should not assert in castIsValid. In other words, this produces a "correct"
2648 // casting opcode for the arguments passed to it.
2649 // This routine must be kept in sync with isCastable.
2650 Instruction::CastOps
2651 CastInst::getCastOpcode(
2652 const Value *Src, bool SrcIsSigned, Type *DestTy, bool DestIsSigned) {
2653 Type *SrcTy = Src->getType();
2655 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2656 "Only first class types are castable!");
2658 if (SrcTy == DestTy)
2661 // FIXME: Check address space sizes here
2662 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy))
2663 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy))
2664 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2665 // An element by element cast. Find the appropriate opcode based on the
2667 SrcTy = SrcVecTy->getElementType();
2668 DestTy = DestVecTy->getElementType();
2671 // Get the bit sizes, we'll need these
2672 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2673 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2675 // Run through the possibilities ...
2676 if (DestTy->isIntegerTy()) { // Casting to integral
2677 if (SrcTy->isIntegerTy()) { // Casting from integral
2678 if (DestBits < SrcBits)
2679 return Trunc; // int -> smaller int
2680 else if (DestBits > SrcBits) { // its an extension
2682 return SExt; // signed -> SEXT
2684 return ZExt; // unsigned -> ZEXT
2686 return BitCast; // Same size, No-op cast
2688 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2690 return FPToSI; // FP -> sint
2692 return FPToUI; // FP -> uint
2693 } else if (SrcTy->isVectorTy()) {
2694 assert(DestBits == SrcBits &&
2695 "Casting vector to integer of different width");
2696 return BitCast; // Same size, no-op cast
2698 assert(SrcTy->isPointerTy() &&
2699 "Casting from a value that is not first-class type");
2700 return PtrToInt; // ptr -> int
2702 } else if (DestTy->isFloatingPointTy()) { // Casting to floating pt
2703 if (SrcTy->isIntegerTy()) { // Casting from integral
2705 return SIToFP; // sint -> FP
2707 return UIToFP; // uint -> FP
2708 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2709 if (DestBits < SrcBits) {
2710 return FPTrunc; // FP -> smaller FP
2711 } else if (DestBits > SrcBits) {
2712 return FPExt; // FP -> larger FP
2714 return BitCast; // same size, no-op cast
2716 } else if (SrcTy->isVectorTy()) {
2717 assert(DestBits == SrcBits &&
2718 "Casting vector to floating point of different width");
2719 return BitCast; // same size, no-op cast
2721 llvm_unreachable("Casting pointer or non-first class to float");
2722 } else if (DestTy->isVectorTy()) {
2723 assert(DestBits == SrcBits &&
2724 "Illegal cast to vector (wrong type or size)");
2726 } else if (DestTy->isPointerTy()) {
2727 if (SrcTy->isPointerTy()) {
2728 if (DestTy->getPointerAddressSpace() != SrcTy->getPointerAddressSpace())
2729 return AddrSpaceCast;
2730 return BitCast; // ptr -> ptr
2731 } else if (SrcTy->isIntegerTy()) {
2732 return IntToPtr; // int -> ptr
2734 llvm_unreachable("Casting pointer to other than pointer or int");
2735 } else if (DestTy->isX86_MMXTy()) {
2736 if (SrcTy->isVectorTy()) {
2737 assert(DestBits == SrcBits && "Casting vector of wrong width to X86_MMX");
2738 return BitCast; // 64-bit vector to MMX
2740 llvm_unreachable("Illegal cast to X86_MMX");
2742 llvm_unreachable("Casting to type that is not first-class");
2745 //===----------------------------------------------------------------------===//
2746 // CastInst SubClass Constructors
2747 //===----------------------------------------------------------------------===//
2749 /// Check that the construction parameters for a CastInst are correct. This
2750 /// could be broken out into the separate constructors but it is useful to have
2751 /// it in one place and to eliminate the redundant code for getting the sizes
2752 /// of the types involved.
2754 CastInst::castIsValid(Instruction::CastOps op, Value *S, Type *DstTy) {
2756 // Check for type sanity on the arguments
2757 Type *SrcTy = S->getType();
2759 // If this is a cast to the same type then it's trivially true.
2763 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType() ||
2764 SrcTy->isAggregateType() || DstTy->isAggregateType())
2767 // Get the size of the types in bits, we'll need this later
2768 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2769 unsigned DstBitSize = DstTy->getScalarSizeInBits();
2771 // If these are vector types, get the lengths of the vectors (using zero for
2772 // scalar types means that checking that vector lengths match also checks that
2773 // scalars are not being converted to vectors or vectors to scalars).
2774 unsigned SrcLength = SrcTy->isVectorTy() ?
2775 cast<VectorType>(SrcTy)->getNumElements() : 0;
2776 unsigned DstLength = DstTy->isVectorTy() ?
2777 cast<VectorType>(DstTy)->getNumElements() : 0;
2779 // Switch on the opcode provided
2781 default: return false; // This is an input error
2782 case Instruction::Trunc:
2783 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2784 SrcLength == DstLength && SrcBitSize > DstBitSize;
2785 case Instruction::ZExt:
2786 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2787 SrcLength == DstLength && SrcBitSize < DstBitSize;
2788 case Instruction::SExt:
2789 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2790 SrcLength == DstLength && SrcBitSize < DstBitSize;
2791 case Instruction::FPTrunc:
2792 return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
2793 SrcLength == DstLength && SrcBitSize > DstBitSize;
2794 case Instruction::FPExt:
2795 return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
2796 SrcLength == DstLength && SrcBitSize < DstBitSize;
2797 case Instruction::UIToFP:
2798 case Instruction::SIToFP:
2799 return SrcTy->isIntOrIntVectorTy() && DstTy->isFPOrFPVectorTy() &&
2800 SrcLength == DstLength;
2801 case Instruction::FPToUI:
2802 case Instruction::FPToSI:
2803 return SrcTy->isFPOrFPVectorTy() && DstTy->isIntOrIntVectorTy() &&
2804 SrcLength == DstLength;
2805 case Instruction::PtrToInt:
2806 if (isa<VectorType>(SrcTy) != isa<VectorType>(DstTy))
2808 if (VectorType *VT = dyn_cast<VectorType>(SrcTy))
2809 if (VT->getNumElements() != cast<VectorType>(DstTy)->getNumElements())
2811 return SrcTy->getScalarType()->isPointerTy() &&
2812 DstTy->getScalarType()->isIntegerTy();
2813 case Instruction::IntToPtr:
2814 if (isa<VectorType>(SrcTy) != isa<VectorType>(DstTy))
2816 if (VectorType *VT = dyn_cast<VectorType>(SrcTy))
2817 if (VT->getNumElements() != cast<VectorType>(DstTy)->getNumElements())
2819 return SrcTy->getScalarType()->isIntegerTy() &&
2820 DstTy->getScalarType()->isPointerTy();
2821 case Instruction::BitCast:
2822 // BitCast implies a no-op cast of type only. No bits change.
2823 // However, you can't cast pointers to anything but pointers.
2824 if (SrcTy->isPtrOrPtrVectorTy() != DstTy->isPtrOrPtrVectorTy())
2827 // For non-pointer cases, the cast is okay if the source and destination bit
2828 // widths are identical.
2829 if (!SrcTy->isPtrOrPtrVectorTy())
2830 return SrcTy->getPrimitiveSizeInBits() == DstTy->getPrimitiveSizeInBits();
2832 // If both are pointers then the address spaces must match and vector of
2833 // pointers must have the same number of elements.
2834 return SrcTy->getPointerAddressSpace() == DstTy->getPointerAddressSpace() &&
2835 SrcTy->isVectorTy() == DstTy->isVectorTy() &&
2836 (!SrcTy->isVectorTy() ||
2837 SrcTy->getVectorNumElements() == SrcTy->getVectorNumElements());
2839 case Instruction::AddrSpaceCast:
2840 return SrcTy->isPtrOrPtrVectorTy() && DstTy->isPtrOrPtrVectorTy() &&
2841 SrcTy->getPointerAddressSpace() != DstTy->getPointerAddressSpace() &&
2842 SrcTy->isVectorTy() == DstTy->isVectorTy() &&
2843 (!SrcTy->isVectorTy() ||
2844 SrcTy->getVectorNumElements() == SrcTy->getVectorNumElements());
2848 TruncInst::TruncInst(
2849 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2850 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2851 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2854 TruncInst::TruncInst(
2855 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2856 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2857 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2861 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2862 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2863 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2867 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2868 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2869 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2872 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2873 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2874 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2878 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2879 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2880 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2883 FPTruncInst::FPTruncInst(
2884 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2885 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2886 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2889 FPTruncInst::FPTruncInst(
2890 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2891 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2892 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2895 FPExtInst::FPExtInst(
2896 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2897 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2898 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2901 FPExtInst::FPExtInst(
2902 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2903 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2904 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2907 UIToFPInst::UIToFPInst(
2908 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2909 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2910 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2913 UIToFPInst::UIToFPInst(
2914 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2915 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2916 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2919 SIToFPInst::SIToFPInst(
2920 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2921 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2922 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2925 SIToFPInst::SIToFPInst(
2926 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2927 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2928 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2931 FPToUIInst::FPToUIInst(
2932 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2933 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2934 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2937 FPToUIInst::FPToUIInst(
2938 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2939 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2940 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2943 FPToSIInst::FPToSIInst(
2944 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2945 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2946 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2949 FPToSIInst::FPToSIInst(
2950 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2951 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2952 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2955 PtrToIntInst::PtrToIntInst(
2956 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2957 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2958 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2961 PtrToIntInst::PtrToIntInst(
2962 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2963 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2964 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2967 IntToPtrInst::IntToPtrInst(
2968 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2969 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2970 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2973 IntToPtrInst::IntToPtrInst(
2974 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2975 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2976 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2979 BitCastInst::BitCastInst(
2980 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2981 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2982 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2985 BitCastInst::BitCastInst(
2986 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2987 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2988 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2991 AddrSpaceCastInst::AddrSpaceCastInst(
2992 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2993 ) : CastInst(Ty, AddrSpaceCast, S, Name, InsertBefore) {
2994 assert(castIsValid(getOpcode(), S, Ty) && "Illegal AddrSpaceCast");
2997 AddrSpaceCastInst::AddrSpaceCastInst(
2998 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2999 ) : CastInst(Ty, AddrSpaceCast, S, Name, InsertAtEnd) {
3000 assert(castIsValid(getOpcode(), S, Ty) && "Illegal AddrSpaceCast");
3003 //===----------------------------------------------------------------------===//
3005 //===----------------------------------------------------------------------===//
3007 void CmpInst::anchor() {}
3009 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
3010 Value *LHS, Value *RHS, const Twine &Name,
3011 Instruction *InsertBefore)
3012 : Instruction(ty, op,
3013 OperandTraits<CmpInst>::op_begin(this),
3014 OperandTraits<CmpInst>::operands(this),
3018 setPredicate((Predicate)predicate);
3022 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
3023 Value *LHS, Value *RHS, const Twine &Name,
3024 BasicBlock *InsertAtEnd)
3025 : Instruction(ty, op,
3026 OperandTraits<CmpInst>::op_begin(this),
3027 OperandTraits<CmpInst>::operands(this),
3031 setPredicate((Predicate)predicate);
3036 CmpInst::Create(OtherOps Op, unsigned short predicate,
3037 Value *S1, Value *S2,
3038 const Twine &Name, Instruction *InsertBefore) {
3039 if (Op == Instruction::ICmp) {
3041 return new ICmpInst(InsertBefore, CmpInst::Predicate(predicate),
3044 return new ICmpInst(CmpInst::Predicate(predicate),
3049 return new FCmpInst(InsertBefore, CmpInst::Predicate(predicate),
3052 return new FCmpInst(CmpInst::Predicate(predicate),
3057 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
3058 const Twine &Name, BasicBlock *InsertAtEnd) {
3059 if (Op == Instruction::ICmp) {
3060 return new ICmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
3063 return new FCmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
3067 void CmpInst::swapOperands() {
3068 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
3071 cast<FCmpInst>(this)->swapOperands();
3074 bool CmpInst::isCommutative() const {
3075 if (const ICmpInst *IC = dyn_cast<ICmpInst>(this))
3076 return IC->isCommutative();
3077 return cast<FCmpInst>(this)->isCommutative();
3080 bool CmpInst::isEquality() const {
3081 if (const ICmpInst *IC = dyn_cast<ICmpInst>(this))
3082 return IC->isEquality();
3083 return cast<FCmpInst>(this)->isEquality();
3087 CmpInst::Predicate CmpInst::getInversePredicate(Predicate pred) {
3089 default: llvm_unreachable("Unknown cmp predicate!");
3090 case ICMP_EQ: return ICMP_NE;
3091 case ICMP_NE: return ICMP_EQ;
3092 case ICMP_UGT: return ICMP_ULE;
3093 case ICMP_ULT: return ICMP_UGE;
3094 case ICMP_UGE: return ICMP_ULT;
3095 case ICMP_ULE: return ICMP_UGT;
3096 case ICMP_SGT: return ICMP_SLE;
3097 case ICMP_SLT: return ICMP_SGE;
3098 case ICMP_SGE: return ICMP_SLT;
3099 case ICMP_SLE: return ICMP_SGT;
3101 case FCMP_OEQ: return FCMP_UNE;
3102 case FCMP_ONE: return FCMP_UEQ;
3103 case FCMP_OGT: return FCMP_ULE;
3104 case FCMP_OLT: return FCMP_UGE;
3105 case FCMP_OGE: return FCMP_ULT;
3106 case FCMP_OLE: return FCMP_UGT;
3107 case FCMP_UEQ: return FCMP_ONE;
3108 case FCMP_UNE: return FCMP_OEQ;
3109 case FCMP_UGT: return FCMP_OLE;
3110 case FCMP_ULT: return FCMP_OGE;
3111 case FCMP_UGE: return FCMP_OLT;
3112 case FCMP_ULE: return FCMP_OGT;
3113 case FCMP_ORD: return FCMP_UNO;
3114 case FCMP_UNO: return FCMP_ORD;
3115 case FCMP_TRUE: return FCMP_FALSE;
3116 case FCMP_FALSE: return FCMP_TRUE;
3120 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
3122 default: llvm_unreachable("Unknown icmp predicate!");
3123 case ICMP_EQ: case ICMP_NE:
3124 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
3126 case ICMP_UGT: return ICMP_SGT;
3127 case ICMP_ULT: return ICMP_SLT;
3128 case ICMP_UGE: return ICMP_SGE;
3129 case ICMP_ULE: return ICMP_SLE;
3133 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
3135 default: llvm_unreachable("Unknown icmp predicate!");
3136 case ICMP_EQ: case ICMP_NE:
3137 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
3139 case ICMP_SGT: return ICMP_UGT;
3140 case ICMP_SLT: return ICMP_ULT;
3141 case ICMP_SGE: return ICMP_UGE;
3142 case ICMP_SLE: return ICMP_ULE;
3146 /// Initialize a set of values that all satisfy the condition with C.
3149 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
3152 uint32_t BitWidth = C.getBitWidth();
3154 default: llvm_unreachable("Invalid ICmp opcode to ConstantRange ctor!");
3155 case ICmpInst::ICMP_EQ: ++Upper; break;
3156 case ICmpInst::ICMP_NE: ++Lower; break;
3157 case ICmpInst::ICMP_ULT:
3158 Lower = APInt::getMinValue(BitWidth);
3159 // Check for an empty-set condition.
3161 return ConstantRange(BitWidth, /*isFullSet=*/false);
3163 case ICmpInst::ICMP_SLT:
3164 Lower = APInt::getSignedMinValue(BitWidth);
3165 // Check for an empty-set condition.
3167 return ConstantRange(BitWidth, /*isFullSet=*/false);
3169 case ICmpInst::ICMP_UGT:
3170 ++Lower; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
3171 // Check for an empty-set condition.
3173 return ConstantRange(BitWidth, /*isFullSet=*/false);
3175 case ICmpInst::ICMP_SGT:
3176 ++Lower; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
3177 // Check for an empty-set condition.
3179 return ConstantRange(BitWidth, /*isFullSet=*/false);
3181 case ICmpInst::ICMP_ULE:
3182 Lower = APInt::getMinValue(BitWidth); ++Upper;
3183 // Check for a full-set condition.
3185 return ConstantRange(BitWidth, /*isFullSet=*/true);
3187 case ICmpInst::ICMP_SLE:
3188 Lower = APInt::getSignedMinValue(BitWidth); ++Upper;
3189 // Check for a full-set condition.
3191 return ConstantRange(BitWidth, /*isFullSet=*/true);
3193 case ICmpInst::ICMP_UGE:
3194 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
3195 // Check for a full-set condition.
3197 return ConstantRange(BitWidth, /*isFullSet=*/true);
3199 case ICmpInst::ICMP_SGE:
3200 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
3201 // Check for a full-set condition.
3203 return ConstantRange(BitWidth, /*isFullSet=*/true);
3206 return ConstantRange(Lower, Upper);
3209 CmpInst::Predicate CmpInst::getSwappedPredicate(Predicate pred) {
3211 default: llvm_unreachable("Unknown cmp predicate!");
3212 case ICMP_EQ: case ICMP_NE:
3214 case ICMP_SGT: return ICMP_SLT;
3215 case ICMP_SLT: return ICMP_SGT;
3216 case ICMP_SGE: return ICMP_SLE;
3217 case ICMP_SLE: return ICMP_SGE;
3218 case ICMP_UGT: return ICMP_ULT;
3219 case ICMP_ULT: return ICMP_UGT;
3220 case ICMP_UGE: return ICMP_ULE;
3221 case ICMP_ULE: return ICMP_UGE;
3223 case FCMP_FALSE: case FCMP_TRUE:
3224 case FCMP_OEQ: case FCMP_ONE:
3225 case FCMP_UEQ: case FCMP_UNE:
3226 case FCMP_ORD: case FCMP_UNO:
3228 case FCMP_OGT: return FCMP_OLT;
3229 case FCMP_OLT: return FCMP_OGT;
3230 case FCMP_OGE: return FCMP_OLE;
3231 case FCMP_OLE: return FCMP_OGE;
3232 case FCMP_UGT: return FCMP_ULT;
3233 case FCMP_ULT: return FCMP_UGT;
3234 case FCMP_UGE: return FCMP_ULE;
3235 case FCMP_ULE: return FCMP_UGE;
3239 bool CmpInst::isUnsigned(unsigned short predicate) {
3240 switch (predicate) {
3241 default: return false;
3242 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
3243 case ICmpInst::ICMP_UGE: return true;
3247 bool CmpInst::isSigned(unsigned short predicate) {
3248 switch (predicate) {
3249 default: return false;
3250 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
3251 case ICmpInst::ICMP_SGE: return true;
3255 bool CmpInst::isOrdered(unsigned short predicate) {
3256 switch (predicate) {
3257 default: return false;
3258 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
3259 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
3260 case FCmpInst::FCMP_ORD: return true;
3264 bool CmpInst::isUnordered(unsigned short predicate) {
3265 switch (predicate) {
3266 default: return false;
3267 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
3268 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
3269 case FCmpInst::FCMP_UNO: return true;
3273 bool CmpInst::isTrueWhenEqual(unsigned short predicate) {
3275 default: return false;
3276 case ICMP_EQ: case ICMP_UGE: case ICMP_ULE: case ICMP_SGE: case ICMP_SLE:
3277 case FCMP_TRUE: case FCMP_UEQ: case FCMP_UGE: case FCMP_ULE: return true;
3281 bool CmpInst::isFalseWhenEqual(unsigned short predicate) {
3283 case ICMP_NE: case ICMP_UGT: case ICMP_ULT: case ICMP_SGT: case ICMP_SLT:
3284 case FCMP_FALSE: case FCMP_ONE: case FCMP_OGT: case FCMP_OLT: return true;
3285 default: return false;
3290 //===----------------------------------------------------------------------===//
3291 // SwitchInst Implementation
3292 //===----------------------------------------------------------------------===//
3294 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumReserved) {
3295 assert(Value && Default && NumReserved);
3296 ReservedSpace = NumReserved;
3298 OperandList = allocHungoffUses(ReservedSpace);
3300 OperandList[0] = Value;
3301 OperandList[1] = Default;
3304 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
3305 /// switch on and a default destination. The number of additional cases can
3306 /// be specified here to make memory allocation more efficient. This
3307 /// constructor can also autoinsert before another instruction.
3308 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
3309 Instruction *InsertBefore)
3310 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
3311 0, 0, InsertBefore) {
3312 init(Value, Default, 2+NumCases*2);
3315 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
3316 /// switch on and a default destination. The number of additional cases can
3317 /// be specified here to make memory allocation more efficient. This
3318 /// constructor also autoinserts at the end of the specified BasicBlock.
3319 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
3320 BasicBlock *InsertAtEnd)
3321 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
3322 0, 0, InsertAtEnd) {
3323 init(Value, Default, 2+NumCases*2);
3326 SwitchInst::SwitchInst(const SwitchInst &SI)
3327 : TerminatorInst(SI.getType(), Instruction::Switch, 0, 0) {
3328 init(SI.getCondition(), SI.getDefaultDest(), SI.getNumOperands());
3329 NumOperands = SI.getNumOperands();
3330 Use *OL = OperandList, *InOL = SI.OperandList;
3331 for (unsigned i = 2, E = SI.getNumOperands(); i != E; i += 2) {
3333 OL[i+1] = InOL[i+1];
3335 SubclassOptionalData = SI.SubclassOptionalData;
3338 SwitchInst::~SwitchInst() {
3343 /// addCase - Add an entry to the switch instruction...
3345 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
3346 unsigned NewCaseIdx = getNumCases();
3347 unsigned OpNo = NumOperands;
3348 if (OpNo+2 > ReservedSpace)
3349 growOperands(); // Get more space!
3350 // Initialize some new operands.
3351 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
3352 NumOperands = OpNo+2;
3353 CaseIt Case(this, NewCaseIdx);
3354 Case.setValue(OnVal);
3355 Case.setSuccessor(Dest);
3358 /// removeCase - This method removes the specified case and its successor
3359 /// from the switch instruction.
3360 void SwitchInst::removeCase(CaseIt i) {
3361 unsigned idx = i.getCaseIndex();
3363 assert(2 + idx*2 < getNumOperands() && "Case index out of range!!!");
3365 unsigned NumOps = getNumOperands();
3366 Use *OL = OperandList;
3368 // Overwrite this case with the end of the list.
3369 if (2 + (idx + 1) * 2 != NumOps) {
3370 OL[2 + idx * 2] = OL[NumOps - 2];
3371 OL[2 + idx * 2 + 1] = OL[NumOps - 1];
3374 // Nuke the last value.
3375 OL[NumOps-2].set(0);
3376 OL[NumOps-2+1].set(0);
3377 NumOperands = NumOps-2;
3380 /// growOperands - grow operands - This grows the operand list in response
3381 /// to a push_back style of operation. This grows the number of ops by 3 times.
3383 void SwitchInst::growOperands() {
3384 unsigned e = getNumOperands();
3385 unsigned NumOps = e*3;
3387 ReservedSpace = NumOps;
3388 Use *NewOps = allocHungoffUses(NumOps);
3389 Use *OldOps = OperandList;
3390 for (unsigned i = 0; i != e; ++i) {
3391 NewOps[i] = OldOps[i];
3393 OperandList = NewOps;
3394 Use::zap(OldOps, OldOps + e, true);
3398 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
3399 return getSuccessor(idx);
3401 unsigned SwitchInst::getNumSuccessorsV() const {
3402 return getNumSuccessors();
3404 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3405 setSuccessor(idx, B);
3408 //===----------------------------------------------------------------------===//
3409 // IndirectBrInst Implementation
3410 //===----------------------------------------------------------------------===//
3412 void IndirectBrInst::init(Value *Address, unsigned NumDests) {
3413 assert(Address && Address->getType()->isPointerTy() &&
3414 "Address of indirectbr must be a pointer");
3415 ReservedSpace = 1+NumDests;
3417 OperandList = allocHungoffUses(ReservedSpace);
3419 OperandList[0] = Address;
3423 /// growOperands - grow operands - This grows the operand list in response
3424 /// to a push_back style of operation. This grows the number of ops by 2 times.
3426 void IndirectBrInst::growOperands() {
3427 unsigned e = getNumOperands();
3428 unsigned NumOps = e*2;
3430 ReservedSpace = NumOps;
3431 Use *NewOps = allocHungoffUses(NumOps);
3432 Use *OldOps = OperandList;
3433 for (unsigned i = 0; i != e; ++i)
3434 NewOps[i] = OldOps[i];
3435 OperandList = NewOps;
3436 Use::zap(OldOps, OldOps + e, true);
3439 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3440 Instruction *InsertBefore)
3441 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3442 0, 0, InsertBefore) {
3443 init(Address, NumCases);
3446 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3447 BasicBlock *InsertAtEnd)
3448 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3449 0, 0, InsertAtEnd) {
3450 init(Address, NumCases);
3453 IndirectBrInst::IndirectBrInst(const IndirectBrInst &IBI)
3454 : TerminatorInst(Type::getVoidTy(IBI.getContext()), Instruction::IndirectBr,
3455 allocHungoffUses(IBI.getNumOperands()),
3456 IBI.getNumOperands()) {
3457 Use *OL = OperandList, *InOL = IBI.OperandList;
3458 for (unsigned i = 0, E = IBI.getNumOperands(); i != E; ++i)
3460 SubclassOptionalData = IBI.SubclassOptionalData;
3463 IndirectBrInst::~IndirectBrInst() {
3467 /// addDestination - Add a destination.
3469 void IndirectBrInst::addDestination(BasicBlock *DestBB) {
3470 unsigned OpNo = NumOperands;
3471 if (OpNo+1 > ReservedSpace)
3472 growOperands(); // Get more space!
3473 // Initialize some new operands.
3474 assert(OpNo < ReservedSpace && "Growing didn't work!");
3475 NumOperands = OpNo+1;
3476 OperandList[OpNo] = DestBB;
3479 /// removeDestination - This method removes the specified successor from the
3480 /// indirectbr instruction.
3481 void IndirectBrInst::removeDestination(unsigned idx) {
3482 assert(idx < getNumOperands()-1 && "Successor index out of range!");
3484 unsigned NumOps = getNumOperands();
3485 Use *OL = OperandList;
3487 // Replace this value with the last one.
3488 OL[idx+1] = OL[NumOps-1];
3490 // Nuke the last value.
3491 OL[NumOps-1].set(0);
3492 NumOperands = NumOps-1;
3495 BasicBlock *IndirectBrInst::getSuccessorV(unsigned idx) const {
3496 return getSuccessor(idx);
3498 unsigned IndirectBrInst::getNumSuccessorsV() const {
3499 return getNumSuccessors();
3501 void IndirectBrInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3502 setSuccessor(idx, B);
3505 //===----------------------------------------------------------------------===//
3506 // clone_impl() implementations
3507 //===----------------------------------------------------------------------===//
3509 // Define these methods here so vtables don't get emitted into every translation
3510 // unit that uses these classes.
3512 GetElementPtrInst *GetElementPtrInst::clone_impl() const {
3513 return new (getNumOperands()) GetElementPtrInst(*this);
3516 BinaryOperator *BinaryOperator::clone_impl() const {
3517 return Create(getOpcode(), Op<0>(), Op<1>());
3520 FCmpInst* FCmpInst::clone_impl() const {
3521 return new FCmpInst(getPredicate(), Op<0>(), Op<1>());
3524 ICmpInst* ICmpInst::clone_impl() const {
3525 return new ICmpInst(getPredicate(), Op<0>(), Op<1>());
3528 ExtractValueInst *ExtractValueInst::clone_impl() const {
3529 return new ExtractValueInst(*this);
3532 InsertValueInst *InsertValueInst::clone_impl() const {
3533 return new InsertValueInst(*this);
3536 AllocaInst *AllocaInst::clone_impl() const {
3537 return new AllocaInst(getAllocatedType(),
3538 (Value*)getOperand(0),
3542 LoadInst *LoadInst::clone_impl() const {
3543 return new LoadInst(getOperand(0), Twine(), isVolatile(),
3544 getAlignment(), getOrdering(), getSynchScope());
3547 StoreInst *StoreInst::clone_impl() const {
3548 return new StoreInst(getOperand(0), getOperand(1), isVolatile(),
3549 getAlignment(), getOrdering(), getSynchScope());
3553 AtomicCmpXchgInst *AtomicCmpXchgInst::clone_impl() const {
3554 AtomicCmpXchgInst *Result =
3555 new AtomicCmpXchgInst(getOperand(0), getOperand(1), getOperand(2),
3556 getOrdering(), getSynchScope());
3557 Result->setVolatile(isVolatile());
3561 AtomicRMWInst *AtomicRMWInst::clone_impl() const {
3562 AtomicRMWInst *Result =
3563 new AtomicRMWInst(getOperation(),getOperand(0), getOperand(1),
3564 getOrdering(), getSynchScope());
3565 Result->setVolatile(isVolatile());
3569 FenceInst *FenceInst::clone_impl() const {
3570 return new FenceInst(getContext(), getOrdering(), getSynchScope());
3573 TruncInst *TruncInst::clone_impl() const {
3574 return new TruncInst(getOperand(0), getType());
3577 ZExtInst *ZExtInst::clone_impl() const {
3578 return new ZExtInst(getOperand(0), getType());
3581 SExtInst *SExtInst::clone_impl() const {
3582 return new SExtInst(getOperand(0), getType());
3585 FPTruncInst *FPTruncInst::clone_impl() const {
3586 return new FPTruncInst(getOperand(0), getType());
3589 FPExtInst *FPExtInst::clone_impl() const {
3590 return new FPExtInst(getOperand(0), getType());
3593 UIToFPInst *UIToFPInst::clone_impl() const {
3594 return new UIToFPInst(getOperand(0), getType());
3597 SIToFPInst *SIToFPInst::clone_impl() const {
3598 return new SIToFPInst(getOperand(0), getType());
3601 FPToUIInst *FPToUIInst::clone_impl() const {
3602 return new FPToUIInst(getOperand(0), getType());
3605 FPToSIInst *FPToSIInst::clone_impl() const {
3606 return new FPToSIInst(getOperand(0), getType());
3609 PtrToIntInst *PtrToIntInst::clone_impl() const {
3610 return new PtrToIntInst(getOperand(0), getType());
3613 IntToPtrInst *IntToPtrInst::clone_impl() const {
3614 return new IntToPtrInst(getOperand(0), getType());
3617 BitCastInst *BitCastInst::clone_impl() const {
3618 return new BitCastInst(getOperand(0), getType());
3621 AddrSpaceCastInst *AddrSpaceCastInst::clone_impl() const {
3622 return new AddrSpaceCastInst(getOperand(0), getType());
3625 CallInst *CallInst::clone_impl() const {
3626 return new(getNumOperands()) CallInst(*this);
3629 SelectInst *SelectInst::clone_impl() const {
3630 return SelectInst::Create(getOperand(0), getOperand(1), getOperand(2));
3633 VAArgInst *VAArgInst::clone_impl() const {
3634 return new VAArgInst(getOperand(0), getType());
3637 ExtractElementInst *ExtractElementInst::clone_impl() const {
3638 return ExtractElementInst::Create(getOperand(0), getOperand(1));
3641 InsertElementInst *InsertElementInst::clone_impl() const {
3642 return InsertElementInst::Create(getOperand(0), getOperand(1), getOperand(2));
3645 ShuffleVectorInst *ShuffleVectorInst::clone_impl() const {
3646 return new ShuffleVectorInst(getOperand(0), getOperand(1), getOperand(2));
3649 PHINode *PHINode::clone_impl() const {
3650 return new PHINode(*this);
3653 LandingPadInst *LandingPadInst::clone_impl() const {
3654 return new LandingPadInst(*this);
3657 ReturnInst *ReturnInst::clone_impl() const {
3658 return new(getNumOperands()) ReturnInst(*this);
3661 BranchInst *BranchInst::clone_impl() const {
3662 return new(getNumOperands()) BranchInst(*this);
3665 SwitchInst *SwitchInst::clone_impl() const {
3666 return new SwitchInst(*this);
3669 IndirectBrInst *IndirectBrInst::clone_impl() const {
3670 return new IndirectBrInst(*this);
3674 InvokeInst *InvokeInst::clone_impl() const {
3675 return new(getNumOperands()) InvokeInst(*this);
3678 ResumeInst *ResumeInst::clone_impl() const {
3679 return new(1) ResumeInst(*this);
3682 UnreachableInst *UnreachableInst::clone_impl() const {
3683 LLVMContext &Context = getContext();
3684 return new UnreachableInst(Context);