1 //===-- Instructions.cpp - Implement the LLVM instructions ----------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements all of the non-inline methods for the LLVM instruction
13 //===----------------------------------------------------------------------===//
15 #include "LLVMContextImpl.h"
16 #include "llvm/Constants.h"
17 #include "llvm/DerivedTypes.h"
18 #include "llvm/Function.h"
19 #include "llvm/Instructions.h"
20 #include "llvm/Module.h"
21 #include "llvm/Operator.h"
22 #include "llvm/Analysis/Dominators.h"
23 #include "llvm/Support/ErrorHandling.h"
24 #include "llvm/Support/CallSite.h"
25 #include "llvm/Support/ConstantRange.h"
26 #include "llvm/Support/MathExtras.h"
30 //===----------------------------------------------------------------------===//
32 //===----------------------------------------------------------------------===//
34 #define CALLSITE_DELEGATE_GETTER(METHOD) \
35 Instruction *II(getInstruction()); \
37 ? cast<CallInst>(II)->METHOD \
38 : cast<InvokeInst>(II)->METHOD
40 #define CALLSITE_DELEGATE_SETTER(METHOD) \
41 Instruction *II(getInstruction()); \
43 cast<CallInst>(II)->METHOD; \
45 cast<InvokeInst>(II)->METHOD
47 CallSite::CallSite(Instruction *C) {
48 assert((isa<CallInst>(C) || isa<InvokeInst>(C)) && "Not a call!");
50 I.setInt(isa<CallInst>(C));
52 CallingConv::ID CallSite::getCallingConv() const {
53 CALLSITE_DELEGATE_GETTER(getCallingConv());
55 void CallSite::setCallingConv(CallingConv::ID CC) {
56 CALLSITE_DELEGATE_SETTER(setCallingConv(CC));
58 const AttrListPtr &CallSite::getAttributes() const {
59 CALLSITE_DELEGATE_GETTER(getAttributes());
61 void CallSite::setAttributes(const AttrListPtr &PAL) {
62 CALLSITE_DELEGATE_SETTER(setAttributes(PAL));
64 bool CallSite::paramHasAttr(uint16_t i, Attributes attr) const {
65 CALLSITE_DELEGATE_GETTER(paramHasAttr(i, attr));
67 uint16_t CallSite::getParamAlignment(uint16_t i) const {
68 CALLSITE_DELEGATE_GETTER(getParamAlignment(i));
70 bool CallSite::doesNotAccessMemory() const {
71 CALLSITE_DELEGATE_GETTER(doesNotAccessMemory());
73 void CallSite::setDoesNotAccessMemory(bool doesNotAccessMemory) {
74 CALLSITE_DELEGATE_SETTER(setDoesNotAccessMemory(doesNotAccessMemory));
76 bool CallSite::onlyReadsMemory() const {
77 CALLSITE_DELEGATE_GETTER(onlyReadsMemory());
79 void CallSite::setOnlyReadsMemory(bool onlyReadsMemory) {
80 CALLSITE_DELEGATE_SETTER(setOnlyReadsMemory(onlyReadsMemory));
82 bool CallSite::doesNotReturn() const {
83 CALLSITE_DELEGATE_GETTER(doesNotReturn());
85 void CallSite::setDoesNotReturn(bool doesNotReturn) {
86 CALLSITE_DELEGATE_SETTER(setDoesNotReturn(doesNotReturn));
88 bool CallSite::doesNotThrow() const {
89 CALLSITE_DELEGATE_GETTER(doesNotThrow());
91 void CallSite::setDoesNotThrow(bool doesNotThrow) {
92 CALLSITE_DELEGATE_SETTER(setDoesNotThrow(doesNotThrow));
95 bool CallSite::hasArgument(const Value *Arg) const {
96 for (arg_iterator AI = this->arg_begin(), E = this->arg_end(); AI != E; ++AI)
102 #undef CALLSITE_DELEGATE_GETTER
103 #undef CALLSITE_DELEGATE_SETTER
105 //===----------------------------------------------------------------------===//
106 // TerminatorInst Class
107 //===----------------------------------------------------------------------===//
109 // Out of line virtual method, so the vtable, etc has a home.
110 TerminatorInst::~TerminatorInst() {
113 //===----------------------------------------------------------------------===//
114 // UnaryInstruction Class
115 //===----------------------------------------------------------------------===//
117 // Out of line virtual method, so the vtable, etc has a home.
118 UnaryInstruction::~UnaryInstruction() {
121 //===----------------------------------------------------------------------===//
123 //===----------------------------------------------------------------------===//
125 /// areInvalidOperands - Return a string if the specified operands are invalid
126 /// for a select operation, otherwise return null.
127 const char *SelectInst::areInvalidOperands(Value *Op0, Value *Op1, Value *Op2) {
128 if (Op1->getType() != Op2->getType())
129 return "both values to select must have same type";
131 if (const VectorType *VT = dyn_cast<VectorType>(Op0->getType())) {
133 if (VT->getElementType() != Type::getInt1Ty(Op0->getContext()))
134 return "vector select condition element type must be i1";
135 const VectorType *ET = dyn_cast<VectorType>(Op1->getType());
137 return "selected values for vector select must be vectors";
138 if (ET->getNumElements() != VT->getNumElements())
139 return "vector select requires selected vectors to have "
140 "the same vector length as select condition";
141 } else if (Op0->getType() != Type::getInt1Ty(Op0->getContext())) {
142 return "select condition must be i1 or <n x i1>";
148 //===----------------------------------------------------------------------===//
150 //===----------------------------------------------------------------------===//
152 PHINode::PHINode(const PHINode &PN)
153 : Instruction(PN.getType(), Instruction::PHI,
154 allocHungoffUses(PN.getNumOperands()), PN.getNumOperands()),
155 ReservedSpace(PN.getNumOperands()) {
156 Use *OL = OperandList;
157 for (unsigned i = 0, e = PN.getNumOperands(); i != e; i+=2) {
158 OL[i] = PN.getOperand(i);
159 OL[i+1] = PN.getOperand(i+1);
161 SubclassOptionalData = PN.SubclassOptionalData;
164 PHINode::~PHINode() {
166 dropHungoffUses(OperandList);
169 // removeIncomingValue - Remove an incoming value. This is useful if a
170 // predecessor basic block is deleted.
171 Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
172 unsigned NumOps = getNumOperands();
173 Use *OL = OperandList;
174 assert(Idx*2 < NumOps && "BB not in PHI node!");
175 Value *Removed = OL[Idx*2];
177 // Move everything after this operand down.
179 // FIXME: we could just swap with the end of the list, then erase. However,
180 // client might not expect this to happen. The code as it is thrashes the
181 // use/def lists, which is kinda lame.
182 for (unsigned i = (Idx+1)*2; i != NumOps; i += 2) {
187 // Nuke the last value.
189 OL[NumOps-2+1].set(0);
190 NumOperands = NumOps-2;
192 // If the PHI node is dead, because it has zero entries, nuke it now.
193 if (NumOps == 2 && DeletePHIIfEmpty) {
194 // If anyone is using this PHI, make them use a dummy value instead...
195 replaceAllUsesWith(UndefValue::get(getType()));
201 /// resizeOperands - resize operands - This adjusts the length of the operands
202 /// list according to the following behavior:
203 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
204 /// of operation. This grows the number of ops by 1.5 times.
205 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
206 /// 3. If NumOps == NumOperands, trim the reserved space.
208 void PHINode::resizeOperands(unsigned NumOps) {
209 unsigned e = getNumOperands();
212 if (NumOps < 4) NumOps = 4; // 4 op PHI nodes are VERY common.
213 } else if (NumOps*2 > NumOperands) {
215 if (ReservedSpace >= NumOps) return;
216 } else if (NumOps == NumOperands) {
217 if (ReservedSpace == NumOps) return;
222 ReservedSpace = NumOps;
223 Use *OldOps = OperandList;
224 Use *NewOps = allocHungoffUses(NumOps);
225 std::copy(OldOps, OldOps + e, NewOps);
226 OperandList = NewOps;
227 if (OldOps) Use::zap(OldOps, OldOps + e, true);
230 /// hasConstantValue - If the specified PHI node always merges together the same
231 /// value, return the value, otherwise return null.
233 /// If the PHI has undef operands, but all the rest of the operands are
234 /// some unique value, return that value if it can be proved that the
235 /// value dominates the PHI. If DT is null, use a conservative check,
236 /// otherwise use DT to test for dominance.
238 Value *PHINode::hasConstantValue(DominatorTree *DT) const {
239 // If the PHI node only has one incoming value, eliminate the PHI node.
240 if (getNumIncomingValues() == 1) {
241 if (getIncomingValue(0) != this) // not X = phi X
242 return getIncomingValue(0);
243 return UndefValue::get(getType()); // Self cycle is dead.
246 // Otherwise if all of the incoming values are the same for the PHI, replace
247 // the PHI node with the incoming value.
250 bool HasUndefInput = false;
251 for (unsigned i = 0, e = getNumIncomingValues(); i != e; ++i)
252 if (isa<UndefValue>(getIncomingValue(i))) {
253 HasUndefInput = true;
254 } else if (getIncomingValue(i) != this) { // Not the PHI node itself...
255 if (InVal && getIncomingValue(i) != InVal)
256 return 0; // Not the same, bail out.
257 InVal = getIncomingValue(i);
260 // The only case that could cause InVal to be null is if we have a PHI node
261 // that only has entries for itself. In this case, there is no entry into the
262 // loop, so kill the PHI.
264 if (InVal == 0) InVal = UndefValue::get(getType());
266 // If we have a PHI node like phi(X, undef, X), where X is defined by some
267 // instruction, we cannot always return X as the result of the PHI node. Only
268 // do this if X is not an instruction (thus it must dominate the PHI block),
269 // or if the client is prepared to deal with this possibility.
270 if (!HasUndefInput || !isa<Instruction>(InVal))
273 Instruction *IV = cast<Instruction>(InVal);
275 // We have a DominatorTree. Do a precise test.
276 if (!DT->dominates(IV, this))
279 // If it is in the entry block, it obviously dominates everything.
280 if (IV->getParent() != &IV->getParent()->getParent()->getEntryBlock() ||
282 return 0; // Cannot guarantee that InVal dominates this PHINode.
285 // All of the incoming values are the same, return the value now.
290 //===----------------------------------------------------------------------===//
291 // CallInst Implementation
292 //===----------------------------------------------------------------------===//
294 CallInst::~CallInst() {
297 void CallInst::init(Value *Func, Value* const *Params, unsigned NumParams) {
298 assert(NumOperands == NumParams+1 && "NumOperands not set up?");
299 Use *OL = OperandList;
302 const FunctionType *FTy =
303 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
304 FTy = FTy; // silence warning.
306 assert((NumParams == FTy->getNumParams() ||
307 (FTy->isVarArg() && NumParams > FTy->getNumParams())) &&
308 "Calling a function with bad signature!");
309 for (unsigned i = 0; i != NumParams; ++i) {
310 assert((i >= FTy->getNumParams() ||
311 FTy->getParamType(i) == Params[i]->getType()) &&
312 "Calling a function with a bad signature!");
317 void CallInst::init(Value *Func, Value *Actual1, Value *Actual2) {
318 assert(NumOperands == 3 && "NumOperands not set up?");
319 Use *OL = OperandList;
324 const FunctionType *FTy =
325 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
326 FTy = FTy; // silence warning.
328 assert((FTy->getNumParams() == 2 ||
329 (FTy->isVarArg() && FTy->getNumParams() < 2)) &&
330 "Calling a function with bad signature");
331 assert((0 >= FTy->getNumParams() ||
332 FTy->getParamType(0) == Actual1->getType()) &&
333 "Calling a function with a bad signature!");
334 assert((1 >= FTy->getNumParams() ||
335 FTy->getParamType(1) == Actual2->getType()) &&
336 "Calling a function with a bad signature!");
339 void CallInst::init(Value *Func, Value *Actual) {
340 assert(NumOperands == 2 && "NumOperands not set up?");
341 Use *OL = OperandList;
345 const FunctionType *FTy =
346 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
347 FTy = FTy; // silence warning.
349 assert((FTy->getNumParams() == 1 ||
350 (FTy->isVarArg() && FTy->getNumParams() == 0)) &&
351 "Calling a function with bad signature");
352 assert((0 == FTy->getNumParams() ||
353 FTy->getParamType(0) == Actual->getType()) &&
354 "Calling a function with a bad signature!");
357 void CallInst::init(Value *Func) {
358 assert(NumOperands == 1 && "NumOperands not set up?");
359 Use *OL = OperandList;
362 const FunctionType *FTy =
363 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
364 FTy = FTy; // silence warning.
366 assert(FTy->getNumParams() == 0 && "Calling a function with bad signature");
369 CallInst::CallInst(Value *Func, Value* Actual, const Twine &Name,
370 Instruction *InsertBefore)
371 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
372 ->getElementType())->getReturnType(),
374 OperandTraits<CallInst>::op_end(this) - 2,
380 CallInst::CallInst(Value *Func, Value* Actual, const Twine &Name,
381 BasicBlock *InsertAtEnd)
382 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
383 ->getElementType())->getReturnType(),
385 OperandTraits<CallInst>::op_end(this) - 2,
390 CallInst::CallInst(Value *Func, const Twine &Name,
391 Instruction *InsertBefore)
392 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
393 ->getElementType())->getReturnType(),
395 OperandTraits<CallInst>::op_end(this) - 1,
401 CallInst::CallInst(Value *Func, const Twine &Name,
402 BasicBlock *InsertAtEnd)
403 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
404 ->getElementType())->getReturnType(),
406 OperandTraits<CallInst>::op_end(this) - 1,
412 CallInst::CallInst(const CallInst &CI)
413 : Instruction(CI.getType(), Instruction::Call,
414 OperandTraits<CallInst>::op_end(this) - CI.getNumOperands(),
415 CI.getNumOperands()) {
416 setAttributes(CI.getAttributes());
417 SubclassData = CI.SubclassData;
418 Use *OL = OperandList;
419 Use *InOL = CI.OperandList;
420 for (unsigned i = 0, e = CI.getNumOperands(); i != e; ++i)
422 SubclassOptionalData = CI.SubclassOptionalData;
425 void CallInst::addAttribute(unsigned i, Attributes attr) {
426 AttrListPtr PAL = getAttributes();
427 PAL = PAL.addAttr(i, attr);
431 void CallInst::removeAttribute(unsigned i, Attributes attr) {
432 AttrListPtr PAL = getAttributes();
433 PAL = PAL.removeAttr(i, attr);
437 bool CallInst::paramHasAttr(unsigned i, Attributes attr) const {
438 if (AttributeList.paramHasAttr(i, attr))
440 if (const Function *F = getCalledFunction())
441 return F->paramHasAttr(i, attr);
445 /// IsConstantOne - Return true only if val is constant int 1
446 static bool IsConstantOne(Value *val) {
447 assert(val && "IsConstantOne does not work with NULL val");
448 return isa<ConstantInt>(val) && cast<ConstantInt>(val)->isOne();
451 static Value *checkArraySize(Value *Amt, const Type *IntPtrTy) {
453 Amt = ConstantInt::get(IntPtrTy, 1);
455 assert(!isa<BasicBlock>(Amt) &&
456 "Passed basic block into malloc size parameter! Use other ctor");
457 assert(Amt->getType() == IntPtrTy &&
458 "Malloc array size is not an intptr!");
463 static Instruction *createMalloc(Instruction *InsertBefore,
464 BasicBlock *InsertAtEnd, const Type *IntPtrTy,
465 const Type *AllocTy, Value *ArraySize,
466 Function *MallocF, const Twine &NameStr) {
467 assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&
468 "createMalloc needs either InsertBefore or InsertAtEnd");
470 // malloc(type) becomes:
471 // bitcast (i8* malloc(typeSize)) to type*
472 // malloc(type, arraySize) becomes:
473 // bitcast (i8 *malloc(typeSize*arraySize)) to type*
474 Value *AllocSize = ConstantExpr::getSizeOf(AllocTy);
475 AllocSize = ConstantExpr::getTruncOrBitCast(cast<Constant>(AllocSize),
477 ArraySize = checkArraySize(ArraySize, IntPtrTy);
479 if (!IsConstantOne(ArraySize)) {
480 if (IsConstantOne(AllocSize)) {
481 AllocSize = ArraySize; // Operand * 1 = Operand
482 } else if (Constant *CO = dyn_cast<Constant>(ArraySize)) {
483 Constant *Scale = ConstantExpr::getIntegerCast(CO, IntPtrTy,
485 // Malloc arg is constant product of type size and array size
486 AllocSize = ConstantExpr::getMul(Scale, cast<Constant>(AllocSize));
488 // Multiply type size by the array size...
490 AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
491 "mallocsize", InsertBefore);
493 AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
494 "mallocsize", InsertAtEnd);
498 assert(AllocSize->getType() == IntPtrTy && "malloc arg is wrong size");
499 // Create the call to Malloc.
500 BasicBlock* BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
501 Module* M = BB->getParent()->getParent();
502 const Type *BPTy = Type::getInt8PtrTy(BB->getContext());
504 // prototype malloc as "void *malloc(size_t)"
505 MallocF = cast<Function>(M->getOrInsertFunction("malloc", BPTy,
507 if (!MallocF->doesNotAlias(0)) MallocF->setDoesNotAlias(0);
508 const PointerType *AllocPtrType = PointerType::getUnqual(AllocTy);
509 CallInst *MCall = NULL;
510 Instruction *Result = NULL;
512 MCall = CallInst::Create(MallocF, AllocSize, "malloccall", InsertBefore);
514 if (Result->getType() != AllocPtrType)
515 // Create a cast instruction to convert to the right type...
516 Result = new BitCastInst(MCall, AllocPtrType, NameStr, InsertBefore);
518 MCall = CallInst::Create(MallocF, AllocSize, "malloccall");
520 if (Result->getType() != AllocPtrType) {
521 InsertAtEnd->getInstList().push_back(MCall);
522 // Create a cast instruction to convert to the right type...
523 Result = new BitCastInst(MCall, AllocPtrType, NameStr);
526 MCall->setTailCall();
527 assert(MCall->getType() != Type::getVoidTy(BB->getContext()) &&
528 "Malloc has void return type");
533 /// CreateMalloc - Generate the IR for a call to malloc:
534 /// 1. Compute the malloc call's argument as the specified type's size,
535 /// possibly multiplied by the array size if the array size is not
537 /// 2. Call malloc with that argument.
538 /// 3. Bitcast the result of the malloc call to the specified type.
539 Instruction *CallInst::CreateMalloc(Instruction *InsertBefore,
540 const Type *IntPtrTy, const Type *AllocTy,
541 Value *ArraySize, const Twine &Name) {
542 return createMalloc(InsertBefore, NULL, IntPtrTy, AllocTy,
543 ArraySize, NULL, Name);
546 /// CreateMalloc - Generate the IR for a call to malloc:
547 /// 1. Compute the malloc call's argument as the specified type's size,
548 /// possibly multiplied by the array size if the array size is not
550 /// 2. Call malloc with that argument.
551 /// 3. Bitcast the result of the malloc call to the specified type.
552 /// Note: This function does not add the bitcast to the basic block, that is the
553 /// responsibility of the caller.
554 Instruction *CallInst::CreateMalloc(BasicBlock *InsertAtEnd,
555 const Type *IntPtrTy, const Type *AllocTy,
556 Value *ArraySize, Function* MallocF,
558 return createMalloc(NULL, InsertAtEnd, IntPtrTy, AllocTy,
559 ArraySize, MallocF, Name);
562 static Instruction* createFree(Value* Source, Instruction *InsertBefore,
563 BasicBlock *InsertAtEnd) {
564 assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&
565 "createFree needs either InsertBefore or InsertAtEnd");
566 assert(isa<PointerType>(Source->getType()) &&
567 "Can not free something of nonpointer type!");
569 BasicBlock* BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
570 Module* M = BB->getParent()->getParent();
572 const Type *VoidTy = Type::getVoidTy(M->getContext());
573 const Type *IntPtrTy = Type::getInt8PtrTy(M->getContext());
574 // prototype free as "void free(void*)"
575 Constant *FreeFunc = M->getOrInsertFunction("free", VoidTy, IntPtrTy, NULL);
577 CallInst* Result = NULL;
578 Value *PtrCast = Source;
580 if (Source->getType() != IntPtrTy)
581 PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertBefore);
582 Result = CallInst::Create(FreeFunc, PtrCast, "", InsertBefore);
584 if (Source->getType() != IntPtrTy)
585 PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertAtEnd);
586 Result = CallInst::Create(FreeFunc, PtrCast, "");
588 Result->setTailCall();
593 /// CreateFree - Generate the IR for a call to the builtin free function.
594 void CallInst::CreateFree(Value* Source, Instruction *InsertBefore) {
595 createFree(Source, InsertBefore, NULL);
598 /// CreateFree - Generate the IR for a call to the builtin free function.
599 /// Note: This function does not add the call to the basic block, that is the
600 /// responsibility of the caller.
601 Instruction* CallInst::CreateFree(Value* Source, BasicBlock *InsertAtEnd) {
602 Instruction* FreeCall = createFree(Source, NULL, InsertAtEnd);
603 assert(FreeCall && "CreateFree did not create a CallInst");
607 //===----------------------------------------------------------------------===//
608 // InvokeInst Implementation
609 //===----------------------------------------------------------------------===//
611 void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
612 Value* const *Args, unsigned NumArgs) {
613 assert(NumOperands == 3+NumArgs && "NumOperands not set up?");
614 Use *OL = OperandList;
618 const FunctionType *FTy =
619 cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
620 FTy = FTy; // silence warning.
622 assert(((NumArgs == FTy->getNumParams()) ||
623 (FTy->isVarArg() && NumArgs > FTy->getNumParams())) &&
624 "Calling a function with bad signature");
626 for (unsigned i = 0, e = NumArgs; i != e; i++) {
627 assert((i >= FTy->getNumParams() ||
628 FTy->getParamType(i) == Args[i]->getType()) &&
629 "Invoking a function with a bad signature!");
635 InvokeInst::InvokeInst(const InvokeInst &II)
636 : TerminatorInst(II.getType(), Instruction::Invoke,
637 OperandTraits<InvokeInst>::op_end(this)
638 - II.getNumOperands(),
639 II.getNumOperands()) {
640 setAttributes(II.getAttributes());
641 SubclassData = II.SubclassData;
642 Use *OL = OperandList, *InOL = II.OperandList;
643 for (unsigned i = 0, e = II.getNumOperands(); i != e; ++i)
645 SubclassOptionalData = II.SubclassOptionalData;
648 BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
649 return getSuccessor(idx);
651 unsigned InvokeInst::getNumSuccessorsV() const {
652 return getNumSuccessors();
654 void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
655 return setSuccessor(idx, B);
658 bool InvokeInst::paramHasAttr(unsigned i, Attributes attr) const {
659 if (AttributeList.paramHasAttr(i, attr))
661 if (const Function *F = getCalledFunction())
662 return F->paramHasAttr(i, attr);
666 void InvokeInst::addAttribute(unsigned i, Attributes attr) {
667 AttrListPtr PAL = getAttributes();
668 PAL = PAL.addAttr(i, attr);
672 void InvokeInst::removeAttribute(unsigned i, Attributes attr) {
673 AttrListPtr PAL = getAttributes();
674 PAL = PAL.removeAttr(i, attr);
679 //===----------------------------------------------------------------------===//
680 // ReturnInst Implementation
681 //===----------------------------------------------------------------------===//
683 ReturnInst::ReturnInst(const ReturnInst &RI)
684 : TerminatorInst(Type::getVoidTy(RI.getContext()), Instruction::Ret,
685 OperandTraits<ReturnInst>::op_end(this) -
687 RI.getNumOperands()) {
688 if (RI.getNumOperands())
689 Op<0>() = RI.Op<0>();
690 SubclassOptionalData = RI.SubclassOptionalData;
693 ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, Instruction *InsertBefore)
694 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret,
695 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
700 ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, BasicBlock *InsertAtEnd)
701 : TerminatorInst(Type::getVoidTy(C), Instruction::Ret,
702 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
707 ReturnInst::ReturnInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
708 : TerminatorInst(Type::getVoidTy(Context), Instruction::Ret,
709 OperandTraits<ReturnInst>::op_end(this), 0, InsertAtEnd) {
712 unsigned ReturnInst::getNumSuccessorsV() const {
713 return getNumSuccessors();
716 /// Out-of-line ReturnInst method, put here so the C++ compiler can choose to
717 /// emit the vtable for the class in this translation unit.
718 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
719 llvm_unreachable("ReturnInst has no successors!");
722 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
723 llvm_unreachable("ReturnInst has no successors!");
727 ReturnInst::~ReturnInst() {
730 //===----------------------------------------------------------------------===//
731 // UnwindInst Implementation
732 //===----------------------------------------------------------------------===//
734 UnwindInst::UnwindInst(LLVMContext &Context, Instruction *InsertBefore)
735 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unwind,
736 0, 0, InsertBefore) {
738 UnwindInst::UnwindInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
739 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unwind,
744 unsigned UnwindInst::getNumSuccessorsV() const {
745 return getNumSuccessors();
748 void UnwindInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
749 llvm_unreachable("UnwindInst has no successors!");
752 BasicBlock *UnwindInst::getSuccessorV(unsigned idx) const {
753 llvm_unreachable("UnwindInst has no successors!");
757 //===----------------------------------------------------------------------===//
758 // UnreachableInst Implementation
759 //===----------------------------------------------------------------------===//
761 UnreachableInst::UnreachableInst(LLVMContext &Context,
762 Instruction *InsertBefore)
763 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unreachable,
764 0, 0, InsertBefore) {
766 UnreachableInst::UnreachableInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
767 : TerminatorInst(Type::getVoidTy(Context), Instruction::Unreachable,
771 unsigned UnreachableInst::getNumSuccessorsV() const {
772 return getNumSuccessors();
775 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
776 llvm_unreachable("UnwindInst has no successors!");
779 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
780 llvm_unreachable("UnwindInst has no successors!");
784 //===----------------------------------------------------------------------===//
785 // BranchInst Implementation
786 //===----------------------------------------------------------------------===//
788 void BranchInst::AssertOK() {
790 assert(getCondition()->getType() == Type::getInt1Ty(getContext()) &&
791 "May only branch on boolean predicates!");
794 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
795 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
796 OperandTraits<BranchInst>::op_end(this) - 1,
798 assert(IfTrue != 0 && "Branch destination may not be null!");
801 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
802 Instruction *InsertBefore)
803 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
804 OperandTraits<BranchInst>::op_end(this) - 3,
814 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
815 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
816 OperandTraits<BranchInst>::op_end(this) - 1,
818 assert(IfTrue != 0 && "Branch destination may not be null!");
822 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
823 BasicBlock *InsertAtEnd)
824 : TerminatorInst(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
825 OperandTraits<BranchInst>::op_end(this) - 3,
836 BranchInst::BranchInst(const BranchInst &BI) :
837 TerminatorInst(Type::getVoidTy(BI.getContext()), Instruction::Br,
838 OperandTraits<BranchInst>::op_end(this) - BI.getNumOperands(),
839 BI.getNumOperands()) {
840 Op<-1>() = BI.Op<-1>();
841 if (BI.getNumOperands() != 1) {
842 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
843 Op<-3>() = BI.Op<-3>();
844 Op<-2>() = BI.Op<-2>();
846 SubclassOptionalData = BI.SubclassOptionalData;
850 Use* Use::getPrefix() {
851 PointerIntPair<Use**, 2, PrevPtrTag> &PotentialPrefix(this[-1].Prev);
852 if (PotentialPrefix.getOpaqueValue())
855 return reinterpret_cast<Use*>((char*)&PotentialPrefix + 1);
858 BranchInst::~BranchInst() {
859 if (NumOperands == 1) {
860 if (Use *Prefix = OperandList->getPrefix()) {
863 // mark OperandList to have a special value for scrutiny
864 // by baseclass destructors and operator delete
865 OperandList = Prefix;
868 OperandList = op_begin();
874 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
875 return getSuccessor(idx);
877 unsigned BranchInst::getNumSuccessorsV() const {
878 return getNumSuccessors();
880 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
881 setSuccessor(idx, B);
885 //===----------------------------------------------------------------------===//
886 // AllocaInst Implementation
887 //===----------------------------------------------------------------------===//
889 static Value *getAISize(LLVMContext &Context, Value *Amt) {
891 Amt = ConstantInt::get(Type::getInt32Ty(Context), 1);
893 assert(!isa<BasicBlock>(Amt) &&
894 "Passed basic block into allocation size parameter! Use other ctor");
895 assert(Amt->getType() == Type::getInt32Ty(Context) &&
896 "Allocation array size is not a 32-bit integer!");
901 AllocaInst::AllocaInst(const Type *Ty, Value *ArraySize,
902 const Twine &Name, Instruction *InsertBefore)
903 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
904 getAISize(Ty->getContext(), ArraySize), InsertBefore) {
906 assert(Ty != Type::getVoidTy(Ty->getContext()) && "Cannot allocate void!");
910 AllocaInst::AllocaInst(const Type *Ty, Value *ArraySize,
911 const Twine &Name, BasicBlock *InsertAtEnd)
912 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
913 getAISize(Ty->getContext(), ArraySize), InsertAtEnd) {
915 assert(Ty != Type::getVoidTy(Ty->getContext()) && "Cannot allocate void!");
919 AllocaInst::AllocaInst(const Type *Ty, const Twine &Name,
920 Instruction *InsertBefore)
921 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
922 getAISize(Ty->getContext(), 0), InsertBefore) {
924 assert(Ty != Type::getVoidTy(Ty->getContext()) && "Cannot allocate void!");
928 AllocaInst::AllocaInst(const Type *Ty, const Twine &Name,
929 BasicBlock *InsertAtEnd)
930 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
931 getAISize(Ty->getContext(), 0), InsertAtEnd) {
933 assert(Ty != Type::getVoidTy(Ty->getContext()) && "Cannot allocate void!");
937 AllocaInst::AllocaInst(const Type *Ty, Value *ArraySize, unsigned Align,
938 const Twine &Name, Instruction *InsertBefore)
939 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
940 getAISize(Ty->getContext(), ArraySize), InsertBefore) {
942 assert(Ty != Type::getVoidTy(Ty->getContext()) && "Cannot allocate void!");
946 AllocaInst::AllocaInst(const Type *Ty, Value *ArraySize, unsigned Align,
947 const Twine &Name, BasicBlock *InsertAtEnd)
948 : UnaryInstruction(PointerType::getUnqual(Ty), Alloca,
949 getAISize(Ty->getContext(), ArraySize), InsertAtEnd) {
951 assert(Ty != Type::getVoidTy(Ty->getContext()) && "Cannot allocate void!");
955 // Out of line virtual method, so the vtable, etc has a home.
956 AllocaInst::~AllocaInst() {
959 void AllocaInst::setAlignment(unsigned Align) {
960 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
961 SubclassData = Log2_32(Align) + 1;
962 assert(getAlignment() == Align && "Alignment representation error!");
965 bool AllocaInst::isArrayAllocation() const {
966 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
967 return CI->getZExtValue() != 1;
971 const Type *AllocaInst::getAllocatedType() const {
972 return getType()->getElementType();
975 /// isStaticAlloca - Return true if this alloca is in the entry block of the
976 /// function and is a constant size. If so, the code generator will fold it
977 /// into the prolog/epilog code, so it is basically free.
978 bool AllocaInst::isStaticAlloca() const {
979 // Must be constant size.
980 if (!isa<ConstantInt>(getArraySize())) return false;
982 // Must be in the entry block.
983 const BasicBlock *Parent = getParent();
984 return Parent == &Parent->getParent()->front();
987 //===----------------------------------------------------------------------===//
988 // FreeInst Implementation
989 //===----------------------------------------------------------------------===//
991 void FreeInst::AssertOK() {
992 assert(isa<PointerType>(getOperand(0)->getType()) &&
993 "Can not free something of nonpointer type!");
996 FreeInst::FreeInst(Value *Ptr, Instruction *InsertBefore)
997 : UnaryInstruction(Type::getVoidTy(Ptr->getContext()),
998 Free, Ptr, InsertBefore) {
1002 FreeInst::FreeInst(Value *Ptr, BasicBlock *InsertAtEnd)
1003 : UnaryInstruction(Type::getVoidTy(Ptr->getContext()),
1004 Free, Ptr, InsertAtEnd) {
1009 //===----------------------------------------------------------------------===//
1010 // LoadInst Implementation
1011 //===----------------------------------------------------------------------===//
1013 void LoadInst::AssertOK() {
1014 assert(isa<PointerType>(getOperand(0)->getType()) &&
1015 "Ptr must have pointer type.");
1018 LoadInst::LoadInst(Value *Ptr, const Twine &Name, Instruction *InsertBef)
1019 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1020 Load, Ptr, InsertBef) {
1027 LoadInst::LoadInst(Value *Ptr, const Twine &Name, BasicBlock *InsertAE)
1028 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1029 Load, Ptr, InsertAE) {
1036 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
1037 Instruction *InsertBef)
1038 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1039 Load, Ptr, InsertBef) {
1040 setVolatile(isVolatile);
1046 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
1047 unsigned Align, Instruction *InsertBef)
1048 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1049 Load, Ptr, InsertBef) {
1050 setVolatile(isVolatile);
1051 setAlignment(Align);
1056 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
1057 unsigned Align, BasicBlock *InsertAE)
1058 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1059 Load, Ptr, InsertAE) {
1060 setVolatile(isVolatile);
1061 setAlignment(Align);
1066 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
1067 BasicBlock *InsertAE)
1068 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1069 Load, Ptr, InsertAE) {
1070 setVolatile(isVolatile);
1078 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
1079 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1080 Load, Ptr, InsertBef) {
1084 if (Name && Name[0]) setName(Name);
1087 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
1088 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1089 Load, Ptr, InsertAE) {
1093 if (Name && Name[0]) setName(Name);
1096 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
1097 Instruction *InsertBef)
1098 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1099 Load, Ptr, InsertBef) {
1100 setVolatile(isVolatile);
1103 if (Name && Name[0]) setName(Name);
1106 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
1107 BasicBlock *InsertAE)
1108 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1109 Load, Ptr, InsertAE) {
1110 setVolatile(isVolatile);
1113 if (Name && Name[0]) setName(Name);
1116 void LoadInst::setAlignment(unsigned Align) {
1117 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1118 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
1121 //===----------------------------------------------------------------------===//
1122 // StoreInst Implementation
1123 //===----------------------------------------------------------------------===//
1125 void StoreInst::AssertOK() {
1126 assert(getOperand(0) && getOperand(1) && "Both operands must be non-null!");
1127 assert(isa<PointerType>(getOperand(1)->getType()) &&
1128 "Ptr must have pointer type!");
1129 assert(getOperand(0)->getType() ==
1130 cast<PointerType>(getOperand(1)->getType())->getElementType()
1131 && "Ptr must be a pointer to Val type!");
1135 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
1136 : Instruction(Type::getVoidTy(val->getContext()), Store,
1137 OperandTraits<StoreInst>::op_begin(this),
1138 OperandTraits<StoreInst>::operands(this),
1147 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
1148 : Instruction(Type::getVoidTy(val->getContext()), Store,
1149 OperandTraits<StoreInst>::op_begin(this),
1150 OperandTraits<StoreInst>::operands(this),
1159 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1160 Instruction *InsertBefore)
1161 : Instruction(Type::getVoidTy(val->getContext()), Store,
1162 OperandTraits<StoreInst>::op_begin(this),
1163 OperandTraits<StoreInst>::operands(this),
1167 setVolatile(isVolatile);
1172 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1173 unsigned Align, Instruction *InsertBefore)
1174 : Instruction(Type::getVoidTy(val->getContext()), Store,
1175 OperandTraits<StoreInst>::op_begin(this),
1176 OperandTraits<StoreInst>::operands(this),
1180 setVolatile(isVolatile);
1181 setAlignment(Align);
1185 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1186 unsigned Align, BasicBlock *InsertAtEnd)
1187 : Instruction(Type::getVoidTy(val->getContext()), Store,
1188 OperandTraits<StoreInst>::op_begin(this),
1189 OperandTraits<StoreInst>::operands(this),
1193 setVolatile(isVolatile);
1194 setAlignment(Align);
1198 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1199 BasicBlock *InsertAtEnd)
1200 : Instruction(Type::getVoidTy(val->getContext()), Store,
1201 OperandTraits<StoreInst>::op_begin(this),
1202 OperandTraits<StoreInst>::operands(this),
1206 setVolatile(isVolatile);
1211 void StoreInst::setAlignment(unsigned Align) {
1212 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1213 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
1216 //===----------------------------------------------------------------------===//
1217 // GetElementPtrInst Implementation
1218 //===----------------------------------------------------------------------===//
1220 static unsigned retrieveAddrSpace(const Value *Val) {
1221 return cast<PointerType>(Val->getType())->getAddressSpace();
1224 void GetElementPtrInst::init(Value *Ptr, Value* const *Idx, unsigned NumIdx,
1225 const Twine &Name) {
1226 assert(NumOperands == 1+NumIdx && "NumOperands not initialized?");
1227 Use *OL = OperandList;
1230 for (unsigned i = 0; i != NumIdx; ++i)
1236 void GetElementPtrInst::init(Value *Ptr, Value *Idx, const Twine &Name) {
1237 assert(NumOperands == 2 && "NumOperands not initialized?");
1238 Use *OL = OperandList;
1245 GetElementPtrInst::GetElementPtrInst(const GetElementPtrInst &GEPI)
1246 : Instruction(GEPI.getType(), GetElementPtr,
1247 OperandTraits<GetElementPtrInst>::op_end(this)
1248 - GEPI.getNumOperands(),
1249 GEPI.getNumOperands()) {
1250 Use *OL = OperandList;
1251 Use *GEPIOL = GEPI.OperandList;
1252 for (unsigned i = 0, E = NumOperands; i != E; ++i)
1254 SubclassOptionalData = GEPI.SubclassOptionalData;
1257 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1258 const Twine &Name, Instruction *InBe)
1259 : Instruction(PointerType::get(
1260 checkType(getIndexedType(Ptr->getType(),Idx)), retrieveAddrSpace(Ptr)),
1262 OperandTraits<GetElementPtrInst>::op_end(this) - 2,
1264 init(Ptr, Idx, Name);
1267 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1268 const Twine &Name, BasicBlock *IAE)
1269 : Instruction(PointerType::get(
1270 checkType(getIndexedType(Ptr->getType(),Idx)),
1271 retrieveAddrSpace(Ptr)),
1273 OperandTraits<GetElementPtrInst>::op_end(this) - 2,
1275 init(Ptr, Idx, Name);
1278 /// getIndexedType - Returns the type of the element that would be accessed with
1279 /// a gep instruction with the specified parameters.
1281 /// The Idxs pointer should point to a continuous piece of memory containing the
1282 /// indices, either as Value* or uint64_t.
1284 /// A null type is returned if the indices are invalid for the specified
1287 template <typename IndexTy>
1288 static const Type* getIndexedTypeInternal(const Type *Ptr, IndexTy const *Idxs,
1290 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
1291 if (!PTy) return 0; // Type isn't a pointer type!
1292 const Type *Agg = PTy->getElementType();
1294 // Handle the special case of the empty set index set, which is always valid.
1298 // If there is at least one index, the top level type must be sized, otherwise
1299 // it cannot be 'stepped over'. We explicitly allow abstract types (those
1300 // that contain opaque types) under the assumption that it will be resolved to
1301 // a sane type later.
1302 if (!Agg->isSized() && !Agg->isAbstract())
1305 unsigned CurIdx = 1;
1306 for (; CurIdx != NumIdx; ++CurIdx) {
1307 const CompositeType *CT = dyn_cast<CompositeType>(Agg);
1308 if (!CT || isa<PointerType>(CT)) return 0;
1309 IndexTy Index = Idxs[CurIdx];
1310 if (!CT->indexValid(Index)) return 0;
1311 Agg = CT->getTypeAtIndex(Index);
1313 // If the new type forwards to another type, then it is in the middle
1314 // of being refined to another type (and hence, may have dropped all
1315 // references to what it was using before). So, use the new forwarded
1317 if (const Type *Ty = Agg->getForwardedType())
1320 return CurIdx == NumIdx ? Agg : 0;
1323 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
1326 return getIndexedTypeInternal(Ptr, Idxs, NumIdx);
1329 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
1330 uint64_t const *Idxs,
1332 return getIndexedTypeInternal(Ptr, Idxs, NumIdx);
1335 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr, Value *Idx) {
1336 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
1337 if (!PTy) return 0; // Type isn't a pointer type!
1339 // Check the pointer index.
1340 if (!PTy->indexValid(Idx)) return 0;
1342 return PTy->getElementType();
1346 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
1347 /// zeros. If so, the result pointer and the first operand have the same
1348 /// value, just potentially different types.
1349 bool GetElementPtrInst::hasAllZeroIndices() const {
1350 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1351 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
1352 if (!CI->isZero()) return false;
1360 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
1361 /// constant integers. If so, the result pointer and the first operand have
1362 /// a constant offset between them.
1363 bool GetElementPtrInst::hasAllConstantIndices() const {
1364 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1365 if (!isa<ConstantInt>(getOperand(i)))
1371 void GetElementPtrInst::setIsInBounds(bool B) {
1372 cast<GEPOperator>(this)->setIsInBounds(B);
1375 bool GetElementPtrInst::isInBounds() const {
1376 return cast<GEPOperator>(this)->isInBounds();
1379 //===----------------------------------------------------------------------===//
1380 // ExtractElementInst Implementation
1381 //===----------------------------------------------------------------------===//
1383 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1385 Instruction *InsertBef)
1386 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1388 OperandTraits<ExtractElementInst>::op_begin(this),
1390 assert(isValidOperands(Val, Index) &&
1391 "Invalid extractelement instruction operands!");
1397 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1399 BasicBlock *InsertAE)
1400 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1402 OperandTraits<ExtractElementInst>::op_begin(this),
1404 assert(isValidOperands(Val, Index) &&
1405 "Invalid extractelement instruction operands!");
1413 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
1414 if (!isa<VectorType>(Val->getType()) ||
1415 Index->getType() != Type::getInt32Ty(Val->getContext()))
1421 //===----------------------------------------------------------------------===//
1422 // InsertElementInst Implementation
1423 //===----------------------------------------------------------------------===//
1425 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1427 Instruction *InsertBef)
1428 : Instruction(Vec->getType(), InsertElement,
1429 OperandTraits<InsertElementInst>::op_begin(this),
1431 assert(isValidOperands(Vec, Elt, Index) &&
1432 "Invalid insertelement instruction operands!");
1439 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1441 BasicBlock *InsertAE)
1442 : Instruction(Vec->getType(), InsertElement,
1443 OperandTraits<InsertElementInst>::op_begin(this),
1445 assert(isValidOperands(Vec, Elt, Index) &&
1446 "Invalid insertelement instruction operands!");
1454 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
1455 const Value *Index) {
1456 if (!isa<VectorType>(Vec->getType()))
1457 return false; // First operand of insertelement must be vector type.
1459 if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
1460 return false;// Second operand of insertelement must be vector element type.
1462 if (Index->getType() != Type::getInt32Ty(Vec->getContext()))
1463 return false; // Third operand of insertelement must be i32.
1468 //===----------------------------------------------------------------------===//
1469 // ShuffleVectorInst Implementation
1470 //===----------------------------------------------------------------------===//
1472 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1474 Instruction *InsertBefore)
1475 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1476 cast<VectorType>(Mask->getType())->getNumElements()),
1478 OperandTraits<ShuffleVectorInst>::op_begin(this),
1479 OperandTraits<ShuffleVectorInst>::operands(this),
1481 assert(isValidOperands(V1, V2, Mask) &&
1482 "Invalid shuffle vector instruction operands!");
1489 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1491 BasicBlock *InsertAtEnd)
1492 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1493 cast<VectorType>(Mask->getType())->getNumElements()),
1495 OperandTraits<ShuffleVectorInst>::op_begin(this),
1496 OperandTraits<ShuffleVectorInst>::operands(this),
1498 assert(isValidOperands(V1, V2, Mask) &&
1499 "Invalid shuffle vector instruction operands!");
1507 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1508 const Value *Mask) {
1509 if (!isa<VectorType>(V1->getType()) || V1->getType() != V2->getType())
1512 const VectorType *MaskTy = dyn_cast<VectorType>(Mask->getType());
1513 if (!isa<Constant>(Mask) || MaskTy == 0 ||
1514 MaskTy->getElementType() != Type::getInt32Ty(V1->getContext()))
1519 /// getMaskValue - Return the index from the shuffle mask for the specified
1520 /// output result. This is either -1 if the element is undef or a number less
1521 /// than 2*numelements.
1522 int ShuffleVectorInst::getMaskValue(unsigned i) const {
1523 const Constant *Mask = cast<Constant>(getOperand(2));
1524 if (isa<UndefValue>(Mask)) return -1;
1525 if (isa<ConstantAggregateZero>(Mask)) return 0;
1526 const ConstantVector *MaskCV = cast<ConstantVector>(Mask);
1527 assert(i < MaskCV->getNumOperands() && "Index out of range");
1529 if (isa<UndefValue>(MaskCV->getOperand(i)))
1531 return cast<ConstantInt>(MaskCV->getOperand(i))->getZExtValue();
1534 //===----------------------------------------------------------------------===//
1535 // InsertValueInst Class
1536 //===----------------------------------------------------------------------===//
1538 void InsertValueInst::init(Value *Agg, Value *Val, const unsigned *Idx,
1539 unsigned NumIdx, const Twine &Name) {
1540 assert(NumOperands == 2 && "NumOperands not initialized?");
1544 Indices.insert(Indices.end(), Idx, Idx + NumIdx);
1548 void InsertValueInst::init(Value *Agg, Value *Val, unsigned Idx,
1549 const Twine &Name) {
1550 assert(NumOperands == 2 && "NumOperands not initialized?");
1554 Indices.push_back(Idx);
1558 InsertValueInst::InsertValueInst(const InsertValueInst &IVI)
1559 : Instruction(IVI.getType(), InsertValue,
1560 OperandTraits<InsertValueInst>::op_begin(this), 2),
1561 Indices(IVI.Indices) {
1562 Op<0>() = IVI.getOperand(0);
1563 Op<1>() = IVI.getOperand(1);
1564 SubclassOptionalData = IVI.SubclassOptionalData;
1567 InsertValueInst::InsertValueInst(Value *Agg,
1571 Instruction *InsertBefore)
1572 : Instruction(Agg->getType(), InsertValue,
1573 OperandTraits<InsertValueInst>::op_begin(this),
1575 init(Agg, Val, Idx, Name);
1578 InsertValueInst::InsertValueInst(Value *Agg,
1582 BasicBlock *InsertAtEnd)
1583 : Instruction(Agg->getType(), InsertValue,
1584 OperandTraits<InsertValueInst>::op_begin(this),
1586 init(Agg, Val, Idx, Name);
1589 //===----------------------------------------------------------------------===//
1590 // ExtractValueInst Class
1591 //===----------------------------------------------------------------------===//
1593 void ExtractValueInst::init(const unsigned *Idx, unsigned NumIdx,
1594 const Twine &Name) {
1595 assert(NumOperands == 1 && "NumOperands not initialized?");
1597 Indices.insert(Indices.end(), Idx, Idx + NumIdx);
1601 void ExtractValueInst::init(unsigned Idx, const Twine &Name) {
1602 assert(NumOperands == 1 && "NumOperands not initialized?");
1604 Indices.push_back(Idx);
1608 ExtractValueInst::ExtractValueInst(const ExtractValueInst &EVI)
1609 : UnaryInstruction(EVI.getType(), ExtractValue, EVI.getOperand(0)),
1610 Indices(EVI.Indices) {
1611 SubclassOptionalData = EVI.SubclassOptionalData;
1614 // getIndexedType - Returns the type of the element that would be extracted
1615 // with an extractvalue instruction with the specified parameters.
1617 // A null type is returned if the indices are invalid for the specified
1620 const Type* ExtractValueInst::getIndexedType(const Type *Agg,
1621 const unsigned *Idxs,
1623 unsigned CurIdx = 0;
1624 for (; CurIdx != NumIdx; ++CurIdx) {
1625 const CompositeType *CT = dyn_cast<CompositeType>(Agg);
1626 if (!CT || isa<PointerType>(CT) || isa<VectorType>(CT)) return 0;
1627 unsigned Index = Idxs[CurIdx];
1628 if (!CT->indexValid(Index)) return 0;
1629 Agg = CT->getTypeAtIndex(Index);
1631 // If the new type forwards to another type, then it is in the middle
1632 // of being refined to another type (and hence, may have dropped all
1633 // references to what it was using before). So, use the new forwarded
1635 if (const Type *Ty = Agg->getForwardedType())
1638 return CurIdx == NumIdx ? Agg : 0;
1641 const Type* ExtractValueInst::getIndexedType(const Type *Agg,
1643 return getIndexedType(Agg, &Idx, 1);
1646 //===----------------------------------------------------------------------===//
1647 // BinaryOperator Class
1648 //===----------------------------------------------------------------------===//
1650 /// AdjustIType - Map Add, Sub, and Mul to FAdd, FSub, and FMul when the
1651 /// type is floating-point, to help provide compatibility with an older API.
1653 static BinaryOperator::BinaryOps AdjustIType(BinaryOperator::BinaryOps iType,
1655 // API compatibility: Adjust integer opcodes to floating-point opcodes.
1656 if (Ty->isFPOrFPVector()) {
1657 if (iType == BinaryOperator::Add) iType = BinaryOperator::FAdd;
1658 else if (iType == BinaryOperator::Sub) iType = BinaryOperator::FSub;
1659 else if (iType == BinaryOperator::Mul) iType = BinaryOperator::FMul;
1664 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1665 const Type *Ty, const Twine &Name,
1666 Instruction *InsertBefore)
1667 : Instruction(Ty, AdjustIType(iType, Ty),
1668 OperandTraits<BinaryOperator>::op_begin(this),
1669 OperandTraits<BinaryOperator>::operands(this),
1673 init(AdjustIType(iType, Ty));
1677 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1678 const Type *Ty, const Twine &Name,
1679 BasicBlock *InsertAtEnd)
1680 : Instruction(Ty, AdjustIType(iType, Ty),
1681 OperandTraits<BinaryOperator>::op_begin(this),
1682 OperandTraits<BinaryOperator>::operands(this),
1686 init(AdjustIType(iType, Ty));
1691 void BinaryOperator::init(BinaryOps iType) {
1692 Value *LHS = getOperand(0), *RHS = getOperand(1);
1693 LHS = LHS; RHS = RHS; // Silence warnings.
1694 assert(LHS->getType() == RHS->getType() &&
1695 "Binary operator operand types must match!");
1700 assert(getType() == LHS->getType() &&
1701 "Arithmetic operation should return same type as operands!");
1702 assert(getType()->isIntOrIntVector() &&
1703 "Tried to create an integer operation on a non-integer type!");
1705 case FAdd: case FSub:
1707 assert(getType() == LHS->getType() &&
1708 "Arithmetic operation should return same type as operands!");
1709 assert(getType()->isFPOrFPVector() &&
1710 "Tried to create a floating-point operation on a "
1711 "non-floating-point type!");
1715 assert(getType() == LHS->getType() &&
1716 "Arithmetic operation should return same type as operands!");
1717 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1718 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1719 "Incorrect operand type (not integer) for S/UDIV");
1722 assert(getType() == LHS->getType() &&
1723 "Arithmetic operation should return same type as operands!");
1724 assert(getType()->isFPOrFPVector() &&
1725 "Incorrect operand type (not floating point) for FDIV");
1729 assert(getType() == LHS->getType() &&
1730 "Arithmetic operation should return same type as operands!");
1731 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1732 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1733 "Incorrect operand type (not integer) for S/UREM");
1736 assert(getType() == LHS->getType() &&
1737 "Arithmetic operation should return same type as operands!");
1738 assert(getType()->isFPOrFPVector() &&
1739 "Incorrect operand type (not floating point) for FREM");
1744 assert(getType() == LHS->getType() &&
1745 "Shift operation should return same type as operands!");
1746 assert((getType()->isInteger() ||
1747 (isa<VectorType>(getType()) &&
1748 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1749 "Tried to create a shift operation on a non-integral type!");
1753 assert(getType() == LHS->getType() &&
1754 "Logical operation should return same type as operands!");
1755 assert((getType()->isInteger() ||
1756 (isa<VectorType>(getType()) &&
1757 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1758 "Tried to create a logical operation on a non-integral type!");
1766 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1768 Instruction *InsertBefore) {
1769 assert(S1->getType() == S2->getType() &&
1770 "Cannot create binary operator with two operands of differing type!");
1771 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1774 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1776 BasicBlock *InsertAtEnd) {
1777 BinaryOperator *Res = Create(Op, S1, S2, Name);
1778 InsertAtEnd->getInstList().push_back(Res);
1782 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1783 Instruction *InsertBefore) {
1784 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1785 return new BinaryOperator(Instruction::Sub,
1787 Op->getType(), Name, InsertBefore);
1790 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1791 BasicBlock *InsertAtEnd) {
1792 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1793 return new BinaryOperator(Instruction::Sub,
1795 Op->getType(), Name, InsertAtEnd);
1798 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1799 Instruction *InsertBefore) {
1800 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1801 return new BinaryOperator(Instruction::FSub,
1803 Op->getType(), Name, InsertBefore);
1806 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1807 BasicBlock *InsertAtEnd) {
1808 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1809 return new BinaryOperator(Instruction::FSub,
1811 Op->getType(), Name, InsertAtEnd);
1814 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1815 Instruction *InsertBefore) {
1817 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1818 C = Constant::getAllOnesValue(PTy->getElementType());
1819 C = ConstantVector::get(
1820 std::vector<Constant*>(PTy->getNumElements(), C));
1822 C = Constant::getAllOnesValue(Op->getType());
1825 return new BinaryOperator(Instruction::Xor, Op, C,
1826 Op->getType(), Name, InsertBefore);
1829 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1830 BasicBlock *InsertAtEnd) {
1832 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1833 // Create a vector of all ones values.
1834 Constant *Elt = Constant::getAllOnesValue(PTy->getElementType());
1835 AllOnes = ConstantVector::get(
1836 std::vector<Constant*>(PTy->getNumElements(), Elt));
1838 AllOnes = Constant::getAllOnesValue(Op->getType());
1841 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1842 Op->getType(), Name, InsertAtEnd);
1846 // isConstantAllOnes - Helper function for several functions below
1847 static inline bool isConstantAllOnes(const Value *V) {
1848 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V))
1849 return CI->isAllOnesValue();
1850 if (const ConstantVector *CV = dyn_cast<ConstantVector>(V))
1851 return CV->isAllOnesValue();
1855 bool BinaryOperator::isNeg(const Value *V) {
1856 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1857 if (Bop->getOpcode() == Instruction::Sub)
1858 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0)))
1859 return C->isNegativeZeroValue();
1863 bool BinaryOperator::isFNeg(const Value *V) {
1864 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1865 if (Bop->getOpcode() == Instruction::FSub)
1866 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0)))
1867 return C->isNegativeZeroValue();
1871 bool BinaryOperator::isNot(const Value *V) {
1872 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1873 return (Bop->getOpcode() == Instruction::Xor &&
1874 (isConstantAllOnes(Bop->getOperand(1)) ||
1875 isConstantAllOnes(Bop->getOperand(0))));
1879 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1880 return cast<BinaryOperator>(BinOp)->getOperand(1);
1883 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1884 return getNegArgument(const_cast<Value*>(BinOp));
1887 Value *BinaryOperator::getFNegArgument(Value *BinOp) {
1888 return cast<BinaryOperator>(BinOp)->getOperand(1);
1891 const Value *BinaryOperator::getFNegArgument(const Value *BinOp) {
1892 return getFNegArgument(const_cast<Value*>(BinOp));
1895 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1896 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1897 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1898 Value *Op0 = BO->getOperand(0);
1899 Value *Op1 = BO->getOperand(1);
1900 if (isConstantAllOnes(Op0)) return Op1;
1902 assert(isConstantAllOnes(Op1));
1906 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1907 return getNotArgument(const_cast<Value*>(BinOp));
1911 // swapOperands - Exchange the two operands to this instruction. This
1912 // instruction is safe to use on any binary instruction and does not
1913 // modify the semantics of the instruction. If the instruction is
1914 // order dependent (SetLT f.e.) the opcode is changed.
1916 bool BinaryOperator::swapOperands() {
1917 if (!isCommutative())
1918 return true; // Can't commute operands
1919 Op<0>().swap(Op<1>());
1923 void BinaryOperator::setHasNoUnsignedWrap(bool b) {
1924 cast<OverflowingBinaryOperator>(this)->setHasNoUnsignedWrap(b);
1927 void BinaryOperator::setHasNoSignedWrap(bool b) {
1928 cast<OverflowingBinaryOperator>(this)->setHasNoSignedWrap(b);
1931 void BinaryOperator::setIsExact(bool b) {
1932 cast<SDivOperator>(this)->setIsExact(b);
1935 bool BinaryOperator::hasNoUnsignedWrap() const {
1936 return cast<OverflowingBinaryOperator>(this)->hasNoUnsignedWrap();
1939 bool BinaryOperator::hasNoSignedWrap() const {
1940 return cast<OverflowingBinaryOperator>(this)->hasNoSignedWrap();
1943 bool BinaryOperator::isExact() const {
1944 return cast<SDivOperator>(this)->isExact();
1947 //===----------------------------------------------------------------------===//
1949 //===----------------------------------------------------------------------===//
1951 // Just determine if this cast only deals with integral->integral conversion.
1952 bool CastInst::isIntegerCast() const {
1953 switch (getOpcode()) {
1954 default: return false;
1955 case Instruction::ZExt:
1956 case Instruction::SExt:
1957 case Instruction::Trunc:
1959 case Instruction::BitCast:
1960 return getOperand(0)->getType()->isInteger() && getType()->isInteger();
1964 bool CastInst::isLosslessCast() const {
1965 // Only BitCast can be lossless, exit fast if we're not BitCast
1966 if (getOpcode() != Instruction::BitCast)
1969 // Identity cast is always lossless
1970 const Type* SrcTy = getOperand(0)->getType();
1971 const Type* DstTy = getType();
1975 // Pointer to pointer is always lossless.
1976 if (isa<PointerType>(SrcTy))
1977 return isa<PointerType>(DstTy);
1978 return false; // Other types have no identity values
1981 /// This function determines if the CastInst does not require any bits to be
1982 /// changed in order to effect the cast. Essentially, it identifies cases where
1983 /// no code gen is necessary for the cast, hence the name no-op cast. For
1984 /// example, the following are all no-op casts:
1985 /// # bitcast i32* %x to i8*
1986 /// # bitcast <2 x i32> %x to <4 x i16>
1987 /// # ptrtoint i32* %x to i32 ; on 32-bit plaforms only
1988 /// @brief Determine if a cast is a no-op.
1989 bool CastInst::isNoopCast(const Type *IntPtrTy) const {
1990 switch (getOpcode()) {
1992 assert(!"Invalid CastOp");
1993 case Instruction::Trunc:
1994 case Instruction::ZExt:
1995 case Instruction::SExt:
1996 case Instruction::FPTrunc:
1997 case Instruction::FPExt:
1998 case Instruction::UIToFP:
1999 case Instruction::SIToFP:
2000 case Instruction::FPToUI:
2001 case Instruction::FPToSI:
2002 return false; // These always modify bits
2003 case Instruction::BitCast:
2004 return true; // BitCast never modifies bits.
2005 case Instruction::PtrToInt:
2006 return IntPtrTy->getScalarSizeInBits() ==
2007 getType()->getScalarSizeInBits();
2008 case Instruction::IntToPtr:
2009 return IntPtrTy->getScalarSizeInBits() ==
2010 getOperand(0)->getType()->getScalarSizeInBits();
2014 /// This function determines if a pair of casts can be eliminated and what
2015 /// opcode should be used in the elimination. This assumes that there are two
2016 /// instructions like this:
2017 /// * %F = firstOpcode SrcTy %x to MidTy
2018 /// * %S = secondOpcode MidTy %F to DstTy
2019 /// The function returns a resultOpcode so these two casts can be replaced with:
2020 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
2021 /// If no such cast is permited, the function returns 0.
2022 unsigned CastInst::isEliminableCastPair(
2023 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
2024 const Type *SrcTy, const Type *MidTy, const Type *DstTy, const Type *IntPtrTy)
2026 // Define the 144 possibilities for these two cast instructions. The values
2027 // in this matrix determine what to do in a given situation and select the
2028 // case in the switch below. The rows correspond to firstOp, the columns
2029 // correspond to secondOp. In looking at the table below, keep in mind
2030 // the following cast properties:
2032 // Size Compare Source Destination
2033 // Operator Src ? Size Type Sign Type Sign
2034 // -------- ------------ ------------------- ---------------------
2035 // TRUNC > Integer Any Integral Any
2036 // ZEXT < Integral Unsigned Integer Any
2037 // SEXT < Integral Signed Integer Any
2038 // FPTOUI n/a FloatPt n/a Integral Unsigned
2039 // FPTOSI n/a FloatPt n/a Integral Signed
2040 // UITOFP n/a Integral Unsigned FloatPt n/a
2041 // SITOFP n/a Integral Signed FloatPt n/a
2042 // FPTRUNC > FloatPt n/a FloatPt n/a
2043 // FPEXT < FloatPt n/a FloatPt n/a
2044 // PTRTOINT n/a Pointer n/a Integral Unsigned
2045 // INTTOPTR n/a Integral Unsigned Pointer n/a
2046 // BITCONVERT = FirstClass n/a FirstClass n/a
2048 // NOTE: some transforms are safe, but we consider them to be non-profitable.
2049 // For example, we could merge "fptoui double to i32" + "zext i32 to i64",
2050 // into "fptoui double to i64", but this loses information about the range
2051 // of the produced value (we no longer know the top-part is all zeros).
2052 // Further this conversion is often much more expensive for typical hardware,
2053 // and causes issues when building libgcc. We disallow fptosi+sext for the
2055 const unsigned numCastOps =
2056 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
2057 static const uint8_t CastResults[numCastOps][numCastOps] = {
2058 // T F F U S F F P I B -+
2059 // R Z S P P I I T P 2 N T |
2060 // U E E 2 2 2 2 R E I T C +- secondOp
2061 // N X X U S F F N X N 2 V |
2062 // C T T I I P P C T T P T -+
2063 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
2064 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
2065 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
2066 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
2067 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
2068 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
2069 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
2070 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
2071 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
2072 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
2073 { 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
2074 { 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
2077 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
2078 [secondOp-Instruction::CastOpsBegin];
2081 // categorically disallowed
2084 // allowed, use first cast's opcode
2087 // allowed, use second cast's opcode
2090 // no-op cast in second op implies firstOp as long as the DestTy
2092 if (DstTy->isInteger())
2096 // no-op cast in second op implies firstOp as long as the DestTy
2097 // is floating point
2098 if (DstTy->isFloatingPoint())
2102 // no-op cast in first op implies secondOp as long as the SrcTy
2104 if (SrcTy->isInteger())
2108 // no-op cast in first op implies secondOp as long as the SrcTy
2109 // is a floating point
2110 if (SrcTy->isFloatingPoint())
2114 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size
2117 unsigned PtrSize = IntPtrTy->getScalarSizeInBits();
2118 unsigned MidSize = MidTy->getScalarSizeInBits();
2119 if (MidSize >= PtrSize)
2120 return Instruction::BitCast;
2124 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
2125 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
2126 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
2127 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2128 unsigned DstSize = DstTy->getScalarSizeInBits();
2129 if (SrcSize == DstSize)
2130 return Instruction::BitCast;
2131 else if (SrcSize < DstSize)
2135 case 9: // zext, sext -> zext, because sext can't sign extend after zext
2136 return Instruction::ZExt;
2138 // fpext followed by ftrunc is allowed if the bit size returned to is
2139 // the same as the original, in which case its just a bitcast
2141 return Instruction::BitCast;
2142 return 0; // If the types are not the same we can't eliminate it.
2144 // bitcast followed by ptrtoint is allowed as long as the bitcast
2145 // is a pointer to pointer cast.
2146 if (isa<PointerType>(SrcTy) && isa<PointerType>(MidTy))
2150 // inttoptr, bitcast -> intptr if bitcast is a ptr to ptr cast
2151 if (isa<PointerType>(MidTy) && isa<PointerType>(DstTy))
2155 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
2158 unsigned PtrSize = IntPtrTy->getScalarSizeInBits();
2159 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2160 unsigned DstSize = DstTy->getScalarSizeInBits();
2161 if (SrcSize <= PtrSize && SrcSize == DstSize)
2162 return Instruction::BitCast;
2166 // cast combination can't happen (error in input). This is for all cases
2167 // where the MidTy is not the same for the two cast instructions.
2168 assert(!"Invalid Cast Combination");
2171 assert(!"Error in CastResults table!!!");
2177 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, const Type *Ty,
2178 const Twine &Name, Instruction *InsertBefore) {
2179 // Construct and return the appropriate CastInst subclass
2181 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
2182 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
2183 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
2184 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
2185 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
2186 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
2187 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
2188 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
2189 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
2190 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
2191 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
2192 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
2194 assert(!"Invalid opcode provided");
2199 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, const Type *Ty,
2200 const Twine &Name, BasicBlock *InsertAtEnd) {
2201 // Construct and return the appropriate CastInst subclass
2203 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
2204 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
2205 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
2206 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
2207 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
2208 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
2209 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
2210 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
2211 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
2212 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
2213 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
2214 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
2216 assert(!"Invalid opcode provided");
2221 CastInst *CastInst::CreateZExtOrBitCast(Value *S, const Type *Ty,
2223 Instruction *InsertBefore) {
2224 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2225 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2226 return Create(Instruction::ZExt, S, Ty, Name, InsertBefore);
2229 CastInst *CastInst::CreateZExtOrBitCast(Value *S, const Type *Ty,
2231 BasicBlock *InsertAtEnd) {
2232 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2233 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2234 return Create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
2237 CastInst *CastInst::CreateSExtOrBitCast(Value *S, const Type *Ty,
2239 Instruction *InsertBefore) {
2240 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2241 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2242 return Create(Instruction::SExt, S, Ty, Name, InsertBefore);
2245 CastInst *CastInst::CreateSExtOrBitCast(Value *S, const Type *Ty,
2247 BasicBlock *InsertAtEnd) {
2248 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2249 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2250 return Create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
2253 CastInst *CastInst::CreateTruncOrBitCast(Value *S, const Type *Ty,
2255 Instruction *InsertBefore) {
2256 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2257 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2258 return Create(Instruction::Trunc, S, Ty, Name, InsertBefore);
2261 CastInst *CastInst::CreateTruncOrBitCast(Value *S, const Type *Ty,
2263 BasicBlock *InsertAtEnd) {
2264 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2265 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2266 return Create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
2269 CastInst *CastInst::CreatePointerCast(Value *S, const Type *Ty,
2271 BasicBlock *InsertAtEnd) {
2272 assert(isa<PointerType>(S->getType()) && "Invalid cast");
2273 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
2276 if (Ty->isInteger())
2277 return Create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
2278 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2281 /// @brief Create a BitCast or a PtrToInt cast instruction
2282 CastInst *CastInst::CreatePointerCast(Value *S, const Type *Ty,
2284 Instruction *InsertBefore) {
2285 assert(isa<PointerType>(S->getType()) && "Invalid cast");
2286 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
2289 if (Ty->isInteger())
2290 return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
2291 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2294 CastInst *CastInst::CreateIntegerCast(Value *C, const Type *Ty,
2295 bool isSigned, const Twine &Name,
2296 Instruction *InsertBefore) {
2297 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
2298 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2299 unsigned DstBits = Ty->getScalarSizeInBits();
2300 Instruction::CastOps opcode =
2301 (SrcBits == DstBits ? Instruction::BitCast :
2302 (SrcBits > DstBits ? Instruction::Trunc :
2303 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2304 return Create(opcode, C, Ty, Name, InsertBefore);
2307 CastInst *CastInst::CreateIntegerCast(Value *C, const Type *Ty,
2308 bool isSigned, const Twine &Name,
2309 BasicBlock *InsertAtEnd) {
2310 assert(C->getType()->isIntOrIntVector() && Ty->isIntOrIntVector() &&
2312 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2313 unsigned DstBits = Ty->getScalarSizeInBits();
2314 Instruction::CastOps opcode =
2315 (SrcBits == DstBits ? Instruction::BitCast :
2316 (SrcBits > DstBits ? Instruction::Trunc :
2317 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2318 return Create(opcode, C, Ty, Name, InsertAtEnd);
2321 CastInst *CastInst::CreateFPCast(Value *C, const Type *Ty,
2323 Instruction *InsertBefore) {
2324 assert(C->getType()->isFPOrFPVector() && Ty->isFPOrFPVector() &&
2326 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2327 unsigned DstBits = Ty->getScalarSizeInBits();
2328 Instruction::CastOps opcode =
2329 (SrcBits == DstBits ? Instruction::BitCast :
2330 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2331 return Create(opcode, C, Ty, Name, InsertBefore);
2334 CastInst *CastInst::CreateFPCast(Value *C, const Type *Ty,
2336 BasicBlock *InsertAtEnd) {
2337 assert(C->getType()->isFPOrFPVector() && Ty->isFPOrFPVector() &&
2339 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2340 unsigned DstBits = Ty->getScalarSizeInBits();
2341 Instruction::CastOps opcode =
2342 (SrcBits == DstBits ? Instruction::BitCast :
2343 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2344 return Create(opcode, C, Ty, Name, InsertAtEnd);
2347 // Check whether it is valid to call getCastOpcode for these types.
2348 // This routine must be kept in sync with getCastOpcode.
2349 bool CastInst::isCastable(const Type *SrcTy, const Type *DestTy) {
2350 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2353 if (SrcTy == DestTy)
2356 // Get the bit sizes, we'll need these
2357 unsigned SrcBits = SrcTy->getScalarSizeInBits(); // 0 for ptr
2358 unsigned DestBits = DestTy->getScalarSizeInBits(); // 0 for ptr
2360 // Run through the possibilities ...
2361 if (DestTy->isInteger()) { // Casting to integral
2362 if (SrcTy->isInteger()) { // Casting from integral
2364 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2366 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2367 // Casting from vector
2368 return DestBits == PTy->getBitWidth();
2369 } else { // Casting from something else
2370 return isa<PointerType>(SrcTy);
2372 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2373 if (SrcTy->isInteger()) { // Casting from integral
2375 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2377 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2378 // Casting from vector
2379 return DestBits == PTy->getBitWidth();
2380 } else { // Casting from something else
2383 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2384 // Casting to vector
2385 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2386 // Casting from vector
2387 return DestPTy->getBitWidth() == SrcPTy->getBitWidth();
2388 } else { // Casting from something else
2389 return DestPTy->getBitWidth() == SrcBits;
2391 } else if (isa<PointerType>(DestTy)) { // Casting to pointer
2392 if (isa<PointerType>(SrcTy)) { // Casting from pointer
2394 } else if (SrcTy->isInteger()) { // Casting from integral
2396 } else { // Casting from something else
2399 } else { // Casting to something else
2404 // Provide a way to get a "cast" where the cast opcode is inferred from the
2405 // types and size of the operand. This, basically, is a parallel of the
2406 // logic in the castIsValid function below. This axiom should hold:
2407 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
2408 // should not assert in castIsValid. In other words, this produces a "correct"
2409 // casting opcode for the arguments passed to it.
2410 // This routine must be kept in sync with isCastable.
2411 Instruction::CastOps
2412 CastInst::getCastOpcode(
2413 const Value *Src, bool SrcIsSigned, const Type *DestTy, bool DestIsSigned) {
2414 // Get the bit sizes, we'll need these
2415 const Type *SrcTy = Src->getType();
2416 unsigned SrcBits = SrcTy->getScalarSizeInBits(); // 0 for ptr
2417 unsigned DestBits = DestTy->getScalarSizeInBits(); // 0 for ptr
2419 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2420 "Only first class types are castable!");
2422 // Run through the possibilities ...
2423 if (DestTy->isInteger()) { // Casting to integral
2424 if (SrcTy->isInteger()) { // Casting from integral
2425 if (DestBits < SrcBits)
2426 return Trunc; // int -> smaller int
2427 else if (DestBits > SrcBits) { // its an extension
2429 return SExt; // signed -> SEXT
2431 return ZExt; // unsigned -> ZEXT
2433 return BitCast; // Same size, No-op cast
2435 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2437 return FPToSI; // FP -> sint
2439 return FPToUI; // FP -> uint
2440 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2441 assert(DestBits == PTy->getBitWidth() &&
2442 "Casting vector to integer of different width");
2444 return BitCast; // Same size, no-op cast
2446 assert(isa<PointerType>(SrcTy) &&
2447 "Casting from a value that is not first-class type");
2448 return PtrToInt; // ptr -> int
2450 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2451 if (SrcTy->isInteger()) { // Casting from integral
2453 return SIToFP; // sint -> FP
2455 return UIToFP; // uint -> FP
2456 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2457 if (DestBits < SrcBits) {
2458 return FPTrunc; // FP -> smaller FP
2459 } else if (DestBits > SrcBits) {
2460 return FPExt; // FP -> larger FP
2462 return BitCast; // same size, no-op cast
2464 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2465 assert(DestBits == PTy->getBitWidth() &&
2466 "Casting vector to floating point of different width");
2468 return BitCast; // same size, no-op cast
2470 llvm_unreachable("Casting pointer or non-first class to float");
2472 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2473 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2474 assert(DestPTy->getBitWidth() == SrcPTy->getBitWidth() &&
2475 "Casting vector to vector of different widths");
2477 return BitCast; // vector -> vector
2478 } else if (DestPTy->getBitWidth() == SrcBits) {
2479 return BitCast; // float/int -> vector
2481 assert(!"Illegal cast to vector (wrong type or size)");
2483 } else if (isa<PointerType>(DestTy)) {
2484 if (isa<PointerType>(SrcTy)) {
2485 return BitCast; // ptr -> ptr
2486 } else if (SrcTy->isInteger()) {
2487 return IntToPtr; // int -> ptr
2489 assert(!"Casting pointer to other than pointer or int");
2492 assert(!"Casting to type that is not first-class");
2495 // If we fall through to here we probably hit an assertion cast above
2496 // and assertions are not turned on. Anything we return is an error, so
2497 // BitCast is as good a choice as any.
2501 //===----------------------------------------------------------------------===//
2502 // CastInst SubClass Constructors
2503 //===----------------------------------------------------------------------===//
2505 /// Check that the construction parameters for a CastInst are correct. This
2506 /// could be broken out into the separate constructors but it is useful to have
2507 /// it in one place and to eliminate the redundant code for getting the sizes
2508 /// of the types involved.
2510 CastInst::castIsValid(Instruction::CastOps op, Value *S, const Type *DstTy) {
2512 // Check for type sanity on the arguments
2513 const Type *SrcTy = S->getType();
2514 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType())
2517 // Get the size of the types in bits, we'll need this later
2518 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2519 unsigned DstBitSize = DstTy->getScalarSizeInBits();
2521 // Switch on the opcode provided
2523 default: return false; // This is an input error
2524 case Instruction::Trunc:
2525 return SrcTy->isIntOrIntVector() &&
2526 DstTy->isIntOrIntVector()&& SrcBitSize > DstBitSize;
2527 case Instruction::ZExt:
2528 return SrcTy->isIntOrIntVector() &&
2529 DstTy->isIntOrIntVector()&& SrcBitSize < DstBitSize;
2530 case Instruction::SExt:
2531 return SrcTy->isIntOrIntVector() &&
2532 DstTy->isIntOrIntVector()&& SrcBitSize < DstBitSize;
2533 case Instruction::FPTrunc:
2534 return SrcTy->isFPOrFPVector() &&
2535 DstTy->isFPOrFPVector() &&
2536 SrcBitSize > DstBitSize;
2537 case Instruction::FPExt:
2538 return SrcTy->isFPOrFPVector() &&
2539 DstTy->isFPOrFPVector() &&
2540 SrcBitSize < DstBitSize;
2541 case Instruction::UIToFP:
2542 case Instruction::SIToFP:
2543 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2544 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2545 return SVTy->getElementType()->isIntOrIntVector() &&
2546 DVTy->getElementType()->isFPOrFPVector() &&
2547 SVTy->getNumElements() == DVTy->getNumElements();
2550 return SrcTy->isIntOrIntVector() && DstTy->isFPOrFPVector();
2551 case Instruction::FPToUI:
2552 case Instruction::FPToSI:
2553 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2554 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2555 return SVTy->getElementType()->isFPOrFPVector() &&
2556 DVTy->getElementType()->isIntOrIntVector() &&
2557 SVTy->getNumElements() == DVTy->getNumElements();
2560 return SrcTy->isFPOrFPVector() && DstTy->isIntOrIntVector();
2561 case Instruction::PtrToInt:
2562 return isa<PointerType>(SrcTy) && DstTy->isInteger();
2563 case Instruction::IntToPtr:
2564 return SrcTy->isInteger() && isa<PointerType>(DstTy);
2565 case Instruction::BitCast:
2566 // BitCast implies a no-op cast of type only. No bits change.
2567 // However, you can't cast pointers to anything but pointers.
2568 if (isa<PointerType>(SrcTy) != isa<PointerType>(DstTy))
2571 // Now we know we're not dealing with a pointer/non-pointer mismatch. In all
2572 // these cases, the cast is okay if the source and destination bit widths
2574 return SrcTy->getPrimitiveSizeInBits() == DstTy->getPrimitiveSizeInBits();
2578 TruncInst::TruncInst(
2579 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2580 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2581 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2584 TruncInst::TruncInst(
2585 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2586 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2587 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2591 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2592 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2593 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2597 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2598 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2599 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2602 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2603 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2604 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2608 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2609 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2610 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2613 FPTruncInst::FPTruncInst(
2614 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2615 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2616 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2619 FPTruncInst::FPTruncInst(
2620 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2621 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2622 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2625 FPExtInst::FPExtInst(
2626 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2627 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2628 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2631 FPExtInst::FPExtInst(
2632 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2633 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2634 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2637 UIToFPInst::UIToFPInst(
2638 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2639 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2640 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2643 UIToFPInst::UIToFPInst(
2644 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2645 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2646 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2649 SIToFPInst::SIToFPInst(
2650 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2651 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2652 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2655 SIToFPInst::SIToFPInst(
2656 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2657 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2658 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2661 FPToUIInst::FPToUIInst(
2662 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2663 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2664 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2667 FPToUIInst::FPToUIInst(
2668 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2669 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2670 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2673 FPToSIInst::FPToSIInst(
2674 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2675 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2676 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2679 FPToSIInst::FPToSIInst(
2680 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2681 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2682 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2685 PtrToIntInst::PtrToIntInst(
2686 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2687 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2688 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2691 PtrToIntInst::PtrToIntInst(
2692 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2693 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2694 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2697 IntToPtrInst::IntToPtrInst(
2698 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2699 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2700 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2703 IntToPtrInst::IntToPtrInst(
2704 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2705 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2706 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2709 BitCastInst::BitCastInst(
2710 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2711 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2712 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2715 BitCastInst::BitCastInst(
2716 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2717 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2718 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2721 //===----------------------------------------------------------------------===//
2723 //===----------------------------------------------------------------------===//
2725 CmpInst::CmpInst(const Type *ty, OtherOps op, unsigned short predicate,
2726 Value *LHS, Value *RHS, const Twine &Name,
2727 Instruction *InsertBefore)
2728 : Instruction(ty, op,
2729 OperandTraits<CmpInst>::op_begin(this),
2730 OperandTraits<CmpInst>::operands(this),
2734 SubclassData = predicate;
2738 CmpInst::CmpInst(const Type *ty, OtherOps op, unsigned short predicate,
2739 Value *LHS, Value *RHS, const Twine &Name,
2740 BasicBlock *InsertAtEnd)
2741 : Instruction(ty, op,
2742 OperandTraits<CmpInst>::op_begin(this),
2743 OperandTraits<CmpInst>::operands(this),
2747 SubclassData = predicate;
2752 CmpInst::Create(OtherOps Op, unsigned short predicate,
2753 Value *S1, Value *S2,
2754 const Twine &Name, Instruction *InsertBefore) {
2755 if (Op == Instruction::ICmp) {
2757 return new ICmpInst(InsertBefore, CmpInst::Predicate(predicate),
2760 return new ICmpInst(CmpInst::Predicate(predicate),
2765 return new FCmpInst(InsertBefore, CmpInst::Predicate(predicate),
2768 return new FCmpInst(CmpInst::Predicate(predicate),
2773 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2774 const Twine &Name, BasicBlock *InsertAtEnd) {
2775 if (Op == Instruction::ICmp) {
2776 return new ICmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
2779 return new FCmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
2783 void CmpInst::swapOperands() {
2784 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2787 cast<FCmpInst>(this)->swapOperands();
2790 bool CmpInst::isCommutative() {
2791 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2792 return IC->isCommutative();
2793 return cast<FCmpInst>(this)->isCommutative();
2796 bool CmpInst::isEquality() {
2797 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2798 return IC->isEquality();
2799 return cast<FCmpInst>(this)->isEquality();
2803 CmpInst::Predicate CmpInst::getInversePredicate(Predicate pred) {
2805 default: assert(!"Unknown cmp predicate!");
2806 case ICMP_EQ: return ICMP_NE;
2807 case ICMP_NE: return ICMP_EQ;
2808 case ICMP_UGT: return ICMP_ULE;
2809 case ICMP_ULT: return ICMP_UGE;
2810 case ICMP_UGE: return ICMP_ULT;
2811 case ICMP_ULE: return ICMP_UGT;
2812 case ICMP_SGT: return ICMP_SLE;
2813 case ICMP_SLT: return ICMP_SGE;
2814 case ICMP_SGE: return ICMP_SLT;
2815 case ICMP_SLE: return ICMP_SGT;
2817 case FCMP_OEQ: return FCMP_UNE;
2818 case FCMP_ONE: return FCMP_UEQ;
2819 case FCMP_OGT: return FCMP_ULE;
2820 case FCMP_OLT: return FCMP_UGE;
2821 case FCMP_OGE: return FCMP_ULT;
2822 case FCMP_OLE: return FCMP_UGT;
2823 case FCMP_UEQ: return FCMP_ONE;
2824 case FCMP_UNE: return FCMP_OEQ;
2825 case FCMP_UGT: return FCMP_OLE;
2826 case FCMP_ULT: return FCMP_OGE;
2827 case FCMP_UGE: return FCMP_OLT;
2828 case FCMP_ULE: return FCMP_OGT;
2829 case FCMP_ORD: return FCMP_UNO;
2830 case FCMP_UNO: return FCMP_ORD;
2831 case FCMP_TRUE: return FCMP_FALSE;
2832 case FCMP_FALSE: return FCMP_TRUE;
2836 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
2838 default: assert(! "Unknown icmp predicate!");
2839 case ICMP_EQ: case ICMP_NE:
2840 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2842 case ICMP_UGT: return ICMP_SGT;
2843 case ICMP_ULT: return ICMP_SLT;
2844 case ICMP_UGE: return ICMP_SGE;
2845 case ICMP_ULE: return ICMP_SLE;
2849 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
2851 default: assert(! "Unknown icmp predicate!");
2852 case ICMP_EQ: case ICMP_NE:
2853 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
2855 case ICMP_SGT: return ICMP_UGT;
2856 case ICMP_SLT: return ICMP_ULT;
2857 case ICMP_SGE: return ICMP_UGE;
2858 case ICMP_SLE: return ICMP_ULE;
2862 bool ICmpInst::isSignedPredicate(Predicate pred) {
2864 default: assert(! "Unknown icmp predicate!");
2865 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2867 case ICMP_EQ: case ICMP_NE: case ICMP_UGT: case ICMP_ULT:
2868 case ICMP_UGE: case ICMP_ULE:
2873 /// Initialize a set of values that all satisfy the condition with C.
2876 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
2879 uint32_t BitWidth = C.getBitWidth();
2881 default: llvm_unreachable("Invalid ICmp opcode to ConstantRange ctor!");
2882 case ICmpInst::ICMP_EQ: Upper++; break;
2883 case ICmpInst::ICMP_NE: Lower++; break;
2884 case ICmpInst::ICMP_ULT: Lower = APInt::getMinValue(BitWidth); break;
2885 case ICmpInst::ICMP_SLT: Lower = APInt::getSignedMinValue(BitWidth); break;
2886 case ICmpInst::ICMP_UGT:
2887 Lower++; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2889 case ICmpInst::ICMP_SGT:
2890 Lower++; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2892 case ICmpInst::ICMP_ULE:
2893 Lower = APInt::getMinValue(BitWidth); Upper++;
2895 case ICmpInst::ICMP_SLE:
2896 Lower = APInt::getSignedMinValue(BitWidth); Upper++;
2898 case ICmpInst::ICMP_UGE:
2899 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2901 case ICmpInst::ICMP_SGE:
2902 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2905 return ConstantRange(Lower, Upper);
2908 CmpInst::Predicate CmpInst::getSwappedPredicate(Predicate pred) {
2910 default: assert(!"Unknown cmp predicate!");
2911 case ICMP_EQ: case ICMP_NE:
2913 case ICMP_SGT: return ICMP_SLT;
2914 case ICMP_SLT: return ICMP_SGT;
2915 case ICMP_SGE: return ICMP_SLE;
2916 case ICMP_SLE: return ICMP_SGE;
2917 case ICMP_UGT: return ICMP_ULT;
2918 case ICMP_ULT: return ICMP_UGT;
2919 case ICMP_UGE: return ICMP_ULE;
2920 case ICMP_ULE: return ICMP_UGE;
2922 case FCMP_FALSE: case FCMP_TRUE:
2923 case FCMP_OEQ: case FCMP_ONE:
2924 case FCMP_UEQ: case FCMP_UNE:
2925 case FCMP_ORD: case FCMP_UNO:
2927 case FCMP_OGT: return FCMP_OLT;
2928 case FCMP_OLT: return FCMP_OGT;
2929 case FCMP_OGE: return FCMP_OLE;
2930 case FCMP_OLE: return FCMP_OGE;
2931 case FCMP_UGT: return FCMP_ULT;
2932 case FCMP_ULT: return FCMP_UGT;
2933 case FCMP_UGE: return FCMP_ULE;
2934 case FCMP_ULE: return FCMP_UGE;
2938 bool CmpInst::isUnsigned(unsigned short predicate) {
2939 switch (predicate) {
2940 default: return false;
2941 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
2942 case ICmpInst::ICMP_UGE: return true;
2946 bool CmpInst::isSigned(unsigned short predicate){
2947 switch (predicate) {
2948 default: return false;
2949 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
2950 case ICmpInst::ICMP_SGE: return true;
2954 bool CmpInst::isOrdered(unsigned short predicate) {
2955 switch (predicate) {
2956 default: return false;
2957 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
2958 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
2959 case FCmpInst::FCMP_ORD: return true;
2963 bool CmpInst::isUnordered(unsigned short predicate) {
2964 switch (predicate) {
2965 default: return false;
2966 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
2967 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
2968 case FCmpInst::FCMP_UNO: return true;
2972 //===----------------------------------------------------------------------===//
2973 // SwitchInst Implementation
2974 //===----------------------------------------------------------------------===//
2976 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumCases) {
2977 assert(Value && Default);
2978 ReservedSpace = 2+NumCases*2;
2980 OperandList = allocHungoffUses(ReservedSpace);
2982 OperandList[0] = Value;
2983 OperandList[1] = Default;
2986 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2987 /// switch on and a default destination. The number of additional cases can
2988 /// be specified here to make memory allocation more efficient. This
2989 /// constructor can also autoinsert before another instruction.
2990 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2991 Instruction *InsertBefore)
2992 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
2993 0, 0, InsertBefore) {
2994 init(Value, Default, NumCases);
2997 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2998 /// switch on and a default destination. The number of additional cases can
2999 /// be specified here to make memory allocation more efficient. This
3000 /// constructor also autoinserts at the end of the specified BasicBlock.
3001 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
3002 BasicBlock *InsertAtEnd)
3003 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
3004 0, 0, InsertAtEnd) {
3005 init(Value, Default, NumCases);
3008 SwitchInst::SwitchInst(const SwitchInst &SI)
3009 : TerminatorInst(Type::getVoidTy(SI.getContext()), Instruction::Switch,
3010 allocHungoffUses(SI.getNumOperands()), SI.getNumOperands()) {
3011 Use *OL = OperandList, *InOL = SI.OperandList;
3012 for (unsigned i = 0, E = SI.getNumOperands(); i != E; i+=2) {
3014 OL[i+1] = InOL[i+1];
3016 SubclassOptionalData = SI.SubclassOptionalData;
3019 SwitchInst::~SwitchInst() {
3020 dropHungoffUses(OperandList);
3024 /// addCase - Add an entry to the switch instruction...
3026 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
3027 unsigned OpNo = NumOperands;
3028 if (OpNo+2 > ReservedSpace)
3029 resizeOperands(0); // Get more space!
3030 // Initialize some new operands.
3031 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
3032 NumOperands = OpNo+2;
3033 OperandList[OpNo] = OnVal;
3034 OperandList[OpNo+1] = Dest;
3037 /// removeCase - This method removes the specified successor from the switch
3038 /// instruction. Note that this cannot be used to remove the default
3039 /// destination (successor #0).
3041 void SwitchInst::removeCase(unsigned idx) {
3042 assert(idx != 0 && "Cannot remove the default case!");
3043 assert(idx*2 < getNumOperands() && "Successor index out of range!!!");
3045 unsigned NumOps = getNumOperands();
3046 Use *OL = OperandList;
3048 // Move everything after this operand down.
3050 // FIXME: we could just swap with the end of the list, then erase. However,
3051 // client might not expect this to happen. The code as it is thrashes the
3052 // use/def lists, which is kinda lame.
3053 for (unsigned i = (idx+1)*2; i != NumOps; i += 2) {
3055 OL[i-2+1] = OL[i+1];
3058 // Nuke the last value.
3059 OL[NumOps-2].set(0);
3060 OL[NumOps-2+1].set(0);
3061 NumOperands = NumOps-2;
3064 /// resizeOperands - resize operands - This adjusts the length of the operands
3065 /// list according to the following behavior:
3066 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
3067 /// of operation. This grows the number of ops by 3 times.
3068 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
3069 /// 3. If NumOps == NumOperands, trim the reserved space.
3071 void SwitchInst::resizeOperands(unsigned NumOps) {
3072 unsigned e = getNumOperands();
3075 } else if (NumOps*2 > NumOperands) {
3076 // No resize needed.
3077 if (ReservedSpace >= NumOps) return;
3078 } else if (NumOps == NumOperands) {
3079 if (ReservedSpace == NumOps) return;
3084 ReservedSpace = NumOps;
3085 Use *NewOps = allocHungoffUses(NumOps);
3086 Use *OldOps = OperandList;
3087 for (unsigned i = 0; i != e; ++i) {
3088 NewOps[i] = OldOps[i];
3090 OperandList = NewOps;
3091 if (OldOps) Use::zap(OldOps, OldOps + e, true);
3095 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
3096 return getSuccessor(idx);
3098 unsigned SwitchInst::getNumSuccessorsV() const {
3099 return getNumSuccessors();
3101 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3102 setSuccessor(idx, B);
3105 // Define these methods here so vtables don't get emitted into every translation
3106 // unit that uses these classes.
3108 GetElementPtrInst *GetElementPtrInst::clone() const {
3109 GetElementPtrInst *New = new(getNumOperands()) GetElementPtrInst(*this);
3110 New->SubclassOptionalData = SubclassOptionalData;
3111 if (hasMetadata()) {
3112 LLVMContext &Context = getContext();
3113 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3118 BinaryOperator *BinaryOperator::clone() const {
3119 BinaryOperator *New = Create(getOpcode(), Op<0>(), Op<1>());
3120 New->SubclassOptionalData = SubclassOptionalData;
3121 if (hasMetadata()) {
3122 LLVMContext &Context = getContext();
3123 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3128 FCmpInst* FCmpInst::clone() const {
3129 FCmpInst *New = new FCmpInst(getPredicate(), Op<0>(), Op<1>());
3130 New->SubclassOptionalData = SubclassOptionalData;
3131 if (hasMetadata()) {
3132 LLVMContext &Context = getContext();
3133 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3137 ICmpInst* ICmpInst::clone() const {
3138 ICmpInst *New = new ICmpInst(getPredicate(), Op<0>(), Op<1>());
3139 New->SubclassOptionalData = SubclassOptionalData;
3140 if (hasMetadata()) {
3141 LLVMContext &Context = getContext();
3142 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3147 ExtractValueInst *ExtractValueInst::clone() const {
3148 ExtractValueInst *New = new ExtractValueInst(*this);
3149 New->SubclassOptionalData = SubclassOptionalData;
3150 if (hasMetadata()) {
3151 LLVMContext &Context = getContext();
3152 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3156 InsertValueInst *InsertValueInst::clone() const {
3157 InsertValueInst *New = new InsertValueInst(*this);
3158 New->SubclassOptionalData = SubclassOptionalData;
3159 if (hasMetadata()) {
3160 LLVMContext &Context = getContext();
3161 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3166 AllocaInst *AllocaInst::clone() const {
3167 AllocaInst *New = new AllocaInst(getAllocatedType(),
3168 (Value*)getOperand(0),
3170 New->SubclassOptionalData = SubclassOptionalData;
3171 if (hasMetadata()) {
3172 LLVMContext &Context = getContext();
3173 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3178 FreeInst *FreeInst::clone() const {
3179 FreeInst *New = new FreeInst(getOperand(0));
3180 New->SubclassOptionalData = SubclassOptionalData;
3181 if (hasMetadata()) {
3182 LLVMContext &Context = getContext();
3183 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3188 LoadInst *LoadInst::clone() const {
3189 LoadInst *New = new LoadInst(getOperand(0),
3190 Twine(), isVolatile(),
3192 New->SubclassOptionalData = SubclassOptionalData;
3193 if (hasMetadata()) {
3194 LLVMContext &Context = getContext();
3195 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3200 StoreInst *StoreInst::clone() const {
3201 StoreInst *New = new StoreInst(getOperand(0), getOperand(1),
3202 isVolatile(), getAlignment());
3203 New->SubclassOptionalData = SubclassOptionalData;
3204 if (hasMetadata()) {
3205 LLVMContext &Context = getContext();
3206 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3211 TruncInst *TruncInst::clone() const {
3212 TruncInst *New = new TruncInst(getOperand(0), getType());
3213 New->SubclassOptionalData = SubclassOptionalData;
3214 if (hasMetadata()) {
3215 LLVMContext &Context = getContext();
3216 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3221 ZExtInst *ZExtInst::clone() const {
3222 ZExtInst *New = new ZExtInst(getOperand(0), getType());
3223 New->SubclassOptionalData = SubclassOptionalData;
3224 if (hasMetadata()) {
3225 LLVMContext &Context = getContext();
3226 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3231 SExtInst *SExtInst::clone() const {
3232 SExtInst *New = new SExtInst(getOperand(0), getType());
3233 New->SubclassOptionalData = SubclassOptionalData;
3234 if (hasMetadata()) {
3235 LLVMContext &Context = getContext();
3236 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3241 FPTruncInst *FPTruncInst::clone() const {
3242 FPTruncInst *New = new FPTruncInst(getOperand(0), getType());
3243 New->SubclassOptionalData = SubclassOptionalData;
3244 if (hasMetadata()) {
3245 LLVMContext &Context = getContext();
3246 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3251 FPExtInst *FPExtInst::clone() const {
3252 FPExtInst *New = new FPExtInst(getOperand(0), getType());
3253 New->SubclassOptionalData = SubclassOptionalData;
3254 if (hasMetadata()) {
3255 LLVMContext &Context = getContext();
3256 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3261 UIToFPInst *UIToFPInst::clone() const {
3262 UIToFPInst *New = new UIToFPInst(getOperand(0), getType());
3263 New->SubclassOptionalData = SubclassOptionalData;
3264 if (hasMetadata()) {
3265 LLVMContext &Context = getContext();
3266 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3271 SIToFPInst *SIToFPInst::clone() const {
3272 SIToFPInst *New = new SIToFPInst(getOperand(0), getType());
3273 New->SubclassOptionalData = SubclassOptionalData;
3274 if (hasMetadata()) {
3275 LLVMContext &Context = getContext();
3276 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3281 FPToUIInst *FPToUIInst::clone() const {
3282 FPToUIInst *New = new FPToUIInst(getOperand(0), getType());
3283 New->SubclassOptionalData = SubclassOptionalData;
3284 if (hasMetadata()) {
3285 LLVMContext &Context = getContext();
3286 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3291 FPToSIInst *FPToSIInst::clone() const {
3292 FPToSIInst *New = new FPToSIInst(getOperand(0), getType());
3293 New->SubclassOptionalData = SubclassOptionalData;
3294 if (hasMetadata()) {
3295 LLVMContext &Context = getContext();
3296 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3301 PtrToIntInst *PtrToIntInst::clone() const {
3302 PtrToIntInst *New = new PtrToIntInst(getOperand(0), getType());
3303 New->SubclassOptionalData = SubclassOptionalData;
3304 if (hasMetadata()) {
3305 LLVMContext &Context = getContext();
3306 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3311 IntToPtrInst *IntToPtrInst::clone() const {
3312 IntToPtrInst *New = new IntToPtrInst(getOperand(0), getType());
3313 New->SubclassOptionalData = SubclassOptionalData;
3314 if (hasMetadata()) {
3315 LLVMContext &Context = getContext();
3316 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3321 BitCastInst *BitCastInst::clone() const {
3322 BitCastInst *New = new BitCastInst(getOperand(0), getType());
3323 New->SubclassOptionalData = SubclassOptionalData;
3324 if (hasMetadata()) {
3325 LLVMContext &Context = getContext();
3326 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3331 CallInst *CallInst::clone() const {
3332 CallInst *New = new(getNumOperands()) CallInst(*this);
3333 New->SubclassOptionalData = SubclassOptionalData;
3334 if (hasMetadata()) {
3335 LLVMContext &Context = getContext();
3336 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3341 SelectInst *SelectInst::clone() const {
3342 SelectInst *New = SelectInst::Create(getOperand(0),
3345 New->SubclassOptionalData = SubclassOptionalData;
3346 if (hasMetadata()) {
3347 LLVMContext &Context = getContext();
3348 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3353 VAArgInst *VAArgInst::clone() const {
3354 VAArgInst *New = new VAArgInst(getOperand(0), getType());
3355 New->SubclassOptionalData = SubclassOptionalData;
3356 if (hasMetadata()) {
3357 LLVMContext &Context = getContext();
3358 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3363 ExtractElementInst *ExtractElementInst::clone() const {
3364 ExtractElementInst *New = ExtractElementInst::Create(getOperand(0),
3366 New->SubclassOptionalData = SubclassOptionalData;
3367 if (hasMetadata()) {
3368 LLVMContext &Context = getContext();
3369 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3374 InsertElementInst *InsertElementInst::clone() const {
3375 InsertElementInst *New = InsertElementInst::Create(getOperand(0),
3378 New->SubclassOptionalData = SubclassOptionalData;
3379 if (hasMetadata()) {
3380 LLVMContext &Context = getContext();
3381 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3386 ShuffleVectorInst *ShuffleVectorInst::clone() const {
3387 ShuffleVectorInst *New = new ShuffleVectorInst(getOperand(0),
3390 New->SubclassOptionalData = SubclassOptionalData;
3391 if (hasMetadata()) {
3392 LLVMContext &Context = getContext();
3393 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3398 PHINode *PHINode::clone() const {
3399 PHINode *New = new PHINode(*this);
3400 New->SubclassOptionalData = SubclassOptionalData;
3401 if (hasMetadata()) {
3402 LLVMContext &Context = getContext();
3403 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3408 ReturnInst *ReturnInst::clone() const {
3409 ReturnInst *New = new(getNumOperands()) ReturnInst(*this);
3410 New->SubclassOptionalData = SubclassOptionalData;
3411 if (hasMetadata()) {
3412 LLVMContext &Context = getContext();
3413 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3418 BranchInst *BranchInst::clone() const {
3419 unsigned Ops(getNumOperands());
3420 BranchInst *New = new(Ops, Ops == 1) BranchInst(*this);
3421 New->SubclassOptionalData = SubclassOptionalData;
3422 if (hasMetadata()) {
3423 LLVMContext &Context = getContext();
3424 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3429 SwitchInst *SwitchInst::clone() const {
3430 SwitchInst *New = new SwitchInst(*this);
3431 New->SubclassOptionalData = SubclassOptionalData;
3432 if (hasMetadata()) {
3433 LLVMContext &Context = getContext();
3434 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3439 InvokeInst *InvokeInst::clone() const {
3440 InvokeInst *New = new(getNumOperands()) InvokeInst(*this);
3441 New->SubclassOptionalData = SubclassOptionalData;
3442 if (hasMetadata()) {
3443 LLVMContext &Context = getContext();
3444 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3449 UnwindInst *UnwindInst::clone() const {
3450 LLVMContext &Context = getContext();
3451 UnwindInst *New = new UnwindInst(Context);
3452 New->SubclassOptionalData = SubclassOptionalData;
3454 Context.pImpl->TheMetadata.ValueIsCloned(this, New);
3458 UnreachableInst *UnreachableInst::clone() const {
3459 LLVMContext &Context = getContext();
3460 UnreachableInst *New = new UnreachableInst(Context);
3461 New->SubclassOptionalData = SubclassOptionalData;
3463 Context.pImpl->TheMetadata.ValueIsCloned(this, New);