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/BasicBlock.h"
16 #include "llvm/Constants.h"
17 #include "llvm/DerivedTypes.h"
18 #include "llvm/Function.h"
19 #include "llvm/Instructions.h"
20 #include "llvm/ParameterAttributes.h"
21 #include "llvm/Support/CallSite.h"
22 #include "llvm/Support/ConstantRange.h"
23 #include "llvm/Support/MathExtras.h"
26 //===----------------------------------------------------------------------===//
28 //===----------------------------------------------------------------------===//
30 CallSite::CallSite(Instruction *C) {
31 assert((isa<CallInst>(C) || isa<InvokeInst>(C)) && "Not a call!");
34 unsigned CallSite::getCallingConv() const {
35 if (CallInst *CI = dyn_cast<CallInst>(I))
36 return CI->getCallingConv();
38 return cast<InvokeInst>(I)->getCallingConv();
40 void CallSite::setCallingConv(unsigned CC) {
41 if (CallInst *CI = dyn_cast<CallInst>(I))
42 CI->setCallingConv(CC);
44 cast<InvokeInst>(I)->setCallingConv(CC);
46 const ParamAttrsList* CallSite::getParamAttrs() const {
47 if (CallInst *CI = dyn_cast<CallInst>(I))
48 return CI->getParamAttrs();
50 return cast<InvokeInst>(I)->getParamAttrs();
52 void CallSite::setParamAttrs(const ParamAttrsList *PAL) {
53 if (CallInst *CI = dyn_cast<CallInst>(I))
54 CI->setParamAttrs(PAL);
56 cast<InvokeInst>(I)->setParamAttrs(PAL);
58 bool CallSite::paramHasAttr(uint16_t i, ParameterAttributes attr) const {
59 if (CallInst *CI = dyn_cast<CallInst>(I))
60 return CI->paramHasAttr(i, attr);
62 return cast<InvokeInst>(I)->paramHasAttr(i, attr);
64 uint16_t CallSite::getParamAlignment(uint16_t i) const {
65 if (CallInst *CI = dyn_cast<CallInst>(I))
66 return CI->getParamAlignment(i);
68 return cast<InvokeInst>(I)->getParamAlignment(i);
71 bool CallSite::doesNotAccessMemory() const {
72 if (CallInst *CI = dyn_cast<CallInst>(I))
73 return CI->doesNotAccessMemory();
75 return cast<InvokeInst>(I)->doesNotAccessMemory();
77 bool CallSite::onlyReadsMemory() const {
78 if (CallInst *CI = dyn_cast<CallInst>(I))
79 return CI->onlyReadsMemory();
81 return cast<InvokeInst>(I)->onlyReadsMemory();
83 bool CallSite::doesNotThrow() const {
84 if (CallInst *CI = dyn_cast<CallInst>(I))
85 return CI->doesNotThrow();
87 return cast<InvokeInst>(I)->doesNotThrow();
89 void CallSite::setDoesNotThrow(bool doesNotThrow) {
90 if (CallInst *CI = dyn_cast<CallInst>(I))
91 CI->setDoesNotThrow(doesNotThrow);
93 cast<InvokeInst>(I)->setDoesNotThrow(doesNotThrow);
96 //===----------------------------------------------------------------------===//
97 // TerminatorInst Class
98 //===----------------------------------------------------------------------===//
100 // Out of line virtual method, so the vtable, etc has a home.
101 TerminatorInst::~TerminatorInst() {
104 // Out of line virtual method, so the vtable, etc has a home.
105 UnaryInstruction::~UnaryInstruction() {
109 //===----------------------------------------------------------------------===//
111 //===----------------------------------------------------------------------===//
113 PHINode::PHINode(const PHINode &PN)
114 : Instruction(PN.getType(), Instruction::PHI,
115 new Use[PN.getNumOperands()], PN.getNumOperands()),
116 ReservedSpace(PN.getNumOperands()) {
117 Use *OL = OperandList;
118 for (unsigned i = 0, e = PN.getNumOperands(); i != e; i+=2) {
119 OL[i].init(PN.getOperand(i), this);
120 OL[i+1].init(PN.getOperand(i+1), this);
124 PHINode::~PHINode() {
125 delete [] OperandList;
128 // removeIncomingValue - Remove an incoming value. This is useful if a
129 // predecessor basic block is deleted.
130 Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
131 unsigned NumOps = getNumOperands();
132 Use *OL = OperandList;
133 assert(Idx*2 < NumOps && "BB not in PHI node!");
134 Value *Removed = OL[Idx*2];
136 // Move everything after this operand down.
138 // FIXME: we could just swap with the end of the list, then erase. However,
139 // client might not expect this to happen. The code as it is thrashes the
140 // use/def lists, which is kinda lame.
141 for (unsigned i = (Idx+1)*2; i != NumOps; i += 2) {
146 // Nuke the last value.
148 OL[NumOps-2+1].set(0);
149 NumOperands = NumOps-2;
151 // If the PHI node is dead, because it has zero entries, nuke it now.
152 if (NumOps == 2 && DeletePHIIfEmpty) {
153 // If anyone is using this PHI, make them use a dummy value instead...
154 replaceAllUsesWith(UndefValue::get(getType()));
160 /// resizeOperands - resize operands - This adjusts the length of the operands
161 /// list according to the following behavior:
162 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
163 /// of operation. This grows the number of ops by 1.5 times.
164 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
165 /// 3. If NumOps == NumOperands, trim the reserved space.
167 void PHINode::resizeOperands(unsigned NumOps) {
169 NumOps = (getNumOperands())*3/2;
170 if (NumOps < 4) NumOps = 4; // 4 op PHI nodes are VERY common.
171 } else if (NumOps*2 > NumOperands) {
173 if (ReservedSpace >= NumOps) return;
174 } else if (NumOps == NumOperands) {
175 if (ReservedSpace == NumOps) return;
180 ReservedSpace = NumOps;
181 Use *NewOps = new Use[NumOps];
182 Use *OldOps = OperandList;
183 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
184 NewOps[i].init(OldOps[i], this);
188 OperandList = NewOps;
191 /// hasConstantValue - If the specified PHI node always merges together the same
192 /// value, return the value, otherwise return null.
194 Value *PHINode::hasConstantValue(bool AllowNonDominatingInstruction) const {
195 // If the PHI node only has one incoming value, eliminate the PHI node...
196 if (getNumIncomingValues() == 1) {
197 if (getIncomingValue(0) != this) // not X = phi X
198 return getIncomingValue(0);
200 return UndefValue::get(getType()); // Self cycle is dead.
203 // Otherwise if all of the incoming values are the same for the PHI, replace
204 // the PHI node with the incoming value.
207 bool HasUndefInput = false;
208 for (unsigned i = 0, e = getNumIncomingValues(); i != e; ++i)
209 if (isa<UndefValue>(getIncomingValue(i))) {
210 HasUndefInput = true;
211 } else if (getIncomingValue(i) != this) { // Not the PHI node itself...
212 if (InVal && getIncomingValue(i) != InVal)
213 return 0; // Not the same, bail out.
215 InVal = getIncomingValue(i);
218 // The only case that could cause InVal to be null is if we have a PHI node
219 // that only has entries for itself. In this case, there is no entry into the
220 // loop, so kill the PHI.
222 if (InVal == 0) InVal = UndefValue::get(getType());
224 // If we have a PHI node like phi(X, undef, X), where X is defined by some
225 // instruction, we cannot always return X as the result of the PHI node. Only
226 // do this if X is not an instruction (thus it must dominate the PHI block),
227 // or if the client is prepared to deal with this possibility.
228 if (HasUndefInput && !AllowNonDominatingInstruction)
229 if (Instruction *IV = dyn_cast<Instruction>(InVal))
230 // If it's in the entry block, it dominates everything.
231 if (IV->getParent() != &IV->getParent()->getParent()->getEntryBlock() ||
233 return 0; // Cannot guarantee that InVal dominates this PHINode.
235 // All of the incoming values are the same, return the value now.
240 //===----------------------------------------------------------------------===//
241 // CallInst Implementation
242 //===----------------------------------------------------------------------===//
244 CallInst::~CallInst() {
245 delete [] OperandList;
247 ParamAttrs->dropRef();
250 void CallInst::init(Value *Func, Value* const *Params, unsigned NumParams) {
252 NumOperands = NumParams+1;
253 Use *OL = OperandList = new Use[NumParams+1];
254 OL[0].init(Func, this);
256 const FunctionType *FTy =
257 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
258 FTy = FTy; // silence warning.
260 assert((NumParams == FTy->getNumParams() ||
261 (FTy->isVarArg() && NumParams > FTy->getNumParams())) &&
262 "Calling a function with bad signature!");
263 for (unsigned i = 0; i != NumParams; ++i) {
264 assert((i >= FTy->getNumParams() ||
265 FTy->getParamType(i) == Params[i]->getType()) &&
266 "Calling a function with a bad signature!");
267 OL[i+1].init(Params[i], this);
271 void CallInst::init(Value *Func, Value *Actual1, Value *Actual2) {
274 Use *OL = OperandList = new Use[3];
275 OL[0].init(Func, this);
276 OL[1].init(Actual1, this);
277 OL[2].init(Actual2, this);
279 const FunctionType *FTy =
280 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
281 FTy = FTy; // silence warning.
283 assert((FTy->getNumParams() == 2 ||
284 (FTy->isVarArg() && FTy->getNumParams() < 2)) &&
285 "Calling a function with bad signature");
286 assert((0 >= FTy->getNumParams() ||
287 FTy->getParamType(0) == Actual1->getType()) &&
288 "Calling a function with a bad signature!");
289 assert((1 >= FTy->getNumParams() ||
290 FTy->getParamType(1) == Actual2->getType()) &&
291 "Calling a function with a bad signature!");
294 void CallInst::init(Value *Func, Value *Actual) {
297 Use *OL = OperandList = new Use[2];
298 OL[0].init(Func, this);
299 OL[1].init(Actual, this);
301 const FunctionType *FTy =
302 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
303 FTy = FTy; // silence warning.
305 assert((FTy->getNumParams() == 1 ||
306 (FTy->isVarArg() && FTy->getNumParams() == 0)) &&
307 "Calling a function with bad signature");
308 assert((0 == FTy->getNumParams() ||
309 FTy->getParamType(0) == Actual->getType()) &&
310 "Calling a function with a bad signature!");
313 void CallInst::init(Value *Func) {
316 Use *OL = OperandList = new Use[1];
317 OL[0].init(Func, this);
319 const FunctionType *FTy =
320 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
321 FTy = FTy; // silence warning.
323 assert(FTy->getNumParams() == 0 && "Calling a function with bad signature");
326 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
327 Instruction *InsertBefore)
328 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
329 ->getElementType())->getReturnType(),
330 Instruction::Call, 0, 0, InsertBefore) {
335 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
336 BasicBlock *InsertAtEnd)
337 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
338 ->getElementType())->getReturnType(),
339 Instruction::Call, 0, 0, InsertAtEnd) {
343 CallInst::CallInst(Value *Func, const std::string &Name,
344 Instruction *InsertBefore)
345 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
346 ->getElementType())->getReturnType(),
347 Instruction::Call, 0, 0, InsertBefore) {
352 CallInst::CallInst(Value *Func, const std::string &Name,
353 BasicBlock *InsertAtEnd)
354 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
355 ->getElementType())->getReturnType(),
356 Instruction::Call, 0, 0, InsertAtEnd) {
361 CallInst::CallInst(const CallInst &CI)
362 : Instruction(CI.getType(), Instruction::Call, new Use[CI.getNumOperands()],
363 CI.getNumOperands()),
365 setParamAttrs(CI.getParamAttrs());
366 SubclassData = CI.SubclassData;
367 Use *OL = OperandList;
368 Use *InOL = CI.OperandList;
369 for (unsigned i = 0, e = CI.getNumOperands(); i != e; ++i)
370 OL[i].init(InOL[i], this);
373 void CallInst::setParamAttrs(const ParamAttrsList *newAttrs) {
374 if (ParamAttrs == newAttrs)
378 ParamAttrs->dropRef();
383 ParamAttrs = newAttrs;
386 bool CallInst::paramHasAttr(uint16_t i, ParameterAttributes attr) const {
387 if (ParamAttrs && ParamAttrs->paramHasAttr(i, attr))
389 if (const Function *F = getCalledFunction())
390 return F->paramHasAttr(i, attr);
394 uint16_t CallInst::getParamAlignment(uint16_t i) const {
395 if (ParamAttrs && ParamAttrs->getParamAlignment(i))
396 return ParamAttrs->getParamAlignment(i);
397 if (const Function *F = getCalledFunction())
398 return F->getParamAlignment(i);
402 /// @brief Determine if the call does not access memory.
403 bool CallInst::doesNotAccessMemory() const {
404 return paramHasAttr(0, ParamAttr::ReadNone);
407 /// @brief Determine if the call does not access or only reads memory.
408 bool CallInst::onlyReadsMemory() const {
409 return doesNotAccessMemory() || paramHasAttr(0, ParamAttr::ReadOnly);
412 /// @brief Determine if the call cannot return.
413 bool CallInst::doesNotReturn() const {
414 return paramHasAttr(0, ParamAttr::NoReturn);
417 /// @brief Determine if the call cannot unwind.
418 bool CallInst::doesNotThrow() const {
419 return paramHasAttr(0, ParamAttr::NoUnwind);
422 /// @brief Determine if the call returns a structure.
423 bool CallInst::isStructReturn() const {
424 // Be friendly and also check the callee.
425 return paramHasAttr(1, ParamAttr::StructRet);
428 /// @brief Determine if any call argument is an aggregate passed by value.
429 bool CallInst::hasByValArgument() const {
430 if (ParamAttrs && ParamAttrs->hasAttrSomewhere(ParamAttr::ByVal))
432 // Be consistent with other methods and check the callee too.
433 if (const Function *F = getCalledFunction())
434 if (const ParamAttrsList *PAL = F->getParamAttrs())
435 return PAL->hasAttrSomewhere(ParamAttr::ByVal);
439 void CallInst::setDoesNotThrow(bool doesNotThrow) {
440 const ParamAttrsList *PAL = getParamAttrs();
442 PAL = ParamAttrsList::includeAttrs(PAL, 0, ParamAttr::NoUnwind);
444 PAL = ParamAttrsList::excludeAttrs(PAL, 0, ParamAttr::NoUnwind);
449 //===----------------------------------------------------------------------===//
450 // InvokeInst Implementation
451 //===----------------------------------------------------------------------===//
453 InvokeInst::~InvokeInst() {
454 delete [] OperandList;
456 ParamAttrs->dropRef();
459 void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
460 Value* const *Args, unsigned NumArgs) {
462 NumOperands = 3+NumArgs;
463 Use *OL = OperandList = new Use[3+NumArgs];
464 OL[0].init(Fn, this);
465 OL[1].init(IfNormal, this);
466 OL[2].init(IfException, this);
467 const FunctionType *FTy =
468 cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
469 FTy = FTy; // silence warning.
471 assert(((NumArgs == FTy->getNumParams()) ||
472 (FTy->isVarArg() && NumArgs > FTy->getNumParams())) &&
473 "Calling a function with bad signature");
475 for (unsigned i = 0, e = NumArgs; i != e; i++) {
476 assert((i >= FTy->getNumParams() ||
477 FTy->getParamType(i) == Args[i]->getType()) &&
478 "Invoking a function with a bad signature!");
480 OL[i+3].init(Args[i], this);
484 InvokeInst::InvokeInst(const InvokeInst &II)
485 : TerminatorInst(II.getType(), Instruction::Invoke,
486 new Use[II.getNumOperands()], II.getNumOperands()),
488 setParamAttrs(II.getParamAttrs());
489 SubclassData = II.SubclassData;
490 Use *OL = OperandList, *InOL = II.OperandList;
491 for (unsigned i = 0, e = II.getNumOperands(); i != e; ++i)
492 OL[i].init(InOL[i], this);
495 BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
496 return getSuccessor(idx);
498 unsigned InvokeInst::getNumSuccessorsV() const {
499 return getNumSuccessors();
501 void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
502 return setSuccessor(idx, B);
505 void InvokeInst::setParamAttrs(const ParamAttrsList *newAttrs) {
506 if (ParamAttrs == newAttrs)
510 ParamAttrs->dropRef();
515 ParamAttrs = newAttrs;
518 bool InvokeInst::paramHasAttr(uint16_t i, ParameterAttributes attr) const {
519 if (ParamAttrs && ParamAttrs->paramHasAttr(i, attr))
521 if (const Function *F = getCalledFunction())
522 return F->paramHasAttr(i, attr);
526 uint16_t InvokeInst::getParamAlignment(uint16_t i) const {
527 if (ParamAttrs && ParamAttrs->getParamAlignment(i))
528 return ParamAttrs->getParamAlignment(i);
529 if (const Function *F = getCalledFunction())
530 return F->getParamAlignment(i);
534 /// @brief Determine if the call does not access memory.
535 bool InvokeInst::doesNotAccessMemory() const {
536 return paramHasAttr(0, ParamAttr::ReadNone);
539 /// @brief Determine if the call does not access or only reads memory.
540 bool InvokeInst::onlyReadsMemory() const {
541 return doesNotAccessMemory() || paramHasAttr(0, ParamAttr::ReadOnly);
544 /// @brief Determine if the call cannot return.
545 bool InvokeInst::doesNotReturn() const {
546 return paramHasAttr(0, ParamAttr::NoReturn);
549 /// @brief Determine if the call cannot unwind.
550 bool InvokeInst::doesNotThrow() const {
551 return paramHasAttr(0, ParamAttr::NoUnwind);
554 void InvokeInst::setDoesNotThrow(bool doesNotThrow) {
555 const ParamAttrsList *PAL = getParamAttrs();
557 PAL = ParamAttrsList::includeAttrs(PAL, 0, ParamAttr::NoUnwind);
559 PAL = ParamAttrsList::excludeAttrs(PAL, 0, ParamAttr::NoUnwind);
563 /// @brief Determine if the call returns a structure.
564 bool InvokeInst::isStructReturn() const {
565 // Be friendly and also check the callee.
566 return paramHasAttr(1, ParamAttr::StructRet);
570 //===----------------------------------------------------------------------===//
571 // ReturnInst Implementation
572 //===----------------------------------------------------------------------===//
574 ReturnInst::ReturnInst(const ReturnInst &RI)
575 : TerminatorInst(Type::VoidTy, Instruction::Ret,
576 &RetVal, RI.getNumOperands()) {
577 if (RI.getNumOperands())
578 RetVal.init(RI.RetVal, this);
581 ReturnInst::ReturnInst(Value *retVal, Instruction *InsertBefore)
582 : TerminatorInst(Type::VoidTy, Instruction::Ret, &RetVal, 0, InsertBefore) {
585 ReturnInst::ReturnInst(Value *retVal, BasicBlock *InsertAtEnd)
586 : TerminatorInst(Type::VoidTy, Instruction::Ret, &RetVal, 0, InsertAtEnd) {
589 ReturnInst::ReturnInst(BasicBlock *InsertAtEnd)
590 : TerminatorInst(Type::VoidTy, Instruction::Ret, &RetVal, 0, InsertAtEnd) {
595 void ReturnInst::init(Value *retVal) {
596 if (retVal && retVal->getType() != Type::VoidTy) {
597 assert(!isa<BasicBlock>(retVal) &&
598 "Cannot return basic block. Probably using the incorrect ctor");
600 RetVal.init(retVal, this);
604 unsigned ReturnInst::getNumSuccessorsV() const {
605 return getNumSuccessors();
608 // Out-of-line ReturnInst method, put here so the C++ compiler can choose to
609 // emit the vtable for the class in this translation unit.
610 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
611 assert(0 && "ReturnInst has no successors!");
614 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
615 assert(0 && "ReturnInst has no successors!");
621 //===----------------------------------------------------------------------===//
622 // UnwindInst Implementation
623 //===----------------------------------------------------------------------===//
625 UnwindInst::UnwindInst(Instruction *InsertBefore)
626 : TerminatorInst(Type::VoidTy, Instruction::Unwind, 0, 0, InsertBefore) {
628 UnwindInst::UnwindInst(BasicBlock *InsertAtEnd)
629 : TerminatorInst(Type::VoidTy, Instruction::Unwind, 0, 0, InsertAtEnd) {
633 unsigned UnwindInst::getNumSuccessorsV() const {
634 return getNumSuccessors();
637 void UnwindInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
638 assert(0 && "UnwindInst has no successors!");
641 BasicBlock *UnwindInst::getSuccessorV(unsigned idx) const {
642 assert(0 && "UnwindInst has no successors!");
647 //===----------------------------------------------------------------------===//
648 // UnreachableInst Implementation
649 //===----------------------------------------------------------------------===//
651 UnreachableInst::UnreachableInst(Instruction *InsertBefore)
652 : TerminatorInst(Type::VoidTy, Instruction::Unreachable, 0, 0, InsertBefore) {
654 UnreachableInst::UnreachableInst(BasicBlock *InsertAtEnd)
655 : TerminatorInst(Type::VoidTy, Instruction::Unreachable, 0, 0, InsertAtEnd) {
658 unsigned UnreachableInst::getNumSuccessorsV() const {
659 return getNumSuccessors();
662 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
663 assert(0 && "UnwindInst has no successors!");
666 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
667 assert(0 && "UnwindInst has no successors!");
672 //===----------------------------------------------------------------------===//
673 // BranchInst Implementation
674 //===----------------------------------------------------------------------===//
676 void BranchInst::AssertOK() {
678 assert(getCondition()->getType() == Type::Int1Ty &&
679 "May only branch on boolean predicates!");
682 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
683 : TerminatorInst(Type::VoidTy, Instruction::Br, Ops, 1, InsertBefore) {
684 assert(IfTrue != 0 && "Branch destination may not be null!");
685 Ops[0].init(reinterpret_cast<Value*>(IfTrue), this);
687 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
688 Instruction *InsertBefore)
689 : TerminatorInst(Type::VoidTy, Instruction::Br, Ops, 3, InsertBefore) {
690 Ops[0].init(reinterpret_cast<Value*>(IfTrue), this);
691 Ops[1].init(reinterpret_cast<Value*>(IfFalse), this);
692 Ops[2].init(Cond, this);
698 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
699 : TerminatorInst(Type::VoidTy, Instruction::Br, Ops, 1, InsertAtEnd) {
700 assert(IfTrue != 0 && "Branch destination may not be null!");
701 Ops[0].init(reinterpret_cast<Value*>(IfTrue), this);
704 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
705 BasicBlock *InsertAtEnd)
706 : TerminatorInst(Type::VoidTy, Instruction::Br, Ops, 3, InsertAtEnd) {
707 Ops[0].init(reinterpret_cast<Value*>(IfTrue), this);
708 Ops[1].init(reinterpret_cast<Value*>(IfFalse), this);
709 Ops[2].init(Cond, this);
716 BranchInst::BranchInst(const BranchInst &BI) :
717 TerminatorInst(Type::VoidTy, Instruction::Br, Ops, BI.getNumOperands()) {
718 OperandList[0].init(BI.getOperand(0), this);
719 if (BI.getNumOperands() != 1) {
720 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
721 OperandList[1].init(BI.getOperand(1), this);
722 OperandList[2].init(BI.getOperand(2), this);
726 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
727 return getSuccessor(idx);
729 unsigned BranchInst::getNumSuccessorsV() const {
730 return getNumSuccessors();
732 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
733 setSuccessor(idx, B);
737 //===----------------------------------------------------------------------===//
738 // AllocationInst Implementation
739 //===----------------------------------------------------------------------===//
741 static Value *getAISize(Value *Amt) {
743 Amt = ConstantInt::get(Type::Int32Ty, 1);
745 assert(!isa<BasicBlock>(Amt) &&
746 "Passed basic block into allocation size parameter! Use other ctor");
747 assert(Amt->getType() == Type::Int32Ty &&
748 "Malloc/Allocation array size is not a 32-bit integer!");
753 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
754 unsigned Align, const std::string &Name,
755 Instruction *InsertBefore)
756 : UnaryInstruction(PointerType::getUnqual(Ty), iTy, getAISize(ArraySize),
757 InsertBefore), Alignment(Align) {
758 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
759 assert(Ty != Type::VoidTy && "Cannot allocate void!");
763 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
764 unsigned Align, const std::string &Name,
765 BasicBlock *InsertAtEnd)
766 : UnaryInstruction(PointerType::getUnqual(Ty), iTy, getAISize(ArraySize),
767 InsertAtEnd), Alignment(Align) {
768 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
769 assert(Ty != Type::VoidTy && "Cannot allocate void!");
773 // Out of line virtual method, so the vtable, etc has a home.
774 AllocationInst::~AllocationInst() {
777 bool AllocationInst::isArrayAllocation() const {
778 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
779 return CI->getZExtValue() != 1;
783 const Type *AllocationInst::getAllocatedType() const {
784 return getType()->getElementType();
787 AllocaInst::AllocaInst(const AllocaInst &AI)
788 : AllocationInst(AI.getType()->getElementType(), (Value*)AI.getOperand(0),
789 Instruction::Alloca, AI.getAlignment()) {
792 MallocInst::MallocInst(const MallocInst &MI)
793 : AllocationInst(MI.getType()->getElementType(), (Value*)MI.getOperand(0),
794 Instruction::Malloc, MI.getAlignment()) {
797 //===----------------------------------------------------------------------===//
798 // FreeInst Implementation
799 //===----------------------------------------------------------------------===//
801 void FreeInst::AssertOK() {
802 assert(isa<PointerType>(getOperand(0)->getType()) &&
803 "Can not free something of nonpointer type!");
806 FreeInst::FreeInst(Value *Ptr, Instruction *InsertBefore)
807 : UnaryInstruction(Type::VoidTy, Free, Ptr, InsertBefore) {
811 FreeInst::FreeInst(Value *Ptr, BasicBlock *InsertAtEnd)
812 : UnaryInstruction(Type::VoidTy, Free, Ptr, InsertAtEnd) {
817 //===----------------------------------------------------------------------===//
818 // LoadInst Implementation
819 //===----------------------------------------------------------------------===//
821 void LoadInst::AssertOK() {
822 assert(isa<PointerType>(getOperand(0)->getType()) &&
823 "Ptr must have pointer type.");
826 LoadInst::LoadInst(Value *Ptr, const std::string &Name, Instruction *InsertBef)
827 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
828 Load, Ptr, InsertBef) {
835 LoadInst::LoadInst(Value *Ptr, const std::string &Name, BasicBlock *InsertAE)
836 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
837 Load, Ptr, InsertAE) {
844 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
845 Instruction *InsertBef)
846 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
847 Load, Ptr, InsertBef) {
848 setVolatile(isVolatile);
854 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
855 unsigned Align, Instruction *InsertBef)
856 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
857 Load, Ptr, InsertBef) {
858 setVolatile(isVolatile);
864 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
865 unsigned Align, BasicBlock *InsertAE)
866 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
867 Load, Ptr, InsertAE) {
868 setVolatile(isVolatile);
874 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
875 BasicBlock *InsertAE)
876 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
877 Load, Ptr, InsertAE) {
878 setVolatile(isVolatile);
886 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
887 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
888 Load, Ptr, InsertBef) {
892 if (Name && Name[0]) setName(Name);
895 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
896 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
897 Load, Ptr, InsertAE) {
901 if (Name && Name[0]) setName(Name);
904 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
905 Instruction *InsertBef)
906 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
907 Load, Ptr, InsertBef) {
908 setVolatile(isVolatile);
911 if (Name && Name[0]) setName(Name);
914 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
915 BasicBlock *InsertAE)
916 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
917 Load, Ptr, InsertAE) {
918 setVolatile(isVolatile);
921 if (Name && Name[0]) setName(Name);
924 void LoadInst::setAlignment(unsigned Align) {
925 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
926 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
929 //===----------------------------------------------------------------------===//
930 // StoreInst Implementation
931 //===----------------------------------------------------------------------===//
933 void StoreInst::AssertOK() {
934 assert(isa<PointerType>(getOperand(1)->getType()) &&
935 "Ptr must have pointer type!");
936 assert(getOperand(0)->getType() ==
937 cast<PointerType>(getOperand(1)->getType())->getElementType()
938 && "Ptr must be a pointer to Val type!");
942 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
943 : Instruction(Type::VoidTy, Store, Ops, 2, InsertBefore) {
944 Ops[0].init(val, this);
945 Ops[1].init(addr, this);
951 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
952 : Instruction(Type::VoidTy, Store, Ops, 2, InsertAtEnd) {
953 Ops[0].init(val, this);
954 Ops[1].init(addr, this);
960 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
961 Instruction *InsertBefore)
962 : Instruction(Type::VoidTy, Store, Ops, 2, InsertBefore) {
963 Ops[0].init(val, this);
964 Ops[1].init(addr, this);
965 setVolatile(isVolatile);
970 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
971 unsigned Align, Instruction *InsertBefore)
972 : Instruction(Type::VoidTy, Store, Ops, 2, InsertBefore) {
973 Ops[0].init(val, this);
974 Ops[1].init(addr, this);
975 setVolatile(isVolatile);
980 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
981 unsigned Align, BasicBlock *InsertAtEnd)
982 : Instruction(Type::VoidTy, Store, Ops, 2, InsertAtEnd) {
983 Ops[0].init(val, this);
984 Ops[1].init(addr, this);
985 setVolatile(isVolatile);
990 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
991 BasicBlock *InsertAtEnd)
992 : Instruction(Type::VoidTy, Store, Ops, 2, InsertAtEnd) {
993 Ops[0].init(val, this);
994 Ops[1].init(addr, this);
995 setVolatile(isVolatile);
1000 void StoreInst::setAlignment(unsigned Align) {
1001 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1002 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
1005 //===----------------------------------------------------------------------===//
1006 // GetElementPtrInst Implementation
1007 //===----------------------------------------------------------------------===//
1009 static unsigned retrieveAddrSpace(const Value *Val) {
1010 return cast<PointerType>(Val->getType())->getAddressSpace();
1013 void GetElementPtrInst::init(Value *Ptr, Value* const *Idx, unsigned NumIdx) {
1014 NumOperands = 1+NumIdx;
1015 Use *OL = OperandList = new Use[NumOperands];
1016 OL[0].init(Ptr, this);
1018 for (unsigned i = 0; i != NumIdx; ++i)
1019 OL[i+1].init(Idx[i], this);
1022 void GetElementPtrInst::init(Value *Ptr, Value *Idx) {
1024 Use *OL = OperandList = new Use[2];
1025 OL[0].init(Ptr, this);
1026 OL[1].init(Idx, this);
1029 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1030 const std::string &Name, Instruction *InBe)
1031 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx)),
1032 retrieveAddrSpace(Ptr)),
1033 GetElementPtr, 0, 0, InBe) {
1038 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1039 const std::string &Name, BasicBlock *IAE)
1040 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx)),
1041 retrieveAddrSpace(Ptr)),
1042 GetElementPtr, 0, 0, IAE) {
1047 GetElementPtrInst::~GetElementPtrInst() {
1048 delete[] OperandList;
1051 // getIndexedType - Returns the type of the element that would be loaded with
1052 // a load instruction with the specified parameters.
1054 // A null type is returned if the indices are invalid for the specified
1057 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
1060 bool AllowCompositeLeaf) {
1061 if (!isa<PointerType>(Ptr)) return 0; // Type isn't a pointer type!
1063 // Handle the special case of the empty set index set...
1065 if (AllowCompositeLeaf ||
1066 cast<PointerType>(Ptr)->getElementType()->isFirstClassType())
1067 return cast<PointerType>(Ptr)->getElementType();
1072 unsigned CurIdx = 0;
1073 while (const CompositeType *CT = dyn_cast<CompositeType>(Ptr)) {
1074 if (NumIdx == CurIdx) {
1075 if (AllowCompositeLeaf || CT->isFirstClassType()) return Ptr;
1076 return 0; // Can't load a whole structure or array!?!?
1079 Value *Index = Idxs[CurIdx++];
1080 if (isa<PointerType>(CT) && CurIdx != 1)
1081 return 0; // Can only index into pointer types at the first index!
1082 if (!CT->indexValid(Index)) return 0;
1083 Ptr = CT->getTypeAtIndex(Index);
1085 // If the new type forwards to another type, then it is in the middle
1086 // of being refined to another type (and hence, may have dropped all
1087 // references to what it was using before). So, use the new forwarded
1089 if (const Type * Ty = Ptr->getForwardedType()) {
1093 return CurIdx == NumIdx ? Ptr : 0;
1096 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr, Value *Idx) {
1097 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
1098 if (!PTy) return 0; // Type isn't a pointer type!
1100 // Check the pointer index.
1101 if (!PTy->indexValid(Idx)) return 0;
1103 return PTy->getElementType();
1107 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
1108 /// zeros. If so, the result pointer and the first operand have the same
1109 /// value, just potentially different types.
1110 bool GetElementPtrInst::hasAllZeroIndices() const {
1111 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1112 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
1113 if (!CI->isZero()) return false;
1121 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
1122 /// constant integers. If so, the result pointer and the first operand have
1123 /// a constant offset between them.
1124 bool GetElementPtrInst::hasAllConstantIndices() const {
1125 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1126 if (!isa<ConstantInt>(getOperand(i)))
1133 //===----------------------------------------------------------------------===//
1134 // ExtractElementInst Implementation
1135 //===----------------------------------------------------------------------===//
1137 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1138 const std::string &Name,
1139 Instruction *InsertBef)
1140 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1141 ExtractElement, Ops, 2, InsertBef) {
1142 assert(isValidOperands(Val, Index) &&
1143 "Invalid extractelement instruction operands!");
1144 Ops[0].init(Val, this);
1145 Ops[1].init(Index, this);
1149 ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
1150 const std::string &Name,
1151 Instruction *InsertBef)
1152 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1153 ExtractElement, Ops, 2, InsertBef) {
1154 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1155 assert(isValidOperands(Val, Index) &&
1156 "Invalid extractelement instruction operands!");
1157 Ops[0].init(Val, this);
1158 Ops[1].init(Index, this);
1163 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1164 const std::string &Name,
1165 BasicBlock *InsertAE)
1166 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1167 ExtractElement, Ops, 2, InsertAE) {
1168 assert(isValidOperands(Val, Index) &&
1169 "Invalid extractelement instruction operands!");
1171 Ops[0].init(Val, this);
1172 Ops[1].init(Index, this);
1176 ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
1177 const std::string &Name,
1178 BasicBlock *InsertAE)
1179 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1180 ExtractElement, Ops, 2, InsertAE) {
1181 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1182 assert(isValidOperands(Val, Index) &&
1183 "Invalid extractelement instruction operands!");
1185 Ops[0].init(Val, this);
1186 Ops[1].init(Index, this);
1191 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
1192 if (!isa<VectorType>(Val->getType()) || Index->getType() != Type::Int32Ty)
1198 //===----------------------------------------------------------------------===//
1199 // InsertElementInst Implementation
1200 //===----------------------------------------------------------------------===//
1202 InsertElementInst::InsertElementInst(const InsertElementInst &IE)
1203 : Instruction(IE.getType(), InsertElement, Ops, 3) {
1204 Ops[0].init(IE.Ops[0], this);
1205 Ops[1].init(IE.Ops[1], this);
1206 Ops[2].init(IE.Ops[2], this);
1208 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1209 const std::string &Name,
1210 Instruction *InsertBef)
1211 : Instruction(Vec->getType(), InsertElement, Ops, 3, InsertBef) {
1212 assert(isValidOperands(Vec, Elt, Index) &&
1213 "Invalid insertelement instruction operands!");
1214 Ops[0].init(Vec, this);
1215 Ops[1].init(Elt, this);
1216 Ops[2].init(Index, this);
1220 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
1221 const std::string &Name,
1222 Instruction *InsertBef)
1223 : Instruction(Vec->getType(), InsertElement, Ops, 3, InsertBef) {
1224 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1225 assert(isValidOperands(Vec, Elt, Index) &&
1226 "Invalid insertelement instruction operands!");
1227 Ops[0].init(Vec, this);
1228 Ops[1].init(Elt, this);
1229 Ops[2].init(Index, this);
1234 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1235 const std::string &Name,
1236 BasicBlock *InsertAE)
1237 : Instruction(Vec->getType(), InsertElement, Ops, 3, InsertAE) {
1238 assert(isValidOperands(Vec, Elt, Index) &&
1239 "Invalid insertelement instruction operands!");
1241 Ops[0].init(Vec, this);
1242 Ops[1].init(Elt, this);
1243 Ops[2].init(Index, this);
1247 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
1248 const std::string &Name,
1249 BasicBlock *InsertAE)
1250 : Instruction(Vec->getType(), InsertElement, Ops, 3, InsertAE) {
1251 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1252 assert(isValidOperands(Vec, Elt, Index) &&
1253 "Invalid insertelement instruction operands!");
1255 Ops[0].init(Vec, this);
1256 Ops[1].init(Elt, this);
1257 Ops[2].init(Index, this);
1261 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
1262 const Value *Index) {
1263 if (!isa<VectorType>(Vec->getType()))
1264 return false; // First operand of insertelement must be vector type.
1266 if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
1267 return false;// Second operand of insertelement must be vector element type.
1269 if (Index->getType() != Type::Int32Ty)
1270 return false; // Third operand of insertelement must be uint.
1275 //===----------------------------------------------------------------------===//
1276 // ShuffleVectorInst Implementation
1277 //===----------------------------------------------------------------------===//
1279 ShuffleVectorInst::ShuffleVectorInst(const ShuffleVectorInst &SV)
1280 : Instruction(SV.getType(), ShuffleVector, Ops, 3) {
1281 Ops[0].init(SV.Ops[0], this);
1282 Ops[1].init(SV.Ops[1], this);
1283 Ops[2].init(SV.Ops[2], this);
1286 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1287 const std::string &Name,
1288 Instruction *InsertBefore)
1289 : Instruction(V1->getType(), ShuffleVector, Ops, 3, InsertBefore) {
1290 assert(isValidOperands(V1, V2, Mask) &&
1291 "Invalid shuffle vector instruction operands!");
1292 Ops[0].init(V1, this);
1293 Ops[1].init(V2, this);
1294 Ops[2].init(Mask, this);
1298 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1299 const std::string &Name,
1300 BasicBlock *InsertAtEnd)
1301 : Instruction(V1->getType(), ShuffleVector, Ops, 3, InsertAtEnd) {
1302 assert(isValidOperands(V1, V2, Mask) &&
1303 "Invalid shuffle vector instruction operands!");
1305 Ops[0].init(V1, this);
1306 Ops[1].init(V2, this);
1307 Ops[2].init(Mask, this);
1311 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1312 const Value *Mask) {
1313 if (!isa<VectorType>(V1->getType())) return false;
1314 if (V1->getType() != V2->getType()) return false;
1315 if (!isa<VectorType>(Mask->getType()) ||
1316 cast<VectorType>(Mask->getType())->getElementType() != Type::Int32Ty ||
1317 cast<VectorType>(Mask->getType())->getNumElements() !=
1318 cast<VectorType>(V1->getType())->getNumElements())
1324 //===----------------------------------------------------------------------===//
1325 // BinaryOperator Class
1326 //===----------------------------------------------------------------------===//
1328 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1329 const Type *Ty, const std::string &Name,
1330 Instruction *InsertBefore)
1331 : Instruction(Ty, iType, Ops, 2, InsertBefore) {
1332 Ops[0].init(S1, this);
1333 Ops[1].init(S2, this);
1338 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1339 const Type *Ty, const std::string &Name,
1340 BasicBlock *InsertAtEnd)
1341 : Instruction(Ty, iType, Ops, 2, InsertAtEnd) {
1342 Ops[0].init(S1, this);
1343 Ops[1].init(S2, this);
1349 void BinaryOperator::init(BinaryOps iType) {
1350 Value *LHS = getOperand(0), *RHS = getOperand(1);
1351 LHS = LHS; RHS = RHS; // Silence warnings.
1352 assert(LHS->getType() == RHS->getType() &&
1353 "Binary operator operand types must match!");
1358 assert(getType() == LHS->getType() &&
1359 "Arithmetic operation should return same type as operands!");
1360 assert((getType()->isInteger() || getType()->isFloatingPoint() ||
1361 isa<VectorType>(getType())) &&
1362 "Tried to create an arithmetic operation on a non-arithmetic type!");
1366 assert(getType() == LHS->getType() &&
1367 "Arithmetic operation should return same type as operands!");
1368 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1369 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1370 "Incorrect operand type (not integer) for S/UDIV");
1373 assert(getType() == LHS->getType() &&
1374 "Arithmetic operation should return same type as operands!");
1375 assert((getType()->isFloatingPoint() || (isa<VectorType>(getType()) &&
1376 cast<VectorType>(getType())->getElementType()->isFloatingPoint()))
1377 && "Incorrect operand type (not floating point) for FDIV");
1381 assert(getType() == LHS->getType() &&
1382 "Arithmetic operation should return same type as operands!");
1383 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1384 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1385 "Incorrect operand type (not integer) for S/UREM");
1388 assert(getType() == LHS->getType() &&
1389 "Arithmetic operation should return same type as operands!");
1390 assert((getType()->isFloatingPoint() || (isa<VectorType>(getType()) &&
1391 cast<VectorType>(getType())->getElementType()->isFloatingPoint()))
1392 && "Incorrect operand type (not floating point) for FREM");
1397 assert(getType() == LHS->getType() &&
1398 "Shift operation should return same type as operands!");
1399 assert(getType()->isInteger() &&
1400 "Shift operation requires integer operands");
1404 assert(getType() == LHS->getType() &&
1405 "Logical operation should return same type as operands!");
1406 assert((getType()->isInteger() ||
1407 (isa<VectorType>(getType()) &&
1408 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1409 "Tried to create a logical operation on a non-integral type!");
1417 BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
1418 const std::string &Name,
1419 Instruction *InsertBefore) {
1420 assert(S1->getType() == S2->getType() &&
1421 "Cannot create binary operator with two operands of differing type!");
1422 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1425 BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
1426 const std::string &Name,
1427 BasicBlock *InsertAtEnd) {
1428 BinaryOperator *Res = create(Op, S1, S2, Name);
1429 InsertAtEnd->getInstList().push_back(Res);
1433 BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
1434 Instruction *InsertBefore) {
1435 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1436 return new BinaryOperator(Instruction::Sub,
1438 Op->getType(), Name, InsertBefore);
1441 BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
1442 BasicBlock *InsertAtEnd) {
1443 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1444 return new BinaryOperator(Instruction::Sub,
1446 Op->getType(), Name, InsertAtEnd);
1449 BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
1450 Instruction *InsertBefore) {
1452 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1453 C = ConstantInt::getAllOnesValue(PTy->getElementType());
1454 C = ConstantVector::get(std::vector<Constant*>(PTy->getNumElements(), C));
1456 C = ConstantInt::getAllOnesValue(Op->getType());
1459 return new BinaryOperator(Instruction::Xor, Op, C,
1460 Op->getType(), Name, InsertBefore);
1463 BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
1464 BasicBlock *InsertAtEnd) {
1466 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1467 // Create a vector of all ones values.
1468 Constant *Elt = ConstantInt::getAllOnesValue(PTy->getElementType());
1470 ConstantVector::get(std::vector<Constant*>(PTy->getNumElements(), Elt));
1472 AllOnes = ConstantInt::getAllOnesValue(Op->getType());
1475 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1476 Op->getType(), Name, InsertAtEnd);
1480 // isConstantAllOnes - Helper function for several functions below
1481 static inline bool isConstantAllOnes(const Value *V) {
1482 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V))
1483 return CI->isAllOnesValue();
1484 if (const ConstantVector *CV = dyn_cast<ConstantVector>(V))
1485 return CV->isAllOnesValue();
1489 bool BinaryOperator::isNeg(const Value *V) {
1490 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1491 if (Bop->getOpcode() == Instruction::Sub)
1492 return Bop->getOperand(0) ==
1493 ConstantExpr::getZeroValueForNegationExpr(Bop->getType());
1497 bool BinaryOperator::isNot(const Value *V) {
1498 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1499 return (Bop->getOpcode() == Instruction::Xor &&
1500 (isConstantAllOnes(Bop->getOperand(1)) ||
1501 isConstantAllOnes(Bop->getOperand(0))));
1505 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1506 assert(isNeg(BinOp) && "getNegArgument from non-'neg' instruction!");
1507 return cast<BinaryOperator>(BinOp)->getOperand(1);
1510 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1511 return getNegArgument(const_cast<Value*>(BinOp));
1514 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1515 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1516 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1517 Value *Op0 = BO->getOperand(0);
1518 Value *Op1 = BO->getOperand(1);
1519 if (isConstantAllOnes(Op0)) return Op1;
1521 assert(isConstantAllOnes(Op1));
1525 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1526 return getNotArgument(const_cast<Value*>(BinOp));
1530 // swapOperands - Exchange the two operands to this instruction. This
1531 // instruction is safe to use on any binary instruction and does not
1532 // modify the semantics of the instruction. If the instruction is
1533 // order dependent (SetLT f.e.) the opcode is changed.
1535 bool BinaryOperator::swapOperands() {
1536 if (!isCommutative())
1537 return true; // Can't commute operands
1538 std::swap(Ops[0], Ops[1]);
1542 //===----------------------------------------------------------------------===//
1544 //===----------------------------------------------------------------------===//
1546 // Just determine if this cast only deals with integral->integral conversion.
1547 bool CastInst::isIntegerCast() const {
1548 switch (getOpcode()) {
1549 default: return false;
1550 case Instruction::ZExt:
1551 case Instruction::SExt:
1552 case Instruction::Trunc:
1554 case Instruction::BitCast:
1555 return getOperand(0)->getType()->isInteger() && getType()->isInteger();
1559 bool CastInst::isLosslessCast() const {
1560 // Only BitCast can be lossless, exit fast if we're not BitCast
1561 if (getOpcode() != Instruction::BitCast)
1564 // Identity cast is always lossless
1565 const Type* SrcTy = getOperand(0)->getType();
1566 const Type* DstTy = getType();
1570 // Pointer to pointer is always lossless.
1571 if (isa<PointerType>(SrcTy))
1572 return isa<PointerType>(DstTy);
1573 return false; // Other types have no identity values
1576 /// This function determines if the CastInst does not require any bits to be
1577 /// changed in order to effect the cast. Essentially, it identifies cases where
1578 /// no code gen is necessary for the cast, hence the name no-op cast. For
1579 /// example, the following are all no-op casts:
1580 /// # bitcast uint %X, int
1581 /// # bitcast uint* %x, sbyte*
1582 /// # bitcast vector< 2 x int > %x, vector< 4 x short>
1583 /// # ptrtoint uint* %x, uint ; on 32-bit plaforms only
1584 /// @brief Determine if a cast is a no-op.
1585 bool CastInst::isNoopCast(const Type *IntPtrTy) const {
1586 switch (getOpcode()) {
1588 assert(!"Invalid CastOp");
1589 case Instruction::Trunc:
1590 case Instruction::ZExt:
1591 case Instruction::SExt:
1592 case Instruction::FPTrunc:
1593 case Instruction::FPExt:
1594 case Instruction::UIToFP:
1595 case Instruction::SIToFP:
1596 case Instruction::FPToUI:
1597 case Instruction::FPToSI:
1598 return false; // These always modify bits
1599 case Instruction::BitCast:
1600 return true; // BitCast never modifies bits.
1601 case Instruction::PtrToInt:
1602 return IntPtrTy->getPrimitiveSizeInBits() ==
1603 getType()->getPrimitiveSizeInBits();
1604 case Instruction::IntToPtr:
1605 return IntPtrTy->getPrimitiveSizeInBits() ==
1606 getOperand(0)->getType()->getPrimitiveSizeInBits();
1610 /// This function determines if a pair of casts can be eliminated and what
1611 /// opcode should be used in the elimination. This assumes that there are two
1612 /// instructions like this:
1613 /// * %F = firstOpcode SrcTy %x to MidTy
1614 /// * %S = secondOpcode MidTy %F to DstTy
1615 /// The function returns a resultOpcode so these two casts can be replaced with:
1616 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
1617 /// If no such cast is permited, the function returns 0.
1618 unsigned CastInst::isEliminableCastPair(
1619 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
1620 const Type *SrcTy, const Type *MidTy, const Type *DstTy, const Type *IntPtrTy)
1622 // Define the 144 possibilities for these two cast instructions. The values
1623 // in this matrix determine what to do in a given situation and select the
1624 // case in the switch below. The rows correspond to firstOp, the columns
1625 // correspond to secondOp. In looking at the table below, keep in mind
1626 // the following cast properties:
1628 // Size Compare Source Destination
1629 // Operator Src ? Size Type Sign Type Sign
1630 // -------- ------------ ------------------- ---------------------
1631 // TRUNC > Integer Any Integral Any
1632 // ZEXT < Integral Unsigned Integer Any
1633 // SEXT < Integral Signed Integer Any
1634 // FPTOUI n/a FloatPt n/a Integral Unsigned
1635 // FPTOSI n/a FloatPt n/a Integral Signed
1636 // UITOFP n/a Integral Unsigned FloatPt n/a
1637 // SITOFP n/a Integral Signed FloatPt n/a
1638 // FPTRUNC > FloatPt n/a FloatPt n/a
1639 // FPEXT < FloatPt n/a FloatPt n/a
1640 // PTRTOINT n/a Pointer n/a Integral Unsigned
1641 // INTTOPTR n/a Integral Unsigned Pointer n/a
1642 // BITCONVERT = FirstClass n/a FirstClass n/a
1644 // NOTE: some transforms are safe, but we consider them to be non-profitable.
1645 // For example, we could merge "fptoui double to uint" + "zext uint to ulong",
1646 // into "fptoui double to ulong", but this loses information about the range
1647 // of the produced value (we no longer know the top-part is all zeros).
1648 // Further this conversion is often much more expensive for typical hardware,
1649 // and causes issues when building libgcc. We disallow fptosi+sext for the
1651 const unsigned numCastOps =
1652 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
1653 static const uint8_t CastResults[numCastOps][numCastOps] = {
1654 // T F F U S F F P I B -+
1655 // R Z S P P I I T P 2 N T |
1656 // U E E 2 2 2 2 R E I T C +- secondOp
1657 // N X X U S F F N X N 2 V |
1658 // C T T I I P P C T T P T -+
1659 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
1660 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
1661 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
1662 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
1663 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
1664 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
1665 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
1666 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
1667 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
1668 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
1669 { 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
1670 { 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
1673 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
1674 [secondOp-Instruction::CastOpsBegin];
1677 // categorically disallowed
1680 // allowed, use first cast's opcode
1683 // allowed, use second cast's opcode
1686 // no-op cast in second op implies firstOp as long as the DestTy
1688 if (DstTy->isInteger())
1692 // no-op cast in second op implies firstOp as long as the DestTy
1693 // is floating point
1694 if (DstTy->isFloatingPoint())
1698 // no-op cast in first op implies secondOp as long as the SrcTy
1700 if (SrcTy->isInteger())
1704 // no-op cast in first op implies secondOp as long as the SrcTy
1705 // is a floating point
1706 if (SrcTy->isFloatingPoint())
1710 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size
1711 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1712 unsigned MidSize = MidTy->getPrimitiveSizeInBits();
1713 if (MidSize >= PtrSize)
1714 return Instruction::BitCast;
1718 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
1719 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
1720 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
1721 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1722 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1723 if (SrcSize == DstSize)
1724 return Instruction::BitCast;
1725 else if (SrcSize < DstSize)
1729 case 9: // zext, sext -> zext, because sext can't sign extend after zext
1730 return Instruction::ZExt;
1732 // fpext followed by ftrunc is allowed if the bit size returned to is
1733 // the same as the original, in which case its just a bitcast
1735 return Instruction::BitCast;
1736 return 0; // If the types are not the same we can't eliminate it.
1738 // bitcast followed by ptrtoint is allowed as long as the bitcast
1739 // is a pointer to pointer cast.
1740 if (isa<PointerType>(SrcTy) && isa<PointerType>(MidTy))
1744 // inttoptr, bitcast -> intptr if bitcast is a ptr to ptr cast
1745 if (isa<PointerType>(MidTy) && isa<PointerType>(DstTy))
1749 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
1750 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1751 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1752 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1753 if (SrcSize <= PtrSize && SrcSize == DstSize)
1754 return Instruction::BitCast;
1758 // cast combination can't happen (error in input). This is for all cases
1759 // where the MidTy is not the same for the two cast instructions.
1760 assert(!"Invalid Cast Combination");
1763 assert(!"Error in CastResults table!!!");
1769 CastInst *CastInst::create(Instruction::CastOps op, Value *S, const Type *Ty,
1770 const std::string &Name, Instruction *InsertBefore) {
1771 // Construct and return the appropriate CastInst subclass
1773 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
1774 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
1775 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
1776 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
1777 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
1778 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
1779 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
1780 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
1781 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
1782 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
1783 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
1784 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
1786 assert(!"Invalid opcode provided");
1791 CastInst *CastInst::create(Instruction::CastOps op, Value *S, const Type *Ty,
1792 const std::string &Name, BasicBlock *InsertAtEnd) {
1793 // Construct and return the appropriate CastInst subclass
1795 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
1796 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
1797 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
1798 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
1799 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
1800 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
1801 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
1802 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
1803 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
1804 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
1805 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
1806 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
1808 assert(!"Invalid opcode provided");
1813 CastInst *CastInst::createZExtOrBitCast(Value *S, const Type *Ty,
1814 const std::string &Name,
1815 Instruction *InsertBefore) {
1816 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1817 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1818 return create(Instruction::ZExt, S, Ty, Name, InsertBefore);
1821 CastInst *CastInst::createZExtOrBitCast(Value *S, const Type *Ty,
1822 const std::string &Name,
1823 BasicBlock *InsertAtEnd) {
1824 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1825 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1826 return create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
1829 CastInst *CastInst::createSExtOrBitCast(Value *S, const Type *Ty,
1830 const std::string &Name,
1831 Instruction *InsertBefore) {
1832 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1833 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1834 return create(Instruction::SExt, S, Ty, Name, InsertBefore);
1837 CastInst *CastInst::createSExtOrBitCast(Value *S, const Type *Ty,
1838 const std::string &Name,
1839 BasicBlock *InsertAtEnd) {
1840 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1841 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1842 return create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
1845 CastInst *CastInst::createTruncOrBitCast(Value *S, const Type *Ty,
1846 const std::string &Name,
1847 Instruction *InsertBefore) {
1848 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1849 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1850 return create(Instruction::Trunc, S, Ty, Name, InsertBefore);
1853 CastInst *CastInst::createTruncOrBitCast(Value *S, const Type *Ty,
1854 const std::string &Name,
1855 BasicBlock *InsertAtEnd) {
1856 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1857 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1858 return create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
1861 CastInst *CastInst::createPointerCast(Value *S, const Type *Ty,
1862 const std::string &Name,
1863 BasicBlock *InsertAtEnd) {
1864 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1865 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
1868 if (Ty->isInteger())
1869 return create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
1870 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1873 /// @brief Create a BitCast or a PtrToInt cast instruction
1874 CastInst *CastInst::createPointerCast(Value *S, const Type *Ty,
1875 const std::string &Name,
1876 Instruction *InsertBefore) {
1877 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1878 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
1881 if (Ty->isInteger())
1882 return create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
1883 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1886 CastInst *CastInst::createIntegerCast(Value *C, const Type *Ty,
1887 bool isSigned, const std::string &Name,
1888 Instruction *InsertBefore) {
1889 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1890 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1891 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1892 Instruction::CastOps opcode =
1893 (SrcBits == DstBits ? Instruction::BitCast :
1894 (SrcBits > DstBits ? Instruction::Trunc :
1895 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1896 return create(opcode, C, Ty, Name, InsertBefore);
1899 CastInst *CastInst::createIntegerCast(Value *C, const Type *Ty,
1900 bool isSigned, const std::string &Name,
1901 BasicBlock *InsertAtEnd) {
1902 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1903 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1904 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1905 Instruction::CastOps opcode =
1906 (SrcBits == DstBits ? Instruction::BitCast :
1907 (SrcBits > DstBits ? Instruction::Trunc :
1908 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1909 return create(opcode, C, Ty, Name, InsertAtEnd);
1912 CastInst *CastInst::createFPCast(Value *C, const Type *Ty,
1913 const std::string &Name,
1914 Instruction *InsertBefore) {
1915 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1917 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1918 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1919 Instruction::CastOps opcode =
1920 (SrcBits == DstBits ? Instruction::BitCast :
1921 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
1922 return create(opcode, C, Ty, Name, InsertBefore);
1925 CastInst *CastInst::createFPCast(Value *C, const Type *Ty,
1926 const std::string &Name,
1927 BasicBlock *InsertAtEnd) {
1928 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1930 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1931 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1932 Instruction::CastOps opcode =
1933 (SrcBits == DstBits ? Instruction::BitCast :
1934 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
1935 return create(opcode, C, Ty, Name, InsertAtEnd);
1938 // Check whether it is valid to call getCastOpcode for these types.
1939 // This routine must be kept in sync with getCastOpcode.
1940 bool CastInst::isCastable(const Type *SrcTy, const Type *DestTy) {
1941 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
1944 if (SrcTy == DestTy)
1947 // Get the bit sizes, we'll need these
1948 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
1949 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
1951 // Run through the possibilities ...
1952 if (DestTy->isInteger()) { // Casting to integral
1953 if (SrcTy->isInteger()) { // Casting from integral
1955 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
1957 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
1958 // Casting from vector
1959 return DestBits == PTy->getBitWidth();
1960 } else { // Casting from something else
1961 return isa<PointerType>(SrcTy);
1963 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
1964 if (SrcTy->isInteger()) { // Casting from integral
1966 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
1968 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
1969 // Casting from vector
1970 return DestBits == PTy->getBitWidth();
1971 } else { // Casting from something else
1974 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
1975 // Casting to vector
1976 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
1977 // Casting from vector
1978 return DestPTy->getBitWidth() == SrcPTy->getBitWidth();
1979 } else { // Casting from something else
1980 return DestPTy->getBitWidth() == SrcBits;
1982 } else if (isa<PointerType>(DestTy)) { // Casting to pointer
1983 if (isa<PointerType>(SrcTy)) { // Casting from pointer
1985 } else if (SrcTy->isInteger()) { // Casting from integral
1987 } else { // Casting from something else
1990 } else { // Casting to something else
1995 // Provide a way to get a "cast" where the cast opcode is inferred from the
1996 // types and size of the operand. This, basically, is a parallel of the
1997 // logic in the castIsValid function below. This axiom should hold:
1998 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
1999 // should not assert in castIsValid. In other words, this produces a "correct"
2000 // casting opcode for the arguments passed to it.
2001 // This routine must be kept in sync with isCastable.
2002 Instruction::CastOps
2003 CastInst::getCastOpcode(
2004 const Value *Src, bool SrcIsSigned, const Type *DestTy, bool DestIsSigned) {
2005 // Get the bit sizes, we'll need these
2006 const Type *SrcTy = Src->getType();
2007 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2008 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2010 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2011 "Only first class types are castable!");
2013 // Run through the possibilities ...
2014 if (DestTy->isInteger()) { // Casting to integral
2015 if (SrcTy->isInteger()) { // Casting from integral
2016 if (DestBits < SrcBits)
2017 return Trunc; // int -> smaller int
2018 else if (DestBits > SrcBits) { // its an extension
2020 return SExt; // signed -> SEXT
2022 return ZExt; // unsigned -> ZEXT
2024 return BitCast; // Same size, No-op cast
2026 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2028 return FPToSI; // FP -> sint
2030 return FPToUI; // FP -> uint
2031 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2032 assert(DestBits == PTy->getBitWidth() &&
2033 "Casting vector to integer of different width");
2034 return BitCast; // Same size, no-op cast
2036 assert(isa<PointerType>(SrcTy) &&
2037 "Casting from a value that is not first-class type");
2038 return PtrToInt; // ptr -> int
2040 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2041 if (SrcTy->isInteger()) { // Casting from integral
2043 return SIToFP; // sint -> FP
2045 return UIToFP; // uint -> FP
2046 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2047 if (DestBits < SrcBits) {
2048 return FPTrunc; // FP -> smaller FP
2049 } else if (DestBits > SrcBits) {
2050 return FPExt; // FP -> larger FP
2052 return BitCast; // same size, no-op cast
2054 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2055 assert(DestBits == PTy->getBitWidth() &&
2056 "Casting vector to floating point of different width");
2057 return BitCast; // same size, no-op cast
2059 assert(0 && "Casting pointer or non-first class to float");
2061 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2062 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2063 assert(DestPTy->getBitWidth() == SrcPTy->getBitWidth() &&
2064 "Casting vector to vector of different widths");
2065 return BitCast; // vector -> vector
2066 } else if (DestPTy->getBitWidth() == SrcBits) {
2067 return BitCast; // float/int -> vector
2069 assert(!"Illegal cast to vector (wrong type or size)");
2071 } else if (isa<PointerType>(DestTy)) {
2072 if (isa<PointerType>(SrcTy)) {
2073 return BitCast; // ptr -> ptr
2074 } else if (SrcTy->isInteger()) {
2075 return IntToPtr; // int -> ptr
2077 assert(!"Casting pointer to other than pointer or int");
2080 assert(!"Casting to type that is not first-class");
2083 // If we fall through to here we probably hit an assertion cast above
2084 // and assertions are not turned on. Anything we return is an error, so
2085 // BitCast is as good a choice as any.
2089 //===----------------------------------------------------------------------===//
2090 // CastInst SubClass Constructors
2091 //===----------------------------------------------------------------------===//
2093 /// Check that the construction parameters for a CastInst are correct. This
2094 /// could be broken out into the separate constructors but it is useful to have
2095 /// it in one place and to eliminate the redundant code for getting the sizes
2096 /// of the types involved.
2098 CastInst::castIsValid(Instruction::CastOps op, Value *S, const Type *DstTy) {
2100 // Check for type sanity on the arguments
2101 const Type *SrcTy = S->getType();
2102 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType())
2105 // Get the size of the types in bits, we'll need this later
2106 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
2107 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
2109 // Switch on the opcode provided
2111 default: return false; // This is an input error
2112 case Instruction::Trunc:
2113 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize > DstBitSize;
2114 case Instruction::ZExt:
2115 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize < DstBitSize;
2116 case Instruction::SExt:
2117 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize < DstBitSize;
2118 case Instruction::FPTrunc:
2119 return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
2120 SrcBitSize > DstBitSize;
2121 case Instruction::FPExt:
2122 return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
2123 SrcBitSize < DstBitSize;
2124 case Instruction::UIToFP:
2125 case Instruction::SIToFP:
2126 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2127 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2128 return SVTy->getElementType()->isInteger() &&
2129 DVTy->getElementType()->isFloatingPoint() &&
2130 SVTy->getNumElements() == DVTy->getNumElements();
2133 return SrcTy->isInteger() && DstTy->isFloatingPoint();
2134 case Instruction::FPToUI:
2135 case Instruction::FPToSI:
2136 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2137 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2138 return SVTy->getElementType()->isFloatingPoint() &&
2139 DVTy->getElementType()->isInteger() &&
2140 SVTy->getNumElements() == DVTy->getNumElements();
2143 return SrcTy->isFloatingPoint() && DstTy->isInteger();
2144 case Instruction::PtrToInt:
2145 return isa<PointerType>(SrcTy) && DstTy->isInteger();
2146 case Instruction::IntToPtr:
2147 return SrcTy->isInteger() && isa<PointerType>(DstTy);
2148 case Instruction::BitCast:
2149 // BitCast implies a no-op cast of type only. No bits change.
2150 // However, you can't cast pointers to anything but pointers.
2151 if (isa<PointerType>(SrcTy) != isa<PointerType>(DstTy))
2154 // Now we know we're not dealing with a pointer/non-pointer mismatch. In all
2155 // these cases, the cast is okay if the source and destination bit widths
2157 return SrcBitSize == DstBitSize;
2161 TruncInst::TruncInst(
2162 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2163 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2164 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2167 TruncInst::TruncInst(
2168 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2169 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2170 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2174 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2175 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2176 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2180 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2181 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2182 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2185 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2186 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2187 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2191 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2192 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2193 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2196 FPTruncInst::FPTruncInst(
2197 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2198 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2199 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2202 FPTruncInst::FPTruncInst(
2203 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2204 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2205 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2208 FPExtInst::FPExtInst(
2209 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2210 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2211 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2214 FPExtInst::FPExtInst(
2215 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2216 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2217 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2220 UIToFPInst::UIToFPInst(
2221 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2222 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2223 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2226 UIToFPInst::UIToFPInst(
2227 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2228 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2229 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2232 SIToFPInst::SIToFPInst(
2233 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2234 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2235 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2238 SIToFPInst::SIToFPInst(
2239 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2240 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2241 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2244 FPToUIInst::FPToUIInst(
2245 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2246 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2247 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2250 FPToUIInst::FPToUIInst(
2251 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2252 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2253 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2256 FPToSIInst::FPToSIInst(
2257 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2258 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2259 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2262 FPToSIInst::FPToSIInst(
2263 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2264 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2265 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2268 PtrToIntInst::PtrToIntInst(
2269 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2270 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2271 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2274 PtrToIntInst::PtrToIntInst(
2275 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2276 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2277 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2280 IntToPtrInst::IntToPtrInst(
2281 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2282 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2283 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2286 IntToPtrInst::IntToPtrInst(
2287 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2288 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2289 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2292 BitCastInst::BitCastInst(
2293 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2294 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2295 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2298 BitCastInst::BitCastInst(
2299 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2300 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2301 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2304 //===----------------------------------------------------------------------===//
2306 //===----------------------------------------------------------------------===//
2308 CmpInst::CmpInst(OtherOps op, unsigned short predicate, Value *LHS, Value *RHS,
2309 const std::string &Name, Instruction *InsertBefore)
2310 : Instruction(Type::Int1Ty, op, Ops, 2, InsertBefore) {
2311 Ops[0].init(LHS, this);
2312 Ops[1].init(RHS, this);
2313 SubclassData = predicate;
2315 if (op == Instruction::ICmp) {
2316 assert(predicate >= ICmpInst::FIRST_ICMP_PREDICATE &&
2317 predicate <= ICmpInst::LAST_ICMP_PREDICATE &&
2318 "Invalid ICmp predicate value");
2319 const Type* Op0Ty = getOperand(0)->getType();
2320 const Type* Op1Ty = getOperand(1)->getType();
2321 assert(Op0Ty == Op1Ty &&
2322 "Both operands to ICmp instruction are not of the same type!");
2323 // Check that the operands are the right type
2324 assert((Op0Ty->isInteger() || isa<PointerType>(Op0Ty)) &&
2325 "Invalid operand types for ICmp instruction");
2328 assert(op == Instruction::FCmp && "Invalid CmpInst opcode");
2329 assert(predicate <= FCmpInst::LAST_FCMP_PREDICATE &&
2330 "Invalid FCmp predicate value");
2331 const Type* Op0Ty = getOperand(0)->getType();
2332 const Type* Op1Ty = getOperand(1)->getType();
2333 assert(Op0Ty == Op1Ty &&
2334 "Both operands to FCmp instruction are not of the same type!");
2335 // Check that the operands are the right type
2336 assert(Op0Ty->isFloatingPoint() &&
2337 "Invalid operand types for FCmp instruction");
2340 CmpInst::CmpInst(OtherOps op, unsigned short predicate, Value *LHS, Value *RHS,
2341 const std::string &Name, BasicBlock *InsertAtEnd)
2342 : Instruction(Type::Int1Ty, op, Ops, 2, InsertAtEnd) {
2343 Ops[0].init(LHS, this);
2344 Ops[1].init(RHS, this);
2345 SubclassData = predicate;
2347 if (op == Instruction::ICmp) {
2348 assert(predicate >= ICmpInst::FIRST_ICMP_PREDICATE &&
2349 predicate <= ICmpInst::LAST_ICMP_PREDICATE &&
2350 "Invalid ICmp predicate value");
2352 const Type* Op0Ty = getOperand(0)->getType();
2353 const Type* Op1Ty = getOperand(1)->getType();
2354 assert(Op0Ty == Op1Ty &&
2355 "Both operands to ICmp instruction are not of the same type!");
2356 // Check that the operands are the right type
2357 assert((Op0Ty->isInteger() || isa<PointerType>(Op0Ty)) &&
2358 "Invalid operand types for ICmp instruction");
2361 assert(op == Instruction::FCmp && "Invalid CmpInst opcode");
2362 assert(predicate <= FCmpInst::LAST_FCMP_PREDICATE &&
2363 "Invalid FCmp predicate value");
2364 const Type* Op0Ty = getOperand(0)->getType();
2365 const Type* Op1Ty = getOperand(1)->getType();
2366 assert(Op0Ty == Op1Ty &&
2367 "Both operands to FCmp instruction are not of the same type!");
2368 // Check that the operands are the right type
2369 assert(Op0Ty->isFloatingPoint() &&
2370 "Invalid operand types for FCmp instruction");
2374 CmpInst::create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2375 const std::string &Name, Instruction *InsertBefore) {
2376 if (Op == Instruction::ICmp) {
2377 return new ICmpInst(ICmpInst::Predicate(predicate), S1, S2, Name,
2380 return new FCmpInst(FCmpInst::Predicate(predicate), S1, S2, Name,
2385 CmpInst::create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2386 const std::string &Name, BasicBlock *InsertAtEnd) {
2387 if (Op == Instruction::ICmp) {
2388 return new ICmpInst(ICmpInst::Predicate(predicate), S1, S2, Name,
2391 return new FCmpInst(FCmpInst::Predicate(predicate), S1, S2, Name,
2395 void CmpInst::swapOperands() {
2396 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2399 cast<FCmpInst>(this)->swapOperands();
2402 bool CmpInst::isCommutative() {
2403 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2404 return IC->isCommutative();
2405 return cast<FCmpInst>(this)->isCommutative();
2408 bool CmpInst::isEquality() {
2409 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2410 return IC->isEquality();
2411 return cast<FCmpInst>(this)->isEquality();
2415 ICmpInst::Predicate ICmpInst::getInversePredicate(Predicate pred) {
2418 assert(!"Unknown icmp predicate!");
2419 case ICMP_EQ: return ICMP_NE;
2420 case ICMP_NE: return ICMP_EQ;
2421 case ICMP_UGT: return ICMP_ULE;
2422 case ICMP_ULT: return ICMP_UGE;
2423 case ICMP_UGE: return ICMP_ULT;
2424 case ICMP_ULE: return ICMP_UGT;
2425 case ICMP_SGT: return ICMP_SLE;
2426 case ICMP_SLT: return ICMP_SGE;
2427 case ICMP_SGE: return ICMP_SLT;
2428 case ICMP_SLE: return ICMP_SGT;
2432 ICmpInst::Predicate ICmpInst::getSwappedPredicate(Predicate pred) {
2434 default: assert(! "Unknown icmp predicate!");
2435 case ICMP_EQ: case ICMP_NE:
2437 case ICMP_SGT: return ICMP_SLT;
2438 case ICMP_SLT: return ICMP_SGT;
2439 case ICMP_SGE: return ICMP_SLE;
2440 case ICMP_SLE: return ICMP_SGE;
2441 case ICMP_UGT: return ICMP_ULT;
2442 case ICMP_ULT: return ICMP_UGT;
2443 case ICMP_UGE: return ICMP_ULE;
2444 case ICMP_ULE: return ICMP_UGE;
2448 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
2450 default: assert(! "Unknown icmp predicate!");
2451 case ICMP_EQ: case ICMP_NE:
2452 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2454 case ICMP_UGT: return ICMP_SGT;
2455 case ICMP_ULT: return ICMP_SLT;
2456 case ICMP_UGE: return ICMP_SGE;
2457 case ICMP_ULE: return ICMP_SLE;
2461 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
2463 default: assert(! "Unknown icmp predicate!");
2464 case ICMP_EQ: case ICMP_NE:
2465 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
2467 case ICMP_SGT: return ICMP_UGT;
2468 case ICMP_SLT: return ICMP_ULT;
2469 case ICMP_SGE: return ICMP_UGE;
2470 case ICMP_SLE: return ICMP_ULE;
2474 bool ICmpInst::isSignedPredicate(Predicate pred) {
2476 default: assert(! "Unknown icmp predicate!");
2477 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2479 case ICMP_EQ: case ICMP_NE: case ICMP_UGT: case ICMP_ULT:
2480 case ICMP_UGE: case ICMP_ULE:
2485 /// Initialize a set of values that all satisfy the condition with C.
2488 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
2491 uint32_t BitWidth = C.getBitWidth();
2493 default: assert(0 && "Invalid ICmp opcode to ConstantRange ctor!");
2494 case ICmpInst::ICMP_EQ: Upper++; break;
2495 case ICmpInst::ICMP_NE: Lower++; break;
2496 case ICmpInst::ICMP_ULT: Lower = APInt::getMinValue(BitWidth); break;
2497 case ICmpInst::ICMP_SLT: Lower = APInt::getSignedMinValue(BitWidth); break;
2498 case ICmpInst::ICMP_UGT:
2499 Lower++; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2501 case ICmpInst::ICMP_SGT:
2502 Lower++; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2504 case ICmpInst::ICMP_ULE:
2505 Lower = APInt::getMinValue(BitWidth); Upper++;
2507 case ICmpInst::ICMP_SLE:
2508 Lower = APInt::getSignedMinValue(BitWidth); Upper++;
2510 case ICmpInst::ICMP_UGE:
2511 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2513 case ICmpInst::ICMP_SGE:
2514 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2517 return ConstantRange(Lower, Upper);
2520 FCmpInst::Predicate FCmpInst::getInversePredicate(Predicate pred) {
2523 assert(!"Unknown icmp predicate!");
2524 case FCMP_OEQ: return FCMP_UNE;
2525 case FCMP_ONE: return FCMP_UEQ;
2526 case FCMP_OGT: return FCMP_ULE;
2527 case FCMP_OLT: return FCMP_UGE;
2528 case FCMP_OGE: return FCMP_ULT;
2529 case FCMP_OLE: return FCMP_UGT;
2530 case FCMP_UEQ: return FCMP_ONE;
2531 case FCMP_UNE: return FCMP_OEQ;
2532 case FCMP_UGT: return FCMP_OLE;
2533 case FCMP_ULT: return FCMP_OGE;
2534 case FCMP_UGE: return FCMP_OLT;
2535 case FCMP_ULE: return FCMP_OGT;
2536 case FCMP_ORD: return FCMP_UNO;
2537 case FCMP_UNO: return FCMP_ORD;
2538 case FCMP_TRUE: return FCMP_FALSE;
2539 case FCMP_FALSE: return FCMP_TRUE;
2543 FCmpInst::Predicate FCmpInst::getSwappedPredicate(Predicate pred) {
2545 default: assert(!"Unknown fcmp predicate!");
2546 case FCMP_FALSE: case FCMP_TRUE:
2547 case FCMP_OEQ: case FCMP_ONE:
2548 case FCMP_UEQ: case FCMP_UNE:
2549 case FCMP_ORD: case FCMP_UNO:
2551 case FCMP_OGT: return FCMP_OLT;
2552 case FCMP_OLT: return FCMP_OGT;
2553 case FCMP_OGE: return FCMP_OLE;
2554 case FCMP_OLE: return FCMP_OGE;
2555 case FCMP_UGT: return FCMP_ULT;
2556 case FCMP_ULT: return FCMP_UGT;
2557 case FCMP_UGE: return FCMP_ULE;
2558 case FCMP_ULE: return FCMP_UGE;
2562 bool CmpInst::isUnsigned(unsigned short predicate) {
2563 switch (predicate) {
2564 default: return false;
2565 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
2566 case ICmpInst::ICMP_UGE: return true;
2570 bool CmpInst::isSigned(unsigned short predicate){
2571 switch (predicate) {
2572 default: return false;
2573 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
2574 case ICmpInst::ICMP_SGE: return true;
2578 bool CmpInst::isOrdered(unsigned short predicate) {
2579 switch (predicate) {
2580 default: return false;
2581 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
2582 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
2583 case FCmpInst::FCMP_ORD: return true;
2587 bool CmpInst::isUnordered(unsigned short predicate) {
2588 switch (predicate) {
2589 default: return false;
2590 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
2591 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
2592 case FCmpInst::FCMP_UNO: return true;
2596 //===----------------------------------------------------------------------===//
2597 // SwitchInst Implementation
2598 //===----------------------------------------------------------------------===//
2600 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumCases) {
2601 assert(Value && Default);
2602 ReservedSpace = 2+NumCases*2;
2604 OperandList = new Use[ReservedSpace];
2606 OperandList[0].init(Value, this);
2607 OperandList[1].init(Default, this);
2610 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2611 /// switch on and a default destination. The number of additional cases can
2612 /// be specified here to make memory allocation more efficient. This
2613 /// constructor can also autoinsert before another instruction.
2614 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2615 Instruction *InsertBefore)
2616 : TerminatorInst(Type::VoidTy, Instruction::Switch, 0, 0, InsertBefore) {
2617 init(Value, Default, NumCases);
2620 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2621 /// switch on and a default destination. The number of additional cases can
2622 /// be specified here to make memory allocation more efficient. This
2623 /// constructor also autoinserts at the end of the specified BasicBlock.
2624 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2625 BasicBlock *InsertAtEnd)
2626 : TerminatorInst(Type::VoidTy, Instruction::Switch, 0, 0, InsertAtEnd) {
2627 init(Value, Default, NumCases);
2630 SwitchInst::SwitchInst(const SwitchInst &SI)
2631 : TerminatorInst(Type::VoidTy, Instruction::Switch,
2632 new Use[SI.getNumOperands()], SI.getNumOperands()) {
2633 Use *OL = OperandList, *InOL = SI.OperandList;
2634 for (unsigned i = 0, E = SI.getNumOperands(); i != E; i+=2) {
2635 OL[i].init(InOL[i], this);
2636 OL[i+1].init(InOL[i+1], this);
2640 SwitchInst::~SwitchInst() {
2641 delete [] OperandList;
2645 /// addCase - Add an entry to the switch instruction...
2647 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
2648 unsigned OpNo = NumOperands;
2649 if (OpNo+2 > ReservedSpace)
2650 resizeOperands(0); // Get more space!
2651 // Initialize some new operands.
2652 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
2653 NumOperands = OpNo+2;
2654 OperandList[OpNo].init(OnVal, this);
2655 OperandList[OpNo+1].init(Dest, this);
2658 /// removeCase - This method removes the specified successor from the switch
2659 /// instruction. Note that this cannot be used to remove the default
2660 /// destination (successor #0).
2662 void SwitchInst::removeCase(unsigned idx) {
2663 assert(idx != 0 && "Cannot remove the default case!");
2664 assert(idx*2 < getNumOperands() && "Successor index out of range!!!");
2666 unsigned NumOps = getNumOperands();
2667 Use *OL = OperandList;
2669 // Move everything after this operand down.
2671 // FIXME: we could just swap with the end of the list, then erase. However,
2672 // client might not expect this to happen. The code as it is thrashes the
2673 // use/def lists, which is kinda lame.
2674 for (unsigned i = (idx+1)*2; i != NumOps; i += 2) {
2676 OL[i-2+1] = OL[i+1];
2679 // Nuke the last value.
2680 OL[NumOps-2].set(0);
2681 OL[NumOps-2+1].set(0);
2682 NumOperands = NumOps-2;
2685 /// resizeOperands - resize operands - This adjusts the length of the operands
2686 /// list according to the following behavior:
2687 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
2688 /// of operation. This grows the number of ops by 1.5 times.
2689 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
2690 /// 3. If NumOps == NumOperands, trim the reserved space.
2692 void SwitchInst::resizeOperands(unsigned NumOps) {
2694 NumOps = getNumOperands()/2*6;
2695 } else if (NumOps*2 > NumOperands) {
2696 // No resize needed.
2697 if (ReservedSpace >= NumOps) return;
2698 } else if (NumOps == NumOperands) {
2699 if (ReservedSpace == NumOps) return;
2704 ReservedSpace = NumOps;
2705 Use *NewOps = new Use[NumOps];
2706 Use *OldOps = OperandList;
2707 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2708 NewOps[i].init(OldOps[i], this);
2712 OperandList = NewOps;
2716 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
2717 return getSuccessor(idx);
2719 unsigned SwitchInst::getNumSuccessorsV() const {
2720 return getNumSuccessors();
2722 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
2723 setSuccessor(idx, B);
2726 //===----------------------------------------------------------------------===//
2727 // GetResultInst Implementation
2728 //===----------------------------------------------------------------------===//
2730 GetResultInst::GetResultInst(Value *Aggregate, unsigned Index,
2731 const std::string &Name,
2732 Instruction *InsertBef)
2733 : Instruction(cast<StructType>(Aggregate->getType())->getElementType(Index),
2734 GetResult, &Aggr, 1, InsertBef) {
2735 assert(isValidOperands(Aggregate, Index) && "Invalid GetResultInst operands!");
2736 Aggr.init(Aggregate, this);
2741 bool GetResultInst::isValidOperands(const Value *Aggregate, unsigned Index) {
2745 if (const StructType *STy = dyn_cast<StructType>(Aggregate->getType())) {
2746 unsigned NumElements = STy->getNumElements();
2747 if (Index >= NumElements)
2750 // getresult aggregate value's element types are restricted to
2751 // avoid nested aggregates.
2752 for (unsigned i = 0; i < NumElements; ++i)
2753 if (!STy->getElementType(i)->isFirstClassType())
2756 // Otherwise, Aggregate is valid.
2763 // Define these methods here so vtables don't get emitted into every translation
2764 // unit that uses these classes.
2766 GetElementPtrInst *GetElementPtrInst::clone() const {
2767 return new GetElementPtrInst(*this);
2770 BinaryOperator *BinaryOperator::clone() const {
2771 return create(getOpcode(), Ops[0], Ops[1]);
2774 FCmpInst* FCmpInst::clone() const {
2775 return new FCmpInst(getPredicate(), Ops[0], Ops[1]);
2777 ICmpInst* ICmpInst::clone() const {
2778 return new ICmpInst(getPredicate(), Ops[0], Ops[1]);
2781 MallocInst *MallocInst::clone() const { return new MallocInst(*this); }
2782 AllocaInst *AllocaInst::clone() const { return new AllocaInst(*this); }
2783 FreeInst *FreeInst::clone() const { return new FreeInst(getOperand(0)); }
2784 LoadInst *LoadInst::clone() const { return new LoadInst(*this); }
2785 StoreInst *StoreInst::clone() const { return new StoreInst(*this); }
2786 CastInst *TruncInst::clone() const { return new TruncInst(*this); }
2787 CastInst *ZExtInst::clone() const { return new ZExtInst(*this); }
2788 CastInst *SExtInst::clone() const { return new SExtInst(*this); }
2789 CastInst *FPTruncInst::clone() const { return new FPTruncInst(*this); }
2790 CastInst *FPExtInst::clone() const { return new FPExtInst(*this); }
2791 CastInst *UIToFPInst::clone() const { return new UIToFPInst(*this); }
2792 CastInst *SIToFPInst::clone() const { return new SIToFPInst(*this); }
2793 CastInst *FPToUIInst::clone() const { return new FPToUIInst(*this); }
2794 CastInst *FPToSIInst::clone() const { return new FPToSIInst(*this); }
2795 CastInst *PtrToIntInst::clone() const { return new PtrToIntInst(*this); }
2796 CastInst *IntToPtrInst::clone() const { return new IntToPtrInst(*this); }
2797 CastInst *BitCastInst::clone() const { return new BitCastInst(*this); }
2798 CallInst *CallInst::clone() const { return new CallInst(*this); }
2799 SelectInst *SelectInst::clone() const { return new SelectInst(*this); }
2800 VAArgInst *VAArgInst::clone() const { return new VAArgInst(*this); }
2802 ExtractElementInst *ExtractElementInst::clone() const {
2803 return new ExtractElementInst(*this);
2805 InsertElementInst *InsertElementInst::clone() const {
2806 return new InsertElementInst(*this);
2808 ShuffleVectorInst *ShuffleVectorInst::clone() const {
2809 return new ShuffleVectorInst(*this);
2811 PHINode *PHINode::clone() const { return new PHINode(*this); }
2812 ReturnInst *ReturnInst::clone() const { return new ReturnInst(*this); }
2813 BranchInst *BranchInst::clone() const { return new BranchInst(*this); }
2814 SwitchInst *SwitchInst::clone() const { return new SwitchInst(*this); }
2815 InvokeInst *InvokeInst::clone() const { return new InvokeInst(*this); }
2816 UnwindInst *UnwindInst::clone() const { return new UnwindInst(); }
2817 UnreachableInst *UnreachableInst::clone() const { return new UnreachableInst();}
2818 GetResultInst *GetResultInst::clone() const { return new GetResultInst(*this); }