1 //===-- Instructions.cpp - Implement the LLVM instructions ----------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source 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"
23 unsigned CallSite::getCallingConv() const {
24 if (CallInst *CI = dyn_cast<CallInst>(I))
25 return CI->getCallingConv();
27 return cast<InvokeInst>(I)->getCallingConv();
29 void CallSite::setCallingConv(unsigned CC) {
30 if (CallInst *CI = dyn_cast<CallInst>(I))
31 CI->setCallingConv(CC);
33 cast<InvokeInst>(I)->setCallingConv(CC);
39 //===----------------------------------------------------------------------===//
40 // TerminatorInst Class
41 //===----------------------------------------------------------------------===//
43 TerminatorInst::TerminatorInst(Instruction::TermOps iType,
44 Use *Ops, unsigned NumOps, Instruction *IB)
45 : Instruction(Type::VoidTy, iType, Ops, NumOps, "", IB) {
48 TerminatorInst::TerminatorInst(Instruction::TermOps iType,
49 Use *Ops, unsigned NumOps, BasicBlock *IAE)
50 : Instruction(Type::VoidTy, iType, Ops, NumOps, "", IAE) {
53 // Out of line virtual method, so the vtable, etc has a home.
54 TerminatorInst::~TerminatorInst() {
57 // Out of line virtual method, so the vtable, etc has a home.
58 UnaryInstruction::~UnaryInstruction() {
62 //===----------------------------------------------------------------------===//
64 //===----------------------------------------------------------------------===//
66 PHINode::PHINode(const PHINode &PN)
67 : Instruction(PN.getType(), Instruction::PHI,
68 new Use[PN.getNumOperands()], PN.getNumOperands()),
69 ReservedSpace(PN.getNumOperands()) {
70 Use *OL = OperandList;
71 for (unsigned i = 0, e = PN.getNumOperands(); i != e; i+=2) {
72 OL[i].init(PN.getOperand(i), this);
73 OL[i+1].init(PN.getOperand(i+1), this);
78 delete [] OperandList;
81 // removeIncomingValue - Remove an incoming value. This is useful if a
82 // predecessor basic block is deleted.
83 Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
84 unsigned NumOps = getNumOperands();
85 Use *OL = OperandList;
86 assert(Idx*2 < NumOps && "BB not in PHI node!");
87 Value *Removed = OL[Idx*2];
89 // Move everything after this operand down.
91 // FIXME: we could just swap with the end of the list, then erase. However,
92 // client might not expect this to happen. The code as it is thrashes the
93 // use/def lists, which is kinda lame.
94 for (unsigned i = (Idx+1)*2; i != NumOps; i += 2) {
99 // Nuke the last value.
101 OL[NumOps-2+1].set(0);
102 NumOperands = NumOps-2;
104 // If the PHI node is dead, because it has zero entries, nuke it now.
105 if (NumOps == 2 && DeletePHIIfEmpty) {
106 // If anyone is using this PHI, make them use a dummy value instead...
107 replaceAllUsesWith(UndefValue::get(getType()));
113 /// resizeOperands - resize operands - This adjusts the length of the operands
114 /// list according to the following behavior:
115 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
116 /// of operation. This grows the number of ops by 1.5 times.
117 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
118 /// 3. If NumOps == NumOperands, trim the reserved space.
120 void PHINode::resizeOperands(unsigned NumOps) {
122 NumOps = (getNumOperands())*3/2;
123 if (NumOps < 4) NumOps = 4; // 4 op PHI nodes are VERY common.
124 } else if (NumOps*2 > NumOperands) {
126 if (ReservedSpace >= NumOps) return;
127 } else if (NumOps == NumOperands) {
128 if (ReservedSpace == NumOps) return;
133 ReservedSpace = NumOps;
134 Use *NewOps = new Use[NumOps];
135 Use *OldOps = OperandList;
136 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
137 NewOps[i].init(OldOps[i], this);
141 OperandList = NewOps;
144 /// hasConstantValue - If the specified PHI node always merges together the same
145 /// value, return the value, otherwise return null.
147 Value *PHINode::hasConstantValue(bool AllowNonDominatingInstruction) const {
148 // If the PHI node only has one incoming value, eliminate the PHI node...
149 if (getNumIncomingValues() == 1)
150 if (getIncomingValue(0) != this) // not X = phi X
151 return getIncomingValue(0);
153 return UndefValue::get(getType()); // Self cycle is dead.
155 // Otherwise if all of the incoming values are the same for the PHI, replace
156 // the PHI node with the incoming value.
159 bool HasUndefInput = false;
160 for (unsigned i = 0, e = getNumIncomingValues(); i != e; ++i)
161 if (isa<UndefValue>(getIncomingValue(i)))
162 HasUndefInput = true;
163 else if (getIncomingValue(i) != this) // Not the PHI node itself...
164 if (InVal && getIncomingValue(i) != InVal)
165 return 0; // Not the same, bail out.
167 InVal = getIncomingValue(i);
169 // The only case that could cause InVal to be null is if we have a PHI node
170 // that only has entries for itself. In this case, there is no entry into the
171 // loop, so kill the PHI.
173 if (InVal == 0) InVal = UndefValue::get(getType());
175 // If we have a PHI node like phi(X, undef, X), where X is defined by some
176 // instruction, we cannot always return X as the result of the PHI node. Only
177 // do this if X is not an instruction (thus it must dominate the PHI block),
178 // or if the client is prepared to deal with this possibility.
179 if (HasUndefInput && !AllowNonDominatingInstruction)
180 if (Instruction *IV = dyn_cast<Instruction>(InVal))
181 // If it's in the entry block, it dominates everything.
182 if (IV->getParent() != &IV->getParent()->getParent()->front() ||
184 return 0; // Cannot guarantee that InVal dominates this PHINode.
186 // All of the incoming values are the same, return the value now.
191 //===----------------------------------------------------------------------===//
192 // CallInst Implementation
193 //===----------------------------------------------------------------------===//
195 CallInst::~CallInst() {
196 delete [] OperandList;
199 void CallInst::init(Value *Func, const std::vector<Value*> &Params) {
200 NumOperands = Params.size()+1;
201 Use *OL = OperandList = new Use[Params.size()+1];
202 OL[0].init(Func, this);
204 const FunctionType *FTy =
205 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
207 assert((Params.size() == FTy->getNumParams() ||
208 (FTy->isVarArg() && Params.size() > FTy->getNumParams())) &&
209 "Calling a function with bad signature!");
210 for (unsigned i = 0, e = Params.size(); i != e; ++i) {
211 assert((i >= FTy->getNumParams() ||
212 FTy->getParamType(i) == Params[i]->getType()) &&
213 "Calling a function with a bad signature!");
214 OL[i+1].init(Params[i], this);
218 void CallInst::init(Value *Func, Value *Actual1, Value *Actual2) {
220 Use *OL = OperandList = new Use[3];
221 OL[0].init(Func, this);
222 OL[1].init(Actual1, this);
223 OL[2].init(Actual2, this);
225 const FunctionType *FTy =
226 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
228 assert((FTy->getNumParams() == 2 ||
229 (FTy->isVarArg() && FTy->getNumParams() < 2)) &&
230 "Calling a function with bad signature");
231 assert((0 >= FTy->getNumParams() ||
232 FTy->getParamType(0) == Actual1->getType()) &&
233 "Calling a function with a bad signature!");
234 assert((1 >= FTy->getNumParams() ||
235 FTy->getParamType(1) == Actual2->getType()) &&
236 "Calling a function with a bad signature!");
239 void CallInst::init(Value *Func, Value *Actual) {
241 Use *OL = OperandList = new Use[2];
242 OL[0].init(Func, this);
243 OL[1].init(Actual, this);
245 const FunctionType *FTy =
246 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
248 assert((FTy->getNumParams() == 1 ||
249 (FTy->isVarArg() && FTy->getNumParams() == 0)) &&
250 "Calling a function with bad signature");
251 assert((0 == FTy->getNumParams() ||
252 FTy->getParamType(0) == Actual->getType()) &&
253 "Calling a function with a bad signature!");
256 void CallInst::init(Value *Func) {
258 Use *OL = OperandList = new Use[1];
259 OL[0].init(Func, this);
261 const FunctionType *MTy =
262 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
264 assert(MTy->getNumParams() == 0 && "Calling a function with bad signature");
267 CallInst::CallInst(Value *Func, const std::vector<Value*> &Params,
268 const std::string &Name, Instruction *InsertBefore)
269 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
270 ->getElementType())->getReturnType(),
271 Instruction::Call, 0, 0, Name, InsertBefore) {
275 CallInst::CallInst(Value *Func, const std::vector<Value*> &Params,
276 const std::string &Name, BasicBlock *InsertAtEnd)
277 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
278 ->getElementType())->getReturnType(),
279 Instruction::Call, 0, 0, Name, InsertAtEnd) {
283 CallInst::CallInst(Value *Func, Value *Actual1, Value *Actual2,
284 const std::string &Name, Instruction *InsertBefore)
285 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
286 ->getElementType())->getReturnType(),
287 Instruction::Call, 0, 0, Name, InsertBefore) {
288 init(Func, Actual1, Actual2);
291 CallInst::CallInst(Value *Func, Value *Actual1, Value *Actual2,
292 const std::string &Name, BasicBlock *InsertAtEnd)
293 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
294 ->getElementType())->getReturnType(),
295 Instruction::Call, 0, 0, Name, InsertAtEnd) {
296 init(Func, Actual1, Actual2);
299 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
300 Instruction *InsertBefore)
301 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
302 ->getElementType())->getReturnType(),
303 Instruction::Call, 0, 0, Name, InsertBefore) {
307 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
308 BasicBlock *InsertAtEnd)
309 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
310 ->getElementType())->getReturnType(),
311 Instruction::Call, 0, 0, Name, InsertAtEnd) {
315 CallInst::CallInst(Value *Func, const std::string &Name,
316 Instruction *InsertBefore)
317 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
318 ->getElementType())->getReturnType(),
319 Instruction::Call, 0, 0, Name, InsertBefore) {
323 CallInst::CallInst(Value *Func, const std::string &Name,
324 BasicBlock *InsertAtEnd)
325 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
326 ->getElementType())->getReturnType(),
327 Instruction::Call, 0, 0, Name, InsertAtEnd) {
331 CallInst::CallInst(const CallInst &CI)
332 : Instruction(CI.getType(), Instruction::Call, new Use[CI.getNumOperands()],
333 CI.getNumOperands()) {
334 SubclassData = CI.SubclassData;
335 Use *OL = OperandList;
336 Use *InOL = CI.OperandList;
337 for (unsigned i = 0, e = CI.getNumOperands(); i != e; ++i)
338 OL[i].init(InOL[i], this);
342 //===----------------------------------------------------------------------===//
343 // InvokeInst Implementation
344 //===----------------------------------------------------------------------===//
346 InvokeInst::~InvokeInst() {
347 delete [] OperandList;
350 void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
351 const std::vector<Value*> &Params) {
352 NumOperands = 3+Params.size();
353 Use *OL = OperandList = new Use[3+Params.size()];
354 OL[0].init(Fn, this);
355 OL[1].init(IfNormal, this);
356 OL[2].init(IfException, this);
357 const FunctionType *FTy =
358 cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
360 assert((Params.size() == FTy->getNumParams()) ||
361 (FTy->isVarArg() && Params.size() > FTy->getNumParams()) &&
362 "Calling a function with bad signature");
364 for (unsigned i = 0, e = Params.size(); i != e; i++) {
365 assert((i >= FTy->getNumParams() ||
366 FTy->getParamType(i) == Params[i]->getType()) &&
367 "Invoking a function with a bad signature!");
369 OL[i+3].init(Params[i], this);
373 InvokeInst::InvokeInst(Value *Fn, BasicBlock *IfNormal,
374 BasicBlock *IfException,
375 const std::vector<Value*> &Params,
376 const std::string &Name, Instruction *InsertBefore)
377 : TerminatorInst(cast<FunctionType>(cast<PointerType>(Fn->getType())
378 ->getElementType())->getReturnType(),
379 Instruction::Invoke, 0, 0, Name, InsertBefore) {
380 init(Fn, IfNormal, IfException, Params);
383 InvokeInst::InvokeInst(Value *Fn, BasicBlock *IfNormal,
384 BasicBlock *IfException,
385 const std::vector<Value*> &Params,
386 const std::string &Name, BasicBlock *InsertAtEnd)
387 : TerminatorInst(cast<FunctionType>(cast<PointerType>(Fn->getType())
388 ->getElementType())->getReturnType(),
389 Instruction::Invoke, 0, 0, Name, InsertAtEnd) {
390 init(Fn, IfNormal, IfException, Params);
393 InvokeInst::InvokeInst(const InvokeInst &II)
394 : TerminatorInst(II.getType(), Instruction::Invoke,
395 new Use[II.getNumOperands()], II.getNumOperands()) {
396 SubclassData = II.SubclassData;
397 Use *OL = OperandList, *InOL = II.OperandList;
398 for (unsigned i = 0, e = II.getNumOperands(); i != e; ++i)
399 OL[i].init(InOL[i], this);
402 BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
403 return getSuccessor(idx);
405 unsigned InvokeInst::getNumSuccessorsV() const {
406 return getNumSuccessors();
408 void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
409 return setSuccessor(idx, B);
413 //===----------------------------------------------------------------------===//
414 // ReturnInst Implementation
415 //===----------------------------------------------------------------------===//
417 void ReturnInst::init(Value *retVal) {
418 if (retVal && retVal->getType() != Type::VoidTy) {
419 assert(!isa<BasicBlock>(retVal) &&
420 "Cannot return basic block. Probably using the incorrect ctor");
422 RetVal.init(retVal, this);
426 unsigned ReturnInst::getNumSuccessorsV() const {
427 return getNumSuccessors();
430 // Out-of-line ReturnInst method, put here so the C++ compiler can choose to
431 // emit the vtable for the class in this translation unit.
432 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
433 assert(0 && "ReturnInst has no successors!");
436 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
437 assert(0 && "ReturnInst has no successors!");
443 //===----------------------------------------------------------------------===//
444 // UnwindInst Implementation
445 //===----------------------------------------------------------------------===//
447 unsigned UnwindInst::getNumSuccessorsV() const {
448 return getNumSuccessors();
451 void UnwindInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
452 assert(0 && "UnwindInst has no successors!");
455 BasicBlock *UnwindInst::getSuccessorV(unsigned idx) const {
456 assert(0 && "UnwindInst has no successors!");
461 //===----------------------------------------------------------------------===//
462 // UnreachableInst Implementation
463 //===----------------------------------------------------------------------===//
465 unsigned UnreachableInst::getNumSuccessorsV() const {
466 return getNumSuccessors();
469 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
470 assert(0 && "UnwindInst has no successors!");
473 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
474 assert(0 && "UnwindInst has no successors!");
479 //===----------------------------------------------------------------------===//
480 // BranchInst Implementation
481 //===----------------------------------------------------------------------===//
483 void BranchInst::AssertOK() {
485 assert(getCondition()->getType() == Type::Int1Ty &&
486 "May only branch on boolean predicates!");
489 BranchInst::BranchInst(const BranchInst &BI) :
490 TerminatorInst(Instruction::Br, Ops, BI.getNumOperands()) {
491 OperandList[0].init(BI.getOperand(0), this);
492 if (BI.getNumOperands() != 1) {
493 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
494 OperandList[1].init(BI.getOperand(1), this);
495 OperandList[2].init(BI.getOperand(2), this);
499 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
500 return getSuccessor(idx);
502 unsigned BranchInst::getNumSuccessorsV() const {
503 return getNumSuccessors();
505 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
506 setSuccessor(idx, B);
510 //===----------------------------------------------------------------------===//
511 // AllocationInst Implementation
512 //===----------------------------------------------------------------------===//
514 static Value *getAISize(Value *Amt) {
516 Amt = ConstantInt::get(Type::Int32Ty, 1);
518 assert(!isa<BasicBlock>(Amt) &&
519 "Passed basic block into allocation size parameter! Ue other ctor");
520 assert(Amt->getType() == Type::Int32Ty &&
521 "Malloc/Allocation array size is not a 32-bit integer!");
526 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
527 unsigned Align, const std::string &Name,
528 Instruction *InsertBefore)
529 : UnaryInstruction(PointerType::get(Ty), iTy, getAISize(ArraySize),
530 Name, InsertBefore), Alignment(Align) {
531 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
532 assert(Ty != Type::VoidTy && "Cannot allocate void!");
535 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
536 unsigned Align, const std::string &Name,
537 BasicBlock *InsertAtEnd)
538 : UnaryInstruction(PointerType::get(Ty), iTy, getAISize(ArraySize),
539 Name, InsertAtEnd), Alignment(Align) {
540 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
541 assert(Ty != Type::VoidTy && "Cannot allocate void!");
544 // Out of line virtual method, so the vtable, etc has a home.
545 AllocationInst::~AllocationInst() {
548 bool AllocationInst::isArrayAllocation() const {
549 if (ConstantInt *CUI = dyn_cast<ConstantInt>(getOperand(0)))
550 return CUI->getZExtValue() != 1;
554 const Type *AllocationInst::getAllocatedType() const {
555 return getType()->getElementType();
558 AllocaInst::AllocaInst(const AllocaInst &AI)
559 : AllocationInst(AI.getType()->getElementType(), (Value*)AI.getOperand(0),
560 Instruction::Alloca, AI.getAlignment()) {
563 MallocInst::MallocInst(const MallocInst &MI)
564 : AllocationInst(MI.getType()->getElementType(), (Value*)MI.getOperand(0),
565 Instruction::Malloc, MI.getAlignment()) {
568 //===----------------------------------------------------------------------===//
569 // FreeInst Implementation
570 //===----------------------------------------------------------------------===//
572 void FreeInst::AssertOK() {
573 assert(isa<PointerType>(getOperand(0)->getType()) &&
574 "Can not free something of nonpointer type!");
577 FreeInst::FreeInst(Value *Ptr, Instruction *InsertBefore)
578 : UnaryInstruction(Type::VoidTy, Free, Ptr, "", InsertBefore) {
582 FreeInst::FreeInst(Value *Ptr, BasicBlock *InsertAtEnd)
583 : UnaryInstruction(Type::VoidTy, Free, Ptr, "", InsertAtEnd) {
588 //===----------------------------------------------------------------------===//
589 // LoadInst Implementation
590 //===----------------------------------------------------------------------===//
592 void LoadInst::AssertOK() {
593 assert(isa<PointerType>(getOperand(0)->getType()) &&
594 "Ptr must have pointer type.");
597 LoadInst::LoadInst(Value *Ptr, const std::string &Name, Instruction *InsertBef)
598 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
599 Load, Ptr, Name, InsertBef) {
604 LoadInst::LoadInst(Value *Ptr, const std::string &Name, BasicBlock *InsertAE)
605 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
606 Load, Ptr, Name, InsertAE) {
611 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
612 Instruction *InsertBef)
613 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
614 Load, Ptr, Name, InsertBef) {
615 setVolatile(isVolatile);
619 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
620 BasicBlock *InsertAE)
621 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
622 Load, Ptr, Name, InsertAE) {
623 setVolatile(isVolatile);
628 //===----------------------------------------------------------------------===//
629 // StoreInst Implementation
630 //===----------------------------------------------------------------------===//
632 void StoreInst::AssertOK() {
633 assert(isa<PointerType>(getOperand(1)->getType()) &&
634 "Ptr must have pointer type!");
635 assert(getOperand(0)->getType() ==
636 cast<PointerType>(getOperand(1)->getType())->getElementType()
637 && "Ptr must be a pointer to Val type!");
641 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
642 : Instruction(Type::VoidTy, Store, Ops, 2, "", InsertBefore) {
643 Ops[0].init(val, this);
644 Ops[1].init(addr, this);
649 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
650 : Instruction(Type::VoidTy, Store, Ops, 2, "", InsertAtEnd) {
651 Ops[0].init(val, this);
652 Ops[1].init(addr, this);
657 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
658 Instruction *InsertBefore)
659 : Instruction(Type::VoidTy, Store, Ops, 2, "", InsertBefore) {
660 Ops[0].init(val, this);
661 Ops[1].init(addr, this);
662 setVolatile(isVolatile);
666 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
667 BasicBlock *InsertAtEnd)
668 : Instruction(Type::VoidTy, Store, Ops, 2, "", InsertAtEnd) {
669 Ops[0].init(val, this);
670 Ops[1].init(addr, this);
671 setVolatile(isVolatile);
675 //===----------------------------------------------------------------------===//
676 // GetElementPtrInst Implementation
677 //===----------------------------------------------------------------------===//
679 // checkType - Simple wrapper function to give a better assertion failure
680 // message on bad indexes for a gep instruction.
682 static inline const Type *checkType(const Type *Ty) {
683 assert(Ty && "Invalid GetElementPtrInst indices for type!");
687 void GetElementPtrInst::init(Value *Ptr, Value* const *Idx, unsigned NumIdx) {
688 NumOperands = 1+NumIdx;
689 Use *OL = OperandList = new Use[NumOperands];
690 OL[0].init(Ptr, this);
692 for (unsigned i = 0; i != NumIdx; ++i)
693 OL[i+1].init(Idx[i], this);
696 void GetElementPtrInst::init(Value *Ptr, Value *Idx0, Value *Idx1) {
698 Use *OL = OperandList = new Use[3];
699 OL[0].init(Ptr, this);
700 OL[1].init(Idx0, this);
701 OL[2].init(Idx1, this);
704 void GetElementPtrInst::init(Value *Ptr, Value *Idx) {
706 Use *OL = OperandList = new Use[2];
707 OL[0].init(Ptr, this);
708 OL[1].init(Idx, this);
711 GetElementPtrInst::GetElementPtrInst(Value *Ptr, const std::vector<Value*> &Idx,
712 const std::string &Name, Instruction *InBe)
713 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
716 GetElementPtr, 0, 0, Name, InBe) {
717 init(Ptr, &Idx[0], Idx.size());
720 GetElementPtrInst::GetElementPtrInst(Value *Ptr, const std::vector<Value*> &Idx,
721 const std::string &Name, BasicBlock *IAE)
722 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
725 GetElementPtr, 0, 0, Name, IAE) {
726 init(Ptr, &Idx[0], Idx.size());
729 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value* const *Idx,
731 const std::string &Name, Instruction *InBe)
732 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
733 Idx, NumIdx, true))),
734 GetElementPtr, 0, 0, Name, InBe) {
735 init(Ptr, Idx, NumIdx);
738 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value* const *Idx,
740 const std::string &Name, BasicBlock *IAE)
741 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
742 Idx, NumIdx, true))),
743 GetElementPtr, 0, 0, Name, IAE) {
744 init(Ptr, Idx, NumIdx);
747 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
748 const std::string &Name, Instruction *InBe)
749 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
751 GetElementPtr, 0, 0, Name, InBe) {
755 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
756 const std::string &Name, BasicBlock *IAE)
757 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
759 GetElementPtr, 0, 0, Name, IAE) {
763 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx0, Value *Idx1,
764 const std::string &Name, Instruction *InBe)
765 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
767 GetElementPtr, 0, 0, Name, InBe) {
768 init(Ptr, Idx0, Idx1);
771 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx0, Value *Idx1,
772 const std::string &Name, BasicBlock *IAE)
773 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
775 GetElementPtr, 0, 0, Name, IAE) {
776 init(Ptr, Idx0, Idx1);
779 GetElementPtrInst::~GetElementPtrInst() {
780 delete[] OperandList;
783 // getIndexedType - Returns the type of the element that would be loaded with
784 // a load instruction with the specified parameters.
786 // A null type is returned if the indices are invalid for the specified
789 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
792 bool AllowCompositeLeaf) {
793 if (!isa<PointerType>(Ptr)) return 0; // Type isn't a pointer type!
795 // Handle the special case of the empty set index set...
797 if (AllowCompositeLeaf ||
798 cast<PointerType>(Ptr)->getElementType()->isFirstClassType())
799 return cast<PointerType>(Ptr)->getElementType();
804 while (const CompositeType *CT = dyn_cast<CompositeType>(Ptr)) {
805 if (NumIdx == CurIdx) {
806 if (AllowCompositeLeaf || CT->isFirstClassType()) return Ptr;
807 return 0; // Can't load a whole structure or array!?!?
810 Value *Index = Idxs[CurIdx++];
811 if (isa<PointerType>(CT) && CurIdx != 1)
812 return 0; // Can only index into pointer types at the first index!
813 if (!CT->indexValid(Index)) return 0;
814 Ptr = CT->getTypeAtIndex(Index);
816 // If the new type forwards to another type, then it is in the middle
817 // of being refined to another type (and hence, may have dropped all
818 // references to what it was using before). So, use the new forwarded
820 if (const Type * Ty = Ptr->getForwardedType()) {
824 return CurIdx == NumIdx ? Ptr : 0;
827 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
828 Value *Idx0, Value *Idx1,
829 bool AllowCompositeLeaf) {
830 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
831 if (!PTy) return 0; // Type isn't a pointer type!
833 // Check the pointer index.
834 if (!PTy->indexValid(Idx0)) return 0;
836 const CompositeType *CT = dyn_cast<CompositeType>(PTy->getElementType());
837 if (!CT || !CT->indexValid(Idx1)) return 0;
839 const Type *ElTy = CT->getTypeAtIndex(Idx1);
840 if (AllowCompositeLeaf || ElTy->isFirstClassType())
845 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr, Value *Idx) {
846 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
847 if (!PTy) return 0; // Type isn't a pointer type!
849 // Check the pointer index.
850 if (!PTy->indexValid(Idx)) return 0;
852 return PTy->getElementType();
855 //===----------------------------------------------------------------------===//
856 // ExtractElementInst Implementation
857 //===----------------------------------------------------------------------===//
859 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
860 const std::string &Name,
861 Instruction *InsertBef)
862 : Instruction(cast<PackedType>(Val->getType())->getElementType(),
863 ExtractElement, Ops, 2, Name, InsertBef) {
864 assert(isValidOperands(Val, Index) &&
865 "Invalid extractelement instruction operands!");
866 Ops[0].init(Val, this);
867 Ops[1].init(Index, this);
870 ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
871 const std::string &Name,
872 Instruction *InsertBef)
873 : Instruction(cast<PackedType>(Val->getType())->getElementType(),
874 ExtractElement, Ops, 2, Name, InsertBef) {
875 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
876 assert(isValidOperands(Val, Index) &&
877 "Invalid extractelement instruction operands!");
878 Ops[0].init(Val, this);
879 Ops[1].init(Index, this);
883 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
884 const std::string &Name,
885 BasicBlock *InsertAE)
886 : Instruction(cast<PackedType>(Val->getType())->getElementType(),
887 ExtractElement, Ops, 2, Name, InsertAE) {
888 assert(isValidOperands(Val, Index) &&
889 "Invalid extractelement instruction operands!");
891 Ops[0].init(Val, this);
892 Ops[1].init(Index, this);
895 ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
896 const std::string &Name,
897 BasicBlock *InsertAE)
898 : Instruction(cast<PackedType>(Val->getType())->getElementType(),
899 ExtractElement, Ops, 2, Name, InsertAE) {
900 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
901 assert(isValidOperands(Val, Index) &&
902 "Invalid extractelement instruction operands!");
904 Ops[0].init(Val, this);
905 Ops[1].init(Index, this);
909 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
910 if (!isa<PackedType>(Val->getType()) || Index->getType() != Type::Int32Ty)
916 //===----------------------------------------------------------------------===//
917 // InsertElementInst Implementation
918 //===----------------------------------------------------------------------===//
920 InsertElementInst::InsertElementInst(const InsertElementInst &IE)
921 : Instruction(IE.getType(), InsertElement, Ops, 3) {
922 Ops[0].init(IE.Ops[0], this);
923 Ops[1].init(IE.Ops[1], this);
924 Ops[2].init(IE.Ops[2], this);
926 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
927 const std::string &Name,
928 Instruction *InsertBef)
929 : Instruction(Vec->getType(), InsertElement, Ops, 3, Name, InsertBef) {
930 assert(isValidOperands(Vec, Elt, Index) &&
931 "Invalid insertelement instruction operands!");
932 Ops[0].init(Vec, this);
933 Ops[1].init(Elt, this);
934 Ops[2].init(Index, this);
937 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
938 const std::string &Name,
939 Instruction *InsertBef)
940 : Instruction(Vec->getType(), InsertElement, Ops, 3, Name, InsertBef) {
941 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
942 assert(isValidOperands(Vec, Elt, Index) &&
943 "Invalid insertelement instruction operands!");
944 Ops[0].init(Vec, this);
945 Ops[1].init(Elt, this);
946 Ops[2].init(Index, this);
950 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
951 const std::string &Name,
952 BasicBlock *InsertAE)
953 : Instruction(Vec->getType(), InsertElement, Ops, 3, Name, InsertAE) {
954 assert(isValidOperands(Vec, Elt, Index) &&
955 "Invalid insertelement instruction operands!");
957 Ops[0].init(Vec, this);
958 Ops[1].init(Elt, this);
959 Ops[2].init(Index, this);
962 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
963 const std::string &Name,
964 BasicBlock *InsertAE)
965 : Instruction(Vec->getType(), InsertElement, Ops, 3, Name, InsertAE) {
966 Constant *Index = ConstantInt::get(Type::Int32Ty, IndexV);
967 assert(isValidOperands(Vec, Elt, Index) &&
968 "Invalid insertelement instruction operands!");
970 Ops[0].init(Vec, this);
971 Ops[1].init(Elt, this);
972 Ops[2].init(Index, this);
975 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
976 const Value *Index) {
977 if (!isa<PackedType>(Vec->getType()))
978 return false; // First operand of insertelement must be packed type.
980 if (Elt->getType() != cast<PackedType>(Vec->getType())->getElementType())
981 return false;// Second operand of insertelement must be packed element type.
983 if (Index->getType() != Type::Int32Ty)
984 return false; // Third operand of insertelement must be uint.
989 //===----------------------------------------------------------------------===//
990 // ShuffleVectorInst Implementation
991 //===----------------------------------------------------------------------===//
993 ShuffleVectorInst::ShuffleVectorInst(const ShuffleVectorInst &SV)
994 : Instruction(SV.getType(), ShuffleVector, Ops, 3) {
995 Ops[0].init(SV.Ops[0], this);
996 Ops[1].init(SV.Ops[1], this);
997 Ops[2].init(SV.Ops[2], this);
1000 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1001 const std::string &Name,
1002 Instruction *InsertBefore)
1003 : Instruction(V1->getType(), ShuffleVector, Ops, 3, Name, InsertBefore) {
1004 assert(isValidOperands(V1, V2, Mask) &&
1005 "Invalid shuffle vector instruction operands!");
1006 Ops[0].init(V1, this);
1007 Ops[1].init(V2, this);
1008 Ops[2].init(Mask, this);
1011 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
1012 const std::string &Name,
1013 BasicBlock *InsertAtEnd)
1014 : Instruction(V1->getType(), ShuffleVector, Ops, 3, Name, InsertAtEnd) {
1015 assert(isValidOperands(V1, V2, Mask) &&
1016 "Invalid shuffle vector instruction operands!");
1018 Ops[0].init(V1, this);
1019 Ops[1].init(V2, this);
1020 Ops[2].init(Mask, this);
1023 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
1024 const Value *Mask) {
1025 if (!isa<PackedType>(V1->getType())) return false;
1026 if (V1->getType() != V2->getType()) return false;
1027 if (!isa<PackedType>(Mask->getType()) ||
1028 cast<PackedType>(Mask->getType())->getElementType() != Type::Int32Ty ||
1029 cast<PackedType>(Mask->getType())->getNumElements() !=
1030 cast<PackedType>(V1->getType())->getNumElements())
1036 //===----------------------------------------------------------------------===//
1037 // BinaryOperator Class
1038 //===----------------------------------------------------------------------===//
1040 void BinaryOperator::init(BinaryOps iType)
1042 Value *LHS = getOperand(0), *RHS = getOperand(1);
1043 assert(LHS->getType() == RHS->getType() &&
1044 "Binary operator operand types must match!");
1049 assert(getType() == LHS->getType() &&
1050 "Arithmetic operation should return same type as operands!");
1051 assert((getType()->isInteger() || getType()->isFloatingPoint() ||
1052 isa<PackedType>(getType())) &&
1053 "Tried to create an arithmetic operation on a non-arithmetic type!");
1057 assert(getType() == LHS->getType() &&
1058 "Arithmetic operation should return same type as operands!");
1059 assert((getType()->isInteger() || (isa<PackedType>(getType()) &&
1060 cast<PackedType>(getType())->getElementType()->isInteger())) &&
1061 "Incorrect operand type (not integer) for S/UDIV");
1064 assert(getType() == LHS->getType() &&
1065 "Arithmetic operation should return same type as operands!");
1066 assert((getType()->isFloatingPoint() || (isa<PackedType>(getType()) &&
1067 cast<PackedType>(getType())->getElementType()->isFloatingPoint()))
1068 && "Incorrect operand type (not floating point) for FDIV");
1072 assert(getType() == LHS->getType() &&
1073 "Arithmetic operation should return same type as operands!");
1074 assert((getType()->isInteger() || (isa<PackedType>(getType()) &&
1075 cast<PackedType>(getType())->getElementType()->isInteger())) &&
1076 "Incorrect operand type (not integer) for S/UREM");
1079 assert(getType() == LHS->getType() &&
1080 "Arithmetic operation should return same type as operands!");
1081 assert((getType()->isFloatingPoint() || (isa<PackedType>(getType()) &&
1082 cast<PackedType>(getType())->getElementType()->isFloatingPoint()))
1083 && "Incorrect operand type (not floating point) for FREM");
1087 assert(getType() == LHS->getType() &&
1088 "Logical operation should return same type as operands!");
1089 assert((getType()->isInteger() ||
1090 (isa<PackedType>(getType()) &&
1091 cast<PackedType>(getType())->getElementType()->isInteger())) &&
1092 "Tried to create a logical operation on a non-integral type!");
1100 BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
1101 const std::string &Name,
1102 Instruction *InsertBefore) {
1103 assert(S1->getType() == S2->getType() &&
1104 "Cannot create binary operator with two operands of differing type!");
1105 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1108 BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
1109 const std::string &Name,
1110 BasicBlock *InsertAtEnd) {
1111 BinaryOperator *Res = create(Op, S1, S2, Name);
1112 InsertAtEnd->getInstList().push_back(Res);
1116 BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
1117 Instruction *InsertBefore) {
1118 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1119 return new BinaryOperator(Instruction::Sub,
1121 Op->getType(), Name, InsertBefore);
1124 BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
1125 BasicBlock *InsertAtEnd) {
1126 Value *zero = ConstantExpr::getZeroValueForNegationExpr(Op->getType());
1127 return new BinaryOperator(Instruction::Sub,
1129 Op->getType(), Name, InsertAtEnd);
1132 BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
1133 Instruction *InsertBefore) {
1135 if (const PackedType *PTy = dyn_cast<PackedType>(Op->getType())) {
1136 C = ConstantInt::getAllOnesValue(PTy->getElementType());
1137 C = ConstantPacked::get(std::vector<Constant*>(PTy->getNumElements(), C));
1139 C = ConstantInt::getAllOnesValue(Op->getType());
1142 return new BinaryOperator(Instruction::Xor, Op, C,
1143 Op->getType(), Name, InsertBefore);
1146 BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
1147 BasicBlock *InsertAtEnd) {
1149 if (const PackedType *PTy = dyn_cast<PackedType>(Op->getType())) {
1150 // Create a vector of all ones values.
1151 Constant *Elt = ConstantInt::getAllOnesValue(PTy->getElementType());
1153 ConstantPacked::get(std::vector<Constant*>(PTy->getNumElements(), Elt));
1155 AllOnes = ConstantInt::getAllOnesValue(Op->getType());
1158 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1159 Op->getType(), Name, InsertAtEnd);
1163 // isConstantAllOnes - Helper function for several functions below
1164 static inline bool isConstantAllOnes(const Value *V) {
1165 return isa<ConstantInt>(V) &&cast<ConstantInt>(V)->isAllOnesValue();
1168 bool BinaryOperator::isNeg(const Value *V) {
1169 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1170 if (Bop->getOpcode() == Instruction::Sub)
1171 return Bop->getOperand(0) ==
1172 ConstantExpr::getZeroValueForNegationExpr(Bop->getType());
1176 bool BinaryOperator::isNot(const Value *V) {
1177 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1178 return (Bop->getOpcode() == Instruction::Xor &&
1179 (isConstantAllOnes(Bop->getOperand(1)) ||
1180 isConstantAllOnes(Bop->getOperand(0))));
1184 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1185 assert(isNeg(BinOp) && "getNegArgument from non-'neg' instruction!");
1186 return cast<BinaryOperator>(BinOp)->getOperand(1);
1189 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1190 return getNegArgument(const_cast<Value*>(BinOp));
1193 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1194 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1195 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1196 Value *Op0 = BO->getOperand(0);
1197 Value *Op1 = BO->getOperand(1);
1198 if (isConstantAllOnes(Op0)) return Op1;
1200 assert(isConstantAllOnes(Op1));
1204 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1205 return getNotArgument(const_cast<Value*>(BinOp));
1209 // swapOperands - Exchange the two operands to this instruction. This
1210 // instruction is safe to use on any binary instruction and does not
1211 // modify the semantics of the instruction. If the instruction is
1212 // order dependent (SetLT f.e.) the opcode is changed.
1214 bool BinaryOperator::swapOperands() {
1215 if (!isCommutative())
1216 return true; // Can't commute operands
1217 std::swap(Ops[0], Ops[1]);
1221 //===----------------------------------------------------------------------===//
1223 //===----------------------------------------------------------------------===//
1225 // Just determine if this cast only deals with integral->integral conversion.
1226 bool CastInst::isIntegerCast() const {
1227 switch (getOpcode()) {
1228 default: return false;
1229 case Instruction::ZExt:
1230 case Instruction::SExt:
1231 case Instruction::Trunc:
1233 case Instruction::BitCast:
1234 return getOperand(0)->getType()->isInteger() && getType()->isInteger();
1238 bool CastInst::isLosslessCast() const {
1239 // Only BitCast can be lossless, exit fast if we're not BitCast
1240 if (getOpcode() != Instruction::BitCast)
1243 // Identity cast is always lossless
1244 const Type* SrcTy = getOperand(0)->getType();
1245 const Type* DstTy = getType();
1249 // Pointer to pointer is always lossless.
1250 if (isa<PointerType>(SrcTy))
1251 return isa<PointerType>(DstTy);
1252 return false; // Other types have no identity values
1255 /// This function determines if the CastInst does not require any bits to be
1256 /// changed in order to effect the cast. Essentially, it identifies cases where
1257 /// no code gen is necessary for the cast, hence the name no-op cast. For
1258 /// example, the following are all no-op casts:
1259 /// # bitcast uint %X, int
1260 /// # bitcast uint* %x, sbyte*
1261 /// # bitcast packed< 2 x int > %x, packed< 4 x short>
1262 /// # ptrtoint uint* %x, uint ; on 32-bit plaforms only
1263 /// @brief Determine if a cast is a no-op.
1264 bool CastInst::isNoopCast(const Type *IntPtrTy) const {
1265 switch (getOpcode()) {
1267 assert(!"Invalid CastOp");
1268 case Instruction::Trunc:
1269 case Instruction::ZExt:
1270 case Instruction::SExt:
1271 case Instruction::FPTrunc:
1272 case Instruction::FPExt:
1273 case Instruction::UIToFP:
1274 case Instruction::SIToFP:
1275 case Instruction::FPToUI:
1276 case Instruction::FPToSI:
1277 return false; // These always modify bits
1278 case Instruction::BitCast:
1279 return true; // BitCast never modifies bits.
1280 case Instruction::PtrToInt:
1281 return IntPtrTy->getPrimitiveSizeInBits() ==
1282 getType()->getPrimitiveSizeInBits();
1283 case Instruction::IntToPtr:
1284 return IntPtrTy->getPrimitiveSizeInBits() ==
1285 getOperand(0)->getType()->getPrimitiveSizeInBits();
1289 /// This function determines if a pair of casts can be eliminated and what
1290 /// opcode should be used in the elimination. This assumes that there are two
1291 /// instructions like this:
1292 /// * %F = firstOpcode SrcTy %x to MidTy
1293 /// * %S = secondOpcode MidTy %F to DstTy
1294 /// The function returns a resultOpcode so these two casts can be replaced with:
1295 /// * %Replacement = resultOpcode %SrcTy %x to DstTy
1296 /// If no such cast is permited, the function returns 0.
1297 unsigned CastInst::isEliminableCastPair(
1298 Instruction::CastOps firstOp, Instruction::CastOps secondOp,
1299 const Type *SrcTy, const Type *MidTy, const Type *DstTy, const Type *IntPtrTy)
1301 // Define the 144 possibilities for these two cast instructions. The values
1302 // in this matrix determine what to do in a given situation and select the
1303 // case in the switch below. The rows correspond to firstOp, the columns
1304 // correspond to secondOp. In looking at the table below, keep in mind
1305 // the following cast properties:
1307 // Size Compare Source Destination
1308 // Operator Src ? Size Type Sign Type Sign
1309 // -------- ------------ ------------------- ---------------------
1310 // TRUNC > Integer Any Integral Any
1311 // ZEXT < Integral Unsigned Integer Any
1312 // SEXT < Integral Signed Integer Any
1313 // FPTOUI n/a FloatPt n/a Integral Unsigned
1314 // FPTOSI n/a FloatPt n/a Integral Signed
1315 // UITOFP n/a Integral Unsigned FloatPt n/a
1316 // SITOFP n/a Integral Signed FloatPt n/a
1317 // FPTRUNC > FloatPt n/a FloatPt n/a
1318 // FPEXT < FloatPt n/a FloatPt n/a
1319 // PTRTOINT n/a Pointer n/a Integral Unsigned
1320 // INTTOPTR n/a Integral Unsigned Pointer n/a
1321 // BITCONVERT = FirstClass n/a FirstClass n/a
1323 // NOTE: some transforms are safe, but we consider them to be non-profitable.
1324 // For example, we could merge "fptoui double to uint" + "zext uint to ulong",
1325 // into "fptoui double to ulong", but this loses information about the range
1326 // of the produced value (we no longer know the top-part is all zeros).
1327 // Further this conversion is often much more expensive for typical hardware,
1328 // and causes issues when building libgcc. We disallow fptosi+sext for the
1330 const unsigned numCastOps =
1331 Instruction::CastOpsEnd - Instruction::CastOpsBegin;
1332 static const uint8_t CastResults[numCastOps][numCastOps] = {
1333 // T F F U S F F P I B -+
1334 // R Z S P P I I T P 2 N T |
1335 // U E E 2 2 2 2 R E I T C +- secondOp
1336 // N X X U S F F N X N 2 V |
1337 // C T T I I P P C T T P T -+
1338 { 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
1339 { 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
1340 { 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
1341 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
1342 { 0, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
1343 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
1344 { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
1345 { 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
1346 { 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
1347 { 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
1348 { 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
1349 { 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
1352 int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
1353 [secondOp-Instruction::CastOpsBegin];
1356 // categorically disallowed
1359 // allowed, use first cast's opcode
1362 // allowed, use second cast's opcode
1365 // no-op cast in second op implies firstOp as long as the DestTy
1367 if (DstTy->isInteger())
1371 // no-op cast in second op implies firstOp as long as the DestTy
1372 // is floating point
1373 if (DstTy->isFloatingPoint())
1377 // no-op cast in first op implies secondOp as long as the SrcTy
1379 if (SrcTy->isInteger())
1383 // no-op cast in first op implies secondOp as long as the SrcTy
1384 // is a floating point
1385 if (SrcTy->isFloatingPoint())
1389 // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size
1390 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1391 unsigned MidSize = MidTy->getPrimitiveSizeInBits();
1392 if (MidSize >= PtrSize)
1393 return Instruction::BitCast;
1397 // ext, trunc -> bitcast, if the SrcTy and DstTy are same size
1398 // ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
1399 // ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
1400 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1401 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1402 if (SrcSize == DstSize)
1403 return Instruction::BitCast;
1404 else if (SrcSize < DstSize)
1408 case 9: // zext, sext -> zext, because sext can't sign extend after zext
1409 return Instruction::ZExt;
1411 // fpext followed by ftrunc is allowed if the bit size returned to is
1412 // the same as the original, in which case its just a bitcast
1414 return Instruction::BitCast;
1415 return 0; // If the types are not the same we can't eliminate it.
1417 // bitcast followed by ptrtoint is allowed as long as the bitcast
1418 // is a pointer to pointer cast.
1419 if (isa<PointerType>(SrcTy) && isa<PointerType>(MidTy))
1423 // inttoptr, bitcast -> intptr if bitcast is a ptr to ptr cast
1424 if (isa<PointerType>(MidTy) && isa<PointerType>(DstTy))
1428 // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
1429 unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
1430 unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
1431 unsigned DstSize = DstTy->getPrimitiveSizeInBits();
1432 if (SrcSize <= PtrSize && SrcSize == DstSize)
1433 return Instruction::BitCast;
1437 // cast combination can't happen (error in input). This is for all cases
1438 // where the MidTy is not the same for the two cast instructions.
1439 assert(!"Invalid Cast Combination");
1442 assert(!"Error in CastResults table!!!");
1448 CastInst *CastInst::create(Instruction::CastOps op, Value *S, const Type *Ty,
1449 const std::string &Name, Instruction *InsertBefore) {
1450 // Construct and return the appropriate CastInst subclass
1452 case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
1453 case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
1454 case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
1455 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
1456 case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
1457 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
1458 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
1459 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
1460 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
1461 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
1462 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
1463 case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
1465 assert(!"Invalid opcode provided");
1470 CastInst *CastInst::create(Instruction::CastOps op, Value *S, const Type *Ty,
1471 const std::string &Name, BasicBlock *InsertAtEnd) {
1472 // Construct and return the appropriate CastInst subclass
1474 case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
1475 case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
1476 case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
1477 case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
1478 case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
1479 case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
1480 case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
1481 case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
1482 case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
1483 case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
1484 case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
1485 case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
1487 assert(!"Invalid opcode provided");
1492 CastInst *CastInst::createZExtOrBitCast(Value *S, const Type *Ty,
1493 const std::string &Name,
1494 Instruction *InsertBefore) {
1495 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1496 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1497 return create(Instruction::ZExt, S, Ty, Name, InsertBefore);
1500 CastInst *CastInst::createZExtOrBitCast(Value *S, const Type *Ty,
1501 const std::string &Name,
1502 BasicBlock *InsertAtEnd) {
1503 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1504 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1505 return create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
1508 CastInst *CastInst::createSExtOrBitCast(Value *S, const Type *Ty,
1509 const std::string &Name,
1510 Instruction *InsertBefore) {
1511 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1512 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1513 return create(Instruction::SExt, S, Ty, Name, InsertBefore);
1516 CastInst *CastInst::createSExtOrBitCast(Value *S, const Type *Ty,
1517 const std::string &Name,
1518 BasicBlock *InsertAtEnd) {
1519 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1520 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1521 return create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
1524 CastInst *CastInst::createTruncOrBitCast(Value *S, const Type *Ty,
1525 const std::string &Name,
1526 Instruction *InsertBefore) {
1527 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1528 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1529 return create(Instruction::Trunc, S, Ty, Name, InsertBefore);
1532 CastInst *CastInst::createTruncOrBitCast(Value *S, const Type *Ty,
1533 const std::string &Name,
1534 BasicBlock *InsertAtEnd) {
1535 if (S->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1536 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1537 return create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
1540 CastInst *CastInst::createPointerCast(Value *S, const Type *Ty,
1541 const std::string &Name,
1542 BasicBlock *InsertAtEnd) {
1543 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1544 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
1547 if (Ty->isInteger())
1548 return create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);
1549 return create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
1552 /// @brief Create a BitCast or a PtrToInt cast instruction
1553 CastInst *CastInst::createPointerCast(Value *S, const Type *Ty,
1554 const std::string &Name,
1555 Instruction *InsertBefore) {
1556 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1557 assert((Ty->isInteger() || isa<PointerType>(Ty)) &&
1560 if (Ty->isInteger())
1561 return create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
1562 return create(Instruction::BitCast, S, Ty, Name, InsertBefore);
1565 CastInst *CastInst::createIntegerCast(Value *C, const Type *Ty,
1566 bool isSigned, const std::string &Name,
1567 Instruction *InsertBefore) {
1568 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1569 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1570 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1571 Instruction::CastOps opcode =
1572 (SrcBits == DstBits ? Instruction::BitCast :
1573 (SrcBits > DstBits ? Instruction::Trunc :
1574 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1575 return create(opcode, C, Ty, Name, InsertBefore);
1578 CastInst *CastInst::createIntegerCast(Value *C, const Type *Ty,
1579 bool isSigned, const std::string &Name,
1580 BasicBlock *InsertAtEnd) {
1581 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1582 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1583 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1584 Instruction::CastOps opcode =
1585 (SrcBits == DstBits ? Instruction::BitCast :
1586 (SrcBits > DstBits ? Instruction::Trunc :
1587 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1588 return create(opcode, C, Ty, Name, InsertAtEnd);
1591 CastInst *CastInst::createFPCast(Value *C, const Type *Ty,
1592 const std::string &Name,
1593 Instruction *InsertBefore) {
1594 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1596 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1597 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1598 Instruction::CastOps opcode =
1599 (SrcBits == DstBits ? Instruction::BitCast :
1600 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
1601 return create(opcode, C, Ty, Name, InsertBefore);
1604 CastInst *CastInst::createFPCast(Value *C, const Type *Ty,
1605 const std::string &Name,
1606 BasicBlock *InsertAtEnd) {
1607 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1609 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1610 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1611 Instruction::CastOps opcode =
1612 (SrcBits == DstBits ? Instruction::BitCast :
1613 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
1614 return create(opcode, C, Ty, Name, InsertAtEnd);
1617 // Provide a way to get a "cast" where the cast opcode is inferred from the
1618 // types and size of the operand. This, basically, is a parallel of the
1619 // logic in the castIsValid function below. This axiom should hold:
1620 // castIsValid( getCastOpcode(Val, Ty), Val, Ty)
1621 // should not assert in castIsValid. In other words, this produces a "correct"
1622 // casting opcode for the arguments passed to it.
1623 Instruction::CastOps
1624 CastInst::getCastOpcode(
1625 const Value *Src, bool SrcIsSigned, const Type *DestTy, bool DestIsSigned) {
1626 // Get the bit sizes, we'll need these
1627 const Type *SrcTy = Src->getType();
1628 unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/packed
1629 unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/packed
1631 // Run through the possibilities ...
1632 if (DestTy->isInteger()) { // Casting to integral
1633 if (SrcTy->isInteger()) { // Casting from integral
1634 if (DestBits < SrcBits)
1635 return Trunc; // int -> smaller int
1636 else if (DestBits > SrcBits) { // its an extension
1638 return SExt; // signed -> SEXT
1640 return ZExt; // unsigned -> ZEXT
1642 return BitCast; // Same size, No-op cast
1644 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
1646 return FPToSI; // FP -> sint
1648 return FPToUI; // FP -> uint
1649 } else if (const PackedType *PTy = dyn_cast<PackedType>(SrcTy)) {
1650 assert(DestBits == PTy->getBitWidth() &&
1651 "Casting packed to integer of different width");
1652 return BitCast; // Same size, no-op cast
1654 assert(isa<PointerType>(SrcTy) &&
1655 "Casting from a value that is not first-class type");
1656 return PtrToInt; // ptr -> int
1658 } else if (DestTy->isFloatingPoint()) { // Casting to floating pt
1659 if (SrcTy->isInteger()) { // Casting from integral
1661 return SIToFP; // sint -> FP
1663 return UIToFP; // uint -> FP
1664 } else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
1665 if (DestBits < SrcBits) {
1666 return FPTrunc; // FP -> smaller FP
1667 } else if (DestBits > SrcBits) {
1668 return FPExt; // FP -> larger FP
1670 return BitCast; // same size, no-op cast
1672 } else if (const PackedType *PTy = dyn_cast<PackedType>(SrcTy)) {
1673 assert(DestBits == PTy->getBitWidth() &&
1674 "Casting packed to floating point of different width");
1675 return BitCast; // same size, no-op cast
1677 assert(0 && "Casting pointer or non-first class to float");
1679 } else if (const PackedType *DestPTy = dyn_cast<PackedType>(DestTy)) {
1680 if (const PackedType *SrcPTy = dyn_cast<PackedType>(SrcTy)) {
1681 assert(DestPTy->getBitWidth() == SrcPTy->getBitWidth() &&
1682 "Casting packed to packed of different widths");
1683 return BitCast; // packed -> packed
1684 } else if (DestPTy->getBitWidth() == SrcBits) {
1685 return BitCast; // float/int -> packed
1687 assert(!"Illegal cast to packed (wrong type or size)");
1689 } else if (isa<PointerType>(DestTy)) {
1690 if (isa<PointerType>(SrcTy)) {
1691 return BitCast; // ptr -> ptr
1692 } else if (SrcTy->isInteger()) {
1693 return IntToPtr; // int -> ptr
1695 assert(!"Casting pointer to other than pointer or int");
1698 assert(!"Casting to type that is not first-class");
1701 // If we fall through to here we probably hit an assertion cast above
1702 // and assertions are not turned on. Anything we return is an error, so
1703 // BitCast is as good a choice as any.
1707 //===----------------------------------------------------------------------===//
1708 // CastInst SubClass Constructors
1709 //===----------------------------------------------------------------------===//
1711 /// Check that the construction parameters for a CastInst are correct. This
1712 /// could be broken out into the separate constructors but it is useful to have
1713 /// it in one place and to eliminate the redundant code for getting the sizes
1714 /// of the types involved.
1716 CastInst::castIsValid(Instruction::CastOps op, Value *S, const Type *DstTy) {
1718 // Check for type sanity on the arguments
1719 const Type *SrcTy = S->getType();
1720 if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType())
1723 // Get the size of the types in bits, we'll need this later
1724 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1725 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
1727 // Switch on the opcode provided
1729 default: return false; // This is an input error
1730 case Instruction::Trunc:
1731 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize > DstBitSize;
1732 case Instruction::ZExt:
1733 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize < DstBitSize;
1734 case Instruction::SExt:
1735 return SrcTy->isInteger() && DstTy->isInteger()&& SrcBitSize < DstBitSize;
1736 case Instruction::FPTrunc:
1737 return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
1738 SrcBitSize > DstBitSize;
1739 case Instruction::FPExt:
1740 return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
1741 SrcBitSize < DstBitSize;
1742 case Instruction::UIToFP:
1743 return SrcTy->isInteger() && DstTy->isFloatingPoint();
1744 case Instruction::SIToFP:
1745 return SrcTy->isInteger() && DstTy->isFloatingPoint();
1746 case Instruction::FPToUI:
1747 return SrcTy->isFloatingPoint() && DstTy->isInteger();
1748 case Instruction::FPToSI:
1749 return SrcTy->isFloatingPoint() && DstTy->isInteger();
1750 case Instruction::PtrToInt:
1751 return isa<PointerType>(SrcTy) && DstTy->isInteger();
1752 case Instruction::IntToPtr:
1753 return SrcTy->isInteger() && isa<PointerType>(DstTy);
1754 case Instruction::BitCast:
1755 // BitCast implies a no-op cast of type only. No bits change.
1756 // However, you can't cast pointers to anything but pointers.
1757 if (isa<PointerType>(SrcTy) != isa<PointerType>(DstTy))
1760 // Now we know we're not dealing with a pointer/non-poiner mismatch. In all
1761 // these cases, the cast is okay if the source and destination bit widths
1763 return SrcBitSize == DstBitSize;
1767 TruncInst::TruncInst(
1768 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1769 ) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
1770 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
1773 TruncInst::TruncInst(
1774 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1775 ) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
1776 assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc");
1780 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1781 ) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
1782 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
1786 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1787 ) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
1788 assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt");
1791 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1792 ) : CastInst(Ty, SExt, S, Name, InsertBefore) {
1793 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
1797 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1798 ) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
1799 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt");
1802 FPTruncInst::FPTruncInst(
1803 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1804 ) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
1805 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
1808 FPTruncInst::FPTruncInst(
1809 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1810 ) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
1811 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc");
1814 FPExtInst::FPExtInst(
1815 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1816 ) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
1817 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
1820 FPExtInst::FPExtInst(
1821 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1822 ) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
1823 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt");
1826 UIToFPInst::UIToFPInst(
1827 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1828 ) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
1829 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
1832 UIToFPInst::UIToFPInst(
1833 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1834 ) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
1835 assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP");
1838 SIToFPInst::SIToFPInst(
1839 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1840 ) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
1841 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
1844 SIToFPInst::SIToFPInst(
1845 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1846 ) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
1847 assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP");
1850 FPToUIInst::FPToUIInst(
1851 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1852 ) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
1853 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
1856 FPToUIInst::FPToUIInst(
1857 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1858 ) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
1859 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI");
1862 FPToSIInst::FPToSIInst(
1863 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1864 ) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
1865 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
1868 FPToSIInst::FPToSIInst(
1869 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1870 ) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
1871 assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI");
1874 PtrToIntInst::PtrToIntInst(
1875 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1876 ) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
1877 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
1880 PtrToIntInst::PtrToIntInst(
1881 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1882 ) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
1883 assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt");
1886 IntToPtrInst::IntToPtrInst(
1887 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1888 ) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
1889 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
1892 IntToPtrInst::IntToPtrInst(
1893 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1894 ) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
1895 assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr");
1898 BitCastInst::BitCastInst(
1899 Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
1900 ) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
1901 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
1904 BitCastInst::BitCastInst(
1905 Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
1906 ) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
1907 assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast");
1910 //===----------------------------------------------------------------------===//
1912 //===----------------------------------------------------------------------===//
1914 CmpInst::CmpInst(OtherOps op, unsigned short predicate, Value *LHS, Value *RHS,
1915 const std::string &Name, Instruction *InsertBefore)
1916 : Instruction(Type::Int1Ty, op, Ops, 2, Name, InsertBefore) {
1917 Ops[0].init(LHS, this);
1918 Ops[1].init(RHS, this);
1919 SubclassData = predicate;
1920 if (op == Instruction::ICmp) {
1921 assert(predicate >= ICmpInst::FIRST_ICMP_PREDICATE &&
1922 predicate <= ICmpInst::LAST_ICMP_PREDICATE &&
1923 "Invalid ICmp predicate value");
1924 const Type* Op0Ty = getOperand(0)->getType();
1925 const Type* Op1Ty = getOperand(1)->getType();
1926 assert(Op0Ty == Op1Ty &&
1927 "Both operands to ICmp instruction are not of the same type!");
1928 // Check that the operands are the right type
1929 assert((Op0Ty->isInteger() || isa<PointerType>(Op0Ty)) &&
1930 "Invalid operand types for ICmp instruction");
1933 assert(op == Instruction::FCmp && "Invalid CmpInst opcode");
1934 assert(predicate <= FCmpInst::LAST_FCMP_PREDICATE &&
1935 "Invalid FCmp predicate value");
1936 const Type* Op0Ty = getOperand(0)->getType();
1937 const Type* Op1Ty = getOperand(1)->getType();
1938 assert(Op0Ty == Op1Ty &&
1939 "Both operands to FCmp instruction are not of the same type!");
1940 // Check that the operands are the right type
1941 assert(Op0Ty->isFloatingPoint() &&
1942 "Invalid operand types for FCmp instruction");
1945 CmpInst::CmpInst(OtherOps op, unsigned short predicate, Value *LHS, Value *RHS,
1946 const std::string &Name, BasicBlock *InsertAtEnd)
1947 : Instruction(Type::Int1Ty, op, Ops, 2, Name, InsertAtEnd) {
1948 Ops[0].init(LHS, this);
1949 Ops[1].init(RHS, this);
1950 SubclassData = predicate;
1951 if (op == Instruction::ICmp) {
1952 assert(predicate >= ICmpInst::FIRST_ICMP_PREDICATE &&
1953 predicate <= ICmpInst::LAST_ICMP_PREDICATE &&
1954 "Invalid ICmp predicate value");
1956 const Type* Op0Ty = getOperand(0)->getType();
1957 const Type* Op1Ty = getOperand(1)->getType();
1958 assert(Op0Ty == Op1Ty &&
1959 "Both operands to ICmp instruction are not of the same type!");
1960 // Check that the operands are the right type
1961 assert(Op0Ty->isInteger() || isa<PointerType>(Op0Ty) &&
1962 "Invalid operand types for ICmp instruction");
1965 assert(op == Instruction::FCmp && "Invalid CmpInst opcode");
1966 assert(predicate <= FCmpInst::LAST_FCMP_PREDICATE &&
1967 "Invalid FCmp predicate value");
1968 const Type* Op0Ty = getOperand(0)->getType();
1969 const Type* Op1Ty = getOperand(1)->getType();
1970 assert(Op0Ty == Op1Ty &&
1971 "Both operands to FCmp instruction are not of the same type!");
1972 // Check that the operands are the right type
1973 assert(Op0Ty->isFloatingPoint() &&
1974 "Invalid operand types for FCmp instruction");
1978 CmpInst::create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
1979 const std::string &Name, Instruction *InsertBefore) {
1980 if (Op == Instruction::ICmp) {
1981 return new ICmpInst(ICmpInst::Predicate(predicate), S1, S2, Name,
1984 return new FCmpInst(FCmpInst::Predicate(predicate), S1, S2, Name,
1989 CmpInst::create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
1990 const std::string &Name, BasicBlock *InsertAtEnd) {
1991 if (Op == Instruction::ICmp) {
1992 return new ICmpInst(ICmpInst::Predicate(predicate), S1, S2, Name,
1995 return new FCmpInst(FCmpInst::Predicate(predicate), S1, S2, Name,
1999 void CmpInst::swapOperands() {
2000 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2003 cast<FCmpInst>(this)->swapOperands();
2006 bool CmpInst::isCommutative() {
2007 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2008 return IC->isCommutative();
2009 return cast<FCmpInst>(this)->isCommutative();
2012 bool CmpInst::isEquality() {
2013 if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
2014 return IC->isEquality();
2015 return cast<FCmpInst>(this)->isEquality();
2019 ICmpInst::Predicate ICmpInst::getInversePredicate(Predicate pred) {
2022 assert(!"Unknown icmp predicate!");
2023 case ICMP_EQ: return ICMP_NE;
2024 case ICMP_NE: return ICMP_EQ;
2025 case ICMP_UGT: return ICMP_ULE;
2026 case ICMP_ULT: return ICMP_UGE;
2027 case ICMP_UGE: return ICMP_ULT;
2028 case ICMP_ULE: return ICMP_UGT;
2029 case ICMP_SGT: return ICMP_SLE;
2030 case ICMP_SLT: return ICMP_SGE;
2031 case ICMP_SGE: return ICMP_SLT;
2032 case ICMP_SLE: return ICMP_SGT;
2036 ICmpInst::Predicate ICmpInst::getSwappedPredicate(Predicate pred) {
2038 default: assert(! "Unknown icmp predicate!");
2039 case ICMP_EQ: case ICMP_NE:
2041 case ICMP_SGT: return ICMP_SLT;
2042 case ICMP_SLT: return ICMP_SGT;
2043 case ICMP_SGE: return ICMP_SLE;
2044 case ICMP_SLE: return ICMP_SGE;
2045 case ICMP_UGT: return ICMP_ULT;
2046 case ICMP_ULT: return ICMP_UGT;
2047 case ICMP_UGE: return ICMP_ULE;
2048 case ICMP_ULE: return ICMP_UGE;
2052 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
2054 default: assert(! "Unknown icmp predicate!");
2055 case ICMP_EQ: case ICMP_NE:
2056 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2058 case ICMP_UGT: return ICMP_SGT;
2059 case ICMP_ULT: return ICMP_SLT;
2060 case ICMP_UGE: return ICMP_SGE;
2061 case ICMP_ULE: return ICMP_SLE;
2065 bool ICmpInst::isSignedPredicate(Predicate pred) {
2067 default: assert(! "Unknown icmp predicate!");
2068 case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
2070 case ICMP_EQ: case ICMP_NE: case ICMP_UGT: case ICMP_ULT:
2071 case ICMP_UGE: case ICMP_ULE:
2076 FCmpInst::Predicate FCmpInst::getInversePredicate(Predicate pred) {
2079 assert(!"Unknown icmp predicate!");
2080 case FCMP_OEQ: return FCMP_UNE;
2081 case FCMP_ONE: return FCMP_UEQ;
2082 case FCMP_OGT: return FCMP_ULE;
2083 case FCMP_OLT: return FCMP_UGE;
2084 case FCMP_OGE: return FCMP_ULT;
2085 case FCMP_OLE: return FCMP_UGT;
2086 case FCMP_UEQ: return FCMP_ONE;
2087 case FCMP_UNE: return FCMP_OEQ;
2088 case FCMP_UGT: return FCMP_OLE;
2089 case FCMP_ULT: return FCMP_OGE;
2090 case FCMP_UGE: return FCMP_OLT;
2091 case FCMP_ULE: return FCMP_OGT;
2092 case FCMP_ORD: return FCMP_UNO;
2093 case FCMP_UNO: return FCMP_ORD;
2094 case FCMP_TRUE: return FCMP_FALSE;
2095 case FCMP_FALSE: return FCMP_TRUE;
2099 FCmpInst::Predicate FCmpInst::getSwappedPredicate(Predicate pred) {
2101 default: assert(!"Unknown fcmp predicate!");
2102 case FCMP_FALSE: case FCMP_TRUE:
2103 case FCMP_OEQ: case FCMP_ONE:
2104 case FCMP_UEQ: case FCMP_UNE:
2105 case FCMP_ORD: case FCMP_UNO:
2107 case FCMP_OGT: return FCMP_OLT;
2108 case FCMP_OLT: return FCMP_OGT;
2109 case FCMP_OGE: return FCMP_OLE;
2110 case FCMP_OLE: return FCMP_OGE;
2111 case FCMP_UGT: return FCMP_ULT;
2112 case FCMP_ULT: return FCMP_UGT;
2113 case FCMP_UGE: return FCMP_ULE;
2114 case FCMP_ULE: return FCMP_UGE;
2118 bool CmpInst::isUnsigned(unsigned short predicate) {
2119 switch (predicate) {
2120 default: return false;
2121 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
2122 case ICmpInst::ICMP_UGE: return true;
2126 bool CmpInst::isSigned(unsigned short predicate){
2127 switch (predicate) {
2128 default: return false;
2129 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
2130 case ICmpInst::ICMP_SGE: return true;
2134 bool CmpInst::isOrdered(unsigned short predicate) {
2135 switch (predicate) {
2136 default: return false;
2137 case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
2138 case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
2139 case FCmpInst::FCMP_ORD: return true;
2143 bool CmpInst::isUnordered(unsigned short predicate) {
2144 switch (predicate) {
2145 default: return false;
2146 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
2147 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
2148 case FCmpInst::FCMP_UNO: return true;
2152 //===----------------------------------------------------------------------===//
2153 // SwitchInst Implementation
2154 //===----------------------------------------------------------------------===//
2156 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumCases) {
2157 assert(Value && Default);
2158 ReservedSpace = 2+NumCases*2;
2160 OperandList = new Use[ReservedSpace];
2162 OperandList[0].init(Value, this);
2163 OperandList[1].init(Default, this);
2166 SwitchInst::SwitchInst(const SwitchInst &SI)
2167 : TerminatorInst(Instruction::Switch, new Use[SI.getNumOperands()],
2168 SI.getNumOperands()) {
2169 Use *OL = OperandList, *InOL = SI.OperandList;
2170 for (unsigned i = 0, E = SI.getNumOperands(); i != E; i+=2) {
2171 OL[i].init(InOL[i], this);
2172 OL[i+1].init(InOL[i+1], this);
2176 SwitchInst::~SwitchInst() {
2177 delete [] OperandList;
2181 /// addCase - Add an entry to the switch instruction...
2183 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
2184 unsigned OpNo = NumOperands;
2185 if (OpNo+2 > ReservedSpace)
2186 resizeOperands(0); // Get more space!
2187 // Initialize some new operands.
2188 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
2189 NumOperands = OpNo+2;
2190 OperandList[OpNo].init(OnVal, this);
2191 OperandList[OpNo+1].init(Dest, this);
2194 /// removeCase - This method removes the specified successor from the switch
2195 /// instruction. Note that this cannot be used to remove the default
2196 /// destination (successor #0).
2198 void SwitchInst::removeCase(unsigned idx) {
2199 assert(idx != 0 && "Cannot remove the default case!");
2200 assert(idx*2 < getNumOperands() && "Successor index out of range!!!");
2202 unsigned NumOps = getNumOperands();
2203 Use *OL = OperandList;
2205 // Move everything after this operand down.
2207 // FIXME: we could just swap with the end of the list, then erase. However,
2208 // client might not expect this to happen. The code as it is thrashes the
2209 // use/def lists, which is kinda lame.
2210 for (unsigned i = (idx+1)*2; i != NumOps; i += 2) {
2212 OL[i-2+1] = OL[i+1];
2215 // Nuke the last value.
2216 OL[NumOps-2].set(0);
2217 OL[NumOps-2+1].set(0);
2218 NumOperands = NumOps-2;
2221 /// resizeOperands - resize operands - This adjusts the length of the operands
2222 /// list according to the following behavior:
2223 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
2224 /// of operation. This grows the number of ops by 1.5 times.
2225 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
2226 /// 3. If NumOps == NumOperands, trim the reserved space.
2228 void SwitchInst::resizeOperands(unsigned NumOps) {
2230 NumOps = getNumOperands()/2*6;
2231 } else if (NumOps*2 > NumOperands) {
2232 // No resize needed.
2233 if (ReservedSpace >= NumOps) return;
2234 } else if (NumOps == NumOperands) {
2235 if (ReservedSpace == NumOps) return;
2240 ReservedSpace = NumOps;
2241 Use *NewOps = new Use[NumOps];
2242 Use *OldOps = OperandList;
2243 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2244 NewOps[i].init(OldOps[i], this);
2248 OperandList = NewOps;
2252 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
2253 return getSuccessor(idx);
2255 unsigned SwitchInst::getNumSuccessorsV() const {
2256 return getNumSuccessors();
2258 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
2259 setSuccessor(idx, B);
2263 // Define these methods here so vtables don't get emitted into every translation
2264 // unit that uses these classes.
2266 GetElementPtrInst *GetElementPtrInst::clone() const {
2267 return new GetElementPtrInst(*this);
2270 BinaryOperator *BinaryOperator::clone() const {
2271 return create(getOpcode(), Ops[0], Ops[1]);
2274 CmpInst* CmpInst::clone() const {
2275 return create(getOpcode(), getPredicate(), Ops[0], Ops[1]);
2278 MallocInst *MallocInst::clone() const { return new MallocInst(*this); }
2279 AllocaInst *AllocaInst::clone() const { return new AllocaInst(*this); }
2280 FreeInst *FreeInst::clone() const { return new FreeInst(getOperand(0)); }
2281 LoadInst *LoadInst::clone() const { return new LoadInst(*this); }
2282 StoreInst *StoreInst::clone() const { return new StoreInst(*this); }
2283 CastInst *TruncInst::clone() const { return new TruncInst(*this); }
2284 CastInst *ZExtInst::clone() const { return new ZExtInst(*this); }
2285 CastInst *SExtInst::clone() const { return new SExtInst(*this); }
2286 CastInst *FPTruncInst::clone() const { return new FPTruncInst(*this); }
2287 CastInst *FPExtInst::clone() const { return new FPExtInst(*this); }
2288 CastInst *UIToFPInst::clone() const { return new UIToFPInst(*this); }
2289 CastInst *SIToFPInst::clone() const { return new SIToFPInst(*this); }
2290 CastInst *FPToUIInst::clone() const { return new FPToUIInst(*this); }
2291 CastInst *FPToSIInst::clone() const { return new FPToSIInst(*this); }
2292 CastInst *PtrToIntInst::clone() const { return new PtrToIntInst(*this); }
2293 CastInst *IntToPtrInst::clone() const { return new IntToPtrInst(*this); }
2294 CastInst *BitCastInst::clone() const { return new BitCastInst(*this); }
2295 CallInst *CallInst::clone() const { return new CallInst(*this); }
2296 ShiftInst *ShiftInst::clone() const { return new ShiftInst(*this); }
2297 SelectInst *SelectInst::clone() const { return new SelectInst(*this); }
2298 VAArgInst *VAArgInst::clone() const { return new VAArgInst(*this); }
2300 ExtractElementInst *ExtractElementInst::clone() const {
2301 return new ExtractElementInst(*this);
2303 InsertElementInst *InsertElementInst::clone() const {
2304 return new InsertElementInst(*this);
2306 ShuffleVectorInst *ShuffleVectorInst::clone() const {
2307 return new ShuffleVectorInst(*this);
2309 PHINode *PHINode::clone() const { return new PHINode(*this); }
2310 ReturnInst *ReturnInst::clone() const { return new ReturnInst(*this); }
2311 BranchInst *BranchInst::clone() const { return new BranchInst(*this); }
2312 SwitchInst *SwitchInst::clone() const { return new SwitchInst(*this); }
2313 InvokeInst *InvokeInst::clone() const { return new InvokeInst(*this); }
2314 UnwindInst *UnwindInst::clone() const { return new UnwindInst(); }
2315 UnreachableInst *UnreachableInst::clone() const { return new UnreachableInst();}