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 PAListPtr &CallSite::getParamAttrs() const {
45 if (CallInst *CI = dyn_cast<CallInst>(I))
46 return CI->getParamAttrs();
48 return cast<InvokeInst>(I)->getParamAttrs();
50 void CallSite::setParamAttrs(const PAListPtr &PAL) {
51 if (CallInst *CI = dyn_cast<CallInst>(I))
52 CI->setParamAttrs(PAL);
54 cast<InvokeInst>(I)->setParamAttrs(PAL);
56 bool CallSite::paramHasAttr(uint16_t i, ParameterAttributes 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 bool CallSite::onlyReadsMemory() const {
76 if (CallInst *CI = dyn_cast<CallInst>(I))
77 return CI->onlyReadsMemory();
79 return cast<InvokeInst>(I)->onlyReadsMemory();
81 bool CallSite::doesNotThrow() const {
82 if (CallInst *CI = dyn_cast<CallInst>(I))
83 return CI->doesNotThrow();
85 return cast<InvokeInst>(I)->doesNotThrow();
87 void CallSite::setDoesNotThrow(bool doesNotThrow) {
88 if (CallInst *CI = dyn_cast<CallInst>(I))
89 CI->setDoesNotThrow(doesNotThrow);
91 cast<InvokeInst>(I)->setDoesNotThrow(doesNotThrow);
94 bool CallSite::hasArgument(const Value *Arg) const {
95 for (arg_iterator AI = this->arg_begin(), E = this->arg_end(); AI != E; ++AI)
101 //===----------------------------------------------------------------------===//
102 // TerminatorInst Class
103 //===----------------------------------------------------------------------===//
105 // Out of line virtual method, so the vtable, etc has a home.
106 TerminatorInst::~TerminatorInst() {
109 //===----------------------------------------------------------------------===//
110 // UnaryInstruction Class
111 //===----------------------------------------------------------------------===//
113 // Out of line virtual method, so the vtable, etc has a home.
114 UnaryInstruction::~UnaryInstruction() {
117 //===----------------------------------------------------------------------===//
119 //===----------------------------------------------------------------------===//
121 PHINode::PHINode(const PHINode &PN)
122 : Instruction(PN.getType(), Instruction::PHI,
123 allocHungoffUses(PN.getNumOperands()), PN.getNumOperands()),
124 ReservedSpace(PN.getNumOperands()) {
125 Use *OL = OperandList;
126 for (unsigned i = 0, e = PN.getNumOperands(); i != e; i+=2) {
127 OL[i] = PN.getOperand(i);
128 OL[i+1] = PN.getOperand(i+1);
132 PHINode::~PHINode() {
134 dropHungoffUses(OperandList);
137 // removeIncomingValue - Remove an incoming value. This is useful if a
138 // predecessor basic block is deleted.
139 Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
140 unsigned NumOps = getNumOperands();
141 Use *OL = OperandList;
142 assert(Idx*2 < NumOps && "BB not in PHI node!");
143 Value *Removed = OL[Idx*2];
145 // Move everything after this operand down.
147 // FIXME: we could just swap with the end of the list, then erase. However,
148 // client might not expect this to happen. The code as it is thrashes the
149 // use/def lists, which is kinda lame.
150 for (unsigned i = (Idx+1)*2; i != NumOps; i += 2) {
155 // Nuke the last value.
157 OL[NumOps-2+1].set(0);
158 NumOperands = NumOps-2;
160 // If the PHI node is dead, because it has zero entries, nuke it now.
161 if (NumOps == 2 && DeletePHIIfEmpty) {
162 // If anyone is using this PHI, make them use a dummy value instead...
163 replaceAllUsesWith(UndefValue::get(getType()));
169 /// resizeOperands - resize operands - This adjusts the length of the operands
170 /// list according to the following behavior:
171 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
172 /// of operation. This grows the number of ops by 1.5 times.
173 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
174 /// 3. If NumOps == NumOperands, trim the reserved space.
176 void PHINode::resizeOperands(unsigned NumOps) {
177 unsigned e = getNumOperands();
180 if (NumOps < 4) NumOps = 4; // 4 op PHI nodes are VERY common.
181 } else if (NumOps*2 > NumOperands) {
183 if (ReservedSpace >= NumOps) return;
184 } else if (NumOps == NumOperands) {
185 if (ReservedSpace == NumOps) return;
190 ReservedSpace = NumOps;
191 Use *OldOps = OperandList;
192 Use *NewOps = allocHungoffUses(NumOps);
193 for (unsigned i = 0; i != e; ++i) {
194 NewOps[i] = OldOps[i];
196 OperandList = NewOps;
197 if (OldOps) Use::zap(OldOps, OldOps + e, true);
200 /// hasConstantValue - If the specified PHI node always merges together the same
201 /// value, return the value, otherwise return null.
203 Value *PHINode::hasConstantValue(bool AllowNonDominatingInstruction) const {
204 // If the PHI node only has one incoming value, eliminate the PHI node...
205 if (getNumIncomingValues() == 1) {
206 if (getIncomingValue(0) != this) // not X = phi X
207 return getIncomingValue(0);
209 return UndefValue::get(getType()); // Self cycle is dead.
212 // Otherwise if all of the incoming values are the same for the PHI, replace
213 // the PHI node with the incoming value.
216 bool HasUndefInput = false;
217 for (unsigned i = 0, e = getNumIncomingValues(); i != e; ++i)
218 if (isa<UndefValue>(getIncomingValue(i))) {
219 HasUndefInput = true;
220 } else if (getIncomingValue(i) != this) { // Not the PHI node itself...
221 if (InVal && getIncomingValue(i) != InVal)
222 return 0; // Not the same, bail out.
224 InVal = getIncomingValue(i);
227 // The only case that could cause InVal to be null is if we have a PHI node
228 // that only has entries for itself. In this case, there is no entry into the
229 // loop, so kill the PHI.
231 if (InVal == 0) InVal = UndefValue::get(getType());
233 // If we have a PHI node like phi(X, undef, X), where X is defined by some
234 // instruction, we cannot always return X as the result of the PHI node. Only
235 // do this if X is not an instruction (thus it must dominate the PHI block),
236 // or if the client is prepared to deal with this possibility.
237 if (HasUndefInput && !AllowNonDominatingInstruction)
238 if (Instruction *IV = dyn_cast<Instruction>(InVal))
239 // If it's in the entry block, it dominates everything.
240 if (IV->getParent() != &IV->getParent()->getParent()->getEntryBlock() ||
242 return 0; // Cannot guarantee that InVal dominates this PHINode.
244 // All of the incoming values are the same, return the value now.
249 //===----------------------------------------------------------------------===//
250 // CallInst Implementation
251 //===----------------------------------------------------------------------===//
253 CallInst::~CallInst() {
256 void CallInst::init(Value *Func, Value* const *Params, unsigned NumParams) {
257 assert(NumOperands == NumParams+1 && "NumOperands not set up?");
258 Use *OL = OperandList;
261 const FunctionType *FTy =
262 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
263 FTy = FTy; // silence warning.
265 assert((NumParams == FTy->getNumParams() ||
266 (FTy->isVarArg() && NumParams > FTy->getNumParams())) &&
267 "Calling a function with bad signature!");
268 for (unsigned i = 0; i != NumParams; ++i) {
269 assert((i >= FTy->getNumParams() ||
270 FTy->getParamType(i) == Params[i]->getType()) &&
271 "Calling a function with a bad signature!");
276 void CallInst::init(Value *Func, Value *Actual1, Value *Actual2) {
277 assert(NumOperands == 3 && "NumOperands not set up?");
278 Use *OL = OperandList;
283 const FunctionType *FTy =
284 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
285 FTy = FTy; // silence warning.
287 assert((FTy->getNumParams() == 2 ||
288 (FTy->isVarArg() && FTy->getNumParams() < 2)) &&
289 "Calling a function with bad signature");
290 assert((0 >= FTy->getNumParams() ||
291 FTy->getParamType(0) == Actual1->getType()) &&
292 "Calling a function with a bad signature!");
293 assert((1 >= FTy->getNumParams() ||
294 FTy->getParamType(1) == Actual2->getType()) &&
295 "Calling a function with a bad signature!");
298 void CallInst::init(Value *Func, Value *Actual) {
299 assert(NumOperands == 2 && "NumOperands not set up?");
300 Use *OL = OperandList;
304 const FunctionType *FTy =
305 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
306 FTy = FTy; // silence warning.
308 assert((FTy->getNumParams() == 1 ||
309 (FTy->isVarArg() && FTy->getNumParams() == 0)) &&
310 "Calling a function with bad signature");
311 assert((0 == FTy->getNumParams() ||
312 FTy->getParamType(0) == Actual->getType()) &&
313 "Calling a function with a bad signature!");
316 void CallInst::init(Value *Func) {
317 assert(NumOperands == 1 && "NumOperands not set up?");
318 Use *OL = OperandList;
321 const FunctionType *FTy =
322 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
323 FTy = FTy; // silence warning.
325 assert(FTy->getNumParams() == 0 && "Calling a function with bad signature");
328 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
329 Instruction *InsertBefore)
330 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
331 ->getElementType())->getReturnType(),
333 OperandTraits<CallInst>::op_end(this) - 2,
339 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
340 BasicBlock *InsertAtEnd)
341 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
342 ->getElementType())->getReturnType(),
344 OperandTraits<CallInst>::op_end(this) - 2,
349 CallInst::CallInst(Value *Func, const std::string &Name,
350 Instruction *InsertBefore)
351 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
352 ->getElementType())->getReturnType(),
354 OperandTraits<CallInst>::op_end(this) - 1,
360 CallInst::CallInst(Value *Func, const std::string &Name,
361 BasicBlock *InsertAtEnd)
362 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
363 ->getElementType())->getReturnType(),
365 OperandTraits<CallInst>::op_end(this) - 1,
371 CallInst::CallInst(const CallInst &CI)
372 : Instruction(CI.getType(), Instruction::Call,
373 OperandTraits<CallInst>::op_end(this) - CI.getNumOperands(),
374 CI.getNumOperands()) {
375 setParamAttrs(CI.getParamAttrs());
376 SubclassData = CI.SubclassData;
377 Use *OL = OperandList;
378 Use *InOL = CI.OperandList;
379 for (unsigned i = 0, e = CI.getNumOperands(); i != e; ++i)
383 void CallInst::addParamAttr(unsigned i, ParameterAttributes attr) {
384 PAListPtr PAL = getParamAttrs();
385 PAL = PAL.addAttr(i, attr);
389 bool CallInst::paramHasAttr(unsigned i, ParameterAttributes attr) const {
390 if (ParamAttrs.paramHasAttr(i, attr))
392 if (const Function *F = getCalledFunction())
393 return F->paramHasAttr(i, attr);
397 void CallInst::setDoesNotThrow(bool doesNotThrow) {
398 PAListPtr PAL = getParamAttrs();
400 PAL = PAL.addAttr(0, ParamAttr::NoUnwind);
402 PAL = PAL.removeAttr(0, ParamAttr::NoUnwind);
407 //===----------------------------------------------------------------------===//
408 // InvokeInst Implementation
409 //===----------------------------------------------------------------------===//
411 void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
412 Value* const *Args, unsigned NumArgs) {
413 assert(NumOperands == 3+NumArgs && "NumOperands not set up?");
414 Use *OL = OperandList;
418 const FunctionType *FTy =
419 cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
420 FTy = FTy; // silence warning.
422 assert(((NumArgs == FTy->getNumParams()) ||
423 (FTy->isVarArg() && NumArgs > FTy->getNumParams())) &&
424 "Calling a function with bad signature");
426 for (unsigned i = 0, e = NumArgs; i != e; i++) {
427 assert((i >= FTy->getNumParams() ||
428 FTy->getParamType(i) == Args[i]->getType()) &&
429 "Invoking a function with a bad signature!");
435 InvokeInst::InvokeInst(const InvokeInst &II)
436 : TerminatorInst(II.getType(), Instruction::Invoke,
437 OperandTraits<InvokeInst>::op_end(this)
438 - II.getNumOperands(),
439 II.getNumOperands()) {
440 setParamAttrs(II.getParamAttrs());
441 SubclassData = II.SubclassData;
442 Use *OL = OperandList, *InOL = II.OperandList;
443 for (unsigned i = 0, e = II.getNumOperands(); i != e; ++i)
447 BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
448 return getSuccessor(idx);
450 unsigned InvokeInst::getNumSuccessorsV() const {
451 return getNumSuccessors();
453 void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
454 return setSuccessor(idx, B);
457 bool InvokeInst::paramHasAttr(unsigned i, ParameterAttributes attr) const {
458 if (ParamAttrs.paramHasAttr(i, attr))
460 if (const Function *F = getCalledFunction())
461 return F->paramHasAttr(i, attr);
465 void InvokeInst::addParamAttr(unsigned i, ParameterAttributes attr) {
466 PAListPtr PAL = getParamAttrs();
467 PAL = PAL.addAttr(i, attr);
471 void InvokeInst::setDoesNotThrow(bool doesNotThrow) {
472 PAListPtr PAL = getParamAttrs();
474 PAL = PAL.addAttr(0, ParamAttr::NoUnwind);
476 PAL = PAL.removeAttr(0, ParamAttr::NoUnwind);
481 //===----------------------------------------------------------------------===//
482 // ReturnInst Implementation
483 //===----------------------------------------------------------------------===//
485 ReturnInst::ReturnInst(const ReturnInst &RI)
486 : TerminatorInst(Type::VoidTy, Instruction::Ret,
487 OperandTraits<ReturnInst>::op_end(this)
488 - RI.getNumOperands(),
489 RI.getNumOperands()) {
490 unsigned N = RI.getNumOperands();
492 Op<0>() = RI.Op<0>();
494 Use *OL = OperandList;
495 for (unsigned i = 0; i < N; ++i)
496 OL[i] = RI.getOperand(i);
500 ReturnInst::ReturnInst(Value *retVal, Instruction *InsertBefore)
501 : TerminatorInst(Type::VoidTy, Instruction::Ret,
502 OperandTraits<ReturnInst>::op_end(this) - (retVal != 0),
503 retVal != 0, InsertBefore) {
507 ReturnInst::ReturnInst(Value *retVal, BasicBlock *InsertAtEnd)
508 : TerminatorInst(Type::VoidTy, Instruction::Ret,
509 OperandTraits<ReturnInst>::op_end(this) - (retVal != 0),
510 retVal != 0, InsertAtEnd) {
514 ReturnInst::ReturnInst(BasicBlock *InsertAtEnd)
515 : TerminatorInst(Type::VoidTy, Instruction::Ret,
516 OperandTraits<ReturnInst>::op_end(this),
520 ReturnInst::ReturnInst(Value * const* retVals, unsigned N,
521 Instruction *InsertBefore)
522 : TerminatorInst(Type::VoidTy, Instruction::Ret,
523 OperandTraits<ReturnInst>::op_end(this) - N,
528 ReturnInst::ReturnInst(Value * const* retVals, unsigned N,
529 BasicBlock *InsertAtEnd)
530 : TerminatorInst(Type::VoidTy, Instruction::Ret,
531 OperandTraits<ReturnInst>::op_end(this) - N,
537 void ReturnInst::init(Value * const* retVals, unsigned N) {
538 assert (N > 0 && "Invalid operands numbers in ReturnInst init");
541 if (NumOperands == 1) {
543 if (V->getType() == Type::VoidTy)
549 Use *OL = OperandList;
550 for (unsigned i = 0; i < NumOperands; ++i) {
551 Value *V = *retVals++;
552 assert(!isa<BasicBlock>(V) &&
553 "Cannot return basic block. Probably using the incorrect ctor");
558 unsigned ReturnInst::getNumSuccessorsV() const {
559 return getNumSuccessors();
562 /// Out-of-line ReturnInst method, put here so the C++ compiler can choose to
563 /// emit the vtable for the class in this translation unit.
564 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
565 assert(0 && "ReturnInst has no successors!");
568 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
569 assert(0 && "ReturnInst has no successors!");
574 ReturnInst::~ReturnInst() {
577 //===----------------------------------------------------------------------===//
578 // UnwindInst Implementation
579 //===----------------------------------------------------------------------===//
581 UnwindInst::UnwindInst(Instruction *InsertBefore)
582 : TerminatorInst(Type::VoidTy, Instruction::Unwind, 0, 0, InsertBefore) {
584 UnwindInst::UnwindInst(BasicBlock *InsertAtEnd)
585 : TerminatorInst(Type::VoidTy, Instruction::Unwind, 0, 0, InsertAtEnd) {
589 unsigned UnwindInst::getNumSuccessorsV() const {
590 return getNumSuccessors();
593 void UnwindInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
594 assert(0 && "UnwindInst has no successors!");
597 BasicBlock *UnwindInst::getSuccessorV(unsigned idx) const {
598 assert(0 && "UnwindInst has no successors!");
603 //===----------------------------------------------------------------------===//
604 // UnreachableInst Implementation
605 //===----------------------------------------------------------------------===//
607 UnreachableInst::UnreachableInst(Instruction *InsertBefore)
608 : TerminatorInst(Type::VoidTy, Instruction::Unreachable, 0, 0, InsertBefore) {
610 UnreachableInst::UnreachableInst(BasicBlock *InsertAtEnd)
611 : TerminatorInst(Type::VoidTy, Instruction::Unreachable, 0, 0, InsertAtEnd) {
614 unsigned UnreachableInst::getNumSuccessorsV() const {
615 return getNumSuccessors();
618 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
619 assert(0 && "UnwindInst has no successors!");
622 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
623 assert(0 && "UnwindInst has no successors!");
628 //===----------------------------------------------------------------------===//
629 // BranchInst Implementation
630 //===----------------------------------------------------------------------===//
632 void BranchInst::AssertOK() {
634 assert(getCondition()->getType() == Type::Int1Ty &&
635 "May only branch on boolean predicates!");
638 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
639 : TerminatorInst(Type::VoidTy, Instruction::Br,
640 OperandTraits<BranchInst>::op_end(this) - 1,
642 assert(IfTrue != 0 && "Branch destination may not be null!");
645 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
646 Instruction *InsertBefore)
647 : TerminatorInst(Type::VoidTy, Instruction::Br,
648 OperandTraits<BranchInst>::op_end(this) - 3,
658 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
659 : TerminatorInst(Type::VoidTy, Instruction::Br,
660 OperandTraits<BranchInst>::op_end(this) - 1,
662 assert(IfTrue != 0 && "Branch destination may not be null!");
666 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
667 BasicBlock *InsertAtEnd)
668 : TerminatorInst(Type::VoidTy, Instruction::Br,
669 OperandTraits<BranchInst>::op_end(this) - 3,
680 BranchInst::BranchInst(const BranchInst &BI) :
681 TerminatorInst(Type::VoidTy, Instruction::Br,
682 OperandTraits<BranchInst>::op_end(this) - BI.getNumOperands(),
683 BI.getNumOperands()) {
684 OperandList[0] = BI.getOperand(0);
685 if (BI.getNumOperands() != 1) {
686 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
687 OperandList[1] = BI.getOperand(1);
688 OperandList[2] = BI.getOperand(2);
692 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
693 return getSuccessor(idx);
695 unsigned BranchInst::getNumSuccessorsV() const {
696 return getNumSuccessors();
698 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
699 setSuccessor(idx, B);
703 //===----------------------------------------------------------------------===//
704 // AllocationInst Implementation
705 //===----------------------------------------------------------------------===//
707 static Value *getAISize(Value *Amt) {
709 Amt = ConstantInt::get(Type::Int32Ty, 1);
711 assert(!isa<BasicBlock>(Amt) &&
712 "Passed basic block into allocation size parameter! Use other ctor");
713 assert(Amt->getType() == Type::Int32Ty &&
714 "Malloc/Allocation array size is not a 32-bit integer!");
719 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
720 unsigned Align, const std::string &Name,
721 Instruction *InsertBefore)
722 : UnaryInstruction(PointerType::getUnqual(Ty), iTy, getAISize(ArraySize),
725 assert(Ty != Type::VoidTy && "Cannot allocate void!");
729 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
730 unsigned Align, const std::string &Name,
731 BasicBlock *InsertAtEnd)
732 : UnaryInstruction(PointerType::getUnqual(Ty), iTy, getAISize(ArraySize),
735 assert(Ty != Type::VoidTy && "Cannot allocate void!");
739 // Out of line virtual method, so the vtable, etc has a home.
740 AllocationInst::~AllocationInst() {
743 void AllocationInst::setAlignment(unsigned Align) {
744 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
745 SubclassData = Log2_32(Align) + 1;
746 assert(getAlignment() == Align && "Alignment representation error!");
749 bool AllocationInst::isArrayAllocation() const {
750 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
751 return CI->getZExtValue() != 1;
755 const Type *AllocationInst::getAllocatedType() const {
756 return getType()->getElementType();
759 AllocaInst::AllocaInst(const AllocaInst &AI)
760 : AllocationInst(AI.getType()->getElementType(), (Value*)AI.getOperand(0),
761 Instruction::Alloca, AI.getAlignment()) {
764 MallocInst::MallocInst(const MallocInst &MI)
765 : AllocationInst(MI.getType()->getElementType(), (Value*)MI.getOperand(0),
766 Instruction::Malloc, MI.getAlignment()) {
769 //===----------------------------------------------------------------------===//
770 // FreeInst Implementation
771 //===----------------------------------------------------------------------===//
773 void FreeInst::AssertOK() {
774 assert(isa<PointerType>(getOperand(0)->getType()) &&
775 "Can not free something of nonpointer type!");
778 FreeInst::FreeInst(Value *Ptr, Instruction *InsertBefore)
779 : UnaryInstruction(Type::VoidTy, Free, Ptr, InsertBefore) {
783 FreeInst::FreeInst(Value *Ptr, BasicBlock *InsertAtEnd)
784 : UnaryInstruction(Type::VoidTy, Free, Ptr, InsertAtEnd) {
789 //===----------------------------------------------------------------------===//
790 // LoadInst Implementation
791 //===----------------------------------------------------------------------===//
793 void LoadInst::AssertOK() {
794 assert(isa<PointerType>(getOperand(0)->getType()) &&
795 "Ptr must have pointer type.");
798 LoadInst::LoadInst(Value *Ptr, const std::string &Name, Instruction *InsertBef)
799 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
800 Load, Ptr, InsertBef) {
807 LoadInst::LoadInst(Value *Ptr, const std::string &Name, BasicBlock *InsertAE)
808 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
809 Load, Ptr, InsertAE) {
816 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
817 Instruction *InsertBef)
818 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
819 Load, Ptr, InsertBef) {
820 setVolatile(isVolatile);
826 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
827 unsigned Align, Instruction *InsertBef)
828 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
829 Load, Ptr, InsertBef) {
830 setVolatile(isVolatile);
836 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
837 unsigned Align, BasicBlock *InsertAE)
838 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
839 Load, Ptr, InsertAE) {
840 setVolatile(isVolatile);
846 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
847 BasicBlock *InsertAE)
848 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
849 Load, Ptr, InsertAE) {
850 setVolatile(isVolatile);
858 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
859 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
860 Load, Ptr, InsertBef) {
864 if (Name && Name[0]) setName(Name);
867 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
868 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
869 Load, Ptr, InsertAE) {
873 if (Name && Name[0]) setName(Name);
876 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
877 Instruction *InsertBef)
878 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
879 Load, Ptr, InsertBef) {
880 setVolatile(isVolatile);
883 if (Name && Name[0]) setName(Name);
886 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
887 BasicBlock *InsertAE)
888 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
889 Load, Ptr, InsertAE) {
890 setVolatile(isVolatile);
893 if (Name && Name[0]) setName(Name);
896 void LoadInst::setAlignment(unsigned Align) {
897 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
898 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
901 //===----------------------------------------------------------------------===//
902 // StoreInst Implementation
903 //===----------------------------------------------------------------------===//
905 void StoreInst::AssertOK() {
906 assert(isa<PointerType>(getOperand(1)->getType()) &&
907 "Ptr must have pointer type!");
908 assert(getOperand(0)->getType() ==
909 cast<PointerType>(getOperand(1)->getType())->getElementType()
910 && "Ptr must be a pointer to Val type!");
914 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
915 : Instruction(Type::VoidTy, Store,
916 OperandTraits<StoreInst>::op_begin(this),
917 OperandTraits<StoreInst>::operands(this),
926 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
927 : Instruction(Type::VoidTy, Store,
928 OperandTraits<StoreInst>::op_begin(this),
929 OperandTraits<StoreInst>::operands(this),
938 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
939 Instruction *InsertBefore)
940 : Instruction(Type::VoidTy, Store,
941 OperandTraits<StoreInst>::op_begin(this),
942 OperandTraits<StoreInst>::operands(this),
946 setVolatile(isVolatile);
951 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
952 unsigned Align, Instruction *InsertBefore)
953 : Instruction(Type::VoidTy, Store,
954 OperandTraits<StoreInst>::op_begin(this),
955 OperandTraits<StoreInst>::operands(this),
959 setVolatile(isVolatile);
964 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
965 unsigned Align, BasicBlock *InsertAtEnd)
966 : Instruction(Type::VoidTy, Store,
967 OperandTraits<StoreInst>::op_begin(this),
968 OperandTraits<StoreInst>::operands(this),
972 setVolatile(isVolatile);
977 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
978 BasicBlock *InsertAtEnd)
979 : Instruction(Type::VoidTy, Store,
980 OperandTraits<StoreInst>::op_begin(this),
981 OperandTraits<StoreInst>::operands(this),
985 setVolatile(isVolatile);
990 void StoreInst::setAlignment(unsigned Align) {
991 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
992 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
995 //===----------------------------------------------------------------------===//
996 // GetElementPtrInst Implementation
997 //===----------------------------------------------------------------------===//
999 static unsigned retrieveAddrSpace(const Value *Val) {
1000 return cast<PointerType>(Val->getType())->getAddressSpace();
1003 void GetElementPtrInst::init(Value *Ptr, Value* const *Idx, unsigned NumIdx,
1004 const std::string &Name) {
1005 assert(NumOperands == 1+NumIdx && "NumOperands not initialized?");
1006 Use *OL = OperandList;
1009 for (unsigned i = 0; i != NumIdx; ++i)
1015 void GetElementPtrInst::init(Value *Ptr, Value *Idx, const std::string &Name) {
1016 assert(NumOperands == 2 && "NumOperands not initialized?");
1017 Use *OL = OperandList;
1024 GetElementPtrInst::GetElementPtrInst(const GetElementPtrInst &GEPI)
1025 : Instruction(GEPI.getType(), GetElementPtr,
1026 OperandTraits<GetElementPtrInst>::op_end(this)
1027 - GEPI.getNumOperands(),
1028 GEPI.getNumOperands()) {
1029 Use *OL = OperandList;
1030 Use *GEPIOL = GEPI.OperandList;
1031 for (unsigned i = 0, E = NumOperands; i != E; ++i)
1035 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1036 const std::string &Name, Instruction *InBe)
1037 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx)),
1038 retrieveAddrSpace(Ptr)),
1040 OperandTraits<GetElementPtrInst>::op_end(this) - 2,
1042 init(Ptr, Idx, Name);
1045 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1046 const std::string &Name, BasicBlock *IAE)
1047 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx)),
1048 retrieveAddrSpace(Ptr)),
1050 OperandTraits<GetElementPtrInst>::op_end(this) - 2,
1052 init(Ptr, Idx, Name);
1055 // getIndexedType - Returns the type of the element that would be loaded with
1056 // a load instruction with the specified parameters.
1058 // A null type is returned if the indices are invalid for the specified
1061 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
1064 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
1065 if (!PTy) return 0; // Type isn't a pointer type!
1066 const Type *Agg = PTy->getElementType();
1068 // Handle the special case of the empty set index set...
1072 unsigned CurIdx = 1;
1073 for (; CurIdx != NumIdx; ++CurIdx) {
1074 const CompositeType *CT = dyn_cast<CompositeType>(Agg);
1075 if (!CT || isa<PointerType>(CT)) return 0;
1076 Value *Index = Idxs[CurIdx];
1077 if (!CT->indexValid(Index)) return 0;
1078 Agg = CT->getTypeAtIndex(Index);
1080 // If the new type forwards to another type, then it is in the middle
1081 // of being refined to another type (and hence, may have dropped all
1082 // references to what it was using before). So, use the new forwarded
1084 if (const Type *Ty = Agg->getForwardedType())
1087 return CurIdx == NumIdx ? Agg : 0;
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(V1->getType(), ShuffleVector,
1303 OperandTraits<ShuffleVectorInst>::op_begin(this),
1304 OperandTraits<ShuffleVectorInst>::operands(this),
1306 assert(isValidOperands(V1, V2, Mask) &&
1307 "Invalid shuffle vector instruction operands!");
1314 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1315 const std::string &Name,
1316 BasicBlock *InsertAtEnd)
1317 : Instruction(V1->getType(), ShuffleVector,
1318 OperandTraits<ShuffleVectorInst>::op_begin(this),
1319 OperandTraits<ShuffleVectorInst>::operands(this),
1321 assert(isValidOperands(V1, V2, Mask) &&
1322 "Invalid shuffle vector instruction operands!");
1330 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1331 const Value *Mask) {
1332 if (!isa<VectorType>(V1->getType()) ||
1333 V1->getType() != V2->getType())
1336 const VectorType *MaskTy = dyn_cast<VectorType>(Mask->getType());
1337 if (!isa<Constant>(Mask) || MaskTy == 0 ||
1338 MaskTy->getElementType() != Type::Int32Ty ||
1339 MaskTy->getNumElements() !=
1340 cast<VectorType>(V1->getType())->getNumElements())
1345 /// getMaskValue - Return the index from the shuffle mask for the specified
1346 /// output result. This is either -1 if the element is undef or a number less
1347 /// than 2*numelements.
1348 int ShuffleVectorInst::getMaskValue(unsigned i) const {
1349 const Constant *Mask = cast<Constant>(getOperand(2));
1350 if (isa<UndefValue>(Mask)) return -1;
1351 if (isa<ConstantAggregateZero>(Mask)) return 0;
1352 const ConstantVector *MaskCV = cast<ConstantVector>(Mask);
1353 assert(i < MaskCV->getNumOperands() && "Index out of range");
1355 if (isa<UndefValue>(MaskCV->getOperand(i)))
1357 return cast<ConstantInt>(MaskCV->getOperand(i))->getZExtValue();
1360 //===----------------------------------------------------------------------===//
1361 // InsertValueInst Class
1362 //===----------------------------------------------------------------------===//
1364 void InsertValueInst::init(Value *Agg, Value *Val, const unsigned *Idx,
1365 unsigned NumIdx, const std::string &Name) {
1366 assert(NumOperands == 2 && "NumOperands not initialized?");
1370 Indices.insert(Indices.end(), Idx, Idx + NumIdx);
1374 void InsertValueInst::init(Value *Agg, Value *Val, unsigned Idx,
1375 const std::string &Name) {
1376 assert(NumOperands == 2 && "NumOperands not initialized?");
1380 Indices.push_back(Idx);
1384 InsertValueInst::InsertValueInst(const InsertValueInst &IVI)
1385 : Instruction(IVI.getType(), InsertValue,
1386 OperandTraits<InsertValueInst>::op_begin(this), 2),
1387 Indices(IVI.Indices) {
1388 Op<0>() = IVI.getOperand(0);
1389 Op<1>() = IVI.getOperand(1);
1392 InsertValueInst::InsertValueInst(Value *Agg,
1395 const std::string &Name,
1396 Instruction *InsertBefore)
1397 : Instruction(Agg->getType(), InsertValue,
1398 OperandTraits<InsertValueInst>::op_begin(this),
1400 init(Agg, Val, Idx, Name);
1403 InsertValueInst::InsertValueInst(Value *Agg,
1406 const std::string &Name,
1407 BasicBlock *InsertAtEnd)
1408 : Instruction(Agg->getType(), InsertValue,
1409 OperandTraits<InsertValueInst>::op_begin(this),
1411 init(Agg, Val, Idx, Name);
1414 //===----------------------------------------------------------------------===//
1415 // ExtractValueInst Class
1416 //===----------------------------------------------------------------------===//
1418 void ExtractValueInst::init(const unsigned *Idx, unsigned NumIdx,
1419 const std::string &Name) {
1420 assert(NumOperands == 1 && "NumOperands not initialized?");
1422 Indices.insert(Indices.end(), Idx, Idx + NumIdx);
1426 void ExtractValueInst::init(unsigned Idx, const std::string &Name) {
1427 assert(NumOperands == 1 && "NumOperands not initialized?");
1429 Indices.push_back(Idx);
1433 ExtractValueInst::ExtractValueInst(const ExtractValueInst &EVI)
1434 : UnaryInstruction(EVI.getType(), ExtractValue, EVI.getOperand(0)),
1435 Indices(EVI.Indices) {
1438 // getIndexedType - Returns the type of the element that would be extracted
1439 // with an extractvalue instruction with the specified parameters.
1441 // A null type is returned if the indices are invalid for the specified
1444 const Type* ExtractValueInst::getIndexedType(const Type *Agg,
1445 const unsigned *Idxs,
1447 unsigned CurIdx = 0;
1448 for (; CurIdx != NumIdx; ++CurIdx) {
1449 const CompositeType *CT = dyn_cast<CompositeType>(Agg);
1450 if (!CT || isa<PointerType>(CT) || isa<VectorType>(CT)) return 0;
1451 unsigned Index = Idxs[CurIdx];
1452 if (!CT->indexValid(Index)) return 0;
1453 Agg = CT->getTypeAtIndex(Index);
1455 // If the new type forwards to another type, then it is in the middle
1456 // of being refined to another type (and hence, may have dropped all
1457 // references to what it was using before). So, use the new forwarded
1459 if (const Type *Ty = Agg->getForwardedType())
1462 return CurIdx == NumIdx ? Agg : 0;
1465 const Type* ExtractValueInst::getIndexedType(const Type *Agg,
1467 return getIndexedType(Agg, &Idx, 1);
1470 ExtractValueInst::ExtractValueInst(Value *Agg,
1472 const std::string &Name,
1473 BasicBlock *InsertAtEnd)
1474 : UnaryInstruction(checkType(getIndexedType(Agg->getType(), &Idx, 1)),
1475 ExtractValue, Agg, InsertAtEnd) {
1479 ExtractValueInst::ExtractValueInst(Value *Agg,
1481 const std::string &Name,
1482 Instruction *InsertBefore)
1483 : UnaryInstruction(checkType(getIndexedType(Agg->getType(), &Idx, 1)),
1484 ExtractValue, Agg, InsertBefore) {
1488 //===----------------------------------------------------------------------===//
1489 // BinaryOperator Class
1490 //===----------------------------------------------------------------------===//
1492 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1493 const Type *Ty, const std::string &Name,
1494 Instruction *InsertBefore)
1495 : Instruction(Ty, iType,
1496 OperandTraits<BinaryOperator>::op_begin(this),
1497 OperandTraits<BinaryOperator>::operands(this),
1505 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1506 const Type *Ty, const std::string &Name,
1507 BasicBlock *InsertAtEnd)
1508 : Instruction(Ty, iType,
1509 OperandTraits<BinaryOperator>::op_begin(this),
1510 OperandTraits<BinaryOperator>::operands(this),
1519 void BinaryOperator::init(BinaryOps iType) {
1520 Value *LHS = getOperand(0), *RHS = getOperand(1);
1521 LHS = LHS; RHS = RHS; // Silence warnings.
1522 assert(LHS->getType() == RHS->getType() &&
1523 "Binary operator operand types must match!");
1528 assert(getType() == LHS->getType() &&
1529 "Arithmetic operation should return same type as operands!");
1530 assert((getType()->isInteger() || getType()->isFloatingPoint() ||
1531 isa<VectorType>(getType())) &&
1532 "Tried to create an arithmetic operation on a non-arithmetic type!");
1536 assert(getType() == LHS->getType() &&
1537 "Arithmetic operation should return same type as operands!");
1538 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1539 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1540 "Incorrect operand type (not integer) for S/UDIV");
1543 assert(getType() == LHS->getType() &&
1544 "Arithmetic operation should return same type as operands!");
1545 assert((getType()->isFloatingPoint() || (isa<VectorType>(getType()) &&
1546 cast<VectorType>(getType())->getElementType()->isFloatingPoint()))
1547 && "Incorrect operand type (not floating point) for FDIV");
1551 assert(getType() == LHS->getType() &&
1552 "Arithmetic operation should return same type as operands!");
1553 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1554 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1555 "Incorrect operand type (not integer) for S/UREM");
1558 assert(getType() == LHS->getType() &&
1559 "Arithmetic operation should return same type as operands!");
1560 assert((getType()->isFloatingPoint() || (isa<VectorType>(getType()) &&
1561 cast<VectorType>(getType())->getElementType()->isFloatingPoint()))
1562 && "Incorrect operand type (not floating point) for FREM");
1567 assert(getType() == LHS->getType() &&
1568 "Shift operation should return same type as operands!");
1569 assert(getType()->isInteger() &&
1570 "Shift operation requires integer operands");
1574 assert(getType() == LHS->getType() &&
1575 "Logical operation should return same type as operands!");
1576 assert((getType()->isInteger() ||
1577 (isa<VectorType>(getType()) &&
1578 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1579 "Tried to create a logical operation on a non-integral type!");
1587 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1588 const std::string &Name,
1589 Instruction *InsertBefore) {
1590 assert(S1->getType() == S2->getType() &&
1591 "Cannot create binary operator with two operands of differing type!");
1592 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1595 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
1596 const std::string &Name,
1597 BasicBlock *InsertAtEnd) {
1598 BinaryOperator *Res = Create(Op, S1, S2, Name);
1599 InsertAtEnd->getInstList().push_back(Res);
1603 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const std::string &Name,
1604 Instruction *InsertBefore) {
1605 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1606 return new BinaryOperator(Instruction::Sub,
1608 Op->getType(), Name, InsertBefore);
1611 BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const std::string &Name,
1612 BasicBlock *InsertAtEnd) {
1613 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1614 return new BinaryOperator(Instruction::Sub,
1616 Op->getType(), Name, InsertAtEnd);
1619 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const std::string &Name,
1620 Instruction *InsertBefore) {
1622 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1623 C = ConstantInt::getAllOnesValue(PTy->getElementType());
1624 C = ConstantVector::get(std::vector<Constant*>(PTy->getNumElements(), C));
1626 C = ConstantInt::getAllOnesValue(Op->getType());
1629 return new BinaryOperator(Instruction::Xor, Op, C,
1630 Op->getType(), Name, InsertBefore);
1633 BinaryOperator *BinaryOperator::CreateNot(Value *Op, const std::string &Name,
1634 BasicBlock *InsertAtEnd) {
1636 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1637 // Create a vector of all ones values.
1638 Constant *Elt = ConstantInt::getAllOnesValue(PTy->getElementType());
1640 ConstantVector::get(std::vector<Constant*>(PTy->getNumElements(), Elt));
1642 AllOnes = ConstantInt::getAllOnesValue(Op->getType());
1645 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1646 Op->getType(), Name, InsertAtEnd);
1650 // isConstantAllOnes - Helper function for several functions below
1651 static inline bool isConstantAllOnes(const Value *V) {
1652 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V))
1653 return CI->isAllOnesValue();
1654 if (const ConstantVector *CV = dyn_cast<ConstantVector>(V))
1655 return CV->isAllOnesValue();
1659 bool BinaryOperator::isNeg(const Value *V) {
1660 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1661 if (Bop->getOpcode() == Instruction::Sub)
1662 return Bop->getOperand(0) ==
1663 ConstantExpr::getZeroValueForNegationExpr(Bop->getType());
1667 bool BinaryOperator::isNot(const Value *V) {
1668 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1669 return (Bop->getOpcode() == Instruction::Xor &&
1670 (isConstantAllOnes(Bop->getOperand(1)) ||
1671 isConstantAllOnes(Bop->getOperand(0))));
1675 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1676 assert(isNeg(BinOp) && "getNegArgument from non-'neg' instruction!");
1677 return cast<BinaryOperator>(BinOp)->getOperand(1);
1680 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1681 return getNegArgument(const_cast<Value*>(BinOp));
1684 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1685 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1686 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1687 Value *Op0 = BO->getOperand(0);
1688 Value *Op1 = BO->getOperand(1);
1689 if (isConstantAllOnes(Op0)) return Op1;
1691 assert(isConstantAllOnes(Op1));
1695 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1696 return getNotArgument(const_cast<Value*>(BinOp));
1700 // swapOperands - Exchange the two operands to this instruction. This
1701 // instruction is safe to use on any binary instruction and does not
1702 // modify the semantics of the instruction. If the instruction is
1703 // order dependent (SetLT f.e.) the opcode is changed.
1705 bool BinaryOperator::swapOperands() {
1706 if (!isCommutative())
1707 return true; // Can't commute operands
1708 Op<0>().swap(Op<1>());
1712 //===----------------------------------------------------------------------===//
1714 //===----------------------------------------------------------------------===//
1716 // Just determine if this cast only deals with integral->integral conversion.
1717 bool CastInst::isIntegerCast() const {
1718 switch (getOpcode()) {
1719 default: return false;
1720 case Instruction::ZExt:
1721 case Instruction::SExt:
1722 case Instruction::Trunc:
1724 case Instruction::BitCast:
1725 return getOperand(0)->getType()->isInteger() && getType()->isInteger();
1729 bool CastInst::isLosslessCast() const {
1730 // Only BitCast can be lossless, exit fast if we're not BitCast
1731 if (getOpcode() != Instruction::BitCast)
1734 // Identity cast is always lossless
1735 const Type* SrcTy = getOperand(0)->getType();
1736 const Type* DstTy = getType();
1740 // Pointer to pointer is always lossless.
1741 if (isa<PointerType>(SrcTy))
1742 return isa<PointerType>(DstTy);
1743 return false; // Other types have no identity values
1746 /// This function determines if the CastInst does not require any bits to be
1747 /// changed in order to effect the cast. Essentially, it identifies cases where
1748 /// no code gen is necessary for the cast, hence the name no-op cast. For
1749 /// example, the following are all no-op casts:
1750 /// # bitcast i32* %x to i8*
1751 /// # bitcast <2 x i32> %x to <4 x i16>
1752 /// # ptrtoint i32* %x to i32 ; on 32-bit plaforms only
1753 /// @brief Determine if a cast is a no-op.
1754 bool CastInst::isNoopCast(const Type *IntPtrTy) const {
1755 switch (getOpcode()) {
1757 assert(!"Invalid CastOp");
1758 case Instruction::Trunc:
1759 case Instruction::ZExt:
1760 case Instruction::SExt:
1761 case Instruction::FPTrunc:
1762 case Instruction::FPExt:
1763 case Instruction::UIToFP:
1764 case Instruction::SIToFP:
1765 case Instruction::FPToUI:
1766 case Instruction::FPToSI:
1767 return false; // These always modify bits
1768 case Instruction::BitCast:
1769 return true; // BitCast never modifies bits.
1770 case Instruction::PtrToInt:
1771 return IntPtrTy->getPrimitiveSizeInBits() ==
1772 getType()->getPrimitiveSizeInBits();
1773 case Instruction::IntToPtr:
1774 return IntPtrTy->getPrimitiveSizeInBits() ==
1775 getOperand(0)->getType()->getPrimitiveSizeInBits();
1779 /// This function determines if a pair of casts can be eliminated and what
1780 /// opcode should be used in the elimination. This assumes that there are two
1781 /// instructions like this:
1782 /// * %F = firstOpcode SrcTy %x to MidTy
1783 /// * %S = secondOpcode MidTy %F to DstTy
1784 /// The function returns a resultOpcode so these two casts can be replaced with:
1785 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
1786 /// If no such cast is permited, the function returns 0.
1787 unsigned CastInst::isEliminableCastPair(
1788 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
1789 const Type *SrcTy, const Type *MidTy, const Type *DstTy, const Type *IntPtrTy)
1791 // Define the 144 possibilities for these two cast instructions. The values
1792 // in this matrix determine what to do in a given situation and select the
1793 // case in the switch below. The rows correspond to firstOp, the columns
1794 // correspond to secondOp. In looking at the table below, keep in mind
1795 // the following cast properties:
1797 // Size Compare Source Destination
1798 // Operator Src ? Size Type Sign Type Sign
1799 // -------- ------------ ------------------- ---------------------
1800 // TRUNC > Integer Any Integral Any
1801 // ZEXT < Integral Unsigned Integer Any
1802 // SEXT < Integral Signed Integer Any
1803 // FPTOUI n/a FloatPt n/a Integral Unsigned
1804 // FPTOSI n/a FloatPt n/a Integral Signed
1805 // UITOFP n/a Integral Unsigned FloatPt n/a
1806 // SITOFP n/a Integral Signed FloatPt n/a
1807 // FPTRUNC > FloatPt n/a FloatPt n/a
1808 // FPEXT < FloatPt n/a FloatPt n/a
1809 // PTRTOINT n/a Pointer n/a Integral Unsigned
1810 // INTTOPTR n/a Integral Unsigned Pointer n/a
1811 // BITCONVERT = FirstClass n/a FirstClass n/a
1813 // NOTE: some transforms are safe, but we consider them to be non-profitable.
1814 // For example, we could merge "fptoui double to uint" + "zext uint to ulong",
1815 // into "fptoui double to ulong", but this loses information about the range
1816 // of the produced value (we no longer know the top-part is all zeros).
1817 // Further this conversion is often much more expensive for typical hardware,
1818 // and causes issues when building libgcc. We disallow fptosi+sext for the
1820 const unsigned numCastOps =
1821 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
1822 static const uint8_t CastResults[numCastOps][numCastOps] = {
1823 // T F F U S F F P I B -+
1824 // R Z S P P I I T P 2 N T |
1825 // U E E 2 2 2 2 R E I T C +- secondOp
1826 // N X X U S F F N X N 2 V |
1827 // C T T I I P P C T T P T -+
1828 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
1829 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
1830 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
1831 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
1832 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
1833 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
1834 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
1835 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
1836 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
1837 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
1838 { 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
1839 { 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
1842 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
1843 [secondOp-Instruction::CastOpsBegin];
1846 // categorically disallowed
1849 // allowed, use first cast's opcode
1852 // allowed, use second cast's opcode
1855 // no-op cast in second op implies firstOp as long as the DestTy
1857 if (DstTy->isInteger())
1861 // no-op cast in second op implies firstOp as long as the DestTy
1862 // is floating point
1863 if (DstTy->isFloatingPoint())
1867 // no-op cast in first op implies secondOp as long as the SrcTy
1869 if (SrcTy->isInteger())
1873 // no-op cast in first op implies secondOp as long as the SrcTy
1874 // is a floating point
1875 if (SrcTy->isFloatingPoint())
1879 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size
1880 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1881 unsigned MidSize = MidTy->getPrimitiveSizeInBits();
1882 if (MidSize >= PtrSize)
1883 return Instruction::BitCast;
1887 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
1888 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
1889 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
1890 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1891 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1892 if (SrcSize == DstSize)
1893 return Instruction::BitCast;
1894 else if (SrcSize < DstSize)
1898 case 9: // zext, sext -> zext, because sext can't sign extend after zext
1899 return Instruction::ZExt;
1901 // fpext followed by ftrunc is allowed if the bit size returned to is
1902 // the same as the original, in which case its just a bitcast
1904 return Instruction::BitCast;
1905 return 0; // If the types are not the same we can't eliminate it.
1907 // bitcast followed by ptrtoint is allowed as long as the bitcast
1908 // is a pointer to pointer cast.
1909 if (isa<PointerType>(SrcTy) && isa<PointerType>(MidTy))
1913 // inttoptr, bitcast -> intptr if bitcast is a ptr to ptr cast
1914 if (isa<PointerType>(MidTy) && isa<PointerType>(DstTy))
1918 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
1919 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1920 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1921 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1922 if (SrcSize <= PtrSize && SrcSize == DstSize)
1923 return Instruction::BitCast;
1927 // cast combination can't happen (error in input). This is for all cases
1928 // where the MidTy is not the same for the two cast instructions.
1929 assert(!"Invalid Cast Combination");
1932 assert(!"Error in CastResults table!!!");
1938 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, const Type *Ty,
1939 const std::string &Name, Instruction *InsertBefore) {
1940 // Construct and return the appropriate CastInst subclass
1942 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
1943 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
1944 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
1945 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
1946 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
1947 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
1948 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
1949 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
1950 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
1951 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
1952 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
1953 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
1955 assert(!"Invalid opcode provided");
1960 CastInst *CastInst::Create(Instruction::CastOps op, Value *S, const Type *Ty,
1961 const std::string &Name, BasicBlock *InsertAtEnd) {
1962 // Construct and return the appropriate CastInst subclass
1964 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
1965 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
1966 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
1967 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
1968 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
1969 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
1970 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
1971 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
1972 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
1973 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
1974 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
1975 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
1977 assert(!"Invalid opcode provided");
1982 CastInst *CastInst::CreateZExtOrBitCast(Value *S, const Type *Ty,
1983 const std::string &Name,
1984 Instruction *InsertBefore) {
1985 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1986 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1987 return Create(Instruction::ZExt, S, Ty, Name, InsertBefore);
1990 CastInst *CastInst::CreateZExtOrBitCast(Value *S, const Type *Ty,
1991 const std::string &Name,
1992 BasicBlock *InsertAtEnd) {
1993 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1994 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1995 return Create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
1998 CastInst *CastInst::CreateSExtOrBitCast(Value *S, const Type *Ty,
1999 const std::string &Name,
2000 Instruction *InsertBefore) {
2001 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
2002 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2003 return Create(Instruction::SExt, S, Ty, Name, InsertBefore);
2006 CastInst *CastInst::CreateSExtOrBitCast(Value *S, const Type *Ty,
2007 const std::string &Name,
2008 BasicBlock *InsertAtEnd) {
2009 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
2010 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2011 return Create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
2014 CastInst *CastInst::CreateTruncOrBitCast(Value *S, const Type *Ty,
2015 const std::string &Name,
2016 Instruction *InsertBefore) {
2017 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
2018 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2019 return Create(Instruction::Trunc, S, Ty, Name, InsertBefore);
2022 CastInst *CastInst::CreateTruncOrBitCast(Value *S, const Type *Ty,
2023 const std::string &Name,
2024 BasicBlock *InsertAtEnd) {
2025 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
2026 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2027 return Create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
2030 CastInst *CastInst::CreatePointerCast(Value *S, const Type *Ty,
2031 const std::string &Name,
2032 BasicBlock *InsertAtEnd) {
2033 assert(isa<PointerType>(S->getType()) && "Invalid cast");
2034 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
2037 if (Ty->isInteger())
2038 return Create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
2039 return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
2042 /// @brief Create a BitCast or a PtrToInt cast instruction
2043 CastInst *CastInst::CreatePointerCast(Value *S, const Type *Ty,
2044 const std::string &Name,
2045 Instruction *InsertBefore) {
2046 assert(isa<PointerType>(S->getType()) && "Invalid cast");
2047 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
2050 if (Ty->isInteger())
2051 return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
2052 return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
2055 CastInst *CastInst::CreateIntegerCast(Value *C, const Type *Ty,
2056 bool isSigned, const std::string &Name,
2057 Instruction *InsertBefore) {
2058 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
2059 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
2060 unsigned DstBits = Ty->getPrimitiveSizeInBits();
2061 Instruction::CastOps opcode =
2062 (SrcBits == DstBits ? Instruction::BitCast :
2063 (SrcBits > DstBits ? Instruction::Trunc :
2064 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2065 return Create(opcode, C, Ty, Name, InsertBefore);
2068 CastInst *CastInst::CreateIntegerCast(Value *C, const Type *Ty,
2069 bool isSigned, const std::string &Name,
2070 BasicBlock *InsertAtEnd) {
2071 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
2072 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
2073 unsigned DstBits = Ty->getPrimitiveSizeInBits();
2074 Instruction::CastOps opcode =
2075 (SrcBits == DstBits ? Instruction::BitCast :
2076 (SrcBits > DstBits ? Instruction::Trunc :
2077 (isSigned ? Instruction::SExt : Instruction::ZExt)));
2078 return Create(opcode, C, Ty, Name, InsertAtEnd);
2081 CastInst *CastInst::CreateFPCast(Value *C, const Type *Ty,
2082 const std::string &Name,
2083 Instruction *InsertBefore) {
2084 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
2086 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
2087 unsigned DstBits = Ty->getPrimitiveSizeInBits();
2088 Instruction::CastOps opcode =
2089 (SrcBits == DstBits ? Instruction::BitCast :
2090 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2091 return Create(opcode, C, Ty, Name, InsertBefore);
2094 CastInst *CastInst::CreateFPCast(Value *C, const Type *Ty,
2095 const std::string &Name,
2096 BasicBlock *InsertAtEnd) {
2097 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
2099 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
2100 unsigned DstBits = Ty->getPrimitiveSizeInBits();
2101 Instruction::CastOps opcode =
2102 (SrcBits == DstBits ? Instruction::BitCast :
2103 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
2104 return Create(opcode, C, Ty, Name, InsertAtEnd);
2107 // Check whether it is valid to call getCastOpcode for these types.
2108 // This routine must be kept in sync with getCastOpcode.
2109 bool CastInst::isCastable(const Type *SrcTy, const Type *DestTy) {
2110 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
2113 if (SrcTy == DestTy)
2116 // Get the bit sizes, we'll need these
2117 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2118 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2120 // Run through the possibilities ...
2121 if (DestTy->isInteger()) { // Casting to integral
2122 if (SrcTy->isInteger()) { // Casting from integral
2124 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2126 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2127 // Casting from vector
2128 return DestBits == PTy->getBitWidth();
2129 } else { // Casting from something else
2130 return isa<PointerType>(SrcTy);
2132 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2133 if (SrcTy->isInteger()) { // Casting from integral
2135 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2137 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2138 // Casting from vector
2139 return DestBits == PTy->getBitWidth();
2140 } else { // Casting from something else
2143 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2144 // Casting to vector
2145 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2146 // Casting from vector
2147 return DestPTy->getBitWidth() == SrcPTy->getBitWidth();
2148 } else { // Casting from something else
2149 return DestPTy->getBitWidth() == SrcBits;
2151 } else if (isa<PointerType>(DestTy)) { // Casting to pointer
2152 if (isa<PointerType>(SrcTy)) { // Casting from pointer
2154 } else if (SrcTy->isInteger()) { // Casting from integral
2156 } else { // Casting from something else
2159 } else { // Casting to something else
2164 // Provide a way to get a "cast" where the cast opcode is inferred from the
2165 // types and size of the operand. This, basically, is a parallel of the
2166 // logic in the castIsValid function below. This axiom should hold:
2167 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
2168 // should not assert in castIsValid. In other words, this produces a "correct"
2169 // casting opcode for the arguments passed to it.
2170 // This routine must be kept in sync with isCastable.
2171 Instruction::CastOps
2172 CastInst::getCastOpcode(
2173 const Value *Src, bool SrcIsSigned, const Type *DestTy, bool DestIsSigned) {
2174 // Get the bit sizes, we'll need these
2175 const Type *SrcTy = Src->getType();
2176 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2177 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2179 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2180 "Only first class types are castable!");
2182 // Run through the possibilities ...
2183 if (DestTy->isInteger()) { // Casting to integral
2184 if (SrcTy->isInteger()) { // Casting from integral
2185 if (DestBits < SrcBits)
2186 return Trunc; // int -> smaller int
2187 else if (DestBits > SrcBits) { // its an extension
2189 return SExt; // signed -> SEXT
2191 return ZExt; // unsigned -> ZEXT
2193 return BitCast; // Same size, No-op cast
2195 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2197 return FPToSI; // FP -> sint
2199 return FPToUI; // FP -> uint
2200 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2201 assert(DestBits == PTy->getBitWidth() &&
2202 "Casting vector to integer of different width");
2203 return BitCast; // Same size, no-op cast
2205 assert(isa<PointerType>(SrcTy) &&
2206 "Casting from a value that is not first-class type");
2207 return PtrToInt; // ptr -> int
2209 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2210 if (SrcTy->isInteger()) { // Casting from integral
2212 return SIToFP; // sint -> FP
2214 return UIToFP; // uint -> FP
2215 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2216 if (DestBits < SrcBits) {
2217 return FPTrunc; // FP -> smaller FP
2218 } else if (DestBits > SrcBits) {
2219 return FPExt; // FP -> larger FP
2221 return BitCast; // same size, no-op cast
2223 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2224 assert(DestBits == PTy->getBitWidth() &&
2225 "Casting vector to floating point of different width");
2226 return BitCast; // same size, no-op cast
2228 assert(0 && "Casting pointer or non-first class to float");
2230 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2231 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2232 assert(DestPTy->getBitWidth() == SrcPTy->getBitWidth() &&
2233 "Casting vector to vector of different widths");
2234 return BitCast; // vector -> vector
2235 } else if (DestPTy->getBitWidth() == SrcBits) {
2236 return BitCast; // float/int -> vector
2238 assert(!"Illegal cast to vector (wrong type or size)");
2240 } else if (isa<PointerType>(DestTy)) {
2241 if (isa<PointerType>(SrcTy)) {
2242 return BitCast; // ptr -> ptr
2243 } else if (SrcTy->isInteger()) {
2244 return IntToPtr; // int -> ptr
2246 assert(!"Casting pointer to other than pointer or int");
2249 assert(!"Casting to type that is not first-class");
2252 // If we fall through to here we probably hit an assertion cast above
2253 // and assertions are not turned on. Anything we return is an error, so
2254 // BitCast is as good a choice as any.
2258 //===----------------------------------------------------------------------===//
2259 // CastInst SubClass Constructors
2260 //===----------------------------------------------------------------------===//
2262 /// Check that the construction parameters for a CastInst are correct. This
2263 /// could be broken out into the separate constructors but it is useful to have
2264 /// it in one place and to eliminate the redundant code for getting the sizes
2265 /// of the types involved.
2267 CastInst::castIsValid(Instruction::CastOps op, Value *S, const Type *DstTy) {
2269 // Check for type sanity on the arguments
2270 const Type *SrcTy = S->getType();
2271 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType())
2274 // Get the size of the types in bits, we'll need this later
2275 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
2276 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
2278 // Switch on the opcode provided
2280 default: return false; // This is an input error
2281 case Instruction::Trunc:
2282 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize > DstBitSize;
2283 case Instruction::ZExt:
2284 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize < DstBitSize;
2285 case Instruction::SExt:
2286 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize < DstBitSize;
2287 case Instruction::FPTrunc:
2288 return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
2289 SrcBitSize > DstBitSize;
2290 case Instruction::FPExt:
2291 return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
2292 SrcBitSize < DstBitSize;
2293 case Instruction::UIToFP:
2294 case Instruction::SIToFP:
2295 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2296 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2297 return SVTy->getElementType()->isInteger() &&
2298 DVTy->getElementType()->isFloatingPoint() &&
2299 SVTy->getNumElements() == DVTy->getNumElements();
2302 return SrcTy->isInteger() && DstTy->isFloatingPoint();
2303 case Instruction::FPToUI:
2304 case Instruction::FPToSI:
2305 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2306 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2307 return SVTy->getElementType()->isFloatingPoint() &&
2308 DVTy->getElementType()->isInteger() &&
2309 SVTy->getNumElements() == DVTy->getNumElements();
2312 return SrcTy->isFloatingPoint() && DstTy->isInteger();
2313 case Instruction::PtrToInt:
2314 return isa<PointerType>(SrcTy) && DstTy->isInteger();
2315 case Instruction::IntToPtr:
2316 return SrcTy->isInteger() && isa<PointerType>(DstTy);
2317 case Instruction::BitCast:
2318 // BitCast implies a no-op cast of type only. No bits change.
2319 // However, you can't cast pointers to anything but pointers.
2320 if (isa<PointerType>(SrcTy) != isa<PointerType>(DstTy))
2323 // Now we know we're not dealing with a pointer/non-pointer mismatch. In all
2324 // these cases, the cast is okay if the source and destination bit widths
2326 return SrcBitSize == DstBitSize;
2330 TruncInst::TruncInst(
2331 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2332 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2333 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2336 TruncInst::TruncInst(
2337 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2338 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2339 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2343 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2344 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2345 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2349 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2350 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2351 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2354 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2355 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2356 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2360 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2361 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2362 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2365 FPTruncInst::FPTruncInst(
2366 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2367 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2368 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2371 FPTruncInst::FPTruncInst(
2372 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2373 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2374 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2377 FPExtInst::FPExtInst(
2378 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2379 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2380 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2383 FPExtInst::FPExtInst(
2384 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2385 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2386 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2389 UIToFPInst::UIToFPInst(
2390 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2391 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2392 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2395 UIToFPInst::UIToFPInst(
2396 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2397 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2398 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2401 SIToFPInst::SIToFPInst(
2402 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2403 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2404 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2407 SIToFPInst::SIToFPInst(
2408 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2409 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2410 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2413 FPToUIInst::FPToUIInst(
2414 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2415 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2416 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2419 FPToUIInst::FPToUIInst(
2420 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2421 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2422 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2425 FPToSIInst::FPToSIInst(
2426 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2427 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2428 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2431 FPToSIInst::FPToSIInst(
2432 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2433 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2434 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2437 PtrToIntInst::PtrToIntInst(
2438 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2439 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2440 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2443 PtrToIntInst::PtrToIntInst(
2444 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2445 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2446 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2449 IntToPtrInst::IntToPtrInst(
2450 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2451 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2452 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2455 IntToPtrInst::IntToPtrInst(
2456 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2457 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2458 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2461 BitCastInst::BitCastInst(
2462 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2463 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2464 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2467 BitCastInst::BitCastInst(
2468 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2469 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2470 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2473 //===----------------------------------------------------------------------===//
2475 //===----------------------------------------------------------------------===//
2477 CmpInst::CmpInst(const Type *ty, OtherOps op, unsigned short predicate,
2478 Value *LHS, Value *RHS, const std::string &Name,
2479 Instruction *InsertBefore)
2480 : Instruction(ty, op,
2481 OperandTraits<CmpInst>::op_begin(this),
2482 OperandTraits<CmpInst>::operands(this),
2486 SubclassData = predicate;
2490 CmpInst::CmpInst(const Type *ty, OtherOps op, unsigned short predicate,
2491 Value *LHS, Value *RHS, const std::string &Name,
2492 BasicBlock *InsertAtEnd)
2493 : Instruction(ty, op,
2494 OperandTraits<CmpInst>::op_begin(this),
2495 OperandTraits<CmpInst>::operands(this),
2499 SubclassData = predicate;
2504 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2505 const std::string &Name, Instruction *InsertBefore) {
2506 if (Op == Instruction::ICmp) {
2507 return new ICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2510 if (Op == Instruction::FCmp) {
2511 return new FCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2514 if (Op == Instruction::VICmp) {
2515 return new VICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2518 return new VFCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2523 CmpInst::Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2524 const std::string &Name, BasicBlock *InsertAtEnd) {
2525 if (Op == Instruction::ICmp) {
2526 return new ICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2529 if (Op == Instruction::FCmp) {
2530 return new FCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2533 if (Op == Instruction::VICmp) {
2534 return new VICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2537 return new VFCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2541 void CmpInst::swapOperands() {
2542 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2545 cast<FCmpInst>(this)->swapOperands();
2548 bool CmpInst::isCommutative() {
2549 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2550 return IC->isCommutative();
2551 return cast<FCmpInst>(this)->isCommutative();
2554 bool CmpInst::isEquality() {
2555 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2556 return IC->isEquality();
2557 return cast<FCmpInst>(this)->isEquality();
2561 CmpInst::Predicate CmpInst::getInversePredicate(Predicate pred) {
2563 default: assert(!"Unknown cmp predicate!");
2564 case ICMP_EQ: return ICMP_NE;
2565 case ICMP_NE: return ICMP_EQ;
2566 case ICMP_UGT: return ICMP_ULE;
2567 case ICMP_ULT: return ICMP_UGE;
2568 case ICMP_UGE: return ICMP_ULT;
2569 case ICMP_ULE: return ICMP_UGT;
2570 case ICMP_SGT: return ICMP_SLE;
2571 case ICMP_SLT: return ICMP_SGE;
2572 case ICMP_SGE: return ICMP_SLT;
2573 case ICMP_SLE: return ICMP_SGT;
2575 case FCMP_OEQ: return FCMP_UNE;
2576 case FCMP_ONE: return FCMP_UEQ;
2577 case FCMP_OGT: return FCMP_ULE;
2578 case FCMP_OLT: return FCMP_UGE;
2579 case FCMP_OGE: return FCMP_ULT;
2580 case FCMP_OLE: return FCMP_UGT;
2581 case FCMP_UEQ: return FCMP_ONE;
2582 case FCMP_UNE: return FCMP_OEQ;
2583 case FCMP_UGT: return FCMP_OLE;
2584 case FCMP_ULT: return FCMP_OGE;
2585 case FCMP_UGE: return FCMP_OLT;
2586 case FCMP_ULE: return FCMP_OGT;
2587 case FCMP_ORD: return FCMP_UNO;
2588 case FCMP_UNO: return FCMP_ORD;
2589 case FCMP_TRUE: return FCMP_FALSE;
2590 case FCMP_FALSE: return FCMP_TRUE;
2594 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
2596 default: assert(! "Unknown icmp predicate!");
2597 case ICMP_EQ: case ICMP_NE:
2598 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2600 case ICMP_UGT: return ICMP_SGT;
2601 case ICMP_ULT: return ICMP_SLT;
2602 case ICMP_UGE: return ICMP_SGE;
2603 case ICMP_ULE: return ICMP_SLE;
2607 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
2609 default: assert(! "Unknown icmp predicate!");
2610 case ICMP_EQ: case ICMP_NE:
2611 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
2613 case ICMP_SGT: return ICMP_UGT;
2614 case ICMP_SLT: return ICMP_ULT;
2615 case ICMP_SGE: return ICMP_UGE;
2616 case ICMP_SLE: return ICMP_ULE;
2620 bool ICmpInst::isSignedPredicate(Predicate pred) {
2622 default: assert(! "Unknown icmp predicate!");
2623 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2625 case ICMP_EQ: case ICMP_NE: case ICMP_UGT: case ICMP_ULT:
2626 case ICMP_UGE: case ICMP_ULE:
2631 /// Initialize a set of values that all satisfy the condition with C.
2634 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
2637 uint32_t BitWidth = C.getBitWidth();
2639 default: assert(0 && "Invalid ICmp opcode to ConstantRange ctor!");
2640 case ICmpInst::ICMP_EQ: Upper++; break;
2641 case ICmpInst::ICMP_NE: Lower++; break;
2642 case ICmpInst::ICMP_ULT: Lower = APInt::getMinValue(BitWidth); break;
2643 case ICmpInst::ICMP_SLT: Lower = APInt::getSignedMinValue(BitWidth); break;
2644 case ICmpInst::ICMP_UGT:
2645 Lower++; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2647 case ICmpInst::ICMP_SGT:
2648 Lower++; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2650 case ICmpInst::ICMP_ULE:
2651 Lower = APInt::getMinValue(BitWidth); Upper++;
2653 case ICmpInst::ICMP_SLE:
2654 Lower = APInt::getSignedMinValue(BitWidth); Upper++;
2656 case ICmpInst::ICMP_UGE:
2657 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2659 case ICmpInst::ICMP_SGE:
2660 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2663 return ConstantRange(Lower, Upper);
2666 CmpInst::Predicate CmpInst::getSwappedPredicate(Predicate pred) {
2668 default: assert(!"Unknown cmp predicate!");
2669 case ICMP_EQ: case ICMP_NE:
2671 case ICMP_SGT: return ICMP_SLT;
2672 case ICMP_SLT: return ICMP_SGT;
2673 case ICMP_SGE: return ICMP_SLE;
2674 case ICMP_SLE: return ICMP_SGE;
2675 case ICMP_UGT: return ICMP_ULT;
2676 case ICMP_ULT: return ICMP_UGT;
2677 case ICMP_UGE: return ICMP_ULE;
2678 case ICMP_ULE: return ICMP_UGE;
2680 case FCMP_FALSE: case FCMP_TRUE:
2681 case FCMP_OEQ: case FCMP_ONE:
2682 case FCMP_UEQ: case FCMP_UNE:
2683 case FCMP_ORD: case FCMP_UNO:
2685 case FCMP_OGT: return FCMP_OLT;
2686 case FCMP_OLT: return FCMP_OGT;
2687 case FCMP_OGE: return FCMP_OLE;
2688 case FCMP_OLE: return FCMP_OGE;
2689 case FCMP_UGT: return FCMP_ULT;
2690 case FCMP_ULT: return FCMP_UGT;
2691 case FCMP_UGE: return FCMP_ULE;
2692 case FCMP_ULE: return FCMP_UGE;
2696 bool CmpInst::isUnsigned(unsigned short predicate) {
2697 switch (predicate) {
2698 default: return false;
2699 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
2700 case ICmpInst::ICMP_UGE: return true;
2704 bool CmpInst::isSigned(unsigned short predicate){
2705 switch (predicate) {
2706 default: return false;
2707 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
2708 case ICmpInst::ICMP_SGE: return true;
2712 bool CmpInst::isOrdered(unsigned short predicate) {
2713 switch (predicate) {
2714 default: return false;
2715 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
2716 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
2717 case FCmpInst::FCMP_ORD: return true;
2721 bool CmpInst::isUnordered(unsigned short predicate) {
2722 switch (predicate) {
2723 default: return false;
2724 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
2725 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
2726 case FCmpInst::FCMP_UNO: return true;
2730 //===----------------------------------------------------------------------===//
2731 // SwitchInst Implementation
2732 //===----------------------------------------------------------------------===//
2734 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumCases) {
2735 assert(Value && Default);
2736 ReservedSpace = 2+NumCases*2;
2738 OperandList = allocHungoffUses(ReservedSpace);
2740 OperandList[0] = Value;
2741 OperandList[1] = Default;
2744 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2745 /// switch on and a default destination. The number of additional cases can
2746 /// be specified here to make memory allocation more efficient. This
2747 /// constructor can also autoinsert before another instruction.
2748 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2749 Instruction *InsertBefore)
2750 : TerminatorInst(Type::VoidTy, Instruction::Switch, 0, 0, InsertBefore) {
2751 init(Value, Default, NumCases);
2754 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2755 /// switch on and a default destination. The number of additional cases can
2756 /// be specified here to make memory allocation more efficient. This
2757 /// constructor also autoinserts at the end of the specified BasicBlock.
2758 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2759 BasicBlock *InsertAtEnd)
2760 : TerminatorInst(Type::VoidTy, Instruction::Switch, 0, 0, InsertAtEnd) {
2761 init(Value, Default, NumCases);
2764 SwitchInst::SwitchInst(const SwitchInst &SI)
2765 : TerminatorInst(Type::VoidTy, Instruction::Switch,
2766 allocHungoffUses(SI.getNumOperands()), SI.getNumOperands()) {
2767 Use *OL = OperandList, *InOL = SI.OperandList;
2768 for (unsigned i = 0, E = SI.getNumOperands(); i != E; i+=2) {
2770 OL[i+1] = InOL[i+1];
2774 SwitchInst::~SwitchInst() {
2775 dropHungoffUses(OperandList);
2779 /// addCase - Add an entry to the switch instruction...
2781 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
2782 unsigned OpNo = NumOperands;
2783 if (OpNo+2 > ReservedSpace)
2784 resizeOperands(0); // Get more space!
2785 // Initialize some new operands.
2786 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
2787 NumOperands = OpNo+2;
2788 OperandList[OpNo] = OnVal;
2789 OperandList[OpNo+1] = Dest;
2792 /// removeCase - This method removes the specified successor from the switch
2793 /// instruction. Note that this cannot be used to remove the default
2794 /// destination (successor #0).
2796 void SwitchInst::removeCase(unsigned idx) {
2797 assert(idx != 0 && "Cannot remove the default case!");
2798 assert(idx*2 < getNumOperands() && "Successor index out of range!!!");
2800 unsigned NumOps = getNumOperands();
2801 Use *OL = OperandList;
2803 // Move everything after this operand down.
2805 // FIXME: we could just swap with the end of the list, then erase. However,
2806 // client might not expect this to happen. The code as it is thrashes the
2807 // use/def lists, which is kinda lame.
2808 for (unsigned i = (idx+1)*2; i != NumOps; i += 2) {
2810 OL[i-2+1] = OL[i+1];
2813 // Nuke the last value.
2814 OL[NumOps-2].set(0);
2815 OL[NumOps-2+1].set(0);
2816 NumOperands = NumOps-2;
2819 /// resizeOperands - resize operands - This adjusts the length of the operands
2820 /// list according to the following behavior:
2821 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
2822 /// of operation. This grows the number of ops by 3 times.
2823 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
2824 /// 3. If NumOps == NumOperands, trim the reserved space.
2826 void SwitchInst::resizeOperands(unsigned NumOps) {
2827 unsigned e = getNumOperands();
2830 } else if (NumOps*2 > NumOperands) {
2831 // No resize needed.
2832 if (ReservedSpace >= NumOps) return;
2833 } else if (NumOps == NumOperands) {
2834 if (ReservedSpace == NumOps) return;
2839 ReservedSpace = NumOps;
2840 Use *NewOps = allocHungoffUses(NumOps);
2841 Use *OldOps = OperandList;
2842 for (unsigned i = 0; i != e; ++i) {
2843 NewOps[i] = OldOps[i];
2845 OperandList = NewOps;
2846 if (OldOps) Use::zap(OldOps, OldOps + e, true);
2850 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
2851 return getSuccessor(idx);
2853 unsigned SwitchInst::getNumSuccessorsV() const {
2854 return getNumSuccessors();
2856 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
2857 setSuccessor(idx, B);
2860 //===----------------------------------------------------------------------===//
2861 // GetResultInst Implementation
2862 //===----------------------------------------------------------------------===//
2864 GetResultInst::GetResultInst(Value *Aggregate, unsigned Index,
2865 const std::string &Name,
2866 Instruction *InsertBef)
2867 : UnaryInstruction(cast<StructType>(Aggregate->getType())
2868 ->getElementType(Index),
2869 GetResult, Aggregate, InsertBef),
2871 assert(isValidOperands(Aggregate, Index)
2872 && "Invalid GetResultInst operands!");
2876 bool GetResultInst::isValidOperands(const Value *Aggregate, unsigned Index) {
2880 if (const StructType *STy = dyn_cast<StructType>(Aggregate->getType())) {
2881 unsigned NumElements = STy->getNumElements();
2882 if (Index >= NumElements || NumElements == 0)
2885 // getresult aggregate value's element types are restricted to
2886 // avoid nested aggregates.
2887 for (unsigned i = 0; i < NumElements; ++i)
2888 if (!STy->getElementType(i)->isFirstClassType())
2891 // Otherwise, Aggregate is valid.
2897 // Define these methods here so vtables don't get emitted into every translation
2898 // unit that uses these classes.
2900 GetElementPtrInst *GetElementPtrInst::clone() const {
2901 return new(getNumOperands()) GetElementPtrInst(*this);
2904 BinaryOperator *BinaryOperator::clone() const {
2905 return Create(getOpcode(), Op<0>(), Op<1>());
2908 FCmpInst* FCmpInst::clone() const {
2909 return new FCmpInst(getPredicate(), Op<0>(), Op<1>());
2911 ICmpInst* ICmpInst::clone() const {
2912 return new ICmpInst(getPredicate(), Op<0>(), Op<1>());
2915 VFCmpInst* VFCmpInst::clone() const {
2916 return new VFCmpInst(getPredicate(), Op<0>(), Op<1>());
2918 VICmpInst* VICmpInst::clone() const {
2919 return new VICmpInst(getPredicate(), Op<0>(), Op<1>());
2922 ExtractValueInst *ExtractValueInst::clone() const {
2923 return new ExtractValueInst(*this);
2925 InsertValueInst *InsertValueInst::clone() const {
2926 return new InsertValueInst(*this);
2930 MallocInst *MallocInst::clone() const { return new MallocInst(*this); }
2931 AllocaInst *AllocaInst::clone() const { return new AllocaInst(*this); }
2932 FreeInst *FreeInst::clone() const { return new FreeInst(getOperand(0)); }
2933 LoadInst *LoadInst::clone() const { return new LoadInst(*this); }
2934 StoreInst *StoreInst::clone() const { return new StoreInst(*this); }
2935 CastInst *TruncInst::clone() const { return new TruncInst(*this); }
2936 CastInst *ZExtInst::clone() const { return new ZExtInst(*this); }
2937 CastInst *SExtInst::clone() const { return new SExtInst(*this); }
2938 CastInst *FPTruncInst::clone() const { return new FPTruncInst(*this); }
2939 CastInst *FPExtInst::clone() const { return new FPExtInst(*this); }
2940 CastInst *UIToFPInst::clone() const { return new UIToFPInst(*this); }
2941 CastInst *SIToFPInst::clone() const { return new SIToFPInst(*this); }
2942 CastInst *FPToUIInst::clone() const { return new FPToUIInst(*this); }
2943 CastInst *FPToSIInst::clone() const { return new FPToSIInst(*this); }
2944 CastInst *PtrToIntInst::clone() const { return new PtrToIntInst(*this); }
2945 CastInst *IntToPtrInst::clone() const { return new IntToPtrInst(*this); }
2946 CastInst *BitCastInst::clone() const { return new BitCastInst(*this); }
2947 CallInst *CallInst::clone() const {
2948 return new(getNumOperands()) CallInst(*this);
2950 SelectInst *SelectInst::clone() const {
2951 return new(getNumOperands()) SelectInst(*this);
2953 VAArgInst *VAArgInst::clone() const { return new VAArgInst(*this); }
2955 ExtractElementInst *ExtractElementInst::clone() const {
2956 return new ExtractElementInst(*this);
2958 InsertElementInst *InsertElementInst::clone() const {
2959 return InsertElementInst::Create(*this);
2961 ShuffleVectorInst *ShuffleVectorInst::clone() const {
2962 return new ShuffleVectorInst(*this);
2964 PHINode *PHINode::clone() const { return new PHINode(*this); }
2965 ReturnInst *ReturnInst::clone() const {
2966 return new(getNumOperands()) ReturnInst(*this);
2968 BranchInst *BranchInst::clone() const {
2969 return new(getNumOperands()) BranchInst(*this);
2971 SwitchInst *SwitchInst::clone() const { return new SwitchInst(*this); }
2972 InvokeInst *InvokeInst::clone() const {
2973 return new(getNumOperands()) InvokeInst(*this);
2975 UnwindInst *UnwindInst::clone() const { return new UnwindInst(); }
2976 UnreachableInst *UnreachableInst::clone() const { return new UnreachableInst();}
2977 GetResultInst *GetResultInst::clone() const { return new GetResultInst(*this); }