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);
37 //===----------------------------------------------------------------------===//
38 // TerminatorInst Class
39 //===----------------------------------------------------------------------===//
41 TerminatorInst::TerminatorInst(Instruction::TermOps iType,
42 Use *Ops, unsigned NumOps, Instruction *IB)
43 : Instruction(Type::VoidTy, iType, Ops, NumOps, "", IB) {
46 TerminatorInst::TerminatorInst(Instruction::TermOps iType,
47 Use *Ops, unsigned NumOps, BasicBlock *IAE)
48 : Instruction(Type::VoidTy, iType, Ops, NumOps, "", IAE) {
53 //===----------------------------------------------------------------------===//
55 //===----------------------------------------------------------------------===//
57 PHINode::PHINode(const PHINode &PN)
58 : Instruction(PN.getType(), Instruction::PHI,
59 new Use[PN.getNumOperands()], PN.getNumOperands()),
60 ReservedSpace(PN.getNumOperands()) {
61 Use *OL = OperandList;
62 for (unsigned i = 0, e = PN.getNumOperands(); i != e; i+=2) {
63 OL[i].init(PN.getOperand(i), this);
64 OL[i+1].init(PN.getOperand(i+1), this);
69 delete [] OperandList;
72 // removeIncomingValue - Remove an incoming value. This is useful if a
73 // predecessor basic block is deleted.
74 Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
75 unsigned NumOps = getNumOperands();
76 Use *OL = OperandList;
77 assert(Idx*2 < NumOps && "BB not in PHI node!");
78 Value *Removed = OL[Idx*2];
80 // Move everything after this operand down.
82 // FIXME: we could just swap with the end of the list, then erase. However,
83 // client might not expect this to happen. The code as it is thrashes the
84 // use/def lists, which is kinda lame.
85 for (unsigned i = (Idx+1)*2; i != NumOps; i += 2) {
90 // Nuke the last value.
92 OL[NumOps-2+1].set(0);
93 NumOperands = NumOps-2;
95 // If the PHI node is dead, because it has zero entries, nuke it now.
96 if (NumOps == 2 && DeletePHIIfEmpty) {
97 // If anyone is using this PHI, make them use a dummy value instead...
98 replaceAllUsesWith(UndefValue::get(getType()));
104 /// resizeOperands - resize operands - This adjusts the length of the operands
105 /// list according to the following behavior:
106 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
107 /// of operation. This grows the number of ops by 1.5 times.
108 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
109 /// 3. If NumOps == NumOperands, trim the reserved space.
111 void PHINode::resizeOperands(unsigned NumOps) {
113 NumOps = (getNumOperands())*3/2;
114 if (NumOps < 4) NumOps = 4; // 4 op PHI nodes are VERY common.
115 } else if (NumOps*2 > NumOperands) {
117 if (ReservedSpace >= NumOps) return;
118 } else if (NumOps == NumOperands) {
119 if (ReservedSpace == NumOps) return;
124 ReservedSpace = NumOps;
125 Use *NewOps = new Use[NumOps];
126 Use *OldOps = OperandList;
127 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
128 NewOps[i].init(OldOps[i], this);
132 OperandList = NewOps;
135 /// hasConstantValue - If the specified PHI node always merges together the same
136 /// value, return the value, otherwise return null.
138 Value *PHINode::hasConstantValue(bool AllowNonDominatingInstruction) const {
139 // If the PHI node only has one incoming value, eliminate the PHI node...
140 if (getNumIncomingValues() == 1)
141 if (getIncomingValue(0) != this) // not X = phi X
142 return getIncomingValue(0);
144 return UndefValue::get(getType()); // Self cycle is dead.
146 // Otherwise if all of the incoming values are the same for the PHI, replace
147 // the PHI node with the incoming value.
150 bool HasUndefInput = false;
151 for (unsigned i = 0, e = getNumIncomingValues(); i != e; ++i)
152 if (isa<UndefValue>(getIncomingValue(i)))
153 HasUndefInput = true;
154 else if (getIncomingValue(i) != this) // Not the PHI node itself...
155 if (InVal && getIncomingValue(i) != InVal)
156 return 0; // Not the same, bail out.
158 InVal = getIncomingValue(i);
160 // The only case that could cause InVal to be null is if we have a PHI node
161 // that only has entries for itself. In this case, there is no entry into the
162 // loop, so kill the PHI.
164 if (InVal == 0) InVal = UndefValue::get(getType());
166 // If we have a PHI node like phi(X, undef, X), where X is defined by some
167 // instruction, we cannot always return X as the result of the PHI node. Only
168 // do this if X is not an instruction (thus it must dominate the PHI block),
169 // or if the client is prepared to deal with this possibility.
170 if (HasUndefInput && !AllowNonDominatingInstruction)
171 if (Instruction *IV = dyn_cast<Instruction>(InVal))
172 // If it's in the entry block, it dominates everything.
173 if (IV->getParent() != &IV->getParent()->getParent()->front() ||
175 return 0; // Cannot guarantee that InVal dominates this PHINode.
177 // All of the incoming values are the same, return the value now.
182 //===----------------------------------------------------------------------===//
183 // CallInst Implementation
184 //===----------------------------------------------------------------------===//
186 CallInst::~CallInst() {
187 delete [] OperandList;
190 void CallInst::init(Value *Func, const std::vector<Value*> &Params) {
191 NumOperands = Params.size()+1;
192 Use *OL = OperandList = new Use[Params.size()+1];
193 OL[0].init(Func, this);
195 const FunctionType *FTy =
196 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
198 assert((Params.size() == FTy->getNumParams() ||
199 (FTy->isVarArg() && Params.size() > FTy->getNumParams())) &&
200 "Calling a function with bad signature!");
201 for (unsigned i = 0, e = Params.size(); i != e; ++i) {
202 assert((i >= FTy->getNumParams() ||
203 FTy->getParamType(i) == Params[i]->getType()) &&
204 "Calling a function with a bad signature!");
205 OL[i+1].init(Params[i], this);
209 void CallInst::init(Value *Func, Value *Actual1, Value *Actual2) {
211 Use *OL = OperandList = new Use[3];
212 OL[0].init(Func, this);
213 OL[1].init(Actual1, this);
214 OL[2].init(Actual2, this);
216 const FunctionType *FTy =
217 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
219 assert((FTy->getNumParams() == 2 ||
220 (FTy->isVarArg() && FTy->getNumParams() < 2)) &&
221 "Calling a function with bad signature");
222 assert((0 >= FTy->getNumParams() ||
223 FTy->getParamType(0) == Actual1->getType()) &&
224 "Calling a function with a bad signature!");
225 assert((1 >= FTy->getNumParams() ||
226 FTy->getParamType(1) == Actual2->getType()) &&
227 "Calling a function with a bad signature!");
230 void CallInst::init(Value *Func, Value *Actual) {
232 Use *OL = OperandList = new Use[2];
233 OL[0].init(Func, this);
234 OL[1].init(Actual, this);
236 const FunctionType *FTy =
237 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
239 assert((FTy->getNumParams() == 1 ||
240 (FTy->isVarArg() && FTy->getNumParams() == 0)) &&
241 "Calling a function with bad signature");
242 assert((0 == FTy->getNumParams() ||
243 FTy->getParamType(0) == Actual->getType()) &&
244 "Calling a function with a bad signature!");
247 void CallInst::init(Value *Func) {
249 Use *OL = OperandList = new Use[1];
250 OL[0].init(Func, this);
252 const FunctionType *MTy =
253 cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
255 assert(MTy->getNumParams() == 0 && "Calling a function with bad signature");
258 CallInst::CallInst(Value *Func, const std::vector<Value*> &Params,
259 const std::string &Name, Instruction *InsertBefore)
260 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
261 ->getElementType())->getReturnType(),
262 Instruction::Call, 0, 0, Name, InsertBefore) {
266 CallInst::CallInst(Value *Func, const std::vector<Value*> &Params,
267 const std::string &Name, BasicBlock *InsertAtEnd)
268 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
269 ->getElementType())->getReturnType(),
270 Instruction::Call, 0, 0, Name, InsertAtEnd) {
274 CallInst::CallInst(Value *Func, Value *Actual1, Value *Actual2,
275 const std::string &Name, Instruction *InsertBefore)
276 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
277 ->getElementType())->getReturnType(),
278 Instruction::Call, 0, 0, Name, InsertBefore) {
279 init(Func, Actual1, Actual2);
282 CallInst::CallInst(Value *Func, Value *Actual1, Value *Actual2,
283 const std::string &Name, BasicBlock *InsertAtEnd)
284 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
285 ->getElementType())->getReturnType(),
286 Instruction::Call, 0, 0, Name, InsertAtEnd) {
287 init(Func, Actual1, Actual2);
290 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
291 Instruction *InsertBefore)
292 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
293 ->getElementType())->getReturnType(),
294 Instruction::Call, 0, 0, Name, InsertBefore) {
298 CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
299 BasicBlock *InsertAtEnd)
300 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
301 ->getElementType())->getReturnType(),
302 Instruction::Call, 0, 0, Name, InsertAtEnd) {
306 CallInst::CallInst(Value *Func, const std::string &Name,
307 Instruction *InsertBefore)
308 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
309 ->getElementType())->getReturnType(),
310 Instruction::Call, 0, 0, Name, InsertBefore) {
314 CallInst::CallInst(Value *Func, const std::string &Name,
315 BasicBlock *InsertAtEnd)
316 : Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
317 ->getElementType())->getReturnType(),
318 Instruction::Call, 0, 0, Name, InsertAtEnd) {
322 CallInst::CallInst(const CallInst &CI)
323 : Instruction(CI.getType(), Instruction::Call, new Use[CI.getNumOperands()],
324 CI.getNumOperands()) {
325 SubclassData = CI.SubclassData;
326 Use *OL = OperandList;
327 Use *InOL = CI.OperandList;
328 for (unsigned i = 0, e = CI.getNumOperands(); i != e; ++i)
329 OL[i].init(InOL[i], this);
333 //===----------------------------------------------------------------------===//
334 // InvokeInst Implementation
335 //===----------------------------------------------------------------------===//
337 InvokeInst::~InvokeInst() {
338 delete [] OperandList;
341 void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
342 const std::vector<Value*> &Params) {
343 NumOperands = 3+Params.size();
344 Use *OL = OperandList = new Use[3+Params.size()];
345 OL[0].init(Fn, this);
346 OL[1].init(IfNormal, this);
347 OL[2].init(IfException, this);
348 const FunctionType *FTy =
349 cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
351 assert((Params.size() == FTy->getNumParams()) ||
352 (FTy->isVarArg() && Params.size() > FTy->getNumParams()) &&
353 "Calling a function with bad signature");
355 for (unsigned i = 0, e = Params.size(); i != e; i++) {
356 assert((i >= FTy->getNumParams() ||
357 FTy->getParamType(i) == Params[i]->getType()) &&
358 "Invoking a function with a bad signature!");
360 OL[i+3].init(Params[i], this);
364 InvokeInst::InvokeInst(Value *Fn, BasicBlock *IfNormal,
365 BasicBlock *IfException,
366 const std::vector<Value*> &Params,
367 const std::string &Name, Instruction *InsertBefore)
368 : TerminatorInst(cast<FunctionType>(cast<PointerType>(Fn->getType())
369 ->getElementType())->getReturnType(),
370 Instruction::Invoke, 0, 0, Name, InsertBefore) {
371 init(Fn, IfNormal, IfException, Params);
374 InvokeInst::InvokeInst(Value *Fn, BasicBlock *IfNormal,
375 BasicBlock *IfException,
376 const std::vector<Value*> &Params,
377 const std::string &Name, BasicBlock *InsertAtEnd)
378 : TerminatorInst(cast<FunctionType>(cast<PointerType>(Fn->getType())
379 ->getElementType())->getReturnType(),
380 Instruction::Invoke, 0, 0, Name, InsertAtEnd) {
381 init(Fn, IfNormal, IfException, Params);
384 InvokeInst::InvokeInst(const InvokeInst &II)
385 : TerminatorInst(II.getType(), Instruction::Invoke,
386 new Use[II.getNumOperands()], II.getNumOperands()) {
387 SubclassData = II.SubclassData;
388 Use *OL = OperandList, *InOL = II.OperandList;
389 for (unsigned i = 0, e = II.getNumOperands(); i != e; ++i)
390 OL[i].init(InOL[i], this);
393 BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
394 return getSuccessor(idx);
396 unsigned InvokeInst::getNumSuccessorsV() const {
397 return getNumSuccessors();
399 void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
400 return setSuccessor(idx, B);
404 //===----------------------------------------------------------------------===//
405 // ReturnInst Implementation
406 //===----------------------------------------------------------------------===//
408 void ReturnInst::init(Value *retVal) {
409 if (retVal && retVal->getType() != Type::VoidTy) {
410 assert(!isa<BasicBlock>(retVal) &&
411 "Cannot return basic block. Probably using the incorrect ctor");
413 RetVal.init(retVal, this);
417 unsigned ReturnInst::getNumSuccessorsV() const {
418 return getNumSuccessors();
421 // Out-of-line ReturnInst method, put here so the C++ compiler can choose to
422 // emit the vtable for the class in this translation unit.
423 void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
424 assert(0 && "ReturnInst has no successors!");
427 BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
428 assert(0 && "ReturnInst has no successors!");
434 //===----------------------------------------------------------------------===//
435 // UnwindInst Implementation
436 //===----------------------------------------------------------------------===//
438 unsigned UnwindInst::getNumSuccessorsV() const {
439 return getNumSuccessors();
442 void UnwindInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
443 assert(0 && "UnwindInst has no successors!");
446 BasicBlock *UnwindInst::getSuccessorV(unsigned idx) const {
447 assert(0 && "UnwindInst has no successors!");
452 //===----------------------------------------------------------------------===//
453 // UnreachableInst Implementation
454 //===----------------------------------------------------------------------===//
456 unsigned UnreachableInst::getNumSuccessorsV() const {
457 return getNumSuccessors();
460 void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
461 assert(0 && "UnwindInst has no successors!");
464 BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
465 assert(0 && "UnwindInst has no successors!");
470 //===----------------------------------------------------------------------===//
471 // BranchInst Implementation
472 //===----------------------------------------------------------------------===//
474 void BranchInst::AssertOK() {
476 assert(getCondition()->getType() == Type::BoolTy &&
477 "May only branch on boolean predicates!");
480 BranchInst::BranchInst(const BranchInst &BI) :
481 TerminatorInst(Instruction::Br, Ops, BI.getNumOperands()) {
482 OperandList[0].init(BI.getOperand(0), this);
483 if (BI.getNumOperands() != 1) {
484 assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
485 OperandList[1].init(BI.getOperand(1), this);
486 OperandList[2].init(BI.getOperand(2), this);
490 BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
491 return getSuccessor(idx);
493 unsigned BranchInst::getNumSuccessorsV() const {
494 return getNumSuccessors();
496 void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
497 setSuccessor(idx, B);
501 //===----------------------------------------------------------------------===//
502 // AllocationInst Implementation
503 //===----------------------------------------------------------------------===//
505 static Value *getAISize(Value *Amt) {
507 Amt = ConstantUInt::get(Type::UIntTy, 1);
509 assert(!isa<BasicBlock>(Amt) &&
510 "Passed basic block into allocation size parameter! Ue other ctor");
511 assert(Amt->getType() == Type::UIntTy &&
512 "Malloc/Allocation array size != UIntTy!");
517 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
518 unsigned Align, const std::string &Name,
519 Instruction *InsertBefore)
520 : UnaryInstruction(PointerType::get(Ty), iTy, getAISize(ArraySize),
521 Name, InsertBefore), Alignment(Align) {
522 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
523 assert(Ty != Type::VoidTy && "Cannot allocate void!");
526 AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
527 unsigned Align, const std::string &Name,
528 BasicBlock *InsertAtEnd)
529 : UnaryInstruction(PointerType::get(Ty), iTy, getAISize(ArraySize),
530 Name, InsertAtEnd), Alignment(Align) {
531 assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
532 assert(Ty != Type::VoidTy && "Cannot allocate void!");
535 bool AllocationInst::isArrayAllocation() const {
536 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(getOperand(0)))
537 return CUI->getValue() != 1;
541 const Type *AllocationInst::getAllocatedType() const {
542 return getType()->getElementType();
545 AllocaInst::AllocaInst(const AllocaInst &AI)
546 : AllocationInst(AI.getType()->getElementType(), (Value*)AI.getOperand(0),
547 Instruction::Alloca, AI.getAlignment()) {
550 MallocInst::MallocInst(const MallocInst &MI)
551 : AllocationInst(MI.getType()->getElementType(), (Value*)MI.getOperand(0),
552 Instruction::Malloc, MI.getAlignment()) {
555 //===----------------------------------------------------------------------===//
556 // FreeInst Implementation
557 //===----------------------------------------------------------------------===//
559 void FreeInst::AssertOK() {
560 assert(isa<PointerType>(getOperand(0)->getType()) &&
561 "Can not free something of nonpointer type!");
564 FreeInst::FreeInst(Value *Ptr, Instruction *InsertBefore)
565 : UnaryInstruction(Type::VoidTy, Free, Ptr, "", InsertBefore) {
569 FreeInst::FreeInst(Value *Ptr, BasicBlock *InsertAtEnd)
570 : UnaryInstruction(Type::VoidTy, Free, Ptr, "", InsertAtEnd) {
575 //===----------------------------------------------------------------------===//
576 // LoadInst Implementation
577 //===----------------------------------------------------------------------===//
579 void LoadInst::AssertOK() {
580 assert(isa<PointerType>(getOperand(0)->getType()) &&
581 "Ptr must have pointer type.");
584 LoadInst::LoadInst(Value *Ptr, const std::string &Name, Instruction *InsertBef)
585 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
586 Load, Ptr, Name, InsertBef) {
591 LoadInst::LoadInst(Value *Ptr, const std::string &Name, BasicBlock *InsertAE)
592 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
593 Load, Ptr, Name, InsertAE) {
598 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
599 Instruction *InsertBef)
600 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
601 Load, Ptr, Name, InsertBef) {
602 setVolatile(isVolatile);
606 LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
607 BasicBlock *InsertAE)
608 : UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
609 Load, Ptr, Name, InsertAE) {
610 setVolatile(isVolatile);
615 //===----------------------------------------------------------------------===//
616 // StoreInst Implementation
617 //===----------------------------------------------------------------------===//
619 void StoreInst::AssertOK() {
620 assert(isa<PointerType>(getOperand(1)->getType()) &&
621 "Ptr must have pointer type!");
622 assert(getOperand(0)->getType() ==
623 cast<PointerType>(getOperand(1)->getType())->getElementType()
624 && "Ptr must be a pointer to Val type!");
628 StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
629 : Instruction(Type::VoidTy, Store, Ops, 2, "", InsertBefore) {
630 Ops[0].init(val, this);
631 Ops[1].init(addr, this);
636 StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
637 : Instruction(Type::VoidTy, Store, Ops, 2, "", InsertAtEnd) {
638 Ops[0].init(val, this);
639 Ops[1].init(addr, this);
644 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
645 Instruction *InsertBefore)
646 : Instruction(Type::VoidTy, Store, Ops, 2, "", InsertBefore) {
647 Ops[0].init(val, this);
648 Ops[1].init(addr, this);
649 setVolatile(isVolatile);
653 StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
654 BasicBlock *InsertAtEnd)
655 : Instruction(Type::VoidTy, Store, Ops, 2, "", InsertAtEnd) {
656 Ops[0].init(val, this);
657 Ops[1].init(addr, this);
658 setVolatile(isVolatile);
662 //===----------------------------------------------------------------------===//
663 // GetElementPtrInst Implementation
664 //===----------------------------------------------------------------------===//
666 // checkType - Simple wrapper function to give a better assertion failure
667 // message on bad indexes for a gep instruction.
669 static inline const Type *checkType(const Type *Ty) {
670 assert(Ty && "Invalid indices for type!");
674 void GetElementPtrInst::init(Value *Ptr, const std::vector<Value*> &Idx) {
675 NumOperands = 1+Idx.size();
676 Use *OL = OperandList = new Use[NumOperands];
677 OL[0].init(Ptr, this);
679 for (unsigned i = 0, e = Idx.size(); i != e; ++i)
680 OL[i+1].init(Idx[i], this);
683 void GetElementPtrInst::init(Value *Ptr, Value *Idx0, Value *Idx1) {
685 Use *OL = OperandList = new Use[3];
686 OL[0].init(Ptr, this);
687 OL[1].init(Idx0, this);
688 OL[2].init(Idx1, this);
691 void GetElementPtrInst::init(Value *Ptr, Value *Idx) {
693 Use *OL = OperandList = new Use[2];
694 OL[0].init(Ptr, this);
695 OL[1].init(Idx, this);
698 GetElementPtrInst::GetElementPtrInst(Value *Ptr, const std::vector<Value*> &Idx,
699 const std::string &Name, Instruction *InBe)
700 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
702 GetElementPtr, 0, 0, Name, InBe) {
706 GetElementPtrInst::GetElementPtrInst(Value *Ptr, const std::vector<Value*> &Idx,
707 const std::string &Name, BasicBlock *IAE)
708 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
710 GetElementPtr, 0, 0, Name, IAE) {
714 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
715 const std::string &Name, Instruction *InBe)
716 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx))),
717 GetElementPtr, 0, 0, Name, InBe) {
721 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
722 const std::string &Name, BasicBlock *IAE)
723 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx))),
724 GetElementPtr, 0, 0, Name, IAE) {
728 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx0, Value *Idx1,
729 const std::string &Name, Instruction *InBe)
730 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
732 GetElementPtr, 0, 0, Name, InBe) {
733 init(Ptr, Idx0, Idx1);
736 GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx0, Value *Idx1,
737 const std::string &Name, BasicBlock *IAE)
738 : Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
740 GetElementPtr, 0, 0, Name, IAE) {
741 init(Ptr, Idx0, Idx1);
744 GetElementPtrInst::~GetElementPtrInst() {
745 delete[] OperandList;
748 // getIndexedType - Returns the type of the element that would be loaded with
749 // a load instruction with the specified parameters.
751 // A null type is returned if the indices are invalid for the specified
754 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
755 const std::vector<Value*> &Idx,
756 bool AllowCompositeLeaf) {
757 if (!isa<PointerType>(Ptr)) return 0; // Type isn't a pointer type!
759 // Handle the special case of the empty set index set...
761 if (AllowCompositeLeaf ||
762 cast<PointerType>(Ptr)->getElementType()->isFirstClassType())
763 return cast<PointerType>(Ptr)->getElementType();
768 while (const CompositeType *CT = dyn_cast<CompositeType>(Ptr)) {
769 if (Idx.size() == CurIdx) {
770 if (AllowCompositeLeaf || CT->isFirstClassType()) return Ptr;
771 return 0; // Can't load a whole structure or array!?!?
774 Value *Index = Idx[CurIdx++];
775 if (isa<PointerType>(CT) && CurIdx != 1)
776 return 0; // Can only index into pointer types at the first index!
777 if (!CT->indexValid(Index)) return 0;
778 Ptr = CT->getTypeAtIndex(Index);
780 // If the new type forwards to another type, then it is in the middle
781 // of being refined to another type (and hence, may have dropped all
782 // references to what it was using before). So, use the new forwarded
784 if (const Type * Ty = Ptr->getForwardedType()) {
788 return CurIdx == Idx.size() ? Ptr : 0;
791 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
792 Value *Idx0, Value *Idx1,
793 bool AllowCompositeLeaf) {
794 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
795 if (!PTy) return 0; // Type isn't a pointer type!
797 // Check the pointer index.
798 if (!PTy->indexValid(Idx0)) return 0;
800 const CompositeType *CT = dyn_cast<CompositeType>(PTy->getElementType());
801 if (!CT || !CT->indexValid(Idx1)) return 0;
803 const Type *ElTy = CT->getTypeAtIndex(Idx1);
804 if (AllowCompositeLeaf || ElTy->isFirstClassType())
809 const Type* GetElementPtrInst::getIndexedType(const Type *Ptr, Value *Idx) {
810 const PointerType *PTy = dyn_cast<PointerType>(Ptr);
811 if (!PTy) return 0; // Type isn't a pointer type!
813 // Check the pointer index.
814 if (!PTy->indexValid(Idx)) return 0;
816 return PTy->getElementType();
819 //===----------------------------------------------------------------------===//
820 // ExtractElementInst Implementation
821 //===----------------------------------------------------------------------===//
823 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
824 const std::string &Name,
825 Instruction *InsertBef)
826 : Instruction(cast<PackedType>(Val->getType())->getElementType(),
827 ExtractElement, Ops, 2, Name, InsertBef) {
828 assert(isValidOperands(Val, Index) &&
829 "Invalid extractelement instruction operands!");
830 Ops[0].init(Val, this);
831 Ops[1].init(Index, this);
834 ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
835 const std::string &Name,
836 BasicBlock *InsertAE)
837 : Instruction(cast<PackedType>(Val->getType())->getElementType(),
838 ExtractElement, Ops, 2, Name, InsertAE) {
839 assert(isValidOperands(Val, Index) &&
840 "Invalid extractelement instruction operands!");
842 Ops[0].init(Val, this);
843 Ops[1].init(Index, this);
846 bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
847 if (!isa<PackedType>(Val->getType()) || Index->getType() != Type::UIntTy)
853 //===----------------------------------------------------------------------===//
854 // InsertElementInst Implementation
855 //===----------------------------------------------------------------------===//
857 InsertElementInst::InsertElementInst(const InsertElementInst &IE)
858 : Instruction(IE.getType(), InsertElement, Ops, 3) {
859 Ops[0].init(IE.Ops[0], this);
860 Ops[1].init(IE.Ops[1], this);
861 Ops[2].init(IE.Ops[2], this);
863 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
864 const std::string &Name,
865 Instruction *InsertBef)
866 : Instruction(Vec->getType(), InsertElement, Ops, 3, Name, InsertBef) {
867 assert(isValidOperands(Vec, Elt, Index) &&
868 "Invalid insertelement instruction operands!");
869 Ops[0].init(Vec, this);
870 Ops[1].init(Elt, this);
871 Ops[2].init(Index, this);
874 InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
875 const std::string &Name,
876 BasicBlock *InsertAE)
877 : Instruction(Vec->getType(), InsertElement, Ops, 3, Name, InsertAE) {
878 assert(isValidOperands(Vec, Elt, Index) &&
879 "Invalid insertelement instruction operands!");
881 Ops[0].init(Vec, this);
882 Ops[1].init(Elt, this);
883 Ops[2].init(Index, this);
886 bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
887 const Value *Index) {
888 if (!isa<PackedType>(Vec->getType()))
889 return false; // First operand of insertelement must be packed type.
891 if (Elt->getType() != cast<PackedType>(Vec->getType())->getElementType())
892 return false;// Second operand of insertelement must be packed element type.
894 if (Index->getType() != Type::UIntTy)
895 return false; // Third operand of insertelement must be uint.
900 //===----------------------------------------------------------------------===//
901 // ShuffleVectorInst Implementation
902 //===----------------------------------------------------------------------===//
904 ShuffleVectorInst::ShuffleVectorInst(const ShuffleVectorInst &SV)
905 : Instruction(SV.getType(), ShuffleVector, Ops, 3) {
906 Ops[0].init(SV.Ops[0], this);
907 Ops[1].init(SV.Ops[1], this);
908 Ops[2].init(SV.Ops[2], this);
911 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
912 const std::string &Name,
913 Instruction *InsertBefore)
914 : Instruction(V1->getType(), ShuffleVector, Ops, 3, Name, InsertBefore) {
915 assert(isValidOperands(V1, V2, Mask) &&
916 "Invalid shuffle vector instruction operands!");
917 Ops[0].init(V1, this);
918 Ops[1].init(V2, this);
919 Ops[2].init(Mask, this);
922 ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
923 const std::string &Name,
924 BasicBlock *InsertAtEnd)
925 : Instruction(V1->getType(), ShuffleVector, Ops, 3, Name, InsertAtEnd) {
926 assert(isValidOperands(V1, V2, Mask) &&
927 "Invalid shuffle vector instruction operands!");
929 Ops[0].init(V1, this);
930 Ops[1].init(V2, this);
931 Ops[2].init(Mask, this);
934 bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
936 if (!isa<PackedType>(V1->getType())) return false;
937 if (V1->getType() != V2->getType()) return false;
938 if (!isa<PackedType>(Mask->getType()) ||
939 cast<PackedType>(Mask->getType())->getElementType() != Type::UIntTy ||
940 cast<PackedType>(Mask->getType())->getNumElements() !=
941 cast<PackedType>(V1->getType())->getNumElements())
947 //===----------------------------------------------------------------------===//
948 // BinaryOperator Class
949 //===----------------------------------------------------------------------===//
951 void BinaryOperator::init(BinaryOps iType)
953 Value *LHS = getOperand(0), *RHS = getOperand(1);
954 assert(LHS->getType() == RHS->getType() &&
955 "Binary operator operand types must match!");
961 assert(getType() == LHS->getType() &&
962 "Arithmetic operation should return same type as operands!");
963 assert((getType()->isInteger() || getType()->isFloatingPoint() ||
964 isa<PackedType>(getType())) &&
965 "Tried to create an arithmetic operation on a non-arithmetic type!");
969 assert(getType() == LHS->getType() &&
970 "Logical operation should return same type as operands!");
971 assert((getType()->isIntegral() ||
972 (isa<PackedType>(getType()) &&
973 cast<PackedType>(getType())->getElementType()->isIntegral())) &&
974 "Tried to create a logical operation on a non-integral type!");
976 case SetLT: case SetGT: case SetLE:
977 case SetGE: case SetEQ: case SetNE:
978 assert(getType() == Type::BoolTy && "Setcc must return bool!");
985 BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
986 const std::string &Name,
987 Instruction *InsertBefore) {
988 assert(S1->getType() == S2->getType() &&
989 "Cannot create binary operator with two operands of differing type!");
991 // Binary comparison operators...
992 case SetLT: case SetGT: case SetLE:
993 case SetGE: case SetEQ: case SetNE:
994 return new SetCondInst(Op, S1, S2, Name, InsertBefore);
997 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1001 BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
1002 const std::string &Name,
1003 BasicBlock *InsertAtEnd) {
1004 BinaryOperator *Res = create(Op, S1, S2, Name);
1005 InsertAtEnd->getInstList().push_back(Res);
1009 BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
1010 Instruction *InsertBefore) {
1011 if (!Op->getType()->isFloatingPoint())
1012 return new BinaryOperator(Instruction::Sub,
1013 Constant::getNullValue(Op->getType()), Op,
1014 Op->getType(), Name, InsertBefore);
1016 return new BinaryOperator(Instruction::Sub,
1017 ConstantFP::get(Op->getType(), -0.0), Op,
1018 Op->getType(), Name, InsertBefore);
1021 BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
1022 BasicBlock *InsertAtEnd) {
1023 if (!Op->getType()->isFloatingPoint())
1024 return new BinaryOperator(Instruction::Sub,
1025 Constant::getNullValue(Op->getType()), Op,
1026 Op->getType(), Name, InsertAtEnd);
1028 return new BinaryOperator(Instruction::Sub,
1029 ConstantFP::get(Op->getType(), -0.0), Op,
1030 Op->getType(), Name, InsertAtEnd);
1033 BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
1034 Instruction *InsertBefore) {
1036 if (const PackedType *PTy = dyn_cast<PackedType>(Op->getType())) {
1037 C = ConstantIntegral::getAllOnesValue(PTy->getElementType());
1038 C = ConstantPacked::get(std::vector<Constant*>(PTy->getNumElements(), C));
1040 C = ConstantIntegral::getAllOnesValue(Op->getType());
1043 return new BinaryOperator(Instruction::Xor, Op, C,
1044 Op->getType(), Name, InsertBefore);
1047 BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
1048 BasicBlock *InsertAtEnd) {
1050 if (const PackedType *PTy = dyn_cast<PackedType>(Op->getType())) {
1051 // Create a vector of all ones values.
1052 Constant *Elt = ConstantIntegral::getAllOnesValue(PTy->getElementType());
1054 ConstantPacked::get(std::vector<Constant*>(PTy->getNumElements(), Elt));
1056 AllOnes = ConstantIntegral::getAllOnesValue(Op->getType());
1059 return new BinaryOperator(Instruction::Xor, Op, AllOnes,
1060 Op->getType(), Name, InsertAtEnd);
1064 // isConstantAllOnes - Helper function for several functions below
1065 static inline bool isConstantAllOnes(const Value *V) {
1066 return isa<ConstantIntegral>(V) &&cast<ConstantIntegral>(V)->isAllOnesValue();
1069 bool BinaryOperator::isNeg(const Value *V) {
1070 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1071 if (Bop->getOpcode() == Instruction::Sub)
1072 if (!V->getType()->isFloatingPoint())
1073 return Bop->getOperand(0) == Constant::getNullValue(Bop->getType());
1075 return Bop->getOperand(0) == ConstantFP::get(Bop->getType(), -0.0);
1079 bool BinaryOperator::isNot(const Value *V) {
1080 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
1081 return (Bop->getOpcode() == Instruction::Xor &&
1082 (isConstantAllOnes(Bop->getOperand(1)) ||
1083 isConstantAllOnes(Bop->getOperand(0))));
1087 Value *BinaryOperator::getNegArgument(Value *BinOp) {
1088 assert(isNeg(BinOp) && "getNegArgument from non-'neg' instruction!");
1089 return cast<BinaryOperator>(BinOp)->getOperand(1);
1092 const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
1093 return getNegArgument(const_cast<Value*>(BinOp));
1096 Value *BinaryOperator::getNotArgument(Value *BinOp) {
1097 assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
1098 BinaryOperator *BO = cast<BinaryOperator>(BinOp);
1099 Value *Op0 = BO->getOperand(0);
1100 Value *Op1 = BO->getOperand(1);
1101 if (isConstantAllOnes(Op0)) return Op1;
1103 assert(isConstantAllOnes(Op1));
1107 const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
1108 return getNotArgument(const_cast<Value*>(BinOp));
1112 // swapOperands - Exchange the two operands to this instruction. This
1113 // instruction is safe to use on any binary instruction and does not
1114 // modify the semantics of the instruction. If the instruction is
1115 // order dependent (SetLT f.e.) the opcode is changed.
1117 bool BinaryOperator::swapOperands() {
1118 if (isCommutative())
1119 ; // If the instruction is commutative, it is safe to swap the operands
1120 else if (SetCondInst *SCI = dyn_cast<SetCondInst>(this))
1121 /// FIXME: SetCC instructions shouldn't all have different opcodes.
1122 setOpcode(SCI->getSwappedCondition());
1124 return true; // Can't commute operands
1126 std::swap(Ops[0], Ops[1]);
1131 //===----------------------------------------------------------------------===//
1132 // SetCondInst Class
1133 //===----------------------------------------------------------------------===//
1135 SetCondInst::SetCondInst(BinaryOps Opcode, Value *S1, Value *S2,
1136 const std::string &Name, Instruction *InsertBefore)
1137 : BinaryOperator(Opcode, S1, S2, Type::BoolTy, Name, InsertBefore) {
1139 // Make sure it's a valid type... getInverseCondition will assert out if not.
1140 assert(getInverseCondition(Opcode));
1143 SetCondInst::SetCondInst(BinaryOps Opcode, Value *S1, Value *S2,
1144 const std::string &Name, BasicBlock *InsertAtEnd)
1145 : BinaryOperator(Opcode, S1, S2, Type::BoolTy, Name, InsertAtEnd) {
1147 // Make sure it's a valid type... getInverseCondition will assert out if not.
1148 assert(getInverseCondition(Opcode));
1151 // getInverseCondition - Return the inverse of the current condition opcode.
1152 // For example seteq -> setne, setgt -> setle, setlt -> setge, etc...
1154 Instruction::BinaryOps SetCondInst::getInverseCondition(BinaryOps Opcode) {
1157 assert(0 && "Unknown setcc opcode!");
1158 case SetEQ: return SetNE;
1159 case SetNE: return SetEQ;
1160 case SetGT: return SetLE;
1161 case SetLT: return SetGE;
1162 case SetGE: return SetLT;
1163 case SetLE: return SetGT;
1167 // getSwappedCondition - Return the condition opcode that would be the result
1168 // of exchanging the two operands of the setcc instruction without changing
1169 // the result produced. Thus, seteq->seteq, setle->setge, setlt->setgt, etc.
1171 Instruction::BinaryOps SetCondInst::getSwappedCondition(BinaryOps Opcode) {
1173 default: assert(0 && "Unknown setcc instruction!");
1174 case SetEQ: case SetNE: return Opcode;
1175 case SetGT: return SetLT;
1176 case SetLT: return SetGT;
1177 case SetGE: return SetLE;
1178 case SetLE: return SetGE;
1182 //===----------------------------------------------------------------------===//
1183 // SwitchInst Implementation
1184 //===----------------------------------------------------------------------===//
1186 void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumCases) {
1187 assert(Value && Default);
1188 ReservedSpace = 2+NumCases*2;
1190 OperandList = new Use[ReservedSpace];
1192 OperandList[0].init(Value, this);
1193 OperandList[1].init(Default, this);
1196 SwitchInst::SwitchInst(const SwitchInst &SI)
1197 : TerminatorInst(Instruction::Switch, new Use[SI.getNumOperands()],
1198 SI.getNumOperands()) {
1199 Use *OL = OperandList, *InOL = SI.OperandList;
1200 for (unsigned i = 0, E = SI.getNumOperands(); i != E; i+=2) {
1201 OL[i].init(InOL[i], this);
1202 OL[i+1].init(InOL[i+1], this);
1206 SwitchInst::~SwitchInst() {
1207 delete [] OperandList;
1211 /// addCase - Add an entry to the switch instruction...
1213 void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
1214 unsigned OpNo = NumOperands;
1215 if (OpNo+2 > ReservedSpace)
1216 resizeOperands(0); // Get more space!
1217 // Initialize some new operands.
1218 assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
1219 NumOperands = OpNo+2;
1220 OperandList[OpNo].init(OnVal, this);
1221 OperandList[OpNo+1].init(Dest, this);
1224 /// removeCase - This method removes the specified successor from the switch
1225 /// instruction. Note that this cannot be used to remove the default
1226 /// destination (successor #0).
1228 void SwitchInst::removeCase(unsigned idx) {
1229 assert(idx != 0 && "Cannot remove the default case!");
1230 assert(idx*2 < getNumOperands() && "Successor index out of range!!!");
1232 unsigned NumOps = getNumOperands();
1233 Use *OL = OperandList;
1235 // Move everything after this operand down.
1237 // FIXME: we could just swap with the end of the list, then erase. However,
1238 // client might not expect this to happen. The code as it is thrashes the
1239 // use/def lists, which is kinda lame.
1240 for (unsigned i = (idx+1)*2; i != NumOps; i += 2) {
1242 OL[i-2+1] = OL[i+1];
1245 // Nuke the last value.
1246 OL[NumOps-2].set(0);
1247 OL[NumOps-2+1].set(0);
1248 NumOperands = NumOps-2;
1251 /// resizeOperands - resize operands - This adjusts the length of the operands
1252 /// list according to the following behavior:
1253 /// 1. If NumOps == 0, grow the operand list in response to a push_back style
1254 /// of operation. This grows the number of ops by 1.5 times.
1255 /// 2. If NumOps > NumOperands, reserve space for NumOps operands.
1256 /// 3. If NumOps == NumOperands, trim the reserved space.
1258 void SwitchInst::resizeOperands(unsigned NumOps) {
1260 NumOps = getNumOperands()/2*6;
1261 } else if (NumOps*2 > NumOperands) {
1262 // No resize needed.
1263 if (ReservedSpace >= NumOps) return;
1264 } else if (NumOps == NumOperands) {
1265 if (ReservedSpace == NumOps) return;
1270 ReservedSpace = NumOps;
1271 Use *NewOps = new Use[NumOps];
1272 Use *OldOps = OperandList;
1273 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
1274 NewOps[i].init(OldOps[i], this);
1278 OperandList = NewOps;
1282 BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
1283 return getSuccessor(idx);
1285 unsigned SwitchInst::getNumSuccessorsV() const {
1286 return getNumSuccessors();
1288 void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
1289 setSuccessor(idx, B);
1293 // Define these methods here so vtables don't get emitted into every translation
1294 // unit that uses these classes.
1296 GetElementPtrInst *GetElementPtrInst::clone() const {
1297 return new GetElementPtrInst(*this);
1300 BinaryOperator *BinaryOperator::clone() const {
1301 return create(getOpcode(), Ops[0], Ops[1]);
1304 MallocInst *MallocInst::clone() const { return new MallocInst(*this); }
1305 AllocaInst *AllocaInst::clone() const { return new AllocaInst(*this); }
1306 FreeInst *FreeInst::clone() const { return new FreeInst(getOperand(0)); }
1307 LoadInst *LoadInst::clone() const { return new LoadInst(*this); }
1308 StoreInst *StoreInst::clone() const { return new StoreInst(*this); }
1309 CastInst *CastInst::clone() const { return new CastInst(*this); }
1310 CallInst *CallInst::clone() const { return new CallInst(*this); }
1311 ShiftInst *ShiftInst::clone() const { return new ShiftInst(*this); }
1312 SelectInst *SelectInst::clone() const { return new SelectInst(*this); }
1313 VAArgInst *VAArgInst::clone() const { return new VAArgInst(*this); }
1314 ExtractElementInst *ExtractElementInst::clone() const {
1315 return new ExtractElementInst(*this);
1317 InsertElementInst *InsertElementInst::clone() const {
1318 return new InsertElementInst(*this);
1320 ShuffleVectorInst *ShuffleVectorInst::clone() const {
1321 return new ShuffleVectorInst(*this);
1323 PHINode *PHINode::clone() const { return new PHINode(*this); }
1324 ReturnInst *ReturnInst::clone() const { return new ReturnInst(*this); }
1325 BranchInst *BranchInst::clone() const { return new BranchInst(*this); }
1326 SwitchInst *SwitchInst::clone() const { return new SwitchInst(*this); }
1327 InvokeInst *InvokeInst::clone() const { return new InvokeInst(*this); }
1328 UnwindInst *UnwindInst::clone() const { return new UnwindInst(); }
1329 UnreachableInst *UnreachableInst::clone() const { return new UnreachableInst();}