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 // LoadInst Implementation
989 //===----------------------------------------------------------------------===//
991 void LoadInst::AssertOK() {
992 assert(isa<PointerType>(getOperand(0)->getType()) &&
993 "Ptr must have pointer type.");
996 LoadInst::LoadInst(Value *Ptr, const Twine &Name, Instruction *InsertBef)
997 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
998 Load, Ptr, InsertBef) {
1005 LoadInst::LoadInst(Value *Ptr, const Twine &Name, BasicBlock *InsertAE)
1006 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1007 Load, Ptr, InsertAE) {
1014 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
1015 Instruction *InsertBef)
1016 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1017 Load, Ptr, InsertBef) {
1018 setVolatile(isVolatile);
1024 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
1025 unsigned Align, Instruction *InsertBef)
1026 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1027 Load, Ptr, InsertBef) {
1028 setVolatile(isVolatile);
1029 setAlignment(Align);
1034 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
1035 unsigned Align, BasicBlock *InsertAE)
1036 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1037 Load, Ptr, InsertAE) {
1038 setVolatile(isVolatile);
1039 setAlignment(Align);
1044 LoadInst::LoadInst(Value *Ptr, const Twine &Name, bool isVolatile,
1045 BasicBlock *InsertAE)
1046 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1047 Load, Ptr, InsertAE) {
1048 setVolatile(isVolatile);
1056 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
1057 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1058 Load, Ptr, InsertBef) {
1062 if (Name && Name[0]) setName(Name);
1065 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
1066 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1067 Load, Ptr, InsertAE) {
1071 if (Name && Name[0]) setName(Name);
1074 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
1075 Instruction *InsertBef)
1076 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1077 Load, Ptr, InsertBef) {
1078 setVolatile(isVolatile);
1081 if (Name && Name[0]) setName(Name);
1084 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
1085 BasicBlock *InsertAE)
1086 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
1087 Load, Ptr, InsertAE) {
1088 setVolatile(isVolatile);
1091 if (Name && Name[0]) setName(Name);
1094 void LoadInst::setAlignment(unsigned Align) {
1095 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1096 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
1099 //===----------------------------------------------------------------------===//
1100 // StoreInst Implementation
1101 //===----------------------------------------------------------------------===//
1103 void StoreInst::AssertOK() {
1104 assert(getOperand(0) && getOperand(1) && "Both operands must be non-null!");
1105 assert(isa<PointerType>(getOperand(1)->getType()) &&
1106 "Ptr must have pointer type!");
1107 assert(getOperand(0)->getType() ==
1108 cast<PointerType>(getOperand(1)->getType())->getElementType()
1109 && "Ptr must be a pointer to Val type!");
1113 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
1114 : Instruction(Type::getVoidTy(val->getContext()), Store,
1115 OperandTraits<StoreInst>::op_begin(this),
1116 OperandTraits<StoreInst>::operands(this),
1125 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
1126 : Instruction(Type::getVoidTy(val->getContext()), Store,
1127 OperandTraits<StoreInst>::op_begin(this),
1128 OperandTraits<StoreInst>::operands(this),
1137 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1138 Instruction *InsertBefore)
1139 : Instruction(Type::getVoidTy(val->getContext()), Store,
1140 OperandTraits<StoreInst>::op_begin(this),
1141 OperandTraits<StoreInst>::operands(this),
1145 setVolatile(isVolatile);
1150 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1151 unsigned Align, Instruction *InsertBefore)
1152 : Instruction(Type::getVoidTy(val->getContext()), Store,
1153 OperandTraits<StoreInst>::op_begin(this),
1154 OperandTraits<StoreInst>::operands(this),
1158 setVolatile(isVolatile);
1159 setAlignment(Align);
1163 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1164 unsigned Align, BasicBlock *InsertAtEnd)
1165 : Instruction(Type::getVoidTy(val->getContext()), Store,
1166 OperandTraits<StoreInst>::op_begin(this),
1167 OperandTraits<StoreInst>::operands(this),
1171 setVolatile(isVolatile);
1172 setAlignment(Align);
1176 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1177 BasicBlock *InsertAtEnd)
1178 : Instruction(Type::getVoidTy(val->getContext()), Store,
1179 OperandTraits<StoreInst>::op_begin(this),
1180 OperandTraits<StoreInst>::operands(this),
1184 setVolatile(isVolatile);
1189 void StoreInst::setAlignment(unsigned Align) {
1190 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1191 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
1194 //===----------------------------------------------------------------------===//
1195 // GetElementPtrInst Implementation
1196 //===----------------------------------------------------------------------===//
1198 static unsigned retrieveAddrSpace(const Value *Val) {
1199 return cast<PointerType>(Val->getType())->getAddressSpace();
1202 void GetElementPtrInst::init(Value *Ptr, Value* const *Idx, unsigned NumIdx,
1203 const Twine &Name) {
1204 assert(NumOperands == 1+NumIdx && "NumOperands not initialized?");
1205 Use *OL = OperandList;
1208 for (unsigned i = 0; i != NumIdx; ++i)
1214 void GetElementPtrInst::init(Value *Ptr, Value *Idx, const Twine &Name) {
1215 assert(NumOperands == 2 && "NumOperands not initialized?");
1216 Use *OL = OperandList;
1223 GetElementPtrInst::GetElementPtrInst(const GetElementPtrInst &GEPI)
1224 : Instruction(GEPI.getType(), GetElementPtr,
1225 OperandTraits<GetElementPtrInst>::op_end(this)
1226 - GEPI.getNumOperands(),
1227 GEPI.getNumOperands()) {
1228 Use *OL = OperandList;
1229 Use *GEPIOL = GEPI.OperandList;
1230 for (unsigned i = 0, E = NumOperands; i != E; ++i)
1232 SubclassOptionalData = GEPI.SubclassOptionalData;
1235 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1236 const Twine &Name, Instruction *InBe)
1237 : Instruction(PointerType::get(
1238 checkType(getIndexedType(Ptr->getType(),Idx)), retrieveAddrSpace(Ptr)),
1240 OperandTraits<GetElementPtrInst>::op_end(this) - 2,
1242 init(Ptr, Idx, Name);
1245 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1246 const Twine &Name, BasicBlock *IAE)
1247 : Instruction(PointerType::get(
1248 checkType(getIndexedType(Ptr->getType(),Idx)),
1249 retrieveAddrSpace(Ptr)),
1251 OperandTraits<GetElementPtrInst>::op_end(this) - 2,
1253 init(Ptr, Idx, Name);
1256 /// getIndexedType - Returns the type of the element that would be accessed with
1257 /// a gep instruction with the specified parameters.
1259 /// The Idxs pointer should point to a continuous piece of memory containing the
1260 /// indices, either as Value* or uint64_t.
1262 /// A null type is returned if the indices are invalid for the specified
1265 template <typename IndexTy>
1266 static const Type* getIndexedTypeInternal(const Type *Ptr, IndexTy const *Idxs,
1268 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
1269 if (!PTy) return 0; // Type isn't a pointer type!
1270 const Type *Agg = PTy->getElementType();
1272 // Handle the special case of the empty set index set, which is always valid.
1276 // If there is at least one index, the top level type must be sized, otherwise
1277 // it cannot be 'stepped over'. We explicitly allow abstract types (those
1278 // that contain opaque types) under the assumption that it will be resolved to
1279 // a sane type later.
1280 if (!Agg->isSized() && !Agg->isAbstract())
1283 unsigned CurIdx = 1;
1284 for (; CurIdx != NumIdx; ++CurIdx) {
1285 const CompositeType *CT = dyn_cast<CompositeType>(Agg);
1286 if (!CT || isa<PointerType>(CT)) return 0;
1287 IndexTy Index = Idxs[CurIdx];
1288 if (!CT->indexValid(Index)) return 0;
1289 Agg = CT->getTypeAtIndex(Index);
1291 // If the new type forwards to another type, then it is in the middle
1292 // of being refined to another type (and hence, may have dropped all
1293 // references to what it was using before). So, use the new forwarded
1295 if (const Type *Ty = Agg->getForwardedType())
1298 return CurIdx == NumIdx ? Agg : 0;
1301 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
1304 return getIndexedTypeInternal(Ptr, Idxs, NumIdx);
1307 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
1308 uint64_t const *Idxs,
1310 return getIndexedTypeInternal(Ptr, Idxs, NumIdx);
1313 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr, Value *Idx) {
1314 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
1315 if (!PTy) return 0; // Type isn't a pointer type!
1317 // Check the pointer index.
1318 if (!PTy->indexValid(Idx)) return 0;
1320 return PTy->getElementType();
1324 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
1325 /// zeros. If so, the result pointer and the first operand have the same
1326 /// value, just potentially different types.
1327 bool GetElementPtrInst::hasAllZeroIndices() const {
1328 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1329 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
1330 if (!CI->isZero()) return false;
1338 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
1339 /// constant integers. If so, the result pointer and the first operand have
1340 /// a constant offset between them.
1341 bool GetElementPtrInst::hasAllConstantIndices() const {
1342 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1343 if (!isa<ConstantInt>(getOperand(i)))
1349 void GetElementPtrInst::setIsInBounds(bool B) {
1350 cast<GEPOperator>(this)->setIsInBounds(B);
1353 bool GetElementPtrInst::isInBounds() const {
1354 return cast<GEPOperator>(this)->isInBounds();
1357 //===----------------------------------------------------------------------===//
1358 // ExtractElementInst Implementation
1359 //===----------------------------------------------------------------------===//
1361 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1363 Instruction *InsertBef)
1364 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1366 OperandTraits<ExtractElementInst>::op_begin(this),
1368 assert(isValidOperands(Val, Index) &&
1369 "Invalid extractelement instruction operands!");
1375 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1377 BasicBlock *InsertAE)
1378 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1380 OperandTraits<ExtractElementInst>::op_begin(this),
1382 assert(isValidOperands(Val, Index) &&
1383 "Invalid extractelement instruction operands!");
1391 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
1392 if (!isa<VectorType>(Val->getType()) ||
1393 Index->getType() != Type::getInt32Ty(Val->getContext()))
1399 //===----------------------------------------------------------------------===//
1400 // InsertElementInst Implementation
1401 //===----------------------------------------------------------------------===//
1403 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1405 Instruction *InsertBef)
1406 : Instruction(Vec->getType(), InsertElement,
1407 OperandTraits<InsertElementInst>::op_begin(this),
1409 assert(isValidOperands(Vec, Elt, Index) &&
1410 "Invalid insertelement instruction operands!");
1417 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1419 BasicBlock *InsertAE)
1420 : Instruction(Vec->getType(), InsertElement,
1421 OperandTraits<InsertElementInst>::op_begin(this),
1423 assert(isValidOperands(Vec, Elt, Index) &&
1424 "Invalid insertelement instruction operands!");
1432 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
1433 const Value *Index) {
1434 if (!isa<VectorType>(Vec->getType()))
1435 return false; // First operand of insertelement must be vector type.
1437 if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
1438 return false;// Second operand of insertelement must be vector element type.
1440 if (Index->getType() != Type::getInt32Ty(Vec->getContext()))
1441 return false; // Third operand of insertelement must be i32.
1446 //===----------------------------------------------------------------------===//
1447 // ShuffleVectorInst Implementation
1448 //===----------------------------------------------------------------------===//
1450 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1452 Instruction *InsertBefore)
1453 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1454 cast<VectorType>(Mask->getType())->getNumElements()),
1456 OperandTraits<ShuffleVectorInst>::op_begin(this),
1457 OperandTraits<ShuffleVectorInst>::operands(this),
1459 assert(isValidOperands(V1, V2, Mask) &&
1460 "Invalid shuffle vector instruction operands!");
1467 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1469 BasicBlock *InsertAtEnd)
1470 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1471 cast<VectorType>(Mask->getType())->getNumElements()),
1473 OperandTraits<ShuffleVectorInst>::op_begin(this),
1474 OperandTraits<ShuffleVectorInst>::operands(this),
1476 assert(isValidOperands(V1, V2, Mask) &&
1477 "Invalid shuffle vector instruction operands!");
1485 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1486 const Value *Mask) {
1487 if (!isa<VectorType>(V1->getType()) || V1->getType() != V2->getType())
1490 const VectorType *MaskTy = dyn_cast<VectorType>(Mask->getType());
1491 if (!isa<Constant>(Mask) || MaskTy == 0 ||
1492 MaskTy->getElementType() != Type::getInt32Ty(V1->getContext()))
1497 /// getMaskValue - Return the index from the shuffle mask for the specified
1498 /// output result. This is either -1 if the element is undef or a number less
1499 /// than 2*numelements.
1500 int ShuffleVectorInst::getMaskValue(unsigned i) const {
1501 const Constant *Mask = cast<Constant>(getOperand(2));
1502 if (isa<UndefValue>(Mask)) return -1;
1503 if (isa<ConstantAggregateZero>(Mask)) return 0;
1504 const ConstantVector *MaskCV = cast<ConstantVector>(Mask);
1505 assert(i < MaskCV->getNumOperands() && "Index out of range");
1507 if (isa<UndefValue>(MaskCV->getOperand(i)))
1509 return cast<ConstantInt>(MaskCV->getOperand(i))->getZExtValue();
1512 //===----------------------------------------------------------------------===//
1513 // InsertValueInst Class
1514 //===----------------------------------------------------------------------===//
1516 void InsertValueInst::init(Value *Agg, Value *Val, const unsigned *Idx,
1517 unsigned NumIdx, const Twine &Name) {
1518 assert(NumOperands == 2 && "NumOperands not initialized?");
1522 Indices.insert(Indices.end(), Idx, Idx + NumIdx);
1526 void InsertValueInst::init(Value *Agg, Value *Val, unsigned Idx,
1527 const Twine &Name) {
1528 assert(NumOperands == 2 && "NumOperands not initialized?");
1532 Indices.push_back(Idx);
1536 InsertValueInst::InsertValueInst(const InsertValueInst &IVI)
1537 : Instruction(IVI.getType(), InsertValue,
1538 OperandTraits<InsertValueInst>::op_begin(this), 2),
1539 Indices(IVI.Indices) {
1540 Op<0>() = IVI.getOperand(0);
1541 Op<1>() = IVI.getOperand(1);
1542 SubclassOptionalData = IVI.SubclassOptionalData;
1545 InsertValueInst::InsertValueInst(Value *Agg,
1549 Instruction *InsertBefore)
1550 : Instruction(Agg->getType(), InsertValue,
1551 OperandTraits<InsertValueInst>::op_begin(this),
1553 init(Agg, Val, Idx, Name);
1556 InsertValueInst::InsertValueInst(Value *Agg,
1560 BasicBlock *InsertAtEnd)
1561 : Instruction(Agg->getType(), InsertValue,
1562 OperandTraits<InsertValueInst>::op_begin(this),
1564 init(Agg, Val, Idx, Name);
1567 //===----------------------------------------------------------------------===//
1568 // ExtractValueInst Class
1569 //===----------------------------------------------------------------------===//
1571 void ExtractValueInst::init(const unsigned *Idx, unsigned NumIdx,
1572 const Twine &Name) {
1573 assert(NumOperands == 1 && "NumOperands not initialized?");
1575 Indices.insert(Indices.end(), Idx, Idx + NumIdx);
1579 void ExtractValueInst::init(unsigned Idx, const Twine &Name) {
1580 assert(NumOperands == 1 && "NumOperands not initialized?");
1582 Indices.push_back(Idx);
1586 ExtractValueInst::ExtractValueInst(const ExtractValueInst &EVI)
1587 : UnaryInstruction(EVI.getType(), ExtractValue, EVI.getOperand(0)),
1588 Indices(EVI.Indices) {
1589 SubclassOptionalData = EVI.SubclassOptionalData;
1592 // getIndexedType - Returns the type of the element that would be extracted
1593 // with an extractvalue instruction with the specified parameters.
1595 // A null type is returned if the indices are invalid for the specified
1598 const Type* ExtractValueInst::getIndexedType(const Type *Agg,
1599 const unsigned *Idxs,
1601 unsigned CurIdx = 0;
1602 for (; CurIdx != NumIdx; ++CurIdx) {
1603 const CompositeType *CT = dyn_cast<CompositeType>(Agg);
1604 if (!CT || isa<PointerType>(CT) || isa<VectorType>(CT)) return 0;
1605 unsigned Index = Idxs[CurIdx];
1606 if (!CT->indexValid(Index)) return 0;
1607 Agg = CT->getTypeAtIndex(Index);
1609 // If the new type forwards to another type, then it is in the middle
1610 // of being refined to another type (and hence, may have dropped all
1611 // references to what it was using before). So, use the new forwarded
1613 if (const Type *Ty = Agg->getForwardedType())
1616 return CurIdx == NumIdx ? Agg : 0;
1619 const Type* ExtractValueInst::getIndexedType(const Type *Agg,
1621 return getIndexedType(Agg, &Idx, 1);
1624 //===----------------------------------------------------------------------===//
1625 // BinaryOperator Class
1626 //===----------------------------------------------------------------------===//
1628 /// AdjustIType - Map Add, Sub, and Mul to FAdd, FSub, and FMul when the
1629 /// type is floating-point, to help provide compatibility with an older API.
1631 static BinaryOperator::BinaryOps AdjustIType(BinaryOperator::BinaryOps iType,
1633 // API compatibility: Adjust integer opcodes to floating-point opcodes.
1634 if (Ty->isFPOrFPVector()) {
1635 if (iType == BinaryOperator::Add) iType = BinaryOperator::FAdd;
1636 else if (iType == BinaryOperator::Sub) iType = BinaryOperator::FSub;
1637 else if (iType == BinaryOperator::Mul) iType = BinaryOperator::FMul;
1642 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1643 const Type *Ty, const Twine &Name,
1644 Instruction *InsertBefore)
1645 : Instruction(Ty, AdjustIType(iType, Ty),
1646 OperandTraits<BinaryOperator>::op_begin(this),
1647 OperandTraits<BinaryOperator>::operands(this),
1651 init(AdjustIType(iType, Ty));
1655 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1656 const Type *Ty, const Twine &Name,
1657 BasicBlock *InsertAtEnd)
1658 : Instruction(Ty, AdjustIType(iType, Ty),
1659 OperandTraits<BinaryOperator>::op_begin(this),
1660 OperandTraits<BinaryOperator>::operands(this),
1664 init(AdjustIType(iType, Ty));
1669 void BinaryOperator::init(BinaryOps iType) {
1670 Value *LHS = getOperand(0), *RHS = getOperand(1);
1671 LHS = LHS; RHS = RHS; // Silence warnings.
1672 assert(LHS->getType() == RHS->getType() &&
1673 "Binary operator operand types must match!");
1678 assert(getType() == LHS->getType() &&
1679 "Arithmetic operation should return same type as operands!");
1680 assert(getType()->isIntOrIntVector() &&
1681 "Tried to create an integer operation on a non-integer type!");
1683 case FAdd: case FSub:
1685 assert(getType() == LHS->getType() &&
1686 "Arithmetic operation should return same type as operands!");
1687 assert(getType()->isFPOrFPVector() &&
1688 "Tried to create a floating-point operation on a "
1689 "non-floating-point type!");
1693 assert(getType() == LHS->getType() &&
1694 "Arithmetic operation should return same type as operands!");
1695 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1696 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1697 "Incorrect operand type (not integer) for S/UDIV");
1700 assert(getType() == LHS->getType() &&
1701 "Arithmetic operation should return same type as operands!");
1702 assert(getType()->isFPOrFPVector() &&
1703 "Incorrect operand type (not floating point) for FDIV");
1707 assert(getType() == LHS->getType() &&
1708 "Arithmetic operation should return same type as operands!");
1709 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1710 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1711 "Incorrect operand type (not integer) for S/UREM");
1714 assert(getType() == LHS->getType() &&
1715 "Arithmetic operation should return same type as operands!");
1716 assert(getType()->isFPOrFPVector() &&
1717 "Incorrect operand type (not floating point) for FREM");
1722 assert(getType() == LHS->getType() &&
1723 "Shift operation should return same type as operands!");
1724 assert((getType()->isInteger() ||
1725 (isa<VectorType>(getType()) &&
1726 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1727 "Tried to create a shift operation on a non-integral type!");
1731 assert(getType() == LHS->getType() &&
1732 "Logical operation should return same type as operands!");
1733 assert((getType()->isInteger() ||
1734 (isa<VectorType>(getType()) &&
1735 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1736 "Tried to create a logical operation on a non-integral type!");
1744 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1746 Instruction *InsertBefore) {
1747 assert(S1->getType() == S2->getType() &&
1748 "Cannot create binary operator with two operands of differing type!");
1749 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1752 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1754 BasicBlock *InsertAtEnd) {
1755 BinaryOperator *Res = Create(Op, S1, S2, Name);
1756 InsertAtEnd->getInstList().push_back(Res);
1760 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1761 Instruction *InsertBefore) {
1762 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1763 return new BinaryOperator(Instruction::Sub,
1765 Op->getType(), Name, InsertBefore);
1768 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
1769 BasicBlock *InsertAtEnd) {
1770 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1771 return new BinaryOperator(Instruction::Sub,
1773 Op->getType(), Name, InsertAtEnd);
1776 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1777 Instruction *InsertBefore) {
1778 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1779 return new BinaryOperator(Instruction::FSub,
1781 Op->getType(), Name, InsertBefore);
1784 BinaryOperator *BinaryOperator::CreateFNeg(Value *Op, const Twine &Name,
1785 BasicBlock *InsertAtEnd) {
1786 Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
1787 return new BinaryOperator(Instruction::FSub,
1789 Op->getType(), Name, InsertAtEnd);
1792 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1793 Instruction *InsertBefore) {
1795 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1796 C = Constant::getAllOnesValue(PTy->getElementType());
1797 C = ConstantVector::get(
1798 std::vector<Constant*>(PTy->getNumElements(), C));
1800 C = Constant::getAllOnesValue(Op->getType());
1803 return new BinaryOperator(Instruction::Xor, Op, C,
1804 Op->getType(), Name, InsertBefore);
1807 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
1808 BasicBlock *InsertAtEnd) {
1810 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1811 // Create a vector of all ones values.
1812 Constant *Elt = Constant::getAllOnesValue(PTy->getElementType());
1813 AllOnes = ConstantVector::get(
1814 std::vector<Constant*>(PTy->getNumElements(), Elt));
1816 AllOnes = Constant::getAllOnesValue(Op->getType());
1819 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1820 Op->getType(), Name, InsertAtEnd);
1824 // isConstantAllOnes - Helper function for several functions below
1825 static inline bool isConstantAllOnes(const Value *V) {
1826 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V))
1827 return CI->isAllOnesValue();
1828 if (const ConstantVector *CV = dyn_cast<ConstantVector>(V))
1829 return CV->isAllOnesValue();
1833 bool BinaryOperator::isNeg(const Value *V) {
1834 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1835 if (Bop->getOpcode() == Instruction::Sub)
1836 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0)))
1837 return C->isNegativeZeroValue();
1841 bool BinaryOperator::isFNeg(const Value *V) {
1842 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1843 if (Bop->getOpcode() == Instruction::FSub)
1844 if (Constant* C = dyn_cast<Constant>(Bop->getOperand(0)))
1845 return C->isNegativeZeroValue();
1849 bool BinaryOperator::isNot(const Value *V) {
1850 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1851 return (Bop->getOpcode() == Instruction::Xor &&
1852 (isConstantAllOnes(Bop->getOperand(1)) ||
1853 isConstantAllOnes(Bop->getOperand(0))));
1857 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1858 return cast<BinaryOperator>(BinOp)->getOperand(1);
1861 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1862 return getNegArgument(const_cast<Value*>(BinOp));
1865 Value *BinaryOperator::getFNegArgument(Value *BinOp) {
1866 return cast<BinaryOperator>(BinOp)->getOperand(1);
1869 const Value *BinaryOperator::getFNegArgument(const Value *BinOp) {
1870 return getFNegArgument(const_cast<Value*>(BinOp));
1873 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1874 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1875 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1876 Value *Op0 = BO->getOperand(0);
1877 Value *Op1 = BO->getOperand(1);
1878 if (isConstantAllOnes(Op0)) return Op1;
1880 assert(isConstantAllOnes(Op1));
1884 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1885 return getNotArgument(const_cast<Value*>(BinOp));
1889 // swapOperands - Exchange the two operands to this instruction. This
1890 // instruction is safe to use on any binary instruction and does not
1891 // modify the semantics of the instruction. If the instruction is
1892 // order dependent (SetLT f.e.) the opcode is changed.
1894 bool BinaryOperator::swapOperands() {
1895 if (!isCommutative())
1896 return true; // Can't commute operands
1897 Op<0>().swap(Op<1>());
1901 void BinaryOperator::setHasNoUnsignedWrap(bool b) {
1902 cast<OverflowingBinaryOperator>(this)->setHasNoUnsignedWrap(b);
1905 void BinaryOperator::setHasNoSignedWrap(bool b) {
1906 cast<OverflowingBinaryOperator>(this)->setHasNoSignedWrap(b);
1909 void BinaryOperator::setIsExact(bool b) {
1910 cast<SDivOperator>(this)->setIsExact(b);
1913 bool BinaryOperator::hasNoUnsignedWrap() const {
1914 return cast<OverflowingBinaryOperator>(this)->hasNoUnsignedWrap();
1917 bool BinaryOperator::hasNoSignedWrap() const {
1918 return cast<OverflowingBinaryOperator>(this)->hasNoSignedWrap();
1921 bool BinaryOperator::isExact() const {
1922 return cast<SDivOperator>(this)->isExact();
1925 //===----------------------------------------------------------------------===//
1927 //===----------------------------------------------------------------------===//
1929 // Just determine if this cast only deals with integral->integral conversion.
1930 bool CastInst::isIntegerCast() const {
1931 switch (getOpcode()) {
1932 default: return false;
1933 case Instruction::ZExt:
1934 case Instruction::SExt:
1935 case Instruction::Trunc:
1937 case Instruction::BitCast:
1938 return getOperand(0)->getType()->isInteger() && getType()->isInteger();
1942 bool CastInst::isLosslessCast() const {
1943 // Only BitCast can be lossless, exit fast if we're not BitCast
1944 if (getOpcode() != Instruction::BitCast)
1947 // Identity cast is always lossless
1948 const Type* SrcTy = getOperand(0)->getType();
1949 const Type* DstTy = getType();
1953 // Pointer to pointer is always lossless.
1954 if (isa<PointerType>(SrcTy))
1955 return isa<PointerType>(DstTy);
1956 return false; // Other types have no identity values
1959 /// This function determines if the CastInst does not require any bits to be
1960 /// changed in order to effect the cast. Essentially, it identifies cases where
1961 /// no code gen is necessary for the cast, hence the name no-op cast. For
1962 /// example, the following are all no-op casts:
1963 /// # bitcast i32* %x to i8*
1964 /// # bitcast <2 x i32> %x to <4 x i16>
1965 /// # ptrtoint i32* %x to i32 ; on 32-bit plaforms only
1966 /// @brief Determine if a cast is a no-op.
1967 bool CastInst::isNoopCast(const Type *IntPtrTy) const {
1968 switch (getOpcode()) {
1970 assert(!"Invalid CastOp");
1971 case Instruction::Trunc:
1972 case Instruction::ZExt:
1973 case Instruction::SExt:
1974 case Instruction::FPTrunc:
1975 case Instruction::FPExt:
1976 case Instruction::UIToFP:
1977 case Instruction::SIToFP:
1978 case Instruction::FPToUI:
1979 case Instruction::FPToSI:
1980 return false; // These always modify bits
1981 case Instruction::BitCast:
1982 return true; // BitCast never modifies bits.
1983 case Instruction::PtrToInt:
1984 return IntPtrTy->getScalarSizeInBits() ==
1985 getType()->getScalarSizeInBits();
1986 case Instruction::IntToPtr:
1987 return IntPtrTy->getScalarSizeInBits() ==
1988 getOperand(0)->getType()->getScalarSizeInBits();
1992 /// This function determines if a pair of casts can be eliminated and what
1993 /// opcode should be used in the elimination. This assumes that there are two
1994 /// instructions like this:
1995 /// * %F = firstOpcode SrcTy %x to MidTy
1996 /// * %S = secondOpcode MidTy %F to DstTy
1997 /// The function returns a resultOpcode so these two casts can be replaced with:
1998 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
1999 /// If no such cast is permited, the function returns 0.
2000 unsigned CastInst::isEliminableCastPair(
2001 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
2002 const Type *SrcTy, const Type *MidTy, const Type *DstTy, const Type *IntPtrTy)
2004 // Define the 144 possibilities for these two cast instructions. The values
2005 // in this matrix determine what to do in a given situation and select the
2006 // case in the switch below. The rows correspond to firstOp, the columns
2007 // correspond to secondOp. In looking at the table below, keep in mind
2008 // the following cast properties:
2010 // Size Compare Source Destination
2011 // Operator Src ? Size Type Sign Type Sign
2012 // -------- ------------ ------------------- ---------------------
2013 // TRUNC > Integer Any Integral Any
2014 // ZEXT < Integral Unsigned Integer Any
2015 // SEXT < Integral Signed Integer Any
2016 // FPTOUI n/a FloatPt n/a Integral Unsigned
2017 // FPTOSI n/a FloatPt n/a Integral Signed
2018 // UITOFP n/a Integral Unsigned FloatPt n/a
2019 // SITOFP n/a Integral Signed FloatPt n/a
2020 // FPTRUNC > FloatPt n/a FloatPt n/a
2021 // FPEXT < FloatPt n/a FloatPt n/a
2022 // PTRTOINT n/a Pointer n/a Integral Unsigned
2023 // INTTOPTR n/a Integral Unsigned Pointer n/a
2024 // BITCONVERT = FirstClass n/a FirstClass n/a
2026 // NOTE: some transforms are safe, but we consider them to be non-profitable.
2027 // For example, we could merge "fptoui double to i32" + "zext i32 to i64",
2028 // into "fptoui double to i64", but this loses information about the range
2029 // of the produced value (we no longer know the top-part is all zeros).
2030 // Further this conversion is often much more expensive for typical hardware,
2031 // and causes issues when building libgcc. We disallow fptosi+sext for the
2033 const unsigned numCastOps =
2034 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
2035 static const uint8_t CastResults[numCastOps][numCastOps] = {
2036 // T F F U S F F P I B -+
2037 // R Z S P P I I T P 2 N T |
2038 // U E E 2 2 2 2 R E I T C +- secondOp
2039 // N X X U S F F N X N 2 V |
2040 // C T T I I P P C T T P T -+
2041 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
2042 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
2043 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
2044 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
2045 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
2046 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
2047 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
2048 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
2049 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
2050 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
2051 { 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
2052 { 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
2055 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
2056 [secondOp-Instruction::CastOpsBegin];
2059 // categorically disallowed
2062 // allowed, use first cast's opcode
2065 // allowed, use second cast's opcode
2068 // no-op cast in second op implies firstOp as long as the DestTy
2070 if (DstTy->isInteger())
2074 // no-op cast in second op implies firstOp as long as the DestTy
2075 // is floating point
2076 if (DstTy->isFloatingPoint())
2080 // no-op cast in first op implies secondOp as long as the SrcTy
2082 if (SrcTy->isInteger())
2086 // no-op cast in first op implies secondOp as long as the SrcTy
2087 // is a floating point
2088 if (SrcTy->isFloatingPoint())
2092 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size
2095 unsigned PtrSize = IntPtrTy->getScalarSizeInBits();
2096 unsigned MidSize = MidTy->getScalarSizeInBits();
2097 if (MidSize >= PtrSize)
2098 return Instruction::BitCast;
2102 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
2103 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
2104 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
2105 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2106 unsigned DstSize = DstTy->getScalarSizeInBits();
2107 if (SrcSize == DstSize)
2108 return Instruction::BitCast;
2109 else if (SrcSize < DstSize)
2113 case 9: // zext, sext -> zext, because sext can't sign extend after zext
2114 return Instruction::ZExt;
2116 // fpext followed by ftrunc is allowed if the bit size returned to is
2117 // the same as the original, in which case its just a bitcast
2119 return Instruction::BitCast;
2120 return 0; // If the types are not the same we can't eliminate it.
2122 // bitcast followed by ptrtoint is allowed as long as the bitcast
2123 // is a pointer to pointer cast.
2124 if (isa<PointerType>(SrcTy) && isa<PointerType>(MidTy))
2128 // inttoptr, bitcast -> intptr if bitcast is a ptr to ptr cast
2129 if (isa<PointerType>(MidTy) && isa<PointerType>(DstTy))
2133 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
2136 unsigned PtrSize = IntPtrTy->getScalarSizeInBits();
2137 unsigned SrcSize = SrcTy->getScalarSizeInBits();
2138 unsigned DstSize = DstTy->getScalarSizeInBits();
2139 if (SrcSize <= PtrSize && SrcSize == DstSize)
2140 return Instruction::BitCast;
2144 // cast combination can't happen (error in input). This is for all cases
2145 // where the MidTy is not the same for the two cast instructions.
2146 assert(!"Invalid Cast Combination");
2149 assert(!"Error in CastResults table!!!");
2155 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, const Type *Ty,
2156 const Twine &Name, Instruction *InsertBefore) {
2157 // Construct and return the appropriate CastInst subclass
2159 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
2160 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
2161 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
2162 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
2163 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
2164 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
2165 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
2166 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
2167 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
2168 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
2169 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
2170 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
2172 assert(!"Invalid opcode provided");
2177 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, const Type *Ty,
2178 const Twine &Name, BasicBlock *InsertAtEnd) {
2179 // Construct and return the appropriate CastInst subclass
2181 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
2182 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
2183 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
2184 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
2185 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
2186 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
2187 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
2188 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
2189 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
2190 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
2191 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
2192 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
2194 assert(!"Invalid opcode provided");
2199 CastInst *CastInst::CreateZExtOrBitCast(Value *S, const Type *Ty,
2201 Instruction *InsertBefore) {
2202 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2203 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2204 return Create(Instruction::ZExt, S, Ty, Name, InsertBefore);
2207 CastInst *CastInst::CreateZExtOrBitCast(Value *S, const Type *Ty,
2209 BasicBlock *InsertAtEnd) {
2210 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2211 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2212 return Create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
2215 CastInst *CastInst::CreateSExtOrBitCast(Value *S, const Type *Ty,
2217 Instruction *InsertBefore) {
2218 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2219 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2220 return Create(Instruction::SExt, S, Ty, Name, InsertBefore);
2223 CastInst *CastInst::CreateSExtOrBitCast(Value *S, const Type *Ty,
2225 BasicBlock *InsertAtEnd) {
2226 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2227 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2228 return Create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
2231 CastInst *CastInst::CreateTruncOrBitCast(Value *S, const Type *Ty,
2233 Instruction *InsertBefore) {
2234 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2235 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2236 return Create(Instruction::Trunc, S, Ty, Name, InsertBefore);
2239 CastInst *CastInst::CreateTruncOrBitCast(Value *S, const Type *Ty,
2241 BasicBlock *InsertAtEnd) {
2242 if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
2243 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2244 return Create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
2247 CastInst *CastInst::CreatePointerCast(Value *S, const Type *Ty,
2249 BasicBlock *InsertAtEnd) {
2250 assert(isa<PointerType>(S->getType()) && "Invalid cast");
2251 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
2254 if (Ty->isInteger())
2255 return Create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
2256 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2259 /// @brief Create a BitCast or a PtrToInt cast instruction
2260 CastInst *CastInst::CreatePointerCast(Value *S, const Type *Ty,
2262 Instruction *InsertBefore) {
2263 assert(isa<PointerType>(S->getType()) && "Invalid cast");
2264 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
2267 if (Ty->isInteger())
2268 return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
2269 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2272 CastInst *CastInst::CreateIntegerCast(Value *C, const Type *Ty,
2273 bool isSigned, const Twine &Name,
2274 Instruction *InsertBefore) {
2275 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
2276 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2277 unsigned DstBits = Ty->getScalarSizeInBits();
2278 Instruction::CastOps opcode =
2279 (SrcBits == DstBits ? Instruction::BitCast :
2280 (SrcBits > DstBits ? Instruction::Trunc :
2281 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2282 return Create(opcode, C, Ty, Name, InsertBefore);
2285 CastInst *CastInst::CreateIntegerCast(Value *C, const Type *Ty,
2286 bool isSigned, const Twine &Name,
2287 BasicBlock *InsertAtEnd) {
2288 assert(C->getType()->isIntOrIntVector() && Ty->isIntOrIntVector() &&
2290 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2291 unsigned DstBits = Ty->getScalarSizeInBits();
2292 Instruction::CastOps opcode =
2293 (SrcBits == DstBits ? Instruction::BitCast :
2294 (SrcBits > DstBits ? Instruction::Trunc :
2295 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2296 return Create(opcode, C, Ty, Name, InsertAtEnd);
2299 CastInst *CastInst::CreateFPCast(Value *C, const Type *Ty,
2301 Instruction *InsertBefore) {
2302 assert(C->getType()->isFPOrFPVector() && Ty->isFPOrFPVector() &&
2304 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2305 unsigned DstBits = Ty->getScalarSizeInBits();
2306 Instruction::CastOps opcode =
2307 (SrcBits == DstBits ? Instruction::BitCast :
2308 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2309 return Create(opcode, C, Ty, Name, InsertBefore);
2312 CastInst *CastInst::CreateFPCast(Value *C, const Type *Ty,
2314 BasicBlock *InsertAtEnd) {
2315 assert(C->getType()->isFPOrFPVector() && Ty->isFPOrFPVector() &&
2317 unsigned SrcBits = C->getType()->getScalarSizeInBits();
2318 unsigned DstBits = Ty->getScalarSizeInBits();
2319 Instruction::CastOps opcode =
2320 (SrcBits == DstBits ? Instruction::BitCast :
2321 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2322 return Create(opcode, C, Ty, Name, InsertAtEnd);
2325 // Check whether it is valid to call getCastOpcode for these types.
2326 // This routine must be kept in sync with getCastOpcode.
2327 bool CastInst::isCastable(const Type *SrcTy, const Type *DestTy) {
2328 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2331 if (SrcTy == DestTy)
2334 // Get the bit sizes, we'll need these
2335 unsigned SrcBits = SrcTy->getScalarSizeInBits(); // 0 for ptr
2336 unsigned DestBits = DestTy->getScalarSizeInBits(); // 0 for ptr
2338 // Run through the possibilities ...
2339 if (DestTy->isInteger()) { // Casting to integral
2340 if (SrcTy->isInteger()) { // Casting from integral
2342 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2344 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2345 // Casting from vector
2346 return DestBits == PTy->getBitWidth();
2347 } else { // Casting from something else
2348 return isa<PointerType>(SrcTy);
2350 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2351 if (SrcTy->isInteger()) { // Casting from integral
2353 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2355 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2356 // Casting from vector
2357 return DestBits == PTy->getBitWidth();
2358 } else { // Casting from something else
2361 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2362 // Casting to vector
2363 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2364 // Casting from vector
2365 return DestPTy->getBitWidth() == SrcPTy->getBitWidth();
2366 } else { // Casting from something else
2367 return DestPTy->getBitWidth() == SrcBits;
2369 } else if (isa<PointerType>(DestTy)) { // Casting to pointer
2370 if (isa<PointerType>(SrcTy)) { // Casting from pointer
2372 } else if (SrcTy->isInteger()) { // Casting from integral
2374 } else { // Casting from something else
2377 } else { // Casting to something else
2382 // Provide a way to get a "cast" where the cast opcode is inferred from the
2383 // types and size of the operand. This, basically, is a parallel of the
2384 // logic in the castIsValid function below. This axiom should hold:
2385 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
2386 // should not assert in castIsValid. In other words, this produces a "correct"
2387 // casting opcode for the arguments passed to it.
2388 // This routine must be kept in sync with isCastable.
2389 Instruction::CastOps
2390 CastInst::getCastOpcode(
2391 const Value *Src, bool SrcIsSigned, const Type *DestTy, bool DestIsSigned) {
2392 // Get the bit sizes, we'll need these
2393 const Type *SrcTy = Src->getType();
2394 unsigned SrcBits = SrcTy->getScalarSizeInBits(); // 0 for ptr
2395 unsigned DestBits = DestTy->getScalarSizeInBits(); // 0 for ptr
2397 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2398 "Only first class types are castable!");
2400 // Run through the possibilities ...
2401 if (DestTy->isInteger()) { // Casting to integral
2402 if (SrcTy->isInteger()) { // Casting from integral
2403 if (DestBits < SrcBits)
2404 return Trunc; // int -> smaller int
2405 else if (DestBits > SrcBits) { // its an extension
2407 return SExt; // signed -> SEXT
2409 return ZExt; // unsigned -> ZEXT
2411 return BitCast; // Same size, No-op cast
2413 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2415 return FPToSI; // FP -> sint
2417 return FPToUI; // FP -> uint
2418 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2419 assert(DestBits == PTy->getBitWidth() &&
2420 "Casting vector to integer of different width");
2422 return BitCast; // Same size, no-op cast
2424 assert(isa<PointerType>(SrcTy) &&
2425 "Casting from a value that is not first-class type");
2426 return PtrToInt; // ptr -> int
2428 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2429 if (SrcTy->isInteger()) { // Casting from integral
2431 return SIToFP; // sint -> FP
2433 return UIToFP; // uint -> FP
2434 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2435 if (DestBits < SrcBits) {
2436 return FPTrunc; // FP -> smaller FP
2437 } else if (DestBits > SrcBits) {
2438 return FPExt; // FP -> larger FP
2440 return BitCast; // same size, no-op cast
2442 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2443 assert(DestBits == PTy->getBitWidth() &&
2444 "Casting vector to floating point of different width");
2446 return BitCast; // same size, no-op cast
2448 llvm_unreachable("Casting pointer or non-first class to float");
2450 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2451 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2452 assert(DestPTy->getBitWidth() == SrcPTy->getBitWidth() &&
2453 "Casting vector to vector of different widths");
2455 return BitCast; // vector -> vector
2456 } else if (DestPTy->getBitWidth() == SrcBits) {
2457 return BitCast; // float/int -> vector
2459 assert(!"Illegal cast to vector (wrong type or size)");
2461 } else if (isa<PointerType>(DestTy)) {
2462 if (isa<PointerType>(SrcTy)) {
2463 return BitCast; // ptr -> ptr
2464 } else if (SrcTy->isInteger()) {
2465 return IntToPtr; // int -> ptr
2467 assert(!"Casting pointer to other than pointer or int");
2470 assert(!"Casting to type that is not first-class");
2473 // If we fall through to here we probably hit an assertion cast above
2474 // and assertions are not turned on. Anything we return is an error, so
2475 // BitCast is as good a choice as any.
2479 //===----------------------------------------------------------------------===//
2480 // CastInst SubClass Constructors
2481 //===----------------------------------------------------------------------===//
2483 /// Check that the construction parameters for a CastInst are correct. This
2484 /// could be broken out into the separate constructors but it is useful to have
2485 /// it in one place and to eliminate the redundant code for getting the sizes
2486 /// of the types involved.
2488 CastInst::castIsValid(Instruction::CastOps op, Value *S, const Type *DstTy) {
2490 // Check for type sanity on the arguments
2491 const Type *SrcTy = S->getType();
2492 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType())
2495 // Get the size of the types in bits, we'll need this later
2496 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2497 unsigned DstBitSize = DstTy->getScalarSizeInBits();
2499 // Switch on the opcode provided
2501 default: return false; // This is an input error
2502 case Instruction::Trunc:
2503 return SrcTy->isIntOrIntVector() &&
2504 DstTy->isIntOrIntVector()&& SrcBitSize > DstBitSize;
2505 case Instruction::ZExt:
2506 return SrcTy->isIntOrIntVector() &&
2507 DstTy->isIntOrIntVector()&& SrcBitSize < DstBitSize;
2508 case Instruction::SExt:
2509 return SrcTy->isIntOrIntVector() &&
2510 DstTy->isIntOrIntVector()&& SrcBitSize < DstBitSize;
2511 case Instruction::FPTrunc:
2512 return SrcTy->isFPOrFPVector() &&
2513 DstTy->isFPOrFPVector() &&
2514 SrcBitSize > DstBitSize;
2515 case Instruction::FPExt:
2516 return SrcTy->isFPOrFPVector() &&
2517 DstTy->isFPOrFPVector() &&
2518 SrcBitSize < DstBitSize;
2519 case Instruction::UIToFP:
2520 case Instruction::SIToFP:
2521 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2522 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2523 return SVTy->getElementType()->isIntOrIntVector() &&
2524 DVTy->getElementType()->isFPOrFPVector() &&
2525 SVTy->getNumElements() == DVTy->getNumElements();
2528 return SrcTy->isIntOrIntVector() && DstTy->isFPOrFPVector();
2529 case Instruction::FPToUI:
2530 case Instruction::FPToSI:
2531 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2532 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2533 return SVTy->getElementType()->isFPOrFPVector() &&
2534 DVTy->getElementType()->isIntOrIntVector() &&
2535 SVTy->getNumElements() == DVTy->getNumElements();
2538 return SrcTy->isFPOrFPVector() && DstTy->isIntOrIntVector();
2539 case Instruction::PtrToInt:
2540 return isa<PointerType>(SrcTy) && DstTy->isInteger();
2541 case Instruction::IntToPtr:
2542 return SrcTy->isInteger() && isa<PointerType>(DstTy);
2543 case Instruction::BitCast:
2544 // BitCast implies a no-op cast of type only. No bits change.
2545 // However, you can't cast pointers to anything but pointers.
2546 if (isa<PointerType>(SrcTy) != isa<PointerType>(DstTy))
2549 // Now we know we're not dealing with a pointer/non-pointer mismatch. In all
2550 // these cases, the cast is okay if the source and destination bit widths
2552 return SrcTy->getPrimitiveSizeInBits() == DstTy->getPrimitiveSizeInBits();
2556 TruncInst::TruncInst(
2557 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2558 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2559 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2562 TruncInst::TruncInst(
2563 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2564 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2565 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2569 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2570 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2571 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2575 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2576 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2577 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2580 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2581 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2582 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2586 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2587 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2588 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2591 FPTruncInst::FPTruncInst(
2592 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2593 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2594 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2597 FPTruncInst::FPTruncInst(
2598 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2599 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2600 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2603 FPExtInst::FPExtInst(
2604 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2605 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2606 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2609 FPExtInst::FPExtInst(
2610 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2611 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2612 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2615 UIToFPInst::UIToFPInst(
2616 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2617 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2618 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2621 UIToFPInst::UIToFPInst(
2622 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2623 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2624 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2627 SIToFPInst::SIToFPInst(
2628 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2629 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2630 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2633 SIToFPInst::SIToFPInst(
2634 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2635 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2636 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2639 FPToUIInst::FPToUIInst(
2640 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2641 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2642 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2645 FPToUIInst::FPToUIInst(
2646 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2647 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2648 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2651 FPToSIInst::FPToSIInst(
2652 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2653 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2654 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2657 FPToSIInst::FPToSIInst(
2658 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2659 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2660 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2663 PtrToIntInst::PtrToIntInst(
2664 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2665 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2666 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2669 PtrToIntInst::PtrToIntInst(
2670 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2671 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2672 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2675 IntToPtrInst::IntToPtrInst(
2676 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2677 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2678 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2681 IntToPtrInst::IntToPtrInst(
2682 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2683 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2684 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2687 BitCastInst::BitCastInst(
2688 Value *S, const Type *Ty, const Twine &Name, Instruction *InsertBefore
2689 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2690 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2693 BitCastInst::BitCastInst(
2694 Value *S, const Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
2695 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2696 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2699 //===----------------------------------------------------------------------===//
2701 //===----------------------------------------------------------------------===//
2703 CmpInst::CmpInst(const Type *ty, OtherOps op, unsigned short predicate,
2704 Value *LHS, Value *RHS, const Twine &Name,
2705 Instruction *InsertBefore)
2706 : Instruction(ty, op,
2707 OperandTraits<CmpInst>::op_begin(this),
2708 OperandTraits<CmpInst>::operands(this),
2712 SubclassData = predicate;
2716 CmpInst::CmpInst(const Type *ty, OtherOps op, unsigned short predicate,
2717 Value *LHS, Value *RHS, const Twine &Name,
2718 BasicBlock *InsertAtEnd)
2719 : Instruction(ty, op,
2720 OperandTraits<CmpInst>::op_begin(this),
2721 OperandTraits<CmpInst>::operands(this),
2725 SubclassData = predicate;
2730 CmpInst::Create(OtherOps Op, unsigned short predicate,
2731 Value *S1, Value *S2,
2732 const Twine &Name, Instruction *InsertBefore) {
2733 if (Op == Instruction::ICmp) {
2735 return new ICmpInst(InsertBefore, CmpInst::Predicate(predicate),
2738 return new ICmpInst(CmpInst::Predicate(predicate),
2743 return new FCmpInst(InsertBefore, CmpInst::Predicate(predicate),
2746 return new FCmpInst(CmpInst::Predicate(predicate),
2751 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2752 const Twine &Name, BasicBlock *InsertAtEnd) {
2753 if (Op == Instruction::ICmp) {
2754 return new ICmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
2757 return new FCmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
2761 void CmpInst::swapOperands() {
2762 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2765 cast<FCmpInst>(this)->swapOperands();
2768 bool CmpInst::isCommutative() {
2769 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2770 return IC->isCommutative();
2771 return cast<FCmpInst>(this)->isCommutative();
2774 bool CmpInst::isEquality() {
2775 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2776 return IC->isEquality();
2777 return cast<FCmpInst>(this)->isEquality();
2781 CmpInst::Predicate CmpInst::getInversePredicate(Predicate pred) {
2783 default: assert(!"Unknown cmp predicate!");
2784 case ICMP_EQ: return ICMP_NE;
2785 case ICMP_NE: return ICMP_EQ;
2786 case ICMP_UGT: return ICMP_ULE;
2787 case ICMP_ULT: return ICMP_UGE;
2788 case ICMP_UGE: return ICMP_ULT;
2789 case ICMP_ULE: return ICMP_UGT;
2790 case ICMP_SGT: return ICMP_SLE;
2791 case ICMP_SLT: return ICMP_SGE;
2792 case ICMP_SGE: return ICMP_SLT;
2793 case ICMP_SLE: return ICMP_SGT;
2795 case FCMP_OEQ: return FCMP_UNE;
2796 case FCMP_ONE: return FCMP_UEQ;
2797 case FCMP_OGT: return FCMP_ULE;
2798 case FCMP_OLT: return FCMP_UGE;
2799 case FCMP_OGE: return FCMP_ULT;
2800 case FCMP_OLE: return FCMP_UGT;
2801 case FCMP_UEQ: return FCMP_ONE;
2802 case FCMP_UNE: return FCMP_OEQ;
2803 case FCMP_UGT: return FCMP_OLE;
2804 case FCMP_ULT: return FCMP_OGE;
2805 case FCMP_UGE: return FCMP_OLT;
2806 case FCMP_ULE: return FCMP_OGT;
2807 case FCMP_ORD: return FCMP_UNO;
2808 case FCMP_UNO: return FCMP_ORD;
2809 case FCMP_TRUE: return FCMP_FALSE;
2810 case FCMP_FALSE: return FCMP_TRUE;
2814 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
2816 default: assert(! "Unknown icmp predicate!");
2817 case ICMP_EQ: case ICMP_NE:
2818 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2820 case ICMP_UGT: return ICMP_SGT;
2821 case ICMP_ULT: return ICMP_SLT;
2822 case ICMP_UGE: return ICMP_SGE;
2823 case ICMP_ULE: return ICMP_SLE;
2827 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
2829 default: assert(! "Unknown icmp predicate!");
2830 case ICMP_EQ: case ICMP_NE:
2831 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
2833 case ICMP_SGT: return ICMP_UGT;
2834 case ICMP_SLT: return ICMP_ULT;
2835 case ICMP_SGE: return ICMP_UGE;
2836 case ICMP_SLE: return ICMP_ULE;
2840 /// Initialize a set of values that all satisfy the condition with C.
2843 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
2846 uint32_t BitWidth = C.getBitWidth();
2848 default: llvm_unreachable("Invalid ICmp opcode to ConstantRange ctor!");
2849 case ICmpInst::ICMP_EQ: Upper++; break;
2850 case ICmpInst::ICMP_NE: Lower++; break;
2851 case ICmpInst::ICMP_ULT: Lower = APInt::getMinValue(BitWidth); break;
2852 case ICmpInst::ICMP_SLT: Lower = APInt::getSignedMinValue(BitWidth); break;
2853 case ICmpInst::ICMP_UGT:
2854 Lower++; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2856 case ICmpInst::ICMP_SGT:
2857 Lower++; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2859 case ICmpInst::ICMP_ULE:
2860 Lower = APInt::getMinValue(BitWidth); Upper++;
2862 case ICmpInst::ICMP_SLE:
2863 Lower = APInt::getSignedMinValue(BitWidth); Upper++;
2865 case ICmpInst::ICMP_UGE:
2866 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2868 case ICmpInst::ICMP_SGE:
2869 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2872 return ConstantRange(Lower, Upper);
2875 CmpInst::Predicate CmpInst::getSwappedPredicate(Predicate pred) {
2877 default: assert(!"Unknown cmp predicate!");
2878 case ICMP_EQ: case ICMP_NE:
2880 case ICMP_SGT: return ICMP_SLT;
2881 case ICMP_SLT: return ICMP_SGT;
2882 case ICMP_SGE: return ICMP_SLE;
2883 case ICMP_SLE: return ICMP_SGE;
2884 case ICMP_UGT: return ICMP_ULT;
2885 case ICMP_ULT: return ICMP_UGT;
2886 case ICMP_UGE: return ICMP_ULE;
2887 case ICMP_ULE: return ICMP_UGE;
2889 case FCMP_FALSE: case FCMP_TRUE:
2890 case FCMP_OEQ: case FCMP_ONE:
2891 case FCMP_UEQ: case FCMP_UNE:
2892 case FCMP_ORD: case FCMP_UNO:
2894 case FCMP_OGT: return FCMP_OLT;
2895 case FCMP_OLT: return FCMP_OGT;
2896 case FCMP_OGE: return FCMP_OLE;
2897 case FCMP_OLE: return FCMP_OGE;
2898 case FCMP_UGT: return FCMP_ULT;
2899 case FCMP_ULT: return FCMP_UGT;
2900 case FCMP_UGE: return FCMP_ULE;
2901 case FCMP_ULE: return FCMP_UGE;
2905 bool CmpInst::isUnsigned(unsigned short predicate) {
2906 switch (predicate) {
2907 default: return false;
2908 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
2909 case ICmpInst::ICMP_UGE: return true;
2913 bool CmpInst::isSigned(unsigned short predicate) {
2914 switch (predicate) {
2915 default: return false;
2916 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
2917 case ICmpInst::ICMP_SGE: return true;
2921 bool CmpInst::isOrdered(unsigned short predicate) {
2922 switch (predicate) {
2923 default: return false;
2924 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
2925 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
2926 case FCmpInst::FCMP_ORD: return true;
2930 bool CmpInst::isUnordered(unsigned short predicate) {
2931 switch (predicate) {
2932 default: return false;
2933 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
2934 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
2935 case FCmpInst::FCMP_UNO: return true;
2939 bool CmpInst::isTrueWhenEqual(unsigned short predicate) {
2941 default: return false;
2942 case ICMP_EQ: case ICMP_UGE: case ICMP_ULE: case ICMP_SGE: case ICMP_SLE:
2943 case FCMP_TRUE: case FCMP_UEQ: case FCMP_UGE: case FCMP_ULE: return true;
2947 bool CmpInst::isFalseWhenEqual(unsigned short predicate) {
2949 case ICMP_NE: case ICMP_UGT: case ICMP_ULT: case ICMP_SGT: case ICMP_SLT:
2950 case FCMP_FALSE: case FCMP_ONE: case FCMP_OGT: case FCMP_OLT: return true;
2951 default: return false;
2956 //===----------------------------------------------------------------------===//
2957 // SwitchInst Implementation
2958 //===----------------------------------------------------------------------===//
2960 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumCases) {
2961 assert(Value && Default);
2962 ReservedSpace = 2+NumCases*2;
2964 OperandList = allocHungoffUses(ReservedSpace);
2966 OperandList[0] = Value;
2967 OperandList[1] = Default;
2970 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2971 /// switch on and a default destination. The number of additional cases can
2972 /// be specified here to make memory allocation more efficient. This
2973 /// constructor can also autoinsert before another instruction.
2974 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2975 Instruction *InsertBefore)
2976 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
2977 0, 0, InsertBefore) {
2978 init(Value, Default, NumCases);
2981 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2982 /// switch on and a default destination. The number of additional cases can
2983 /// be specified here to make memory allocation more efficient. This
2984 /// constructor also autoinserts at the end of the specified BasicBlock.
2985 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2986 BasicBlock *InsertAtEnd)
2987 : TerminatorInst(Type::getVoidTy(Value->getContext()), Instruction::Switch,
2988 0, 0, InsertAtEnd) {
2989 init(Value, Default, NumCases);
2992 SwitchInst::SwitchInst(const SwitchInst &SI)
2993 : TerminatorInst(Type::getVoidTy(SI.getContext()), Instruction::Switch,
2994 allocHungoffUses(SI.getNumOperands()), SI.getNumOperands()) {
2995 Use *OL = OperandList, *InOL = SI.OperandList;
2996 for (unsigned i = 0, E = SI.getNumOperands(); i != E; i+=2) {
2998 OL[i+1] = InOL[i+1];
3000 SubclassOptionalData = SI.SubclassOptionalData;
3003 SwitchInst::~SwitchInst() {
3004 dropHungoffUses(OperandList);
3008 /// addCase - Add an entry to the switch instruction...
3010 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
3011 unsigned OpNo = NumOperands;
3012 if (OpNo+2 > ReservedSpace)
3013 resizeOperands(0); // Get more space!
3014 // Initialize some new operands.
3015 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
3016 NumOperands = OpNo+2;
3017 OperandList[OpNo] = OnVal;
3018 OperandList[OpNo+1] = Dest;
3021 /// removeCase - This method removes the specified successor from the switch
3022 /// instruction. Note that this cannot be used to remove the default
3023 /// destination (successor #0).
3025 void SwitchInst::removeCase(unsigned idx) {
3026 assert(idx != 0 && "Cannot remove the default case!");
3027 assert(idx*2 < getNumOperands() && "Successor index out of range!!!");
3029 unsigned NumOps = getNumOperands();
3030 Use *OL = OperandList;
3032 // Move everything after this operand down.
3034 // FIXME: we could just swap with the end of the list, then erase. However,
3035 // client might not expect this to happen. The code as it is thrashes the
3036 // use/def lists, which is kinda lame.
3037 for (unsigned i = (idx+1)*2; i != NumOps; i += 2) {
3039 OL[i-2+1] = OL[i+1];
3042 // Nuke the last value.
3043 OL[NumOps-2].set(0);
3044 OL[NumOps-2+1].set(0);
3045 NumOperands = NumOps-2;
3048 /// resizeOperands - resize operands - This adjusts the length of the operands
3049 /// list according to the following behavior:
3050 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
3051 /// of operation. This grows the number of ops by 3 times.
3052 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
3053 /// 3. If NumOps == NumOperands, trim the reserved space.
3055 void SwitchInst::resizeOperands(unsigned NumOps) {
3056 unsigned e = getNumOperands();
3059 } else if (NumOps*2 > NumOperands) {
3060 // No resize needed.
3061 if (ReservedSpace >= NumOps) return;
3062 } else if (NumOps == NumOperands) {
3063 if (ReservedSpace == NumOps) return;
3068 ReservedSpace = NumOps;
3069 Use *NewOps = allocHungoffUses(NumOps);
3070 Use *OldOps = OperandList;
3071 for (unsigned i = 0; i != e; ++i) {
3072 NewOps[i] = OldOps[i];
3074 OperandList = NewOps;
3075 if (OldOps) Use::zap(OldOps, OldOps + e, true);
3079 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
3080 return getSuccessor(idx);
3082 unsigned SwitchInst::getNumSuccessorsV() const {
3083 return getNumSuccessors();
3085 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3086 setSuccessor(idx, B);
3089 //===----------------------------------------------------------------------===//
3090 // SwitchInst Implementation
3091 //===----------------------------------------------------------------------===//
3093 void IndirectBrInst::init(Value *Address, unsigned NumDests) {
3094 assert(Address && isa<PointerType>(Address->getType()) &&
3095 "Address of indirectbr must be a pointer");
3096 ReservedSpace = 1+NumDests;
3098 OperandList = allocHungoffUses(ReservedSpace);
3100 OperandList[0] = Address;
3104 /// resizeOperands - resize operands - This adjusts the length of the operands
3105 /// list according to the following behavior:
3106 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
3107 /// of operation. This grows the number of ops by 2 times.
3108 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
3109 /// 3. If NumOps == NumOperands, trim the reserved space.
3111 void IndirectBrInst::resizeOperands(unsigned NumOps) {
3112 unsigned e = getNumOperands();
3115 } else if (NumOps*2 > NumOperands) {
3116 // No resize needed.
3117 if (ReservedSpace >= NumOps) return;
3118 } else if (NumOps == NumOperands) {
3119 if (ReservedSpace == NumOps) return;
3124 ReservedSpace = NumOps;
3125 Use *NewOps = allocHungoffUses(NumOps);
3126 Use *OldOps = OperandList;
3127 for (unsigned i = 0; i != e; ++i)
3128 NewOps[i] = OldOps[i];
3129 OperandList = NewOps;
3130 if (OldOps) Use::zap(OldOps, OldOps + e, true);
3133 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3134 Instruction *InsertBefore)
3135 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3136 0, 0, InsertBefore) {
3137 init(Address, NumCases);
3140 IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
3141 BasicBlock *InsertAtEnd)
3142 : TerminatorInst(Type::getVoidTy(Address->getContext()),Instruction::IndirectBr,
3143 0, 0, InsertAtEnd) {
3144 init(Address, NumCases);
3147 IndirectBrInst::IndirectBrInst(const IndirectBrInst &IBI)
3148 : TerminatorInst(Type::getVoidTy(IBI.getContext()), Instruction::IndirectBr,
3149 allocHungoffUses(IBI.getNumOperands()),
3150 IBI.getNumOperands()) {
3151 Use *OL = OperandList, *InOL = IBI.OperandList;
3152 for (unsigned i = 0, E = IBI.getNumOperands(); i != E; ++i)
3154 SubclassOptionalData = IBI.SubclassOptionalData;
3157 IndirectBrInst::~IndirectBrInst() {
3158 dropHungoffUses(OperandList);
3161 /// addDestination - Add a destination.
3163 void IndirectBrInst::addDestination(BasicBlock *DestBB) {
3164 unsigned OpNo = NumOperands;
3165 if (OpNo+1 > ReservedSpace)
3166 resizeOperands(0); // Get more space!
3167 // Initialize some new operands.
3168 assert(OpNo < ReservedSpace && "Growing didn't work!");
3169 NumOperands = OpNo+1;
3170 OperandList[OpNo] = DestBB;
3173 /// removeDestination - This method removes the specified successor from the
3174 /// indirectbr instruction.
3175 void IndirectBrInst::removeDestination(unsigned idx) {
3176 assert(idx < getNumOperands()-1 && "Successor index out of range!");
3178 unsigned NumOps = getNumOperands();
3179 Use *OL = OperandList;
3181 // Replace this value with the last one.
3182 OL[idx+1] = OL[NumOps-1];
3184 // Nuke the last value.
3185 OL[NumOps-1].set(0);
3186 NumOperands = NumOps-1;
3189 BasicBlock *IndirectBrInst::getSuccessorV(unsigned idx) const {
3190 return getSuccessor(idx);
3192 unsigned IndirectBrInst::getNumSuccessorsV() const {
3193 return getNumSuccessors();
3195 void IndirectBrInst::setSuccessorV(unsigned idx, BasicBlock *B) {
3196 setSuccessor(idx, B);
3199 //===----------------------------------------------------------------------===//
3200 // clone_impl() implementations
3201 //===----------------------------------------------------------------------===//
3203 // Define these methods here so vtables don't get emitted into every translation
3204 // unit that uses these classes.
3206 GetElementPtrInst *GetElementPtrInst::clone_impl() const {
3207 return new (getNumOperands()) GetElementPtrInst(*this);
3210 BinaryOperator *BinaryOperator::clone_impl() const {
3211 return Create(getOpcode(), Op<0>(), Op<1>());
3214 FCmpInst* FCmpInst::clone_impl() const {
3215 return new FCmpInst(getPredicate(), Op<0>(), Op<1>());
3218 ICmpInst* ICmpInst::clone_impl() const {
3219 return new ICmpInst(getPredicate(), Op<0>(), Op<1>());
3222 ExtractValueInst *ExtractValueInst::clone_impl() const {
3223 return new ExtractValueInst(*this);
3226 InsertValueInst *InsertValueInst::clone_impl() const {
3227 return new InsertValueInst(*this);
3230 AllocaInst *AllocaInst::clone_impl() const {
3231 return new AllocaInst(getAllocatedType(),
3232 (Value*)getOperand(0),
3236 LoadInst *LoadInst::clone_impl() const {
3237 return new LoadInst(getOperand(0),
3238 Twine(), isVolatile(),
3242 StoreInst *StoreInst::clone_impl() const {
3243 return new StoreInst(getOperand(0), getOperand(1),
3244 isVolatile(), getAlignment());
3247 TruncInst *TruncInst::clone_impl() const {
3248 return new TruncInst(getOperand(0), getType());
3251 ZExtInst *ZExtInst::clone_impl() const {
3252 return new ZExtInst(getOperand(0), getType());
3255 SExtInst *SExtInst::clone_impl() const {
3256 return new SExtInst(getOperand(0), getType());
3259 FPTruncInst *FPTruncInst::clone_impl() const {
3260 return new FPTruncInst(getOperand(0), getType());
3263 FPExtInst *FPExtInst::clone_impl() const {
3264 return new FPExtInst(getOperand(0), getType());
3267 UIToFPInst *UIToFPInst::clone_impl() const {
3268 return new UIToFPInst(getOperand(0), getType());
3271 SIToFPInst *SIToFPInst::clone_impl() const {
3272 return new SIToFPInst(getOperand(0), getType());
3275 FPToUIInst *FPToUIInst::clone_impl() const {
3276 return new FPToUIInst(getOperand(0), getType());
3279 FPToSIInst *FPToSIInst::clone_impl() const {
3280 return new FPToSIInst(getOperand(0), getType());
3283 PtrToIntInst *PtrToIntInst::clone_impl() const {
3284 return new PtrToIntInst(getOperand(0), getType());
3287 IntToPtrInst *IntToPtrInst::clone_impl() const {
3288 return new IntToPtrInst(getOperand(0), getType());
3291 BitCastInst *BitCastInst::clone_impl() const {
3292 return new BitCastInst(getOperand(0), getType());
3295 CallInst *CallInst::clone_impl() const {
3296 return new(getNumOperands()) CallInst(*this);
3299 SelectInst *SelectInst::clone_impl() const {
3300 return SelectInst::Create(getOperand(0), getOperand(1), getOperand(2));
3303 VAArgInst *VAArgInst::clone_impl() const {
3304 return new VAArgInst(getOperand(0), getType());
3307 ExtractElementInst *ExtractElementInst::clone_impl() const {
3308 return ExtractElementInst::Create(getOperand(0), getOperand(1));
3311 InsertElementInst *InsertElementInst::clone_impl() const {
3312 return InsertElementInst::Create(getOperand(0),
3317 ShuffleVectorInst *ShuffleVectorInst::clone_impl() const {
3318 return new ShuffleVectorInst(getOperand(0),
3323 PHINode *PHINode::clone_impl() const {
3324 return new PHINode(*this);
3327 ReturnInst *ReturnInst::clone_impl() const {
3328 return new(getNumOperands()) ReturnInst(*this);
3331 BranchInst *BranchInst::clone_impl() const {
3332 unsigned Ops(getNumOperands());
3333 return new(Ops, Ops == 1) BranchInst(*this);
3336 SwitchInst *SwitchInst::clone_impl() const {
3337 return new SwitchInst(*this);
3340 IndirectBrInst *IndirectBrInst::clone_impl() const {
3341 return new IndirectBrInst(*this);
3345 InvokeInst *InvokeInst::clone_impl() const {
3346 return new(getNumOperands()) InvokeInst(*this);
3349 UnwindInst *UnwindInst::clone_impl() const {
3350 LLVMContext &Context = getContext();
3351 return new UnwindInst(Context);
3354 UnreachableInst *UnreachableInst::clone_impl() const {
3355 LLVMContext &Context = getContext();
3356 return new UnreachableInst(Context);