1 //===-- iOperators.cpp - Implement binary Operators ------------*- C++ -*--===//
3 // This file implements the nontrivial binary operator instructions.
5 //===----------------------------------------------------------------------===//
7 #include "llvm/iOperators.h"
9 #include "llvm/Constants.h"
10 #include "llvm/BasicBlock.h"
12 //===----------------------------------------------------------------------===//
13 // BinaryOperator Class
14 //===----------------------------------------------------------------------===//
16 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
17 const Type *Ty, const std::string &Name,
18 Instruction *InsertBefore)
19 : Instruction(Ty, iType, Name, InsertBefore) {
22 Operands.push_back(Use(S1, this));
23 Operands.push_back(Use(S2, this));
24 assert(S1 && S2 && S1->getType() == S2->getType());
31 assert(Ty == S1->getType() &&
32 "Arithmetic operation should return same type as operands!");
33 assert((Ty->isInteger() || Ty->isFloatingPoint()) &&
34 "Tried to create an arithmetic operation on a non-arithmetic type!");
38 assert(Ty == S1->getType() &&
39 "Logical operation should return same type as operands!");
40 assert(Ty->isIntegral() &&
41 "Tried to create an logical operation on a non-integral type!");
43 case SetLT: case SetGT: case SetLE:
44 case SetGE: case SetEQ: case SetNE:
45 assert(Ty == Type::BoolTy && "Setcc must return bool!");
55 BinaryOperator *BinaryOperator::create(BinaryOps Op, Value *S1, Value *S2,
56 const std::string &Name,
57 Instruction *InsertBefore) {
58 assert(S1->getType() == S2->getType() &&
59 "Cannot create binary operator with two operands of differing type!");
61 // Binary comparison operators...
62 case SetLT: case SetGT: case SetLE:
63 case SetGE: case SetEQ: case SetNE:
64 return new SetCondInst(Op, S1, S2, Name, InsertBefore);
67 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
71 BinaryOperator *BinaryOperator::createNeg(Value *Op, const std::string &Name,
72 Instruction *InsertBefore) {
73 return new BinaryOperator(Instruction::Sub,
74 Constant::getNullValue(Op->getType()), Op,
75 Op->getType(), Name, InsertBefore);
78 BinaryOperator *BinaryOperator::createNot(Value *Op, const std::string &Name,
79 Instruction *InsertBefore) {
80 return new BinaryOperator(Instruction::Xor, Op,
81 ConstantIntegral::getAllOnesValue(Op->getType()),
82 Op->getType(), Name, InsertBefore);
86 // isConstantAllOnes - Helper function for several functions below
87 static inline bool isConstantAllOnes(const Value *V) {
88 return isa<ConstantIntegral>(V) &&cast<ConstantIntegral>(V)->isAllOnesValue();
91 bool BinaryOperator::isNeg(const Value *V) {
92 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
93 return Bop->getOpcode() == Instruction::Sub &&
94 Bop->getOperand(0) == Constant::getNullValue(Bop->getType());
98 bool BinaryOperator::isNot(const Value *V) {
99 if (const BinaryOperator *Bop = dyn_cast<BinaryOperator>(V))
100 return (Bop->getOpcode() == Instruction::Xor &&
101 (isConstantAllOnes(Bop->getOperand(1)) ||
102 isConstantAllOnes(Bop->getOperand(0))));
106 Value *BinaryOperator::getNegArgument(BinaryOperator *Bop) {
107 assert(isNeg(Bop) && "getNegArgument from non-'neg' instruction!");
108 return Bop->getOperand(1);
111 const Value *BinaryOperator::getNegArgument(const BinaryOperator *Bop) {
112 return getNegArgument((BinaryOperator*)Bop);
115 Value *BinaryOperator::getNotArgument(BinaryOperator *Bop) {
116 assert(isNot(Bop) && "getNotArgument on non-'not' instruction!");
117 Value *Op0 = Bop->getOperand(0);
118 Value *Op1 = Bop->getOperand(1);
119 if (isConstantAllOnes(Op0)) return Op1;
121 assert(isConstantAllOnes(Op1));
125 const Value *BinaryOperator::getNotArgument(const BinaryOperator *Bop) {
126 return getNotArgument((BinaryOperator*)Bop);
130 // swapOperands - Exchange the two operands to this instruction. This
131 // instruction is safe to use on any binary instruction and does not
132 // modify the semantics of the instruction. If the instruction is
133 // order dependent (SetLT f.e.) the opcode is changed.
135 bool BinaryOperator::swapOperands() {
137 ; // If the instruction is commutative, it is safe to swap the operands
138 else if (SetCondInst *SCI = dyn_cast<SetCondInst>(this))
139 iType = SCI->getSwappedCondition();
141 return true; // Can't commute operands
143 std::swap(Operands[0], Operands[1]);
148 //===----------------------------------------------------------------------===//
150 //===----------------------------------------------------------------------===//
152 SetCondInst::SetCondInst(BinaryOps Opcode, Value *S1, Value *S2,
153 const std::string &Name, Instruction *InsertBefore)
154 : BinaryOperator(Opcode, S1, S2, Type::BoolTy, Name, InsertBefore) {
156 // Make sure it's a valid type... getInverseCondition will assert out if not.
157 assert(getInverseCondition(Opcode));
160 // getInverseCondition - Return the inverse of the current condition opcode.
161 // For example seteq -> setne, setgt -> setle, setlt -> setge, etc...
163 Instruction::BinaryOps SetCondInst::getInverseCondition(BinaryOps Opcode) {
166 assert(0 && "Unknown setcc opcode!");
167 case SetEQ: return SetNE;
168 case SetNE: return SetEQ;
169 case SetGT: return SetLE;
170 case SetLT: return SetGE;
171 case SetGE: return SetLT;
172 case SetLE: return SetGT;
176 // getSwappedCondition - Return the condition opcode that would be the result
177 // of exchanging the two operands of the setcc instruction without changing
178 // the result produced. Thus, seteq->seteq, setle->setge, setlt->setgt, etc.
180 Instruction::BinaryOps SetCondInst::getSwappedCondition(BinaryOps Opcode) {
182 default: assert(0 && "Unknown setcc instruction!");
183 case SetEQ: case SetNE: return Opcode;
184 case SetGT: return SetLT;
185 case SetLT: return SetGT;
186 case SetGE: return SetLE;
187 case SetLE: return SetGE;