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(Log2_32(Align) + 1);
897 assert(getAlignment() == Align && "Alignment representation error!");
900 bool AllocaInst::isArrayAllocation() const {
901 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
906 Type *AllocaInst::getAllocatedType() const {
907 return getType()->getElementType();
910 /// isStaticAlloca - Return true if this alloca is in the entry block of the
911 /// function and is a constant size. If so, the code generator will fold it
912 /// into the prolog/epilog code, so it is basically free.
913 bool AllocaInst::isStaticAlloca() const {
914 // Must be constant size.
915 if (!isa<ConstantInt>(getArraySize())) return false;
917 // Must be in the entry block.
918 const BasicBlock *Parent = getParent();
919 return Parent == &Parent->getParent()->front();
922 //===----------------------------------------------------------------------===//
923 // LoadInst Implementation
924 //===----------------------------------------------------------------------===//
926 void LoadInst::AssertOK() {
927 assert(getOperand(0)->getType()->isPointerTy() &&
928 "Ptr must have pointer type.");
929 assert(!(isAtomic() && getAlignment() == 0) &&
930 "Alignment required for atomic load");
933 LoadInst::LoadInst(Value *Ptr, const Twine &Name, Instruction *InsertBef)
934 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
935 Load, Ptr, InsertBef) {
938 setAtomic(NotAtomic);
943 LoadInst::LoadInst(Value *Ptr, const Twine &Name, BasicBlock *InsertAE)
944 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
945 Load, Ptr, InsertAE) {
948 setAtomic(NotAtomic);
953 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
954 Instruction *InsertBef)
955 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
956 Load, Ptr, InsertBef) {
957 setVolatile(isVolatile);
959 setAtomic(NotAtomic);
964 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
965 BasicBlock *InsertAE)
966 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
967 Load, Ptr, InsertAE) {
968 setVolatile(isVolatile);
970 setAtomic(NotAtomic);
975 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
976 unsigned Align, Instruction *InsertBef)
977 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
978 Load, Ptr, InsertBef) {
979 setVolatile(isVolatile);
981 setAtomic(NotAtomic);
986 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
987 unsigned Align, BasicBlock *InsertAE)
988 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
989 Load, Ptr, InsertAE) {
990 setVolatile(isVolatile);
992 setAtomic(NotAtomic);
997 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
998 unsigned Align, AtomicOrdering Order,
999 SynchronizationScope SynchScope,
1000 Instruction *InsertBef)
1001 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1002 Load, Ptr, InsertBef) {
1003 setVolatile(isVolatile);
1004 setAlignment(Align);
1005 setAtomic(Order, SynchScope);
1010 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
1011 unsigned Align, AtomicOrdering Order,
1012 SynchronizationScope SynchScope,
1013 BasicBlock *InsertAE)
1014 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1015 Load, Ptr, InsertAE) {
1016 setVolatile(isVolatile);
1017 setAlignment(Align);
1018 setAtomic(Order, SynchScope);
1023 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
1024 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1025 Load, Ptr, InsertBef) {
1028 setAtomic(NotAtomic);
1030 if (Name && Name[0]) setName(Name);
1033 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
1034 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1035 Load, Ptr, InsertAE) {
1038 setAtomic(NotAtomic);
1040 if (Name && Name[0]) setName(Name);
1043 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
1044 Instruction *InsertBef)
1045 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1046 Load, Ptr, InsertBef) {
1047 setVolatile(isVolatile);
1049 setAtomic(NotAtomic);
1051 if (Name && Name[0]) setName(Name);
1054 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
1055 BasicBlock *InsertAE)
1056 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1057 Load, Ptr, InsertAE) {
1058 setVolatile(isVolatile);
1060 setAtomic(NotAtomic);
1062 if (Name && Name[0]) setName(Name);
1065 void LoadInst::setAlignment(unsigned Align) {
1066 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1067 assert(Align <= MaximumAlignment &&
1068 "Alignment is greater than MaximumAlignment!");
1069 setInstructionSubclassData((getSubclassDataFromInstruction() & ~(31 << 1)) |
1070 ((Log2_32(Align)+1)<<1));
1071 assert(getAlignment() == Align && "Alignment representation error!");
1074 //===----------------------------------------------------------------------===//
1075 // StoreInst Implementation
1076 //===----------------------------------------------------------------------===//
1078 void StoreInst::AssertOK() {
1079 assert(getOperand(0) && getOperand(1) && "Both operands must be non-null!");
1080 assert(getOperand(1)->getType()->isPointerTy() &&
1081 "Ptr must have pointer type!");
1082 assert(getOperand(0)->getType() ==
1083 cast<PointerType>(getOperand(1)->getType())->getElementType()
1084 && "Ptr must be a pointer to Val type!");
1085 assert(!(isAtomic() && getAlignment() == 0) &&
1086 "Alignment required for atomic load");
1090 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
1091 : Instruction(Type::getVoidTy(val->getContext()), Store,
1092 OperandTraits<StoreInst>::op_begin(this),
1093 OperandTraits<StoreInst>::operands(this),
1099 setAtomic(NotAtomic);
1103 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
1104 : Instruction(Type::getVoidTy(val->getContext()), Store,
1105 OperandTraits<StoreInst>::op_begin(this),
1106 OperandTraits<StoreInst>::operands(this),
1112 setAtomic(NotAtomic);
1116 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1117 Instruction *InsertBefore)
1118 : Instruction(Type::getVoidTy(val->getContext()), Store,
1119 OperandTraits<StoreInst>::op_begin(this),
1120 OperandTraits<StoreInst>::operands(this),
1124 setVolatile(isVolatile);
1126 setAtomic(NotAtomic);
1130 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1131 unsigned Align, Instruction *InsertBefore)
1132 : Instruction(Type::getVoidTy(val->getContext()), Store,
1133 OperandTraits<StoreInst>::op_begin(this),
1134 OperandTraits<StoreInst>::operands(this),
1138 setVolatile(isVolatile);
1139 setAlignment(Align);
1140 setAtomic(NotAtomic);
1144 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1145 unsigned Align, AtomicOrdering Order,
1146 SynchronizationScope SynchScope,
1147 Instruction *InsertBefore)
1148 : Instruction(Type::getVoidTy(val->getContext()), Store,
1149 OperandTraits<StoreInst>::op_begin(this),
1150 OperandTraits<StoreInst>::operands(this),
1154 setVolatile(isVolatile);
1155 setAlignment(Align);
1156 setAtomic(Order, SynchScope);
1160 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1161 BasicBlock *InsertAtEnd)
1162 : Instruction(Type::getVoidTy(val->getContext()), Store,
1163 OperandTraits<StoreInst>::op_begin(this),
1164 OperandTraits<StoreInst>::operands(this),
1168 setVolatile(isVolatile);
1170 setAtomic(NotAtomic);
1174 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1175 unsigned Align, BasicBlock *InsertAtEnd)
1176 : Instruction(Type::getVoidTy(val->getContext()), Store,
1177 OperandTraits<StoreInst>::op_begin(this),
1178 OperandTraits<StoreInst>::operands(this),
1182 setVolatile(isVolatile);
1183 setAlignment(Align);
1184 setAtomic(NotAtomic);
1188 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1189 unsigned Align, AtomicOrdering Order,
1190 SynchronizationScope SynchScope,
1191 BasicBlock *InsertAtEnd)
1192 : Instruction(Type::getVoidTy(val->getContext()), Store,
1193 OperandTraits<StoreInst>::op_begin(this),
1194 OperandTraits<StoreInst>::operands(this),
1198 setVolatile(isVolatile);
1199 setAlignment(Align);
1200 setAtomic(Order, SynchScope);
1204 void StoreInst::setAlignment(unsigned Align) {
1205 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1206 assert(Align <= MaximumAlignment &&
1207 "Alignment is greater than MaximumAlignment!");
1208 setInstructionSubclassData((getSubclassDataFromInstruction() & ~(31 << 1)) |
1209 ((Log2_32(Align)+1) << 1));
1210 assert(getAlignment() == Align && "Alignment representation error!");
1213 //===----------------------------------------------------------------------===//
1214 // AtomicCmpXchgInst Implementation
1215 //===----------------------------------------------------------------------===//
1217 void AtomicCmpXchgInst::Init(Value *Ptr, Value *Cmp, Value *NewVal,
1218 AtomicOrdering Ordering,
1219 SynchronizationScope SynchScope) {
1223 setOrdering(Ordering);
1224 setSynchScope(SynchScope);
1226 assert(getOperand(0) && getOperand(1) && getOperand(2) &&
1227 "All operands must be non-null!");
1228 assert(getOperand(0)->getType()->isPointerTy() &&
1229 "Ptr must have pointer type!");
1230 assert(getOperand(1)->getType() ==
1231 cast<PointerType>(getOperand(0)->getType())->getElementType()
1232 && "Ptr must be a pointer to Cmp type!");
1233 assert(getOperand(2)->getType() ==
1234 cast<PointerType>(getOperand(0)->getType())->getElementType()
1235 && "Ptr must be a pointer to NewVal type!");
1236 assert(Ordering != NotAtomic &&
1237 "AtomicCmpXchg instructions must be atomic!");
1240 AtomicCmpXchgInst::AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
1241 AtomicOrdering Ordering,
1242 SynchronizationScope SynchScope,
1243 Instruction *InsertBefore)
1244 : Instruction(Cmp->getType(), AtomicCmpXchg,
1245 OperandTraits<AtomicCmpXchgInst>::op_begin(this),
1246 OperandTraits<AtomicCmpXchgInst>::operands(this),
1248 Init(Ptr, Cmp, NewVal, Ordering, SynchScope);
1251 AtomicCmpXchgInst::AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
1252 AtomicOrdering Ordering,
1253 SynchronizationScope SynchScope,
1254 BasicBlock *InsertAtEnd)
1255 : Instruction(Cmp->getType(), AtomicCmpXchg,
1256 OperandTraits<AtomicCmpXchgInst>::op_begin(this),
1257 OperandTraits<AtomicCmpXchgInst>::operands(this),
1259 Init(Ptr, Cmp, NewVal, Ordering, SynchScope);
1262 //===----------------------------------------------------------------------===//
1263 // AtomicRMWInst Implementation
1264 //===----------------------------------------------------------------------===//
1266 void AtomicRMWInst::Init(BinOp Operation, Value *Ptr, Value *Val,
1267 AtomicOrdering Ordering,
1268 SynchronizationScope SynchScope) {
1271 setOperation(Operation);
1272 setOrdering(Ordering);
1273 setSynchScope(SynchScope);
1275 assert(getOperand(0) && getOperand(1) &&
1276 "All operands must be non-null!");
1277 assert(getOperand(0)->getType()->isPointerTy() &&
1278 "Ptr must have pointer type!");
1279 assert(getOperand(1)->getType() ==
1280 cast<PointerType>(getOperand(0)->getType())->getElementType()
1281 && "Ptr must be a pointer to Val type!");
1282 assert(Ordering != NotAtomic &&
1283 "AtomicRMW instructions must be atomic!");
1286 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
1287 AtomicOrdering Ordering,
1288 SynchronizationScope SynchScope,
1289 Instruction *InsertBefore)
1290 : Instruction(Val->getType(), AtomicRMW,
1291 OperandTraits<AtomicRMWInst>::op_begin(this),
1292 OperandTraits<AtomicRMWInst>::operands(this),
1294 Init(Operation, Ptr, Val, Ordering, SynchScope);
1297 AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
1298 AtomicOrdering Ordering,
1299 SynchronizationScope SynchScope,
1300 BasicBlock *InsertAtEnd)
1301 : Instruction(Val->getType(), AtomicRMW,
1302 OperandTraits<AtomicRMWInst>::op_begin(this),
1303 OperandTraits<AtomicRMWInst>::operands(this),
1305 Init(Operation, Ptr, Val, Ordering, SynchScope);
1308 //===----------------------------------------------------------------------===//
1309 // FenceInst Implementation
1310 //===----------------------------------------------------------------------===//
1312 FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
1313 SynchronizationScope SynchScope,
1314 Instruction *InsertBefore)
1315 : Instruction(Type::getVoidTy(C), Fence, 0, 0, InsertBefore) {
1316 setOrdering(Ordering);
1317 setSynchScope(SynchScope);
1320 FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
1321 SynchronizationScope SynchScope,
1322 BasicBlock *InsertAtEnd)
1323 : Instruction(Type::getVoidTy(C), Fence, 0, 0, InsertAtEnd) {
1324 setOrdering(Ordering);
1325 setSynchScope(SynchScope);
1328 //===----------------------------------------------------------------------===//
1329 // GetElementPtrInst Implementation
1330 //===----------------------------------------------------------------------===//
1332 void GetElementPtrInst::init(Value *Ptr, ArrayRef<Value *> IdxList,
1333 const Twine &Name) {
1334 assert(NumOperands == 1 + IdxList.size() && "NumOperands not initialized?");
1335 OperandList[0] = Ptr;
1336 std::copy(IdxList.begin(), IdxList.end(), op_begin() + 1);
1340 GetElementPtrInst::GetElementPtrInst(const GetElementPtrInst &GEPI)
1341 : Instruction(GEPI.getType(), GetElementPtr,
1342 OperandTraits<GetElementPtrInst>::op_end(this)
1343 - GEPI.getNumOperands(),
1344 GEPI.getNumOperands()) {
1345 std::copy(GEPI.op_begin(), GEPI.op_end(), op_begin());
1346 SubclassOptionalData = GEPI.SubclassOptionalData;
1349 /// getIndexedType - Returns the type of the element that would be accessed with
1350 /// a gep instruction with the specified parameters.
1352 /// The Idxs pointer should point to a continuous piece of memory containing the
1353 /// indices, either as Value* or uint64_t.
1355 /// A null type is returned if the indices are invalid for the specified
1358 template <typename IndexTy>
1359 static Type *getIndexedTypeInternal(Type *Ptr, ArrayRef<IndexTy> IdxList) {
1360 PointerType *PTy = dyn_cast<PointerType>(Ptr->getScalarType());
1361 if (!PTy) return 0; // Type isn't a pointer type!
1362 Type *Agg = PTy->getElementType();
1364 // Handle the special case of the empty set index set, which is always valid.
1365 if (IdxList.empty())
1368 // If there is at least one index, the top level type must be sized, otherwise
1369 // it cannot be 'stepped over'.
1370 if (!Agg->isSized())
1373 unsigned CurIdx = 1;
1374 for (; CurIdx != IdxList.size(); ++CurIdx) {
1375 CompositeType *CT = dyn_cast<CompositeType>(Agg);
1376 if (!CT || CT->isPointerTy()) return 0;
1377 IndexTy Index = IdxList[CurIdx];
1378 if (!CT->indexValid(Index)) return 0;
1379 Agg = CT->getTypeAtIndex(Index);
1381 return CurIdx == IdxList.size() ? Agg : 0;
1384 Type *GetElementPtrInst::getIndexedType(Type *Ptr, ArrayRef<Value *> IdxList) {
1385 return getIndexedTypeInternal(Ptr, IdxList);
1388 Type *GetElementPtrInst::getIndexedType(Type *Ptr,
1389 ArrayRef<Constant *> IdxList) {
1390 return getIndexedTypeInternal(Ptr, IdxList);
1393 Type *GetElementPtrInst::getIndexedType(Type *Ptr, ArrayRef<uint64_t> IdxList) {
1394 return getIndexedTypeInternal(Ptr, IdxList);
1397 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
1398 /// zeros. If so, the result pointer and the first operand have the same
1399 /// value, just potentially different types.
1400 bool GetElementPtrInst::hasAllZeroIndices() const {
1401 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1402 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
1403 if (!CI->isZero()) return false;
1411 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
1412 /// constant integers. If so, the result pointer and the first operand have
1413 /// a constant offset between them.
1414 bool GetElementPtrInst::hasAllConstantIndices() const {
1415 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1416 if (!isa<ConstantInt>(getOperand(i)))
1422 void GetElementPtrInst::setIsInBounds(bool B) {
1423 cast<GEPOperator>(this)->setIsInBounds(B);
1426 bool GetElementPtrInst::isInBounds() const {
1427 return cast<GEPOperator>(this)->isInBounds();
1430 bool GetElementPtrInst::accumulateConstantOffset(const DataLayout &DL,
1431 APInt &Offset) const {
1432 // Delegate to the generic GEPOperator implementation.
1433 return cast<GEPOperator>(this)->accumulateConstantOffset(DL, Offset);
1436 //===----------------------------------------------------------------------===//
1437 // ExtractElementInst Implementation
1438 //===----------------------------------------------------------------------===//
1440 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1442 Instruction *InsertBef)
1443 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1445 OperandTraits<ExtractElementInst>::op_begin(this),
1447 assert(isValidOperands(Val, Index) &&
1448 "Invalid extractelement instruction operands!");
1454 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1456 BasicBlock *InsertAE)
1457 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1459 OperandTraits<ExtractElementInst>::op_begin(this),
1461 assert(isValidOperands(Val, Index) &&
1462 "Invalid extractelement instruction operands!");
1470 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
1471 if (!Val->getType()->isVectorTy() || !Index->getType()->isIntegerTy(32))
1477 //===----------------------------------------------------------------------===//
1478 // InsertElementInst Implementation
1479 //===----------------------------------------------------------------------===//
1481 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1483 Instruction *InsertBef)
1484 : Instruction(Vec->getType(), InsertElement,
1485 OperandTraits<InsertElementInst>::op_begin(this),
1487 assert(isValidOperands(Vec, Elt, Index) &&
1488 "Invalid insertelement instruction operands!");
1495 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1497 BasicBlock *InsertAE)
1498 : Instruction(Vec->getType(), InsertElement,
1499 OperandTraits<InsertElementInst>::op_begin(this),
1501 assert(isValidOperands(Vec, Elt, Index) &&
1502 "Invalid insertelement instruction operands!");
1510 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
1511 const Value *Index) {
1512 if (!Vec->getType()->isVectorTy())
1513 return false; // First operand of insertelement must be vector type.
1515 if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
1516 return false;// Second operand of insertelement must be vector element type.
1518 if (!Index->getType()->isIntegerTy(32))
1519 return false; // Third operand of insertelement must be i32.
1524 //===----------------------------------------------------------------------===//
1525 // ShuffleVectorInst Implementation
1526 //===----------------------------------------------------------------------===//
1528 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1530 Instruction *InsertBefore)
1531 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1532 cast<VectorType>(Mask->getType())->getNumElements()),
1534 OperandTraits<ShuffleVectorInst>::op_begin(this),
1535 OperandTraits<ShuffleVectorInst>::operands(this),
1537 assert(isValidOperands(V1, V2, Mask) &&
1538 "Invalid shuffle vector instruction operands!");
1545 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1547 BasicBlock *InsertAtEnd)
1548 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1549 cast<VectorType>(Mask->getType())->getNumElements()),
1551 OperandTraits<ShuffleVectorInst>::op_begin(this),
1552 OperandTraits<ShuffleVectorInst>::operands(this),
1554 assert(isValidOperands(V1, V2, Mask) &&
1555 "Invalid shuffle vector instruction operands!");
1563 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1564 const Value *Mask) {
1565 // V1 and V2 must be vectors of the same type.
1566 if (!V1->getType()->isVectorTy() || V1->getType() != V2->getType())
1569 // Mask must be vector of i32.
1570 VectorType *MaskTy = dyn_cast<VectorType>(Mask->getType());
1571 if (MaskTy == 0 || !MaskTy->getElementType()->isIntegerTy(32))
1574 // Check to see if Mask is valid.
1575 if (isa<UndefValue>(Mask) || isa<ConstantAggregateZero>(Mask))
1578 if (const ConstantVector *MV = dyn_cast<ConstantVector>(Mask)) {
1579 unsigned V1Size = cast<VectorType>(V1->getType())->getNumElements();
1580 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
1581 if (ConstantInt *CI = dyn_cast<ConstantInt>(MV->getOperand(i))) {
1582 if (CI->uge(V1Size*2))
1584 } else if (!isa<UndefValue>(MV->getOperand(i))) {
1591 if (const ConstantDataSequential *CDS =
1592 dyn_cast<ConstantDataSequential>(Mask)) {
1593 unsigned V1Size = cast<VectorType>(V1->getType())->getNumElements();
1594 for (unsigned i = 0, e = MaskTy->getNumElements(); i != e; ++i)
1595 if (CDS->getElementAsInteger(i) >= V1Size*2)
1600 // The bitcode reader can create a place holder for a forward reference
1601 // used as the shuffle mask. When this occurs, the shuffle mask will
1602 // fall into this case and fail. To avoid this error, do this bit of
1603 // ugliness to allow such a mask pass.
1604 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(Mask))
1605 if (CE->getOpcode() == Instruction::UserOp1)
1611 /// getMaskValue - Return the index from the shuffle mask for the specified
1612 /// output result. This is either -1 if the element is undef or a number less
1613 /// than 2*numelements.
1614 int ShuffleVectorInst::getMaskValue(Constant *Mask, unsigned i) {
1615 assert(i < Mask->getType()->getVectorNumElements() && "Index out of range");
1616 if (ConstantDataSequential *CDS =dyn_cast<ConstantDataSequential>(Mask))
1617 return CDS->getElementAsInteger(i);
1618 Constant *C = Mask->getAggregateElement(i);
1619 if (isa<UndefValue>(C))
1621 return cast<ConstantInt>(C)->getZExtValue();
1624 /// getShuffleMask - Return the full mask for this instruction, where each
1625 /// element is the element number and undef's are returned as -1.
1626 void ShuffleVectorInst::getShuffleMask(Constant *Mask,
1627 SmallVectorImpl<int> &Result) {
1628 unsigned NumElts = Mask->getType()->getVectorNumElements();
1630 if (ConstantDataSequential *CDS=dyn_cast<ConstantDataSequential>(Mask)) {
1631 for (unsigned i = 0; i != NumElts; ++i)
1632 Result.push_back(CDS->getElementAsInteger(i));
1635 for (unsigned i = 0; i != NumElts; ++i) {
1636 Constant *C = Mask->getAggregateElement(i);
1637 Result.push_back(isa<UndefValue>(C) ? -1 :
1638 cast<ConstantInt>(C)->getZExtValue());
1643 //===----------------------------------------------------------------------===//
1644 // InsertValueInst Class
1645 //===----------------------------------------------------------------------===//
1647 void InsertValueInst::init(Value *Agg, Value *Val, ArrayRef<unsigned> Idxs,
1648 const Twine &Name) {
1649 assert(NumOperands == 2 && "NumOperands not initialized?");
1651 // There's no fundamental reason why we require at least one index
1652 // (other than weirdness with &*IdxBegin being invalid; see
1653 // getelementptr's init routine for example). But there's no
1654 // present need to support it.
1655 assert(Idxs.size() > 0 && "InsertValueInst must have at least one index");
1657 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs) ==
1658 Val->getType() && "Inserted value must match indexed type!");
1662 Indices.append(Idxs.begin(), Idxs.end());
1666 InsertValueInst::InsertValueInst(const InsertValueInst &IVI)
1667 : Instruction(IVI.getType(), InsertValue,
1668 OperandTraits<InsertValueInst>::op_begin(this), 2),
1669 Indices(IVI.Indices) {
1670 Op<0>() = IVI.getOperand(0);
1671 Op<1>() = IVI.getOperand(1);
1672 SubclassOptionalData = IVI.SubclassOptionalData;
1675 //===----------------------------------------------------------------------===//
1676 // ExtractValueInst Class
1677 //===----------------------------------------------------------------------===//
1679 void ExtractValueInst::init(ArrayRef<unsigned> Idxs, const Twine &Name) {
1680 assert(NumOperands == 1 && "NumOperands not initialized?");
1682 // There's no fundamental reason why we require at least one index.
1683 // But there's no present need to support it.
1684 assert(Idxs.size() > 0 && "ExtractValueInst must have at least one index");
1686 Indices.append(Idxs.begin(), Idxs.end());
1690 ExtractValueInst::ExtractValueInst(const ExtractValueInst &EVI)
1691 : UnaryInstruction(EVI.getType(), ExtractValue, EVI.getOperand(0)),
1692 Indices(EVI.Indices) {
1693 SubclassOptionalData = EVI.SubclassOptionalData;
1696 // getIndexedType - Returns the type of the element that would be extracted
1697 // with an extractvalue instruction with the specified parameters.
1699 // A null type is returned if the indices are invalid for the specified
1702 Type *ExtractValueInst::getIndexedType(Type *Agg,
1703 ArrayRef<unsigned> Idxs) {
1704 for (unsigned CurIdx = 0; CurIdx != Idxs.size(); ++CurIdx) {
1705 unsigned Index = Idxs[CurIdx];
1706 // We can't use CompositeType::indexValid(Index) here.
1707 // indexValid() always returns true for arrays because getelementptr allows
1708 // out-of-bounds indices. Since we don't allow those for extractvalue and
1709 // insertvalue we need to check array indexing manually.
1710 // Since the only other types we can index into are struct types it's just
1711 // as easy to check those manually as well.
1712 if (ArrayType *AT = dyn_cast<ArrayType>(Agg)) {
1713 if (Index >= AT->getNumElements())
1715 } else if (StructType *ST = dyn_cast<StructType>(Agg)) {
1716 if (Index >= ST->getNumElements())
1719 // Not a valid type to index into.
1723 Agg = cast<CompositeType>(Agg)->getTypeAtIndex(Index);
1725 return const_cast<Type*>(Agg);
1728 //===----------------------------------------------------------------------===//
1729 // BinaryOperator Class
1730 //===----------------------------------------------------------------------===//
1732 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1733 Type *Ty, const Twine &Name,
1734 Instruction *InsertBefore)
1735 : Instruction(Ty, iType,
1736 OperandTraits<BinaryOperator>::op_begin(this),
1737 OperandTraits<BinaryOperator>::operands(this),
1745 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1746 Type *Ty, const Twine &Name,
1747 BasicBlock *InsertAtEnd)
1748 : Instruction(Ty, iType,
1749 OperandTraits<BinaryOperator>::op_begin(this),
1750 OperandTraits<BinaryOperator>::operands(this),
1759 void BinaryOperator::init(BinaryOps iType) {
1760 Value *LHS = getOperand(0), *RHS = getOperand(1);
1761 (void)LHS; (void)RHS; // Silence warnings.
1762 assert(LHS->getType() == RHS->getType() &&
1763 "Binary operator operand types must match!");
1768 assert(getType() == LHS->getType() &&
1769 "Arithmetic operation should return same type as operands!");
1770 assert(getType()->isIntOrIntVectorTy() &&
1771 "Tried to create an integer operation on a non-integer type!");
1773 case FAdd: case FSub:
1775 assert(getType() == LHS->getType() &&
1776 "Arithmetic operation should return same type as operands!");
1777 assert(getType()->isFPOrFPVectorTy() &&
1778 "Tried to create a floating-point operation on a "
1779 "non-floating-point type!");
1783 assert(getType() == LHS->getType() &&
1784 "Arithmetic operation should return same type as operands!");
1785 assert((getType()->isIntegerTy() || (getType()->isVectorTy() &&
1786 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1787 "Incorrect operand type (not integer) for S/UDIV");
1790 assert(getType() == LHS->getType() &&
1791 "Arithmetic operation should return same type as operands!");
1792 assert(getType()->isFPOrFPVectorTy() &&
1793 "Incorrect operand type (not floating point) for FDIV");
1797 assert(getType() == LHS->getType() &&
1798 "Arithmetic operation should return same type as operands!");
1799 assert((getType()->isIntegerTy() || (getType()->isVectorTy() &&
1800 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1801 "Incorrect operand type (not integer) for S/UREM");
1804 assert(getType() == LHS->getType() &&
1805 "Arithmetic operation should return same type as operands!");
1806 assert(getType()->isFPOrFPVectorTy() &&
1807 "Incorrect operand type (not floating point) for FREM");
1812 assert(getType() == LHS->getType() &&
1813 "Shift operation should return same type as operands!");
1814 assert((getType()->isIntegerTy() ||
1815 (getType()->isVectorTy() &&
1816 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1817 "Tried to create a shift operation on a non-integral type!");
1821 assert(getType() == LHS->getType() &&
1822 "Logical operation should return same type as operands!");
1823 assert((getType()->isIntegerTy() ||
1824 (getType()->isVectorTy() &&
1825 cast<VectorType>(getType())->getElementType()->isIntegerTy())) &&
1826 "Tried to create a logical operation on a non-integral type!");
1834 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1836 Instruction *InsertBefore) {
1837 assert(S1->getType() == S2->getType() &&
1838 "Cannot create binary operator with two operands of differing type!");
1839 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1842 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1844 BasicBlock *InsertAtEnd) {
1845 BinaryOperator *Res = Create(Op, S1, S2, Name);
1846 InsertAtEnd->getInstList().push_back(Res);
1850 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1851 Instruction *InsertBefore) {
1852 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1853 return new BinaryOperator(Instruction::Sub,
1855 Op->getType(), Name, InsertBefore);
1858 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1859 BasicBlock *InsertAtEnd) {
1860 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1861 return new BinaryOperator(Instruction::Sub,
1863 Op->getType(), Name, InsertAtEnd);
1866 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1867 Instruction *InsertBefore) {
1868 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1869 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertBefore);
1872 BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
1873 BasicBlock *InsertAtEnd) {
1874 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1875 return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertAtEnd);
1878 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1879 Instruction *InsertBefore) {
1880 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1881 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertBefore);
1884 BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
1885 BasicBlock *InsertAtEnd) {
1886 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1887 return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertAtEnd);
1890 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1891 Instruction *InsertBefore) {
1892 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1893 return new BinaryOperator(Instruction::FSub, zero, Op,
1894 Op->getType(), Name, InsertBefore);
1897 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1898 BasicBlock *InsertAtEnd) {
1899 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1900 return new BinaryOperator(Instruction::FSub, zero, Op,
1901 Op->getType(), Name, InsertAtEnd);
1904 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1905 Instruction *InsertBefore) {
1906 Constant *C = Constant::getAllOnesValue(Op->getType());
1907 return new BinaryOperator(Instruction::Xor, Op, C,
1908 Op->getType(), Name, InsertBefore);
1911 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1912 BasicBlock *InsertAtEnd) {
1913 Constant *AllOnes = Constant::getAllOnesValue(Op->getType());
1914 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1915 Op->getType(), Name, InsertAtEnd);
1919 // isConstantAllOnes - Helper function for several functions below
1920 static inline bool isConstantAllOnes(const Value *V) {
1921 if (const Constant *C = dyn_cast<Constant>(V))
1922 return C->isAllOnesValue();
1926 bool BinaryOperator::isNeg(const Value *V) {
1927 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1928 if (Bop->getOpcode() == Instruction::Sub)
1929 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0)))
1930 return C->isNegativeZeroValue();
1934 bool BinaryOperator::isFNeg(const Value *V, bool IgnoreZeroSign) {
1935 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1936 if (Bop->getOpcode() == Instruction::FSub)
1937 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0))) {
1938 if (!IgnoreZeroSign)
1939 IgnoreZeroSign = cast<Instruction>(V)->hasNoSignedZeros();
1940 return !IgnoreZeroSign ? C->isNegativeZeroValue() : C->isZeroValue();
1945 bool BinaryOperator::isNot(const Value *V) {
1946 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1947 return (Bop->getOpcode() == Instruction::Xor &&
1948 (isConstantAllOnes(Bop->getOperand(1)) ||
1949 isConstantAllOnes(Bop->getOperand(0))));
1953 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1954 return cast<BinaryOperator>(BinOp)->getOperand(1);
1957 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1958 return getNegArgument(const_cast<Value*>(BinOp));
1961 Value *BinaryOperator::getFNegArgument(Value *BinOp) {
1962 return cast<BinaryOperator>(BinOp)->getOperand(1);
1965 const Value *BinaryOperator::getFNegArgument(const Value *BinOp) {
1966 return getFNegArgument(const_cast<Value*>(BinOp));
1969 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1970 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1971 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1972 Value *Op0 = BO->getOperand(0);
1973 Value *Op1 = BO->getOperand(1);
1974 if (isConstantAllOnes(Op0)) return Op1;
1976 assert(isConstantAllOnes(Op1));
1980 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1981 return getNotArgument(const_cast<Value*>(BinOp));
1985 // swapOperands - Exchange the two operands to this instruction. This
1986 // instruction is safe to use on any binary instruction and does not
1987 // modify the semantics of the instruction. If the instruction is
1988 // order dependent (SetLT f.e.) the opcode is changed.
1990 bool BinaryOperator::swapOperands() {
1991 if (!isCommutative())
1992 return true; // Can't commute operands
1993 Op<0>().swap(Op<1>());
1997 void BinaryOperator::setHasNoUnsignedWrap(bool b) {
1998 cast<OverflowingBinaryOperator>(this)->setHasNoUnsignedWrap(b);
2001 void BinaryOperator::setHasNoSignedWrap(bool b) {
2002 cast<OverflowingBinaryOperator>(this)->setHasNoSignedWrap(b);
2005 void BinaryOperator::setIsExact(bool b) {
2006 cast<PossiblyExactOperator>(this)->setIsExact(b);
2009 bool BinaryOperator::hasNoUnsignedWrap() const {
2010 return cast<OverflowingBinaryOperator>(this)->hasNoUnsignedWrap();
2013 bool BinaryOperator::hasNoSignedWrap() const {
2014 return cast<OverflowingBinaryOperator>(this)->hasNoSignedWrap();
2017 bool BinaryOperator::isExact() const {
2018 return cast<PossiblyExactOperator>(this)->isExact();
2021 //===----------------------------------------------------------------------===//
2022 // FPMathOperator Class
2023 //===----------------------------------------------------------------------===//
2025 /// getFPAccuracy - Get the maximum error permitted by this operation in ULPs.
2026 /// An accuracy of 0.0 means that the operation should be performed with the
2027 /// default precision.
2028 float FPMathOperator::getFPAccuracy() const {
2030 cast<Instruction>(this)->getMetadata(LLVMContext::MD_fpmath);
2033 ConstantFP *Accuracy = cast<ConstantFP>(MD->getOperand(0));
2034 return Accuracy->getValueAPF().convertToFloat();
2038 //===----------------------------------------------------------------------===//
2040 //===----------------------------------------------------------------------===//
2042 void CastInst::anchor() {}
2044 // Just determine if this cast only deals with integral->integral conversion.
2045 bool CastInst::isIntegerCast() const {
2046 switch (getOpcode()) {
2047 default: return false;
2048 case Instruction::ZExt:
2049 case Instruction::SExt:
2050 case Instruction::Trunc:
2052 case Instruction::BitCast:
2053 return getOperand(0)->getType()->isIntegerTy() &&
2054 getType()->isIntegerTy();
2058 bool CastInst::isLosslessCast() const {
2059 // Only BitCast can be lossless, exit fast if we're not BitCast
2060 if (getOpcode() != Instruction::BitCast)
2063 // Identity cast is always lossless
2064 Type* SrcTy = getOperand(0)->getType();
2065 Type* DstTy = getType();
2069 // Pointer to pointer is always lossless.
2070 if (SrcTy->isPointerTy())
2071 return DstTy->isPointerTy();
2072 return false; // Other types have no identity values
2075 /// This function determines if the CastInst does not require any bits to be
2076 /// changed in order to effect the cast. Essentially, it identifies cases where
2077 /// no code gen is necessary for the cast, hence the name no-op cast. For
2078 /// example, the following are all no-op casts:
2079 /// # bitcast i32* %x to i8*
2080 /// # bitcast <2 x i32> %x to <4 x i16>
2081 /// # ptrtoint i32* %x to i32 ; on 32-bit plaforms only
2082 /// @brief Determine if the described cast is a no-op.
2083 bool CastInst::isNoopCast(Instruction::CastOps Opcode,
2088 default: llvm_unreachable("Invalid CastOp");
2089 case Instruction::Trunc:
2090 case Instruction::ZExt:
2091 case Instruction::SExt:
2092 case Instruction::FPTrunc:
2093 case Instruction::FPExt:
2094 case Instruction::UIToFP:
2095 case Instruction::SIToFP:
2096 case Instruction::FPToUI:
2097 case Instruction::FPToSI:
2098 return false; // These always modify bits
2099 case Instruction::BitCast:
2100 return true; // BitCast never modifies bits.
2101 case Instruction::PtrToInt:
2102 return IntPtrTy->getScalarSizeInBits() ==
2103 DestTy->getScalarSizeInBits();
2104 case Instruction::IntToPtr:
2105 return IntPtrTy->getScalarSizeInBits() ==
2106 SrcTy->getScalarSizeInBits();
2110 /// @brief Determine if a cast is a no-op.
2111 bool CastInst::isNoopCast(Type *IntPtrTy) const {
2112 return isNoopCast(getOpcode(), getOperand(0)->getType(), getType(), IntPtrTy);
2115 /// This function determines if a pair of casts can be eliminated and what
2116 /// opcode should be used in the elimination. This assumes that there are two
2117 /// instructions like this:
2118 /// * %F = firstOpcode SrcTy %x to MidTy
2119 /// * %S = secondOpcode MidTy %F to DstTy
2120 /// The function returns a resultOpcode so these two casts can be replaced with:
2121 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
2122 /// If no such cast is permited, the function returns 0.
2123 unsigned CastInst::isEliminableCastPair(
2124 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
2125 Type *SrcTy, Type *MidTy, Type *DstTy, Type *SrcIntPtrTy, Type *MidIntPtrTy,
2126 Type *DstIntPtrTy) {
2127 // Define the 144 possibilities for these two cast instructions. The values
2128 // in this matrix determine what to do in a given situation and select the
2129 // case in the switch below. The rows correspond to firstOp, the columns
2130 // correspond to secondOp. In looking at the table below, keep in mind
2131 // the following cast properties:
2133 // Size Compare Source Destination
2134 // Operator Src ? Size Type Sign Type Sign
2135 // -------- ------------ ------------------- ---------------------
2136 // TRUNC > Integer Any Integral Any
2137 // ZEXT < Integral Unsigned Integer Any
2138 // SEXT < Integral Signed Integer Any
2139 // FPTOUI n/a FloatPt n/a Integral Unsigned
2140 // FPTOSI n/a FloatPt n/a Integral Signed
2141 // UITOFP n/a Integral Unsigned FloatPt n/a
2142 // SITOFP n/a Integral Signed FloatPt n/a
2143 // FPTRUNC > FloatPt n/a FloatPt n/a
2144 // FPEXT < FloatPt n/a FloatPt n/a
2145 // PTRTOINT n/a Pointer n/a Integral Unsigned
2146 // INTTOPTR n/a Integral Unsigned Pointer n/a
2147 // BITCAST = FirstClass n/a FirstClass n/a
2149 // NOTE: some transforms are safe, but we consider them to be non-profitable.
2150 // For example, we could merge "fptoui double to i32" + "zext i32 to i64",
2151 // into "fptoui double to i64", but this loses information about the range
2152 // of the produced value (we no longer know the top-part is all zeros).
2153 // Further this conversion is often much more expensive for typical hardware,
2154 // and causes issues when building libgcc. We disallow fptosi+sext for the
2156 const unsigned numCastOps =
2157 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
2158 static const uint8_t CastResults[numCastOps][numCastOps] = {
2159 // T F F U S F F P I B -+
2160 // R Z S P P I I T P 2 N T |
2161 // U E E 2 2 2 2 R E I T C +- secondOp
2162 // N X X U S F F N X N 2 V |
2163 // C T T I I P P C T T P T -+
2164 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
2165 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
2166 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
2167 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
2168 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
2169 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
2170 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
2171 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
2172 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
2173 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
2174 { 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
2175 { 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
2178 // If either of the casts are a bitcast from scalar to vector, disallow the
2179 // merging. However, bitcast of A->B->A are allowed.
2180 bool isFirstBitcast = (firstOp == Instruction::BitCast);
2181 bool isSecondBitcast = (secondOp == Instruction::BitCast);
2182 bool chainedBitcast = (SrcTy == DstTy && isFirstBitcast && isSecondBitcast);
2184 // Check if any of the bitcasts convert scalars<->vectors.
2185 if ((isFirstBitcast && isa<VectorType>(SrcTy) != isa<VectorType>(MidTy)) ||
2186 (isSecondBitcast && isa<VectorType>(MidTy) != isa<VectorType>(DstTy)))
2187 // Unless we are bitcasing to the original type, disallow optimizations.
2188 if (!chainedBitcast) return 0;
2190 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
2191 [secondOp-Instruction::CastOpsBegin];
2194 // categorically disallowed
2197 // allowed, use first cast's opcode
2200 // allowed, use second cast's opcode
2203 // no-op cast in second op implies firstOp as long as the DestTy
2204 // is integer and we are not converting between a vector and a
2206 if (!SrcTy->isVectorTy() && DstTy->isIntegerTy())
2210 // no-op cast in second op implies firstOp as long as the DestTy
2211 // is floating point.
2212 if (DstTy->isFloatingPointTy())
2216 // no-op cast in first op implies secondOp as long as the SrcTy
2218 if (SrcTy->isIntegerTy())
2222 // no-op cast in first op implies secondOp as long as the SrcTy
2223 // is a floating point.
2224 if (SrcTy->isFloatingPointTy())
2228 unsigned MidSize = MidTy->getScalarSizeInBits();
2229 // Check the address spaces first. If we know they are in the same address
2230 // space, the pointer sizes must be the same so we can still fold this
2231 // without knowing the actual sizes as long we know that the intermediate
2232 // pointer is the largest possible pointer size.
2233 if (MidSize == 64 &&
2234 SrcTy->getPointerAddressSpace() == DstTy->getPointerAddressSpace())
2235 return Instruction::BitCast;
2237 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size.
2238 if (!SrcIntPtrTy || DstIntPtrTy != SrcIntPtrTy)
2240 unsigned PtrSize = SrcIntPtrTy->getScalarSizeInBits();
2241 if (MidSize >= PtrSize)
2242 return Instruction::BitCast;
2246 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
2247 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
2248 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
2249 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2250 unsigned DstSize = DstTy->getScalarSizeInBits();
2251 if (SrcSize == DstSize)
2252 return Instruction::BitCast;
2253 else if (SrcSize < DstSize)
2257 case 9: // zext, sext -> zext, because sext can't sign extend after zext
2258 return Instruction::ZExt;
2260 // fpext followed by ftrunc is allowed if the bit size returned to is
2261 // the same as the original, in which case its just a bitcast
2263 return Instruction::BitCast;
2264 return 0; // If the types are not the same we can't eliminate it.
2266 // bitcast followed by ptrtoint is allowed as long as the bitcast is a
2267 // pointer to pointer cast, and the pointers are the same size.
2268 PointerType *SrcPtrTy = dyn_cast<PointerType>(SrcTy);
2269 PointerType *MidPtrTy = dyn_cast<PointerType>(MidTy);
2270 if (!SrcPtrTy || !MidPtrTy)
2273 // If the address spaces are the same, we know they are the same size
2274 // without size information
2275 if (SrcPtrTy->getAddressSpace() == MidPtrTy->getAddressSpace())
2278 if (!SrcIntPtrTy || !MidIntPtrTy)
2281 if (SrcIntPtrTy->getScalarSizeInBits() ==
2282 MidIntPtrTy->getScalarSizeInBits())
2288 // inttoptr, bitcast -> inttoptr if bitcast is a ptr to ptr cast
2289 // and the ptrs are to address spaces of the same size
2290 PointerType *MidPtrTy = dyn_cast<PointerType>(MidTy);
2291 PointerType *DstPtrTy = dyn_cast<PointerType>(DstTy);
2292 if (!MidPtrTy || !DstPtrTy)
2295 if (MidPtrTy->getAddressSpace() == DstPtrTy->getAddressSpace())
2300 MidIntPtrTy->getScalarSizeInBits() ==
2301 DstIntPtrTy->getScalarSizeInBits())
2306 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
2309 unsigned PtrSize = MidIntPtrTy->getScalarSizeInBits();
2310 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2311 unsigned DstSize = DstTy->getScalarSizeInBits();
2312 if (SrcSize <= PtrSize && SrcSize == DstSize)
2313 return Instruction::BitCast;
2317 // cast combination can't happen (error in input). This is for all cases
2318 // where the MidTy is not the same for the two cast instructions.
2319 llvm_unreachable("Invalid Cast Combination");
2321 llvm_unreachable("Error in CastResults table!!!");
2325 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2326 const Twine &Name, Instruction *InsertBefore) {
2327 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2328 // Construct and return the appropriate CastInst subclass
2330 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
2331 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
2332 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
2333 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
2334 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
2335 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
2336 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
2337 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
2338 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
2339 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
2340 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
2341 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
2342 default: llvm_unreachable("Invalid opcode provided");
2346 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
2347 const Twine &Name, BasicBlock *InsertAtEnd) {
2348 assert(castIsValid(op, S, Ty) && "Invalid cast!");
2349 // Construct and return the appropriate CastInst subclass
2351 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
2352 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
2353 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
2354 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
2355 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
2356 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
2357 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
2358 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
2359 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
2360 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
2361 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
2362 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
2363 default: llvm_unreachable("Invalid opcode provided");
2367 CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
2369 Instruction *InsertBefore) {
2370 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2371 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2372 return Create(Instruction::ZExt, S, Ty, Name, InsertBefore);
2375 CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
2377 BasicBlock *InsertAtEnd) {
2378 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2379 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2380 return Create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
2383 CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
2385 Instruction *InsertBefore) {
2386 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2387 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2388 return Create(Instruction::SExt, S, Ty, Name, InsertBefore);
2391 CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
2393 BasicBlock *InsertAtEnd) {
2394 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2395 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2396 return Create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
2399 CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
2401 Instruction *InsertBefore) {
2402 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2403 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2404 return Create(Instruction::Trunc, S, Ty, Name, InsertBefore);
2407 CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
2409 BasicBlock *InsertAtEnd) {
2410 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2411 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2412 return Create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
2415 CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
2417 BasicBlock *InsertAtEnd) {
2418 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
2419 assert((Ty->isIntOrIntVectorTy() || Ty->isPtrOrPtrVectorTy()) &&
2421 assert(Ty->isVectorTy() == S->getType()->isVectorTy() && "Invalid cast");
2422 assert((!Ty->isVectorTy() ||
2423 Ty->getVectorNumElements() == S->getType()->getVectorNumElements()) &&
2426 if (Ty->isIntOrIntVectorTy())
2427 return Create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
2428 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2431 /// @brief Create a BitCast or a PtrToInt cast instruction
2432 CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
2434 Instruction *InsertBefore) {
2435 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
2436 assert((Ty->isIntOrIntVectorTy() || Ty->isPtrOrPtrVectorTy()) &&
2438 assert(Ty->isVectorTy() == S->getType()->isVectorTy() && "Invalid cast");
2439 assert((!Ty->isVectorTy() ||
2440 Ty->getVectorNumElements() == S->getType()->getVectorNumElements()) &&
2443 if (Ty->isIntOrIntVectorTy())
2444 return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
2445 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2448 CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
2449 bool isSigned, const Twine &Name,
2450 Instruction *InsertBefore) {
2451 assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&
2452 "Invalid integer cast");
2453 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2454 unsigned DstBits = Ty->getScalarSizeInBits();
2455 Instruction::CastOps opcode =
2456 (SrcBits == DstBits ? Instruction::BitCast :
2457 (SrcBits > DstBits ? Instruction::Trunc :
2458 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2459 return Create(opcode, C, Ty, Name, InsertBefore);
2462 CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
2463 bool isSigned, const Twine &Name,
2464 BasicBlock *InsertAtEnd) {
2465 assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&
2467 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2468 unsigned DstBits = Ty->getScalarSizeInBits();
2469 Instruction::CastOps opcode =
2470 (SrcBits == DstBits ? Instruction::BitCast :
2471 (SrcBits > DstBits ? Instruction::Trunc :
2472 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2473 return Create(opcode, C, Ty, Name, InsertAtEnd);
2476 CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
2478 Instruction *InsertBefore) {
2479 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
2481 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2482 unsigned DstBits = Ty->getScalarSizeInBits();
2483 Instruction::CastOps opcode =
2484 (SrcBits == DstBits ? Instruction::BitCast :
2485 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2486 return Create(opcode, C, Ty, Name, InsertBefore);
2489 CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
2491 BasicBlock *InsertAtEnd) {
2492 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
2494 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2495 unsigned DstBits = Ty->getScalarSizeInBits();
2496 Instruction::CastOps opcode =
2497 (SrcBits == DstBits ? Instruction::BitCast :
2498 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2499 return Create(opcode, C, Ty, Name, InsertAtEnd);
2502 // Check whether it is valid to call getCastOpcode for these types.
2503 // This routine must be kept in sync with getCastOpcode.
2504 bool CastInst::isCastable(Type *SrcTy, Type *DestTy) {
2505 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2508 if (SrcTy == DestTy)
2511 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy))
2512 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy))
2513 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2514 // An element by element cast. Valid if casting the elements is valid.
2515 SrcTy = SrcVecTy->getElementType();
2516 DestTy = DestVecTy->getElementType();
2519 // Get the bit sizes, we'll need these
2520 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2521 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2523 // Run through the possibilities ...
2524 if (DestTy->isIntegerTy()) { // Casting to integral
2525 if (SrcTy->isIntegerTy()) { // Casting from integral
2527 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2529 } else if (SrcTy->isVectorTy()) { // Casting from vector
2530 return DestBits == SrcBits;
2531 } else { // Casting from something else
2532 return SrcTy->isPointerTy();
2534 } else if (DestTy->isFloatingPointTy()) { // Casting to floating pt
2535 if (SrcTy->isIntegerTy()) { // Casting from integral
2537 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2539 } else if (SrcTy->isVectorTy()) { // Casting from vector
2540 return DestBits == SrcBits;
2541 } else { // Casting from something else
2544 } else if (DestTy->isVectorTy()) { // Casting to vector
2545 return DestBits == SrcBits;
2546 } else if (DestTy->isPointerTy()) { // Casting to pointer
2547 if (SrcTy->isPointerTy()) { // Casting from pointer
2549 } else if (SrcTy->isIntegerTy()) { // Casting from integral
2551 } else { // Casting from something else
2554 } else if (DestTy->isX86_MMXTy()) {
2555 if (SrcTy->isVectorTy()) {
2556 return DestBits == SrcBits; // 64-bit vector to MMX
2560 } else { // Casting to something else
2565 bool CastInst::isBitCastable(Type *SrcTy, Type *DestTy) {
2566 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2569 if (SrcTy == DestTy)
2572 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy)) {
2573 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy)) {
2574 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2575 // An element by element cast. Valid if casting the elements is valid.
2576 SrcTy = SrcVecTy->getElementType();
2577 DestTy = DestVecTy->getElementType();
2582 if (PointerType *DestPtrTy = dyn_cast<PointerType>(DestTy)) {
2583 if (PointerType *SrcPtrTy = dyn_cast<PointerType>(SrcTy)) {
2584 return SrcPtrTy->getAddressSpace() == DestPtrTy->getAddressSpace();
2588 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2589 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2591 // Could still have vectors of pointers if the number of elements doesn't
2593 if (SrcBits == 0 || DestBits == 0)
2596 if (SrcBits != DestBits)
2599 if (DestTy->isX86_MMXTy() || SrcTy->isX86_MMXTy())
2605 // Provide a way to get a "cast" where the cast opcode is inferred from the
2606 // types and size of the operand. This, basically, is a parallel of the
2607 // logic in the castIsValid function below. This axiom should hold:
2608 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
2609 // should not assert in castIsValid. In other words, this produces a "correct"
2610 // casting opcode for the arguments passed to it.
2611 // This routine must be kept in sync with isCastable.
2612 Instruction::CastOps
2613 CastInst::getCastOpcode(
2614 const Value *Src, bool SrcIsSigned, Type *DestTy, bool DestIsSigned) {
2615 Type *SrcTy = Src->getType();
2617 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2618 "Only first class types are castable!");
2620 if (SrcTy == DestTy)
2623 // FIXME: Check address space sizes here
2624 if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy))
2625 if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy))
2626 if (SrcVecTy->getNumElements() == DestVecTy->getNumElements()) {
2627 // An element by element cast. Find the appropriate opcode based on the
2629 SrcTy = SrcVecTy->getElementType();
2630 DestTy = DestVecTy->getElementType();
2633 // Get the bit sizes, we'll need these
2634 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr
2635 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr
2637 // Run through the possibilities ...
2638 if (DestTy->isIntegerTy()) { // Casting to integral
2639 if (SrcTy->isIntegerTy()) { // Casting from integral
2640 if (DestBits < SrcBits)
2641 return Trunc; // int -> smaller int
2642 else if (DestBits > SrcBits) { // its an extension
2644 return SExt; // signed -> SEXT
2646 return ZExt; // unsigned -> ZEXT
2648 return BitCast; // Same size, No-op cast
2650 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2652 return FPToSI; // FP -> sint
2654 return FPToUI; // FP -> uint
2655 } else if (SrcTy->isVectorTy()) {
2656 assert(DestBits == SrcBits &&
2657 "Casting vector to integer of different width");
2658 return BitCast; // Same size, no-op cast
2660 assert(SrcTy->isPointerTy() &&
2661 "Casting from a value that is not first-class type");
2662 return PtrToInt; // ptr -> int
2664 } else if (DestTy->isFloatingPointTy()) { // Casting to floating pt
2665 if (SrcTy->isIntegerTy()) { // Casting from integral
2667 return SIToFP; // sint -> FP
2669 return UIToFP; // uint -> FP
2670 } else if (SrcTy->isFloatingPointTy()) { // Casting from floating pt
2671 if (DestBits < SrcBits) {
2672 return FPTrunc; // FP -> smaller FP
2673 } else if (DestBits > SrcBits) {
2674 return FPExt; // FP -> larger FP
2676 return BitCast; // same size, no-op cast
2678 } else if (SrcTy->isVectorTy()) {
2679 assert(DestBits == SrcBits &&
2680 "Casting vector to floating point of different width");
2681 return BitCast; // same size, no-op cast
2683 llvm_unreachable("Casting pointer or non-first class to float");
2684 } else if (DestTy->isVectorTy()) {
2685 assert(DestBits == SrcBits &&
2686 "Illegal cast to vector (wrong type or size)");
2688 } else if (DestTy->isPointerTy()) {
2689 if (SrcTy->isPointerTy()) {
2690 // TODO: Address space pointer sizes may not match
2691 return BitCast; // ptr -> ptr
2692 } else if (SrcTy->isIntegerTy()) {
2693 return IntToPtr; // int -> ptr
2695 llvm_unreachable("Casting pointer to other than pointer or int");
2696 } else if (DestTy->isX86_MMXTy()) {
2697 if (SrcTy->isVectorTy()) {
2698 assert(DestBits == SrcBits && "Casting vector of wrong width to X86_MMX");
2699 return BitCast; // 64-bit vector to MMX
2701 llvm_unreachable("Illegal cast to X86_MMX");
2703 llvm_unreachable("Casting to type that is not first-class");
2706 //===----------------------------------------------------------------------===//
2707 // CastInst SubClass Constructors
2708 //===----------------------------------------------------------------------===//
2710 /// Check that the construction parameters for a CastInst are correct. This
2711 /// could be broken out into the separate constructors but it is useful to have
2712 /// it in one place and to eliminate the redundant code for getting the sizes
2713 /// of the types involved.
2715 CastInst::castIsValid(Instruction::CastOps op, Value *S, Type *DstTy) {
2717 // Check for type sanity on the arguments
2718 Type *SrcTy = S->getType();
2720 // If this is a cast to the same type then it's trivially true.
2724 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType() ||
2725 SrcTy->isAggregateType() || DstTy->isAggregateType())
2728 // Get the size of the types in bits, we'll need this later
2729 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2730 unsigned DstBitSize = DstTy->getScalarSizeInBits();
2732 // If these are vector types, get the lengths of the vectors (using zero for
2733 // scalar types means that checking that vector lengths match also checks that
2734 // scalars are not being converted to vectors or vectors to scalars).
2735 unsigned SrcLength = SrcTy->isVectorTy() ?
2736 cast<VectorType>(SrcTy)->getNumElements() : 0;
2737 unsigned DstLength = DstTy->isVectorTy() ?
2738 cast<VectorType>(DstTy)->getNumElements() : 0;
2740 // Switch on the opcode provided
2742 default: return false; // This is an input error
2743 case Instruction::Trunc:
2744 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2745 SrcLength == DstLength && SrcBitSize > DstBitSize;
2746 case Instruction::ZExt:
2747 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2748 SrcLength == DstLength && SrcBitSize < DstBitSize;
2749 case Instruction::SExt:
2750 return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
2751 SrcLength == DstLength && SrcBitSize < DstBitSize;
2752 case Instruction::FPTrunc:
2753 return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
2754 SrcLength == DstLength && SrcBitSize > DstBitSize;
2755 case Instruction::FPExt:
2756 return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
2757 SrcLength == DstLength && SrcBitSize < DstBitSize;
2758 case Instruction::UIToFP:
2759 case Instruction::SIToFP:
2760 return SrcTy->isIntOrIntVectorTy() && DstTy->isFPOrFPVectorTy() &&
2761 SrcLength == DstLength;
2762 case Instruction::FPToUI:
2763 case Instruction::FPToSI:
2764 return SrcTy->isFPOrFPVectorTy() && DstTy->isIntOrIntVectorTy() &&
2765 SrcLength == DstLength;
2766 case Instruction::PtrToInt:
2767 if (isa<VectorType>(SrcTy) != isa<VectorType>(DstTy))
2769 if (VectorType *VT = dyn_cast<VectorType>(SrcTy))
2770 if (VT->getNumElements() != cast<VectorType>(DstTy)->getNumElements())
2772 return SrcTy->getScalarType()->isPointerTy() &&
2773 DstTy->getScalarType()->isIntegerTy();
2774 case Instruction::IntToPtr:
2775 if (isa<VectorType>(SrcTy) != isa<VectorType>(DstTy))
2777 if (VectorType *VT = dyn_cast<VectorType>(SrcTy))
2778 if (VT->getNumElements() != cast<VectorType>(DstTy)->getNumElements())
2780 return SrcTy->getScalarType()->isIntegerTy() &&
2781 DstTy->getScalarType()->isPointerTy();
2782 case Instruction::BitCast:
2783 // BitCast implies a no-op cast of type only. No bits change.
2784 // However, you can't cast pointers to anything but pointers.
2785 if (SrcTy->isPointerTy() != DstTy->isPointerTy())
2788 // Now we know we're not dealing with a pointer/non-pointer mismatch. In all
2789 // these cases, the cast is okay if the source and destination bit widths
2791 return SrcTy->getPrimitiveSizeInBits() == DstTy->getPrimitiveSizeInBits();
2795 TruncInst::TruncInst(
2796 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2797 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2798 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2801 TruncInst::TruncInst(
2802 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2803 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2804 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2808 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2809 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2810 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2814 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2815 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2816 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2819 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2820 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2821 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2825 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2826 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2827 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2830 FPTruncInst::FPTruncInst(
2831 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2832 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2833 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2836 FPTruncInst::FPTruncInst(
2837 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2838 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2839 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2842 FPExtInst::FPExtInst(
2843 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2844 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2845 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2848 FPExtInst::FPExtInst(
2849 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2850 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2851 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2854 UIToFPInst::UIToFPInst(
2855 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2856 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2857 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2860 UIToFPInst::UIToFPInst(
2861 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2862 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2863 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2866 SIToFPInst::SIToFPInst(
2867 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2868 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2869 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2872 SIToFPInst::SIToFPInst(
2873 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2874 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2875 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2878 FPToUIInst::FPToUIInst(
2879 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2880 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2881 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2884 FPToUIInst::FPToUIInst(
2885 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2886 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2887 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2890 FPToSIInst::FPToSIInst(
2891 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2892 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2893 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2896 FPToSIInst::FPToSIInst(
2897 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2898 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2899 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2902 PtrToIntInst::PtrToIntInst(
2903 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2904 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2905 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2908 PtrToIntInst::PtrToIntInst(
2909 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2910 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2911 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2914 IntToPtrInst::IntToPtrInst(
2915 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2916 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2917 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2920 IntToPtrInst::IntToPtrInst(
2921 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2922 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2923 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2926 BitCastInst::BitCastInst(
2927 Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
2928 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2929 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2932 BitCastInst::BitCastInst(
2933 Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2934 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2935 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2938 //===----------------------------------------------------------------------===//
2940 //===----------------------------------------------------------------------===//
2942 void CmpInst::anchor() {}
2944 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
2945 Value *LHS, Value *RHS, const Twine &Name,
2946 Instruction *InsertBefore)
2947 : Instruction(ty, op,
2948 OperandTraits<CmpInst>::op_begin(this),
2949 OperandTraits<CmpInst>::operands(this),
2953 setPredicate((Predicate)predicate);
2957 CmpInst::CmpInst(Type *ty, OtherOps op, unsigned short predicate,
2958 Value *LHS, Value *RHS, const Twine &Name,
2959 BasicBlock *InsertAtEnd)
2960 : Instruction(ty, op,
2961 OperandTraits<CmpInst>::op_begin(this),
2962 OperandTraits<CmpInst>::operands(this),
2966 setPredicate((Predicate)predicate);
2971 CmpInst::Create(OtherOps Op, unsigned short predicate,
2972 Value *S1, Value *S2,
2973 const Twine &Name, Instruction *InsertBefore) {
2974 if (Op == Instruction::ICmp) {
2976 return new ICmpInst(InsertBefore, CmpInst::Predicate(predicate),
2979 return new ICmpInst(CmpInst::Predicate(predicate),
2984 return new FCmpInst(InsertBefore, CmpInst::Predicate(predicate),
2987 return new FCmpInst(CmpInst::Predicate(predicate),
2992 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2993 const Twine &Name, BasicBlock *InsertAtEnd) {
2994 if (Op == Instruction::ICmp) {
2995 return new ICmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
2998 return new FCmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
3002 void CmpInst::swapOperands() {
3003 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
3006 cast<FCmpInst>(this)->swapOperands();
3009 bool CmpInst::isCommutative() const {
3010 if (const ICmpInst *IC = dyn_cast<ICmpInst>(this))
3011 return IC->isCommutative();
3012 return cast<FCmpInst>(this)->isCommutative();
3015 bool CmpInst::isEquality() const {
3016 if (const ICmpInst *IC = dyn_cast<ICmpInst>(this))
3017 return IC->isEquality();
3018 return cast<FCmpInst>(this)->isEquality();
3022 CmpInst::Predicate CmpInst::getInversePredicate(Predicate pred) {
3024 default: llvm_unreachable("Unknown cmp predicate!");
3025 case ICMP_EQ: return ICMP_NE;
3026 case ICMP_NE: return ICMP_EQ;
3027 case ICMP_UGT: return ICMP_ULE;
3028 case ICMP_ULT: return ICMP_UGE;
3029 case ICMP_UGE: return ICMP_ULT;
3030 case ICMP_ULE: return ICMP_UGT;
3031 case ICMP_SGT: return ICMP_SLE;
3032 case ICMP_SLT: return ICMP_SGE;
3033 case ICMP_SGE: return ICMP_SLT;
3034 case ICMP_SLE: return ICMP_SGT;
3036 case FCMP_OEQ: return FCMP_UNE;
3037 case FCMP_ONE: return FCMP_UEQ;
3038 case FCMP_OGT: return FCMP_ULE;
3039 case FCMP_OLT: return FCMP_UGE;
3040 case FCMP_OGE: return FCMP_ULT;
3041 case FCMP_OLE: return FCMP_UGT;
3042 case FCMP_UEQ: return FCMP_ONE;
3043 case FCMP_UNE: return FCMP_OEQ;
3044 case FCMP_UGT: return FCMP_OLE;
3045 case FCMP_ULT: return FCMP_OGE;
3046 case FCMP_UGE: return FCMP_OLT;
3047 case FCMP_ULE: return FCMP_OGT;
3048 case FCMP_ORD: return FCMP_UNO;
3049 case FCMP_UNO: return FCMP_ORD;
3050 case FCMP_TRUE: return FCMP_FALSE;
3051 case FCMP_FALSE: return FCMP_TRUE;
3055 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
3057 default: llvm_unreachable("Unknown icmp predicate!");
3058 case ICMP_EQ: case ICMP_NE:
3059 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
3061 case ICMP_UGT: return ICMP_SGT;
3062 case ICMP_ULT: return ICMP_SLT;
3063 case ICMP_UGE: return ICMP_SGE;
3064 case ICMP_ULE: return ICMP_SLE;
3068 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
3070 default: llvm_unreachable("Unknown icmp predicate!");
3071 case ICMP_EQ: case ICMP_NE:
3072 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
3074 case ICMP_SGT: return ICMP_UGT;
3075 case ICMP_SLT: return ICMP_ULT;
3076 case ICMP_SGE: return ICMP_UGE;
3077 case ICMP_SLE: return ICMP_ULE;
3081 /// Initialize a set of values that all satisfy the condition with C.
3084 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
3087 uint32_t BitWidth = C.getBitWidth();
3089 default: llvm_unreachable("Invalid ICmp opcode to ConstantRange ctor!");
3090 case ICmpInst::ICMP_EQ: ++Upper; break;
3091 case ICmpInst::ICMP_NE: ++Lower; break;
3092 case ICmpInst::ICMP_ULT:
3093 Lower = APInt::getMinValue(BitWidth);
3094 // Check for an empty-set condition.
3096 return ConstantRange(BitWidth, /*isFullSet=*/false);
3098 case ICmpInst::ICMP_SLT:
3099 Lower = APInt::getSignedMinValue(BitWidth);
3100 // Check for an empty-set condition.
3102 return ConstantRange(BitWidth, /*isFullSet=*/false);
3104 case ICmpInst::ICMP_UGT:
3105 ++Lower; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
3106 // Check for an empty-set condition.
3108 return ConstantRange(BitWidth, /*isFullSet=*/false);
3110 case ICmpInst::ICMP_SGT:
3111 ++Lower; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
3112 // Check for an empty-set condition.
3114 return ConstantRange(BitWidth, /*isFullSet=*/false);
3116 case ICmpInst::ICMP_ULE:
3117 Lower = APInt::getMinValue(BitWidth); ++Upper;
3118 // Check for a full-set condition.
3120 return ConstantRange(BitWidth, /*isFullSet=*/true);
3122 case ICmpInst::ICMP_SLE:
3123 Lower = APInt::getSignedMinValue(BitWidth); ++Upper;
3124 // Check for a full-set condition.
3126 return ConstantRange(BitWidth, /*isFullSet=*/true);
3128 case ICmpInst::ICMP_UGE:
3129 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
3130 // Check for a full-set condition.
3132 return ConstantRange(BitWidth, /*isFullSet=*/true);
3134 case ICmpInst::ICMP_SGE:
3135 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
3136 // Check for a full-set condition.
3138 return ConstantRange(BitWidth, /*isFullSet=*/true);
3141 return ConstantRange(Lower, Upper);
3144 CmpInst::Predicate CmpInst::getSwappedPredicate(Predicate pred) {
3146 default: llvm_unreachable("Unknown cmp predicate!");
3147 case ICMP_EQ: case ICMP_NE:
3149 case ICMP_SGT: return ICMP_SLT;
3150 case ICMP_SLT: return ICMP_SGT;
3151 case ICMP_SGE: return ICMP_SLE;
3152 case ICMP_SLE: return ICMP_SGE;
3153 case ICMP_UGT: return ICMP_ULT;
3154 case ICMP_ULT: return ICMP_UGT;
3155 case ICMP_UGE: return ICMP_ULE;
3156 case ICMP_ULE: return ICMP_UGE;
3158 case FCMP_FALSE: case FCMP_TRUE:
3159 case FCMP_OEQ: case FCMP_ONE:
3160 case FCMP_UEQ: case FCMP_UNE:
3161 case FCMP_ORD: case FCMP_UNO:
3163 case FCMP_OGT: return FCMP_OLT;
3164 case FCMP_OLT: return FCMP_OGT;
3165 case FCMP_OGE: return FCMP_OLE;
3166 case FCMP_OLE: return FCMP_OGE;
3167 case FCMP_UGT: return FCMP_ULT;
3168 case FCMP_ULT: return FCMP_UGT;
3169 case FCMP_UGE: return FCMP_ULE;
3170 case FCMP_ULE: return FCMP_UGE;
3174 bool CmpInst::isUnsigned(unsigned short predicate) {
3175 switch (predicate) {
3176 default: return false;
3177 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
3178 case ICmpInst::ICMP_UGE: return true;
3182 bool CmpInst::isSigned(unsigned short predicate) {
3183 switch (predicate) {
3184 default: return false;
3185 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
3186 case ICmpInst::ICMP_SGE: return true;
3190 bool CmpInst::isOrdered(unsigned short predicate) {
3191 switch (predicate) {
3192 default: return false;
3193 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
3194 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
3195 case FCmpInst::FCMP_ORD: return true;
3199 bool CmpInst::isUnordered(unsigned short predicate) {
3200 switch (predicate) {
3201 default: return false;
3202 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
3203 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
3204 case FCmpInst::FCMP_UNO: return true;
3208 bool CmpInst::isTrueWhenEqual(unsigned short predicate) {
3210 default: return false;
3211 case ICMP_EQ: case ICMP_UGE: case ICMP_ULE: case ICMP_SGE: case ICMP_SLE:
3212 case FCMP_TRUE: case FCMP_UEQ: case FCMP_UGE: case FCMP_ULE: return true;
3216 bool CmpInst::isFalseWhenEqual(unsigned short predicate) {
3218 case ICMP_NE: case ICMP_UGT: case ICMP_ULT: case ICMP_SGT: case ICMP_SLT:
3219 case FCMP_FALSE: case FCMP_ONE: case FCMP_OGT: case FCMP_OLT: return true;
3220 default: return false;
3225 //===----------------------------------------------------------------------===//
3226 // SwitchInst Implementation
3227 //===----------------------------------------------------------------------===//
3229 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumReserved) {
3230 assert(Value && Default && NumReserved);
3231 ReservedSpace = NumReserved;
3233 OperandList = allocHungoffUses(ReservedSpace);
3235 OperandList[0] = Value;
3236 OperandList[1] = Default;
3239 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
3240 /// switch on and a default destination. The number of additional cases can
3241 /// be specified here to make memory allocation more efficient. This
3242 /// constructor can also autoinsert before another instruction.
3243 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
3244 Instruction *InsertBefore)
3245 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
3246 0, 0, InsertBefore) {
3247 init(Value, Default, 2+NumCases*2);
3250 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
3251 /// switch on and a default destination. The number of additional cases can
3252 /// be specified here to make memory allocation more efficient. This
3253 /// constructor also autoinserts at the end of the specified BasicBlock.
3254 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
3255 BasicBlock *InsertAtEnd)
3256 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
3257 0, 0, InsertAtEnd) {
3258 init(Value, Default, 2+NumCases*2);
3261 SwitchInst::SwitchInst(const SwitchInst &SI)
3262 : TerminatorInst(SI.getType(), Instruction::Switch, 0, 0) {
3263 init(SI.getCondition(), SI.getDefaultDest(), SI.getNumOperands());
3264 NumOperands = SI.getNumOperands();
3265 Use *OL = OperandList, *InOL = SI.OperandList;
3266 for (unsigned i = 2, E = SI.getNumOperands(); i != E; i += 2) {
3268 OL[i+1] = InOL[i+1];
3270 SubclassOptionalData = SI.SubclassOptionalData;
3273 SwitchInst::~SwitchInst() {
3278 /// addCase - Add an entry to the switch instruction...
3280 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
3281 unsigned NewCaseIdx = getNumCases();
3282 unsigned OpNo = NumOperands;
3283 if (OpNo+2 > ReservedSpace)
3284 growOperands(); // Get more space!
3285 // Initialize some new operands.
3286 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
3287 NumOperands = OpNo+2;
3288 CaseIt Case(this, NewCaseIdx);
3289 Case.setValue(OnVal);
3290 Case.setSuccessor(Dest);
3293 /// removeCase - This method removes the specified case and its successor
3294 /// from the switch instruction.
3295 void SwitchInst::removeCase(CaseIt i) {
3296 unsigned idx = i.getCaseIndex();
3298 assert(2 + idx*2 < getNumOperands() && "Case index out of range!!!");
3300 unsigned NumOps = getNumOperands();
3301 Use *OL = OperandList;
3303 // Overwrite this case with the end of the list.
3304 if (2 + (idx + 1) * 2 != NumOps) {
3305 OL[2 + idx * 2] = OL[NumOps - 2];
3306 OL[2 + idx * 2 + 1] = OL[NumOps - 1];
3309 // Nuke the last value.
3310 OL[NumOps-2].set(0);
3311 OL[NumOps-2+1].set(0);
3312 NumOperands = NumOps-2;
3315 /// growOperands - grow operands - This grows the operand list in response
3316 /// to a push_back style of operation. This grows the number of ops by 3 times.
3318 void SwitchInst::growOperands() {
3319 unsigned e = getNumOperands();
3320 unsigned NumOps = e*3;
3322 ReservedSpace = NumOps;
3323 Use *NewOps = allocHungoffUses(NumOps);
3324 Use *OldOps = OperandList;
3325 for (unsigned i = 0; i != e; ++i) {
3326 NewOps[i] = OldOps[i];
3328 OperandList = NewOps;
3329 Use::zap(OldOps, OldOps + e, true);
3333 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
3334 return getSuccessor(idx);
3336 unsigned SwitchInst::getNumSuccessorsV() const {
3337 return getNumSuccessors();
3339 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3340 setSuccessor(idx, B);
3343 //===----------------------------------------------------------------------===//
3344 // IndirectBrInst Implementation
3345 //===----------------------------------------------------------------------===//
3347 void IndirectBrInst::init(Value *Address, unsigned NumDests) {
3348 assert(Address && Address->getType()->isPointerTy() &&
3349 "Address of indirectbr must be a pointer");
3350 ReservedSpace = 1+NumDests;
3352 OperandList = allocHungoffUses(ReservedSpace);
3354 OperandList[0] = Address;
3358 /// growOperands - grow operands - This grows the operand list in response
3359 /// to a push_back style of operation. This grows the number of ops by 2 times.
3361 void IndirectBrInst::growOperands() {
3362 unsigned e = getNumOperands();
3363 unsigned NumOps = e*2;
3365 ReservedSpace = NumOps;
3366 Use *NewOps = allocHungoffUses(NumOps);
3367 Use *OldOps = OperandList;
3368 for (unsigned i = 0; i != e; ++i)
3369 NewOps[i] = OldOps[i];
3370 OperandList = NewOps;
3371 Use::zap(OldOps, OldOps + e, true);
3374 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3375 Instruction *InsertBefore)
3376 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3377 0, 0, InsertBefore) {
3378 init(Address, NumCases);
3381 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3382 BasicBlock *InsertAtEnd)
3383 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3384 0, 0, InsertAtEnd) {
3385 init(Address, NumCases);
3388 IndirectBrInst::IndirectBrInst(const IndirectBrInst &IBI)
3389 : TerminatorInst(Type::getVoidTy(IBI.getContext()), Instruction::IndirectBr,
3390 allocHungoffUses(IBI.getNumOperands()),
3391 IBI.getNumOperands()) {
3392 Use *OL = OperandList, *InOL = IBI.OperandList;
3393 for (unsigned i = 0, E = IBI.getNumOperands(); i != E; ++i)
3395 SubclassOptionalData = IBI.SubclassOptionalData;
3398 IndirectBrInst::~IndirectBrInst() {
3402 /// addDestination - Add a destination.
3404 void IndirectBrInst::addDestination(BasicBlock *DestBB) {
3405 unsigned OpNo = NumOperands;
3406 if (OpNo+1 > ReservedSpace)
3407 growOperands(); // Get more space!
3408 // Initialize some new operands.
3409 assert(OpNo < ReservedSpace && "Growing didn't work!");
3410 NumOperands = OpNo+1;
3411 OperandList[OpNo] = DestBB;
3414 /// removeDestination - This method removes the specified successor from the
3415 /// indirectbr instruction.
3416 void IndirectBrInst::removeDestination(unsigned idx) {
3417 assert(idx < getNumOperands()-1 && "Successor index out of range!");
3419 unsigned NumOps = getNumOperands();
3420 Use *OL = OperandList;
3422 // Replace this value with the last one.
3423 OL[idx+1] = OL[NumOps-1];
3425 // Nuke the last value.
3426 OL[NumOps-1].set(0);
3427 NumOperands = NumOps-1;
3430 BasicBlock *IndirectBrInst::getSuccessorV(unsigned idx) const {
3431 return getSuccessor(idx);
3433 unsigned IndirectBrInst::getNumSuccessorsV() const {
3434 return getNumSuccessors();
3436 void IndirectBrInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3437 setSuccessor(idx, B);
3440 //===----------------------------------------------------------------------===//
3441 // clone_impl() implementations
3442 //===----------------------------------------------------------------------===//
3444 // Define these methods here so vtables don't get emitted into every translation
3445 // unit that uses these classes.
3447 GetElementPtrInst *GetElementPtrInst::clone_impl() const {
3448 return new (getNumOperands()) GetElementPtrInst(*this);
3451 BinaryOperator *BinaryOperator::clone_impl() const {
3452 return Create(getOpcode(), Op<0>(), Op<1>());
3455 FCmpInst* FCmpInst::clone_impl() const {
3456 return new FCmpInst(getPredicate(), Op<0>(), Op<1>());
3459 ICmpInst* ICmpInst::clone_impl() const {
3460 return new ICmpInst(getPredicate(), Op<0>(), Op<1>());
3463 ExtractValueInst *ExtractValueInst::clone_impl() const {
3464 return new ExtractValueInst(*this);
3467 InsertValueInst *InsertValueInst::clone_impl() const {
3468 return new InsertValueInst(*this);
3471 AllocaInst *AllocaInst::clone_impl() const {
3472 return new AllocaInst(getAllocatedType(),
3473 (Value*)getOperand(0),
3477 LoadInst *LoadInst::clone_impl() const {
3478 return new LoadInst(getOperand(0), Twine(), isVolatile(),
3479 getAlignment(), getOrdering(), getSynchScope());
3482 StoreInst *StoreInst::clone_impl() const {
3483 return new StoreInst(getOperand(0), getOperand(1), isVolatile(),
3484 getAlignment(), getOrdering(), getSynchScope());
3488 AtomicCmpXchgInst *AtomicCmpXchgInst::clone_impl() const {
3489 AtomicCmpXchgInst *Result =
3490 new AtomicCmpXchgInst(getOperand(0), getOperand(1), getOperand(2),
3491 getOrdering(), getSynchScope());
3492 Result->setVolatile(isVolatile());
3496 AtomicRMWInst *AtomicRMWInst::clone_impl() const {
3497 AtomicRMWInst *Result =
3498 new AtomicRMWInst(getOperation(),getOperand(0), getOperand(1),
3499 getOrdering(), getSynchScope());
3500 Result->setVolatile(isVolatile());
3504 FenceInst *FenceInst::clone_impl() const {
3505 return new FenceInst(getContext(), getOrdering(), getSynchScope());
3508 TruncInst *TruncInst::clone_impl() const {
3509 return new TruncInst(getOperand(0), getType());
3512 ZExtInst *ZExtInst::clone_impl() const {
3513 return new ZExtInst(getOperand(0), getType());
3516 SExtInst *SExtInst::clone_impl() const {
3517 return new SExtInst(getOperand(0), getType());
3520 FPTruncInst *FPTruncInst::clone_impl() const {
3521 return new FPTruncInst(getOperand(0), getType());
3524 FPExtInst *FPExtInst::clone_impl() const {
3525 return new FPExtInst(getOperand(0), getType());
3528 UIToFPInst *UIToFPInst::clone_impl() const {
3529 return new UIToFPInst(getOperand(0), getType());
3532 SIToFPInst *SIToFPInst::clone_impl() const {
3533 return new SIToFPInst(getOperand(0), getType());
3536 FPToUIInst *FPToUIInst::clone_impl() const {
3537 return new FPToUIInst(getOperand(0), getType());
3540 FPToSIInst *FPToSIInst::clone_impl() const {
3541 return new FPToSIInst(getOperand(0), getType());
3544 PtrToIntInst *PtrToIntInst::clone_impl() const {
3545 return new PtrToIntInst(getOperand(0), getType());
3548 IntToPtrInst *IntToPtrInst::clone_impl() const {
3549 return new IntToPtrInst(getOperand(0), getType());
3552 BitCastInst *BitCastInst::clone_impl() const {
3553 return new BitCastInst(getOperand(0), getType());
3556 CallInst *CallInst::clone_impl() const {
3557 return new(getNumOperands()) CallInst(*this);
3560 SelectInst *SelectInst::clone_impl() const {
3561 return SelectInst::Create(getOperand(0), getOperand(1), getOperand(2));
3564 VAArgInst *VAArgInst::clone_impl() const {
3565 return new VAArgInst(getOperand(0), getType());
3568 ExtractElementInst *ExtractElementInst::clone_impl() const {
3569 return ExtractElementInst::Create(getOperand(0), getOperand(1));
3572 InsertElementInst *InsertElementInst::clone_impl() const {
3573 return InsertElementInst::Create(getOperand(0), getOperand(1), getOperand(2));
3576 ShuffleVectorInst *ShuffleVectorInst::clone_impl() const {
3577 return new ShuffleVectorInst(getOperand(0), getOperand(1), getOperand(2));
3580 PHINode *PHINode::clone_impl() const {
3581 return new PHINode(*this);
3584 LandingPadInst *LandingPadInst::clone_impl() const {
3585 return new LandingPadInst(*this);
3588 ReturnInst *ReturnInst::clone_impl() const {
3589 return new(getNumOperands()) ReturnInst(*this);
3592 BranchInst *BranchInst::clone_impl() const {
3593 return new(getNumOperands()) BranchInst(*this);
3596 SwitchInst *SwitchInst::clone_impl() const {
3597 return new SwitchInst(*this);
3600 IndirectBrInst *IndirectBrInst::clone_impl() const {
3601 return new IndirectBrInst(*this);
3605 InvokeInst *InvokeInst::clone_impl() const {
3606 return new(getNumOperands()) InvokeInst(*this);
3609 ResumeInst *ResumeInst::clone_impl() const {
3610 return new(1) ResumeInst(*this);
3613 UnreachableInst *UnreachableInst::clone_impl() const {
3614 LLVMContext &Context = getContext();
3615 return new UnreachableInst(Context);