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/ParamAttrsList.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 unsigned N = RI.getNumOperands();
579 RetVal.init(RI.RetVal, this);
581 Use *OL = OperandList = new Use[N];
582 for (unsigned i = 0; i < N; ++i)
583 OL[i].init(RI.getOperand(i), this);
587 ReturnInst::ReturnInst(Value *retVal, Instruction *InsertBefore)
588 : TerminatorInst(Type::VoidTy, Instruction::Ret, &RetVal, 0, InsertBefore) {
592 ReturnInst::ReturnInst(Value *retVal, BasicBlock *InsertAtEnd)
593 : TerminatorInst(Type::VoidTy, Instruction::Ret, &RetVal, 0, InsertAtEnd) {
597 ReturnInst::ReturnInst(BasicBlock *InsertAtEnd)
598 : TerminatorInst(Type::VoidTy, Instruction::Ret, &RetVal, 0, InsertAtEnd) {
601 ReturnInst::ReturnInst(const std::vector<Value *> &retVals,
602 Instruction *InsertBefore)
603 : TerminatorInst(Type::VoidTy, Instruction::Ret, &RetVal, retVals.size(),
605 if (!retVals.empty())
606 init(&retVals[0], retVals.size());
608 ReturnInst::ReturnInst(const std::vector<Value *> &retVals,
609 BasicBlock *InsertAtEnd)
610 : TerminatorInst(Type::VoidTy, Instruction::Ret, &RetVal, retVals.size(),
612 if (!retVals.empty())
613 init(&retVals[0], retVals.size());
615 ReturnInst::ReturnInst(const std::vector<Value *> &retVals)
616 : TerminatorInst(Type::VoidTy, Instruction::Ret, &RetVal, retVals.size()) {
617 if (!retVals.empty())
618 init(&retVals[0], retVals.size());
621 void ReturnInst::init(const Value * const* retVals, unsigned N) {
623 assert (N > 0 && "Invalid operands numbers in ReturnInst init");
626 if (NumOperands == 1) {
627 const Value *V = *retVals;
628 if (V->getType() == Type::VoidTy)
630 RetVal.init(const_cast<Value*>(V), this);
634 Use *OL = OperandList = new Use[NumOperands];
635 for (unsigned i = 0; i < NumOperands; ++i) {
636 const Value *V = *retVals++;
637 assert(!isa<BasicBlock>(V) &&
638 "Cannot return basic block. Probably using the incorrect ctor");
639 OL[i].init(const_cast<Value *>(V), this);
643 Value *ReturnInst::getReturnValue(unsigned n) const {
644 if (getNumOperands() == 0)
647 assert (n < getNumOperands() && "getReturnValue out of range!");
648 if (getNumOperands() == 1)
651 return OperandList[n];
654 unsigned ReturnInst::getNumSuccessorsV() const {
655 return getNumSuccessors();
658 /// Out-of-line ReturnInst method, put here so the C++ compiler can choose to
659 /// emit the vtable for the class in this translation unit.
660 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
661 assert(0 && "ReturnInst has no successors!");
664 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
665 assert(0 && "ReturnInst has no successors!");
670 ReturnInst::~ReturnInst() {
672 delete [] OperandList;
675 //===----------------------------------------------------------------------===//
676 // UnwindInst Implementation
677 //===----------------------------------------------------------------------===//
679 UnwindInst::UnwindInst(Instruction *InsertBefore)
680 : TerminatorInst(Type::VoidTy, Instruction::Unwind, 0, 0, InsertBefore) {
682 UnwindInst::UnwindInst(BasicBlock *InsertAtEnd)
683 : TerminatorInst(Type::VoidTy, Instruction::Unwind, 0, 0, InsertAtEnd) {
687 unsigned UnwindInst::getNumSuccessorsV() const {
688 return getNumSuccessors();
691 void UnwindInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
692 assert(0 && "UnwindInst has no successors!");
695 BasicBlock *UnwindInst::getSuccessorV(unsigned idx) const {
696 assert(0 && "UnwindInst has no successors!");
701 //===----------------------------------------------------------------------===//
702 // UnreachableInst Implementation
703 //===----------------------------------------------------------------------===//
705 UnreachableInst::UnreachableInst(Instruction *InsertBefore)
706 : TerminatorInst(Type::VoidTy, Instruction::Unreachable, 0, 0, InsertBefore) {
708 UnreachableInst::UnreachableInst(BasicBlock *InsertAtEnd)
709 : TerminatorInst(Type::VoidTy, Instruction::Unreachable, 0, 0, InsertAtEnd) {
712 unsigned UnreachableInst::getNumSuccessorsV() const {
713 return getNumSuccessors();
716 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
717 assert(0 && "UnwindInst has no successors!");
720 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
721 assert(0 && "UnwindInst has no successors!");
726 //===----------------------------------------------------------------------===//
727 // BranchInst Implementation
728 //===----------------------------------------------------------------------===//
730 void BranchInst::AssertOK() {
732 assert(getCondition()->getType() == Type::Int1Ty &&
733 "May only branch on boolean predicates!");
736 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
737 : TerminatorInst(Type::VoidTy, Instruction::Br, Ops, 1, InsertBefore) {
738 assert(IfTrue != 0 && "Branch destination may not be null!");
739 Ops[0].init(reinterpret_cast<Value*>(IfTrue), this);
741 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
742 Instruction *InsertBefore)
743 : TerminatorInst(Type::VoidTy, Instruction::Br, Ops, 3, InsertBefore) {
744 Ops[0].init(reinterpret_cast<Value*>(IfTrue), this);
745 Ops[1].init(reinterpret_cast<Value*>(IfFalse), this);
746 Ops[2].init(Cond, this);
752 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
753 : TerminatorInst(Type::VoidTy, Instruction::Br, Ops, 1, InsertAtEnd) {
754 assert(IfTrue != 0 && "Branch destination may not be null!");
755 Ops[0].init(reinterpret_cast<Value*>(IfTrue), this);
758 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
759 BasicBlock *InsertAtEnd)
760 : TerminatorInst(Type::VoidTy, Instruction::Br, Ops, 3, InsertAtEnd) {
761 Ops[0].init(reinterpret_cast<Value*>(IfTrue), this);
762 Ops[1].init(reinterpret_cast<Value*>(IfFalse), this);
763 Ops[2].init(Cond, this);
770 BranchInst::BranchInst(const BranchInst &BI) :
771 TerminatorInst(Type::VoidTy, Instruction::Br, Ops, BI.getNumOperands()) {
772 OperandList[0].init(BI.getOperand(0), this);
773 if (BI.getNumOperands() != 1) {
774 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
775 OperandList[1].init(BI.getOperand(1), this);
776 OperandList[2].init(BI.getOperand(2), this);
780 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
781 return getSuccessor(idx);
783 unsigned BranchInst::getNumSuccessorsV() const {
784 return getNumSuccessors();
786 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
787 setSuccessor(idx, B);
791 //===----------------------------------------------------------------------===//
792 // AllocationInst Implementation
793 //===----------------------------------------------------------------------===//
795 static Value *getAISize(Value *Amt) {
797 Amt = ConstantInt::get(Type::Int32Ty, 1);
799 assert(!isa<BasicBlock>(Amt) &&
800 "Passed basic block into allocation size parameter! Use other ctor");
801 assert(Amt->getType() == Type::Int32Ty &&
802 "Malloc/Allocation array size is not a 32-bit integer!");
807 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
808 unsigned Align, const std::string &Name,
809 Instruction *InsertBefore)
810 : UnaryInstruction(PointerType::getUnqual(Ty), iTy, getAISize(ArraySize),
811 InsertBefore), Alignment(Align) {
812 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
813 assert(Ty != Type::VoidTy && "Cannot allocate void!");
817 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
818 unsigned Align, const std::string &Name,
819 BasicBlock *InsertAtEnd)
820 : UnaryInstruction(PointerType::getUnqual(Ty), iTy, getAISize(ArraySize),
821 InsertAtEnd), Alignment(Align) {
822 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
823 assert(Ty != Type::VoidTy && "Cannot allocate void!");
827 // Out of line virtual method, so the vtable, etc has a home.
828 AllocationInst::~AllocationInst() {
831 bool AllocationInst::isArrayAllocation() const {
832 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
833 return CI->getZExtValue() != 1;
837 const Type *AllocationInst::getAllocatedType() const {
838 return getType()->getElementType();
841 AllocaInst::AllocaInst(const AllocaInst &AI)
842 : AllocationInst(AI.getType()->getElementType(), (Value*)AI.getOperand(0),
843 Instruction::Alloca, AI.getAlignment()) {
846 MallocInst::MallocInst(const MallocInst &MI)
847 : AllocationInst(MI.getType()->getElementType(), (Value*)MI.getOperand(0),
848 Instruction::Malloc, MI.getAlignment()) {
851 //===----------------------------------------------------------------------===//
852 // FreeInst Implementation
853 //===----------------------------------------------------------------------===//
855 void FreeInst::AssertOK() {
856 assert(isa<PointerType>(getOperand(0)->getType()) &&
857 "Can not free something of nonpointer type!");
860 FreeInst::FreeInst(Value *Ptr, Instruction *InsertBefore)
861 : UnaryInstruction(Type::VoidTy, Free, Ptr, InsertBefore) {
865 FreeInst::FreeInst(Value *Ptr, BasicBlock *InsertAtEnd)
866 : UnaryInstruction(Type::VoidTy, Free, Ptr, InsertAtEnd) {
871 //===----------------------------------------------------------------------===//
872 // LoadInst Implementation
873 //===----------------------------------------------------------------------===//
875 void LoadInst::AssertOK() {
876 assert(isa<PointerType>(getOperand(0)->getType()) &&
877 "Ptr must have pointer type.");
880 LoadInst::LoadInst(Value *Ptr, const std::string &Name, Instruction *InsertBef)
881 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
882 Load, Ptr, InsertBef) {
889 LoadInst::LoadInst(Value *Ptr, const std::string &Name, BasicBlock *InsertAE)
890 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
891 Load, Ptr, InsertAE) {
898 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
899 Instruction *InsertBef)
900 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
901 Load, Ptr, InsertBef) {
902 setVolatile(isVolatile);
908 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
909 unsigned Align, Instruction *InsertBef)
910 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
911 Load, Ptr, InsertBef) {
912 setVolatile(isVolatile);
918 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
919 unsigned Align, BasicBlock *InsertAE)
920 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
921 Load, Ptr, InsertAE) {
922 setVolatile(isVolatile);
928 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
929 BasicBlock *InsertAE)
930 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
931 Load, Ptr, InsertAE) {
932 setVolatile(isVolatile);
940 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
941 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
942 Load, Ptr, InsertBef) {
946 if (Name && Name[0]) setName(Name);
949 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
950 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
951 Load, Ptr, InsertAE) {
955 if (Name && Name[0]) setName(Name);
958 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
959 Instruction *InsertBef)
960 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
961 Load, Ptr, InsertBef) {
962 setVolatile(isVolatile);
965 if (Name && Name[0]) setName(Name);
968 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
969 BasicBlock *InsertAE)
970 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
971 Load, Ptr, InsertAE) {
972 setVolatile(isVolatile);
975 if (Name && Name[0]) setName(Name);
978 void LoadInst::setAlignment(unsigned Align) {
979 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
980 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
983 //===----------------------------------------------------------------------===//
984 // StoreInst Implementation
985 //===----------------------------------------------------------------------===//
987 void StoreInst::AssertOK() {
988 assert(isa<PointerType>(getOperand(1)->getType()) &&
989 "Ptr must have pointer type!");
990 assert(getOperand(0)->getType() ==
991 cast<PointerType>(getOperand(1)->getType())->getElementType()
992 && "Ptr must be a pointer to Val type!");
996 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
997 : Instruction(Type::VoidTy, Store, Ops, 2, InsertBefore) {
998 Ops[0].init(val, this);
999 Ops[1].init(addr, this);
1005 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
1006 : Instruction(Type::VoidTy, Store, Ops, 2, InsertAtEnd) {
1007 Ops[0].init(val, this);
1008 Ops[1].init(addr, this);
1014 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1015 Instruction *InsertBefore)
1016 : Instruction(Type::VoidTy, Store, Ops, 2, InsertBefore) {
1017 Ops[0].init(val, this);
1018 Ops[1].init(addr, this);
1019 setVolatile(isVolatile);
1024 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1025 unsigned Align, Instruction *InsertBefore)
1026 : Instruction(Type::VoidTy, Store, Ops, 2, InsertBefore) {
1027 Ops[0].init(val, this);
1028 Ops[1].init(addr, this);
1029 setVolatile(isVolatile);
1030 setAlignment(Align);
1034 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1035 unsigned Align, BasicBlock *InsertAtEnd)
1036 : Instruction(Type::VoidTy, Store, Ops, 2, InsertAtEnd) {
1037 Ops[0].init(val, this);
1038 Ops[1].init(addr, this);
1039 setVolatile(isVolatile);
1040 setAlignment(Align);
1044 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
1045 BasicBlock *InsertAtEnd)
1046 : Instruction(Type::VoidTy, Store, Ops, 2, InsertAtEnd) {
1047 Ops[0].init(val, this);
1048 Ops[1].init(addr, this);
1049 setVolatile(isVolatile);
1054 void StoreInst::setAlignment(unsigned Align) {
1055 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
1056 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
1059 //===----------------------------------------------------------------------===//
1060 // GetElementPtrInst Implementation
1061 //===----------------------------------------------------------------------===//
1063 static unsigned retrieveAddrSpace(const Value *Val) {
1064 return cast<PointerType>(Val->getType())->getAddressSpace();
1067 void GetElementPtrInst::init(Value *Ptr, Value* const *Idx, unsigned NumIdx) {
1068 NumOperands = 1+NumIdx;
1069 Use *OL = OperandList = new Use[NumOperands];
1070 OL[0].init(Ptr, this);
1072 for (unsigned i = 0; i != NumIdx; ++i)
1073 OL[i+1].init(Idx[i], this);
1076 void GetElementPtrInst::init(Value *Ptr, Value *Idx) {
1078 Use *OL = OperandList = new Use[2];
1079 OL[0].init(Ptr, this);
1080 OL[1].init(Idx, this);
1083 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1084 const std::string &Name, Instruction *InBe)
1085 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx)),
1086 retrieveAddrSpace(Ptr)),
1087 GetElementPtr, 0, 0, InBe) {
1092 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1093 const std::string &Name, BasicBlock *IAE)
1094 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx)),
1095 retrieveAddrSpace(Ptr)),
1096 GetElementPtr, 0, 0, IAE) {
1101 GetElementPtrInst::~GetElementPtrInst() {
1102 delete[] OperandList;
1105 // getIndexedType - Returns the type of the element that would be loaded with
1106 // a load instruction with the specified parameters.
1108 // A null type is returned if the indices are invalid for the specified
1111 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
1114 bool AllowCompositeLeaf) {
1115 if (!isa<PointerType>(Ptr)) return 0; // Type isn't a pointer type!
1117 // Handle the special case of the empty set index set...
1119 if (AllowCompositeLeaf ||
1120 cast<PointerType>(Ptr)->getElementType()->isFirstClassType())
1121 return cast<PointerType>(Ptr)->getElementType();
1126 unsigned CurIdx = 0;
1127 while (const CompositeType *CT = dyn_cast<CompositeType>(Ptr)) {
1128 if (NumIdx == CurIdx) {
1129 if (AllowCompositeLeaf || CT->isFirstClassType()) return Ptr;
1130 return 0; // Can't load a whole structure or array!?!?
1133 Value *Index = Idxs[CurIdx++];
1134 if (isa<PointerType>(CT) && CurIdx != 1)
1135 return 0; // Can only index into pointer types at the first index!
1136 if (!CT->indexValid(Index)) return 0;
1137 Ptr = CT->getTypeAtIndex(Index);
1139 // If the new type forwards to another type, then it is in the middle
1140 // of being refined to another type (and hence, may have dropped all
1141 // references to what it was using before). So, use the new forwarded
1143 if (const Type * Ty = Ptr->getForwardedType()) {
1147 return CurIdx == NumIdx ? Ptr : 0;
1150 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr, Value *Idx) {
1151 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
1152 if (!PTy) return 0; // Type isn't a pointer type!
1154 // Check the pointer index.
1155 if (!PTy->indexValid(Idx)) return 0;
1157 return PTy->getElementType();
1161 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
1162 /// zeros. If so, the result pointer and the first operand have the same
1163 /// value, just potentially different types.
1164 bool GetElementPtrInst::hasAllZeroIndices() const {
1165 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1166 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
1167 if (!CI->isZero()) return false;
1175 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
1176 /// constant integers. If so, the result pointer and the first operand have
1177 /// a constant offset between them.
1178 bool GetElementPtrInst::hasAllConstantIndices() const {
1179 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1180 if (!isa<ConstantInt>(getOperand(i)))
1187 //===----------------------------------------------------------------------===//
1188 // ExtractElementInst Implementation
1189 //===----------------------------------------------------------------------===//
1191 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1192 const std::string &Name,
1193 Instruction *InsertBef)
1194 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1195 ExtractElement, Ops, 2, InsertBef) {
1196 assert(isValidOperands(Val, Index) &&
1197 "Invalid extractelement instruction operands!");
1198 Ops[0].init(Val, this);
1199 Ops[1].init(Index, this);
1203 ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
1204 const std::string &Name,
1205 Instruction *InsertBef)
1206 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1207 ExtractElement, Ops, 2, InsertBef) {
1208 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1209 assert(isValidOperands(Val, Index) &&
1210 "Invalid extractelement instruction operands!");
1211 Ops[0].init(Val, this);
1212 Ops[1].init(Index, this);
1217 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1218 const std::string &Name,
1219 BasicBlock *InsertAE)
1220 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1221 ExtractElement, Ops, 2, InsertAE) {
1222 assert(isValidOperands(Val, Index) &&
1223 "Invalid extractelement instruction operands!");
1225 Ops[0].init(Val, this);
1226 Ops[1].init(Index, this);
1230 ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
1231 const std::string &Name,
1232 BasicBlock *InsertAE)
1233 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1234 ExtractElement, Ops, 2, InsertAE) {
1235 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1236 assert(isValidOperands(Val, Index) &&
1237 "Invalid extractelement instruction operands!");
1239 Ops[0].init(Val, this);
1240 Ops[1].init(Index, this);
1245 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
1246 if (!isa<VectorType>(Val->getType()) || Index->getType() != Type::Int32Ty)
1252 //===----------------------------------------------------------------------===//
1253 // InsertElementInst Implementation
1254 //===----------------------------------------------------------------------===//
1256 InsertElementInst::InsertElementInst(const InsertElementInst &IE)
1257 : Instruction(IE.getType(), InsertElement, Ops, 3) {
1258 Ops[0].init(IE.Ops[0], this);
1259 Ops[1].init(IE.Ops[1], this);
1260 Ops[2].init(IE.Ops[2], this);
1262 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1263 const std::string &Name,
1264 Instruction *InsertBef)
1265 : Instruction(Vec->getType(), InsertElement, Ops, 3, InsertBef) {
1266 assert(isValidOperands(Vec, Elt, Index) &&
1267 "Invalid insertelement instruction operands!");
1268 Ops[0].init(Vec, this);
1269 Ops[1].init(Elt, this);
1270 Ops[2].init(Index, this);
1274 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
1275 const std::string &Name,
1276 Instruction *InsertBef)
1277 : Instruction(Vec->getType(), InsertElement, Ops, 3, InsertBef) {
1278 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1279 assert(isValidOperands(Vec, Elt, Index) &&
1280 "Invalid insertelement instruction operands!");
1281 Ops[0].init(Vec, this);
1282 Ops[1].init(Elt, this);
1283 Ops[2].init(Index, this);
1288 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1289 const std::string &Name,
1290 BasicBlock *InsertAE)
1291 : Instruction(Vec->getType(), InsertElement, Ops, 3, InsertAE) {
1292 assert(isValidOperands(Vec, Elt, Index) &&
1293 "Invalid insertelement instruction operands!");
1295 Ops[0].init(Vec, this);
1296 Ops[1].init(Elt, this);
1297 Ops[2].init(Index, this);
1301 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
1302 const std::string &Name,
1303 BasicBlock *InsertAE)
1304 : Instruction(Vec->getType(), InsertElement, Ops, 3, InsertAE) {
1305 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1306 assert(isValidOperands(Vec, Elt, Index) &&
1307 "Invalid insertelement instruction operands!");
1309 Ops[0].init(Vec, this);
1310 Ops[1].init(Elt, this);
1311 Ops[2].init(Index, this);
1315 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
1316 const Value *Index) {
1317 if (!isa<VectorType>(Vec->getType()))
1318 return false; // First operand of insertelement must be vector type.
1320 if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
1321 return false;// Second operand of insertelement must be vector element type.
1323 if (Index->getType() != Type::Int32Ty)
1324 return false; // Third operand of insertelement must be uint.
1329 //===----------------------------------------------------------------------===//
1330 // ShuffleVectorInst Implementation
1331 //===----------------------------------------------------------------------===//
1333 ShuffleVectorInst::ShuffleVectorInst(const ShuffleVectorInst &SV)
1334 : Instruction(SV.getType(), ShuffleVector, Ops, 3) {
1335 Ops[0].init(SV.Ops[0], this);
1336 Ops[1].init(SV.Ops[1], this);
1337 Ops[2].init(SV.Ops[2], this);
1340 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1341 const std::string &Name,
1342 Instruction *InsertBefore)
1343 : Instruction(V1->getType(), ShuffleVector, Ops, 3, InsertBefore) {
1344 assert(isValidOperands(V1, V2, Mask) &&
1345 "Invalid shuffle vector instruction operands!");
1346 Ops[0].init(V1, this);
1347 Ops[1].init(V2, this);
1348 Ops[2].init(Mask, this);
1352 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1353 const std::string &Name,
1354 BasicBlock *InsertAtEnd)
1355 : Instruction(V1->getType(), ShuffleVector, Ops, 3, InsertAtEnd) {
1356 assert(isValidOperands(V1, V2, Mask) &&
1357 "Invalid shuffle vector instruction operands!");
1359 Ops[0].init(V1, this);
1360 Ops[1].init(V2, this);
1361 Ops[2].init(Mask, this);
1365 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1366 const Value *Mask) {
1367 if (!isa<VectorType>(V1->getType())) return false;
1368 if (V1->getType() != V2->getType()) return false;
1369 if (!isa<VectorType>(Mask->getType()) ||
1370 cast<VectorType>(Mask->getType())->getElementType() != Type::Int32Ty ||
1371 cast<VectorType>(Mask->getType())->getNumElements() !=
1372 cast<VectorType>(V1->getType())->getNumElements())
1378 //===----------------------------------------------------------------------===//
1379 // BinaryOperator Class
1380 //===----------------------------------------------------------------------===//
1382 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1383 const Type *Ty, const std::string &Name,
1384 Instruction *InsertBefore)
1385 : Instruction(Ty, iType, Ops, 2, InsertBefore) {
1386 Ops[0].init(S1, this);
1387 Ops[1].init(S2, this);
1392 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1393 const Type *Ty, const std::string &Name,
1394 BasicBlock *InsertAtEnd)
1395 : Instruction(Ty, iType, Ops, 2, InsertAtEnd) {
1396 Ops[0].init(S1, this);
1397 Ops[1].init(S2, this);
1403 void BinaryOperator::init(BinaryOps iType) {
1404 Value *LHS = getOperand(0), *RHS = getOperand(1);
1405 LHS = LHS; RHS = RHS; // Silence warnings.
1406 assert(LHS->getType() == RHS->getType() &&
1407 "Binary operator operand types must match!");
1412 assert(getType() == LHS->getType() &&
1413 "Arithmetic operation should return same type as operands!");
1414 assert((getType()->isInteger() || getType()->isFloatingPoint() ||
1415 isa<VectorType>(getType())) &&
1416 "Tried to create an arithmetic operation on a non-arithmetic type!");
1420 assert(getType() == LHS->getType() &&
1421 "Arithmetic operation should return same type as operands!");
1422 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1423 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1424 "Incorrect operand type (not integer) for S/UDIV");
1427 assert(getType() == LHS->getType() &&
1428 "Arithmetic operation should return same type as operands!");
1429 assert((getType()->isFloatingPoint() || (isa<VectorType>(getType()) &&
1430 cast<VectorType>(getType())->getElementType()->isFloatingPoint()))
1431 && "Incorrect operand type (not floating point) for FDIV");
1435 assert(getType() == LHS->getType() &&
1436 "Arithmetic operation should return same type as operands!");
1437 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1438 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1439 "Incorrect operand type (not integer) for S/UREM");
1442 assert(getType() == LHS->getType() &&
1443 "Arithmetic operation should return same type as operands!");
1444 assert((getType()->isFloatingPoint() || (isa<VectorType>(getType()) &&
1445 cast<VectorType>(getType())->getElementType()->isFloatingPoint()))
1446 && "Incorrect operand type (not floating point) for FREM");
1451 assert(getType() == LHS->getType() &&
1452 "Shift operation should return same type as operands!");
1453 assert(getType()->isInteger() &&
1454 "Shift operation requires integer operands");
1458 assert(getType() == LHS->getType() &&
1459 "Logical operation should return same type as operands!");
1460 assert((getType()->isInteger() ||
1461 (isa<VectorType>(getType()) &&
1462 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1463 "Tried to create a logical operation on a non-integral type!");
1471 BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
1472 const std::string &Name,
1473 Instruction *InsertBefore) {
1474 assert(S1->getType() == S2->getType() &&
1475 "Cannot create binary operator with two operands of differing type!");
1476 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1479 BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
1480 const std::string &Name,
1481 BasicBlock *InsertAtEnd) {
1482 BinaryOperator *Res = create(Op, S1, S2, Name);
1483 InsertAtEnd->getInstList().push_back(Res);
1487 BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
1488 Instruction *InsertBefore) {
1489 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1490 return new BinaryOperator(Instruction::Sub,
1492 Op->getType(), Name, InsertBefore);
1495 BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
1496 BasicBlock *InsertAtEnd) {
1497 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1498 return new BinaryOperator(Instruction::Sub,
1500 Op->getType(), Name, InsertAtEnd);
1503 BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
1504 Instruction *InsertBefore) {
1506 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1507 C = ConstantInt::getAllOnesValue(PTy->getElementType());
1508 C = ConstantVector::get(std::vector<Constant*>(PTy->getNumElements(), C));
1510 C = ConstantInt::getAllOnesValue(Op->getType());
1513 return new BinaryOperator(Instruction::Xor, Op, C,
1514 Op->getType(), Name, InsertBefore);
1517 BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
1518 BasicBlock *InsertAtEnd) {
1520 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1521 // Create a vector of all ones values.
1522 Constant *Elt = ConstantInt::getAllOnesValue(PTy->getElementType());
1524 ConstantVector::get(std::vector<Constant*>(PTy->getNumElements(), Elt));
1526 AllOnes = ConstantInt::getAllOnesValue(Op->getType());
1529 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1530 Op->getType(), Name, InsertAtEnd);
1534 // isConstantAllOnes - Helper function for several functions below
1535 static inline bool isConstantAllOnes(const Value *V) {
1536 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V))
1537 return CI->isAllOnesValue();
1538 if (const ConstantVector *CV = dyn_cast<ConstantVector>(V))
1539 return CV->isAllOnesValue();
1543 bool BinaryOperator::isNeg(const Value *V) {
1544 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1545 if (Bop->getOpcode() == Instruction::Sub)
1546 return Bop->getOperand(0) ==
1547 ConstantExpr::getZeroValueForNegationExpr(Bop->getType());
1551 bool BinaryOperator::isNot(const Value *V) {
1552 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1553 return (Bop->getOpcode() == Instruction::Xor &&
1554 (isConstantAllOnes(Bop->getOperand(1)) ||
1555 isConstantAllOnes(Bop->getOperand(0))));
1559 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1560 assert(isNeg(BinOp) && "getNegArgument from non-'neg' instruction!");
1561 return cast<BinaryOperator>(BinOp)->getOperand(1);
1564 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1565 return getNegArgument(const_cast<Value*>(BinOp));
1568 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1569 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1570 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1571 Value *Op0 = BO->getOperand(0);
1572 Value *Op1 = BO->getOperand(1);
1573 if (isConstantAllOnes(Op0)) return Op1;
1575 assert(isConstantAllOnes(Op1));
1579 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1580 return getNotArgument(const_cast<Value*>(BinOp));
1584 // swapOperands - Exchange the two operands to this instruction. This
1585 // instruction is safe to use on any binary instruction and does not
1586 // modify the semantics of the instruction. If the instruction is
1587 // order dependent (SetLT f.e.) the opcode is changed.
1589 bool BinaryOperator::swapOperands() {
1590 if (!isCommutative())
1591 return true; // Can't commute operands
1592 std::swap(Ops[0], Ops[1]);
1596 //===----------------------------------------------------------------------===//
1598 //===----------------------------------------------------------------------===//
1600 // Just determine if this cast only deals with integral->integral conversion.
1601 bool CastInst::isIntegerCast() const {
1602 switch (getOpcode()) {
1603 default: return false;
1604 case Instruction::ZExt:
1605 case Instruction::SExt:
1606 case Instruction::Trunc:
1608 case Instruction::BitCast:
1609 return getOperand(0)->getType()->isInteger() && getType()->isInteger();
1613 bool CastInst::isLosslessCast() const {
1614 // Only BitCast can be lossless, exit fast if we're not BitCast
1615 if (getOpcode() != Instruction::BitCast)
1618 // Identity cast is always lossless
1619 const Type* SrcTy = getOperand(0)->getType();
1620 const Type* DstTy = getType();
1624 // Pointer to pointer is always lossless.
1625 if (isa<PointerType>(SrcTy))
1626 return isa<PointerType>(DstTy);
1627 return false; // Other types have no identity values
1630 /// This function determines if the CastInst does not require any bits to be
1631 /// changed in order to effect the cast. Essentially, it identifies cases where
1632 /// no code gen is necessary for the cast, hence the name no-op cast. For
1633 /// example, the following are all no-op casts:
1634 /// # bitcast uint %X, int
1635 /// # bitcast uint* %x, sbyte*
1636 /// # bitcast vector< 2 x int > %x, vector< 4 x short>
1637 /// # ptrtoint uint* %x, uint ; on 32-bit plaforms only
1638 /// @brief Determine if a cast is a no-op.
1639 bool CastInst::isNoopCast(const Type *IntPtrTy) const {
1640 switch (getOpcode()) {
1642 assert(!"Invalid CastOp");
1643 case Instruction::Trunc:
1644 case Instruction::ZExt:
1645 case Instruction::SExt:
1646 case Instruction::FPTrunc:
1647 case Instruction::FPExt:
1648 case Instruction::UIToFP:
1649 case Instruction::SIToFP:
1650 case Instruction::FPToUI:
1651 case Instruction::FPToSI:
1652 return false; // These always modify bits
1653 case Instruction::BitCast:
1654 return true; // BitCast never modifies bits.
1655 case Instruction::PtrToInt:
1656 return IntPtrTy->getPrimitiveSizeInBits() ==
1657 getType()->getPrimitiveSizeInBits();
1658 case Instruction::IntToPtr:
1659 return IntPtrTy->getPrimitiveSizeInBits() ==
1660 getOperand(0)->getType()->getPrimitiveSizeInBits();
1664 /// This function determines if a pair of casts can be eliminated and what
1665 /// opcode should be used in the elimination. This assumes that there are two
1666 /// instructions like this:
1667 /// * %F = firstOpcode SrcTy %x to MidTy
1668 /// * %S = secondOpcode MidTy %F to DstTy
1669 /// The function returns a resultOpcode so these two casts can be replaced with:
1670 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
1671 /// If no such cast is permited, the function returns 0.
1672 unsigned CastInst::isEliminableCastPair(
1673 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
1674 const Type *SrcTy, const Type *MidTy, const Type *DstTy, const Type *IntPtrTy)
1676 // Define the 144 possibilities for these two cast instructions. The values
1677 // in this matrix determine what to do in a given situation and select the
1678 // case in the switch below. The rows correspond to firstOp, the columns
1679 // correspond to secondOp. In looking at the table below, keep in mind
1680 // the following cast properties:
1682 // Size Compare Source Destination
1683 // Operator Src ? Size Type Sign Type Sign
1684 // -------- ------------ ------------------- ---------------------
1685 // TRUNC > Integer Any Integral Any
1686 // ZEXT < Integral Unsigned Integer Any
1687 // SEXT < Integral Signed Integer Any
1688 // FPTOUI n/a FloatPt n/a Integral Unsigned
1689 // FPTOSI n/a FloatPt n/a Integral Signed
1690 // UITOFP n/a Integral Unsigned FloatPt n/a
1691 // SITOFP n/a Integral Signed FloatPt n/a
1692 // FPTRUNC > FloatPt n/a FloatPt n/a
1693 // FPEXT < FloatPt n/a FloatPt n/a
1694 // PTRTOINT n/a Pointer n/a Integral Unsigned
1695 // INTTOPTR n/a Integral Unsigned Pointer n/a
1696 // BITCONVERT = FirstClass n/a FirstClass n/a
1698 // NOTE: some transforms are safe, but we consider them to be non-profitable.
1699 // For example, we could merge "fptoui double to uint" + "zext uint to ulong",
1700 // into "fptoui double to ulong", but this loses information about the range
1701 // of the produced value (we no longer know the top-part is all zeros).
1702 // Further this conversion is often much more expensive for typical hardware,
1703 // and causes issues when building libgcc. We disallow fptosi+sext for the
1705 const unsigned numCastOps =
1706 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
1707 static const uint8_t CastResults[numCastOps][numCastOps] = {
1708 // T F F U S F F P I B -+
1709 // R Z S P P I I T P 2 N T |
1710 // U E E 2 2 2 2 R E I T C +- secondOp
1711 // N X X U S F F N X N 2 V |
1712 // C T T I I P P C T T P T -+
1713 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
1714 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
1715 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
1716 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
1717 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
1718 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
1719 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
1720 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
1721 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
1722 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
1723 { 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
1724 { 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
1727 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
1728 [secondOp-Instruction::CastOpsBegin];
1731 // categorically disallowed
1734 // allowed, use first cast's opcode
1737 // allowed, use second cast's opcode
1740 // no-op cast in second op implies firstOp as long as the DestTy
1742 if (DstTy->isInteger())
1746 // no-op cast in second op implies firstOp as long as the DestTy
1747 // is floating point
1748 if (DstTy->isFloatingPoint())
1752 // no-op cast in first op implies secondOp as long as the SrcTy
1754 if (SrcTy->isInteger())
1758 // no-op cast in first op implies secondOp as long as the SrcTy
1759 // is a floating point
1760 if (SrcTy->isFloatingPoint())
1764 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size
1765 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1766 unsigned MidSize = MidTy->getPrimitiveSizeInBits();
1767 if (MidSize >= PtrSize)
1768 return Instruction::BitCast;
1772 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
1773 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
1774 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
1775 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1776 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1777 if (SrcSize == DstSize)
1778 return Instruction::BitCast;
1779 else if (SrcSize < DstSize)
1783 case 9: // zext, sext -> zext, because sext can't sign extend after zext
1784 return Instruction::ZExt;
1786 // fpext followed by ftrunc is allowed if the bit size returned to is
1787 // the same as the original, in which case its just a bitcast
1789 return Instruction::BitCast;
1790 return 0; // If the types are not the same we can't eliminate it.
1792 // bitcast followed by ptrtoint is allowed as long as the bitcast
1793 // is a pointer to pointer cast.
1794 if (isa<PointerType>(SrcTy) && isa<PointerType>(MidTy))
1798 // inttoptr, bitcast -> intptr if bitcast is a ptr to ptr cast
1799 if (isa<PointerType>(MidTy) && isa<PointerType>(DstTy))
1803 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
1804 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1805 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1806 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1807 if (SrcSize <= PtrSize && SrcSize == DstSize)
1808 return Instruction::BitCast;
1812 // cast combination can't happen (error in input). This is for all cases
1813 // where the MidTy is not the same for the two cast instructions.
1814 assert(!"Invalid Cast Combination");
1817 assert(!"Error in CastResults table!!!");
1823 CastInst *CastInst::create(Instruction::CastOps op, Value *S, const Type *Ty,
1824 const std::string &Name, Instruction *InsertBefore) {
1825 // Construct and return the appropriate CastInst subclass
1827 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
1828 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
1829 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
1830 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
1831 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
1832 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
1833 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
1834 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
1835 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
1836 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
1837 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
1838 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
1840 assert(!"Invalid opcode provided");
1845 CastInst *CastInst::create(Instruction::CastOps op, Value *S, const Type *Ty,
1846 const std::string &Name, BasicBlock *InsertAtEnd) {
1847 // Construct and return the appropriate CastInst subclass
1849 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
1850 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
1851 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
1852 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
1853 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
1854 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
1855 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
1856 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
1857 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
1858 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
1859 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
1860 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
1862 assert(!"Invalid opcode provided");
1867 CastInst *CastInst::createZExtOrBitCast(Value *S, const Type *Ty,
1868 const std::string &Name,
1869 Instruction *InsertBefore) {
1870 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1871 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1872 return create(Instruction::ZExt, S, Ty, Name, InsertBefore);
1875 CastInst *CastInst::createZExtOrBitCast(Value *S, const Type *Ty,
1876 const std::string &Name,
1877 BasicBlock *InsertAtEnd) {
1878 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1879 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1880 return create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
1883 CastInst *CastInst::createSExtOrBitCast(Value *S, const Type *Ty,
1884 const std::string &Name,
1885 Instruction *InsertBefore) {
1886 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1887 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1888 return create(Instruction::SExt, S, Ty, Name, InsertBefore);
1891 CastInst *CastInst::createSExtOrBitCast(Value *S, const Type *Ty,
1892 const std::string &Name,
1893 BasicBlock *InsertAtEnd) {
1894 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1895 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1896 return create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
1899 CastInst *CastInst::createTruncOrBitCast(Value *S, const Type *Ty,
1900 const std::string &Name,
1901 Instruction *InsertBefore) {
1902 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1903 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1904 return create(Instruction::Trunc, S, Ty, Name, InsertBefore);
1907 CastInst *CastInst::createTruncOrBitCast(Value *S, const Type *Ty,
1908 const std::string &Name,
1909 BasicBlock *InsertAtEnd) {
1910 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1911 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1912 return create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
1915 CastInst *CastInst::createPointerCast(Value *S, const Type *Ty,
1916 const std::string &Name,
1917 BasicBlock *InsertAtEnd) {
1918 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1919 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
1922 if (Ty->isInteger())
1923 return create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
1924 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1927 /// @brief Create a BitCast or a PtrToInt cast instruction
1928 CastInst *CastInst::createPointerCast(Value *S, const Type *Ty,
1929 const std::string &Name,
1930 Instruction *InsertBefore) {
1931 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1932 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
1935 if (Ty->isInteger())
1936 return create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
1937 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1940 CastInst *CastInst::createIntegerCast(Value *C, const Type *Ty,
1941 bool isSigned, const std::string &Name,
1942 Instruction *InsertBefore) {
1943 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1944 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1945 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1946 Instruction::CastOps opcode =
1947 (SrcBits == DstBits ? Instruction::BitCast :
1948 (SrcBits > DstBits ? Instruction::Trunc :
1949 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1950 return create(opcode, C, Ty, Name, InsertBefore);
1953 CastInst *CastInst::createIntegerCast(Value *C, const Type *Ty,
1954 bool isSigned, const std::string &Name,
1955 BasicBlock *InsertAtEnd) {
1956 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1957 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1958 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1959 Instruction::CastOps opcode =
1960 (SrcBits == DstBits ? Instruction::BitCast :
1961 (SrcBits > DstBits ? Instruction::Trunc :
1962 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1963 return create(opcode, C, Ty, Name, InsertAtEnd);
1966 CastInst *CastInst::createFPCast(Value *C, const Type *Ty,
1967 const std::string &Name,
1968 Instruction *InsertBefore) {
1969 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1971 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1972 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1973 Instruction::CastOps opcode =
1974 (SrcBits == DstBits ? Instruction::BitCast :
1975 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
1976 return create(opcode, C, Ty, Name, InsertBefore);
1979 CastInst *CastInst::createFPCast(Value *C, const Type *Ty,
1980 const std::string &Name,
1981 BasicBlock *InsertAtEnd) {
1982 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1984 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1985 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1986 Instruction::CastOps opcode =
1987 (SrcBits == DstBits ? Instruction::BitCast :
1988 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
1989 return create(opcode, C, Ty, Name, InsertAtEnd);
1992 // Check whether it is valid to call getCastOpcode for these types.
1993 // This routine must be kept in sync with getCastOpcode.
1994 bool CastInst::isCastable(const Type *SrcTy, const Type *DestTy) {
1995 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
1998 if (SrcTy == DestTy)
2001 // Get the bit sizes, we'll need these
2002 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2003 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2005 // Run through the possibilities ...
2006 if (DestTy->isInteger()) { // Casting to integral
2007 if (SrcTy->isInteger()) { // Casting from integral
2009 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2011 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2012 // Casting from vector
2013 return DestBits == PTy->getBitWidth();
2014 } else { // Casting from something else
2015 return isa<PointerType>(SrcTy);
2017 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2018 if (SrcTy->isInteger()) { // Casting from integral
2020 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2022 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2023 // Casting from vector
2024 return DestBits == PTy->getBitWidth();
2025 } else { // Casting from something else
2028 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2029 // Casting to vector
2030 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2031 // Casting from vector
2032 return DestPTy->getBitWidth() == SrcPTy->getBitWidth();
2033 } else { // Casting from something else
2034 return DestPTy->getBitWidth() == SrcBits;
2036 } else if (isa<PointerType>(DestTy)) { // Casting to pointer
2037 if (isa<PointerType>(SrcTy)) { // Casting from pointer
2039 } else if (SrcTy->isInteger()) { // Casting from integral
2041 } else { // Casting from something else
2044 } else { // Casting to something else
2049 // Provide a way to get a "cast" where the cast opcode is inferred from the
2050 // types and size of the operand. This, basically, is a parallel of the
2051 // logic in the castIsValid function below. This axiom should hold:
2052 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
2053 // should not assert in castIsValid. In other words, this produces a "correct"
2054 // casting opcode for the arguments passed to it.
2055 // This routine must be kept in sync with isCastable.
2056 Instruction::CastOps
2057 CastInst::getCastOpcode(
2058 const Value *Src, bool SrcIsSigned, const Type *DestTy, bool DestIsSigned) {
2059 // Get the bit sizes, we'll need these
2060 const Type *SrcTy = Src->getType();
2061 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2062 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2064 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2065 "Only first class types are castable!");
2067 // Run through the possibilities ...
2068 if (DestTy->isInteger()) { // Casting to integral
2069 if (SrcTy->isInteger()) { // Casting from integral
2070 if (DestBits < SrcBits)
2071 return Trunc; // int -> smaller int
2072 else if (DestBits > SrcBits) { // its an extension
2074 return SExt; // signed -> SEXT
2076 return ZExt; // unsigned -> ZEXT
2078 return BitCast; // Same size, No-op cast
2080 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2082 return FPToSI; // FP -> sint
2084 return FPToUI; // FP -> uint
2085 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2086 assert(DestBits == PTy->getBitWidth() &&
2087 "Casting vector to integer of different width");
2088 return BitCast; // Same size, no-op cast
2090 assert(isa<PointerType>(SrcTy) &&
2091 "Casting from a value that is not first-class type");
2092 return PtrToInt; // ptr -> int
2094 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2095 if (SrcTy->isInteger()) { // Casting from integral
2097 return SIToFP; // sint -> FP
2099 return UIToFP; // uint -> FP
2100 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2101 if (DestBits < SrcBits) {
2102 return FPTrunc; // FP -> smaller FP
2103 } else if (DestBits > SrcBits) {
2104 return FPExt; // FP -> larger FP
2106 return BitCast; // same size, no-op cast
2108 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2109 assert(DestBits == PTy->getBitWidth() &&
2110 "Casting vector to floating point of different width");
2111 return BitCast; // same size, no-op cast
2113 assert(0 && "Casting pointer or non-first class to float");
2115 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2116 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2117 assert(DestPTy->getBitWidth() == SrcPTy->getBitWidth() &&
2118 "Casting vector to vector of different widths");
2119 return BitCast; // vector -> vector
2120 } else if (DestPTy->getBitWidth() == SrcBits) {
2121 return BitCast; // float/int -> vector
2123 assert(!"Illegal cast to vector (wrong type or size)");
2125 } else if (isa<PointerType>(DestTy)) {
2126 if (isa<PointerType>(SrcTy)) {
2127 return BitCast; // ptr -> ptr
2128 } else if (SrcTy->isInteger()) {
2129 return IntToPtr; // int -> ptr
2131 assert(!"Casting pointer to other than pointer or int");
2134 assert(!"Casting to type that is not first-class");
2137 // If we fall through to here we probably hit an assertion cast above
2138 // and assertions are not turned on. Anything we return is an error, so
2139 // BitCast is as good a choice as any.
2143 //===----------------------------------------------------------------------===//
2144 // CastInst SubClass Constructors
2145 //===----------------------------------------------------------------------===//
2147 /// Check that the construction parameters for a CastInst are correct. This
2148 /// could be broken out into the separate constructors but it is useful to have
2149 /// it in one place and to eliminate the redundant code for getting the sizes
2150 /// of the types involved.
2152 CastInst::castIsValid(Instruction::CastOps op, Value *S, const Type *DstTy) {
2154 // Check for type sanity on the arguments
2155 const Type *SrcTy = S->getType();
2156 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType())
2159 // Get the size of the types in bits, we'll need this later
2160 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
2161 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
2163 // Switch on the opcode provided
2165 default: return false; // This is an input error
2166 case Instruction::Trunc:
2167 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize > DstBitSize;
2168 case Instruction::ZExt:
2169 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize < DstBitSize;
2170 case Instruction::SExt:
2171 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize < DstBitSize;
2172 case Instruction::FPTrunc:
2173 return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
2174 SrcBitSize > DstBitSize;
2175 case Instruction::FPExt:
2176 return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
2177 SrcBitSize < DstBitSize;
2178 case Instruction::UIToFP:
2179 case Instruction::SIToFP:
2180 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2181 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2182 return SVTy->getElementType()->isInteger() &&
2183 DVTy->getElementType()->isFloatingPoint() &&
2184 SVTy->getNumElements() == DVTy->getNumElements();
2187 return SrcTy->isInteger() && DstTy->isFloatingPoint();
2188 case Instruction::FPToUI:
2189 case Instruction::FPToSI:
2190 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2191 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2192 return SVTy->getElementType()->isFloatingPoint() &&
2193 DVTy->getElementType()->isInteger() &&
2194 SVTy->getNumElements() == DVTy->getNumElements();
2197 return SrcTy->isFloatingPoint() && DstTy->isInteger();
2198 case Instruction::PtrToInt:
2199 return isa<PointerType>(SrcTy) && DstTy->isInteger();
2200 case Instruction::IntToPtr:
2201 return SrcTy->isInteger() && isa<PointerType>(DstTy);
2202 case Instruction::BitCast:
2203 // BitCast implies a no-op cast of type only. No bits change.
2204 // However, you can't cast pointers to anything but pointers.
2205 if (isa<PointerType>(SrcTy) != isa<PointerType>(DstTy))
2208 // Now we know we're not dealing with a pointer/non-pointer mismatch. In all
2209 // these cases, the cast is okay if the source and destination bit widths
2211 return SrcBitSize == DstBitSize;
2215 TruncInst::TruncInst(
2216 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2217 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2218 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2221 TruncInst::TruncInst(
2222 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2223 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2224 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2228 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2229 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2230 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2234 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2235 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2236 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2239 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2240 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2241 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2245 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2246 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2247 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2250 FPTruncInst::FPTruncInst(
2251 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2252 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2253 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2256 FPTruncInst::FPTruncInst(
2257 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2258 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2259 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2262 FPExtInst::FPExtInst(
2263 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2264 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2265 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2268 FPExtInst::FPExtInst(
2269 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2270 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2271 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2274 UIToFPInst::UIToFPInst(
2275 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2276 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2277 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2280 UIToFPInst::UIToFPInst(
2281 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2282 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2283 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2286 SIToFPInst::SIToFPInst(
2287 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2288 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2289 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2292 SIToFPInst::SIToFPInst(
2293 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2294 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2295 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2298 FPToUIInst::FPToUIInst(
2299 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2300 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2301 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2304 FPToUIInst::FPToUIInst(
2305 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2306 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2307 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2310 FPToSIInst::FPToSIInst(
2311 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2312 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2313 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2316 FPToSIInst::FPToSIInst(
2317 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2318 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2319 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2322 PtrToIntInst::PtrToIntInst(
2323 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2324 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2325 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2328 PtrToIntInst::PtrToIntInst(
2329 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2330 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2331 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2334 IntToPtrInst::IntToPtrInst(
2335 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2336 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2337 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2340 IntToPtrInst::IntToPtrInst(
2341 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2342 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2343 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2346 BitCastInst::BitCastInst(
2347 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2348 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2349 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2352 BitCastInst::BitCastInst(
2353 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2354 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2355 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2358 //===----------------------------------------------------------------------===//
2360 //===----------------------------------------------------------------------===//
2362 CmpInst::CmpInst(OtherOps op, unsigned short predicate, Value *LHS, Value *RHS,
2363 const std::string &Name, Instruction *InsertBefore)
2364 : Instruction(Type::Int1Ty, op, Ops, 2, InsertBefore) {
2365 Ops[0].init(LHS, this);
2366 Ops[1].init(RHS, this);
2367 SubclassData = predicate;
2369 if (op == Instruction::ICmp) {
2370 assert(predicate >= ICmpInst::FIRST_ICMP_PREDICATE &&
2371 predicate <= ICmpInst::LAST_ICMP_PREDICATE &&
2372 "Invalid ICmp predicate value");
2373 const Type* Op0Ty = getOperand(0)->getType();
2374 const Type* Op1Ty = getOperand(1)->getType();
2375 assert(Op0Ty == Op1Ty &&
2376 "Both operands to ICmp instruction are not of the same type!");
2377 // Check that the operands are the right type
2378 assert((Op0Ty->isInteger() || isa<PointerType>(Op0Ty)) &&
2379 "Invalid operand types for ICmp instruction");
2382 assert(op == Instruction::FCmp && "Invalid CmpInst opcode");
2383 assert(predicate <= FCmpInst::LAST_FCMP_PREDICATE &&
2384 "Invalid FCmp predicate value");
2385 const Type* Op0Ty = getOperand(0)->getType();
2386 const Type* Op1Ty = getOperand(1)->getType();
2387 assert(Op0Ty == Op1Ty &&
2388 "Both operands to FCmp instruction are not of the same type!");
2389 // Check that the operands are the right type
2390 assert(Op0Ty->isFloatingPoint() &&
2391 "Invalid operand types for FCmp instruction");
2394 CmpInst::CmpInst(OtherOps op, unsigned short predicate, Value *LHS, Value *RHS,
2395 const std::string &Name, BasicBlock *InsertAtEnd)
2396 : Instruction(Type::Int1Ty, op, Ops, 2, InsertAtEnd) {
2397 Ops[0].init(LHS, this);
2398 Ops[1].init(RHS, this);
2399 SubclassData = predicate;
2401 if (op == Instruction::ICmp) {
2402 assert(predicate >= ICmpInst::FIRST_ICMP_PREDICATE &&
2403 predicate <= ICmpInst::LAST_ICMP_PREDICATE &&
2404 "Invalid ICmp predicate value");
2406 const Type* Op0Ty = getOperand(0)->getType();
2407 const Type* Op1Ty = getOperand(1)->getType();
2408 assert(Op0Ty == Op1Ty &&
2409 "Both operands to ICmp instruction are not of the same type!");
2410 // Check that the operands are the right type
2411 assert((Op0Ty->isInteger() || isa<PointerType>(Op0Ty)) &&
2412 "Invalid operand types for ICmp instruction");
2415 assert(op == Instruction::FCmp && "Invalid CmpInst opcode");
2416 assert(predicate <= FCmpInst::LAST_FCMP_PREDICATE &&
2417 "Invalid FCmp predicate value");
2418 const Type* Op0Ty = getOperand(0)->getType();
2419 const Type* Op1Ty = getOperand(1)->getType();
2420 assert(Op0Ty == Op1Ty &&
2421 "Both operands to FCmp instruction are not of the same type!");
2422 // Check that the operands are the right type
2423 assert(Op0Ty->isFloatingPoint() &&
2424 "Invalid operand types for FCmp instruction");
2428 CmpInst::create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2429 const std::string &Name, Instruction *InsertBefore) {
2430 if (Op == Instruction::ICmp) {
2431 return new ICmpInst(ICmpInst::Predicate(predicate), S1, S2, Name,
2434 return new FCmpInst(FCmpInst::Predicate(predicate), S1, S2, Name,
2439 CmpInst::create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2440 const std::string &Name, BasicBlock *InsertAtEnd) {
2441 if (Op == Instruction::ICmp) {
2442 return new ICmpInst(ICmpInst::Predicate(predicate), S1, S2, Name,
2445 return new FCmpInst(FCmpInst::Predicate(predicate), S1, S2, Name,
2449 void CmpInst::swapOperands() {
2450 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2453 cast<FCmpInst>(this)->swapOperands();
2456 bool CmpInst::isCommutative() {
2457 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2458 return IC->isCommutative();
2459 return cast<FCmpInst>(this)->isCommutative();
2462 bool CmpInst::isEquality() {
2463 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2464 return IC->isEquality();
2465 return cast<FCmpInst>(this)->isEquality();
2469 ICmpInst::Predicate ICmpInst::getInversePredicate(Predicate pred) {
2472 assert(!"Unknown icmp predicate!");
2473 case ICMP_EQ: return ICMP_NE;
2474 case ICMP_NE: return ICMP_EQ;
2475 case ICMP_UGT: return ICMP_ULE;
2476 case ICMP_ULT: return ICMP_UGE;
2477 case ICMP_UGE: return ICMP_ULT;
2478 case ICMP_ULE: return ICMP_UGT;
2479 case ICMP_SGT: return ICMP_SLE;
2480 case ICMP_SLT: return ICMP_SGE;
2481 case ICMP_SGE: return ICMP_SLT;
2482 case ICMP_SLE: return ICMP_SGT;
2486 ICmpInst::Predicate ICmpInst::getSwappedPredicate(Predicate pred) {
2488 default: assert(! "Unknown icmp predicate!");
2489 case ICMP_EQ: case ICMP_NE:
2491 case ICMP_SGT: return ICMP_SLT;
2492 case ICMP_SLT: return ICMP_SGT;
2493 case ICMP_SGE: return ICMP_SLE;
2494 case ICMP_SLE: return ICMP_SGE;
2495 case ICMP_UGT: return ICMP_ULT;
2496 case ICMP_ULT: return ICMP_UGT;
2497 case ICMP_UGE: return ICMP_ULE;
2498 case ICMP_ULE: return ICMP_UGE;
2502 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
2504 default: assert(! "Unknown icmp predicate!");
2505 case ICMP_EQ: case ICMP_NE:
2506 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2508 case ICMP_UGT: return ICMP_SGT;
2509 case ICMP_ULT: return ICMP_SLT;
2510 case ICMP_UGE: return ICMP_SGE;
2511 case ICMP_ULE: return ICMP_SLE;
2515 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
2517 default: assert(! "Unknown icmp predicate!");
2518 case ICMP_EQ: case ICMP_NE:
2519 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
2521 case ICMP_SGT: return ICMP_UGT;
2522 case ICMP_SLT: return ICMP_ULT;
2523 case ICMP_SGE: return ICMP_UGE;
2524 case ICMP_SLE: return ICMP_ULE;
2528 bool ICmpInst::isSignedPredicate(Predicate pred) {
2530 default: assert(! "Unknown icmp predicate!");
2531 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2533 case ICMP_EQ: case ICMP_NE: case ICMP_UGT: case ICMP_ULT:
2534 case ICMP_UGE: case ICMP_ULE:
2539 /// Initialize a set of values that all satisfy the condition with C.
2542 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
2545 uint32_t BitWidth = C.getBitWidth();
2547 default: assert(0 && "Invalid ICmp opcode to ConstantRange ctor!");
2548 case ICmpInst::ICMP_EQ: Upper++; break;
2549 case ICmpInst::ICMP_NE: Lower++; break;
2550 case ICmpInst::ICMP_ULT: Lower = APInt::getMinValue(BitWidth); break;
2551 case ICmpInst::ICMP_SLT: Lower = APInt::getSignedMinValue(BitWidth); break;
2552 case ICmpInst::ICMP_UGT:
2553 Lower++; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2555 case ICmpInst::ICMP_SGT:
2556 Lower++; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2558 case ICmpInst::ICMP_ULE:
2559 Lower = APInt::getMinValue(BitWidth); Upper++;
2561 case ICmpInst::ICMP_SLE:
2562 Lower = APInt::getSignedMinValue(BitWidth); Upper++;
2564 case ICmpInst::ICMP_UGE:
2565 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2567 case ICmpInst::ICMP_SGE:
2568 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2571 return ConstantRange(Lower, Upper);
2574 FCmpInst::Predicate FCmpInst::getInversePredicate(Predicate pred) {
2577 assert(!"Unknown icmp predicate!");
2578 case FCMP_OEQ: return FCMP_UNE;
2579 case FCMP_ONE: return FCMP_UEQ;
2580 case FCMP_OGT: return FCMP_ULE;
2581 case FCMP_OLT: return FCMP_UGE;
2582 case FCMP_OGE: return FCMP_ULT;
2583 case FCMP_OLE: return FCMP_UGT;
2584 case FCMP_UEQ: return FCMP_ONE;
2585 case FCMP_UNE: return FCMP_OEQ;
2586 case FCMP_UGT: return FCMP_OLE;
2587 case FCMP_ULT: return FCMP_OGE;
2588 case FCMP_UGE: return FCMP_OLT;
2589 case FCMP_ULE: return FCMP_OGT;
2590 case FCMP_ORD: return FCMP_UNO;
2591 case FCMP_UNO: return FCMP_ORD;
2592 case FCMP_TRUE: return FCMP_FALSE;
2593 case FCMP_FALSE: return FCMP_TRUE;
2597 FCmpInst::Predicate FCmpInst::getSwappedPredicate(Predicate pred) {
2599 default: assert(!"Unknown fcmp predicate!");
2600 case FCMP_FALSE: case FCMP_TRUE:
2601 case FCMP_OEQ: case FCMP_ONE:
2602 case FCMP_UEQ: case FCMP_UNE:
2603 case FCMP_ORD: case FCMP_UNO:
2605 case FCMP_OGT: return FCMP_OLT;
2606 case FCMP_OLT: return FCMP_OGT;
2607 case FCMP_OGE: return FCMP_OLE;
2608 case FCMP_OLE: return FCMP_OGE;
2609 case FCMP_UGT: return FCMP_ULT;
2610 case FCMP_ULT: return FCMP_UGT;
2611 case FCMP_UGE: return FCMP_ULE;
2612 case FCMP_ULE: return FCMP_UGE;
2616 bool CmpInst::isUnsigned(unsigned short predicate) {
2617 switch (predicate) {
2618 default: return false;
2619 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
2620 case ICmpInst::ICMP_UGE: return true;
2624 bool CmpInst::isSigned(unsigned short predicate){
2625 switch (predicate) {
2626 default: return false;
2627 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
2628 case ICmpInst::ICMP_SGE: return true;
2632 bool CmpInst::isOrdered(unsigned short predicate) {
2633 switch (predicate) {
2634 default: return false;
2635 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
2636 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
2637 case FCmpInst::FCMP_ORD: return true;
2641 bool CmpInst::isUnordered(unsigned short predicate) {
2642 switch (predicate) {
2643 default: return false;
2644 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
2645 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
2646 case FCmpInst::FCMP_UNO: return true;
2650 //===----------------------------------------------------------------------===//
2651 // SwitchInst Implementation
2652 //===----------------------------------------------------------------------===//
2654 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumCases) {
2655 assert(Value && Default);
2656 ReservedSpace = 2+NumCases*2;
2658 OperandList = new Use[ReservedSpace];
2660 OperandList[0].init(Value, this);
2661 OperandList[1].init(Default, this);
2664 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2665 /// switch on and a default destination. The number of additional cases can
2666 /// be specified here to make memory allocation more efficient. This
2667 /// constructor can also autoinsert before another instruction.
2668 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2669 Instruction *InsertBefore)
2670 : TerminatorInst(Type::VoidTy, Instruction::Switch, 0, 0, InsertBefore) {
2671 init(Value, Default, NumCases);
2674 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2675 /// switch on and a default destination. The number of additional cases can
2676 /// be specified here to make memory allocation more efficient. This
2677 /// constructor also autoinserts at the end of the specified BasicBlock.
2678 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2679 BasicBlock *InsertAtEnd)
2680 : TerminatorInst(Type::VoidTy, Instruction::Switch, 0, 0, InsertAtEnd) {
2681 init(Value, Default, NumCases);
2684 SwitchInst::SwitchInst(const SwitchInst &SI)
2685 : TerminatorInst(Type::VoidTy, Instruction::Switch,
2686 new Use[SI.getNumOperands()], SI.getNumOperands()) {
2687 Use *OL = OperandList, *InOL = SI.OperandList;
2688 for (unsigned i = 0, E = SI.getNumOperands(); i != E; i+=2) {
2689 OL[i].init(InOL[i], this);
2690 OL[i+1].init(InOL[i+1], this);
2694 SwitchInst::~SwitchInst() {
2695 delete [] OperandList;
2699 /// addCase - Add an entry to the switch instruction...
2701 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
2702 unsigned OpNo = NumOperands;
2703 if (OpNo+2 > ReservedSpace)
2704 resizeOperands(0); // Get more space!
2705 // Initialize some new operands.
2706 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
2707 NumOperands = OpNo+2;
2708 OperandList[OpNo].init(OnVal, this);
2709 OperandList[OpNo+1].init(Dest, this);
2712 /// removeCase - This method removes the specified successor from the switch
2713 /// instruction. Note that this cannot be used to remove the default
2714 /// destination (successor #0).
2716 void SwitchInst::removeCase(unsigned idx) {
2717 assert(idx != 0 && "Cannot remove the default case!");
2718 assert(idx*2 < getNumOperands() && "Successor index out of range!!!");
2720 unsigned NumOps = getNumOperands();
2721 Use *OL = OperandList;
2723 // Move everything after this operand down.
2725 // FIXME: we could just swap with the end of the list, then erase. However,
2726 // client might not expect this to happen. The code as it is thrashes the
2727 // use/def lists, which is kinda lame.
2728 for (unsigned i = (idx+1)*2; i != NumOps; i += 2) {
2730 OL[i-2+1] = OL[i+1];
2733 // Nuke the last value.
2734 OL[NumOps-2].set(0);
2735 OL[NumOps-2+1].set(0);
2736 NumOperands = NumOps-2;
2739 /// resizeOperands - resize operands - This adjusts the length of the operands
2740 /// list according to the following behavior:
2741 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
2742 /// of operation. This grows the number of ops by 1.5 times.
2743 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
2744 /// 3. If NumOps == NumOperands, trim the reserved space.
2746 void SwitchInst::resizeOperands(unsigned NumOps) {
2748 NumOps = getNumOperands()/2*6;
2749 } else if (NumOps*2 > NumOperands) {
2750 // No resize needed.
2751 if (ReservedSpace >= NumOps) return;
2752 } else if (NumOps == NumOperands) {
2753 if (ReservedSpace == NumOps) return;
2758 ReservedSpace = NumOps;
2759 Use *NewOps = new Use[NumOps];
2760 Use *OldOps = OperandList;
2761 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2762 NewOps[i].init(OldOps[i], this);
2766 OperandList = NewOps;
2770 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
2771 return getSuccessor(idx);
2773 unsigned SwitchInst::getNumSuccessorsV() const {
2774 return getNumSuccessors();
2776 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
2777 setSuccessor(idx, B);
2780 //===----------------------------------------------------------------------===//
2781 // GetResultInst Implementation
2782 //===----------------------------------------------------------------------===//
2784 GetResultInst::GetResultInst(Value *Aggregate, unsigned Index,
2785 const std::string &Name,
2786 Instruction *InsertBef)
2787 : Instruction(cast<StructType>(Aggregate->getType())->getElementType(Index),
2788 GetResult, &Aggr, 1, InsertBef) {
2789 assert(isValidOperands(Aggregate, Index) && "Invalid GetResultInst operands!");
2790 Aggr.init(Aggregate, this);
2795 bool GetResultInst::isValidOperands(const Value *Aggregate, unsigned Index) {
2799 if (const StructType *STy = dyn_cast<StructType>(Aggregate->getType())) {
2800 unsigned NumElements = STy->getNumElements();
2801 if (Index >= NumElements)
2804 // getresult aggregate value's element types are restricted to
2805 // avoid nested aggregates.
2806 for (unsigned i = 0; i < NumElements; ++i)
2807 if (!STy->getElementType(i)->isFirstClassType())
2810 // Otherwise, Aggregate is valid.
2816 // Define these methods here so vtables don't get emitted into every translation
2817 // unit that uses these classes.
2819 GetElementPtrInst *GetElementPtrInst::clone() const {
2820 return new GetElementPtrInst(*this);
2823 BinaryOperator *BinaryOperator::clone() const {
2824 return create(getOpcode(), Ops[0], Ops[1]);
2827 FCmpInst* FCmpInst::clone() const {
2828 return new FCmpInst(getPredicate(), Ops[0], Ops[1]);
2830 ICmpInst* ICmpInst::clone() const {
2831 return new ICmpInst(getPredicate(), Ops[0], Ops[1]);
2834 MallocInst *MallocInst::clone() const { return new MallocInst(*this); }
2835 AllocaInst *AllocaInst::clone() const { return new AllocaInst(*this); }
2836 FreeInst *FreeInst::clone() const { return new FreeInst(getOperand(0)); }
2837 LoadInst *LoadInst::clone() const { return new LoadInst(*this); }
2838 StoreInst *StoreInst::clone() const { return new StoreInst(*this); }
2839 CastInst *TruncInst::clone() const { return new TruncInst(*this); }
2840 CastInst *ZExtInst::clone() const { return new ZExtInst(*this); }
2841 CastInst *SExtInst::clone() const { return new SExtInst(*this); }
2842 CastInst *FPTruncInst::clone() const { return new FPTruncInst(*this); }
2843 CastInst *FPExtInst::clone() const { return new FPExtInst(*this); }
2844 CastInst *UIToFPInst::clone() const { return new UIToFPInst(*this); }
2845 CastInst *SIToFPInst::clone() const { return new SIToFPInst(*this); }
2846 CastInst *FPToUIInst::clone() const { return new FPToUIInst(*this); }
2847 CastInst *FPToSIInst::clone() const { return new FPToSIInst(*this); }
2848 CastInst *PtrToIntInst::clone() const { return new PtrToIntInst(*this); }
2849 CastInst *IntToPtrInst::clone() const { return new IntToPtrInst(*this); }
2850 CastInst *BitCastInst::clone() const { return new BitCastInst(*this); }
2851 CallInst *CallInst::clone() const { return new CallInst(*this); }
2852 SelectInst *SelectInst::clone() const { return new SelectInst(*this); }
2853 VAArgInst *VAArgInst::clone() const { return new VAArgInst(*this); }
2855 ExtractElementInst *ExtractElementInst::clone() const {
2856 return new ExtractElementInst(*this);
2858 InsertElementInst *InsertElementInst::clone() const {
2859 return new InsertElementInst(*this);
2861 ShuffleVectorInst *ShuffleVectorInst::clone() const {
2862 return new ShuffleVectorInst(*this);
2864 PHINode *PHINode::clone() const { return new PHINode(*this); }
2865 ReturnInst *ReturnInst::clone() const { return new ReturnInst(*this); }
2866 BranchInst *BranchInst::clone() const { return new BranchInst(*this); }
2867 SwitchInst *SwitchInst::clone() const { return new SwitchInst(*this); }
2868 InvokeInst *InvokeInst::clone() const { return new InvokeInst(*this); }
2869 UnwindInst *UnwindInst::clone() const { return new UnwindInst(); }
2870 UnreachableInst *UnreachableInst::clone() const { return new UnreachableInst();}
2871 GetResultInst *GetResultInst::clone() const { return new GetResultInst(*this); }