1 //===-- Instructions.cpp - Implement the LLVM instructions ----------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements all of the non-inline methods for the LLVM instruction
13 //===----------------------------------------------------------------------===//
15 #include "llvm/Constants.h"
16 #include "llvm/DerivedTypes.h"
17 #include "llvm/Function.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/Support/CallSite.h"
20 #include "llvm/Support/ConstantRange.h"
21 #include "llvm/Support/MathExtras.h"
24 //===----------------------------------------------------------------------===//
26 //===----------------------------------------------------------------------===//
28 CallSite::CallSite(Instruction *C) {
29 assert((isa<CallInst>(C) || isa<InvokeInst>(C)) && "Not a call!");
32 unsigned CallSite::getCallingConv() const {
33 if (CallInst *CI = dyn_cast<CallInst>(I))
34 return CI->getCallingConv();
36 return cast<InvokeInst>(I)->getCallingConv();
38 void CallSite::setCallingConv(unsigned CC) {
39 if (CallInst *CI = dyn_cast<CallInst>(I))
40 CI->setCallingConv(CC);
42 cast<InvokeInst>(I)->setCallingConv(CC);
44 const AttrListPtr &CallSite::getAttributes() const {
45 if (CallInst *CI = dyn_cast<CallInst>(I))
46 return CI->getAttributes();
48 return cast<InvokeInst>(I)->getAttributes();
50 void CallSite::setAttributes(const AttrListPtr &PAL) {
51 if (CallInst *CI = dyn_cast<CallInst>(I))
52 CI->setAttributes(PAL);
54 cast<InvokeInst>(I)->setAttributes(PAL);
56 bool CallSite::paramHasAttr(uint16_t i, Attributes attr) const {
57 if (CallInst *CI = dyn_cast<CallInst>(I))
58 return CI->paramHasAttr(i, attr);
60 return cast<InvokeInst>(I)->paramHasAttr(i, attr);
62 uint16_t CallSite::getParamAlignment(uint16_t i) const {
63 if (CallInst *CI = dyn_cast<CallInst>(I))
64 return CI->getParamAlignment(i);
66 return cast<InvokeInst>(I)->getParamAlignment(i);
69 bool CallSite::doesNotAccessMemory() const {
70 if (CallInst *CI = dyn_cast<CallInst>(I))
71 return CI->doesNotAccessMemory();
73 return cast<InvokeInst>(I)->doesNotAccessMemory();
75 void CallSite::setDoesNotAccessMemory(bool doesNotAccessMemory) {
76 if (CallInst *CI = dyn_cast<CallInst>(I))
77 CI->setDoesNotAccessMemory(doesNotAccessMemory);
79 cast<InvokeInst>(I)->setDoesNotAccessMemory(doesNotAccessMemory);
81 bool CallSite::onlyReadsMemory() const {
82 if (CallInst *CI = dyn_cast<CallInst>(I))
83 return CI->onlyReadsMemory();
85 return cast<InvokeInst>(I)->onlyReadsMemory();
87 void CallSite::setOnlyReadsMemory(bool onlyReadsMemory) {
88 if (CallInst *CI = dyn_cast<CallInst>(I))
89 CI->setOnlyReadsMemory(onlyReadsMemory);
91 cast<InvokeInst>(I)->setOnlyReadsMemory(onlyReadsMemory);
93 bool CallSite::doesNotReturn() const {
94 if (CallInst *CI = dyn_cast<CallInst>(I))
95 return CI->doesNotReturn();
97 return cast<InvokeInst>(I)->doesNotReturn();
99 void CallSite::setDoesNotReturn(bool doesNotReturn) {
100 if (CallInst *CI = dyn_cast<CallInst>(I))
101 CI->setDoesNotReturn(doesNotReturn);
103 cast<InvokeInst>(I)->setDoesNotReturn(doesNotReturn);
105 bool CallSite::doesNotThrow() const {
106 if (CallInst *CI = dyn_cast<CallInst>(I))
107 return CI->doesNotThrow();
109 return cast<InvokeInst>(I)->doesNotThrow();
111 void CallSite::setDoesNotThrow(bool doesNotThrow) {
112 if (CallInst *CI = dyn_cast<CallInst>(I))
113 CI->setDoesNotThrow(doesNotThrow);
115 cast<InvokeInst>(I)->setDoesNotThrow(doesNotThrow);
118 bool CallSite::hasArgument(const Value *Arg) const {
119 for (arg_iterator AI = this->arg_begin(), E = this->arg_end(); AI != E; ++AI)
120 if (AI->get() == Arg)
125 //===----------------------------------------------------------------------===//
126 // TerminatorInst Class
127 //===----------------------------------------------------------------------===//
129 // Out of line virtual method, so the vtable, etc has a home.
130 TerminatorInst::~TerminatorInst() {
133 //===----------------------------------------------------------------------===//
134 // UnaryInstruction Class
135 //===----------------------------------------------------------------------===//
137 // Out of line virtual method, so the vtable, etc has a home.
138 UnaryInstruction::~UnaryInstruction() {
141 //===----------------------------------------------------------------------===//
143 //===----------------------------------------------------------------------===//
145 PHINode::PHINode(const PHINode &PN)
146 : Instruction(PN.getType(), Instruction::PHI,
147 allocHungoffUses(PN.getNumOperands()), PN.getNumOperands()),
148 ReservedSpace(PN.getNumOperands()) {
149 Use *OL = OperandList;
150 for (unsigned i = 0, e = PN.getNumOperands(); i != e; i+=2) {
151 OL[i] = PN.getOperand(i);
152 OL[i+1] = PN.getOperand(i+1);
156 PHINode::~PHINode() {
158 dropHungoffUses(OperandList);
161 // removeIncomingValue - Remove an incoming value. This is useful if a
162 // predecessor basic block is deleted.
163 Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
164 unsigned NumOps = getNumOperands();
165 Use *OL = OperandList;
166 assert(Idx*2 < NumOps && "BB not in PHI node!");
167 Value *Removed = OL[Idx*2];
169 // Move everything after this operand down.
171 // FIXME: we could just swap with the end of the list, then erase. However,
172 // client might not expect this to happen. The code as it is thrashes the
173 // use/def lists, which is kinda lame.
174 for (unsigned i = (Idx+1)*2; i != NumOps; i += 2) {
179 // Nuke the last value.
181 OL[NumOps-2+1].set(0);
182 NumOperands = NumOps-2;
184 // If the PHI node is dead, because it has zero entries, nuke it now.
185 if (NumOps == 2 && DeletePHIIfEmpty) {
186 // If anyone is using this PHI, make them use a dummy value instead...
187 replaceAllUsesWith(UndefValue::get(getType()));
193 /// resizeOperands - resize operands - This adjusts the length of the operands
194 /// list according to the following behavior:
195 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
196 /// of operation. This grows the number of ops by 1.5 times.
197 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
198 /// 3. If NumOps == NumOperands, trim the reserved space.
200 void PHINode::resizeOperands(unsigned NumOps) {
201 unsigned e = getNumOperands();
204 if (NumOps < 4) NumOps = 4; // 4 op PHI nodes are VERY common.
205 } else if (NumOps*2 > NumOperands) {
207 if (ReservedSpace >= NumOps) return;
208 } else if (NumOps == NumOperands) {
209 if (ReservedSpace == NumOps) return;
214 ReservedSpace = NumOps;
215 Use *OldOps = OperandList;
216 Use *NewOps = allocHungoffUses(NumOps);
217 std::copy(OldOps, OldOps + e, NewOps);
218 OperandList = NewOps;
219 if (OldOps) Use::zap(OldOps, OldOps + e, true);
222 /// hasConstantValue - If the specified PHI node always merges together the same
223 /// value, return the value, otherwise return null.
225 Value *PHINode::hasConstantValue(bool AllowNonDominatingInstruction) const {
226 // If the PHI node only has one incoming value, eliminate the PHI node...
227 if (getNumIncomingValues() == 1) {
228 if (getIncomingValue(0) != this) // not X = phi X
229 return getIncomingValue(0);
231 return UndefValue::get(getType()); // Self cycle is dead.
234 // Otherwise if all of the incoming values are the same for the PHI, replace
235 // the PHI node with the incoming value.
238 bool HasUndefInput = false;
239 for (unsigned i = 0, e = getNumIncomingValues(); i != e; ++i)
240 if (isa<UndefValue>(getIncomingValue(i))) {
241 HasUndefInput = true;
242 } else if (getIncomingValue(i) != this) { // Not the PHI node itself...
243 if (InVal && getIncomingValue(i) != InVal)
244 return 0; // Not the same, bail out.
246 InVal = getIncomingValue(i);
249 // The only case that could cause InVal to be null is if we have a PHI node
250 // that only has entries for itself. In this case, there is no entry into the
251 // loop, so kill the PHI.
253 if (InVal == 0) InVal = UndefValue::get(getType());
255 // If we have a PHI node like phi(X, undef, X), where X is defined by some
256 // instruction, we cannot always return X as the result of the PHI node. Only
257 // do this if X is not an instruction (thus it must dominate the PHI block),
258 // or if the client is prepared to deal with this possibility.
259 if (HasUndefInput && !AllowNonDominatingInstruction)
260 if (Instruction *IV = dyn_cast<Instruction>(InVal))
261 // If it's in the entry block, it dominates everything.
262 if (IV->getParent() != &IV->getParent()->getParent()->getEntryBlock() ||
264 return 0; // Cannot guarantee that InVal dominates this PHINode.
266 // All of the incoming values are the same, return the value now.
271 //===----------------------------------------------------------------------===//
272 // CallInst Implementation
273 //===----------------------------------------------------------------------===//
275 CallInst::~CallInst() {
278 void CallInst::init(Value *Func, Value* const *Params, unsigned NumParams) {
279 assert(NumOperands == NumParams+1 && "NumOperands not set up?");
280 Use *OL = OperandList;
283 const FunctionType *FTy =
284 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
285 FTy = FTy; // silence warning.
287 assert((NumParams == FTy->getNumParams() ||
288 (FTy->isVarArg() && NumParams > FTy->getNumParams())) &&
289 "Calling a function with bad signature!");
290 for (unsigned i = 0; i != NumParams; ++i) {
291 assert((i >= FTy->getNumParams() ||
292 FTy->getParamType(i) == Params[i]->getType()) &&
293 "Calling a function with a bad signature!");
298 void CallInst::init(Value *Func, Value *Actual1, Value *Actual2) {
299 assert(NumOperands == 3 && "NumOperands not set up?");
300 Use *OL = OperandList;
305 const FunctionType *FTy =
306 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
307 FTy = FTy; // silence warning.
309 assert((FTy->getNumParams() == 2 ||
310 (FTy->isVarArg() && FTy->getNumParams() < 2)) &&
311 "Calling a function with bad signature");
312 assert((0 >= FTy->getNumParams() ||
313 FTy->getParamType(0) == Actual1->getType()) &&
314 "Calling a function with a bad signature!");
315 assert((1 >= FTy->getNumParams() ||
316 FTy->getParamType(1) == Actual2->getType()) &&
317 "Calling a function with a bad signature!");
320 void CallInst::init(Value *Func, Value *Actual) {
321 assert(NumOperands == 2 && "NumOperands not set up?");
322 Use *OL = OperandList;
326 const FunctionType *FTy =
327 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
328 FTy = FTy; // silence warning.
330 assert((FTy->getNumParams() == 1 ||
331 (FTy->isVarArg() && FTy->getNumParams() == 0)) &&
332 "Calling a function with bad signature");
333 assert((0 == FTy->getNumParams() ||
334 FTy->getParamType(0) == Actual->getType()) &&
335 "Calling a function with a bad signature!");
338 void CallInst::init(Value *Func) {
339 assert(NumOperands == 1 && "NumOperands not set up?");
340 Use *OL = OperandList;
343 const FunctionType *FTy =
344 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
345 FTy = FTy; // silence warning.
347 assert(FTy->getNumParams() == 0 && "Calling a function with bad signature");
350 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
351 Instruction *InsertBefore)
352 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
353 ->getElementType())->getReturnType(),
355 OperandTraits<CallInst>::op_end(this) - 2,
361 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
362 BasicBlock *InsertAtEnd)
363 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
364 ->getElementType())->getReturnType(),
366 OperandTraits<CallInst>::op_end(this) - 2,
371 CallInst::CallInst(Value *Func, const std::string &Name,
372 Instruction *InsertBefore)
373 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
374 ->getElementType())->getReturnType(),
376 OperandTraits<CallInst>::op_end(this) - 1,
382 CallInst::CallInst(Value *Func, const std::string &Name,
383 BasicBlock *InsertAtEnd)
384 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
385 ->getElementType())->getReturnType(),
387 OperandTraits<CallInst>::op_end(this) - 1,
393 CallInst::CallInst(const CallInst &CI)
394 : Instruction(CI.getType(), Instruction::Call,
395 OperandTraits<CallInst>::op_end(this) - CI.getNumOperands(),
396 CI.getNumOperands()) {
397 setAttributes(CI.getAttributes());
398 SubclassData = CI.SubclassData;
399 Use *OL = OperandList;
400 Use *InOL = CI.OperandList;
401 for (unsigned i = 0, e = CI.getNumOperands(); i != e; ++i)
405 void CallInst::addAttribute(unsigned i, Attributes attr) {
406 AttrListPtr PAL = getAttributes();
407 PAL = PAL.addAttr(i, attr);
411 void CallInst::removeAttribute(unsigned i, Attributes attr) {
412 AttrListPtr PAL = getAttributes();
413 PAL = PAL.removeAttr(i, attr);
417 bool CallInst::paramHasAttr(unsigned i, Attributes attr) const {
418 if (AttributeList.paramHasAttr(i, attr))
420 if (const Function *F = getCalledFunction())
421 return F->paramHasAttr(i, attr);
426 //===----------------------------------------------------------------------===//
427 // InvokeInst Implementation
428 //===----------------------------------------------------------------------===//
430 void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
431 Value* const *Args, unsigned NumArgs) {
432 assert(NumOperands == 3+NumArgs && "NumOperands not set up?");
433 Use *OL = OperandList;
437 const FunctionType *FTy =
438 cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
439 FTy = FTy; // silence warning.
441 assert(((NumArgs == FTy->getNumParams()) ||
442 (FTy->isVarArg() && NumArgs > FTy->getNumParams())) &&
443 "Calling a function with bad signature");
445 for (unsigned i = 0, e = NumArgs; i != e; i++) {
446 assert((i >= FTy->getNumParams() ||
447 FTy->getParamType(i) == Args[i]->getType()) &&
448 "Invoking a function with a bad signature!");
454 InvokeInst::InvokeInst(const InvokeInst &II)
455 : TerminatorInst(II.getType(), Instruction::Invoke,
456 OperandTraits<InvokeInst>::op_end(this)
457 - II.getNumOperands(),
458 II.getNumOperands()) {
459 setAttributes(II.getAttributes());
460 SubclassData = II.SubclassData;
461 Use *OL = OperandList, *InOL = II.OperandList;
462 for (unsigned i = 0, e = II.getNumOperands(); i != e; ++i)
466 BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
467 return getSuccessor(idx);
469 unsigned InvokeInst::getNumSuccessorsV() const {
470 return getNumSuccessors();
472 void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
473 return setSuccessor(idx, B);
476 bool InvokeInst::paramHasAttr(unsigned i, Attributes attr) const {
477 if (AttributeList.paramHasAttr(i, attr))
479 if (const Function *F = getCalledFunction())
480 return F->paramHasAttr(i, attr);
484 void InvokeInst::addAttribute(unsigned i, Attributes attr) {
485 AttrListPtr PAL = getAttributes();
486 PAL = PAL.addAttr(i, attr);
490 void InvokeInst::removeAttribute(unsigned i, Attributes attr) {
491 AttrListPtr PAL = getAttributes();
492 PAL = PAL.removeAttr(i, attr);
497 //===----------------------------------------------------------------------===//
498 // ReturnInst Implementation
499 //===----------------------------------------------------------------------===//
501 ReturnInst::ReturnInst(const ReturnInst &RI)
502 : TerminatorInst(Type::VoidTy, Instruction::Ret,
503 OperandTraits<ReturnInst>::op_end(this) -
505 RI.getNumOperands()) {
506 if (RI.getNumOperands())
507 Op<0>() = RI.Op<0>();
510 ReturnInst::ReturnInst(Value *retVal, Instruction *InsertBefore)
511 : TerminatorInst(Type::VoidTy, Instruction::Ret,
512 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
517 ReturnInst::ReturnInst(Value *retVal, BasicBlock *InsertAtEnd)
518 : TerminatorInst(Type::VoidTy, Instruction::Ret,
519 OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
524 ReturnInst::ReturnInst(BasicBlock *InsertAtEnd)
525 : TerminatorInst(Type::VoidTy, Instruction::Ret,
526 OperandTraits<ReturnInst>::op_end(this), 0, InsertAtEnd) {
529 unsigned ReturnInst::getNumSuccessorsV() const {
530 return getNumSuccessors();
533 /// Out-of-line ReturnInst method, put here so the C++ compiler can choose to
534 /// emit the vtable for the class in this translation unit.
535 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
536 assert(0 && "ReturnInst has no successors!");
539 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
540 assert(0 && "ReturnInst has no successors!");
545 ReturnInst::~ReturnInst() {
548 //===----------------------------------------------------------------------===//
549 // UnwindInst Implementation
550 //===----------------------------------------------------------------------===//
552 UnwindInst::UnwindInst(Instruction *InsertBefore)
553 : TerminatorInst(Type::VoidTy, Instruction::Unwind, 0, 0, InsertBefore) {
555 UnwindInst::UnwindInst(BasicBlock *InsertAtEnd)
556 : TerminatorInst(Type::VoidTy, Instruction::Unwind, 0, 0, InsertAtEnd) {
560 unsigned UnwindInst::getNumSuccessorsV() const {
561 return getNumSuccessors();
564 void UnwindInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
565 assert(0 && "UnwindInst has no successors!");
568 BasicBlock *UnwindInst::getSuccessorV(unsigned idx) const {
569 assert(0 && "UnwindInst has no successors!");
574 //===----------------------------------------------------------------------===//
575 // UnreachableInst Implementation
576 //===----------------------------------------------------------------------===//
578 UnreachableInst::UnreachableInst(Instruction *InsertBefore)
579 : TerminatorInst(Type::VoidTy, Instruction::Unreachable, 0, 0, InsertBefore) {
581 UnreachableInst::UnreachableInst(BasicBlock *InsertAtEnd)
582 : TerminatorInst(Type::VoidTy, Instruction::Unreachable, 0, 0, InsertAtEnd) {
585 unsigned UnreachableInst::getNumSuccessorsV() const {
586 return getNumSuccessors();
589 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
590 assert(0 && "UnwindInst has no successors!");
593 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
594 assert(0 && "UnwindInst has no successors!");
599 //===----------------------------------------------------------------------===//
600 // BranchInst Implementation
601 //===----------------------------------------------------------------------===//
603 void BranchInst::AssertOK() {
605 assert(getCondition()->getType() == Type::Int1Ty &&
606 "May only branch on boolean predicates!");
609 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
610 : TerminatorInst(Type::VoidTy, Instruction::Br,
611 OperandTraits<BranchInst>::op_end(this) - 1,
613 assert(IfTrue != 0 && "Branch destination may not be null!");
616 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
617 Instruction *InsertBefore)
618 : TerminatorInst(Type::VoidTy, Instruction::Br,
619 OperandTraits<BranchInst>::op_end(this) - 3,
629 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
630 : TerminatorInst(Type::VoidTy, Instruction::Br,
631 OperandTraits<BranchInst>::op_end(this) - 1,
633 assert(IfTrue != 0 && "Branch destination may not be null!");
637 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
638 BasicBlock *InsertAtEnd)
639 : TerminatorInst(Type::VoidTy, Instruction::Br,
640 OperandTraits<BranchInst>::op_end(this) - 3,
651 BranchInst::BranchInst(const BranchInst &BI) :
652 TerminatorInst(Type::VoidTy, Instruction::Br,
653 OperandTraits<BranchInst>::op_end(this) - BI.getNumOperands(),
654 BI.getNumOperands()) {
655 OperandList[0] = BI.getOperand(0);
656 if (BI.getNumOperands() != 1) {
657 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
658 OperandList[1] = BI.getOperand(1);
659 OperandList[2] = BI.getOperand(2);
663 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
664 return getSuccessor(idx);
666 unsigned BranchInst::getNumSuccessorsV() const {
667 return getNumSuccessors();
669 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
670 setSuccessor(idx, B);
674 //===----------------------------------------------------------------------===//
675 // AllocationInst Implementation
676 //===----------------------------------------------------------------------===//
678 static Value *getAISize(Value *Amt) {
680 Amt = ConstantInt::get(Type::Int32Ty, 1);
682 assert(!isa<BasicBlock>(Amt) &&
683 "Passed basic block into allocation size parameter! Use other ctor");
684 assert(Amt->getType() == Type::Int32Ty &&
685 "Malloc/Allocation array size is not a 32-bit integer!");
690 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
691 unsigned Align, const std::string &Name,
692 Instruction *InsertBefore)
693 : UnaryInstruction(PointerType::getUnqual(Ty), iTy, getAISize(ArraySize),
696 assert(Ty != Type::VoidTy && "Cannot allocate void!");
700 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
701 unsigned Align, const std::string &Name,
702 BasicBlock *InsertAtEnd)
703 : UnaryInstruction(PointerType::getUnqual(Ty), iTy, getAISize(ArraySize),
706 assert(Ty != Type::VoidTy && "Cannot allocate void!");
710 // Out of line virtual method, so the vtable, etc has a home.
711 AllocationInst::~AllocationInst() {
714 void AllocationInst::setAlignment(unsigned Align) {
715 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
716 SubclassData = Log2_32(Align) + 1;
717 assert(getAlignment() == Align && "Alignment representation error!");
720 bool AllocationInst::isArrayAllocation() const {
721 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
722 return CI->getZExtValue() != 1;
726 const Type *AllocationInst::getAllocatedType() const {
727 return getType()->getElementType();
730 AllocaInst::AllocaInst(const AllocaInst &AI)
731 : AllocationInst(AI.getType()->getElementType(), (Value*)AI.getOperand(0),
732 Instruction::Alloca, AI.getAlignment()) {
735 /// isStaticAlloca - Return true if this alloca is in the entry block of the
736 /// function and is a constant size. If so, the code generator will fold it
737 /// into the prolog/epilog code, so it is basically free.
738 bool AllocaInst::isStaticAlloca() const {
739 // Must be constant size.
740 if (!isa<ConstantInt>(getArraySize())) return false;
742 // Must be in the entry block.
743 const BasicBlock *Parent = getParent();
744 return Parent == &Parent->getParent()->front();
747 MallocInst::MallocInst(const MallocInst &MI)
748 : AllocationInst(MI.getType()->getElementType(), (Value*)MI.getOperand(0),
749 Instruction::Malloc, MI.getAlignment()) {
752 //===----------------------------------------------------------------------===//
753 // FreeInst Implementation
754 //===----------------------------------------------------------------------===//
756 void FreeInst::AssertOK() {
757 assert(isa<PointerType>(getOperand(0)->getType()) &&
758 "Can not free something of nonpointer type!");
761 FreeInst::FreeInst(Value *Ptr, Instruction *InsertBefore)
762 : UnaryInstruction(Type::VoidTy, Free, Ptr, InsertBefore) {
766 FreeInst::FreeInst(Value *Ptr, BasicBlock *InsertAtEnd)
767 : UnaryInstruction(Type::VoidTy, Free, Ptr, InsertAtEnd) {
772 //===----------------------------------------------------------------------===//
773 // LoadInst Implementation
774 //===----------------------------------------------------------------------===//
776 void LoadInst::AssertOK() {
777 assert(isa<PointerType>(getOperand(0)->getType()) &&
778 "Ptr must have pointer type.");
781 LoadInst::LoadInst(Value *Ptr, const std::string &Name, Instruction *InsertBef)
782 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
783 Load, Ptr, InsertBef) {
790 LoadInst::LoadInst(Value *Ptr, const std::string &Name, BasicBlock *InsertAE)
791 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
792 Load, Ptr, InsertAE) {
799 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
800 Instruction *InsertBef)
801 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
802 Load, Ptr, InsertBef) {
803 setVolatile(isVolatile);
809 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
810 unsigned Align, Instruction *InsertBef)
811 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
812 Load, Ptr, InsertBef) {
813 setVolatile(isVolatile);
819 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
820 unsigned Align, BasicBlock *InsertAE)
821 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
822 Load, Ptr, InsertAE) {
823 setVolatile(isVolatile);
829 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
830 BasicBlock *InsertAE)
831 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
832 Load, Ptr, InsertAE) {
833 setVolatile(isVolatile);
841 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
842 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
843 Load, Ptr, InsertBef) {
847 if (Name && Name[0]) setName(Name);
850 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
851 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
852 Load, Ptr, InsertAE) {
856 if (Name && Name[0]) setName(Name);
859 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
860 Instruction *InsertBef)
861 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
862 Load, Ptr, InsertBef) {
863 setVolatile(isVolatile);
866 if (Name && Name[0]) setName(Name);
869 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
870 BasicBlock *InsertAE)
871 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
872 Load, Ptr, InsertAE) {
873 setVolatile(isVolatile);
876 if (Name && Name[0]) setName(Name);
879 void LoadInst::setAlignment(unsigned Align) {
880 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
881 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
884 //===----------------------------------------------------------------------===//
885 // StoreInst Implementation
886 //===----------------------------------------------------------------------===//
888 void StoreInst::AssertOK() {
889 assert(getOperand(0) && getOperand(1) && "Both operands must be non-null!");
890 assert(isa<PointerType>(getOperand(1)->getType()) &&
891 "Ptr must have pointer type!");
892 assert(getOperand(0)->getType() ==
893 cast<PointerType>(getOperand(1)->getType())->getElementType()
894 && "Ptr must be a pointer to Val type!");
898 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
899 : Instruction(Type::VoidTy, Store,
900 OperandTraits<StoreInst>::op_begin(this),
901 OperandTraits<StoreInst>::operands(this),
910 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
911 : Instruction(Type::VoidTy, Store,
912 OperandTraits<StoreInst>::op_begin(this),
913 OperandTraits<StoreInst>::operands(this),
922 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
923 Instruction *InsertBefore)
924 : Instruction(Type::VoidTy, Store,
925 OperandTraits<StoreInst>::op_begin(this),
926 OperandTraits<StoreInst>::operands(this),
930 setVolatile(isVolatile);
935 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
936 unsigned Align, Instruction *InsertBefore)
937 : Instruction(Type::VoidTy, Store,
938 OperandTraits<StoreInst>::op_begin(this),
939 OperandTraits<StoreInst>::operands(this),
943 setVolatile(isVolatile);
948 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
949 unsigned Align, BasicBlock *InsertAtEnd)
950 : Instruction(Type::VoidTy, Store,
951 OperandTraits<StoreInst>::op_begin(this),
952 OperandTraits<StoreInst>::operands(this),
956 setVolatile(isVolatile);
961 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
962 BasicBlock *InsertAtEnd)
963 : Instruction(Type::VoidTy, Store,
964 OperandTraits<StoreInst>::op_begin(this),
965 OperandTraits<StoreInst>::operands(this),
969 setVolatile(isVolatile);
974 void StoreInst::setAlignment(unsigned Align) {
975 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
976 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
979 //===----------------------------------------------------------------------===//
980 // GetElementPtrInst Implementation
981 //===----------------------------------------------------------------------===//
983 static unsigned retrieveAddrSpace(const Value *Val) {
984 return cast<PointerType>(Val->getType())->getAddressSpace();
987 void GetElementPtrInst::init(Value *Ptr, Value* const *Idx, unsigned NumIdx,
988 const std::string &Name) {
989 assert(NumOperands == 1+NumIdx && "NumOperands not initialized?");
990 Use *OL = OperandList;
993 for (unsigned i = 0; i != NumIdx; ++i)
999 void GetElementPtrInst::init(Value *Ptr, Value *Idx, const std::string &Name) {
1000 assert(NumOperands == 2 && "NumOperands not initialized?");
1001 Use *OL = OperandList;
1008 GetElementPtrInst::GetElementPtrInst(const GetElementPtrInst &GEPI)
1009 : Instruction(GEPI.getType(), GetElementPtr,
1010 OperandTraits<GetElementPtrInst>::op_end(this)
1011 - GEPI.getNumOperands(),
1012 GEPI.getNumOperands()) {
1013 Use *OL = OperandList;
1014 Use *GEPIOL = GEPI.OperandList;
1015 for (unsigned i = 0, E = NumOperands; i != E; ++i)
1019 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1020 const std::string &Name, Instruction *InBe)
1021 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx)),
1022 retrieveAddrSpace(Ptr)),
1024 OperandTraits<GetElementPtrInst>::op_end(this) - 2,
1026 init(Ptr, Idx, Name);
1029 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1030 const std::string &Name, BasicBlock *IAE)
1031 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx)),
1032 retrieveAddrSpace(Ptr)),
1034 OperandTraits<GetElementPtrInst>::op_end(this) - 2,
1036 init(Ptr, Idx, Name);
1039 // getIndexedType - Returns the type of the element that would be loaded with
1040 // a load instruction with the specified parameters.
1042 // The Idxs pointer should point to a continuous piece of memory containing the
1043 // indices, either as Value* or uint64_t.
1045 // A null type is returned if the indices are invalid for the specified
1048 template <typename IndexTy>
1049 static const Type* getIndexedTypeInternal(const Type *Ptr,
1050 IndexTy const *Idxs,
1052 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
1053 if (!PTy) return 0; // Type isn't a pointer type!
1054 const Type *Agg = PTy->getElementType();
1056 // Handle the special case of the empty set index set...
1060 unsigned CurIdx = 1;
1061 for (; CurIdx != NumIdx; ++CurIdx) {
1062 const CompositeType *CT = dyn_cast<CompositeType>(Agg);
1063 if (!CT || isa<PointerType>(CT)) return 0;
1064 IndexTy Index = Idxs[CurIdx];
1065 if (!CT->indexValid(Index)) return 0;
1066 Agg = CT->getTypeAtIndex(Index);
1068 // If the new type forwards to another type, then it is in the middle
1069 // of being refined to another type (and hence, may have dropped all
1070 // references to what it was using before). So, use the new forwarded
1072 if (const Type *Ty = Agg->getForwardedType())
1075 return CurIdx == NumIdx ? Agg : 0;
1078 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
1081 return getIndexedTypeInternal(Ptr, Idxs, NumIdx);
1084 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
1085 uint64_t const *Idxs,
1087 return getIndexedTypeInternal(Ptr, Idxs, NumIdx);
1090 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr, Value *Idx) {
1091 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
1092 if (!PTy) return 0; // Type isn't a pointer type!
1094 // Check the pointer index.
1095 if (!PTy->indexValid(Idx)) return 0;
1097 return PTy->getElementType();
1101 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
1102 /// zeros. If so, the result pointer and the first operand have the same
1103 /// value, just potentially different types.
1104 bool GetElementPtrInst::hasAllZeroIndices() const {
1105 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1106 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
1107 if (!CI->isZero()) return false;
1115 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
1116 /// constant integers. If so, the result pointer and the first operand have
1117 /// a constant offset between them.
1118 bool GetElementPtrInst::hasAllConstantIndices() const {
1119 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1120 if (!isa<ConstantInt>(getOperand(i)))
1127 //===----------------------------------------------------------------------===//
1128 // ExtractElementInst Implementation
1129 //===----------------------------------------------------------------------===//
1131 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1132 const std::string &Name,
1133 Instruction *InsertBef)
1134 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1136 OperandTraits<ExtractElementInst>::op_begin(this),
1138 assert(isValidOperands(Val, Index) &&
1139 "Invalid extractelement instruction operands!");
1145 ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
1146 const std::string &Name,
1147 Instruction *InsertBef)
1148 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1150 OperandTraits<ExtractElementInst>::op_begin(this),
1152 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1153 assert(isValidOperands(Val, Index) &&
1154 "Invalid extractelement instruction operands!");
1161 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1162 const std::string &Name,
1163 BasicBlock *InsertAE)
1164 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1166 OperandTraits<ExtractElementInst>::op_begin(this),
1168 assert(isValidOperands(Val, Index) &&
1169 "Invalid extractelement instruction operands!");
1176 ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
1177 const std::string &Name,
1178 BasicBlock *InsertAE)
1179 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1181 OperandTraits<ExtractElementInst>::op_begin(this),
1183 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1184 assert(isValidOperands(Val, Index) &&
1185 "Invalid extractelement instruction operands!");
1193 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
1194 if (!isa<VectorType>(Val->getType()) || Index->getType() != Type::Int32Ty)
1200 //===----------------------------------------------------------------------===//
1201 // InsertElementInst Implementation
1202 //===----------------------------------------------------------------------===//
1204 InsertElementInst::InsertElementInst(const InsertElementInst &IE)
1205 : Instruction(IE.getType(), InsertElement,
1206 OperandTraits<InsertElementInst>::op_begin(this), 3) {
1207 Op<0>() = IE.Op<0>();
1208 Op<1>() = IE.Op<1>();
1209 Op<2>() = IE.Op<2>();
1211 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1212 const std::string &Name,
1213 Instruction *InsertBef)
1214 : Instruction(Vec->getType(), InsertElement,
1215 OperandTraits<InsertElementInst>::op_begin(this),
1217 assert(isValidOperands(Vec, Elt, Index) &&
1218 "Invalid insertelement instruction operands!");
1225 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
1226 const std::string &Name,
1227 Instruction *InsertBef)
1228 : Instruction(Vec->getType(), InsertElement,
1229 OperandTraits<InsertElementInst>::op_begin(this),
1231 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1232 assert(isValidOperands(Vec, Elt, Index) &&
1233 "Invalid insertelement instruction operands!");
1241 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1242 const std::string &Name,
1243 BasicBlock *InsertAE)
1244 : Instruction(Vec->getType(), InsertElement,
1245 OperandTraits<InsertElementInst>::op_begin(this),
1247 assert(isValidOperands(Vec, Elt, Index) &&
1248 "Invalid insertelement instruction operands!");
1256 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
1257 const std::string &Name,
1258 BasicBlock *InsertAE)
1259 : Instruction(Vec->getType(), InsertElement,
1260 OperandTraits<InsertElementInst>::op_begin(this),
1262 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1263 assert(isValidOperands(Vec, Elt, Index) &&
1264 "Invalid insertelement instruction operands!");
1272 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
1273 const Value *Index) {
1274 if (!isa<VectorType>(Vec->getType()))
1275 return false; // First operand of insertelement must be vector type.
1277 if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
1278 return false;// Second operand of insertelement must be vector element type.
1280 if (Index->getType() != Type::Int32Ty)
1281 return false; // Third operand of insertelement must be uint.
1286 //===----------------------------------------------------------------------===//
1287 // ShuffleVectorInst Implementation
1288 //===----------------------------------------------------------------------===//
1290 ShuffleVectorInst::ShuffleVectorInst(const ShuffleVectorInst &SV)
1291 : Instruction(SV.getType(), ShuffleVector,
1292 OperandTraits<ShuffleVectorInst>::op_begin(this),
1293 OperandTraits<ShuffleVectorInst>::operands(this)) {
1294 Op<0>() = SV.Op<0>();
1295 Op<1>() = SV.Op<1>();
1296 Op<2>() = SV.Op<2>();
1299 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1300 const std::string &Name,
1301 Instruction *InsertBefore)
1302 : Instruction(VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
1303 cast<VectorType>(Mask->getType())->getNumElements()),
1305 OperandTraits<ShuffleVectorInst>::op_begin(this),
1306 OperandTraits<ShuffleVectorInst>::operands(this),
1308 assert(isValidOperands(V1, V2, Mask) &&
1309 "Invalid shuffle vector instruction operands!");
1316 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1317 const std::string &Name,
1318 BasicBlock *InsertAtEnd)
1319 : Instruction(V1->getType(), ShuffleVector,
1320 OperandTraits<ShuffleVectorInst>::op_begin(this),
1321 OperandTraits<ShuffleVectorInst>::operands(this),
1323 assert(isValidOperands(V1, V2, Mask) &&
1324 "Invalid shuffle vector instruction operands!");
1332 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1333 const Value *Mask) {
1334 if (!isa<VectorType>(V1->getType()) || V1->getType() != V2->getType())
1337 const VectorType *MaskTy = dyn_cast<VectorType>(Mask->getType());
1338 if (!isa<Constant>(Mask) || MaskTy == 0 ||
1339 MaskTy->getElementType() != Type::Int32Ty)
1344 /// getMaskValue - Return the index from the shuffle mask for the specified
1345 /// output result. This is either -1 if the element is undef or a number less
1346 /// than 2*numelements.
1347 int ShuffleVectorInst::getMaskValue(unsigned i) const {
1348 const Constant *Mask = cast<Constant>(getOperand(2));
1349 if (isa<UndefValue>(Mask)) return -1;
1350 if (isa<ConstantAggregateZero>(Mask)) return 0;
1351 const ConstantVector *MaskCV = cast<ConstantVector>(Mask);
1352 assert(i < MaskCV->getNumOperands() && "Index out of range");
1354 if (isa<UndefValue>(MaskCV->getOperand(i)))
1356 return cast<ConstantInt>(MaskCV->getOperand(i))->getZExtValue();
1359 //===----------------------------------------------------------------------===//
1360 // InsertValueInst Class
1361 //===----------------------------------------------------------------------===//
1363 void InsertValueInst::init(Value *Agg, Value *Val, const unsigned *Idx,
1364 unsigned NumIdx, const std::string &Name) {
1365 assert(NumOperands == 2 && "NumOperands not initialized?");
1369 Indices.insert(Indices.end(), Idx, Idx + NumIdx);
1373 void InsertValueInst::init(Value *Agg, Value *Val, unsigned Idx,
1374 const std::string &Name) {
1375 assert(NumOperands == 2 && "NumOperands not initialized?");
1379 Indices.push_back(Idx);
1383 InsertValueInst::InsertValueInst(const InsertValueInst &IVI)
1384 : Instruction(IVI.getType(), InsertValue,
1385 OperandTraits<InsertValueInst>::op_begin(this), 2),
1386 Indices(IVI.Indices) {
1387 Op<0>() = IVI.getOperand(0);
1388 Op<1>() = IVI.getOperand(1);
1391 InsertValueInst::InsertValueInst(Value *Agg,
1394 const std::string &Name,
1395 Instruction *InsertBefore)
1396 : Instruction(Agg->getType(), InsertValue,
1397 OperandTraits<InsertValueInst>::op_begin(this),
1399 init(Agg, Val, Idx, Name);
1402 InsertValueInst::InsertValueInst(Value *Agg,
1405 const std::string &Name,
1406 BasicBlock *InsertAtEnd)
1407 : Instruction(Agg->getType(), InsertValue,
1408 OperandTraits<InsertValueInst>::op_begin(this),
1410 init(Agg, Val, Idx, Name);
1413 //===----------------------------------------------------------------------===//
1414 // ExtractValueInst Class
1415 //===----------------------------------------------------------------------===//
1417 void ExtractValueInst::init(const unsigned *Idx, unsigned NumIdx,
1418 const std::string &Name) {
1419 assert(NumOperands == 1 && "NumOperands not initialized?");
1421 Indices.insert(Indices.end(), Idx, Idx + NumIdx);
1425 void ExtractValueInst::init(unsigned Idx, const std::string &Name) {
1426 assert(NumOperands == 1 && "NumOperands not initialized?");
1428 Indices.push_back(Idx);
1432 ExtractValueInst::ExtractValueInst(const ExtractValueInst &EVI)
1433 : UnaryInstruction(EVI.getType(), ExtractValue, EVI.getOperand(0)),
1434 Indices(EVI.Indices) {
1437 // getIndexedType - Returns the type of the element that would be extracted
1438 // with an extractvalue instruction with the specified parameters.
1440 // A null type is returned if the indices are invalid for the specified
1443 const Type* ExtractValueInst::getIndexedType(const Type *Agg,
1444 const unsigned *Idxs,
1446 unsigned CurIdx = 0;
1447 for (; CurIdx != NumIdx; ++CurIdx) {
1448 const CompositeType *CT = dyn_cast<CompositeType>(Agg);
1449 if (!CT || isa<PointerType>(CT) || isa<VectorType>(CT)) return 0;
1450 unsigned Index = Idxs[CurIdx];
1451 if (!CT->indexValid(Index)) return 0;
1452 Agg = CT->getTypeAtIndex(Index);
1454 // If the new type forwards to another type, then it is in the middle
1455 // of being refined to another type (and hence, may have dropped all
1456 // references to what it was using before). So, use the new forwarded
1458 if (const Type *Ty = Agg->getForwardedType())
1461 return CurIdx == NumIdx ? Agg : 0;
1464 const Type* ExtractValueInst::getIndexedType(const Type *Agg,
1466 return getIndexedType(Agg, &Idx, 1);
1469 //===----------------------------------------------------------------------===//
1470 // BinaryOperator Class
1471 //===----------------------------------------------------------------------===//
1473 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1474 const Type *Ty, const std::string &Name,
1475 Instruction *InsertBefore)
1476 : Instruction(Ty, iType,
1477 OperandTraits<BinaryOperator>::op_begin(this),
1478 OperandTraits<BinaryOperator>::operands(this),
1486 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1487 const Type *Ty, const std::string &Name,
1488 BasicBlock *InsertAtEnd)
1489 : Instruction(Ty, iType,
1490 OperandTraits<BinaryOperator>::op_begin(this),
1491 OperandTraits<BinaryOperator>::operands(this),
1500 void BinaryOperator::init(BinaryOps iType) {
1501 Value *LHS = getOperand(0), *RHS = getOperand(1);
1502 LHS = LHS; RHS = RHS; // Silence warnings.
1503 assert(LHS->getType() == RHS->getType() &&
1504 "Binary operator operand types must match!");
1509 assert(getType() == LHS->getType() &&
1510 "Arithmetic operation should return same type as operands!");
1511 assert((getType()->isInteger() || getType()->isFloatingPoint() ||
1512 isa<VectorType>(getType())) &&
1513 "Tried to create an arithmetic operation on a non-arithmetic type!");
1517 assert(getType() == LHS->getType() &&
1518 "Arithmetic operation should return same type as operands!");
1519 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1520 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1521 "Incorrect operand type (not integer) for S/UDIV");
1524 assert(getType() == LHS->getType() &&
1525 "Arithmetic operation should return same type as operands!");
1526 assert((getType()->isFloatingPoint() || (isa<VectorType>(getType()) &&
1527 cast<VectorType>(getType())->getElementType()->isFloatingPoint()))
1528 && "Incorrect operand type (not floating point) for FDIV");
1532 assert(getType() == LHS->getType() &&
1533 "Arithmetic operation should return same type as operands!");
1534 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1535 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1536 "Incorrect operand type (not integer) for S/UREM");
1539 assert(getType() == LHS->getType() &&
1540 "Arithmetic operation should return same type as operands!");
1541 assert((getType()->isFloatingPoint() || (isa<VectorType>(getType()) &&
1542 cast<VectorType>(getType())->getElementType()->isFloatingPoint()))
1543 && "Incorrect operand type (not floating point) for FREM");
1548 assert(getType() == LHS->getType() &&
1549 "Shift operation should return same type as operands!");
1550 assert((getType()->isInteger() ||
1551 (isa<VectorType>(getType()) &&
1552 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1553 "Tried to create a shift operation on a non-integral type!");
1557 assert(getType() == LHS->getType() &&
1558 "Logical operation should return same type as operands!");
1559 assert((getType()->isInteger() ||
1560 (isa<VectorType>(getType()) &&
1561 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1562 "Tried to create a logical operation on a non-integral type!");
1570 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1571 const std::string &Name,
1572 Instruction *InsertBefore) {
1573 assert(S1->getType() == S2->getType() &&
1574 "Cannot create binary operator with two operands of differing type!");
1575 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1578 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1579 const std::string &Name,
1580 BasicBlock *InsertAtEnd) {
1581 BinaryOperator *Res = Create(Op, S1, S2, Name);
1582 InsertAtEnd->getInstList().push_back(Res);
1586 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const std::string &Name,
1587 Instruction *InsertBefore) {
1588 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1589 return new BinaryOperator(Instruction::Sub,
1591 Op->getType(), Name, InsertBefore);
1594 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const std::string &Name,
1595 BasicBlock *InsertAtEnd) {
1596 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1597 return new BinaryOperator(Instruction::Sub,
1599 Op->getType(), Name, InsertAtEnd);
1602 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const std::string &Name,
1603 Instruction *InsertBefore) {
1605 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1606 C = ConstantInt::getAllOnesValue(PTy->getElementType());
1607 C = ConstantVector::get(std::vector<Constant*>(PTy->getNumElements(), C));
1609 C = ConstantInt::getAllOnesValue(Op->getType());
1612 return new BinaryOperator(Instruction::Xor, Op, C,
1613 Op->getType(), Name, InsertBefore);
1616 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const std::string &Name,
1617 BasicBlock *InsertAtEnd) {
1619 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1620 // Create a vector of all ones values.
1621 Constant *Elt = ConstantInt::getAllOnesValue(PTy->getElementType());
1623 ConstantVector::get(std::vector<Constant*>(PTy->getNumElements(), Elt));
1625 AllOnes = ConstantInt::getAllOnesValue(Op->getType());
1628 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1629 Op->getType(), Name, InsertAtEnd);
1633 // isConstantAllOnes - Helper function for several functions below
1634 static inline bool isConstantAllOnes(const Value *V) {
1635 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V))
1636 return CI->isAllOnesValue();
1637 if (const ConstantVector *CV = dyn_cast<ConstantVector>(V))
1638 return CV->isAllOnesValue();
1642 bool BinaryOperator::isNeg(const Value *V) {
1643 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1644 if (Bop->getOpcode() == Instruction::Sub)
1645 return Bop->getOperand(0) ==
1646 ConstantExpr::getZeroValueForNegationExpr(Bop->getType());
1650 bool BinaryOperator::isNot(const Value *V) {
1651 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1652 return (Bop->getOpcode() == Instruction::Xor &&
1653 (isConstantAllOnes(Bop->getOperand(1)) ||
1654 isConstantAllOnes(Bop->getOperand(0))));
1658 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1659 assert(isNeg(BinOp) && "getNegArgument from non-'neg' instruction!");
1660 return cast<BinaryOperator>(BinOp)->getOperand(1);
1663 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1664 return getNegArgument(const_cast<Value*>(BinOp));
1667 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1668 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1669 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1670 Value *Op0 = BO->getOperand(0);
1671 Value *Op1 = BO->getOperand(1);
1672 if (isConstantAllOnes(Op0)) return Op1;
1674 assert(isConstantAllOnes(Op1));
1678 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1679 return getNotArgument(const_cast<Value*>(BinOp));
1683 // swapOperands - Exchange the two operands to this instruction. This
1684 // instruction is safe to use on any binary instruction and does not
1685 // modify the semantics of the instruction. If the instruction is
1686 // order dependent (SetLT f.e.) the opcode is changed.
1688 bool BinaryOperator::swapOperands() {
1689 if (!isCommutative())
1690 return true; // Can't commute operands
1691 Op<0>().swap(Op<1>());
1695 //===----------------------------------------------------------------------===//
1697 //===----------------------------------------------------------------------===//
1699 // Just determine if this cast only deals with integral->integral conversion.
1700 bool CastInst::isIntegerCast() const {
1701 switch (getOpcode()) {
1702 default: return false;
1703 case Instruction::ZExt:
1704 case Instruction::SExt:
1705 case Instruction::Trunc:
1707 case Instruction::BitCast:
1708 return getOperand(0)->getType()->isInteger() && getType()->isInteger();
1712 bool CastInst::isLosslessCast() const {
1713 // Only BitCast can be lossless, exit fast if we're not BitCast
1714 if (getOpcode() != Instruction::BitCast)
1717 // Identity cast is always lossless
1718 const Type* SrcTy = getOperand(0)->getType();
1719 const Type* DstTy = getType();
1723 // Pointer to pointer is always lossless.
1724 if (isa<PointerType>(SrcTy))
1725 return isa<PointerType>(DstTy);
1726 return false; // Other types have no identity values
1729 /// This function determines if the CastInst does not require any bits to be
1730 /// changed in order to effect the cast. Essentially, it identifies cases where
1731 /// no code gen is necessary for the cast, hence the name no-op cast. For
1732 /// example, the following are all no-op casts:
1733 /// # bitcast i32* %x to i8*
1734 /// # bitcast <2 x i32> %x to <4 x i16>
1735 /// # ptrtoint i32* %x to i32 ; on 32-bit plaforms only
1736 /// @brief Determine if a cast is a no-op.
1737 bool CastInst::isNoopCast(const Type *IntPtrTy) const {
1738 switch (getOpcode()) {
1740 assert(!"Invalid CastOp");
1741 case Instruction::Trunc:
1742 case Instruction::ZExt:
1743 case Instruction::SExt:
1744 case Instruction::FPTrunc:
1745 case Instruction::FPExt:
1746 case Instruction::UIToFP:
1747 case Instruction::SIToFP:
1748 case Instruction::FPToUI:
1749 case Instruction::FPToSI:
1750 return false; // These always modify bits
1751 case Instruction::BitCast:
1752 return true; // BitCast never modifies bits.
1753 case Instruction::PtrToInt:
1754 return IntPtrTy->getPrimitiveSizeInBits() ==
1755 getType()->getPrimitiveSizeInBits();
1756 case Instruction::IntToPtr:
1757 return IntPtrTy->getPrimitiveSizeInBits() ==
1758 getOperand(0)->getType()->getPrimitiveSizeInBits();
1762 /// This function determines if a pair of casts can be eliminated and what
1763 /// opcode should be used in the elimination. This assumes that there are two
1764 /// instructions like this:
1765 /// * %F = firstOpcode SrcTy %x to MidTy
1766 /// * %S = secondOpcode MidTy %F to DstTy
1767 /// The function returns a resultOpcode so these two casts can be replaced with:
1768 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
1769 /// If no such cast is permited, the function returns 0.
1770 unsigned CastInst::isEliminableCastPair(
1771 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
1772 const Type *SrcTy, const Type *MidTy, const Type *DstTy, const Type *IntPtrTy)
1774 // Define the 144 possibilities for these two cast instructions. The values
1775 // in this matrix determine what to do in a given situation and select the
1776 // case in the switch below. The rows correspond to firstOp, the columns
1777 // correspond to secondOp. In looking at the table below, keep in mind
1778 // the following cast properties:
1780 // Size Compare Source Destination
1781 // Operator Src ? Size Type Sign Type Sign
1782 // -------- ------------ ------------------- ---------------------
1783 // TRUNC > Integer Any Integral Any
1784 // ZEXT < Integral Unsigned Integer Any
1785 // SEXT < Integral Signed Integer Any
1786 // FPTOUI n/a FloatPt n/a Integral Unsigned
1787 // FPTOSI n/a FloatPt n/a Integral Signed
1788 // UITOFP n/a Integral Unsigned FloatPt n/a
1789 // SITOFP n/a Integral Signed FloatPt n/a
1790 // FPTRUNC > FloatPt n/a FloatPt n/a
1791 // FPEXT < FloatPt n/a FloatPt n/a
1792 // PTRTOINT n/a Pointer n/a Integral Unsigned
1793 // INTTOPTR n/a Integral Unsigned Pointer n/a
1794 // BITCONVERT = FirstClass n/a FirstClass n/a
1796 // NOTE: some transforms are safe, but we consider them to be non-profitable.
1797 // For example, we could merge "fptoui double to uint" + "zext uint to ulong",
1798 // into "fptoui double to ulong", but this loses information about the range
1799 // of the produced value (we no longer know the top-part is all zeros).
1800 // Further this conversion is often much more expensive for typical hardware,
1801 // and causes issues when building libgcc. We disallow fptosi+sext for the
1803 const unsigned numCastOps =
1804 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
1805 static const uint8_t CastResults[numCastOps][numCastOps] = {
1806 // T F F U S F F P I B -+
1807 // R Z S P P I I T P 2 N T |
1808 // U E E 2 2 2 2 R E I T C +- secondOp
1809 // N X X U S F F N X N 2 V |
1810 // C T T I I P P C T T P T -+
1811 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
1812 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
1813 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
1814 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
1815 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
1816 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
1817 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
1818 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
1819 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
1820 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
1821 { 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
1822 { 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
1825 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
1826 [secondOp-Instruction::CastOpsBegin];
1829 // categorically disallowed
1832 // allowed, use first cast's opcode
1835 // allowed, use second cast's opcode
1838 // no-op cast in second op implies firstOp as long as the DestTy
1840 if (DstTy->isInteger())
1844 // no-op cast in second op implies firstOp as long as the DestTy
1845 // is floating point
1846 if (DstTy->isFloatingPoint())
1850 // no-op cast in first op implies secondOp as long as the SrcTy
1852 if (SrcTy->isInteger())
1856 // no-op cast in first op implies secondOp as long as the SrcTy
1857 // is a floating point
1858 if (SrcTy->isFloatingPoint())
1862 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size
1863 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1864 unsigned MidSize = MidTy->getPrimitiveSizeInBits();
1865 if (MidSize >= PtrSize)
1866 return Instruction::BitCast;
1870 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
1871 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
1872 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
1873 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1874 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1875 if (SrcSize == DstSize)
1876 return Instruction::BitCast;
1877 else if (SrcSize < DstSize)
1881 case 9: // zext, sext -> zext, because sext can't sign extend after zext
1882 return Instruction::ZExt;
1884 // fpext followed by ftrunc is allowed if the bit size returned to is
1885 // the same as the original, in which case its just a bitcast
1887 return Instruction::BitCast;
1888 return 0; // If the types are not the same we can't eliminate it.
1890 // bitcast followed by ptrtoint is allowed as long as the bitcast
1891 // is a pointer to pointer cast.
1892 if (isa<PointerType>(SrcTy) && isa<PointerType>(MidTy))
1896 // inttoptr, bitcast -> intptr if bitcast is a ptr to ptr cast
1897 if (isa<PointerType>(MidTy) && isa<PointerType>(DstTy))
1901 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
1902 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1903 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1904 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1905 if (SrcSize <= PtrSize && SrcSize == DstSize)
1906 return Instruction::BitCast;
1910 // cast combination can't happen (error in input). This is for all cases
1911 // where the MidTy is not the same for the two cast instructions.
1912 assert(!"Invalid Cast Combination");
1915 assert(!"Error in CastResults table!!!");
1921 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, const Type *Ty,
1922 const std::string &Name, Instruction *InsertBefore) {
1923 // Construct and return the appropriate CastInst subclass
1925 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
1926 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
1927 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
1928 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
1929 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
1930 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
1931 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
1932 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
1933 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
1934 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
1935 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
1936 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
1938 assert(!"Invalid opcode provided");
1943 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, const Type *Ty,
1944 const std::string &Name, BasicBlock *InsertAtEnd) {
1945 // Construct and return the appropriate CastInst subclass
1947 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
1948 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
1949 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
1950 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
1951 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
1952 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
1953 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
1954 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
1955 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
1956 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
1957 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
1958 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
1960 assert(!"Invalid opcode provided");
1965 CastInst *CastInst::CreateZExtOrBitCast(Value *S, const Type *Ty,
1966 const std::string &Name,
1967 Instruction *InsertBefore) {
1968 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1969 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1970 return Create(Instruction::ZExt, S, Ty, Name, InsertBefore);
1973 CastInst *CastInst::CreateZExtOrBitCast(Value *S, const Type *Ty,
1974 const std::string &Name,
1975 BasicBlock *InsertAtEnd) {
1976 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1977 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1978 return Create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
1981 CastInst *CastInst::CreateSExtOrBitCast(Value *S, const Type *Ty,
1982 const std::string &Name,
1983 Instruction *InsertBefore) {
1984 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1985 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1986 return Create(Instruction::SExt, S, Ty, Name, InsertBefore);
1989 CastInst *CastInst::CreateSExtOrBitCast(Value *S, const Type *Ty,
1990 const std::string &Name,
1991 BasicBlock *InsertAtEnd) {
1992 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1993 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1994 return Create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
1997 CastInst *CastInst::CreateTruncOrBitCast(Value *S, const Type *Ty,
1998 const std::string &Name,
1999 Instruction *InsertBefore) {
2000 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
2001 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2002 return Create(Instruction::Trunc, S, Ty, Name, InsertBefore);
2005 CastInst *CastInst::CreateTruncOrBitCast(Value *S, const Type *Ty,
2006 const std::string &Name,
2007 BasicBlock *InsertAtEnd) {
2008 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
2009 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2010 return Create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
2013 CastInst *CastInst::CreatePointerCast(Value *S, const Type *Ty,
2014 const std::string &Name,
2015 BasicBlock *InsertAtEnd) {
2016 assert(isa<PointerType>(S->getType()) && "Invalid cast");
2017 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
2020 if (Ty->isInteger())
2021 return Create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
2022 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2025 /// @brief Create a BitCast or a PtrToInt cast instruction
2026 CastInst *CastInst::CreatePointerCast(Value *S, const Type *Ty,
2027 const std::string &Name,
2028 Instruction *InsertBefore) {
2029 assert(isa<PointerType>(S->getType()) && "Invalid cast");
2030 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
2033 if (Ty->isInteger())
2034 return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
2035 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2038 CastInst *CastInst::CreateIntegerCast(Value *C, const Type *Ty,
2039 bool isSigned, const std::string &Name,
2040 Instruction *InsertBefore) {
2041 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
2042 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
2043 unsigned DstBits = Ty->getPrimitiveSizeInBits();
2044 Instruction::CastOps opcode =
2045 (SrcBits == DstBits ? Instruction::BitCast :
2046 (SrcBits > DstBits ? Instruction::Trunc :
2047 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2048 return Create(opcode, C, Ty, Name, InsertBefore);
2051 CastInst *CastInst::CreateIntegerCast(Value *C, const Type *Ty,
2052 bool isSigned, const std::string &Name,
2053 BasicBlock *InsertAtEnd) {
2054 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
2055 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
2056 unsigned DstBits = Ty->getPrimitiveSizeInBits();
2057 Instruction::CastOps opcode =
2058 (SrcBits == DstBits ? Instruction::BitCast :
2059 (SrcBits > DstBits ? Instruction::Trunc :
2060 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2061 return Create(opcode, C, Ty, Name, InsertAtEnd);
2064 CastInst *CastInst::CreateFPCast(Value *C, const Type *Ty,
2065 const std::string &Name,
2066 Instruction *InsertBefore) {
2067 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
2069 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
2070 unsigned DstBits = Ty->getPrimitiveSizeInBits();
2071 Instruction::CastOps opcode =
2072 (SrcBits == DstBits ? Instruction::BitCast :
2073 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2074 return Create(opcode, C, Ty, Name, InsertBefore);
2077 CastInst *CastInst::CreateFPCast(Value *C, const Type *Ty,
2078 const std::string &Name,
2079 BasicBlock *InsertAtEnd) {
2080 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
2082 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
2083 unsigned DstBits = Ty->getPrimitiveSizeInBits();
2084 Instruction::CastOps opcode =
2085 (SrcBits == DstBits ? Instruction::BitCast :
2086 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2087 return Create(opcode, C, Ty, Name, InsertAtEnd);
2090 // Check whether it is valid to call getCastOpcode for these types.
2091 // This routine must be kept in sync with getCastOpcode.
2092 bool CastInst::isCastable(const Type *SrcTy, const Type *DestTy) {
2093 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2096 if (SrcTy == DestTy)
2099 // Get the bit sizes, we'll need these
2100 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2101 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2103 // Run through the possibilities ...
2104 if (DestTy->isInteger()) { // Casting to integral
2105 if (SrcTy->isInteger()) { // Casting from integral
2107 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2109 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2110 // Casting from vector
2111 return DestBits == PTy->getBitWidth();
2112 } else { // Casting from something else
2113 return isa<PointerType>(SrcTy);
2115 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2116 if (SrcTy->isInteger()) { // Casting from integral
2118 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2120 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2121 // Casting from vector
2122 return DestBits == PTy->getBitWidth();
2123 } else { // Casting from something else
2126 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2127 // Casting to vector
2128 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2129 // Casting from vector
2130 return DestPTy->getBitWidth() == SrcPTy->getBitWidth();
2131 } else { // Casting from something else
2132 return DestPTy->getBitWidth() == SrcBits;
2134 } else if (isa<PointerType>(DestTy)) { // Casting to pointer
2135 if (isa<PointerType>(SrcTy)) { // Casting from pointer
2137 } else if (SrcTy->isInteger()) { // Casting from integral
2139 } else { // Casting from something else
2142 } else { // Casting to something else
2147 // Provide a way to get a "cast" where the cast opcode is inferred from the
2148 // types and size of the operand. This, basically, is a parallel of the
2149 // logic in the castIsValid function below. This axiom should hold:
2150 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
2151 // should not assert in castIsValid. In other words, this produces a "correct"
2152 // casting opcode for the arguments passed to it.
2153 // This routine must be kept in sync with isCastable.
2154 Instruction::CastOps
2155 CastInst::getCastOpcode(
2156 const Value *Src, bool SrcIsSigned, const Type *DestTy, bool DestIsSigned) {
2157 // Get the bit sizes, we'll need these
2158 const Type *SrcTy = Src->getType();
2159 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2160 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2162 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2163 "Only first class types are castable!");
2165 // Run through the possibilities ...
2166 if (DestTy->isInteger()) { // Casting to integral
2167 if (SrcTy->isInteger()) { // Casting from integral
2168 if (DestBits < SrcBits)
2169 return Trunc; // int -> smaller int
2170 else if (DestBits > SrcBits) { // its an extension
2172 return SExt; // signed -> SEXT
2174 return ZExt; // unsigned -> ZEXT
2176 return BitCast; // Same size, No-op cast
2178 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2180 return FPToSI; // FP -> sint
2182 return FPToUI; // FP -> uint
2183 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2184 assert(DestBits == PTy->getBitWidth() &&
2185 "Casting vector to integer of different width");
2187 return BitCast; // Same size, no-op cast
2189 assert(isa<PointerType>(SrcTy) &&
2190 "Casting from a value that is not first-class type");
2191 return PtrToInt; // ptr -> int
2193 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2194 if (SrcTy->isInteger()) { // Casting from integral
2196 return SIToFP; // sint -> FP
2198 return UIToFP; // uint -> FP
2199 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2200 if (DestBits < SrcBits) {
2201 return FPTrunc; // FP -> smaller FP
2202 } else if (DestBits > SrcBits) {
2203 return FPExt; // FP -> larger FP
2205 return BitCast; // same size, no-op cast
2207 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2208 assert(DestBits == PTy->getBitWidth() &&
2209 "Casting vector to floating point of different width");
2211 return BitCast; // same size, no-op cast
2213 assert(0 && "Casting pointer or non-first class to float");
2215 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2216 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2217 assert(DestPTy->getBitWidth() == SrcPTy->getBitWidth() &&
2218 "Casting vector to vector of different widths");
2220 return BitCast; // vector -> vector
2221 } else if (DestPTy->getBitWidth() == SrcBits) {
2222 return BitCast; // float/int -> vector
2224 assert(!"Illegal cast to vector (wrong type or size)");
2226 } else if (isa<PointerType>(DestTy)) {
2227 if (isa<PointerType>(SrcTy)) {
2228 return BitCast; // ptr -> ptr
2229 } else if (SrcTy->isInteger()) {
2230 return IntToPtr; // int -> ptr
2232 assert(!"Casting pointer to other than pointer or int");
2235 assert(!"Casting to type that is not first-class");
2238 // If we fall through to here we probably hit an assertion cast above
2239 // and assertions are not turned on. Anything we return is an error, so
2240 // BitCast is as good a choice as any.
2244 //===----------------------------------------------------------------------===//
2245 // CastInst SubClass Constructors
2246 //===----------------------------------------------------------------------===//
2248 /// Check that the construction parameters for a CastInst are correct. This
2249 /// could be broken out into the separate constructors but it is useful to have
2250 /// it in one place and to eliminate the redundant code for getting the sizes
2251 /// of the types involved.
2253 CastInst::castIsValid(Instruction::CastOps op, Value *S, const Type *DstTy) {
2255 // Check for type sanity on the arguments
2256 const Type *SrcTy = S->getType();
2257 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType())
2260 // Get the size of the types in bits, we'll need this later
2261 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
2262 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
2264 // Switch on the opcode provided
2266 default: return false; // This is an input error
2267 case Instruction::Trunc:
2268 return SrcTy->isIntOrIntVector() &&
2269 DstTy->isIntOrIntVector()&& SrcBitSize > DstBitSize;
2270 case Instruction::ZExt:
2271 return SrcTy->isIntOrIntVector() &&
2272 DstTy->isIntOrIntVector()&& SrcBitSize < DstBitSize;
2273 case Instruction::SExt:
2274 return SrcTy->isIntOrIntVector() &&
2275 DstTy->isIntOrIntVector()&& SrcBitSize < DstBitSize;
2276 case Instruction::FPTrunc:
2277 return SrcTy->isFPOrFPVector() &&
2278 DstTy->isFPOrFPVector() &&
2279 SrcBitSize > DstBitSize;
2280 case Instruction::FPExt:
2281 return SrcTy->isFPOrFPVector() &&
2282 DstTy->isFPOrFPVector() &&
2283 SrcBitSize < DstBitSize;
2284 case Instruction::UIToFP:
2285 case Instruction::SIToFP:
2286 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2287 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2288 return SVTy->getElementType()->isIntOrIntVector() &&
2289 DVTy->getElementType()->isFPOrFPVector() &&
2290 SVTy->getNumElements() == DVTy->getNumElements();
2293 return SrcTy->isIntOrIntVector() && DstTy->isFPOrFPVector();
2294 case Instruction::FPToUI:
2295 case Instruction::FPToSI:
2296 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2297 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2298 return SVTy->getElementType()->isFPOrFPVector() &&
2299 DVTy->getElementType()->isIntOrIntVector() &&
2300 SVTy->getNumElements() == DVTy->getNumElements();
2303 return SrcTy->isFPOrFPVector() && DstTy->isIntOrIntVector();
2304 case Instruction::PtrToInt:
2305 return isa<PointerType>(SrcTy) && DstTy->isInteger();
2306 case Instruction::IntToPtr:
2307 return SrcTy->isInteger() && isa<PointerType>(DstTy);
2308 case Instruction::BitCast:
2309 // BitCast implies a no-op cast of type only. No bits change.
2310 // However, you can't cast pointers to anything but pointers.
2311 if (isa<PointerType>(SrcTy) != isa<PointerType>(DstTy))
2314 // Now we know we're not dealing with a pointer/non-pointer mismatch. In all
2315 // these cases, the cast is okay if the source and destination bit widths
2317 return SrcBitSize == DstBitSize;
2321 TruncInst::TruncInst(
2322 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2323 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2324 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2327 TruncInst::TruncInst(
2328 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2329 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2330 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2334 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2335 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2336 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2340 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2341 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2342 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2345 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2346 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2347 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2351 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2352 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2353 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2356 FPTruncInst::FPTruncInst(
2357 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2358 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2359 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2362 FPTruncInst::FPTruncInst(
2363 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2364 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2365 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2368 FPExtInst::FPExtInst(
2369 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2370 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2371 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2374 FPExtInst::FPExtInst(
2375 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2376 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2377 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2380 UIToFPInst::UIToFPInst(
2381 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2382 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2383 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2386 UIToFPInst::UIToFPInst(
2387 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2388 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2389 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2392 SIToFPInst::SIToFPInst(
2393 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2394 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2395 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2398 SIToFPInst::SIToFPInst(
2399 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2400 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2401 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2404 FPToUIInst::FPToUIInst(
2405 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2406 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2407 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2410 FPToUIInst::FPToUIInst(
2411 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2412 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2413 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2416 FPToSIInst::FPToSIInst(
2417 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2418 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2419 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2422 FPToSIInst::FPToSIInst(
2423 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2424 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2425 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2428 PtrToIntInst::PtrToIntInst(
2429 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2430 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2431 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2434 PtrToIntInst::PtrToIntInst(
2435 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2436 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2437 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2440 IntToPtrInst::IntToPtrInst(
2441 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2442 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2443 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2446 IntToPtrInst::IntToPtrInst(
2447 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2448 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2449 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2452 BitCastInst::BitCastInst(
2453 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2454 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2455 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2458 BitCastInst::BitCastInst(
2459 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2460 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2461 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2464 //===----------------------------------------------------------------------===//
2466 //===----------------------------------------------------------------------===//
2468 CmpInst::CmpInst(const Type *ty, OtherOps op, unsigned short predicate,
2469 Value *LHS, Value *RHS, const std::string &Name,
2470 Instruction *InsertBefore)
2471 : Instruction(ty, op,
2472 OperandTraits<CmpInst>::op_begin(this),
2473 OperandTraits<CmpInst>::operands(this),
2477 SubclassData = predicate;
2481 CmpInst::CmpInst(const Type *ty, OtherOps op, unsigned short predicate,
2482 Value *LHS, Value *RHS, const std::string &Name,
2483 BasicBlock *InsertAtEnd)
2484 : Instruction(ty, op,
2485 OperandTraits<CmpInst>::op_begin(this),
2486 OperandTraits<CmpInst>::operands(this),
2490 SubclassData = predicate;
2495 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2496 const std::string &Name, Instruction *InsertBefore) {
2497 if (Op == Instruction::ICmp) {
2498 return new ICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2501 if (Op == Instruction::FCmp) {
2502 return new FCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2505 if (Op == Instruction::VICmp) {
2506 return new VICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2509 return new VFCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2514 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2515 const std::string &Name, BasicBlock *InsertAtEnd) {
2516 if (Op == Instruction::ICmp) {
2517 return new ICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2520 if (Op == Instruction::FCmp) {
2521 return new FCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2524 if (Op == Instruction::VICmp) {
2525 return new VICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2528 return new VFCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2532 void CmpInst::swapOperands() {
2533 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2536 cast<FCmpInst>(this)->swapOperands();
2539 bool CmpInst::isCommutative() {
2540 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2541 return IC->isCommutative();
2542 return cast<FCmpInst>(this)->isCommutative();
2545 bool CmpInst::isEquality() {
2546 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2547 return IC->isEquality();
2548 return cast<FCmpInst>(this)->isEquality();
2552 CmpInst::Predicate CmpInst::getInversePredicate(Predicate pred) {
2554 default: assert(!"Unknown cmp predicate!");
2555 case ICMP_EQ: return ICMP_NE;
2556 case ICMP_NE: return ICMP_EQ;
2557 case ICMP_UGT: return ICMP_ULE;
2558 case ICMP_ULT: return ICMP_UGE;
2559 case ICMP_UGE: return ICMP_ULT;
2560 case ICMP_ULE: return ICMP_UGT;
2561 case ICMP_SGT: return ICMP_SLE;
2562 case ICMP_SLT: return ICMP_SGE;
2563 case ICMP_SGE: return ICMP_SLT;
2564 case ICMP_SLE: return ICMP_SGT;
2566 case FCMP_OEQ: return FCMP_UNE;
2567 case FCMP_ONE: return FCMP_UEQ;
2568 case FCMP_OGT: return FCMP_ULE;
2569 case FCMP_OLT: return FCMP_UGE;
2570 case FCMP_OGE: return FCMP_ULT;
2571 case FCMP_OLE: return FCMP_UGT;
2572 case FCMP_UEQ: return FCMP_ONE;
2573 case FCMP_UNE: return FCMP_OEQ;
2574 case FCMP_UGT: return FCMP_OLE;
2575 case FCMP_ULT: return FCMP_OGE;
2576 case FCMP_UGE: return FCMP_OLT;
2577 case FCMP_ULE: return FCMP_OGT;
2578 case FCMP_ORD: return FCMP_UNO;
2579 case FCMP_UNO: return FCMP_ORD;
2580 case FCMP_TRUE: return FCMP_FALSE;
2581 case FCMP_FALSE: return FCMP_TRUE;
2585 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
2587 default: assert(! "Unknown icmp predicate!");
2588 case ICMP_EQ: case ICMP_NE:
2589 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2591 case ICMP_UGT: return ICMP_SGT;
2592 case ICMP_ULT: return ICMP_SLT;
2593 case ICMP_UGE: return ICMP_SGE;
2594 case ICMP_ULE: return ICMP_SLE;
2598 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
2600 default: assert(! "Unknown icmp predicate!");
2601 case ICMP_EQ: case ICMP_NE:
2602 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
2604 case ICMP_SGT: return ICMP_UGT;
2605 case ICMP_SLT: return ICMP_ULT;
2606 case ICMP_SGE: return ICMP_UGE;
2607 case ICMP_SLE: return ICMP_ULE;
2611 bool ICmpInst::isSignedPredicate(Predicate pred) {
2613 default: assert(! "Unknown icmp predicate!");
2614 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2616 case ICMP_EQ: case ICMP_NE: case ICMP_UGT: case ICMP_ULT:
2617 case ICMP_UGE: case ICMP_ULE:
2622 /// Initialize a set of values that all satisfy the condition with C.
2625 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
2628 uint32_t BitWidth = C.getBitWidth();
2630 default: assert(0 && "Invalid ICmp opcode to ConstantRange ctor!");
2631 case ICmpInst::ICMP_EQ: Upper++; break;
2632 case ICmpInst::ICMP_NE: Lower++; break;
2633 case ICmpInst::ICMP_ULT: Lower = APInt::getMinValue(BitWidth); break;
2634 case ICmpInst::ICMP_SLT: Lower = APInt::getSignedMinValue(BitWidth); break;
2635 case ICmpInst::ICMP_UGT:
2636 Lower++; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2638 case ICmpInst::ICMP_SGT:
2639 Lower++; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2641 case ICmpInst::ICMP_ULE:
2642 Lower = APInt::getMinValue(BitWidth); Upper++;
2644 case ICmpInst::ICMP_SLE:
2645 Lower = APInt::getSignedMinValue(BitWidth); Upper++;
2647 case ICmpInst::ICMP_UGE:
2648 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2650 case ICmpInst::ICMP_SGE:
2651 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2654 return ConstantRange(Lower, Upper);
2657 CmpInst::Predicate CmpInst::getSwappedPredicate(Predicate pred) {
2659 default: assert(!"Unknown cmp predicate!");
2660 case ICMP_EQ: case ICMP_NE:
2662 case ICMP_SGT: return ICMP_SLT;
2663 case ICMP_SLT: return ICMP_SGT;
2664 case ICMP_SGE: return ICMP_SLE;
2665 case ICMP_SLE: return ICMP_SGE;
2666 case ICMP_UGT: return ICMP_ULT;
2667 case ICMP_ULT: return ICMP_UGT;
2668 case ICMP_UGE: return ICMP_ULE;
2669 case ICMP_ULE: return ICMP_UGE;
2671 case FCMP_FALSE: case FCMP_TRUE:
2672 case FCMP_OEQ: case FCMP_ONE:
2673 case FCMP_UEQ: case FCMP_UNE:
2674 case FCMP_ORD: case FCMP_UNO:
2676 case FCMP_OGT: return FCMP_OLT;
2677 case FCMP_OLT: return FCMP_OGT;
2678 case FCMP_OGE: return FCMP_OLE;
2679 case FCMP_OLE: return FCMP_OGE;
2680 case FCMP_UGT: return FCMP_ULT;
2681 case FCMP_ULT: return FCMP_UGT;
2682 case FCMP_UGE: return FCMP_ULE;
2683 case FCMP_ULE: return FCMP_UGE;
2687 bool CmpInst::isUnsigned(unsigned short predicate) {
2688 switch (predicate) {
2689 default: return false;
2690 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
2691 case ICmpInst::ICMP_UGE: return true;
2695 bool CmpInst::isSigned(unsigned short predicate){
2696 switch (predicate) {
2697 default: return false;
2698 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
2699 case ICmpInst::ICMP_SGE: return true;
2703 bool CmpInst::isOrdered(unsigned short predicate) {
2704 switch (predicate) {
2705 default: return false;
2706 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
2707 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
2708 case FCmpInst::FCMP_ORD: return true;
2712 bool CmpInst::isUnordered(unsigned short predicate) {
2713 switch (predicate) {
2714 default: return false;
2715 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
2716 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
2717 case FCmpInst::FCMP_UNO: return true;
2721 //===----------------------------------------------------------------------===//
2722 // SwitchInst Implementation
2723 //===----------------------------------------------------------------------===//
2725 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumCases) {
2726 assert(Value && Default);
2727 ReservedSpace = 2+NumCases*2;
2729 OperandList = allocHungoffUses(ReservedSpace);
2731 OperandList[0] = Value;
2732 OperandList[1] = Default;
2735 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2736 /// switch on and a default destination. The number of additional cases can
2737 /// be specified here to make memory allocation more efficient. This
2738 /// constructor can also autoinsert before another instruction.
2739 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2740 Instruction *InsertBefore)
2741 : TerminatorInst(Type::VoidTy, Instruction::Switch, 0, 0, InsertBefore) {
2742 init(Value, Default, NumCases);
2745 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2746 /// switch on and a default destination. The number of additional cases can
2747 /// be specified here to make memory allocation more efficient. This
2748 /// constructor also autoinserts at the end of the specified BasicBlock.
2749 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2750 BasicBlock *InsertAtEnd)
2751 : TerminatorInst(Type::VoidTy, Instruction::Switch, 0, 0, InsertAtEnd) {
2752 init(Value, Default, NumCases);
2755 SwitchInst::SwitchInst(const SwitchInst &SI)
2756 : TerminatorInst(Type::VoidTy, Instruction::Switch,
2757 allocHungoffUses(SI.getNumOperands()), SI.getNumOperands()) {
2758 Use *OL = OperandList, *InOL = SI.OperandList;
2759 for (unsigned i = 0, E = SI.getNumOperands(); i != E; i+=2) {
2761 OL[i+1] = InOL[i+1];
2765 SwitchInst::~SwitchInst() {
2766 dropHungoffUses(OperandList);
2770 /// addCase - Add an entry to the switch instruction...
2772 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
2773 unsigned OpNo = NumOperands;
2774 if (OpNo+2 > ReservedSpace)
2775 resizeOperands(0); // Get more space!
2776 // Initialize some new operands.
2777 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
2778 NumOperands = OpNo+2;
2779 OperandList[OpNo] = OnVal;
2780 OperandList[OpNo+1] = Dest;
2783 /// removeCase - This method removes the specified successor from the switch
2784 /// instruction. Note that this cannot be used to remove the default
2785 /// destination (successor #0).
2787 void SwitchInst::removeCase(unsigned idx) {
2788 assert(idx != 0 && "Cannot remove the default case!");
2789 assert(idx*2 < getNumOperands() && "Successor index out of range!!!");
2791 unsigned NumOps = getNumOperands();
2792 Use *OL = OperandList;
2794 // Move everything after this operand down.
2796 // FIXME: we could just swap with the end of the list, then erase. However,
2797 // client might not expect this to happen. The code as it is thrashes the
2798 // use/def lists, which is kinda lame.
2799 for (unsigned i = (idx+1)*2; i != NumOps; i += 2) {
2801 OL[i-2+1] = OL[i+1];
2804 // Nuke the last value.
2805 OL[NumOps-2].set(0);
2806 OL[NumOps-2+1].set(0);
2807 NumOperands = NumOps-2;
2810 /// resizeOperands - resize operands - This adjusts the length of the operands
2811 /// list according to the following behavior:
2812 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
2813 /// of operation. This grows the number of ops by 3 times.
2814 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
2815 /// 3. If NumOps == NumOperands, trim the reserved space.
2817 void SwitchInst::resizeOperands(unsigned NumOps) {
2818 unsigned e = getNumOperands();
2821 } else if (NumOps*2 > NumOperands) {
2822 // No resize needed.
2823 if (ReservedSpace >= NumOps) return;
2824 } else if (NumOps == NumOperands) {
2825 if (ReservedSpace == NumOps) return;
2830 ReservedSpace = NumOps;
2831 Use *NewOps = allocHungoffUses(NumOps);
2832 Use *OldOps = OperandList;
2833 for (unsigned i = 0; i != e; ++i) {
2834 NewOps[i] = OldOps[i];
2836 OperandList = NewOps;
2837 if (OldOps) Use::zap(OldOps, OldOps + e, true);
2841 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
2842 return getSuccessor(idx);
2844 unsigned SwitchInst::getNumSuccessorsV() const {
2845 return getNumSuccessors();
2847 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
2848 setSuccessor(idx, B);
2851 // Define these methods here so vtables don't get emitted into every translation
2852 // unit that uses these classes.
2854 GetElementPtrInst *GetElementPtrInst::clone() const {
2855 return new(getNumOperands()) GetElementPtrInst(*this);
2858 BinaryOperator *BinaryOperator::clone() const {
2859 return Create(getOpcode(), Op<0>(), Op<1>());
2862 FCmpInst* FCmpInst::clone() const {
2863 return new FCmpInst(getPredicate(), Op<0>(), Op<1>());
2865 ICmpInst* ICmpInst::clone() const {
2866 return new ICmpInst(getPredicate(), Op<0>(), Op<1>());
2869 VFCmpInst* VFCmpInst::clone() const {
2870 return new VFCmpInst(getPredicate(), Op<0>(), Op<1>());
2872 VICmpInst* VICmpInst::clone() const {
2873 return new VICmpInst(getPredicate(), Op<0>(), Op<1>());
2876 ExtractValueInst *ExtractValueInst::clone() const {
2877 return new ExtractValueInst(*this);
2879 InsertValueInst *InsertValueInst::clone() const {
2880 return new InsertValueInst(*this);
2884 MallocInst *MallocInst::clone() const { return new MallocInst(*this); }
2885 AllocaInst *AllocaInst::clone() const { return new AllocaInst(*this); }
2886 FreeInst *FreeInst::clone() const { return new FreeInst(getOperand(0)); }
2887 LoadInst *LoadInst::clone() const { return new LoadInst(*this); }
2888 StoreInst *StoreInst::clone() const { return new StoreInst(*this); }
2889 CastInst *TruncInst::clone() const { return new TruncInst(*this); }
2890 CastInst *ZExtInst::clone() const { return new ZExtInst(*this); }
2891 CastInst *SExtInst::clone() const { return new SExtInst(*this); }
2892 CastInst *FPTruncInst::clone() const { return new FPTruncInst(*this); }
2893 CastInst *FPExtInst::clone() const { return new FPExtInst(*this); }
2894 CastInst *UIToFPInst::clone() const { return new UIToFPInst(*this); }
2895 CastInst *SIToFPInst::clone() const { return new SIToFPInst(*this); }
2896 CastInst *FPToUIInst::clone() const { return new FPToUIInst(*this); }
2897 CastInst *FPToSIInst::clone() const { return new FPToSIInst(*this); }
2898 CastInst *PtrToIntInst::clone() const { return new PtrToIntInst(*this); }
2899 CastInst *IntToPtrInst::clone() const { return new IntToPtrInst(*this); }
2900 CastInst *BitCastInst::clone() const { return new BitCastInst(*this); }
2901 CallInst *CallInst::clone() const {
2902 return new(getNumOperands()) CallInst(*this);
2904 SelectInst *SelectInst::clone() const {
2905 return new(getNumOperands()) SelectInst(*this);
2907 VAArgInst *VAArgInst::clone() const { return new VAArgInst(*this); }
2909 ExtractElementInst *ExtractElementInst::clone() const {
2910 return new ExtractElementInst(*this);
2912 InsertElementInst *InsertElementInst::clone() const {
2913 return InsertElementInst::Create(*this);
2915 ShuffleVectorInst *ShuffleVectorInst::clone() const {
2916 return new ShuffleVectorInst(*this);
2918 PHINode *PHINode::clone() const { return new PHINode(*this); }
2919 ReturnInst *ReturnInst::clone() const {
2920 return new(getNumOperands()) ReturnInst(*this);
2922 BranchInst *BranchInst::clone() const {
2923 return new(getNumOperands()) BranchInst(*this);
2925 SwitchInst *SwitchInst::clone() const { return new SwitchInst(*this); }
2926 InvokeInst *InvokeInst::clone() const {
2927 return new(getNumOperands()) InvokeInst(*this);
2929 UnwindInst *UnwindInst::clone() const { return new UnwindInst(); }
2930 UnreachableInst *UnreachableInst::clone() const { return new UnreachableInst();}