2004-07-29 14:33:25 +02:00
|
|
|
//===-- Instructions.cpp - Implement the LLVM instructions ----------------===//
|
2005-04-22 01:48:37 +02:00
|
|
|
//
|
2004-07-29 14:33:25 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
2005-04-22 01:48:37 +02:00
|
|
|
//
|
2004-07-29 14:33:25 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2005-01-29 01:35:16 +01:00
|
|
|
// This file implements all of the non-inline methods for the LLVM instruction
|
|
|
|
// classes.
|
2004-07-29 14:33:25 +02:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/BasicBlock.h"
|
|
|
|
#include "llvm/Constants.h"
|
|
|
|
#include "llvm/DerivedTypes.h"
|
|
|
|
#include "llvm/Function.h"
|
|
|
|
#include "llvm/Instructions.h"
|
|
|
|
#include "llvm/Support/CallSite.h"
|
|
|
|
using namespace llvm;
|
|
|
|
|
2005-05-06 22:26:43 +02:00
|
|
|
unsigned CallSite::getCallingConv() const {
|
|
|
|
if (CallInst *CI = dyn_cast<CallInst>(I))
|
|
|
|
return CI->getCallingConv();
|
|
|
|
else
|
|
|
|
return cast<InvokeInst>(I)->getCallingConv();
|
|
|
|
}
|
|
|
|
void CallSite::setCallingConv(unsigned CC) {
|
|
|
|
if (CallInst *CI = dyn_cast<CallInst>(I))
|
|
|
|
CI->setCallingConv(CC);
|
|
|
|
else
|
|
|
|
cast<InvokeInst>(I)->setCallingConv(CC);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-06-21 18:53:47 +02:00
|
|
|
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// TerminatorInst Class
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
TerminatorInst::TerminatorInst(Instruction::TermOps iType,
|
2005-04-22 01:48:37 +02:00
|
|
|
Use *Ops, unsigned NumOps, Instruction *IB)
|
2005-01-29 01:35:16 +01:00
|
|
|
: Instruction(Type::VoidTy, iType, Ops, NumOps, "", IB) {
|
|
|
|
}
|
|
|
|
|
|
|
|
TerminatorInst::TerminatorInst(Instruction::TermOps iType,
|
|
|
|
Use *Ops, unsigned NumOps, BasicBlock *IAE)
|
|
|
|
: Instruction(Type::VoidTy, iType, Ops, NumOps, "", IAE) {
|
|
|
|
}
|
|
|
|
|
2006-06-21 18:53:47 +02:00
|
|
|
// Out of line virtual method, so the vtable, etc has a home.
|
|
|
|
TerminatorInst::~TerminatorInst() {
|
|
|
|
}
|
|
|
|
|
|
|
|
// Out of line virtual method, so the vtable, etc has a home.
|
|
|
|
UnaryInstruction::~UnaryInstruction() {
|
|
|
|
}
|
2005-01-29 01:35:16 +01:00
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// PHINode Class
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
PHINode::PHINode(const PHINode &PN)
|
|
|
|
: Instruction(PN.getType(), Instruction::PHI,
|
|
|
|
new Use[PN.getNumOperands()], PN.getNumOperands()),
|
|
|
|
ReservedSpace(PN.getNumOperands()) {
|
|
|
|
Use *OL = OperandList;
|
|
|
|
for (unsigned i = 0, e = PN.getNumOperands(); i != e; i+=2) {
|
|
|
|
OL[i].init(PN.getOperand(i), this);
|
|
|
|
OL[i+1].init(PN.getOperand(i+1), this);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
PHINode::~PHINode() {
|
|
|
|
delete [] OperandList;
|
|
|
|
}
|
|
|
|
|
|
|
|
// removeIncomingValue - Remove an incoming value. This is useful if a
|
|
|
|
// predecessor basic block is deleted.
|
|
|
|
Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
|
|
|
|
unsigned NumOps = getNumOperands();
|
|
|
|
Use *OL = OperandList;
|
|
|
|
assert(Idx*2 < NumOps && "BB not in PHI node!");
|
|
|
|
Value *Removed = OL[Idx*2];
|
|
|
|
|
|
|
|
// Move everything after this operand down.
|
|
|
|
//
|
|
|
|
// FIXME: we could just swap with the end of the list, then erase. However,
|
|
|
|
// client might not expect this to happen. The code as it is thrashes the
|
|
|
|
// use/def lists, which is kinda lame.
|
|
|
|
for (unsigned i = (Idx+1)*2; i != NumOps; i += 2) {
|
|
|
|
OL[i-2] = OL[i];
|
|
|
|
OL[i-2+1] = OL[i+1];
|
|
|
|
}
|
|
|
|
|
|
|
|
// Nuke the last value.
|
|
|
|
OL[NumOps-2].set(0);
|
|
|
|
OL[NumOps-2+1].set(0);
|
|
|
|
NumOperands = NumOps-2;
|
|
|
|
|
|
|
|
// If the PHI node is dead, because it has zero entries, nuke it now.
|
|
|
|
if (NumOps == 2 && DeletePHIIfEmpty) {
|
|
|
|
// If anyone is using this PHI, make them use a dummy value instead...
|
|
|
|
replaceAllUsesWith(UndefValue::get(getType()));
|
|
|
|
eraseFromParent();
|
|
|
|
}
|
|
|
|
return Removed;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// resizeOperands - resize operands - This adjusts the length of the operands
|
|
|
|
/// list according to the following behavior:
|
|
|
|
/// 1. If NumOps == 0, grow the operand list in response to a push_back style
|
|
|
|
/// of operation. This grows the number of ops by 1.5 times.
|
|
|
|
/// 2. If NumOps > NumOperands, reserve space for NumOps operands.
|
|
|
|
/// 3. If NumOps == NumOperands, trim the reserved space.
|
|
|
|
///
|
|
|
|
void PHINode::resizeOperands(unsigned NumOps) {
|
|
|
|
if (NumOps == 0) {
|
|
|
|
NumOps = (getNumOperands())*3/2;
|
|
|
|
if (NumOps < 4) NumOps = 4; // 4 op PHI nodes are VERY common.
|
|
|
|
} else if (NumOps*2 > NumOperands) {
|
|
|
|
// No resize needed.
|
|
|
|
if (ReservedSpace >= NumOps) return;
|
|
|
|
} else if (NumOps == NumOperands) {
|
|
|
|
if (ReservedSpace == NumOps) return;
|
|
|
|
} else {
|
2005-04-22 01:48:37 +02:00
|
|
|
return;
|
2005-01-29 01:35:16 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
ReservedSpace = NumOps;
|
|
|
|
Use *NewOps = new Use[NumOps];
|
|
|
|
Use *OldOps = OperandList;
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
NewOps[i].init(OldOps[i], this);
|
|
|
|
OldOps[i].set(0);
|
|
|
|
}
|
|
|
|
delete [] OldOps;
|
|
|
|
OperandList = NewOps;
|
|
|
|
}
|
|
|
|
|
2005-08-05 01:24:19 +02:00
|
|
|
/// hasConstantValue - If the specified PHI node always merges together the same
|
|
|
|
/// value, return the value, otherwise return null.
|
|
|
|
///
|
2005-08-05 02:49:06 +02:00
|
|
|
Value *PHINode::hasConstantValue(bool AllowNonDominatingInstruction) const {
|
2005-08-05 01:24:19 +02:00
|
|
|
// If the PHI node only has one incoming value, eliminate the PHI node...
|
|
|
|
if (getNumIncomingValues() == 1)
|
2005-08-05 17:37:31 +02:00
|
|
|
if (getIncomingValue(0) != this) // not X = phi X
|
|
|
|
return getIncomingValue(0);
|
|
|
|
else
|
|
|
|
return UndefValue::get(getType()); // Self cycle is dead.
|
|
|
|
|
2005-08-05 01:24:19 +02:00
|
|
|
// Otherwise if all of the incoming values are the same for the PHI, replace
|
|
|
|
// the PHI node with the incoming value.
|
|
|
|
//
|
|
|
|
Value *InVal = 0;
|
2005-08-05 03:00:58 +02:00
|
|
|
bool HasUndefInput = false;
|
2005-08-05 01:24:19 +02:00
|
|
|
for (unsigned i = 0, e = getNumIncomingValues(); i != e; ++i)
|
2005-08-05 03:00:58 +02:00
|
|
|
if (isa<UndefValue>(getIncomingValue(i)))
|
|
|
|
HasUndefInput = true;
|
|
|
|
else if (getIncomingValue(i) != this) // Not the PHI node itself...
|
2005-08-05 01:24:19 +02:00
|
|
|
if (InVal && getIncomingValue(i) != InVal)
|
|
|
|
return 0; // Not the same, bail out.
|
|
|
|
else
|
|
|
|
InVal = getIncomingValue(i);
|
|
|
|
|
|
|
|
// The only case that could cause InVal to be null is if we have a PHI node
|
|
|
|
// that only has entries for itself. In this case, there is no entry into the
|
|
|
|
// loop, so kill the PHI.
|
|
|
|
//
|
|
|
|
if (InVal == 0) InVal = UndefValue::get(getType());
|
|
|
|
|
2005-08-05 03:00:58 +02:00
|
|
|
// If we have a PHI node like phi(X, undef, X), where X is defined by some
|
|
|
|
// instruction, we cannot always return X as the result of the PHI node. Only
|
|
|
|
// do this if X is not an instruction (thus it must dominate the PHI block),
|
|
|
|
// or if the client is prepared to deal with this possibility.
|
|
|
|
if (HasUndefInput && !AllowNonDominatingInstruction)
|
|
|
|
if (Instruction *IV = dyn_cast<Instruction>(InVal))
|
|
|
|
// If it's in the entry block, it dominates everything.
|
2005-08-05 03:03:27 +02:00
|
|
|
if (IV->getParent() != &IV->getParent()->getParent()->front() ||
|
|
|
|
isa<InvokeInst>(IV))
|
2005-08-05 03:00:58 +02:00
|
|
|
return 0; // Cannot guarantee that InVal dominates this PHINode.
|
|
|
|
|
2005-08-05 01:24:19 +02:00
|
|
|
// All of the incoming values are the same, return the value now.
|
|
|
|
return InVal;
|
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// CallInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
CallInst::~CallInst() {
|
|
|
|
delete [] OperandList;
|
|
|
|
}
|
|
|
|
|
|
|
|
void CallInst::init(Value *Func, const std::vector<Value*> &Params) {
|
|
|
|
NumOperands = Params.size()+1;
|
|
|
|
Use *OL = OperandList = new Use[Params.size()+1];
|
|
|
|
OL[0].init(Func, this);
|
2004-07-29 14:33:25 +02:00
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
const FunctionType *FTy =
|
2004-07-29 14:33:25 +02:00
|
|
|
cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
assert((Params.size() == FTy->getNumParams() ||
|
2004-07-29 14:33:25 +02:00
|
|
|
(FTy->isVarArg() && Params.size() > FTy->getNumParams())) &&
|
2006-05-03 02:48:22 +02:00
|
|
|
"Calling a function with bad signature!");
|
|
|
|
for (unsigned i = 0, e = Params.size(); i != e; ++i) {
|
|
|
|
assert((i >= FTy->getNumParams() ||
|
|
|
|
FTy->getParamType(i) == Params[i]->getType()) &&
|
|
|
|
"Calling a function with a bad signature!");
|
2005-01-29 01:35:16 +01:00
|
|
|
OL[i+1].init(Params[i], this);
|
2006-05-03 02:48:22 +02:00
|
|
|
}
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
void CallInst::init(Value *Func, Value *Actual1, Value *Actual2) {
|
|
|
|
NumOperands = 3;
|
|
|
|
Use *OL = OperandList = new Use[3];
|
|
|
|
OL[0].init(Func, this);
|
|
|
|
OL[1].init(Actual1, this);
|
|
|
|
OL[2].init(Actual2, this);
|
2005-04-22 01:48:37 +02:00
|
|
|
|
|
|
|
const FunctionType *FTy =
|
2004-07-29 14:33:25 +02:00
|
|
|
cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
assert((FTy->getNumParams() == 2 ||
|
2006-05-03 02:48:22 +02:00
|
|
|
(FTy->isVarArg() && FTy->getNumParams() < 2)) &&
|
2004-07-29 14:33:25 +02:00
|
|
|
"Calling a function with bad signature");
|
2006-05-03 02:48:22 +02:00
|
|
|
assert((0 >= FTy->getNumParams() ||
|
|
|
|
FTy->getParamType(0) == Actual1->getType()) &&
|
|
|
|
"Calling a function with a bad signature!");
|
|
|
|
assert((1 >= FTy->getNumParams() ||
|
|
|
|
FTy->getParamType(1) == Actual2->getType()) &&
|
|
|
|
"Calling a function with a bad signature!");
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
void CallInst::init(Value *Func, Value *Actual) {
|
|
|
|
NumOperands = 2;
|
|
|
|
Use *OL = OperandList = new Use[2];
|
|
|
|
OL[0].init(Func, this);
|
|
|
|
OL[1].init(Actual, this);
|
2005-04-22 01:48:37 +02:00
|
|
|
|
|
|
|
const FunctionType *FTy =
|
2004-07-29 14:33:25 +02:00
|
|
|
cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
assert((FTy->getNumParams() == 1 ||
|
|
|
|
(FTy->isVarArg() && FTy->getNumParams() == 0)) &&
|
2004-07-29 14:33:25 +02:00
|
|
|
"Calling a function with bad signature");
|
2006-05-03 02:48:22 +02:00
|
|
|
assert((0 == FTy->getNumParams() ||
|
|
|
|
FTy->getParamType(0) == Actual->getType()) &&
|
|
|
|
"Calling a function with a bad signature!");
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
void CallInst::init(Value *Func) {
|
|
|
|
NumOperands = 1;
|
|
|
|
Use *OL = OperandList = new Use[1];
|
|
|
|
OL[0].init(Func, this);
|
2005-04-22 01:48:37 +02:00
|
|
|
|
|
|
|
const FunctionType *MTy =
|
2004-07-29 14:33:25 +02:00
|
|
|
cast<FunctionType>(cast<PointerType>(Func->getType())->getElementType());
|
|
|
|
|
|
|
|
assert(MTy->getNumParams() == 0 && "Calling a function with bad signature");
|
|
|
|
}
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
CallInst::CallInst(Value *Func, const std::vector<Value*> &Params,
|
|
|
|
const std::string &Name, Instruction *InsertBefore)
|
2004-07-29 14:33:25 +02:00
|
|
|
: Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
|
|
|
|
->getElementType())->getReturnType(),
|
2005-01-29 01:35:16 +01:00
|
|
|
Instruction::Call, 0, 0, Name, InsertBefore) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Func, Params);
|
|
|
|
}
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
CallInst::CallInst(Value *Func, const std::vector<Value*> &Params,
|
|
|
|
const std::string &Name, BasicBlock *InsertAtEnd)
|
2004-07-29 14:33:25 +02:00
|
|
|
: Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
|
|
|
|
->getElementType())->getReturnType(),
|
2005-01-29 01:35:16 +01:00
|
|
|
Instruction::Call, 0, 0, Name, InsertAtEnd) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Func, Params);
|
|
|
|
}
|
|
|
|
|
|
|
|
CallInst::CallInst(Value *Func, Value *Actual1, Value *Actual2,
|
|
|
|
const std::string &Name, Instruction *InsertBefore)
|
|
|
|
: Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
|
|
|
|
->getElementType())->getReturnType(),
|
2005-01-29 01:35:16 +01:00
|
|
|
Instruction::Call, 0, 0, Name, InsertBefore) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Func, Actual1, Actual2);
|
|
|
|
}
|
|
|
|
|
|
|
|
CallInst::CallInst(Value *Func, Value *Actual1, Value *Actual2,
|
|
|
|
const std::string &Name, BasicBlock *InsertAtEnd)
|
|
|
|
: Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
|
|
|
|
->getElementType())->getReturnType(),
|
2005-01-29 01:35:16 +01:00
|
|
|
Instruction::Call, 0, 0, Name, InsertAtEnd) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Func, Actual1, Actual2);
|
|
|
|
}
|
|
|
|
|
|
|
|
CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
|
|
|
|
Instruction *InsertBefore)
|
|
|
|
: Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
|
|
|
|
->getElementType())->getReturnType(),
|
2005-01-29 01:35:16 +01:00
|
|
|
Instruction::Call, 0, 0, Name, InsertBefore) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Func, Actual);
|
|
|
|
}
|
|
|
|
|
|
|
|
CallInst::CallInst(Value *Func, Value* Actual, const std::string &Name,
|
|
|
|
BasicBlock *InsertAtEnd)
|
|
|
|
: Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
|
|
|
|
->getElementType())->getReturnType(),
|
2005-01-29 01:35:16 +01:00
|
|
|
Instruction::Call, 0, 0, Name, InsertAtEnd) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Func, Actual);
|
|
|
|
}
|
|
|
|
|
|
|
|
CallInst::CallInst(Value *Func, const std::string &Name,
|
|
|
|
Instruction *InsertBefore)
|
|
|
|
: Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
|
|
|
|
->getElementType())->getReturnType(),
|
2005-01-29 01:35:16 +01:00
|
|
|
Instruction::Call, 0, 0, Name, InsertBefore) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Func);
|
|
|
|
}
|
|
|
|
|
|
|
|
CallInst::CallInst(Value *Func, const std::string &Name,
|
|
|
|
BasicBlock *InsertAtEnd)
|
|
|
|
: Instruction(cast<FunctionType>(cast<PointerType>(Func->getType())
|
|
|
|
->getElementType())->getReturnType(),
|
2005-01-29 01:35:16 +01:00
|
|
|
Instruction::Call, 0, 0, Name, InsertAtEnd) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Func);
|
|
|
|
}
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
CallInst::CallInst(const CallInst &CI)
|
2005-01-29 01:35:16 +01:00
|
|
|
: Instruction(CI.getType(), Instruction::Call, new Use[CI.getNumOperands()],
|
|
|
|
CI.getNumOperands()) {
|
2005-05-06 22:26:43 +02:00
|
|
|
SubclassData = CI.SubclassData;
|
2005-01-29 01:35:16 +01:00
|
|
|
Use *OL = OperandList;
|
|
|
|
Use *InOL = CI.OperandList;
|
|
|
|
for (unsigned i = 0, e = CI.getNumOperands(); i != e; ++i)
|
|
|
|
OL[i].init(InOL[i], this);
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// InvokeInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
InvokeInst::~InvokeInst() {
|
|
|
|
delete [] OperandList;
|
|
|
|
}
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
void InvokeInst::init(Value *Fn, BasicBlock *IfNormal, BasicBlock *IfException,
|
2005-01-29 01:35:16 +01:00
|
|
|
const std::vector<Value*> &Params) {
|
|
|
|
NumOperands = 3+Params.size();
|
|
|
|
Use *OL = OperandList = new Use[3+Params.size()];
|
|
|
|
OL[0].init(Fn, this);
|
|
|
|
OL[1].init(IfNormal, this);
|
|
|
|
OL[2].init(IfException, this);
|
2005-04-22 01:48:37 +02:00
|
|
|
const FunctionType *FTy =
|
2004-07-29 14:33:25 +02:00
|
|
|
cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType());
|
2005-04-22 01:48:37 +02:00
|
|
|
|
|
|
|
assert((Params.size() == FTy->getNumParams()) ||
|
2005-01-29 01:35:16 +01:00
|
|
|
(FTy->isVarArg() && Params.size() > FTy->getNumParams()) &&
|
2004-07-29 14:33:25 +02:00
|
|
|
"Calling a function with bad signature");
|
2005-04-22 01:48:37 +02:00
|
|
|
|
2006-05-03 02:48:22 +02:00
|
|
|
for (unsigned i = 0, e = Params.size(); i != e; i++) {
|
|
|
|
assert((i >= FTy->getNumParams() ||
|
|
|
|
FTy->getParamType(i) == Params[i]->getType()) &&
|
|
|
|
"Invoking a function with a bad signature!");
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
OL[i+3].init(Params[i], this);
|
2006-05-03 02:48:22 +02:00
|
|
|
}
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
InvokeInst::InvokeInst(Value *Fn, BasicBlock *IfNormal,
|
|
|
|
BasicBlock *IfException,
|
|
|
|
const std::vector<Value*> &Params,
|
|
|
|
const std::string &Name, Instruction *InsertBefore)
|
|
|
|
: TerminatorInst(cast<FunctionType>(cast<PointerType>(Fn->getType())
|
|
|
|
->getElementType())->getReturnType(),
|
2005-01-29 01:35:16 +01:00
|
|
|
Instruction::Invoke, 0, 0, Name, InsertBefore) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Fn, IfNormal, IfException, Params);
|
|
|
|
}
|
|
|
|
|
|
|
|
InvokeInst::InvokeInst(Value *Fn, BasicBlock *IfNormal,
|
|
|
|
BasicBlock *IfException,
|
|
|
|
const std::vector<Value*> &Params,
|
|
|
|
const std::string &Name, BasicBlock *InsertAtEnd)
|
|
|
|
: TerminatorInst(cast<FunctionType>(cast<PointerType>(Fn->getType())
|
|
|
|
->getElementType())->getReturnType(),
|
2005-01-29 01:35:16 +01:00
|
|
|
Instruction::Invoke, 0, 0, Name, InsertAtEnd) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Fn, IfNormal, IfException, Params);
|
|
|
|
}
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
InvokeInst::InvokeInst(const InvokeInst &II)
|
2005-01-29 01:35:16 +01:00
|
|
|
: TerminatorInst(II.getType(), Instruction::Invoke,
|
|
|
|
new Use[II.getNumOperands()], II.getNumOperands()) {
|
2005-05-06 22:26:43 +02:00
|
|
|
SubclassData = II.SubclassData;
|
2005-01-29 01:35:16 +01:00
|
|
|
Use *OL = OperandList, *InOL = II.OperandList;
|
|
|
|
for (unsigned i = 0, e = II.getNumOperands(); i != e; ++i)
|
|
|
|
OL[i].init(InOL[i], this);
|
|
|
|
}
|
|
|
|
|
|
|
|
BasicBlock *InvokeInst::getSuccessorV(unsigned idx) const {
|
|
|
|
return getSuccessor(idx);
|
|
|
|
}
|
|
|
|
unsigned InvokeInst::getNumSuccessorsV() const {
|
|
|
|
return getNumSuccessors();
|
|
|
|
}
|
|
|
|
void InvokeInst::setSuccessorV(unsigned idx, BasicBlock *B) {
|
|
|
|
return setSuccessor(idx, B);
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// ReturnInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
void ReturnInst::init(Value *retVal) {
|
|
|
|
if (retVal && retVal->getType() != Type::VoidTy) {
|
2005-04-22 01:48:37 +02:00
|
|
|
assert(!isa<BasicBlock>(retVal) &&
|
2004-11-17 22:02:25 +01:00
|
|
|
"Cannot return basic block. Probably using the incorrect ctor");
|
2005-01-29 01:35:16 +01:00
|
|
|
NumOperands = 1;
|
|
|
|
RetVal.init(retVal, this);
|
2004-11-17 22:02:25 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
unsigned ReturnInst::getNumSuccessorsV() const {
|
|
|
|
return getNumSuccessors();
|
|
|
|
}
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
// Out-of-line ReturnInst method, put here so the C++ compiler can choose to
|
|
|
|
// emit the vtable for the class in this translation unit.
|
2005-01-29 01:35:16 +01:00
|
|
|
void ReturnInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
|
2004-07-29 14:33:25 +02:00
|
|
|
assert(0 && "ReturnInst has no successors!");
|
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
BasicBlock *ReturnInst::getSuccessorV(unsigned idx) const {
|
|
|
|
assert(0 && "ReturnInst has no successors!");
|
|
|
|
abort();
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// UnwindInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
unsigned UnwindInst::getNumSuccessorsV() const {
|
|
|
|
return getNumSuccessors();
|
|
|
|
}
|
|
|
|
|
|
|
|
void UnwindInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
|
2004-07-29 14:33:25 +02:00
|
|
|
assert(0 && "UnwindInst has no successors!");
|
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
BasicBlock *UnwindInst::getSuccessorV(unsigned idx) const {
|
|
|
|
assert(0 && "UnwindInst has no successors!");
|
|
|
|
abort();
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2004-10-16 20:08:06 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// UnreachableInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
unsigned UnreachableInst::getNumSuccessorsV() const {
|
|
|
|
return getNumSuccessors();
|
|
|
|
}
|
|
|
|
|
|
|
|
void UnreachableInst::setSuccessorV(unsigned idx, BasicBlock *NewSucc) {
|
|
|
|
assert(0 && "UnwindInst has no successors!");
|
|
|
|
}
|
|
|
|
|
|
|
|
BasicBlock *UnreachableInst::getSuccessorV(unsigned idx) const {
|
|
|
|
assert(0 && "UnwindInst has no successors!");
|
|
|
|
abort();
|
|
|
|
return 0;
|
2004-10-16 20:08:06 +02:00
|
|
|
}
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// BranchInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
void BranchInst::AssertOK() {
|
|
|
|
if (isConditional())
|
2005-04-22 01:48:37 +02:00
|
|
|
assert(getCondition()->getType() == Type::BoolTy &&
|
2005-01-29 01:35:16 +01:00
|
|
|
"May only branch on boolean predicates!");
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
BranchInst::BranchInst(const BranchInst &BI) :
|
|
|
|
TerminatorInst(Instruction::Br, Ops, BI.getNumOperands()) {
|
|
|
|
OperandList[0].init(BI.getOperand(0), this);
|
|
|
|
if (BI.getNumOperands() != 1) {
|
|
|
|
assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!");
|
|
|
|
OperandList[1].init(BI.getOperand(1), this);
|
|
|
|
OperandList[2].init(BI.getOperand(2), this);
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
BasicBlock *BranchInst::getSuccessorV(unsigned idx) const {
|
|
|
|
return getSuccessor(idx);
|
|
|
|
}
|
|
|
|
unsigned BranchInst::getNumSuccessorsV() const {
|
|
|
|
return getNumSuccessors();
|
|
|
|
}
|
|
|
|
void BranchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
|
|
|
|
setSuccessor(idx, B);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AllocationInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
static Value *getAISize(Value *Amt) {
|
|
|
|
if (!Amt)
|
2006-10-20 09:07:24 +02:00
|
|
|
Amt = ConstantInt::get(Type::UIntTy, 1);
|
2006-05-10 06:32:43 +02:00
|
|
|
else {
|
|
|
|
assert(!isa<BasicBlock>(Amt) &&
|
|
|
|
"Passed basic block into allocation size parameter! Ue other ctor");
|
2005-01-29 01:35:16 +01:00
|
|
|
assert(Amt->getType() == Type::UIntTy &&
|
|
|
|
"Malloc/Allocation array size != UIntTy!");
|
2006-05-10 06:32:43 +02:00
|
|
|
}
|
2005-04-22 01:48:37 +02:00
|
|
|
return Amt;
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
|
2005-11-05 10:21:28 +01:00
|
|
|
unsigned Align, const std::string &Name,
|
2004-07-29 14:33:25 +02:00
|
|
|
Instruction *InsertBefore)
|
2005-01-29 01:35:16 +01:00
|
|
|
: UnaryInstruction(PointerType::get(Ty), iTy, getAISize(ArraySize),
|
2005-11-05 10:21:28 +01:00
|
|
|
Name, InsertBefore), Alignment(Align) {
|
2005-11-05 22:57:54 +01:00
|
|
|
assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
|
2005-01-29 01:35:16 +01:00
|
|
|
assert(Ty != Type::VoidTy && "Cannot allocate void!");
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
|
2005-11-05 10:21:28 +01:00
|
|
|
unsigned Align, const std::string &Name,
|
2004-07-29 14:33:25 +02:00
|
|
|
BasicBlock *InsertAtEnd)
|
2005-01-29 01:35:16 +01:00
|
|
|
: UnaryInstruction(PointerType::get(Ty), iTy, getAISize(ArraySize),
|
2005-11-05 10:21:28 +01:00
|
|
|
Name, InsertAtEnd), Alignment(Align) {
|
2005-11-05 22:57:54 +01:00
|
|
|
assert((Align & (Align-1)) == 0 && "Alignment is not a power of 2!");
|
2005-01-29 01:35:16 +01:00
|
|
|
assert(Ty != Type::VoidTy && "Cannot allocate void!");
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2006-06-21 18:53:47 +02:00
|
|
|
// Out of line virtual method, so the vtable, etc has a home.
|
|
|
|
AllocationInst::~AllocationInst() {
|
|
|
|
}
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
bool AllocationInst::isArrayAllocation() const {
|
2006-10-20 09:07:24 +02:00
|
|
|
if (ConstantInt *CUI = dyn_cast<ConstantInt>(getOperand(0)))
|
|
|
|
return CUI->getZExtValue() != 1;
|
2005-01-29 01:35:16 +01:00
|
|
|
return true;
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
const Type *AllocationInst::getAllocatedType() const {
|
|
|
|
return getType()->getElementType();
|
|
|
|
}
|
|
|
|
|
|
|
|
AllocaInst::AllocaInst(const AllocaInst &AI)
|
|
|
|
: AllocationInst(AI.getType()->getElementType(), (Value*)AI.getOperand(0),
|
2005-11-05 10:21:28 +01:00
|
|
|
Instruction::Alloca, AI.getAlignment()) {
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
MallocInst::MallocInst(const MallocInst &MI)
|
|
|
|
: AllocationInst(MI.getType()->getElementType(), (Value*)MI.getOperand(0),
|
2005-11-05 10:21:28 +01:00
|
|
|
Instruction::Malloc, MI.getAlignment()) {
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// FreeInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
void FreeInst::AssertOK() {
|
|
|
|
assert(isa<PointerType>(getOperand(0)->getType()) &&
|
|
|
|
"Can not free something of nonpointer type!");
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
FreeInst::FreeInst(Value *Ptr, Instruction *InsertBefore)
|
2005-01-29 01:35:16 +01:00
|
|
|
: UnaryInstruction(Type::VoidTy, Free, Ptr, "", InsertBefore) {
|
|
|
|
AssertOK();
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
FreeInst::FreeInst(Value *Ptr, BasicBlock *InsertAtEnd)
|
2005-01-29 01:35:16 +01:00
|
|
|
: UnaryInstruction(Type::VoidTy, Free, Ptr, "", InsertAtEnd) {
|
|
|
|
AssertOK();
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// LoadInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
void LoadInst::AssertOK() {
|
2005-04-22 01:48:37 +02:00
|
|
|
assert(isa<PointerType>(getOperand(0)->getType()) &&
|
2004-07-29 14:33:25 +02:00
|
|
|
"Ptr must have pointer type.");
|
|
|
|
}
|
|
|
|
|
|
|
|
LoadInst::LoadInst(Value *Ptr, const std::string &Name, Instruction *InsertBef)
|
2005-01-29 01:35:16 +01:00
|
|
|
: UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
|
2005-02-05 02:38:38 +01:00
|
|
|
Load, Ptr, Name, InsertBef) {
|
|
|
|
setVolatile(false);
|
2005-01-29 01:35:16 +01:00
|
|
|
AssertOK();
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
LoadInst::LoadInst(Value *Ptr, const std::string &Name, BasicBlock *InsertAE)
|
2005-01-29 01:35:16 +01:00
|
|
|
: UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
|
2005-02-05 02:38:38 +01:00
|
|
|
Load, Ptr, Name, InsertAE) {
|
|
|
|
setVolatile(false);
|
2005-01-29 01:35:16 +01:00
|
|
|
AssertOK();
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
|
|
|
|
Instruction *InsertBef)
|
2005-01-29 01:35:16 +01:00
|
|
|
: UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
|
2005-02-05 02:38:38 +01:00
|
|
|
Load, Ptr, Name, InsertBef) {
|
|
|
|
setVolatile(isVolatile);
|
2005-01-29 01:35:16 +01:00
|
|
|
AssertOK();
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
LoadInst::LoadInst(Value *Ptr, const std::string &Name, bool isVolatile,
|
|
|
|
BasicBlock *InsertAE)
|
2005-01-29 01:35:16 +01:00
|
|
|
: UnaryInstruction(cast<PointerType>(Ptr->getType())->getElementType(),
|
2005-02-05 02:38:38 +01:00
|
|
|
Load, Ptr, Name, InsertAE) {
|
|
|
|
setVolatile(isVolatile);
|
2005-01-29 01:35:16 +01:00
|
|
|
AssertOK();
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// StoreInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
void StoreInst::AssertOK() {
|
|
|
|
assert(isa<PointerType>(getOperand(1)->getType()) &&
|
|
|
|
"Ptr must have pointer type!");
|
|
|
|
assert(getOperand(0)->getType() ==
|
|
|
|
cast<PointerType>(getOperand(1)->getType())->getElementType()
|
|
|
|
&& "Ptr must be a pointer to Val type!");
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
|
2005-02-05 02:38:38 +01:00
|
|
|
: Instruction(Type::VoidTy, Store, Ops, 2, "", InsertBefore) {
|
2005-01-29 01:35:16 +01:00
|
|
|
Ops[0].init(val, this);
|
|
|
|
Ops[1].init(addr, this);
|
2005-02-05 02:38:38 +01:00
|
|
|
setVolatile(false);
|
2005-01-29 01:35:16 +01:00
|
|
|
AssertOK();
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
|
2005-02-05 02:38:38 +01:00
|
|
|
: Instruction(Type::VoidTy, Store, Ops, 2, "", InsertAtEnd) {
|
2005-01-29 01:35:16 +01:00
|
|
|
Ops[0].init(val, this);
|
|
|
|
Ops[1].init(addr, this);
|
2005-02-05 02:38:38 +01:00
|
|
|
setVolatile(false);
|
2005-01-29 01:35:16 +01:00
|
|
|
AssertOK();
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
|
2005-01-29 01:35:16 +01:00
|
|
|
Instruction *InsertBefore)
|
2005-02-05 02:38:38 +01:00
|
|
|
: Instruction(Type::VoidTy, Store, Ops, 2, "", InsertBefore) {
|
2005-01-29 01:35:16 +01:00
|
|
|
Ops[0].init(val, this);
|
|
|
|
Ops[1].init(addr, this);
|
2005-02-05 02:38:38 +01:00
|
|
|
setVolatile(isVolatile);
|
2005-01-29 01:35:16 +01:00
|
|
|
AssertOK();
|
|
|
|
}
|
2004-07-29 14:33:25 +02:00
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
|
2005-01-29 01:35:16 +01:00
|
|
|
BasicBlock *InsertAtEnd)
|
2005-02-05 02:38:38 +01:00
|
|
|
: Instruction(Type::VoidTy, Store, Ops, 2, "", InsertAtEnd) {
|
2005-01-29 01:35:16 +01:00
|
|
|
Ops[0].init(val, this);
|
|
|
|
Ops[1].init(addr, this);
|
2005-02-05 02:38:38 +01:00
|
|
|
setVolatile(isVolatile);
|
2005-01-29 01:35:16 +01:00
|
|
|
AssertOK();
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// GetElementPtrInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// checkType - Simple wrapper function to give a better assertion failure
|
|
|
|
// message on bad indexes for a gep instruction.
|
|
|
|
//
|
|
|
|
static inline const Type *checkType(const Type *Ty) {
|
2006-05-14 20:34:36 +02:00
|
|
|
assert(Ty && "Invalid GetElementPtrInst indices for type!");
|
2004-07-29 14:33:25 +02:00
|
|
|
return Ty;
|
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
void GetElementPtrInst::init(Value *Ptr, const std::vector<Value*> &Idx) {
|
|
|
|
NumOperands = 1+Idx.size();
|
|
|
|
Use *OL = OperandList = new Use[NumOperands];
|
|
|
|
OL[0].init(Ptr, this);
|
2004-07-29 14:33:25 +02:00
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
for (unsigned i = 0, e = Idx.size(); i != e; ++i)
|
|
|
|
OL[i+1].init(Idx[i], this);
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void GetElementPtrInst::init(Value *Ptr, Value *Idx0, Value *Idx1) {
|
2005-01-29 01:35:16 +01:00
|
|
|
NumOperands = 3;
|
|
|
|
Use *OL = OperandList = new Use[3];
|
|
|
|
OL[0].init(Ptr, this);
|
|
|
|
OL[1].init(Idx0, this);
|
|
|
|
OL[2].init(Idx1, this);
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-05-03 07:43:30 +02:00
|
|
|
void GetElementPtrInst::init(Value *Ptr, Value *Idx) {
|
|
|
|
NumOperands = 2;
|
|
|
|
Use *OL = OperandList = new Use[2];
|
|
|
|
OL[0].init(Ptr, this);
|
|
|
|
OL[1].init(Idx, this);
|
|
|
|
}
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
GetElementPtrInst::GetElementPtrInst(Value *Ptr, const std::vector<Value*> &Idx,
|
2005-03-16 06:42:00 +01:00
|
|
|
const std::string &Name, Instruction *InBe)
|
2004-07-29 14:33:25 +02:00
|
|
|
: Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
|
|
|
|
Idx, true))),
|
2005-01-29 01:35:16 +01:00
|
|
|
GetElementPtr, 0, 0, Name, InBe) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Ptr, Idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
GetElementPtrInst::GetElementPtrInst(Value *Ptr, const std::vector<Value*> &Idx,
|
2005-03-16 06:42:00 +01:00
|
|
|
const std::string &Name, BasicBlock *IAE)
|
2004-07-29 14:33:25 +02:00
|
|
|
: Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
|
|
|
|
Idx, true))),
|
2005-01-29 01:35:16 +01:00
|
|
|
GetElementPtr, 0, 0, Name, IAE) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Ptr, Idx);
|
|
|
|
}
|
|
|
|
|
2005-05-03 07:43:30 +02:00
|
|
|
GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
|
|
|
|
const std::string &Name, Instruction *InBe)
|
|
|
|
: Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx))),
|
|
|
|
GetElementPtr, 0, 0, Name, InBe) {
|
|
|
|
init(Ptr, Idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx,
|
|
|
|
const std::string &Name, BasicBlock *IAE)
|
|
|
|
: Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),Idx))),
|
|
|
|
GetElementPtr, 0, 0, Name, IAE) {
|
|
|
|
init(Ptr, Idx);
|
|
|
|
}
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx0, Value *Idx1,
|
|
|
|
const std::string &Name, Instruction *InBe)
|
|
|
|
: Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
|
|
|
|
Idx0, Idx1, true))),
|
2005-01-29 01:35:16 +01:00
|
|
|
GetElementPtr, 0, 0, Name, InBe) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Ptr, Idx0, Idx1);
|
|
|
|
}
|
|
|
|
|
|
|
|
GetElementPtrInst::GetElementPtrInst(Value *Ptr, Value *Idx0, Value *Idx1,
|
2005-03-16 06:42:00 +01:00
|
|
|
const std::string &Name, BasicBlock *IAE)
|
2004-07-29 14:33:25 +02:00
|
|
|
: Instruction(PointerType::get(checkType(getIndexedType(Ptr->getType(),
|
|
|
|
Idx0, Idx1, true))),
|
2005-01-29 01:35:16 +01:00
|
|
|
GetElementPtr, 0, 0, Name, IAE) {
|
2004-07-29 14:33:25 +02:00
|
|
|
init(Ptr, Idx0, Idx1);
|
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
GetElementPtrInst::~GetElementPtrInst() {
|
|
|
|
delete[] OperandList;
|
|
|
|
}
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
// getIndexedType - Returns the type of the element that would be loaded with
|
|
|
|
// a load instruction with the specified parameters.
|
|
|
|
//
|
2005-04-22 01:48:37 +02:00
|
|
|
// A null type is returned if the indices are invalid for the specified
|
2004-07-29 14:33:25 +02:00
|
|
|
// pointer type.
|
|
|
|
//
|
2005-04-22 01:48:37 +02:00
|
|
|
const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
|
2004-07-29 14:33:25 +02:00
|
|
|
const std::vector<Value*> &Idx,
|
|
|
|
bool AllowCompositeLeaf) {
|
|
|
|
if (!isa<PointerType>(Ptr)) return 0; // Type isn't a pointer type!
|
|
|
|
|
|
|
|
// Handle the special case of the empty set index set...
|
|
|
|
if (Idx.empty())
|
|
|
|
if (AllowCompositeLeaf ||
|
|
|
|
cast<PointerType>(Ptr)->getElementType()->isFirstClassType())
|
|
|
|
return cast<PointerType>(Ptr)->getElementType();
|
|
|
|
else
|
|
|
|
return 0;
|
2005-04-22 01:48:37 +02:00
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
unsigned CurIdx = 0;
|
|
|
|
while (const CompositeType *CT = dyn_cast<CompositeType>(Ptr)) {
|
|
|
|
if (Idx.size() == CurIdx) {
|
|
|
|
if (AllowCompositeLeaf || CT->isFirstClassType()) return Ptr;
|
|
|
|
return 0; // Can't load a whole structure or array!?!?
|
|
|
|
}
|
|
|
|
|
|
|
|
Value *Index = Idx[CurIdx++];
|
|
|
|
if (isa<PointerType>(CT) && CurIdx != 1)
|
|
|
|
return 0; // Can only index into pointer types at the first index!
|
|
|
|
if (!CT->indexValid(Index)) return 0;
|
|
|
|
Ptr = CT->getTypeAtIndex(Index);
|
|
|
|
|
|
|
|
// If the new type forwards to another type, then it is in the middle
|
|
|
|
// of being refined to another type (and hence, may have dropped all
|
|
|
|
// references to what it was using before). So, use the new forwarded
|
|
|
|
// type.
|
|
|
|
if (const Type * Ty = Ptr->getForwardedType()) {
|
|
|
|
Ptr = Ty;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return CurIdx == Idx.size() ? Ptr : 0;
|
|
|
|
}
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
const Type* GetElementPtrInst::getIndexedType(const Type *Ptr,
|
2004-07-29 14:33:25 +02:00
|
|
|
Value *Idx0, Value *Idx1,
|
|
|
|
bool AllowCompositeLeaf) {
|
|
|
|
const PointerType *PTy = dyn_cast<PointerType>(Ptr);
|
|
|
|
if (!PTy) return 0; // Type isn't a pointer type!
|
|
|
|
|
|
|
|
// Check the pointer index.
|
|
|
|
if (!PTy->indexValid(Idx0)) return 0;
|
|
|
|
|
|
|
|
const CompositeType *CT = dyn_cast<CompositeType>(PTy->getElementType());
|
|
|
|
if (!CT || !CT->indexValid(Idx1)) return 0;
|
|
|
|
|
|
|
|
const Type *ElTy = CT->getTypeAtIndex(Idx1);
|
|
|
|
if (AllowCompositeLeaf || ElTy->isFirstClassType())
|
|
|
|
return ElTy;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-05-03 07:43:30 +02:00
|
|
|
const Type* GetElementPtrInst::getIndexedType(const Type *Ptr, Value *Idx) {
|
|
|
|
const PointerType *PTy = dyn_cast<PointerType>(Ptr);
|
|
|
|
if (!PTy) return 0; // Type isn't a pointer type!
|
|
|
|
|
|
|
|
// Check the pointer index.
|
|
|
|
if (!PTy->indexValid(Idx)) return 0;
|
|
|
|
|
2005-05-03 18:44:45 +02:00
|
|
|
return PTy->getElementType();
|
2005-05-03 07:43:30 +02:00
|
|
|
}
|
|
|
|
|
2006-01-10 20:05:34 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// ExtractElementInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
|
2006-04-08 03:18:18 +02:00
|
|
|
const std::string &Name,
|
|
|
|
Instruction *InsertBef)
|
2006-01-10 20:05:34 +01:00
|
|
|
: Instruction(cast<PackedType>(Val->getType())->getElementType(),
|
|
|
|
ExtractElement, Ops, 2, Name, InsertBef) {
|
2006-04-08 06:05:48 +02:00
|
|
|
assert(isValidOperands(Val, Index) &&
|
|
|
|
"Invalid extractelement instruction operands!");
|
2006-01-10 20:05:34 +01:00
|
|
|
Ops[0].init(Val, this);
|
|
|
|
Ops[1].init(Index, this);
|
|
|
|
}
|
|
|
|
|
2006-10-05 08:24:58 +02:00
|
|
|
ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
|
|
|
|
const std::string &Name,
|
|
|
|
Instruction *InsertBef)
|
|
|
|
: Instruction(cast<PackedType>(Val->getType())->getElementType(),
|
|
|
|
ExtractElement, Ops, 2, Name, InsertBef) {
|
2006-10-20 09:07:24 +02:00
|
|
|
Constant *Index = ConstantInt::get(Type::UIntTy, IndexV);
|
2006-10-05 08:24:58 +02:00
|
|
|
assert(isValidOperands(Val, Index) &&
|
|
|
|
"Invalid extractelement instruction operands!");
|
|
|
|
Ops[0].init(Val, this);
|
|
|
|
Ops[1].init(Index, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-01-10 20:05:34 +01:00
|
|
|
ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
|
2006-04-08 03:18:18 +02:00
|
|
|
const std::string &Name,
|
|
|
|
BasicBlock *InsertAE)
|
2006-01-10 20:05:34 +01:00
|
|
|
: Instruction(cast<PackedType>(Val->getType())->getElementType(),
|
|
|
|
ExtractElement, Ops, 2, Name, InsertAE) {
|
2006-04-08 06:05:48 +02:00
|
|
|
assert(isValidOperands(Val, Index) &&
|
|
|
|
"Invalid extractelement instruction operands!");
|
|
|
|
|
2006-01-10 20:05:34 +01:00
|
|
|
Ops[0].init(Val, this);
|
|
|
|
Ops[1].init(Index, this);
|
|
|
|
}
|
|
|
|
|
2006-10-05 08:24:58 +02:00
|
|
|
ExtractElementInst::ExtractElementInst(Value *Val, unsigned IndexV,
|
|
|
|
const std::string &Name,
|
|
|
|
BasicBlock *InsertAE)
|
|
|
|
: Instruction(cast<PackedType>(Val->getType())->getElementType(),
|
|
|
|
ExtractElement, Ops, 2, Name, InsertAE) {
|
2006-10-20 09:07:24 +02:00
|
|
|
Constant *Index = ConstantInt::get(Type::UIntTy, IndexV);
|
2006-10-05 08:24:58 +02:00
|
|
|
assert(isValidOperands(Val, Index) &&
|
|
|
|
"Invalid extractelement instruction operands!");
|
|
|
|
|
|
|
|
Ops[0].init(Val, this);
|
|
|
|
Ops[1].init(Index, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-04-08 06:05:48 +02:00
|
|
|
bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
|
|
|
|
if (!isa<PackedType>(Val->getType()) || Index->getType() != Type::UIntTy)
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-01-17 21:07:22 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// InsertElementInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-04-15 00:20:32 +02:00
|
|
|
InsertElementInst::InsertElementInst(const InsertElementInst &IE)
|
|
|
|
: Instruction(IE.getType(), InsertElement, Ops, 3) {
|
|
|
|
Ops[0].init(IE.Ops[0], this);
|
|
|
|
Ops[1].init(IE.Ops[1], this);
|
|
|
|
Ops[2].init(IE.Ops[2], this);
|
|
|
|
}
|
2006-04-08 06:05:48 +02:00
|
|
|
InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
|
2006-04-08 03:18:18 +02:00
|
|
|
const std::string &Name,
|
|
|
|
Instruction *InsertBef)
|
2006-04-08 06:05:48 +02:00
|
|
|
: Instruction(Vec->getType(), InsertElement, Ops, 3, Name, InsertBef) {
|
|
|
|
assert(isValidOperands(Vec, Elt, Index) &&
|
|
|
|
"Invalid insertelement instruction operands!");
|
|
|
|
Ops[0].init(Vec, this);
|
2006-01-17 21:07:22 +01:00
|
|
|
Ops[1].init(Elt, this);
|
|
|
|
Ops[2].init(Index, this);
|
|
|
|
}
|
|
|
|
|
2006-10-05 08:24:58 +02:00
|
|
|
InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
|
|
|
|
const std::string &Name,
|
|
|
|
Instruction *InsertBef)
|
|
|
|
: Instruction(Vec->getType(), InsertElement, Ops, 3, Name, InsertBef) {
|
2006-10-20 09:07:24 +02:00
|
|
|
Constant *Index = ConstantInt::get(Type::UIntTy, IndexV);
|
2006-10-05 08:24:58 +02:00
|
|
|
assert(isValidOperands(Vec, Elt, Index) &&
|
|
|
|
"Invalid insertelement instruction operands!");
|
|
|
|
Ops[0].init(Vec, this);
|
|
|
|
Ops[1].init(Elt, this);
|
|
|
|
Ops[2].init(Index, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-04-08 06:05:48 +02:00
|
|
|
InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
|
2006-04-08 03:18:18 +02:00
|
|
|
const std::string &Name,
|
|
|
|
BasicBlock *InsertAE)
|
2006-04-08 06:05:48 +02:00
|
|
|
: Instruction(Vec->getType(), InsertElement, Ops, 3, Name, InsertAE) {
|
|
|
|
assert(isValidOperands(Vec, Elt, Index) &&
|
|
|
|
"Invalid insertelement instruction operands!");
|
|
|
|
|
|
|
|
Ops[0].init(Vec, this);
|
2006-01-17 21:07:22 +01:00
|
|
|
Ops[1].init(Elt, this);
|
|
|
|
Ops[2].init(Index, this);
|
|
|
|
}
|
|
|
|
|
2006-10-05 08:24:58 +02:00
|
|
|
InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, unsigned IndexV,
|
|
|
|
const std::string &Name,
|
|
|
|
BasicBlock *InsertAE)
|
|
|
|
: Instruction(Vec->getType(), InsertElement, Ops, 3, Name, InsertAE) {
|
2006-10-20 09:07:24 +02:00
|
|
|
Constant *Index = ConstantInt::get(Type::UIntTy, IndexV);
|
2006-10-05 08:24:58 +02:00
|
|
|
assert(isValidOperands(Vec, Elt, Index) &&
|
|
|
|
"Invalid insertelement instruction operands!");
|
|
|
|
|
|
|
|
Ops[0].init(Vec, this);
|
|
|
|
Ops[1].init(Elt, this);
|
|
|
|
Ops[2].init(Index, this);
|
|
|
|
}
|
|
|
|
|
2006-04-08 06:05:48 +02:00
|
|
|
bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
|
|
|
|
const Value *Index) {
|
|
|
|
if (!isa<PackedType>(Vec->getType()))
|
|
|
|
return false; // First operand of insertelement must be packed type.
|
|
|
|
|
|
|
|
if (Elt->getType() != cast<PackedType>(Vec->getType())->getElementType())
|
|
|
|
return false;// Second operand of insertelement must be packed element type.
|
|
|
|
|
|
|
|
if (Index->getType() != Type::UIntTy)
|
|
|
|
return false; // Third operand of insertelement must be uint.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-04-08 03:18:18 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// ShuffleVectorInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-04-15 00:20:32 +02:00
|
|
|
ShuffleVectorInst::ShuffleVectorInst(const ShuffleVectorInst &SV)
|
|
|
|
: Instruction(SV.getType(), ShuffleVector, Ops, 3) {
|
|
|
|
Ops[0].init(SV.Ops[0], this);
|
|
|
|
Ops[1].init(SV.Ops[1], this);
|
|
|
|
Ops[2].init(SV.Ops[2], this);
|
|
|
|
}
|
|
|
|
|
2006-04-08 03:18:18 +02:00
|
|
|
ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
|
|
|
|
const std::string &Name,
|
|
|
|
Instruction *InsertBefore)
|
|
|
|
: Instruction(V1->getType(), ShuffleVector, Ops, 3, Name, InsertBefore) {
|
|
|
|
assert(isValidOperands(V1, V2, Mask) &&
|
|
|
|
"Invalid shuffle vector instruction operands!");
|
|
|
|
Ops[0].init(V1, this);
|
|
|
|
Ops[1].init(V2, this);
|
|
|
|
Ops[2].init(Mask, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
|
|
|
|
const std::string &Name,
|
|
|
|
BasicBlock *InsertAtEnd)
|
|
|
|
: Instruction(V1->getType(), ShuffleVector, Ops, 3, Name, InsertAtEnd) {
|
|
|
|
assert(isValidOperands(V1, V2, Mask) &&
|
|
|
|
"Invalid shuffle vector instruction operands!");
|
|
|
|
|
|
|
|
Ops[0].init(V1, this);
|
|
|
|
Ops[1].init(V2, this);
|
|
|
|
Ops[2].init(Mask, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
|
|
|
|
const Value *Mask) {
|
|
|
|
if (!isa<PackedType>(V1->getType())) return false;
|
|
|
|
if (V1->getType() != V2->getType()) return false;
|
|
|
|
if (!isa<PackedType>(Mask->getType()) ||
|
|
|
|
cast<PackedType>(Mask->getType())->getElementType() != Type::UIntTy ||
|
|
|
|
cast<PackedType>(Mask->getType())->getNumElements() !=
|
|
|
|
cast<PackedType>(V1->getType())->getNumElements())
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// BinaryOperator Class
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
void BinaryOperator::init(BinaryOps iType)
|
2004-07-29 14:33:25 +02:00
|
|
|
{
|
2005-01-29 01:35:16 +01:00
|
|
|
Value *LHS = getOperand(0), *RHS = getOperand(1);
|
|
|
|
assert(LHS->getType() == RHS->getType() &&
|
|
|
|
"Binary operator operand types must match!");
|
2004-07-29 14:33:25 +02:00
|
|
|
#ifndef NDEBUG
|
|
|
|
switch (iType) {
|
|
|
|
case Add: case Sub:
|
2006-10-26 08:15:43 +02:00
|
|
|
case Mul:
|
2005-01-29 01:35:16 +01:00
|
|
|
assert(getType() == LHS->getType() &&
|
2004-07-29 14:33:25 +02:00
|
|
|
"Arithmetic operation should return same type as operands!");
|
2005-12-21 19:22:19 +01:00
|
|
|
assert((getType()->isInteger() || getType()->isFloatingPoint() ||
|
|
|
|
isa<PackedType>(getType())) &&
|
2004-08-20 08:00:58 +02:00
|
|
|
"Tried to create an arithmetic operation on a non-arithmetic type!");
|
2004-07-29 14:33:25 +02:00
|
|
|
break;
|
2006-10-26 08:15:43 +02:00
|
|
|
case UDiv:
|
|
|
|
case SDiv:
|
|
|
|
assert(getType() == LHS->getType() &&
|
|
|
|
"Arithmetic operation should return same type as operands!");
|
|
|
|
assert((getType()->isInteger() || (isa<PackedType>(getType()) &&
|
|
|
|
cast<PackedType>(getType())->getElementType()->isInteger())) &&
|
|
|
|
"Incorrect operand type (not integer) for S/UDIV");
|
|
|
|
break;
|
|
|
|
case FDiv:
|
|
|
|
assert(getType() == LHS->getType() &&
|
|
|
|
"Arithmetic operation should return same type as operands!");
|
|
|
|
assert((getType()->isFloatingPoint() || (isa<PackedType>(getType()) &&
|
|
|
|
cast<PackedType>(getType())->getElementType()->isFloatingPoint()))
|
|
|
|
&& "Incorrect operand type (not floating point) for FDIV");
|
|
|
|
break;
|
2006-11-02 02:53:59 +01:00
|
|
|
case URem:
|
|
|
|
case SRem:
|
|
|
|
assert(getType() == LHS->getType() &&
|
|
|
|
"Arithmetic operation should return same type as operands!");
|
|
|
|
assert((getType()->isInteger() || (isa<PackedType>(getType()) &&
|
|
|
|
cast<PackedType>(getType())->getElementType()->isInteger())) &&
|
|
|
|
"Incorrect operand type (not integer) for S/UREM");
|
|
|
|
break;
|
|
|
|
case FRem:
|
|
|
|
assert(getType() == LHS->getType() &&
|
|
|
|
"Arithmetic operation should return same type as operands!");
|
|
|
|
assert((getType()->isFloatingPoint() || (isa<PackedType>(getType()) &&
|
|
|
|
cast<PackedType>(getType())->getElementType()->isFloatingPoint()))
|
|
|
|
&& "Incorrect operand type (not floating point) for FREM");
|
|
|
|
break;
|
2004-07-29 14:33:25 +02:00
|
|
|
case And: case Or:
|
|
|
|
case Xor:
|
2005-01-29 01:35:16 +01:00
|
|
|
assert(getType() == LHS->getType() &&
|
2004-07-29 14:33:25 +02:00
|
|
|
"Logical operation should return same type as operands!");
|
2005-12-21 19:22:19 +01:00
|
|
|
assert((getType()->isIntegral() ||
|
|
|
|
(isa<PackedType>(getType()) &&
|
|
|
|
cast<PackedType>(getType())->getElementType()->isIntegral())) &&
|
2005-01-27 07:46:38 +01:00
|
|
|
"Tried to create a logical operation on a non-integral type!");
|
2004-07-29 14:33:25 +02:00
|
|
|
break;
|
|
|
|
case SetLT: case SetGT: case SetLE:
|
|
|
|
case SetGE: case SetEQ: case SetNE:
|
|
|
|
assert(getType() == Type::BoolTy && "Setcc must return bool!");
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
|
2005-03-16 06:42:00 +01:00
|
|
|
const std::string &Name,
|
2004-07-29 14:33:25 +02:00
|
|
|
Instruction *InsertBefore) {
|
|
|
|
assert(S1->getType() == S2->getType() &&
|
|
|
|
"Cannot create binary operator with two operands of differing type!");
|
|
|
|
switch (Op) {
|
|
|
|
// Binary comparison operators...
|
|
|
|
case SetLT: case SetGT: case SetLE:
|
|
|
|
case SetGE: case SetEQ: case SetNE:
|
|
|
|
return new SetCondInst(Op, S1, S2, Name, InsertBefore);
|
|
|
|
|
|
|
|
default:
|
|
|
|
return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
|
2005-03-16 06:42:00 +01:00
|
|
|
const std::string &Name,
|
2004-07-29 14:33:25 +02:00
|
|
|
BasicBlock *InsertAtEnd) {
|
|
|
|
BinaryOperator *Res = create(Op, S1, S2, Name);
|
|
|
|
InsertAtEnd->getInstList().push_back(Res);
|
|
|
|
return Res;
|
|
|
|
}
|
|
|
|
|
|
|
|
BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
|
|
|
|
Instruction *InsertBefore) {
|
|
|
|
if (!Op->getType()->isFloatingPoint())
|
|
|
|
return new BinaryOperator(Instruction::Sub,
|
|
|
|
Constant::getNullValue(Op->getType()), Op,
|
|
|
|
Op->getType(), Name, InsertBefore);
|
|
|
|
else
|
|
|
|
return new BinaryOperator(Instruction::Sub,
|
|
|
|
ConstantFP::get(Op->getType(), -0.0), Op,
|
|
|
|
Op->getType(), Name, InsertBefore);
|
|
|
|
}
|
|
|
|
|
|
|
|
BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
|
|
|
|
BasicBlock *InsertAtEnd) {
|
|
|
|
if (!Op->getType()->isFloatingPoint())
|
|
|
|
return new BinaryOperator(Instruction::Sub,
|
|
|
|
Constant::getNullValue(Op->getType()), Op,
|
|
|
|
Op->getType(), Name, InsertAtEnd);
|
|
|
|
else
|
|
|
|
return new BinaryOperator(Instruction::Sub,
|
|
|
|
ConstantFP::get(Op->getType(), -0.0), Op,
|
|
|
|
Op->getType(), Name, InsertAtEnd);
|
|
|
|
}
|
|
|
|
|
|
|
|
BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
|
|
|
|
Instruction *InsertBefore) {
|
2006-03-25 22:54:21 +01:00
|
|
|
Constant *C;
|
|
|
|
if (const PackedType *PTy = dyn_cast<PackedType>(Op->getType())) {
|
|
|
|
C = ConstantIntegral::getAllOnesValue(PTy->getElementType());
|
|
|
|
C = ConstantPacked::get(std::vector<Constant*>(PTy->getNumElements(), C));
|
|
|
|
} else {
|
|
|
|
C = ConstantIntegral::getAllOnesValue(Op->getType());
|
|
|
|
}
|
|
|
|
|
|
|
|
return new BinaryOperator(Instruction::Xor, Op, C,
|
2004-07-29 14:33:25 +02:00
|
|
|
Op->getType(), Name, InsertBefore);
|
|
|
|
}
|
|
|
|
|
|
|
|
BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
|
|
|
|
BasicBlock *InsertAtEnd) {
|
2005-12-21 19:22:19 +01:00
|
|
|
Constant *AllOnes;
|
|
|
|
if (const PackedType *PTy = dyn_cast<PackedType>(Op->getType())) {
|
|
|
|
// Create a vector of all ones values.
|
|
|
|
Constant *Elt = ConstantIntegral::getAllOnesValue(PTy->getElementType());
|
|
|
|
AllOnes =
|
|
|
|
ConstantPacked::get(std::vector<Constant*>(PTy->getNumElements(), Elt));
|
|
|
|
} else {
|
|
|
|
AllOnes = ConstantIntegral::getAllOnesValue(Op->getType());
|
|
|
|
}
|
|
|
|
|
|
|
|
return new BinaryOperator(Instruction::Xor, Op, AllOnes,
|
2004-07-29 14:33:25 +02:00
|
|
|
Op->getType(), Name, InsertAtEnd);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// isConstantAllOnes - Helper function for several functions below
|
|
|
|
static inline bool isConstantAllOnes(const Value *V) {
|
|
|
|
return isa<ConstantIntegral>(V) &&cast<ConstantIntegral>(V)->isAllOnesValue();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool BinaryOperator::isNeg(const Value *V) {
|
|
|
|
if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
|
|
|
|
if (Bop->getOpcode() == Instruction::Sub)
|
|
|
|
if (!V->getType()->isFloatingPoint())
|
|
|
|
return Bop->getOperand(0) == Constant::getNullValue(Bop->getType());
|
|
|
|
else
|
|
|
|
return Bop->getOperand(0) == ConstantFP::get(Bop->getType(), -0.0);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool BinaryOperator::isNot(const Value *V) {
|
|
|
|
if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
|
|
|
|
return (Bop->getOpcode() == Instruction::Xor &&
|
|
|
|
(isConstantAllOnes(Bop->getOperand(1)) ||
|
|
|
|
isConstantAllOnes(Bop->getOperand(0))));
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2005-04-24 09:28:37 +02:00
|
|
|
Value *BinaryOperator::getNegArgument(Value *BinOp) {
|
|
|
|
assert(isNeg(BinOp) && "getNegArgument from non-'neg' instruction!");
|
|
|
|
return cast<BinaryOperator>(BinOp)->getOperand(1);
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-04-24 09:28:37 +02:00
|
|
|
const Value *BinaryOperator::getNegArgument(const Value *BinOp) {
|
|
|
|
return getNegArgument(const_cast<Value*>(BinOp));
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-04-24 09:28:37 +02:00
|
|
|
Value *BinaryOperator::getNotArgument(Value *BinOp) {
|
|
|
|
assert(isNot(BinOp) && "getNotArgument on non-'not' instruction!");
|
|
|
|
BinaryOperator *BO = cast<BinaryOperator>(BinOp);
|
|
|
|
Value *Op0 = BO->getOperand(0);
|
|
|
|
Value *Op1 = BO->getOperand(1);
|
2004-07-29 14:33:25 +02:00
|
|
|
if (isConstantAllOnes(Op0)) return Op1;
|
|
|
|
|
|
|
|
assert(isConstantAllOnes(Op1));
|
|
|
|
return Op0;
|
|
|
|
}
|
|
|
|
|
2005-04-24 09:28:37 +02:00
|
|
|
const Value *BinaryOperator::getNotArgument(const Value *BinOp) {
|
|
|
|
return getNotArgument(const_cast<Value*>(BinOp));
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// swapOperands - Exchange the two operands to this instruction. This
|
|
|
|
// instruction is safe to use on any binary instruction and does not
|
|
|
|
// modify the semantics of the instruction. If the instruction is
|
|
|
|
// order dependent (SetLT f.e.) the opcode is changed.
|
|
|
|
//
|
|
|
|
bool BinaryOperator::swapOperands() {
|
|
|
|
if (isCommutative())
|
|
|
|
; // If the instruction is commutative, it is safe to swap the operands
|
|
|
|
else if (SetCondInst *SCI = dyn_cast<SetCondInst>(this))
|
|
|
|
/// FIXME: SetCC instructions shouldn't all have different opcodes.
|
|
|
|
setOpcode(SCI->getSwappedCondition());
|
|
|
|
else
|
|
|
|
return true; // Can't commute operands
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
std::swap(Ops[0], Ops[1]);
|
2004-07-29 14:33:25 +02:00
|
|
|
return false;
|
2006-09-17 21:29:56 +02:00
|
|
|
}
|
|
|
|
|
2006-09-18 06:54:57 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// CastInst Class
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-11-27 02:05:10 +01:00
|
|
|
// Just determine if this cast only deals with integral->integral conversion.
|
|
|
|
bool CastInst::isIntegerCast() const {
|
|
|
|
switch (getOpcode()) {
|
|
|
|
default: return false;
|
|
|
|
case Instruction::ZExt:
|
|
|
|
case Instruction::SExt:
|
|
|
|
case Instruction::Trunc:
|
|
|
|
return true;
|
|
|
|
case Instruction::BitCast:
|
|
|
|
return getOperand(0)->getType()->isIntegral() && getType()->isIntegral();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool CastInst::isLosslessCast() const {
|
|
|
|
// Only BitCast can be lossless, exit fast if we're not BitCast
|
|
|
|
if (getOpcode() != Instruction::BitCast)
|
2006-09-18 06:54:57 +02:00
|
|
|
return false;
|
|
|
|
|
2006-11-27 02:05:10 +01:00
|
|
|
// Identity cast is always lossless
|
|
|
|
const Type* SrcTy = getOperand(0)->getType();
|
|
|
|
const Type* DstTy = getType();
|
|
|
|
if (SrcTy == DstTy)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// The remaining possibilities are lossless if the typeID of the source type
|
|
|
|
// matches the type ID of the destination in size and fundamental type. This
|
|
|
|
// prevents things like int -> ptr, int -> float, packed -> int, mismatched
|
|
|
|
// packed types of the same size, and etc.
|
|
|
|
switch (SrcTy->getTypeID()) {
|
|
|
|
case Type::UByteTyID: return DstTy == Type::SByteTy;
|
|
|
|
case Type::SByteTyID: return DstTy == Type::UByteTy;
|
|
|
|
case Type::UShortTyID: return DstTy == Type::ShortTy;
|
|
|
|
case Type::ShortTyID: return DstTy == Type::UShortTy;
|
|
|
|
case Type::UIntTyID: return DstTy == Type::IntTy;
|
|
|
|
case Type::IntTyID: return DstTy == Type::UIntTy;
|
|
|
|
case Type::ULongTyID: return DstTy == Type::LongTy;
|
|
|
|
case Type::LongTyID: return DstTy == Type::ULongTy;
|
|
|
|
case Type::PointerTyID: return isa<PointerType>(DstTy);
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return false; // Other types have no identity values
|
|
|
|
}
|
|
|
|
|
|
|
|
/// This function determines if the CastInst does not require any bits to be
|
|
|
|
/// changed in order to effect the cast. Essentially, it identifies cases where
|
|
|
|
/// no code gen is necessary for the cast, hence the name no-op cast. For
|
|
|
|
/// example, the following are all no-op casts:
|
|
|
|
/// # bitcast uint %X, int
|
|
|
|
/// # bitcast uint* %x, sbyte*
|
|
|
|
/// # bitcast packed< 2 x int > %x, packed< 4 x short>
|
|
|
|
/// # ptrtoint uint* %x, uint ; on 32-bit plaforms only
|
|
|
|
/// @brief Determine if a cast is a no-op.
|
|
|
|
bool CastInst::isNoopCast(const Type *IntPtrTy) const {
|
|
|
|
switch (getOpcode()) {
|
|
|
|
default:
|
|
|
|
assert(!"Invalid CastOp");
|
|
|
|
case Instruction::Trunc:
|
|
|
|
case Instruction::ZExt:
|
|
|
|
case Instruction::SExt:
|
|
|
|
case Instruction::FPTrunc:
|
|
|
|
case Instruction::FPExt:
|
|
|
|
case Instruction::UIToFP:
|
|
|
|
case Instruction::SIToFP:
|
|
|
|
case Instruction::FPToUI:
|
|
|
|
case Instruction::FPToSI:
|
|
|
|
return false; // These always modify bits
|
|
|
|
case Instruction::BitCast:
|
|
|
|
return true; // BitCast never modifies bits.
|
|
|
|
case Instruction::PtrToInt:
|
|
|
|
return IntPtrTy->getPrimitiveSizeInBits() ==
|
|
|
|
getType()->getPrimitiveSizeInBits();
|
|
|
|
case Instruction::IntToPtr:
|
|
|
|
return IntPtrTy->getPrimitiveSizeInBits() ==
|
|
|
|
getOperand(0)->getType()->getPrimitiveSizeInBits();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// This function determines if a pair of casts can be eliminated and what
|
|
|
|
/// opcode should be used in the elimination. This assumes that there are two
|
|
|
|
/// instructions like this:
|
|
|
|
/// * %F = firstOpcode SrcTy %x to MidTy
|
|
|
|
/// * %S = secondOpcode MidTy %F to DstTy
|
|
|
|
/// The function returns a resultOpcode so these two casts can be replaced with:
|
|
|
|
/// * %Replacement = resultOpcode %SrcTy %x to DstTy
|
|
|
|
/// If no such cast is permited, the function returns 0.
|
|
|
|
unsigned CastInst::isEliminableCastPair(
|
|
|
|
Instruction::CastOps firstOp, Instruction::CastOps secondOp,
|
|
|
|
const Type *SrcTy, const Type *MidTy, const Type *DstTy, const Type *IntPtrTy)
|
|
|
|
{
|
|
|
|
// Define the 144 possibilities for these two cast instructions. The values
|
|
|
|
// in this matrix determine what to do in a given situation and select the
|
|
|
|
// case in the switch below. The rows correspond to firstOp, the columns
|
|
|
|
// correspond to secondOp. In looking at the table below, keep in mind
|
|
|
|
// the following cast properties:
|
|
|
|
//
|
|
|
|
// Size Compare Source Destination
|
|
|
|
// Operator Src ? Size Type Sign Type Sign
|
|
|
|
// -------- ------------ ------------------- ---------------------
|
|
|
|
// TRUNC > Integer Any Integral Any
|
|
|
|
// ZEXT < Integral Unsigned Integer Any
|
|
|
|
// SEXT < Integral Signed Integer Any
|
|
|
|
// FPTOUI n/a FloatPt n/a Integral Unsigned
|
|
|
|
// FPTOSI n/a FloatPt n/a Integral Signed
|
|
|
|
// UITOFP n/a Integral Unsigned FloatPt n/a
|
|
|
|
// SITOFP n/a Integral Signed FloatPt n/a
|
|
|
|
// FPTRUNC > FloatPt n/a FloatPt n/a
|
|
|
|
// FPEXT < FloatPt n/a FloatPt n/a
|
|
|
|
// PTRTOINT n/a Pointer n/a Integral Unsigned
|
|
|
|
// INTTOPTR n/a Integral Unsigned Pointer n/a
|
|
|
|
// BITCONVERT = FirstClass n/a FirstClass n/a
|
|
|
|
//
|
|
|
|
const unsigned numCastOps =
|
|
|
|
Instruction::CastOpsEnd - Instruction::CastOpsBegin;
|
|
|
|
static const uint8_t CastResults[numCastOps][numCastOps] = {
|
|
|
|
// T F F U S F F P I B -+
|
|
|
|
// R Z S P P I I T P 2 N T |
|
|
|
|
// U E E 2 2 2 2 R E I T C +- secondOp
|
|
|
|
// N X X U S F F N X N 2 V |
|
|
|
|
// C T T I I P P C T T P T -+
|
|
|
|
{ 1, 0, 0,99,99, 0, 0,99,99,99, 0, 3 }, // Trunc -+
|
|
|
|
{ 8, 1, 9,99,99, 2, 0,99,99,99, 2, 3 }, // ZExt |
|
|
|
|
{ 8, 0, 1,99,99, 0, 2,99,99,99, 0, 3 }, // SExt |
|
|
|
|
{ 0, 1, 0,99,99, 0, 0,99,99,99, 0, 3 }, // FPToUI |
|
|
|
|
{ 0, 0, 1,99,99, 0, 0,99,99,99, 0, 3 }, // FPToSI |
|
|
|
|
{ 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // UIToFP +- firstOp
|
|
|
|
{ 99,99,99, 0, 0,99,99, 0, 0,99,99, 4 }, // SIToFP |
|
|
|
|
{ 99,99,99, 0, 0,99,99, 1, 0,99,99, 4 }, // FPTrunc |
|
|
|
|
{ 99,99,99, 2, 2,99,99,10, 2,99,99, 4 }, // FPExt |
|
|
|
|
{ 1, 0, 0,99,99, 0, 0,99,99,99, 7, 3 }, // PtrToInt |
|
|
|
|
{ 99,99,99,99,99,99,99,99,99,13,99,12 }, // IntToPtr |
|
|
|
|
{ 5, 5, 5, 6, 6, 5, 5, 6, 6,11, 5, 1 }, // BitCast -+
|
|
|
|
};
|
|
|
|
|
|
|
|
int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
|
|
|
|
[secondOp-Instruction::CastOpsBegin];
|
|
|
|
switch (ElimCase) {
|
|
|
|
case 0:
|
|
|
|
// categorically disallowed
|
|
|
|
return 0;
|
|
|
|
case 1:
|
|
|
|
// allowed, use first cast's opcode
|
|
|
|
return firstOp;
|
|
|
|
case 2:
|
|
|
|
// allowed, use second cast's opcode
|
|
|
|
return secondOp;
|
|
|
|
case 3:
|
|
|
|
// no-op cast in second op implies firstOp as long as the DestTy
|
|
|
|
// is integer
|
|
|
|
if (DstTy->isInteger())
|
|
|
|
return firstOp;
|
|
|
|
return 0;
|
|
|
|
case 4:
|
|
|
|
// no-op cast in second op implies firstOp as long as the DestTy
|
|
|
|
// is floating point
|
|
|
|
if (DstTy->isFloatingPoint())
|
|
|
|
return firstOp;
|
|
|
|
return 0;
|
|
|
|
case 5:
|
|
|
|
// no-op cast in first op implies secondOp as long as the SrcTy
|
|
|
|
// is an integer
|
|
|
|
if (SrcTy->isInteger())
|
|
|
|
return secondOp;
|
|
|
|
return 0;
|
|
|
|
case 6:
|
|
|
|
// no-op cast in first op implies secondOp as long as the SrcTy
|
|
|
|
// is a floating point
|
|
|
|
if (SrcTy->isFloatingPoint())
|
|
|
|
return secondOp;
|
|
|
|
return 0;
|
|
|
|
case 7: {
|
|
|
|
// ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size
|
|
|
|
unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
|
|
|
|
unsigned MidSize = MidTy->getPrimitiveSizeInBits();
|
|
|
|
if (MidSize >= PtrSize)
|
|
|
|
return Instruction::BitCast;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
case 8: {
|
|
|
|
// ext, trunc -> bitcast, if the SrcTy and DstTy are same size
|
|
|
|
// ext, trunc -> ext, if sizeof(SrcTy) < sizeof(DstTy)
|
|
|
|
// ext, trunc -> trunc, if sizeof(SrcTy) > sizeof(DstTy)
|
|
|
|
unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
|
|
|
|
unsigned DstSize = DstTy->getPrimitiveSizeInBits();
|
|
|
|
if (SrcSize == DstSize)
|
|
|
|
return Instruction::BitCast;
|
|
|
|
else if (SrcSize < DstSize)
|
|
|
|
return firstOp;
|
|
|
|
return secondOp;
|
|
|
|
}
|
|
|
|
case 9: // zext, sext -> zext, because sext can't sign extend after zext
|
|
|
|
return Instruction::ZExt;
|
|
|
|
case 10:
|
|
|
|
// fpext followed by ftrunc is allowed if the bit size returned to is
|
|
|
|
// the same as the original, in which case its just a bitcast
|
|
|
|
if (SrcTy == DstTy)
|
|
|
|
return Instruction::BitCast;
|
|
|
|
return 0; // If the types are not the same we can't eliminate it.
|
|
|
|
case 11:
|
|
|
|
// bitcast followed by ptrtoint is allowed as long as the bitcast
|
|
|
|
// is a pointer to pointer cast.
|
|
|
|
if (isa<PointerType>(SrcTy) && isa<PointerType>(MidTy))
|
|
|
|
return secondOp;
|
|
|
|
return 0;
|
|
|
|
case 12:
|
|
|
|
// inttoptr, bitcast -> intptr if bitcast is a ptr to ptr cast
|
|
|
|
if (isa<PointerType>(MidTy) && isa<PointerType>(DstTy))
|
|
|
|
return firstOp;
|
|
|
|
return 0;
|
|
|
|
case 13: {
|
|
|
|
// inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
|
|
|
|
unsigned PtrSize = IntPtrTy->getPrimitiveSizeInBits();
|
|
|
|
unsigned SrcSize = SrcTy->getPrimitiveSizeInBits();
|
|
|
|
unsigned DstSize = DstTy->getPrimitiveSizeInBits();
|
|
|
|
if (SrcSize <= PtrSize && SrcSize == DstSize)
|
|
|
|
return Instruction::BitCast;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
case 99:
|
|
|
|
// cast combination can't happen (error in input). This is for all cases
|
|
|
|
// where the MidTy is not the same for the two cast instructions.
|
|
|
|
assert(!"Invalid Cast Combination");
|
|
|
|
return 0;
|
|
|
|
default:
|
|
|
|
assert(!"Error in CastResults table!!!");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
CastInst *CastInst::create(Instruction::CastOps op, Value *S, const Type *Ty,
|
|
|
|
const std::string &Name, Instruction *InsertBefore) {
|
|
|
|
// Construct and return the appropriate CastInst subclass
|
|
|
|
switch (op) {
|
|
|
|
case Trunc: return new TruncInst (S, Ty, Name, InsertBefore);
|
|
|
|
case ZExt: return new ZExtInst (S, Ty, Name, InsertBefore);
|
|
|
|
case SExt: return new SExtInst (S, Ty, Name, InsertBefore);
|
|
|
|
case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertBefore);
|
|
|
|
case FPExt: return new FPExtInst (S, Ty, Name, InsertBefore);
|
|
|
|
case UIToFP: return new UIToFPInst (S, Ty, Name, InsertBefore);
|
|
|
|
case SIToFP: return new SIToFPInst (S, Ty, Name, InsertBefore);
|
|
|
|
case FPToUI: return new FPToUIInst (S, Ty, Name, InsertBefore);
|
|
|
|
case FPToSI: return new FPToSIInst (S, Ty, Name, InsertBefore);
|
|
|
|
case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertBefore);
|
|
|
|
case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertBefore);
|
|
|
|
case BitCast: return new BitCastInst (S, Ty, Name, InsertBefore);
|
|
|
|
default:
|
|
|
|
assert(!"Invalid opcode provided");
|
|
|
|
}
|
|
|
|
return 0;
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2006-11-27 02:05:10 +01:00
|
|
|
CastInst *CastInst::create(Instruction::CastOps op, Value *S, const Type *Ty,
|
|
|
|
const std::string &Name, BasicBlock *InsertAtEnd) {
|
|
|
|
// Construct and return the appropriate CastInst subclass
|
|
|
|
switch (op) {
|
|
|
|
case Trunc: return new TruncInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
case ZExt: return new ZExtInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
case SExt: return new SExtInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
case FPTrunc: return new FPTruncInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
case FPExt: return new FPExtInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
case UIToFP: return new UIToFPInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
case SIToFP: return new SIToFPInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
case FPToUI: return new FPToUIInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
case FPToSI: return new FPToSIInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
case PtrToInt: return new PtrToIntInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
case IntToPtr: return new IntToPtrInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
case BitCast: return new BitCastInst (S, Ty, Name, InsertAtEnd);
|
|
|
|
default:
|
|
|
|
assert(!"Invalid opcode provided");
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Provide a way to get a "cast" where the cast opcode is inferred from the
|
|
|
|
// types and size of the operand. This, basically, is a parallel of the
|
|
|
|
// logic in the checkCast function below. This axiom should hold:
|
|
|
|
// checkCast( getCastOpcode(Val, Ty), Val, Ty)
|
|
|
|
// should not assert in checkCast. In other words, this produces a "correct"
|
|
|
|
// casting opcode for the arguments passed to it.
|
|
|
|
Instruction::CastOps
|
|
|
|
CastInst::getCastOpcode(const Value *Src, const Type *DestTy) {
|
|
|
|
// Get the bit sizes, we'll need these
|
|
|
|
const Type *SrcTy = Src->getType();
|
|
|
|
unsigned SrcBits = SrcTy->getPrimitiveSizeInBits(); // 0 for ptr/packed
|
|
|
|
unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr/packed
|
|
|
|
|
|
|
|
// Run through the possibilities ...
|
|
|
|
if (DestTy->isIntegral()) { // Casting to integral
|
|
|
|
if (SrcTy->isIntegral()) { // Casting from integral
|
|
|
|
if (DestBits < SrcBits)
|
|
|
|
return Trunc; // int -> smaller int
|
|
|
|
else if (DestBits > SrcBits) { // its an extension
|
|
|
|
if (SrcTy->isSigned())
|
|
|
|
return SExt; // signed -> SEXT
|
|
|
|
else
|
|
|
|
return ZExt; // unsigned -> ZEXT
|
|
|
|
} else {
|
|
|
|
return BitCast; // Same size, No-op cast
|
|
|
|
}
|
|
|
|
} else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
|
|
|
|
if (DestTy->isSigned())
|
|
|
|
return FPToSI; // FP -> sint
|
|
|
|
else
|
|
|
|
return FPToUI; // FP -> uint
|
|
|
|
} else if (const PackedType *PTy = dyn_cast<PackedType>(SrcTy)) {
|
|
|
|
assert(DestBits == PTy->getBitWidth() &&
|
|
|
|
"Casting packed to integer of different width");
|
|
|
|
return BitCast; // Same size, no-op cast
|
|
|
|
} else {
|
|
|
|
assert(isa<PointerType>(SrcTy) &&
|
|
|
|
"Casting from a value that is not first-class type");
|
|
|
|
return PtrToInt; // ptr -> int
|
|
|
|
}
|
|
|
|
} else if (DestTy->isFloatingPoint()) { // Casting to floating pt
|
|
|
|
if (SrcTy->isIntegral()) { // Casting from integral
|
|
|
|
if (SrcTy->isSigned())
|
|
|
|
return SIToFP; // sint -> FP
|
|
|
|
else
|
|
|
|
return UIToFP; // uint -> FP
|
|
|
|
} else if (SrcTy->isFloatingPoint()) { // Casting from floating pt
|
|
|
|
if (DestBits < SrcBits) {
|
|
|
|
return FPTrunc; // FP -> smaller FP
|
|
|
|
} else if (DestBits > SrcBits) {
|
|
|
|
return FPExt; // FP -> larger FP
|
|
|
|
} else {
|
|
|
|
return BitCast; // same size, no-op cast
|
|
|
|
}
|
|
|
|
} else if (const PackedType *PTy = dyn_cast<PackedType>(SrcTy)) {
|
|
|
|
assert(DestBits == PTy->getBitWidth() &&
|
|
|
|
"Casting packed to floating point of different width");
|
|
|
|
return BitCast; // same size, no-op cast
|
|
|
|
} else {
|
|
|
|
assert(0 && "Casting pointer or non-first class to float");
|
|
|
|
}
|
|
|
|
} else if (const PackedType *DestPTy = dyn_cast<PackedType>(DestTy)) {
|
|
|
|
if (const PackedType *SrcPTy = dyn_cast<PackedType>(SrcTy)) {
|
|
|
|
assert(DestPTy->getBitWidth() == SrcPTy->getBitWidth() &&
|
|
|
|
"Casting packed to packed of different widths");
|
|
|
|
return BitCast; // packed -> packed
|
|
|
|
} else if (DestPTy->getBitWidth() == SrcBits) {
|
|
|
|
return BitCast; // float/int -> packed
|
|
|
|
} else {
|
|
|
|
assert(!"Illegal cast to packed (wrong type or size)");
|
|
|
|
}
|
|
|
|
} else if (isa<PointerType>(DestTy)) {
|
|
|
|
if (isa<PointerType>(SrcTy)) {
|
|
|
|
return BitCast; // ptr -> ptr
|
|
|
|
} else if (SrcTy->isIntegral()) {
|
|
|
|
return IntToPtr; // int -> ptr
|
|
|
|
} else {
|
|
|
|
assert(!"Casting pointer to other than pointer or int");
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
assert(!"Casting to type that is not first-class");
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we fall through to here we probably hit an assertion cast above
|
|
|
|
// and assertions are not turned on. Anything we return is an error, so
|
|
|
|
// BitCast is as good a choice as any.
|
|
|
|
return BitCast;
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// CastInst SubClass Constructors
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
/// Check that the construction parameters for a CastInst are correct. This
|
|
|
|
/// could be broken out into the separate constructors but it is useful to have
|
|
|
|
/// it in one place and to eliminate the redundant code for getting the sizes
|
|
|
|
/// of the types involved.
|
|
|
|
static bool
|
|
|
|
checkCast(Instruction::CastOps op, Value *S, const Type *DstTy) {
|
|
|
|
|
|
|
|
// Check for type sanity on the arguments
|
|
|
|
const Type *SrcTy = S->getType();
|
|
|
|
if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Get the size of the types in bits, we'll need this later
|
|
|
|
unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
|
|
|
|
unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
|
|
|
|
|
|
|
|
// Switch on the opcode provided
|
|
|
|
switch (op) {
|
|
|
|
default: return false; // This is an input error
|
|
|
|
case Instruction::Trunc:
|
|
|
|
return SrcTy->isInteger() && DstTy->isIntegral() && SrcBitSize > DstBitSize;
|
|
|
|
case Instruction::ZExt:
|
|
|
|
return SrcTy->isIntegral() && DstTy->isInteger() && SrcBitSize < DstBitSize;
|
|
|
|
case Instruction::SExt:
|
|
|
|
return SrcTy->isIntegral() && DstTy->isInteger() && SrcBitSize < DstBitSize;
|
|
|
|
case Instruction::FPTrunc:
|
|
|
|
return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
|
|
|
|
SrcBitSize > DstBitSize;
|
|
|
|
case Instruction::FPExt:
|
|
|
|
return SrcTy->isFloatingPoint() && DstTy->isFloatingPoint() &&
|
|
|
|
SrcBitSize < DstBitSize;
|
|
|
|
case Instruction::UIToFP:
|
|
|
|
return SrcTy->isIntegral() && DstTy->isFloatingPoint();
|
|
|
|
case Instruction::SIToFP:
|
|
|
|
return SrcTy->isIntegral() && DstTy->isFloatingPoint();
|
|
|
|
case Instruction::FPToUI:
|
|
|
|
return SrcTy->isFloatingPoint() && DstTy->isIntegral();
|
|
|
|
case Instruction::FPToSI:
|
|
|
|
return SrcTy->isFloatingPoint() && DstTy->isIntegral();
|
|
|
|
case Instruction::PtrToInt:
|
|
|
|
return isa<PointerType>(SrcTy) && DstTy->isIntegral();
|
|
|
|
case Instruction::IntToPtr:
|
|
|
|
return SrcTy->isIntegral() && isa<PointerType>(DstTy);
|
|
|
|
case Instruction::BitCast:
|
|
|
|
// BitCast implies a no-op cast of type only. No bits change.
|
|
|
|
// However, you can't cast pointers to anything but pointers.
|
|
|
|
if (isa<PointerType>(SrcTy) != isa<PointerType>(DstTy))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Now we know we're not dealing with a pointer/non-poiner mismatch. In all
|
|
|
|
// these cases, the cast is okay if the source and destination bit widths
|
|
|
|
// are identical.
|
|
|
|
return SrcBitSize == DstBitSize;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
TruncInst::TruncInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal Trunc");
|
|
|
|
}
|
|
|
|
|
|
|
|
TruncInst::TruncInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal Trunc");
|
|
|
|
}
|
|
|
|
|
|
|
|
ZExtInst::ZExtInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, ZExt, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal ZExt");
|
|
|
|
}
|
|
|
|
|
|
|
|
ZExtInst::ZExtInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal ZExt");
|
|
|
|
}
|
|
|
|
SExtInst::SExtInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, SExt, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal SExt");
|
|
|
|
}
|
|
|
|
|
2006-12-02 03:22:01 +01:00
|
|
|
SExtInst::SExtInst(
|
2006-11-27 02:05:10 +01:00
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal SExt");
|
|
|
|
}
|
|
|
|
|
|
|
|
FPTruncInst::FPTruncInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal FPTrunc");
|
|
|
|
}
|
|
|
|
|
|
|
|
FPTruncInst::FPTruncInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal FPTrunc");
|
|
|
|
}
|
|
|
|
|
|
|
|
FPExtInst::FPExtInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal FPExt");
|
|
|
|
}
|
|
|
|
|
|
|
|
FPExtInst::FPExtInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal FPExt");
|
|
|
|
}
|
|
|
|
|
|
|
|
UIToFPInst::UIToFPInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal UIToFP");
|
|
|
|
}
|
|
|
|
|
|
|
|
UIToFPInst::UIToFPInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal UIToFP");
|
|
|
|
}
|
|
|
|
|
|
|
|
SIToFPInst::SIToFPInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal SIToFP");
|
|
|
|
}
|
|
|
|
|
|
|
|
SIToFPInst::SIToFPInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal SIToFP");
|
|
|
|
}
|
|
|
|
|
|
|
|
FPToUIInst::FPToUIInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal FPToUI");
|
|
|
|
}
|
|
|
|
|
|
|
|
FPToUIInst::FPToUIInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal FPToUI");
|
|
|
|
}
|
|
|
|
|
|
|
|
FPToSIInst::FPToSIInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal FPToSI");
|
|
|
|
}
|
|
|
|
|
|
|
|
FPToSIInst::FPToSIInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal FPToSI");
|
|
|
|
}
|
|
|
|
|
|
|
|
PtrToIntInst::PtrToIntInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal PtrToInt");
|
|
|
|
}
|
|
|
|
|
|
|
|
PtrToIntInst::PtrToIntInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal PtrToInt");
|
|
|
|
}
|
|
|
|
|
|
|
|
IntToPtrInst::IntToPtrInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal IntToPtr");
|
|
|
|
}
|
|
|
|
|
|
|
|
IntToPtrInst::IntToPtrInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal IntToPtr");
|
|
|
|
}
|
|
|
|
|
|
|
|
BitCastInst::BitCastInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, Instruction *InsertBefore
|
|
|
|
) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal BitCast");
|
|
|
|
}
|
|
|
|
|
|
|
|
BitCastInst::BitCastInst(
|
|
|
|
Value *S, const Type *Ty, const std::string &Name, BasicBlock *InsertAtEnd
|
|
|
|
) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
|
|
|
|
assert(checkCast(getOpcode(), S, Ty) && "Illegal BitCast");
|
|
|
|
}
|
2004-07-29 14:33:25 +02:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// SetCondInst Class
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
SetCondInst::SetCondInst(BinaryOps Opcode, Value *S1, Value *S2,
|
2004-07-29 14:33:25 +02:00
|
|
|
const std::string &Name, Instruction *InsertBefore)
|
|
|
|
: BinaryOperator(Opcode, S1, S2, Type::BoolTy, Name, InsertBefore) {
|
|
|
|
|
|
|
|
// Make sure it's a valid type... getInverseCondition will assert out if not.
|
|
|
|
assert(getInverseCondition(Opcode));
|
|
|
|
}
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
SetCondInst::SetCondInst(BinaryOps Opcode, Value *S1, Value *S2,
|
2004-07-29 14:33:25 +02:00
|
|
|
const std::string &Name, BasicBlock *InsertAtEnd)
|
|
|
|
: BinaryOperator(Opcode, S1, S2, Type::BoolTy, Name, InsertAtEnd) {
|
|
|
|
|
|
|
|
// Make sure it's a valid type... getInverseCondition will assert out if not.
|
|
|
|
assert(getInverseCondition(Opcode));
|
|
|
|
}
|
|
|
|
|
|
|
|
// getInverseCondition - Return the inverse of the current condition opcode.
|
|
|
|
// For example seteq -> setne, setgt -> setle, setlt -> setge, etc...
|
|
|
|
//
|
|
|
|
Instruction::BinaryOps SetCondInst::getInverseCondition(BinaryOps Opcode) {
|
|
|
|
switch (Opcode) {
|
|
|
|
default:
|
|
|
|
assert(0 && "Unknown setcc opcode!");
|
|
|
|
case SetEQ: return SetNE;
|
|
|
|
case SetNE: return SetEQ;
|
|
|
|
case SetGT: return SetLE;
|
|
|
|
case SetLT: return SetGE;
|
|
|
|
case SetGE: return SetLT;
|
|
|
|
case SetLE: return SetGT;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// getSwappedCondition - Return the condition opcode that would be the result
|
|
|
|
// of exchanging the two operands of the setcc instruction without changing
|
|
|
|
// the result produced. Thus, seteq->seteq, setle->setge, setlt->setgt, etc.
|
|
|
|
//
|
|
|
|
Instruction::BinaryOps SetCondInst::getSwappedCondition(BinaryOps Opcode) {
|
|
|
|
switch (Opcode) {
|
|
|
|
default: assert(0 && "Unknown setcc instruction!");
|
|
|
|
case SetEQ: case SetNE: return Opcode;
|
|
|
|
case SetGT: return SetLT;
|
|
|
|
case SetLT: return SetGT;
|
|
|
|
case SetGE: return SetLE;
|
|
|
|
case SetLE: return SetGE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-11-20 02:22:35 +01:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// CmpInst Classes
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
CmpInst::CmpInst(OtherOps op, unsigned short predicate, Value *LHS, Value *RHS,
|
|
|
|
const std::string &Name, Instruction *InsertBefore)
|
|
|
|
: Instruction(Type::BoolTy, op, Ops, 2, Name, InsertBefore) {
|
|
|
|
Ops[0].init(LHS, this);
|
|
|
|
Ops[1].init(RHS, this);
|
|
|
|
SubclassData = predicate;
|
|
|
|
if (op == Instruction::ICmp) {
|
|
|
|
assert(predicate >= ICmpInst::FIRST_ICMP_PREDICATE &&
|
|
|
|
predicate <= ICmpInst::LAST_ICMP_PREDICATE &&
|
|
|
|
"Invalid ICmp predicate value");
|
|
|
|
const Type* Op0Ty = getOperand(0)->getType();
|
|
|
|
const Type* Op1Ty = getOperand(1)->getType();
|
|
|
|
assert(Op0Ty == Op1Ty &&
|
|
|
|
"Both operands to ICmp instruction are not of the same type!");
|
|
|
|
// Check that the operands are the right type
|
|
|
|
assert(Op0Ty->isIntegral() || Op0Ty->getTypeID() == Type::PointerTyID ||
|
|
|
|
(isa<PackedType>(Op0Ty) &&
|
|
|
|
cast<PackedType>(Op0Ty)->getElementType()->isIntegral()) &&
|
|
|
|
"Invalid operand types for ICmp instruction");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
assert(op == Instruction::FCmp && "Invalid CmpInst opcode");
|
|
|
|
assert(predicate <= FCmpInst::LAST_FCMP_PREDICATE &&
|
|
|
|
"Invalid FCmp predicate value");
|
|
|
|
const Type* Op0Ty = getOperand(0)->getType();
|
|
|
|
const Type* Op1Ty = getOperand(1)->getType();
|
|
|
|
assert(Op0Ty == Op1Ty &&
|
|
|
|
"Both operands to FCmp instruction are not of the same type!");
|
|
|
|
// Check that the operands are the right type
|
|
|
|
assert(Op0Ty->isFloatingPoint() || (isa<PackedType>(Op0Ty) &&
|
|
|
|
cast<PackedType>(Op0Ty)->getElementType()->isFloatingPoint()) &&
|
|
|
|
"Invalid operand types for FCmp instruction");
|
|
|
|
}
|
|
|
|
|
|
|
|
CmpInst::CmpInst(OtherOps op, unsigned short predicate, Value *LHS, Value *RHS,
|
|
|
|
const std::string &Name, BasicBlock *InsertAtEnd)
|
|
|
|
: Instruction(Type::BoolTy, op, Ops, 2, Name, InsertAtEnd) {
|
|
|
|
Ops[0].init(LHS, this);
|
|
|
|
Ops[1].init(RHS, this);
|
|
|
|
SubclassData = predicate;
|
|
|
|
if (op == Instruction::ICmp) {
|
|
|
|
assert(predicate >= ICmpInst::FIRST_ICMP_PREDICATE &&
|
|
|
|
predicate <= ICmpInst::LAST_ICMP_PREDICATE &&
|
|
|
|
"Invalid ICmp predicate value");
|
|
|
|
|
|
|
|
const Type* Op0Ty = getOperand(0)->getType();
|
|
|
|
const Type* Op1Ty = getOperand(1)->getType();
|
|
|
|
assert(Op0Ty == Op1Ty &&
|
|
|
|
"Both operands to ICmp instruction are not of the same type!");
|
|
|
|
// Check that the operands are the right type
|
|
|
|
assert(Op0Ty->isIntegral() || Op0Ty->getTypeID() == Type::PointerTyID ||
|
|
|
|
(isa<PackedType>(Op0Ty) &&
|
|
|
|
cast<PackedType>(Op0Ty)->getElementType()->isIntegral()) &&
|
|
|
|
"Invalid operand types for ICmp instruction");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
assert(op == Instruction::FCmp && "Invalid CmpInst opcode");
|
|
|
|
assert(predicate <= FCmpInst::LAST_FCMP_PREDICATE &&
|
|
|
|
"Invalid FCmp predicate value");
|
|
|
|
const Type* Op0Ty = getOperand(0)->getType();
|
|
|
|
const Type* Op1Ty = getOperand(1)->getType();
|
|
|
|
assert(Op0Ty == Op1Ty &&
|
|
|
|
"Both operands to FCmp instruction are not of the same type!");
|
|
|
|
// Check that the operands are the right type
|
|
|
|
assert(Op0Ty->isFloatingPoint() || (isa<PackedType>(Op0Ty) &&
|
|
|
|
cast<PackedType>(Op0Ty)->getElementType()->isFloatingPoint()) &&
|
|
|
|
"Invalid operand types for FCmp instruction");
|
|
|
|
}
|
|
|
|
|
|
|
|
CmpInst *
|
|
|
|
CmpInst::create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
|
|
|
|
const std::string &Name, Instruction *InsertBefore) {
|
|
|
|
if (Op == Instruction::ICmp) {
|
|
|
|
return new ICmpInst(ICmpInst::Predicate(predicate), S1, S2, Name,
|
|
|
|
InsertBefore);
|
|
|
|
}
|
|
|
|
return new FCmpInst(FCmpInst::Predicate(predicate), S1, S2, Name,
|
|
|
|
InsertBefore);
|
|
|
|
}
|
|
|
|
|
|
|
|
CmpInst *
|
|
|
|
CmpInst::create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2,
|
|
|
|
const std::string &Name, BasicBlock *InsertAtEnd) {
|
|
|
|
if (Op == Instruction::ICmp) {
|
|
|
|
return new ICmpInst(ICmpInst::Predicate(predicate), S1, S2, Name,
|
|
|
|
InsertAtEnd);
|
|
|
|
}
|
|
|
|
return new FCmpInst(FCmpInst::Predicate(predicate), S1, S2, Name,
|
|
|
|
InsertAtEnd);
|
|
|
|
}
|
|
|
|
|
|
|
|
void CmpInst::swapOperands() {
|
|
|
|
if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
|
|
|
|
IC->swapOperands();
|
|
|
|
else
|
|
|
|
cast<FCmpInst>(this)->swapOperands();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool CmpInst::isCommutative() {
|
|
|
|
if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
|
|
|
|
return IC->isCommutative();
|
|
|
|
return cast<FCmpInst>(this)->isCommutative();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool CmpInst::isEquality() {
|
|
|
|
if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
|
|
|
|
return IC->isEquality();
|
|
|
|
return cast<FCmpInst>(this)->isEquality();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
ICmpInst::Predicate ICmpInst::getInversePredicate(Predicate pred) {
|
|
|
|
switch (pred) {
|
|
|
|
default:
|
|
|
|
assert(!"Unknown icmp predicate!");
|
|
|
|
case ICMP_EQ: return ICMP_NE;
|
|
|
|
case ICMP_NE: return ICMP_EQ;
|
|
|
|
case ICMP_UGT: return ICMP_ULE;
|
|
|
|
case ICMP_ULT: return ICMP_UGE;
|
|
|
|
case ICMP_UGE: return ICMP_ULT;
|
|
|
|
case ICMP_ULE: return ICMP_UGT;
|
|
|
|
case ICMP_SGT: return ICMP_SLE;
|
|
|
|
case ICMP_SLT: return ICMP_SGE;
|
|
|
|
case ICMP_SGE: return ICMP_SLT;
|
|
|
|
case ICMP_SLE: return ICMP_SGT;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ICmpInst::Predicate ICmpInst::getSwappedPredicate(Predicate pred) {
|
|
|
|
switch (pred) {
|
|
|
|
default: assert(! "Unknown setcc instruction!");
|
|
|
|
case ICMP_EQ: case ICMP_NE:
|
|
|
|
return pred;
|
|
|
|
case ICMP_SGT: return ICMP_SLT;
|
|
|
|
case ICMP_SLT: return ICMP_SGT;
|
|
|
|
case ICMP_SGE: return ICMP_SLE;
|
|
|
|
case ICMP_SLE: return ICMP_SGE;
|
|
|
|
case ICMP_UGT: return ICMP_ULT;
|
|
|
|
case ICMP_ULT: return ICMP_UGT;
|
|
|
|
case ICMP_UGE: return ICMP_ULE;
|
|
|
|
case ICMP_ULE: return ICMP_UGE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
FCmpInst::Predicate FCmpInst::getInversePredicate(Predicate pred) {
|
|
|
|
switch (pred) {
|
|
|
|
default:
|
|
|
|
assert(!"Unknown icmp predicate!");
|
|
|
|
case FCMP_OEQ: return FCMP_UNE;
|
|
|
|
case FCMP_ONE: return FCMP_UEQ;
|
|
|
|
case FCMP_OGT: return FCMP_ULE;
|
|
|
|
case FCMP_OLT: return FCMP_UGE;
|
|
|
|
case FCMP_OGE: return FCMP_ULT;
|
|
|
|
case FCMP_OLE: return FCMP_UGT;
|
|
|
|
case FCMP_UEQ: return FCMP_ONE;
|
|
|
|
case FCMP_UNE: return FCMP_OEQ;
|
|
|
|
case FCMP_UGT: return FCMP_OLE;
|
|
|
|
case FCMP_ULT: return FCMP_OGE;
|
|
|
|
case FCMP_UGE: return FCMP_OLT;
|
|
|
|
case FCMP_ULE: return FCMP_OGT;
|
|
|
|
case FCMP_ORD: return FCMP_UNO;
|
|
|
|
case FCMP_UNO: return FCMP_ORD;
|
|
|
|
case FCMP_TRUE: return FCMP_FALSE;
|
|
|
|
case FCMP_FALSE: return FCMP_TRUE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
FCmpInst::Predicate FCmpInst::getSwappedPredicate(Predicate pred) {
|
|
|
|
switch (pred) {
|
|
|
|
default: assert(!"Unknown setcc instruction!");
|
|
|
|
case FCMP_FALSE: case FCMP_TRUE:
|
|
|
|
case FCMP_OEQ: case FCMP_ONE:
|
|
|
|
case FCMP_UEQ: case FCMP_UNE:
|
|
|
|
case FCMP_ORD: case FCMP_UNO:
|
|
|
|
return pred;
|
|
|
|
case FCMP_OGT: return FCMP_OLT;
|
|
|
|
case FCMP_OLT: return FCMP_OGT;
|
|
|
|
case FCMP_OGE: return FCMP_OLE;
|
|
|
|
case FCMP_OLE: return FCMP_OGE;
|
|
|
|
case FCMP_UGT: return FCMP_ULT;
|
|
|
|
case FCMP_ULT: return FCMP_UGT;
|
|
|
|
case FCMP_UGE: return FCMP_ULE;
|
|
|
|
case FCMP_ULE: return FCMP_UGE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// SwitchInst Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumCases) {
|
2004-07-29 14:33:25 +02:00
|
|
|
assert(Value && Default);
|
2005-01-29 01:35:16 +01:00
|
|
|
ReservedSpace = 2+NumCases*2;
|
|
|
|
NumOperands = 2;
|
|
|
|
OperandList = new Use[ReservedSpace];
|
|
|
|
|
|
|
|
OperandList[0].init(Value, this);
|
|
|
|
OperandList[1].init(Default, this);
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
2005-04-22 01:48:37 +02:00
|
|
|
SwitchInst::SwitchInst(const SwitchInst &SI)
|
2005-01-29 01:35:16 +01:00
|
|
|
: TerminatorInst(Instruction::Switch, new Use[SI.getNumOperands()],
|
|
|
|
SI.getNumOperands()) {
|
|
|
|
Use *OL = OperandList, *InOL = SI.OperandList;
|
|
|
|
for (unsigned i = 0, E = SI.getNumOperands(); i != E; i+=2) {
|
|
|
|
OL[i].init(InOL[i], this);
|
|
|
|
OL[i+1].init(InOL[i+1], this);
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-01-29 01:35:16 +01:00
|
|
|
SwitchInst::~SwitchInst() {
|
|
|
|
delete [] OperandList;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-07-29 14:33:25 +02:00
|
|
|
/// addCase - Add an entry to the switch instruction...
|
|
|
|
///
|
2005-02-24 06:32:09 +01:00
|
|
|
void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
|
2005-01-29 01:35:16 +01:00
|
|
|
unsigned OpNo = NumOperands;
|
|
|
|
if (OpNo+2 > ReservedSpace)
|
|
|
|
resizeOperands(0); // Get more space!
|
|
|
|
// Initialize some new operands.
|
2005-01-29 02:05:12 +01:00
|
|
|
assert(OpNo+1 < ReservedSpace && "Growing didn't work!");
|
2005-01-29 01:35:16 +01:00
|
|
|
NumOperands = OpNo+2;
|
|
|
|
OperandList[OpNo].init(OnVal, this);
|
|
|
|
OperandList[OpNo+1].init(Dest, this);
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/// removeCase - This method removes the specified successor from the switch
|
|
|
|
/// instruction. Note that this cannot be used to remove the default
|
|
|
|
/// destination (successor #0).
|
|
|
|
///
|
|
|
|
void SwitchInst::removeCase(unsigned idx) {
|
|
|
|
assert(idx != 0 && "Cannot remove the default case!");
|
2005-01-29 01:35:16 +01:00
|
|
|
assert(idx*2 < getNumOperands() && "Successor index out of range!!!");
|
|
|
|
|
|
|
|
unsigned NumOps = getNumOperands();
|
|
|
|
Use *OL = OperandList;
|
|
|
|
|
|
|
|
// Move everything after this operand down.
|
|
|
|
//
|
|
|
|
// FIXME: we could just swap with the end of the list, then erase. However,
|
|
|
|
// client might not expect this to happen. The code as it is thrashes the
|
|
|
|
// use/def lists, which is kinda lame.
|
|
|
|
for (unsigned i = (idx+1)*2; i != NumOps; i += 2) {
|
|
|
|
OL[i-2] = OL[i];
|
|
|
|
OL[i-2+1] = OL[i+1];
|
|
|
|
}
|
|
|
|
|
|
|
|
// Nuke the last value.
|
|
|
|
OL[NumOps-2].set(0);
|
|
|
|
OL[NumOps-2+1].set(0);
|
|
|
|
NumOperands = NumOps-2;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// resizeOperands - resize operands - This adjusts the length of the operands
|
|
|
|
/// list according to the following behavior:
|
|
|
|
/// 1. If NumOps == 0, grow the operand list in response to a push_back style
|
|
|
|
/// of operation. This grows the number of ops by 1.5 times.
|
|
|
|
/// 2. If NumOps > NumOperands, reserve space for NumOps operands.
|
|
|
|
/// 3. If NumOps == NumOperands, trim the reserved space.
|
|
|
|
///
|
|
|
|
void SwitchInst::resizeOperands(unsigned NumOps) {
|
|
|
|
if (NumOps == 0) {
|
2005-01-29 02:05:12 +01:00
|
|
|
NumOps = getNumOperands()/2*6;
|
2005-01-29 01:35:16 +01:00
|
|
|
} else if (NumOps*2 > NumOperands) {
|
|
|
|
// No resize needed.
|
|
|
|
if (ReservedSpace >= NumOps) return;
|
|
|
|
} else if (NumOps == NumOperands) {
|
|
|
|
if (ReservedSpace == NumOps) return;
|
|
|
|
} else {
|
2005-01-29 02:05:12 +01:00
|
|
|
return;
|
2005-01-29 01:35:16 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
ReservedSpace = NumOps;
|
|
|
|
Use *NewOps = new Use[NumOps];
|
|
|
|
Use *OldOps = OperandList;
|
|
|
|
for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
|
|
|
|
NewOps[i].init(OldOps[i], this);
|
|
|
|
OldOps[i].set(0);
|
|
|
|
}
|
|
|
|
delete [] OldOps;
|
|
|
|
OperandList = NewOps;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
BasicBlock *SwitchInst::getSuccessorV(unsigned idx) const {
|
|
|
|
return getSuccessor(idx);
|
|
|
|
}
|
|
|
|
unsigned SwitchInst::getNumSuccessorsV() const {
|
|
|
|
return getNumSuccessors();
|
|
|
|
}
|
|
|
|
void SwitchInst::setSuccessorV(unsigned idx, BasicBlock *B) {
|
|
|
|
setSuccessor(idx, B);
|
2004-07-29 14:33:25 +02:00
|
|
|
}
|
2004-10-16 01:52:53 +02:00
|
|
|
|
|
|
|
|
|
|
|
// Define these methods here so vtables don't get emitted into every translation
|
|
|
|
// unit that uses these classes.
|
|
|
|
|
|
|
|
GetElementPtrInst *GetElementPtrInst::clone() const {
|
|
|
|
return new GetElementPtrInst(*this);
|
|
|
|
}
|
|
|
|
|
|
|
|
BinaryOperator *BinaryOperator::clone() const {
|
2005-01-29 01:35:16 +01:00
|
|
|
return create(getOpcode(), Ops[0], Ops[1]);
|
2004-10-16 01:52:53 +02:00
|
|
|
}
|
|
|
|
|
2006-11-20 02:22:35 +01:00
|
|
|
CmpInst* CmpInst::clone() const {
|
|
|
|
return create(Instruction::OtherOps(getOpcode()), getPredicate(),
|
|
|
|
Ops[0], Ops[1]);
|
|
|
|
}
|
|
|
|
|
2006-11-27 02:05:10 +01:00
|
|
|
MallocInst *MallocInst::clone() const { return new MallocInst(*this); }
|
|
|
|
AllocaInst *AllocaInst::clone() const { return new AllocaInst(*this); }
|
|
|
|
FreeInst *FreeInst::clone() const { return new FreeInst(getOperand(0)); }
|
|
|
|
LoadInst *LoadInst::clone() const { return new LoadInst(*this); }
|
|
|
|
StoreInst *StoreInst::clone() const { return new StoreInst(*this); }
|
|
|
|
CastInst *TruncInst::clone() const { return new TruncInst(*this); }
|
|
|
|
CastInst *ZExtInst::clone() const { return new ZExtInst(*this); }
|
|
|
|
CastInst *SExtInst::clone() const { return new SExtInst(*this); }
|
|
|
|
CastInst *FPTruncInst::clone() const { return new FPTruncInst(*this); }
|
|
|
|
CastInst *FPExtInst::clone() const { return new FPExtInst(*this); }
|
|
|
|
CastInst *UIToFPInst::clone() const { return new UIToFPInst(*this); }
|
|
|
|
CastInst *SIToFPInst::clone() const { return new SIToFPInst(*this); }
|
|
|
|
CastInst *FPToUIInst::clone() const { return new FPToUIInst(*this); }
|
|
|
|
CastInst *FPToSIInst::clone() const { return new FPToSIInst(*this); }
|
|
|
|
CastInst *PtrToIntInst::clone() const { return new PtrToIntInst(*this); }
|
|
|
|
CastInst *IntToPtrInst::clone() const { return new IntToPtrInst(*this); }
|
|
|
|
CastInst *BitCastInst::clone() const { return new BitCastInst(*this); }
|
|
|
|
CallInst *CallInst::clone() const { return new CallInst(*this); }
|
|
|
|
ShiftInst *ShiftInst::clone() const { return new ShiftInst(*this); }
|
|
|
|
SelectInst *SelectInst::clone() const { return new SelectInst(*this); }
|
|
|
|
VAArgInst *VAArgInst::clone() const { return new VAArgInst(*this); }
|
|
|
|
|
2006-04-08 03:18:18 +02:00
|
|
|
ExtractElementInst *ExtractElementInst::clone() const {
|
|
|
|
return new ExtractElementInst(*this);
|
|
|
|
}
|
|
|
|
InsertElementInst *InsertElementInst::clone() const {
|
|
|
|
return new InsertElementInst(*this);
|
|
|
|
}
|
|
|
|
ShuffleVectorInst *ShuffleVectorInst::clone() const {
|
|
|
|
return new ShuffleVectorInst(*this);
|
|
|
|
}
|
2004-10-16 01:52:53 +02:00
|
|
|
PHINode *PHINode::clone() const { return new PHINode(*this); }
|
|
|
|
ReturnInst *ReturnInst::clone() const { return new ReturnInst(*this); }
|
|
|
|
BranchInst *BranchInst::clone() const { return new BranchInst(*this); }
|
|
|
|
SwitchInst *SwitchInst::clone() const { return new SwitchInst(*this); }
|
|
|
|
InvokeInst *InvokeInst::clone() const { return new InvokeInst(*this); }
|
|
|
|
UnwindInst *UnwindInst::clone() const { return new UnwindInst(); }
|
2004-10-16 20:08:06 +02:00
|
|
|
UnreachableInst *UnreachableInst::clone() const { return new UnreachableInst();}
|