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/Support/CallSite.h"
21 #include "llvm/Support/ConstantRange.h"
22 #include "llvm/Support/MathExtras.h"
25 //===----------------------------------------------------------------------===//
27 //===----------------------------------------------------------------------===//
29 CallSite::CallSite(Instruction *C) {
30 assert((isa<CallInst>(C) || isa<InvokeInst>(C)) && "Not a call!");
33 unsigned CallSite::getCallingConv() const {
34 if (CallInst *CI = dyn_cast<CallInst>(I))
35 return CI->getCallingConv();
37 return cast<InvokeInst>(I)->getCallingConv();
39 void CallSite::setCallingConv(unsigned CC) {
40 if (CallInst *CI = dyn_cast<CallInst>(I))
41 CI->setCallingConv(CC);
43 cast<InvokeInst>(I)->setCallingConv(CC);
45 const PAListPtr &CallSite::getParamAttrs() const {
46 if (CallInst *CI = dyn_cast<CallInst>(I))
47 return CI->getParamAttrs();
49 return cast<InvokeInst>(I)->getParamAttrs();
51 void CallSite::setParamAttrs(const PAListPtr &PAL) {
52 if (CallInst *CI = dyn_cast<CallInst>(I))
53 CI->setParamAttrs(PAL);
55 cast<InvokeInst>(I)->setParamAttrs(PAL);
57 bool CallSite::paramHasAttr(uint16_t i, ParameterAttributes attr) const {
58 if (CallInst *CI = dyn_cast<CallInst>(I))
59 return CI->paramHasAttr(i, attr);
61 return cast<InvokeInst>(I)->paramHasAttr(i, attr);
63 uint16_t CallSite::getParamAlignment(uint16_t i) const {
64 if (CallInst *CI = dyn_cast<CallInst>(I))
65 return CI->getParamAlignment(i);
67 return cast<InvokeInst>(I)->getParamAlignment(i);
70 bool CallSite::doesNotAccessMemory() const {
71 if (CallInst *CI = dyn_cast<CallInst>(I))
72 return CI->doesNotAccessMemory();
74 return cast<InvokeInst>(I)->doesNotAccessMemory();
76 bool CallSite::onlyReadsMemory() const {
77 if (CallInst *CI = dyn_cast<CallInst>(I))
78 return CI->onlyReadsMemory();
80 return cast<InvokeInst>(I)->onlyReadsMemory();
82 bool CallSite::doesNotThrow() const {
83 if (CallInst *CI = dyn_cast<CallInst>(I))
84 return CI->doesNotThrow();
86 return cast<InvokeInst>(I)->doesNotThrow();
88 void CallSite::setDoesNotThrow(bool doesNotThrow) {
89 if (CallInst *CI = dyn_cast<CallInst>(I))
90 CI->setDoesNotThrow(doesNotThrow);
92 cast<InvokeInst>(I)->setDoesNotThrow(doesNotThrow);
95 //===----------------------------------------------------------------------===//
96 // TerminatorInst Class
97 //===----------------------------------------------------------------------===//
99 // Out of line virtual method, so the vtable, etc has a home.
100 TerminatorInst::~TerminatorInst() {
103 //===----------------------------------------------------------------------===//
104 // UnaryInstruction Class
105 //===----------------------------------------------------------------------===//
107 // Out of line virtual method, so the vtable, etc has a home.
108 UnaryInstruction::~UnaryInstruction() {
111 //===----------------------------------------------------------------------===//
113 //===----------------------------------------------------------------------===//
115 PHINode::PHINode(const PHINode &PN)
116 : Instruction(PN.getType(), Instruction::PHI,
117 allocHungoffUses(PN.getNumOperands()), PN.getNumOperands()),
118 ReservedSpace(PN.getNumOperands()) {
119 Use *OL = OperandList;
120 for (unsigned i = 0, e = PN.getNumOperands(); i != e; i+=2) {
121 OL[i].init(PN.getOperand(i), this);
122 OL[i+1].init(PN.getOperand(i+1), this);
126 PHINode::~PHINode() {
127 dropHungoffUses(OperandList);
130 // removeIncomingValue - Remove an incoming value. This is useful if a
131 // predecessor basic block is deleted.
132 Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
133 unsigned NumOps = getNumOperands();
134 Use *OL = OperandList;
135 assert(Idx*2 < NumOps && "BB not in PHI node!");
136 Value *Removed = OL[Idx*2];
138 // Move everything after this operand down.
140 // FIXME: we could just swap with the end of the list, then erase. However,
141 // client might not expect this to happen. The code as it is thrashes the
142 // use/def lists, which is kinda lame.
143 for (unsigned i = (Idx+1)*2; i != NumOps; i += 2) {
148 // Nuke the last value.
150 OL[NumOps-2+1].set(0);
151 NumOperands = NumOps-2;
153 // If the PHI node is dead, because it has zero entries, nuke it now.
154 if (NumOps == 2 && DeletePHIIfEmpty) {
155 // If anyone is using this PHI, make them use a dummy value instead...
156 replaceAllUsesWith(UndefValue::get(getType()));
162 /// resizeOperands - resize operands - This adjusts the length of the operands
163 /// list according to the following behavior:
164 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
165 /// of operation. This grows the number of ops by 1.5 times.
166 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
167 /// 3. If NumOps == NumOperands, trim the reserved space.
169 void PHINode::resizeOperands(unsigned NumOps) {
170 unsigned e = getNumOperands();
173 if (NumOps < 4) NumOps = 4; // 4 op PHI nodes are VERY common.
174 } else if (NumOps*2 > NumOperands) {
176 if (ReservedSpace >= NumOps) return;
177 } else if (NumOps == NumOperands) {
178 if (ReservedSpace == NumOps) return;
183 ReservedSpace = NumOps;
184 Use *OldOps = OperandList;
185 Use *NewOps = allocHungoffUses(NumOps);
186 for (unsigned i = 0; i != e; ++i) {
187 NewOps[i].init(OldOps[i], this);
189 OperandList = NewOps;
190 if (OldOps) Use::zap(OldOps, OldOps + e, true);
193 /// hasConstantValue - If the specified PHI node always merges together the same
194 /// value, return the value, otherwise return null.
196 Value *PHINode::hasConstantValue(bool AllowNonDominatingInstruction) const {
197 // If the PHI node only has one incoming value, eliminate the PHI node...
198 if (getNumIncomingValues() == 1) {
199 if (getIncomingValue(0) != this) // not X = phi X
200 return getIncomingValue(0);
202 return UndefValue::get(getType()); // Self cycle is dead.
205 // Otherwise if all of the incoming values are the same for the PHI, replace
206 // the PHI node with the incoming value.
209 bool HasUndefInput = false;
210 for (unsigned i = 0, e = getNumIncomingValues(); i != e; ++i)
211 if (isa<UndefValue>(getIncomingValue(i))) {
212 HasUndefInput = true;
213 } else if (getIncomingValue(i) != this) { // Not the PHI node itself...
214 if (InVal && getIncomingValue(i) != InVal)
215 return 0; // Not the same, bail out.
217 InVal = getIncomingValue(i);
220 // The only case that could cause InVal to be null is if we have a PHI node
221 // that only has entries for itself. In this case, there is no entry into the
222 // loop, so kill the PHI.
224 if (InVal == 0) InVal = UndefValue::get(getType());
226 // If we have a PHI node like phi(X, undef, X), where X is defined by some
227 // instruction, we cannot always return X as the result of the PHI node. Only
228 // do this if X is not an instruction (thus it must dominate the PHI block),
229 // or if the client is prepared to deal with this possibility.
230 if (HasUndefInput && !AllowNonDominatingInstruction)
231 if (Instruction *IV = dyn_cast<Instruction>(InVal))
232 // If it's in the entry block, it dominates everything.
233 if (IV->getParent() != &IV->getParent()->getParent()->getEntryBlock() ||
235 return 0; // Cannot guarantee that InVal dominates this PHINode.
237 // All of the incoming values are the same, return the value now.
242 //===----------------------------------------------------------------------===//
243 // CallInst Implementation
244 //===----------------------------------------------------------------------===//
246 CallInst::~CallInst() {
249 void CallInst::init(Value *Func, Value* const *Params, unsigned NumParams) {
250 assert(NumOperands == NumParams+1 && "NumOperands not set up?");
251 Use *OL = OperandList;
252 OL[0].init(Func, this);
254 const FunctionType *FTy =
255 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
256 FTy = FTy; // silence warning.
258 assert((NumParams == FTy->getNumParams() ||
259 (FTy->isVarArg() && NumParams > FTy->getNumParams())) &&
260 "Calling a function with bad signature!");
261 for (unsigned i = 0; i != NumParams; ++i) {
262 assert((i >= FTy->getNumParams() ||
263 FTy->getParamType(i) == Params[i]->getType()) &&
264 "Calling a function with a bad signature!");
265 OL[i+1].init(Params[i], this);
269 void CallInst::init(Value *Func, Value *Actual1, Value *Actual2) {
270 assert(NumOperands == 3 && "NumOperands not set up?");
271 Use *OL = OperandList;
272 OL[0].init(Func, this);
273 OL[1].init(Actual1, this);
274 OL[2].init(Actual2, this);
276 const FunctionType *FTy =
277 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
278 FTy = FTy; // silence warning.
280 assert((FTy->getNumParams() == 2 ||
281 (FTy->isVarArg() && FTy->getNumParams() < 2)) &&
282 "Calling a function with bad signature");
283 assert((0 >= FTy->getNumParams() ||
284 FTy->getParamType(0) == Actual1->getType()) &&
285 "Calling a function with a bad signature!");
286 assert((1 >= FTy->getNumParams() ||
287 FTy->getParamType(1) == Actual2->getType()) &&
288 "Calling a function with a bad signature!");
291 void CallInst::init(Value *Func, Value *Actual) {
292 assert(NumOperands == 2 && "NumOperands not set up?");
293 Use *OL = OperandList;
294 OL[0].init(Func, this);
295 OL[1].init(Actual, this);
297 const FunctionType *FTy =
298 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
299 FTy = FTy; // silence warning.
301 assert((FTy->getNumParams() == 1 ||
302 (FTy->isVarArg() && FTy->getNumParams() == 0)) &&
303 "Calling a function with bad signature");
304 assert((0 == FTy->getNumParams() ||
305 FTy->getParamType(0) == Actual->getType()) &&
306 "Calling a function with a bad signature!");
309 void CallInst::init(Value *Func) {
310 assert(NumOperands == 1 && "NumOperands not set up?");
311 Use *OL = OperandList;
312 OL[0].init(Func, this);
314 const FunctionType *FTy =
315 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
316 FTy = FTy; // silence warning.
318 assert(FTy->getNumParams() == 0 && "Calling a function with bad signature");
321 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
322 Instruction *InsertBefore)
323 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
324 ->getElementType())->getReturnType(),
326 OperandTraits<CallInst>::op_end(this) - 2,
332 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
333 BasicBlock *InsertAtEnd)
334 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
335 ->getElementType())->getReturnType(),
337 OperandTraits<CallInst>::op_end(this) - 2,
342 CallInst::CallInst(Value *Func, const std::string &Name,
343 Instruction *InsertBefore)
344 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
345 ->getElementType())->getReturnType(),
347 OperandTraits<CallInst>::op_end(this) - 1,
353 CallInst::CallInst(Value *Func, const std::string &Name,
354 BasicBlock *InsertAtEnd)
355 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
356 ->getElementType())->getReturnType(),
358 OperandTraits<CallInst>::op_end(this) - 1,
364 CallInst::CallInst(const CallInst &CI)
365 : Instruction(CI.getType(), Instruction::Call,
366 OperandTraits<CallInst>::op_end(this) - CI.getNumOperands(),
367 CI.getNumOperands()) {
368 setParamAttrs(CI.getParamAttrs());
369 SubclassData = CI.SubclassData;
370 Use *OL = OperandList;
371 Use *InOL = CI.OperandList;
372 for (unsigned i = 0, e = CI.getNumOperands(); i != e; ++i)
373 OL[i].init(InOL[i], this);
376 bool CallInst::paramHasAttr(unsigned i, ParameterAttributes attr) const {
377 if (ParamAttrs.paramHasAttr(i, attr))
379 if (const Function *F = getCalledFunction())
380 return F->paramHasAttr(i, attr);
384 void CallInst::setDoesNotThrow(bool doesNotThrow) {
385 PAListPtr PAL = getParamAttrs();
387 PAL = PAL.addAttr(0, ParamAttr::NoUnwind);
389 PAL = PAL.removeAttr(0, ParamAttr::NoUnwind);
394 //===----------------------------------------------------------------------===//
395 // InvokeInst Implementation
396 //===----------------------------------------------------------------------===//
398 void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
399 Value* const *Args, unsigned NumArgs) {
400 assert(NumOperands == 3+NumArgs && "NumOperands not set up?");
401 Use *OL = OperandList;
402 OL[0].init(Fn, this);
403 OL[1].init(IfNormal, this);
404 OL[2].init(IfException, this);
405 const FunctionType *FTy =
406 cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
407 FTy = FTy; // silence warning.
409 assert(((NumArgs == FTy->getNumParams()) ||
410 (FTy->isVarArg() && NumArgs > FTy->getNumParams())) &&
411 "Calling a function with bad signature");
413 for (unsigned i = 0, e = NumArgs; i != e; i++) {
414 assert((i >= FTy->getNumParams() ||
415 FTy->getParamType(i) == Args[i]->getType()) &&
416 "Invoking a function with a bad signature!");
418 OL[i+3].init(Args[i], this);
422 InvokeInst::InvokeInst(const InvokeInst &II)
423 : TerminatorInst(II.getType(), Instruction::Invoke,
424 OperandTraits<InvokeInst>::op_end(this)
425 - II.getNumOperands(),
426 II.getNumOperands()) {
427 setParamAttrs(II.getParamAttrs());
428 SubclassData = II.SubclassData;
429 Use *OL = OperandList, *InOL = II.OperandList;
430 for (unsigned i = 0, e = II.getNumOperands(); i != e; ++i)
431 OL[i].init(InOL[i], this);
434 BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
435 return getSuccessor(idx);
437 unsigned InvokeInst::getNumSuccessorsV() const {
438 return getNumSuccessors();
440 void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
441 return setSuccessor(idx, B);
444 bool InvokeInst::paramHasAttr(unsigned i, ParameterAttributes attr) const {
445 if (ParamAttrs.paramHasAttr(i, attr))
447 if (const Function *F = getCalledFunction())
448 return F->paramHasAttr(i, attr);
452 void InvokeInst::setDoesNotThrow(bool doesNotThrow) {
453 PAListPtr PAL = getParamAttrs();
455 PAL = PAL.addAttr(0, ParamAttr::NoUnwind);
457 PAL = PAL.removeAttr(0, ParamAttr::NoUnwind);
462 //===----------------------------------------------------------------------===//
463 // ReturnInst Implementation
464 //===----------------------------------------------------------------------===//
466 ReturnInst::ReturnInst(const ReturnInst &RI)
467 : TerminatorInst(Type::VoidTy, Instruction::Ret,
468 OperandTraits<ReturnInst>::op_end(this)
469 - RI.getNumOperands(),
470 RI.getNumOperands()) {
471 unsigned N = RI.getNumOperands();
473 Op<0>().init(RI.Op<0>(), this);
475 Use *OL = OperandList;
476 for (unsigned i = 0; i < N; ++i)
477 OL[i].init(RI.getOperand(i), this);
481 ReturnInst::ReturnInst(Value *retVal, Instruction *InsertBefore)
482 : TerminatorInst(Type::VoidTy, Instruction::Ret,
483 OperandTraits<ReturnInst>::op_end(this) - (retVal != 0),
484 retVal != 0, InsertBefore) {
488 ReturnInst::ReturnInst(Value *retVal, BasicBlock *InsertAtEnd)
489 : TerminatorInst(Type::VoidTy, Instruction::Ret,
490 OperandTraits<ReturnInst>::op_end(this) - (retVal != 0),
491 retVal != 0, InsertAtEnd) {
495 ReturnInst::ReturnInst(BasicBlock *InsertAtEnd)
496 : TerminatorInst(Type::VoidTy, Instruction::Ret,
497 OperandTraits<ReturnInst>::op_end(this),
501 ReturnInst::ReturnInst(Value * const* retVals, unsigned N,
502 Instruction *InsertBefore)
503 : TerminatorInst(Type::VoidTy, Instruction::Ret,
504 OperandTraits<ReturnInst>::op_end(this) - N,
509 ReturnInst::ReturnInst(Value * const* retVals, unsigned N,
510 BasicBlock *InsertAtEnd)
511 : TerminatorInst(Type::VoidTy, Instruction::Ret,
512 OperandTraits<ReturnInst>::op_end(this) - N,
518 void ReturnInst::init(Value * const* retVals, unsigned N) {
519 assert (N > 0 && "Invalid operands numbers in ReturnInst init");
522 if (NumOperands == 1) {
524 if (V->getType() == Type::VoidTy)
526 Op<0>().init(V, this);
530 Use *OL = OperandList;
531 for (unsigned i = 0; i < NumOperands; ++i) {
532 Value *V = *retVals++;
533 assert(!isa<BasicBlock>(V) &&
534 "Cannot return basic block. Probably using the incorrect ctor");
539 unsigned ReturnInst::getNumSuccessorsV() const {
540 return getNumSuccessors();
543 /// Out-of-line ReturnInst method, put here so the C++ compiler can choose to
544 /// emit the vtable for the class in this translation unit.
545 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
546 assert(0 && "ReturnInst has no successors!");
549 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
550 assert(0 && "ReturnInst has no successors!");
555 ReturnInst::~ReturnInst() {
558 //===----------------------------------------------------------------------===//
559 // UnwindInst Implementation
560 //===----------------------------------------------------------------------===//
562 UnwindInst::UnwindInst(Instruction *InsertBefore)
563 : TerminatorInst(Type::VoidTy, Instruction::Unwind, 0, 0, InsertBefore) {
565 UnwindInst::UnwindInst(BasicBlock *InsertAtEnd)
566 : TerminatorInst(Type::VoidTy, Instruction::Unwind, 0, 0, InsertAtEnd) {
570 unsigned UnwindInst::getNumSuccessorsV() const {
571 return getNumSuccessors();
574 void UnwindInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
575 assert(0 && "UnwindInst has no successors!");
578 BasicBlock *UnwindInst::getSuccessorV(unsigned idx) const {
579 assert(0 && "UnwindInst has no successors!");
584 //===----------------------------------------------------------------------===//
585 // UnreachableInst Implementation
586 //===----------------------------------------------------------------------===//
588 UnreachableInst::UnreachableInst(Instruction *InsertBefore)
589 : TerminatorInst(Type::VoidTy, Instruction::Unreachable, 0, 0, InsertBefore) {
591 UnreachableInst::UnreachableInst(BasicBlock *InsertAtEnd)
592 : TerminatorInst(Type::VoidTy, Instruction::Unreachable, 0, 0, InsertAtEnd) {
595 unsigned UnreachableInst::getNumSuccessorsV() const {
596 return getNumSuccessors();
599 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
600 assert(0 && "UnwindInst has no successors!");
603 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
604 assert(0 && "UnwindInst has no successors!");
609 //===----------------------------------------------------------------------===//
610 // BranchInst Implementation
611 //===----------------------------------------------------------------------===//
613 void BranchInst::AssertOK() {
615 assert(getCondition()->getType() == Type::Int1Ty &&
616 "May only branch on boolean predicates!");
619 BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
620 : TerminatorInst(Type::VoidTy, Instruction::Br,
621 OperandTraits<BranchInst>::op_end(this) - 1,
623 assert(IfTrue != 0 && "Branch destination may not be null!");
624 Op<0>().init(reinterpret_cast<Value*>(IfTrue), this);
626 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
627 Instruction *InsertBefore)
628 : TerminatorInst(Type::VoidTy, Instruction::Br,
629 OperandTraits<BranchInst>::op_end(this) - 3,
631 Op<0>().init(reinterpret_cast<Value*>(IfTrue), this);
632 Op<1>().init(reinterpret_cast<Value*>(IfFalse), this);
633 Op<2>().init(Cond, this);
639 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
640 : TerminatorInst(Type::VoidTy, Instruction::Br,
641 OperandTraits<BranchInst>::op_end(this) - 1,
643 assert(IfTrue != 0 && "Branch destination may not be null!");
644 Op<0>().init(reinterpret_cast<Value*>(IfTrue), this);
647 BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
648 BasicBlock *InsertAtEnd)
649 : TerminatorInst(Type::VoidTy, Instruction::Br,
650 OperandTraits<BranchInst>::op_end(this) - 3,
652 Op<0>().init(reinterpret_cast<Value*>(IfTrue), this);
653 Op<1>().init(reinterpret_cast<Value*>(IfFalse), this);
654 Op<2>().init(Cond, this);
661 BranchInst::BranchInst(const BranchInst &BI) :
662 TerminatorInst(Type::VoidTy, Instruction::Br,
663 OperandTraits<BranchInst>::op_end(this) - BI.getNumOperands(),
664 BI.getNumOperands()) {
665 OperandList[0].init(BI.getOperand(0), this);
666 if (BI.getNumOperands() != 1) {
667 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
668 OperandList[1].init(BI.getOperand(1), this);
669 OperandList[2].init(BI.getOperand(2), this);
673 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
674 return getSuccessor(idx);
676 unsigned BranchInst::getNumSuccessorsV() const {
677 return getNumSuccessors();
679 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
680 setSuccessor(idx, B);
684 //===----------------------------------------------------------------------===//
685 // AllocationInst Implementation
686 //===----------------------------------------------------------------------===//
688 static Value *getAISize(Value *Amt) {
690 Amt = ConstantInt::get(Type::Int32Ty, 1);
692 assert(!isa<BasicBlock>(Amt) &&
693 "Passed basic block into allocation size parameter! Use other ctor");
694 assert(Amt->getType() == Type::Int32Ty &&
695 "Malloc/Allocation array size is not a 32-bit integer!");
700 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
701 unsigned Align, const std::string &Name,
702 Instruction *InsertBefore)
703 : UnaryInstruction(PointerType::getUnqual(Ty), iTy, getAISize(ArraySize),
706 assert(Ty != Type::VoidTy && "Cannot allocate void!");
710 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
711 unsigned Align, const std::string &Name,
712 BasicBlock *InsertAtEnd)
713 : UnaryInstruction(PointerType::getUnqual(Ty), iTy, getAISize(ArraySize),
716 assert(Ty != Type::VoidTy && "Cannot allocate void!");
720 // Out of line virtual method, so the vtable, etc has a home.
721 AllocationInst::~AllocationInst() {
724 void AllocationInst::setAlignment(unsigned Align) {
725 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
726 SubclassData = Log2_32(Align) + 1;
727 assert(getAlignment() == Align && "Alignment representation error!");
730 bool AllocationInst::isArrayAllocation() const {
731 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
732 return CI->getZExtValue() != 1;
736 const Type *AllocationInst::getAllocatedType() const {
737 return getType()->getElementType();
740 AllocaInst::AllocaInst(const AllocaInst &AI)
741 : AllocationInst(AI.getType()->getElementType(), (Value*)AI.getOperand(0),
742 Instruction::Alloca, AI.getAlignment()) {
745 MallocInst::MallocInst(const MallocInst &MI)
746 : AllocationInst(MI.getType()->getElementType(), (Value*)MI.getOperand(0),
747 Instruction::Malloc, MI.getAlignment()) {
750 //===----------------------------------------------------------------------===//
751 // FreeInst Implementation
752 //===----------------------------------------------------------------------===//
754 void FreeInst::AssertOK() {
755 assert(isa<PointerType>(getOperand(0)->getType()) &&
756 "Can not free something of nonpointer type!");
759 FreeInst::FreeInst(Value *Ptr, Instruction *InsertBefore)
760 : UnaryInstruction(Type::VoidTy, Free, Ptr, InsertBefore) {
764 FreeInst::FreeInst(Value *Ptr, BasicBlock *InsertAtEnd)
765 : UnaryInstruction(Type::VoidTy, Free, Ptr, InsertAtEnd) {
770 //===----------------------------------------------------------------------===//
771 // LoadInst Implementation
772 //===----------------------------------------------------------------------===//
774 void LoadInst::AssertOK() {
775 assert(isa<PointerType>(getOperand(0)->getType()) &&
776 "Ptr must have pointer type.");
779 LoadInst::LoadInst(Value *Ptr, const std::string &Name, Instruction *InsertBef)
780 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
781 Load, Ptr, InsertBef) {
788 LoadInst::LoadInst(Value *Ptr, const std::string &Name, BasicBlock *InsertAE)
789 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
790 Load, Ptr, InsertAE) {
797 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
798 Instruction *InsertBef)
799 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
800 Load, Ptr, InsertBef) {
801 setVolatile(isVolatile);
807 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
808 unsigned Align, Instruction *InsertBef)
809 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
810 Load, Ptr, InsertBef) {
811 setVolatile(isVolatile);
817 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
818 unsigned Align, BasicBlock *InsertAE)
819 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
820 Load, Ptr, InsertAE) {
821 setVolatile(isVolatile);
827 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
828 BasicBlock *InsertAE)
829 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
830 Load, Ptr, InsertAE) {
831 setVolatile(isVolatile);
839 LoadInst::LoadInst(Value *Ptr, const char *Name, Instruction *InsertBef)
840 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
841 Load, Ptr, InsertBef) {
845 if (Name && Name[0]) setName(Name);
848 LoadInst::LoadInst(Value *Ptr, const char *Name, BasicBlock *InsertAE)
849 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
850 Load, Ptr, InsertAE) {
854 if (Name && Name[0]) setName(Name);
857 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
858 Instruction *InsertBef)
859 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
860 Load, Ptr, InsertBef) {
861 setVolatile(isVolatile);
864 if (Name && Name[0]) setName(Name);
867 LoadInst::LoadInst(Value *Ptr, const char *Name, bool isVolatile,
868 BasicBlock *InsertAE)
869 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
870 Load, Ptr, InsertAE) {
871 setVolatile(isVolatile);
874 if (Name && Name[0]) setName(Name);
877 void LoadInst::setAlignment(unsigned Align) {
878 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
879 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
882 //===----------------------------------------------------------------------===//
883 // StoreInst Implementation
884 //===----------------------------------------------------------------------===//
886 void StoreInst::AssertOK() {
887 assert(isa<PointerType>(getOperand(1)->getType()) &&
888 "Ptr must have pointer type!");
889 assert(getOperand(0)->getType() ==
890 cast<PointerType>(getOperand(1)->getType())->getElementType()
891 && "Ptr must be a pointer to Val type!");
895 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
896 : Instruction(Type::VoidTy, Store,
897 OperandTraits<StoreInst>::op_begin(this),
898 OperandTraits<StoreInst>::operands(this),
900 Op<0>().init(val, this);
901 Op<1>().init(addr, this);
907 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
908 : Instruction(Type::VoidTy, Store,
909 OperandTraits<StoreInst>::op_begin(this),
910 OperandTraits<StoreInst>::operands(this),
912 Op<0>().init(val, this);
913 Op<1>().init(addr, this);
919 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
920 Instruction *InsertBefore)
921 : Instruction(Type::VoidTy, Store,
922 OperandTraits<StoreInst>::op_begin(this),
923 OperandTraits<StoreInst>::operands(this),
925 Op<0>().init(val, this);
926 Op<1>().init(addr, this);
927 setVolatile(isVolatile);
932 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
933 unsigned Align, Instruction *InsertBefore)
934 : Instruction(Type::VoidTy, Store,
935 OperandTraits<StoreInst>::op_begin(this),
936 OperandTraits<StoreInst>::operands(this),
938 Op<0>().init(val, this);
939 Op<1>().init(addr, this);
940 setVolatile(isVolatile);
945 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
946 unsigned Align, BasicBlock *InsertAtEnd)
947 : Instruction(Type::VoidTy, Store,
948 OperandTraits<StoreInst>::op_begin(this),
949 OperandTraits<StoreInst>::operands(this),
951 Op<0>().init(val, this);
952 Op<1>().init(addr, this);
953 setVolatile(isVolatile);
958 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
959 BasicBlock *InsertAtEnd)
960 : Instruction(Type::VoidTy, Store,
961 OperandTraits<StoreInst>::op_begin(this),
962 OperandTraits<StoreInst>::operands(this),
964 Op<0>().init(val, this);
965 Op<1>().init(addr, this);
966 setVolatile(isVolatile);
971 void StoreInst::setAlignment(unsigned Align) {
972 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
973 SubclassData = (SubclassData & 1) | ((Log2_32(Align)+1)<<1);
976 //===----------------------------------------------------------------------===//
977 // GetElementPtrInst Implementation
978 //===----------------------------------------------------------------------===//
980 static unsigned retrieveAddrSpace(const Value *Val) {
981 return cast<PointerType>(Val->getType())->getAddressSpace();
984 void GetElementPtrInst::init(Value *Ptr, Value* const *Idx, unsigned NumIdx) {
985 assert(NumOperands == 1+NumIdx && "NumOperands not initialized?");
986 Use *OL = OperandList;
987 OL[0].init(Ptr, this);
989 for (unsigned i = 0; i != NumIdx; ++i)
990 OL[i+1].init(Idx[i], this);
993 void GetElementPtrInst::init(Value *Ptr, Value *Idx) {
994 assert(NumOperands == 2 && "NumOperands not initialized?");
995 Use *OL = OperandList;
996 OL[0].init(Ptr, this);
997 OL[1].init(Idx, this);
1000 GetElementPtrInst::GetElementPtrInst(const GetElementPtrInst &GEPI)
1001 : Instruction(reinterpret_cast<const Type*>(GEPI.getType()), GetElementPtr,
1002 OperandTraits<GetElementPtrInst>::op_end(this)
1003 - GEPI.getNumOperands(),
1004 GEPI.getNumOperands()) {
1005 Use *OL = OperandList;
1006 Use *GEPIOL = GEPI.OperandList;
1007 for (unsigned i = 0, E = NumOperands; i != E; ++i)
1008 OL[i].init(GEPIOL[i], this);
1011 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1012 const std::string &Name, Instruction *InBe)
1013 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx)),
1014 retrieveAddrSpace(Ptr)),
1016 OperandTraits<GetElementPtrInst>::op_end(this) - 2,
1022 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
1023 const std::string &Name, BasicBlock *IAE)
1024 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx)),
1025 retrieveAddrSpace(Ptr)),
1027 OperandTraits<GetElementPtrInst>::op_end(this) - 2,
1033 // getIndexedType - Returns the type of the element that would be loaded with
1034 // a load instruction with the specified parameters.
1036 // A null type is returned if the indices are invalid for the specified
1039 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
1042 bool AllowCompositeLeaf) {
1043 if (!isa<PointerType>(Ptr)) return 0; // Type isn't a pointer type!
1045 // Handle the special case of the empty set index set...
1047 if (AllowCompositeLeaf ||
1048 cast<PointerType>(Ptr)->getElementType()->isFirstClassType())
1049 return cast<PointerType>(Ptr)->getElementType();
1054 unsigned CurIdx = 0;
1055 while (const CompositeType *CT = dyn_cast<CompositeType>(Ptr)) {
1056 if (NumIdx == CurIdx) {
1057 if (AllowCompositeLeaf || CT->isFirstClassType()) return Ptr;
1058 return 0; // Can't load a whole structure or array!?!?
1061 Value *Index = Idxs[CurIdx++];
1062 if (isa<PointerType>(CT) && CurIdx != 1)
1063 return 0; // Can only index into pointer types at the first index!
1064 if (!CT->indexValid(Index)) return 0;
1065 Ptr = CT->getTypeAtIndex(Index);
1067 // If the new type forwards to another type, then it is in the middle
1068 // of being refined to another type (and hence, may have dropped all
1069 // references to what it was using before). So, use the new forwarded
1071 if (const Type * Ty = Ptr->getForwardedType()) {
1075 return CurIdx == NumIdx ? Ptr : 0;
1078 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr, Value *Idx) {
1079 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
1080 if (!PTy) return 0; // Type isn't a pointer type!
1082 // Check the pointer index.
1083 if (!PTy->indexValid(Idx)) return 0;
1085 return PTy->getElementType();
1089 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
1090 /// zeros. If so, the result pointer and the first operand have the same
1091 /// value, just potentially different types.
1092 bool GetElementPtrInst::hasAllZeroIndices() const {
1093 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1094 if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
1095 if (!CI->isZero()) return false;
1103 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
1104 /// constant integers. If so, the result pointer and the first operand have
1105 /// a constant offset between them.
1106 bool GetElementPtrInst::hasAllConstantIndices() const {
1107 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1108 if (!isa<ConstantInt>(getOperand(i)))
1115 //===----------------------------------------------------------------------===//
1116 // ExtractElementInst Implementation
1117 //===----------------------------------------------------------------------===//
1119 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1120 const std::string &Name,
1121 Instruction *InsertBef)
1122 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1124 OperandTraits<ExtractElementInst>::op_begin(this),
1126 assert(isValidOperands(Val, Index) &&
1127 "Invalid extractelement instruction operands!");
1128 Op<0>().init(Val, this);
1129 Op<1>().init(Index, this);
1133 ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
1134 const std::string &Name,
1135 Instruction *InsertBef)
1136 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1138 OperandTraits<ExtractElementInst>::op_begin(this),
1140 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1141 assert(isValidOperands(Val, Index) &&
1142 "Invalid extractelement instruction operands!");
1143 Op<0>().init(Val, this);
1144 Op<1>().init(Index, this);
1149 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
1150 const std::string &Name,
1151 BasicBlock *InsertAE)
1152 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1154 OperandTraits<ExtractElementInst>::op_begin(this),
1156 assert(isValidOperands(Val, Index) &&
1157 "Invalid extractelement instruction operands!");
1159 Op<0>().init(Val, this);
1160 Op<1>().init(Index, this);
1164 ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
1165 const std::string &Name,
1166 BasicBlock *InsertAE)
1167 : Instruction(cast<VectorType>(Val->getType())->getElementType(),
1169 OperandTraits<ExtractElementInst>::op_begin(this),
1171 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1172 assert(isValidOperands(Val, Index) &&
1173 "Invalid extractelement instruction operands!");
1175 Op<0>().init(Val, this);
1176 Op<1>().init(Index, this);
1181 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
1182 if (!isa<VectorType>(Val->getType()) || Index->getType() != Type::Int32Ty)
1188 //===----------------------------------------------------------------------===//
1189 // InsertElementInst Implementation
1190 //===----------------------------------------------------------------------===//
1192 InsertElementInst::InsertElementInst(const InsertElementInst &IE)
1193 : Instruction(IE.getType(), InsertElement,
1194 OperandTraits<InsertElementInst>::op_begin(this), 3) {
1195 Op<0>().init(IE.Op<0>(), this);
1196 Op<1>().init(IE.Op<1>(), this);
1197 Op<2>().init(IE.Op<2>(), this);
1199 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1200 const std::string &Name,
1201 Instruction *InsertBef)
1202 : Instruction(Vec->getType(), InsertElement,
1203 OperandTraits<InsertElementInst>::op_begin(this),
1205 assert(isValidOperands(Vec, Elt, Index) &&
1206 "Invalid insertelement instruction operands!");
1207 Op<0>().init(Vec, this);
1208 Op<1>().init(Elt, this);
1209 Op<2>().init(Index, this);
1213 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
1214 const std::string &Name,
1215 Instruction *InsertBef)
1216 : Instruction(Vec->getType(), InsertElement,
1217 OperandTraits<InsertElementInst>::op_begin(this),
1219 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1220 assert(isValidOperands(Vec, Elt, Index) &&
1221 "Invalid insertelement instruction operands!");
1222 Op<0>().init(Vec, this);
1223 Op<1>().init(Elt, this);
1224 Op<2>().init(Index, this);
1229 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
1230 const std::string &Name,
1231 BasicBlock *InsertAE)
1232 : Instruction(Vec->getType(), InsertElement,
1233 OperandTraits<InsertElementInst>::op_begin(this),
1235 assert(isValidOperands(Vec, Elt, Index) &&
1236 "Invalid insertelement instruction operands!");
1238 Op<0>().init(Vec, this);
1239 Op<1>().init(Elt, this);
1240 Op<2>().init(Index, this);
1244 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
1245 const std::string &Name,
1246 BasicBlock *InsertAE)
1247 : Instruction(Vec->getType(), InsertElement,
1248 OperandTraits<InsertElementInst>::op_begin(this),
1250 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
1251 assert(isValidOperands(Vec, Elt, Index) &&
1252 "Invalid insertelement instruction operands!");
1254 Op<0>().init(Vec, this);
1255 Op<1>().init(Elt, this);
1256 Op<2>().init(Index, this);
1260 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
1261 const Value *Index) {
1262 if (!isa<VectorType>(Vec->getType()))
1263 return false; // First operand of insertelement must be vector type.
1265 if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
1266 return false;// Second operand of insertelement must be vector element type.
1268 if (Index->getType() != Type::Int32Ty)
1269 return false; // Third operand of insertelement must be uint.
1274 //===----------------------------------------------------------------------===//
1275 // ShuffleVectorInst Implementation
1276 //===----------------------------------------------------------------------===//
1278 ShuffleVectorInst::ShuffleVectorInst(const ShuffleVectorInst &SV)
1279 : Instruction(SV.getType(), ShuffleVector,
1280 OperandTraits<ShuffleVectorInst>::op_begin(this),
1281 OperandTraits<ShuffleVectorInst>::operands(this)) {
1282 Op<0>().init(SV.Op<0>(), this);
1283 Op<1>().init(SV.Op<1>(), this);
1284 Op<2>().init(SV.Op<2>(), this);
1287 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1288 const std::string &Name,
1289 Instruction *InsertBefore)
1290 : Instruction(V1->getType(), ShuffleVector,
1291 OperandTraits<ShuffleVectorInst>::op_begin(this),
1292 OperandTraits<ShuffleVectorInst>::operands(this),
1294 assert(isValidOperands(V1, V2, Mask) &&
1295 "Invalid shuffle vector instruction operands!");
1296 Op<0>().init(V1, this);
1297 Op<1>().init(V2, this);
1298 Op<2>().init(Mask, this);
1302 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1303 const std::string &Name,
1304 BasicBlock *InsertAtEnd)
1305 : Instruction(V1->getType(), ShuffleVector,
1306 OperandTraits<ShuffleVectorInst>::op_begin(this),
1307 OperandTraits<ShuffleVectorInst>::operands(this),
1309 assert(isValidOperands(V1, V2, Mask) &&
1310 "Invalid shuffle vector instruction operands!");
1312 Op<0>().init(V1, this);
1313 Op<1>().init(V2, this);
1314 Op<2>().init(Mask, this);
1318 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1319 const Value *Mask) {
1320 if (!isa<VectorType>(V1->getType()) ||
1321 V1->getType() != V2->getType())
1324 const VectorType *MaskTy = dyn_cast<VectorType>(Mask->getType());
1325 if (!isa<Constant>(Mask) || MaskTy == 0 ||
1326 MaskTy->getElementType() != Type::Int32Ty ||
1327 MaskTy->getNumElements() !=
1328 cast<VectorType>(V1->getType())->getNumElements())
1333 /// getMaskValue - Return the index from the shuffle mask for the specified
1334 /// output result. This is either -1 if the element is undef or a number less
1335 /// than 2*numelements.
1336 int ShuffleVectorInst::getMaskValue(unsigned i) const {
1337 const Constant *Mask = cast<Constant>(getOperand(2));
1338 if (isa<UndefValue>(Mask)) return -1;
1339 if (isa<ConstantAggregateZero>(Mask)) return 0;
1340 const ConstantVector *MaskCV = cast<ConstantVector>(Mask);
1341 assert(i < MaskCV->getNumOperands() && "Index out of range");
1343 if (isa<UndefValue>(MaskCV->getOperand(i)))
1345 return cast<ConstantInt>(MaskCV->getOperand(i))->getZExtValue();
1349 //===----------------------------------------------------------------------===//
1350 // BinaryOperator Class
1351 //===----------------------------------------------------------------------===//
1353 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1354 const Type *Ty, const std::string &Name,
1355 Instruction *InsertBefore)
1356 : Instruction(Ty, iType,
1357 OperandTraits<BinaryOperator>::op_begin(this),
1358 OperandTraits<BinaryOperator>::operands(this),
1360 Op<0>().init(S1, this);
1361 Op<1>().init(S2, this);
1366 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
1367 const Type *Ty, const std::string &Name,
1368 BasicBlock *InsertAtEnd)
1369 : Instruction(Ty, iType,
1370 OperandTraits<BinaryOperator>::op_begin(this),
1371 OperandTraits<BinaryOperator>::operands(this),
1373 Op<0>().init(S1, this);
1374 Op<1>().init(S2, this);
1380 void BinaryOperator::init(BinaryOps iType) {
1381 Value *LHS = getOperand(0), *RHS = getOperand(1);
1382 LHS = LHS; RHS = RHS; // Silence warnings.
1383 assert(LHS->getType() == RHS->getType() &&
1384 "Binary operator operand types must match!");
1389 assert(getType() == LHS->getType() &&
1390 "Arithmetic operation should return same type as operands!");
1391 assert((getType()->isInteger() || getType()->isFloatingPoint() ||
1392 isa<VectorType>(getType())) &&
1393 "Tried to create an arithmetic operation on a non-arithmetic type!");
1397 assert(getType() == LHS->getType() &&
1398 "Arithmetic operation should return same type as operands!");
1399 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1400 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1401 "Incorrect operand type (not integer) for S/UDIV");
1404 assert(getType() == LHS->getType() &&
1405 "Arithmetic operation should return same type as operands!");
1406 assert((getType()->isFloatingPoint() || (isa<VectorType>(getType()) &&
1407 cast<VectorType>(getType())->getElementType()->isFloatingPoint()))
1408 && "Incorrect operand type (not floating point) for FDIV");
1412 assert(getType() == LHS->getType() &&
1413 "Arithmetic operation should return same type as operands!");
1414 assert((getType()->isInteger() || (isa<VectorType>(getType()) &&
1415 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1416 "Incorrect operand type (not integer) for S/UREM");
1419 assert(getType() == LHS->getType() &&
1420 "Arithmetic operation should return same type as operands!");
1421 assert((getType()->isFloatingPoint() || (isa<VectorType>(getType()) &&
1422 cast<VectorType>(getType())->getElementType()->isFloatingPoint()))
1423 && "Incorrect operand type (not floating point) for FREM");
1428 assert(getType() == LHS->getType() &&
1429 "Shift operation should return same type as operands!");
1430 assert(getType()->isInteger() &&
1431 "Shift operation requires integer operands");
1435 assert(getType() == LHS->getType() &&
1436 "Logical operation should return same type as operands!");
1437 assert((getType()->isInteger() ||
1438 (isa<VectorType>(getType()) &&
1439 cast<VectorType>(getType())->getElementType()->isInteger())) &&
1440 "Tried to create a logical operation on a non-integral type!");
1448 BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
1449 const std::string &Name,
1450 Instruction *InsertBefore) {
1451 assert(S1->getType() == S2->getType() &&
1452 "Cannot create binary operator with two operands of differing type!");
1453 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1456 BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
1457 const std::string &Name,
1458 BasicBlock *InsertAtEnd) {
1459 BinaryOperator *Res = create(Op, S1, S2, Name);
1460 InsertAtEnd->getInstList().push_back(Res);
1464 BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
1465 Instruction *InsertBefore) {
1466 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1467 return new BinaryOperator(Instruction::Sub,
1469 Op->getType(), Name, InsertBefore);
1472 BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
1473 BasicBlock *InsertAtEnd) {
1474 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1475 return new BinaryOperator(Instruction::Sub,
1477 Op->getType(), Name, InsertAtEnd);
1480 BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
1481 Instruction *InsertBefore) {
1483 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1484 C = ConstantInt::getAllOnesValue(PTy->getElementType());
1485 C = ConstantVector::get(std::vector<Constant*>(PTy->getNumElements(), C));
1487 C = ConstantInt::getAllOnesValue(Op->getType());
1490 return new BinaryOperator(Instruction::Xor, Op, C,
1491 Op->getType(), Name, InsertBefore);
1494 BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
1495 BasicBlock *InsertAtEnd) {
1497 if (const VectorType *PTy = dyn_cast<VectorType>(Op->getType())) {
1498 // Create a vector of all ones values.
1499 Constant *Elt = ConstantInt::getAllOnesValue(PTy->getElementType());
1501 ConstantVector::get(std::vector<Constant*>(PTy->getNumElements(), Elt));
1503 AllOnes = ConstantInt::getAllOnesValue(Op->getType());
1506 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1507 Op->getType(), Name, InsertAtEnd);
1511 // isConstantAllOnes - Helper function for several functions below
1512 static inline bool isConstantAllOnes(const Value *V) {
1513 if (const ConstantInt *CI = dyn_cast<ConstantInt>(V))
1514 return CI->isAllOnesValue();
1515 if (const ConstantVector *CV = dyn_cast<ConstantVector>(V))
1516 return CV->isAllOnesValue();
1520 bool BinaryOperator::isNeg(const Value *V) {
1521 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1522 if (Bop->getOpcode() == Instruction::Sub)
1523 return Bop->getOperand(0) ==
1524 ConstantExpr::getZeroValueForNegationExpr(Bop->getType());
1528 bool BinaryOperator::isNot(const Value *V) {
1529 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1530 return (Bop->getOpcode() == Instruction::Xor &&
1531 (isConstantAllOnes(Bop->getOperand(1)) ||
1532 isConstantAllOnes(Bop->getOperand(0))));
1536 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1537 assert(isNeg(BinOp) && "getNegArgument from non-'neg' instruction!");
1538 return cast<BinaryOperator>(BinOp)->getOperand(1);
1541 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1542 return getNegArgument(const_cast<Value*>(BinOp));
1545 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1546 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1547 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1548 Value *Op0 = BO->getOperand(0);
1549 Value *Op1 = BO->getOperand(1);
1550 if (isConstantAllOnes(Op0)) return Op1;
1552 assert(isConstantAllOnes(Op1));
1556 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1557 return getNotArgument(const_cast<Value*>(BinOp));
1561 // swapOperands - Exchange the two operands to this instruction. This
1562 // instruction is safe to use on any binary instruction and does not
1563 // modify the semantics of the instruction. If the instruction is
1564 // order dependent (SetLT f.e.) the opcode is changed.
1566 bool BinaryOperator::swapOperands() {
1567 if (!isCommutative())
1568 return true; // Can't commute operands
1569 Op<0>().swap(Op<1>());
1573 //===----------------------------------------------------------------------===//
1575 //===----------------------------------------------------------------------===//
1577 // Just determine if this cast only deals with integral->integral conversion.
1578 bool CastInst::isIntegerCast() const {
1579 switch (getOpcode()) {
1580 default: return false;
1581 case Instruction::ZExt:
1582 case Instruction::SExt:
1583 case Instruction::Trunc:
1585 case Instruction::BitCast:
1586 return getOperand(0)->getType()->isInteger() && getType()->isInteger();
1590 bool CastInst::isLosslessCast() const {
1591 // Only BitCast can be lossless, exit fast if we're not BitCast
1592 if (getOpcode() != Instruction::BitCast)
1595 // Identity cast is always lossless
1596 const Type* SrcTy = getOperand(0)->getType();
1597 const Type* DstTy = getType();
1601 // Pointer to pointer is always lossless.
1602 if (isa<PointerType>(SrcTy))
1603 return isa<PointerType>(DstTy);
1604 return false; // Other types have no identity values
1607 /// This function determines if the CastInst does not require any bits to be
1608 /// changed in order to effect the cast. Essentially, it identifies cases where
1609 /// no code gen is necessary for the cast, hence the name no-op cast. For
1610 /// example, the following are all no-op casts:
1611 /// # bitcast i32* %x to i8*
1612 /// # bitcast <2 x i32> %x to <4 x i16>
1613 /// # ptrtoint i32* %x to i32 ; on 32-bit plaforms only
1614 /// @brief Determine if a cast is a no-op.
1615 bool CastInst::isNoopCast(const Type *IntPtrTy) const {
1616 switch (getOpcode()) {
1618 assert(!"Invalid CastOp");
1619 case Instruction::Trunc:
1620 case Instruction::ZExt:
1621 case Instruction::SExt:
1622 case Instruction::FPTrunc:
1623 case Instruction::FPExt:
1624 case Instruction::UIToFP:
1625 case Instruction::SIToFP:
1626 case Instruction::FPToUI:
1627 case Instruction::FPToSI:
1628 return false; // These always modify bits
1629 case Instruction::BitCast:
1630 return true; // BitCast never modifies bits.
1631 case Instruction::PtrToInt:
1632 return IntPtrTy->getPrimitiveSizeInBits() ==
1633 getType()->getPrimitiveSizeInBits();
1634 case Instruction::IntToPtr:
1635 return IntPtrTy->getPrimitiveSizeInBits() ==
1636 getOperand(0)->getType()->getPrimitiveSizeInBits();
1640 /// This function determines if a pair of casts can be eliminated and what
1641 /// opcode should be used in the elimination. This assumes that there are two
1642 /// instructions like this:
1643 /// * %F = firstOpcode SrcTy %x to MidTy
1644 /// * %S = secondOpcode MidTy %F to DstTy
1645 /// The function returns a resultOpcode so these two casts can be replaced with:
1646 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
1647 /// If no such cast is permited, the function returns 0.
1648 unsigned CastInst::isEliminableCastPair(
1649 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
1650 const Type *SrcTy, const Type *MidTy, const Type *DstTy, const Type *IntPtrTy)
1652 // Define the 144 possibilities for these two cast instructions. The values
1653 // in this matrix determine what to do in a given situation and select the
1654 // case in the switch below. The rows correspond to firstOp, the columns
1655 // correspond to secondOp. In looking at the table below, keep in mind
1656 // the following cast properties:
1658 // Size Compare Source Destination
1659 // Operator Src ? Size Type Sign Type Sign
1660 // -------- ------------ ------------------- ---------------------
1661 // TRUNC > Integer Any Integral Any
1662 // ZEXT < Integral Unsigned Integer Any
1663 // SEXT < Integral Signed Integer Any
1664 // FPTOUI n/a FloatPt n/a Integral Unsigned
1665 // FPTOSI n/a FloatPt n/a Integral Signed
1666 // UITOFP n/a Integral Unsigned FloatPt n/a
1667 // SITOFP n/a Integral Signed FloatPt n/a
1668 // FPTRUNC > FloatPt n/a FloatPt n/a
1669 // FPEXT < FloatPt n/a FloatPt n/a
1670 // PTRTOINT n/a Pointer n/a Integral Unsigned
1671 // INTTOPTR n/a Integral Unsigned Pointer n/a
1672 // BITCONVERT = FirstClass n/a FirstClass n/a
1674 // NOTE: some transforms are safe, but we consider them to be non-profitable.
1675 // For example, we could merge "fptoui double to uint" + "zext uint to ulong",
1676 // into "fptoui double to ulong", but this loses information about the range
1677 // of the produced value (we no longer know the top-part is all zeros).
1678 // Further this conversion is often much more expensive for typical hardware,
1679 // and causes issues when building libgcc. We disallow fptosi+sext for the
1681 const unsigned numCastOps =
1682 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
1683 static const uint8_t CastResults[numCastOps][numCastOps] = {
1684 // T F F U S F F P I B -+
1685 // R Z S P P I I T P 2 N T |
1686 // U E E 2 2 2 2 R E I T C +- secondOp
1687 // N X X U S F F N X N 2 V |
1688 // C T T I I P P C T T P T -+
1689 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
1690 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
1691 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
1692 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
1693 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
1694 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
1695 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
1696 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
1697 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
1698 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
1699 { 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
1700 { 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
1703 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
1704 [secondOp-Instruction::CastOpsBegin];
1707 // categorically disallowed
1710 // allowed, use first cast's opcode
1713 // allowed, use second cast's opcode
1716 // no-op cast in second op implies firstOp as long as the DestTy
1718 if (DstTy->isInteger())
1722 // no-op cast in second op implies firstOp as long as the DestTy
1723 // is floating point
1724 if (DstTy->isFloatingPoint())
1728 // no-op cast in first op implies secondOp as long as the SrcTy
1730 if (SrcTy->isInteger())
1734 // no-op cast in first op implies secondOp as long as the SrcTy
1735 // is a floating point
1736 if (SrcTy->isFloatingPoint())
1740 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size
1741 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1742 unsigned MidSize = MidTy->getPrimitiveSizeInBits();
1743 if (MidSize >= PtrSize)
1744 return Instruction::BitCast;
1748 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
1749 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
1750 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
1751 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1752 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1753 if (SrcSize == DstSize)
1754 return Instruction::BitCast;
1755 else if (SrcSize < DstSize)
1759 case 9: // zext, sext -> zext, because sext can't sign extend after zext
1760 return Instruction::ZExt;
1762 // fpext followed by ftrunc is allowed if the bit size returned to is
1763 // the same as the original, in which case its just a bitcast
1765 return Instruction::BitCast;
1766 return 0; // If the types are not the same we can't eliminate it.
1768 // bitcast followed by ptrtoint is allowed as long as the bitcast
1769 // is a pointer to pointer cast.
1770 if (isa<PointerType>(SrcTy) && isa<PointerType>(MidTy))
1774 // inttoptr, bitcast -> intptr if bitcast is a ptr to ptr cast
1775 if (isa<PointerType>(MidTy) && isa<PointerType>(DstTy))
1779 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
1780 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1781 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1782 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1783 if (SrcSize <= PtrSize && SrcSize == DstSize)
1784 return Instruction::BitCast;
1788 // cast combination can't happen (error in input). This is for all cases
1789 // where the MidTy is not the same for the two cast instructions.
1790 assert(!"Invalid Cast Combination");
1793 assert(!"Error in CastResults table!!!");
1799 CastInst *CastInst::create(Instruction::CastOps op, Value *S, const Type *Ty,
1800 const std::string &Name, Instruction *InsertBefore) {
1801 // Construct and return the appropriate CastInst subclass
1803 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
1804 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
1805 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
1806 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
1807 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
1808 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
1809 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
1810 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
1811 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
1812 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
1813 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
1814 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
1816 assert(!"Invalid opcode provided");
1821 CastInst *CastInst::create(Instruction::CastOps op, Value *S, const Type *Ty,
1822 const std::string &Name, BasicBlock *InsertAtEnd) {
1823 // Construct and return the appropriate CastInst subclass
1825 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
1826 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
1827 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
1828 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
1829 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
1830 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
1831 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
1832 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
1833 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
1834 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
1835 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
1836 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
1838 assert(!"Invalid opcode provided");
1843 CastInst *CastInst::createZExtOrBitCast(Value *S, const Type *Ty,
1844 const std::string &Name,
1845 Instruction *InsertBefore) {
1846 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1847 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1848 return create(Instruction::ZExt, S, Ty, Name, InsertBefore);
1851 CastInst *CastInst::createZExtOrBitCast(Value *S, const Type *Ty,
1852 const std::string &Name,
1853 BasicBlock *InsertAtEnd) {
1854 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1855 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1856 return create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
1859 CastInst *CastInst::createSExtOrBitCast(Value *S, const Type *Ty,
1860 const std::string &Name,
1861 Instruction *InsertBefore) {
1862 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1863 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1864 return create(Instruction::SExt, S, Ty, Name, InsertBefore);
1867 CastInst *CastInst::createSExtOrBitCast(Value *S, const Type *Ty,
1868 const std::string &Name,
1869 BasicBlock *InsertAtEnd) {
1870 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1871 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1872 return create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
1875 CastInst *CastInst::createTruncOrBitCast(Value *S, const Type *Ty,
1876 const std::string &Name,
1877 Instruction *InsertBefore) {
1878 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1879 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1880 return create(Instruction::Trunc, S, Ty, Name, InsertBefore);
1883 CastInst *CastInst::createTruncOrBitCast(Value *S, const Type *Ty,
1884 const std::string &Name,
1885 BasicBlock *InsertAtEnd) {
1886 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1887 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1888 return create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
1891 CastInst *CastInst::createPointerCast(Value *S, const Type *Ty,
1892 const std::string &Name,
1893 BasicBlock *InsertAtEnd) {
1894 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1895 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
1898 if (Ty->isInteger())
1899 return create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
1900 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1903 /// @brief Create a BitCast or a PtrToInt cast instruction
1904 CastInst *CastInst::createPointerCast(Value *S, const Type *Ty,
1905 const std::string &Name,
1906 Instruction *InsertBefore) {
1907 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1908 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
1911 if (Ty->isInteger())
1912 return create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
1913 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1916 CastInst *CastInst::createIntegerCast(Value *C, const Type *Ty,
1917 bool isSigned, const std::string &Name,
1918 Instruction *InsertBefore) {
1919 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1920 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1921 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1922 Instruction::CastOps opcode =
1923 (SrcBits == DstBits ? Instruction::BitCast :
1924 (SrcBits > DstBits ? Instruction::Trunc :
1925 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1926 return create(opcode, C, Ty, Name, InsertBefore);
1929 CastInst *CastInst::createIntegerCast(Value *C, const Type *Ty,
1930 bool isSigned, const std::string &Name,
1931 BasicBlock *InsertAtEnd) {
1932 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1933 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1934 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1935 Instruction::CastOps opcode =
1936 (SrcBits == DstBits ? Instruction::BitCast :
1937 (SrcBits > DstBits ? Instruction::Trunc :
1938 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1939 return create(opcode, C, Ty, Name, InsertAtEnd);
1942 CastInst *CastInst::createFPCast(Value *C, const Type *Ty,
1943 const std::string &Name,
1944 Instruction *InsertBefore) {
1945 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1947 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1948 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1949 Instruction::CastOps opcode =
1950 (SrcBits == DstBits ? Instruction::BitCast :
1951 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
1952 return create(opcode, C, Ty, Name, InsertBefore);
1955 CastInst *CastInst::createFPCast(Value *C, const Type *Ty,
1956 const std::string &Name,
1957 BasicBlock *InsertAtEnd) {
1958 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1960 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1961 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1962 Instruction::CastOps opcode =
1963 (SrcBits == DstBits ? Instruction::BitCast :
1964 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
1965 return create(opcode, C, Ty, Name, InsertAtEnd);
1968 // Check whether it is valid to call getCastOpcode for these types.
1969 // This routine must be kept in sync with getCastOpcode.
1970 bool CastInst::isCastable(const Type *SrcTy, const Type *DestTy) {
1971 if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
1974 if (SrcTy == DestTy)
1977 // Get the bit sizes, we'll need these
1978 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
1979 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
1981 // Run through the possibilities ...
1982 if (DestTy->isInteger()) { // Casting to integral
1983 if (SrcTy->isInteger()) { // Casting from integral
1985 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
1987 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
1988 // Casting from vector
1989 return DestBits == PTy->getBitWidth();
1990 } else { // Casting from something else
1991 return isa<PointerType>(SrcTy);
1993 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
1994 if (SrcTy->isInteger()) { // Casting from integral
1996 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
1998 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
1999 // Casting from vector
2000 return DestBits == PTy->getBitWidth();
2001 } else { // Casting from something else
2004 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2005 // Casting to vector
2006 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2007 // Casting from vector
2008 return DestPTy->getBitWidth() == SrcPTy->getBitWidth();
2009 } else { // Casting from something else
2010 return DestPTy->getBitWidth() == SrcBits;
2012 } else if (isa<PointerType>(DestTy)) { // Casting to pointer
2013 if (isa<PointerType>(SrcTy)) { // Casting from pointer
2015 } else if (SrcTy->isInteger()) { // Casting from integral
2017 } else { // Casting from something else
2020 } else { // Casting to something else
2025 // Provide a way to get a "cast" where the cast opcode is inferred from the
2026 // types and size of the operand. This, basically, is a parallel of the
2027 // logic in the castIsValid function below. This axiom should hold:
2028 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
2029 // should not assert in castIsValid. In other words, this produces a "correct"
2030 // casting opcode for the arguments passed to it.
2031 // This routine must be kept in sync with isCastable.
2032 Instruction::CastOps
2033 CastInst::getCastOpcode(
2034 const Value *Src, bool SrcIsSigned, const Type *DestTy, bool DestIsSigned) {
2035 // Get the bit sizes, we'll need these
2036 const Type *SrcTy = Src->getType();
2037 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2038 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/vector
2040 assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&
2041 "Only first class types are castable!");
2043 // Run through the possibilities ...
2044 if (DestTy->isInteger()) { // Casting to integral
2045 if (SrcTy->isInteger()) { // Casting from integral
2046 if (DestBits < SrcBits)
2047 return Trunc; // int -> smaller int
2048 else if (DestBits > SrcBits) { // its an extension
2050 return SExt; // signed -> SEXT
2052 return ZExt; // unsigned -> ZEXT
2054 return BitCast; // Same size, No-op cast
2056 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2058 return FPToSI; // FP -> sint
2060 return FPToUI; // FP -> uint
2061 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2062 assert(DestBits == PTy->getBitWidth() &&
2063 "Casting vector to integer of different width");
2064 return BitCast; // Same size, no-op cast
2066 assert(isa<PointerType>(SrcTy) &&
2067 "Casting from a value that is not first-class type");
2068 return PtrToInt; // ptr -> int
2070 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
2071 if (SrcTy->isInteger()) { // Casting from integral
2073 return SIToFP; // sint -> FP
2075 return UIToFP; // uint -> FP
2076 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
2077 if (DestBits < SrcBits) {
2078 return FPTrunc; // FP -> smaller FP
2079 } else if (DestBits > SrcBits) {
2080 return FPExt; // FP -> larger FP
2082 return BitCast; // same size, no-op cast
2084 } else if (const VectorType *PTy = dyn_cast<VectorType>(SrcTy)) {
2085 assert(DestBits == PTy->getBitWidth() &&
2086 "Casting vector to floating point of different width");
2087 return BitCast; // same size, no-op cast
2089 assert(0 && "Casting pointer or non-first class to float");
2091 } else if (const VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
2092 if (const VectorType *SrcPTy = dyn_cast<VectorType>(SrcTy)) {
2093 assert(DestPTy->getBitWidth() == SrcPTy->getBitWidth() &&
2094 "Casting vector to vector of different widths");
2095 return BitCast; // vector -> vector
2096 } else if (DestPTy->getBitWidth() == SrcBits) {
2097 return BitCast; // float/int -> vector
2099 assert(!"Illegal cast to vector (wrong type or size)");
2101 } else if (isa<PointerType>(DestTy)) {
2102 if (isa<PointerType>(SrcTy)) {
2103 return BitCast; // ptr -> ptr
2104 } else if (SrcTy->isInteger()) {
2105 return IntToPtr; // int -> ptr
2107 assert(!"Casting pointer to other than pointer or int");
2110 assert(!"Casting to type that is not first-class");
2113 // If we fall through to here we probably hit an assertion cast above
2114 // and assertions are not turned on. Anything we return is an error, so
2115 // BitCast is as good a choice as any.
2119 //===----------------------------------------------------------------------===//
2120 // CastInst SubClass Constructors
2121 //===----------------------------------------------------------------------===//
2123 /// Check that the construction parameters for a CastInst are correct. This
2124 /// could be broken out into the separate constructors but it is useful to have
2125 /// it in one place and to eliminate the redundant code for getting the sizes
2126 /// of the types involved.
2128 CastInst::castIsValid(Instruction::CastOps op, Value *S, const Type *DstTy) {
2130 // Check for type sanity on the arguments
2131 const Type *SrcTy = S->getType();
2132 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType())
2135 // Get the size of the types in bits, we'll need this later
2136 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
2137 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
2139 // Switch on the opcode provided
2141 default: return false; // This is an input error
2142 case Instruction::Trunc:
2143 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize > DstBitSize;
2144 case Instruction::ZExt:
2145 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize < DstBitSize;
2146 case Instruction::SExt:
2147 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize < DstBitSize;
2148 case Instruction::FPTrunc:
2149 return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
2150 SrcBitSize > DstBitSize;
2151 case Instruction::FPExt:
2152 return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
2153 SrcBitSize < DstBitSize;
2154 case Instruction::UIToFP:
2155 case Instruction::SIToFP:
2156 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2157 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2158 return SVTy->getElementType()->isInteger() &&
2159 DVTy->getElementType()->isFloatingPoint() &&
2160 SVTy->getNumElements() == DVTy->getNumElements();
2163 return SrcTy->isInteger() && DstTy->isFloatingPoint();
2164 case Instruction::FPToUI:
2165 case Instruction::FPToSI:
2166 if (const VectorType *SVTy = dyn_cast<VectorType>(SrcTy)) {
2167 if (const VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
2168 return SVTy->getElementType()->isFloatingPoint() &&
2169 DVTy->getElementType()->isInteger() &&
2170 SVTy->getNumElements() == DVTy->getNumElements();
2173 return SrcTy->isFloatingPoint() && DstTy->isInteger();
2174 case Instruction::PtrToInt:
2175 return isa<PointerType>(SrcTy) && DstTy->isInteger();
2176 case Instruction::IntToPtr:
2177 return SrcTy->isInteger() && isa<PointerType>(DstTy);
2178 case Instruction::BitCast:
2179 // BitCast implies a no-op cast of type only. No bits change.
2180 // However, you can't cast pointers to anything but pointers.
2181 if (isa<PointerType>(SrcTy) != isa<PointerType>(DstTy))
2184 // Now we know we're not dealing with a pointer/non-pointer mismatch. In all
2185 // these cases, the cast is okay if the source and destination bit widths
2187 return SrcBitSize == DstBitSize;
2191 TruncInst::TruncInst(
2192 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2193 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
2194 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2197 TruncInst::TruncInst(
2198 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2199 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
2200 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
2204 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2205 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
2206 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2210 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2211 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
2212 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
2215 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2216 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
2217 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2221 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2222 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
2223 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
2226 FPTruncInst::FPTruncInst(
2227 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2228 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
2229 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2232 FPTruncInst::FPTruncInst(
2233 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2234 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
2235 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
2238 FPExtInst::FPExtInst(
2239 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2240 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
2241 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2244 FPExtInst::FPExtInst(
2245 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2246 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
2247 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
2250 UIToFPInst::UIToFPInst(
2251 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2252 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
2253 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2256 UIToFPInst::UIToFPInst(
2257 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2258 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
2259 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
2262 SIToFPInst::SIToFPInst(
2263 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2264 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
2265 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2268 SIToFPInst::SIToFPInst(
2269 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2270 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
2271 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
2274 FPToUIInst::FPToUIInst(
2275 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2276 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
2277 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2280 FPToUIInst::FPToUIInst(
2281 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2282 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
2283 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
2286 FPToSIInst::FPToSIInst(
2287 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2288 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
2289 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2292 FPToSIInst::FPToSIInst(
2293 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2294 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
2295 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
2298 PtrToIntInst::PtrToIntInst(
2299 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2300 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
2301 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2304 PtrToIntInst::PtrToIntInst(
2305 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2306 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
2307 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
2310 IntToPtrInst::IntToPtrInst(
2311 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2312 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
2313 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2316 IntToPtrInst::IntToPtrInst(
2317 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2318 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
2319 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
2322 BitCastInst::BitCastInst(
2323 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
2324 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
2325 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2328 BitCastInst::BitCastInst(
2329 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
2330 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
2331 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
2334 //===----------------------------------------------------------------------===//
2336 //===----------------------------------------------------------------------===//
2338 CmpInst::CmpInst(const Type *ty, OtherOps op, unsigned short predicate,
2339 Value *LHS, Value *RHS, const std::string &Name,
2340 Instruction *InsertBefore)
2341 : Instruction(ty, op,
2342 OperandTraits<CmpInst>::op_begin(this),
2343 OperandTraits<CmpInst>::operands(this),
2345 Op<0>().init(LHS, this);
2346 Op<1>().init(RHS, this);
2347 SubclassData = predicate;
2351 CmpInst::CmpInst(const Type *ty, OtherOps op, unsigned short predicate,
2352 Value *LHS, Value *RHS, const std::string &Name,
2353 BasicBlock *InsertAtEnd)
2354 : Instruction(ty, op,
2355 OperandTraits<CmpInst>::op_begin(this),
2356 OperandTraits<CmpInst>::operands(this),
2358 Op<0>().init(LHS, this);
2359 Op<1>().init(RHS, this);
2360 SubclassData = predicate;
2365 CmpInst::create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2366 const std::string &Name, Instruction *InsertBefore) {
2367 if (Op == Instruction::ICmp) {
2368 return new ICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2371 if (Op == Instruction::FCmp) {
2372 return new FCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2375 if (Op == Instruction::VICmp) {
2376 return new VICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2379 return new VFCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2384 CmpInst::create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
2385 const std::string &Name, BasicBlock *InsertAtEnd) {
2386 if (Op == Instruction::ICmp) {
2387 return new ICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2390 if (Op == Instruction::FCmp) {
2391 return new FCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2394 if (Op == Instruction::VICmp) {
2395 return new VICmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2398 return new VFCmpInst(CmpInst::Predicate(predicate), S1, S2, Name,
2402 void CmpInst::swapOperands() {
2403 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2406 cast<FCmpInst>(this)->swapOperands();
2409 bool CmpInst::isCommutative() {
2410 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2411 return IC->isCommutative();
2412 return cast<FCmpInst>(this)->isCommutative();
2415 bool CmpInst::isEquality() {
2416 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2417 return IC->isEquality();
2418 return cast<FCmpInst>(this)->isEquality();
2422 ICmpInst::Predicate ICmpInst::getInversePredicate(Predicate pred) {
2425 assert(!"Unknown icmp predicate!");
2426 case ICMP_EQ: return ICMP_NE;
2427 case ICMP_NE: return ICMP_EQ;
2428 case ICMP_UGT: return ICMP_ULE;
2429 case ICMP_ULT: return ICMP_UGE;
2430 case ICMP_UGE: return ICMP_ULT;
2431 case ICMP_ULE: return ICMP_UGT;
2432 case ICMP_SGT: return ICMP_SLE;
2433 case ICMP_SLT: return ICMP_SGE;
2434 case ICMP_SGE: return ICMP_SLT;
2435 case ICMP_SLE: return ICMP_SGT;
2439 ICmpInst::Predicate ICmpInst::getSwappedPredicate(Predicate pred) {
2441 default: assert(! "Unknown icmp predicate!");
2442 case ICMP_EQ: case ICMP_NE:
2444 case ICMP_SGT: return ICMP_SLT;
2445 case ICMP_SLT: return ICMP_SGT;
2446 case ICMP_SGE: return ICMP_SLE;
2447 case ICMP_SLE: return ICMP_SGE;
2448 case ICMP_UGT: return ICMP_ULT;
2449 case ICMP_ULT: return ICMP_UGT;
2450 case ICMP_UGE: return ICMP_ULE;
2451 case ICMP_ULE: return ICMP_UGE;
2455 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
2457 default: assert(! "Unknown icmp predicate!");
2458 case ICMP_EQ: case ICMP_NE:
2459 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2461 case ICMP_UGT: return ICMP_SGT;
2462 case ICMP_ULT: return ICMP_SLT;
2463 case ICMP_UGE: return ICMP_SGE;
2464 case ICMP_ULE: return ICMP_SLE;
2468 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
2470 default: assert(! "Unknown icmp predicate!");
2471 case ICMP_EQ: case ICMP_NE:
2472 case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
2474 case ICMP_SGT: return ICMP_UGT;
2475 case ICMP_SLT: return ICMP_ULT;
2476 case ICMP_SGE: return ICMP_UGE;
2477 case ICMP_SLE: return ICMP_ULE;
2481 bool ICmpInst::isSignedPredicate(Predicate pred) {
2483 default: assert(! "Unknown icmp predicate!");
2484 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2486 case ICMP_EQ: case ICMP_NE: case ICMP_UGT: case ICMP_ULT:
2487 case ICMP_UGE: case ICMP_ULE:
2492 /// Initialize a set of values that all satisfy the condition with C.
2495 ICmpInst::makeConstantRange(Predicate pred, const APInt &C) {
2498 uint32_t BitWidth = C.getBitWidth();
2500 default: assert(0 && "Invalid ICmp opcode to ConstantRange ctor!");
2501 case ICmpInst::ICMP_EQ: Upper++; break;
2502 case ICmpInst::ICMP_NE: Lower++; break;
2503 case ICmpInst::ICMP_ULT: Lower = APInt::getMinValue(BitWidth); break;
2504 case ICmpInst::ICMP_SLT: Lower = APInt::getSignedMinValue(BitWidth); break;
2505 case ICmpInst::ICMP_UGT:
2506 Lower++; Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2508 case ICmpInst::ICMP_SGT:
2509 Lower++; Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2511 case ICmpInst::ICMP_ULE:
2512 Lower = APInt::getMinValue(BitWidth); Upper++;
2514 case ICmpInst::ICMP_SLE:
2515 Lower = APInt::getSignedMinValue(BitWidth); Upper++;
2517 case ICmpInst::ICMP_UGE:
2518 Upper = APInt::getMinValue(BitWidth); // Min = Next(Max)
2520 case ICmpInst::ICMP_SGE:
2521 Upper = APInt::getSignedMinValue(BitWidth); // Min = Next(Max)
2524 return ConstantRange(Lower, Upper);
2527 FCmpInst::Predicate FCmpInst::getInversePredicate(Predicate pred) {
2530 assert(!"Unknown icmp predicate!");
2531 case FCMP_OEQ: return FCMP_UNE;
2532 case FCMP_ONE: return FCMP_UEQ;
2533 case FCMP_OGT: return FCMP_ULE;
2534 case FCMP_OLT: return FCMP_UGE;
2535 case FCMP_OGE: return FCMP_ULT;
2536 case FCMP_OLE: return FCMP_UGT;
2537 case FCMP_UEQ: return FCMP_ONE;
2538 case FCMP_UNE: return FCMP_OEQ;
2539 case FCMP_UGT: return FCMP_OLE;
2540 case FCMP_ULT: return FCMP_OGE;
2541 case FCMP_UGE: return FCMP_OLT;
2542 case FCMP_ULE: return FCMP_OGT;
2543 case FCMP_ORD: return FCMP_UNO;
2544 case FCMP_UNO: return FCMP_ORD;
2545 case FCMP_TRUE: return FCMP_FALSE;
2546 case FCMP_FALSE: return FCMP_TRUE;
2550 FCmpInst::Predicate FCmpInst::getSwappedPredicate(Predicate pred) {
2552 default: assert(!"Unknown fcmp predicate!");
2553 case FCMP_FALSE: case FCMP_TRUE:
2554 case FCMP_OEQ: case FCMP_ONE:
2555 case FCMP_UEQ: case FCMP_UNE:
2556 case FCMP_ORD: case FCMP_UNO:
2558 case FCMP_OGT: return FCMP_OLT;
2559 case FCMP_OLT: return FCMP_OGT;
2560 case FCMP_OGE: return FCMP_OLE;
2561 case FCMP_OLE: return FCMP_OGE;
2562 case FCMP_UGT: return FCMP_ULT;
2563 case FCMP_ULT: return FCMP_UGT;
2564 case FCMP_UGE: return FCMP_ULE;
2565 case FCMP_ULE: return FCMP_UGE;
2569 bool CmpInst::isUnsigned(unsigned short predicate) {
2570 switch (predicate) {
2571 default: return false;
2572 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
2573 case ICmpInst::ICMP_UGE: return true;
2577 bool CmpInst::isSigned(unsigned short predicate){
2578 switch (predicate) {
2579 default: return false;
2580 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
2581 case ICmpInst::ICMP_SGE: return true;
2585 bool CmpInst::isOrdered(unsigned short predicate) {
2586 switch (predicate) {
2587 default: return false;
2588 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
2589 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
2590 case FCmpInst::FCMP_ORD: return true;
2594 bool CmpInst::isUnordered(unsigned short predicate) {
2595 switch (predicate) {
2596 default: return false;
2597 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
2598 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
2599 case FCmpInst::FCMP_UNO: return true;
2603 //===----------------------------------------------------------------------===//
2604 // SwitchInst Implementation
2605 //===----------------------------------------------------------------------===//
2607 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumCases) {
2608 assert(Value && Default);
2609 ReservedSpace = 2+NumCases*2;
2611 OperandList = allocHungoffUses(ReservedSpace);
2613 OperandList[0].init(Value, this);
2614 OperandList[1].init(Default, this);
2617 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2618 /// switch on and a default destination. The number of additional cases can
2619 /// be specified here to make memory allocation more efficient. This
2620 /// constructor can also autoinsert before another instruction.
2621 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2622 Instruction *InsertBefore)
2623 : TerminatorInst(Type::VoidTy, Instruction::Switch, 0, 0, InsertBefore) {
2624 init(Value, Default, NumCases);
2627 /// SwitchInst ctor - Create a new switch instruction, specifying a value to
2628 /// switch on and a default destination. The number of additional cases can
2629 /// be specified here to make memory allocation more efficient. This
2630 /// constructor also autoinserts at the end of the specified BasicBlock.
2631 SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
2632 BasicBlock *InsertAtEnd)
2633 : TerminatorInst(Type::VoidTy, Instruction::Switch, 0, 0, InsertAtEnd) {
2634 init(Value, Default, NumCases);
2637 SwitchInst::SwitchInst(const SwitchInst &SI)
2638 : TerminatorInst(Type::VoidTy, Instruction::Switch,
2639 allocHungoffUses(SI.getNumOperands()), SI.getNumOperands()) {
2640 Use *OL = OperandList, *InOL = SI.OperandList;
2641 for (unsigned i = 0, E = SI.getNumOperands(); i != E; i+=2) {
2642 OL[i].init(InOL[i], this);
2643 OL[i+1].init(InOL[i+1], this);
2647 SwitchInst::~SwitchInst() {
2648 dropHungoffUses(OperandList);
2652 /// addCase - Add an entry to the switch instruction...
2654 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
2655 unsigned OpNo = NumOperands;
2656 if (OpNo+2 > ReservedSpace)
2657 resizeOperands(0); // Get more space!
2658 // Initialize some new operands.
2659 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
2660 NumOperands = OpNo+2;
2661 OperandList[OpNo].init(OnVal, this);
2662 OperandList[OpNo+1].init(Dest, this);
2665 /// removeCase - This method removes the specified successor from the switch
2666 /// instruction. Note that this cannot be used to remove the default
2667 /// destination (successor #0).
2669 void SwitchInst::removeCase(unsigned idx) {
2670 assert(idx != 0 && "Cannot remove the default case!");
2671 assert(idx*2 < getNumOperands() && "Successor index out of range!!!");
2673 unsigned NumOps = getNumOperands();
2674 Use *OL = OperandList;
2676 // Move everything after this operand down.
2678 // FIXME: we could just swap with the end of the list, then erase. However,
2679 // client might not expect this to happen. The code as it is thrashes the
2680 // use/def lists, which is kinda lame.
2681 for (unsigned i = (idx+1)*2; i != NumOps; i += 2) {
2683 OL[i-2+1] = OL[i+1];
2686 // Nuke the last value.
2687 OL[NumOps-2].set(0);
2688 OL[NumOps-2+1].set(0);
2689 NumOperands = NumOps-2;
2692 /// resizeOperands - resize operands - This adjusts the length of the operands
2693 /// list according to the following behavior:
2694 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
2695 /// of operation. This grows the number of ops by 3 times.
2696 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
2697 /// 3. If NumOps == NumOperands, trim the reserved space.
2699 void SwitchInst::resizeOperands(unsigned NumOps) {
2700 unsigned e = getNumOperands();
2703 } else if (NumOps*2 > NumOperands) {
2704 // No resize needed.
2705 if (ReservedSpace >= NumOps) return;
2706 } else if (NumOps == NumOperands) {
2707 if (ReservedSpace == NumOps) return;
2712 ReservedSpace = NumOps;
2713 Use *NewOps = allocHungoffUses(NumOps);
2714 Use *OldOps = OperandList;
2715 for (unsigned i = 0; i != e; ++i) {
2716 NewOps[i].init(OldOps[i], this);
2718 OperandList = NewOps;
2719 if (OldOps) Use::zap(OldOps, OldOps + e, true);
2723 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
2724 return getSuccessor(idx);
2726 unsigned SwitchInst::getNumSuccessorsV() const {
2727 return getNumSuccessors();
2729 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
2730 setSuccessor(idx, B);
2733 //===----------------------------------------------------------------------===//
2734 // GetResultInst Implementation
2735 //===----------------------------------------------------------------------===//
2737 GetResultInst::GetResultInst(Value *Aggregate, unsigned Index,
2738 const std::string &Name,
2739 Instruction *InsertBef)
2740 : UnaryInstruction(cast<StructType>(Aggregate->getType())
2741 ->getElementType(Index),
2742 GetResult, Aggregate, InsertBef),
2744 assert(isValidOperands(Aggregate, Index)
2745 && "Invalid GetResultInst operands!");
2749 bool GetResultInst::isValidOperands(const Value *Aggregate, unsigned Index) {
2753 if (const StructType *STy = dyn_cast<StructType>(Aggregate->getType())) {
2754 unsigned NumElements = STy->getNumElements();
2755 if (Index >= NumElements || NumElements == 0)
2758 // getresult aggregate value's element types are restricted to
2759 // avoid nested aggregates.
2760 for (unsigned i = 0; i < NumElements; ++i)
2761 if (!STy->getElementType(i)->isFirstClassType())
2764 // Otherwise, Aggregate is valid.
2770 // Define these methods here so vtables don't get emitted into every translation
2771 // unit that uses these classes.
2773 GetElementPtrInst *GetElementPtrInst::clone() const {
2774 return new(getNumOperands()) GetElementPtrInst(*this);
2777 BinaryOperator *BinaryOperator::clone() const {
2778 return create(getOpcode(), Op<0>(), Op<1>());
2781 FCmpInst* FCmpInst::clone() const {
2782 return new FCmpInst(getPredicate(), Op<0>(), Op<1>());
2784 ICmpInst* ICmpInst::clone() const {
2785 return new ICmpInst(getPredicate(), Op<0>(), Op<1>());
2788 VFCmpInst* VFCmpInst::clone() const {
2789 return new VFCmpInst(getPredicate(), Op<0>(), Op<1>());
2791 VICmpInst* VICmpInst::clone() const {
2792 return new VICmpInst(getPredicate(), Op<0>(), Op<1>());
2795 MallocInst *MallocInst::clone() const { return new MallocInst(*this); }
2796 AllocaInst *AllocaInst::clone() const { return new AllocaInst(*this); }
2797 FreeInst *FreeInst::clone() const { return new FreeInst(getOperand(0)); }
2798 LoadInst *LoadInst::clone() const { return new LoadInst(*this); }
2799 StoreInst *StoreInst::clone() const { return new StoreInst(*this); }
2800 CastInst *TruncInst::clone() const { return new TruncInst(*this); }
2801 CastInst *ZExtInst::clone() const { return new ZExtInst(*this); }
2802 CastInst *SExtInst::clone() const { return new SExtInst(*this); }
2803 CastInst *FPTruncInst::clone() const { return new FPTruncInst(*this); }
2804 CastInst *FPExtInst::clone() const { return new FPExtInst(*this); }
2805 CastInst *UIToFPInst::clone() const { return new UIToFPInst(*this); }
2806 CastInst *SIToFPInst::clone() const { return new SIToFPInst(*this); }
2807 CastInst *FPToUIInst::clone() const { return new FPToUIInst(*this); }
2808 CastInst *FPToSIInst::clone() const { return new FPToSIInst(*this); }
2809 CastInst *PtrToIntInst::clone() const { return new PtrToIntInst(*this); }
2810 CastInst *IntToPtrInst::clone() const { return new IntToPtrInst(*this); }
2811 CastInst *BitCastInst::clone() const { return new BitCastInst(*this); }
2812 CallInst *CallInst::clone() const {
2813 return new(getNumOperands()) CallInst(*this);
2815 SelectInst *SelectInst::clone() const {
2816 return new(getNumOperands()) SelectInst(*this);
2818 VAArgInst *VAArgInst::clone() const { return new VAArgInst(*this); }
2820 ExtractElementInst *ExtractElementInst::clone() const {
2821 return new ExtractElementInst(*this);
2823 InsertElementInst *InsertElementInst::clone() const {
2824 return InsertElementInst::Create(*this);
2826 ShuffleVectorInst *ShuffleVectorInst::clone() const {
2827 return new ShuffleVectorInst(*this);
2829 PHINode *PHINode::clone() const { return new PHINode(*this); }
2830 ReturnInst *ReturnInst::clone() const {
2831 return new(getNumOperands()) ReturnInst(*this);
2833 BranchInst *BranchInst::clone() const {
2834 return new(getNumOperands()) BranchInst(*this);
2836 SwitchInst *SwitchInst::clone() const { return new SwitchInst(*this); }
2837 InvokeInst *InvokeInst::clone() const {
2838 return new(getNumOperands()) InvokeInst(*this);
2840 UnwindInst *UnwindInst::clone() const { return new UnwindInst(); }
2841 UnreachableInst *UnreachableInst::clone() const { return new UnreachableInst();}
2842 GetResultInst *GetResultInst::clone() const { return new GetResultInst(*this); }