1 //===-- SelectionDAG.cpp - Implement the SelectionDAG data structures -----===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This implements the SelectionDAG class.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/CodeGen/SelectionDAG.h"
15 #include "llvm/Constants.h"
16 #include "llvm/GlobalValue.h"
17 #include "llvm/Assembly/Writer.h"
18 #include "llvm/CodeGen/MachineBasicBlock.h"
19 #include "llvm/Target/TargetLowering.h"
26 static bool isCommutativeBinOp(unsigned Opcode) {
32 case ISD::XOR: return true;
33 default: return false; // FIXME: Need commutative info for user ops!
37 static bool isAssociativeBinOp(unsigned Opcode) {
43 case ISD::XOR: return true;
44 default: return false; // FIXME: Need associative info for user ops!
48 static unsigned ExactLog2(uint64_t Val) {
57 // isInvertibleForFree - Return true if there is no cost to emitting the logical
58 // inverse of this node.
59 static bool isInvertibleForFree(SDOperand N) {
60 if (isa<ConstantSDNode>(N.Val)) return true;
61 if (isa<SetCCSDNode>(N.Val) && N.Val->hasOneUse())
67 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
68 /// when given the operation for (X op Y).
69 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
70 // To perform this operation, we just need to swap the L and G bits of the
72 unsigned OldL = (Operation >> 2) & 1;
73 unsigned OldG = (Operation >> 1) & 1;
74 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
75 (OldL << 1) | // New G bit
76 (OldG << 2)); // New L bit.
79 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
80 /// 'op' is a valid SetCC operation.
81 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
82 unsigned Operation = Op;
84 Operation ^= 7; // Flip L, G, E bits, but not U.
86 Operation ^= 15; // Flip all of the condition bits.
87 if (Operation > ISD::SETTRUE2)
88 Operation &= ~8; // Don't let N and U bits get set.
89 return ISD::CondCode(Operation);
93 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
94 /// signed operation and 2 if the result is an unsigned comparison. Return zero
95 /// if the operation does not depend on the sign of the input (setne and seteq).
96 static int isSignedOp(ISD::CondCode Opcode) {
98 default: assert(0 && "Illegal integer setcc operation!");
100 case ISD::SETNE: return 0;
104 case ISD::SETGE: return 1;
108 case ISD::SETUGE: return 2;
112 /// getSetCCOrOperation - Return the result of a logical OR between different
113 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
114 /// returns SETCC_INVALID if it is not possible to represent the resultant
116 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
118 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
119 // Cannot fold a signed integer setcc with an unsigned integer setcc.
120 return ISD::SETCC_INVALID;
122 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
124 // If the N and U bits get set then the resultant comparison DOES suddenly
125 // care about orderedness, and is true when ordered.
126 if (Op > ISD::SETTRUE2)
127 Op &= ~16; // Clear the N bit.
128 return ISD::CondCode(Op);
131 /// getSetCCAndOperation - Return the result of a logical AND between different
132 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
133 /// function returns zero if it is not possible to represent the resultant
135 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
137 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
138 // Cannot fold a signed setcc with an unsigned setcc.
139 return ISD::SETCC_INVALID;
141 // Combine all of the condition bits.
142 return ISD::CondCode(Op1 & Op2);
145 const TargetMachine &SelectionDAG::getTarget() const {
146 return TLI.getTargetMachine();
150 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
151 /// SelectionDAG, including nodes (like loads) that have uses of their token
152 /// chain but no other uses and no side effect. If a node is passed in as an
153 /// argument, it is used as the seed for node deletion.
154 void SelectionDAG::RemoveDeadNodes(SDNode *N) {
155 std::set<SDNode*> AllNodeSet(AllNodes.begin(), AllNodes.end());
157 // Create a dummy node (which is not added to allnodes), that adds a reference
158 // to the root node, preventing it from being deleted.
159 SDNode *DummyNode = new SDNode(ISD::EntryToken, getRoot());
161 DeleteNodeIfDead(N, &AllNodeSet);
164 unsigned NumNodes = AllNodeSet.size();
165 for (std::set<SDNode*>::iterator I = AllNodeSet.begin(), E = AllNodeSet.end();
167 // Try to delete this node.
168 DeleteNodeIfDead(*I, &AllNodeSet);
170 // If we actually deleted any nodes, do not use invalid iterators in
172 if (AllNodeSet.size() != NumNodes)
177 if (AllNodes.size() != NumNodes)
178 AllNodes.assign(AllNodeSet.begin(), AllNodeSet.end());
180 // If the root changed (e.g. it was a dead load, update the root).
181 setRoot(DummyNode->getOperand(0));
183 // Now that we are done with the dummy node, delete it.
184 DummyNode->getOperand(0).Val->removeUser(DummyNode);
188 void SelectionDAG::DeleteNodeIfDead(SDNode *N, void *NodeSet) {
192 // Okay, we really are going to delete this node. First take this out of the
193 // appropriate CSE map.
194 switch (N->getOpcode()) {
196 Constants.erase(std::make_pair(cast<ConstantSDNode>(N)->getValue(),
197 N->getValueType(0)));
199 case ISD::ConstantFP:
200 ConstantFPs.erase(std::make_pair(cast<ConstantFPSDNode>(N)->getValue(),
201 N->getValueType(0)));
203 case ISD::GlobalAddress:
204 GlobalValues.erase(cast<GlobalAddressSDNode>(N)->getGlobal());
206 case ISD::FrameIndex:
207 FrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex());
209 case ISD::ConstantPool:
210 ConstantPoolIndices.erase(cast<ConstantPoolSDNode>(N)->getIndex());
212 case ISD::BasicBlock:
213 BBNodes.erase(cast<BasicBlockSDNode>(N)->getBasicBlock());
215 case ISD::ExternalSymbol:
216 ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
220 Loads.erase(std::make_pair(N->getOperand(1),
221 std::make_pair(N->getOperand(0),
222 N->getValueType(0))));
225 SetCCs.erase(std::make_pair(std::make_pair(N->getOperand(0),
228 cast<SetCCSDNode>(N)->getCondition(),
229 N->getValueType(0))));
231 case ISD::TRUNCSTORE:
232 case ISD::SIGN_EXTEND_INREG:
233 case ISD::ZERO_EXTEND_INREG:
234 case ISD::FP_ROUND_INREG:
237 case ISD::ZEXTLOAD: {
239 NN.Opcode = ISD::TRUNCSTORE;
240 NN.VT = N->getValueType(0);
241 NN.EVT = cast<MVTSDNode>(N)->getExtraValueType();
242 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
243 NN.Ops.push_back(N->getOperand(i));
244 MVTSDNodes.erase(NN);
248 if (N->getNumOperands() == 1)
249 UnaryOps.erase(std::make_pair(N->getOpcode(),
250 std::make_pair(N->getOperand(0),
251 N->getValueType(0))));
252 else if (N->getNumOperands() == 2)
253 BinaryOps.erase(std::make_pair(N->getOpcode(),
254 std::make_pair(N->getOperand(0),
259 // Next, brutally remove the operand list.
260 while (!N->Operands.empty()) {
261 SDNode *O = N->Operands.back().Val;
262 N->Operands.pop_back();
265 // Now that we removed this operand, see if there are no uses of it left.
266 DeleteNodeIfDead(O, NodeSet);
269 // Remove the node from the nodes set and delete it.
270 std::set<SDNode*> &AllNodeSet = *(std::set<SDNode*>*)NodeSet;
273 // Now that the node is gone, check to see if any of the operands of this node
279 SelectionDAG::~SelectionDAG() {
280 for (unsigned i = 0, e = AllNodes.size(); i != e; ++i)
284 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT) {
285 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
286 // Mask out any bits that are not valid for this constant.
288 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1;
290 SDNode *&N = Constants[std::make_pair(Val, VT)];
291 if (N) return SDOperand(N, 0);
292 N = new ConstantSDNode(Val, VT);
293 AllNodes.push_back(N);
294 return SDOperand(N, 0);
297 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT) {
298 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
300 Val = (float)Val; // Mask out extra precision.
302 SDNode *&N = ConstantFPs[std::make_pair(Val, VT)];
303 if (N) return SDOperand(N, 0);
304 N = new ConstantFPSDNode(Val, VT);
305 AllNodes.push_back(N);
306 return SDOperand(N, 0);
311 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
313 SDNode *&N = GlobalValues[GV];
314 if (N) return SDOperand(N, 0);
315 N = new GlobalAddressSDNode(GV,VT);
316 AllNodes.push_back(N);
317 return SDOperand(N, 0);
320 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT) {
321 SDNode *&N = FrameIndices[FI];
322 if (N) return SDOperand(N, 0);
323 N = new FrameIndexSDNode(FI, VT);
324 AllNodes.push_back(N);
325 return SDOperand(N, 0);
328 SDOperand SelectionDAG::getConstantPool(unsigned CPIdx, MVT::ValueType VT) {
329 SDNode *N = ConstantPoolIndices[CPIdx];
330 if (N) return SDOperand(N, 0);
331 N = new ConstantPoolSDNode(CPIdx, VT);
332 AllNodes.push_back(N);
333 return SDOperand(N, 0);
336 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
337 SDNode *&N = BBNodes[MBB];
338 if (N) return SDOperand(N, 0);
339 N = new BasicBlockSDNode(MBB);
340 AllNodes.push_back(N);
341 return SDOperand(N, 0);
344 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
345 SDNode *&N = ExternalSymbols[Sym];
346 if (N) return SDOperand(N, 0);
347 N = new ExternalSymbolSDNode(Sym, VT);
348 AllNodes.push_back(N);
349 return SDOperand(N, 0);
352 SDOperand SelectionDAG::getSetCC(ISD::CondCode Cond, MVT::ValueType VT,
353 SDOperand N1, SDOperand N2) {
354 // These setcc operations always fold.
358 case ISD::SETFALSE2: return getConstant(0, VT);
360 case ISD::SETTRUE2: return getConstant(1, VT);
363 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val))
364 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
365 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
367 // Sign extend the operands if required
368 if (ISD::isSignedIntSetCC(Cond)) {
369 C1 = N1C->getSignExtended();
370 C2 = N2C->getSignExtended();
374 default: assert(0 && "Unknown integer setcc!");
375 case ISD::SETEQ: return getConstant(C1 == C2, VT);
376 case ISD::SETNE: return getConstant(C1 != C2, VT);
377 case ISD::SETULT: return getConstant(C1 < C2, VT);
378 case ISD::SETUGT: return getConstant(C1 > C2, VT);
379 case ISD::SETULE: return getConstant(C1 <= C2, VT);
380 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
381 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
382 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
383 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
384 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
387 // Ensure that the constant occurs on the RHS.
388 Cond = ISD::getSetCCSwappedOperands(Cond);
392 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
393 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
394 double C1 = N1C->getValue(), C2 = N2C->getValue();
397 default: break; // FIXME: Implement the rest of these!
398 case ISD::SETEQ: return getConstant(C1 == C2, VT);
399 case ISD::SETNE: return getConstant(C1 != C2, VT);
400 case ISD::SETLT: return getConstant(C1 < C2, VT);
401 case ISD::SETGT: return getConstant(C1 > C2, VT);
402 case ISD::SETLE: return getConstant(C1 <= C2, VT);
403 case ISD::SETGE: return getConstant(C1 >= C2, VT);
406 // Ensure that the constant occurs on the RHS.
407 Cond = ISD::getSetCCSwappedOperands(Cond);
412 // We can always fold X == Y for integer setcc's.
413 if (MVT::isInteger(N1.getValueType()))
414 return getConstant(ISD::isTrueWhenEqual(Cond), VT);
415 unsigned UOF = ISD::getUnorderedFlavor(Cond);
416 if (UOF == 2) // FP operators that are undefined on NaNs.
417 return getConstant(ISD::isTrueWhenEqual(Cond), VT);
418 if (UOF == ISD::isTrueWhenEqual(Cond))
419 return getConstant(UOF, VT);
420 // Otherwise, we can't fold it. However, we can simplify it to SETUO/SETO
421 // if it is not already.
422 Cond = UOF == 0 ? ISD::SETUO : ISD::SETO;
425 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
426 MVT::isInteger(N1.getValueType())) {
427 if (N1.getOpcode() == ISD::ADD || N1.getOpcode() == ISD::SUB ||
428 N1.getOpcode() == ISD::XOR) {
429 // Simplify (X+Y) == (X+Z) --> Y == Z
430 if (N1.getOpcode() == N2.getOpcode()) {
431 if (N1.getOperand(0) == N2.getOperand(0))
432 return getSetCC(Cond, VT, N1.getOperand(1), N2.getOperand(1));
433 if (N1.getOperand(1) == N2.getOperand(1))
434 return getSetCC(Cond, VT, N1.getOperand(0), N2.getOperand(0));
435 if (isCommutativeBinOp(N1.getOpcode())) {
436 // If X op Y == Y op X, try other combinations.
437 if (N1.getOperand(0) == N2.getOperand(1))
438 return getSetCC(Cond, VT, N1.getOperand(1), N2.getOperand(0));
439 if (N1.getOperand(1) == N2.getOperand(0))
440 return getSetCC(Cond, VT, N1.getOperand(1), N2.getOperand(1));
444 // FIXME: move this stuff to the DAG Combiner when it exists!
446 // Simplify (X+Z) == X --> Z == 0
447 if (N1.getOperand(0) == N2)
448 return getSetCC(Cond, VT, N1.getOperand(1),
449 getConstant(0, N1.getValueType()));
450 if (N1.getOperand(1) == N2) {
451 if (isCommutativeBinOp(N1.getOpcode()))
452 return getSetCC(Cond, VT, N1.getOperand(0),
453 getConstant(0, N1.getValueType()));
455 assert(N1.getOpcode() == ISD::SUB && "Unexpected operation!");
456 // (Z-X) == X --> Z == X<<1
457 return getSetCC(Cond, VT, N1.getOperand(0),
458 getNode(ISD::SHL, N2.getValueType(),
459 N2, getConstant(1, TLI.getShiftAmountTy())));
464 if (N2.getOpcode() == ISD::ADD || N2.getOpcode() == ISD::SUB ||
465 N2.getOpcode() == ISD::XOR) {
466 // Simplify X == (X+Z) --> Z == 0
467 if (N2.getOperand(0) == N1)
468 return getSetCC(Cond, VT, N2.getOperand(1),
469 getConstant(0, N2.getValueType()));
470 else if (N2.getOperand(1) == N1)
471 return getSetCC(Cond, VT, N2.getOperand(0),
472 getConstant(0, N2.getValueType()));
476 SetCCSDNode *&N = SetCCs[std::make_pair(std::make_pair(N1, N2),
477 std::make_pair(Cond, VT))];
478 if (N) return SDOperand(N, 0);
479 N = new SetCCSDNode(Cond, N1, N2);
480 N->setValueTypes(VT);
481 AllNodes.push_back(N);
482 return SDOperand(N, 0);
487 /// getNode - Gets or creates the specified node.
489 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
490 SDNode *N = new SDNode(Opcode, VT);
491 AllNodes.push_back(N);
492 return SDOperand(N, 0);
495 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
497 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
498 uint64_t Val = C->getValue();
501 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
502 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
503 case ISD::TRUNCATE: return getConstant(Val, VT);
504 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT);
505 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT);
509 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val))
513 return getConstantFP(C->getValue(), VT);
514 case ISD::FP_TO_SINT:
515 return getConstant((int64_t)C->getValue(), VT);
516 case ISD::FP_TO_UINT:
517 return getConstant((uint64_t)C->getValue(), VT);
520 unsigned OpOpcode = Operand.Val->getOpcode();
522 case ISD::TokenFactor:
523 return Operand; // Factor of one node? No factor.
524 case ISD::SIGN_EXTEND:
525 if (Operand.getValueType() == VT) return Operand; // noop extension
526 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
527 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
529 case ISD::ZERO_EXTEND:
530 if (Operand.getValueType() == VT) return Operand; // noop extension
531 if (OpOpcode == ISD::ZERO_EXTEND)
532 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
535 if (Operand.getValueType() == VT) return Operand; // noop truncate
536 if (OpOpcode == ISD::TRUNCATE)
537 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
538 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND) {
539 // If the source is smaller than the dest, we still need an extend.
540 if (Operand.Val->getOperand(0).getValueType() < VT)
541 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
542 else if (Operand.Val->getOperand(0).getValueType() > VT)
543 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
545 return Operand.Val->getOperand(0);
550 SDNode *&N = UnaryOps[std::make_pair(Opcode, std::make_pair(Operand, VT))];
551 if (N) return SDOperand(N, 0);
552 N = new SDNode(Opcode, Operand);
553 N->setValueTypes(VT);
554 AllNodes.push_back(N);
555 return SDOperand(N, 0);
558 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
559 SDOperand N1, SDOperand N2) {
562 case ISD::TokenFactor:
563 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
564 N2.getValueType() == MVT::Other && "Invalid token factor!");
571 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
578 assert(N1.getValueType() == N2.getValueType() &&
579 N1.getValueType() == VT && "Binary operator types must match!");
585 assert(VT == N1.getValueType() &&
586 "Shift operators return type must be the same as their first arg");
587 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
588 VT != MVT::i1 && "Shifts only work on integers");
594 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
595 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
598 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
600 case ISD::ADD: return getConstant(C1 + C2, VT);
601 case ISD::SUB: return getConstant(C1 - C2, VT);
602 case ISD::MUL: return getConstant(C1 * C2, VT);
604 if (C2) return getConstant(C1 / C2, VT);
607 if (C2) return getConstant(C1 % C2, VT);
610 if (C2) return getConstant(N1C->getSignExtended() /
611 N2C->getSignExtended(), VT);
614 if (C2) return getConstant(N1C->getSignExtended() %
615 N2C->getSignExtended(), VT);
617 case ISD::AND : return getConstant(C1 & C2, VT);
618 case ISD::OR : return getConstant(C1 | C2, VT);
619 case ISD::XOR : return getConstant(C1 ^ C2, VT);
620 case ISD::SHL : return getConstant(C1 << (int)C2, VT);
621 case ISD::SRL : return getConstant(C1 >> (unsigned)C2, VT);
622 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
626 } else { // Cannonicalize constant to RHS if commutative
627 if (isCommutativeBinOp(Opcode)) {
635 case ISD::SHL: // shl 0, X -> 0
636 if (N1C->isNullValue()) return N1;
638 case ISD::SRL: // srl 0, X -> 0
639 if (N1C->isNullValue()) return N1;
641 case ISD::SRA: // sra -1, X -> -1
642 if (N1C->isAllOnesValue()) return N1;
648 uint64_t C2 = N2C->getValue();
652 if (!C2) return N1; // add X, 0 -> X
655 if (!C2) return N1; // sub X, 0 -> X
658 if (!C2) return N2; // mul X, 0 -> 0
659 if (N2C->isAllOnesValue()) // mul X, -1 -> 0-X
660 return getNode(ISD::SUB, VT, getConstant(0, VT), N1);
662 // FIXME: Move this to the DAG combiner when it exists.
663 if ((C2 & C2-1) == 0) {
664 SDOperand ShAmt = getConstant(ExactLog2(C2), TLI.getShiftAmountTy());
665 return getNode(ISD::SHL, VT, N1, ShAmt);
670 // FIXME: Move this to the DAG combiner when it exists.
671 if ((C2 & C2-1) == 0 && C2) {
672 SDOperand ShAmt = getConstant(ExactLog2(C2), TLI.getShiftAmountTy());
673 return getNode(ISD::SRL, VT, N1, ShAmt);
679 // If the shift amount is bigger than the size of the data, simplify.
680 if (C2 >= MVT::getSizeInBits(N1.getValueType())) {
681 if (TLI.getShiftAmountFlavor() == TargetLowering::Mask) {
683 C2 & ((1 << MVT::getSizeInBits(N1.getValueType()))-1);
684 return getNode(Opcode, VT, N1, getConstant(NewAmt,N2.getValueType()));
685 } else if (TLI.getShiftAmountFlavor() == TargetLowering::Extend) {
686 // Shifting all of the bits out?
687 return getConstant(0, N1.getValueType());
692 if (C2 == 0) return N1;
696 if (!C2) return N2; // X and 0 -> 0
697 if (N2C->isAllOnesValue())
698 return N1; // X and -1 -> X
701 if (!C2)return N1; // X or 0 -> X
702 if (N2C->isAllOnesValue())
703 return N2; // X or -1 -> -1
706 if (!C2) return N1; // X xor 0 -> X
707 if (N2C->isAllOnesValue()) {
708 if (SetCCSDNode *SetCC = dyn_cast<SetCCSDNode>(N1.Val)){
709 // !(X op Y) -> (X !op Y)
710 bool isInteger = MVT::isInteger(SetCC->getOperand(0).getValueType());
711 return getSetCC(ISD::getSetCCInverse(SetCC->getCondition(),isInteger),
712 SetCC->getValueType(0),
713 SetCC->getOperand(0), SetCC->getOperand(1));
714 } else if (N1.getOpcode() == ISD::AND || N1.getOpcode() == ISD::OR) {
716 // !(X or Y) -> (!X and !Y) iff X or Y are freely invertible
717 // !(X and Y) -> (!X or !Y) iff X or Y are freely invertible
718 SDOperand LHS = Op->getOperand(0), RHS = Op->getOperand(1);
719 if (isInvertibleForFree(RHS) || isInvertibleForFree(LHS)) {
720 LHS = getNode(ISD::XOR, VT, LHS, N2); // RHS = ~LHS
721 RHS = getNode(ISD::XOR, VT, RHS, N2); // RHS = ~RHS
722 if (Op->getOpcode() == ISD::AND)
723 return getNode(ISD::OR, VT, LHS, RHS);
724 return getNode(ISD::AND, VT, LHS, RHS);
727 // X xor -1 -> not(x) ?
732 // Reassociate ((X op C1) op C2) if possible.
733 if (N1.getOpcode() == Opcode && isAssociativeBinOp(Opcode))
734 if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N1.Val->getOperand(1)))
735 return getNode(Opcode, VT, N1.Val->getOperand(0),
736 getNode(Opcode, VT, N2, N1.Val->getOperand(1)));
739 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
740 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
743 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue();
745 case ISD::ADD: return getConstantFP(C1 + C2, VT);
746 case ISD::SUB: return getConstantFP(C1 - C2, VT);
747 case ISD::MUL: return getConstantFP(C1 * C2, VT);
749 if (C2) return getConstantFP(C1 / C2, VT);
752 if (C2) return getConstantFP(fmod(C1, C2), VT);
757 } else { // Cannonicalize constant to RHS if commutative
758 if (isCommutativeBinOp(Opcode)) {
759 std::swap(N1CFP, N2CFP);
764 // Finally, fold operations that do not require constants.
766 case ISD::TokenFactor:
767 if (N1.getOpcode() == ISD::EntryToken)
769 if (N2.getOpcode() == ISD::EntryToken)
775 if (SetCCSDNode *LHS = dyn_cast<SetCCSDNode>(N1.Val))
776 if (SetCCSDNode *RHS = dyn_cast<SetCCSDNode>(N2.Val)) {
777 SDOperand LL = LHS->getOperand(0), RL = RHS->getOperand(0);
778 SDOperand LR = LHS->getOperand(1), RR = RHS->getOperand(1);
779 ISD::CondCode Op2 = RHS->getCondition();
781 // (X op1 Y) | (Y op2 X) -> (X op1 Y) | (X swapop2 Y)
782 if (LL == RR && LR == RL) {
783 Op2 = ISD::getSetCCSwappedOperands(Op2);
784 goto MatchedBackwards;
787 if (LL == RL && LR == RR) {
789 ISD::CondCode Result;
790 bool isInteger = MVT::isInteger(LL.getValueType());
791 if (Opcode == ISD::OR)
792 Result = ISD::getSetCCOrOperation(LHS->getCondition(), Op2,
795 Result = ISD::getSetCCAndOperation(LHS->getCondition(), Op2,
797 if (Result != ISD::SETCC_INVALID)
798 return getSetCC(Result, LHS->getValueType(0), LL, LR);
803 if (N1 == N2) return getConstant(0, VT); // xor X, Y -> 0
806 if (N1.getOpcode() == ISD::ADD) {
807 if (N1.Val->getOperand(0) == N2)
808 return N1.Val->getOperand(1); // (A+B)-A == B
809 if (N1.Val->getOperand(1) == N2)
810 return N1.Val->getOperand(0); // (A+B)-B == A
815 SDNode *&N = BinaryOps[std::make_pair(Opcode, std::make_pair(N1, N2))];
816 if (N) return SDOperand(N, 0);
817 N = new SDNode(Opcode, N1, N2);
818 N->setValueTypes(VT);
820 AllNodes.push_back(N);
821 return SDOperand(N, 0);
824 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
825 SDOperand Chain, SDOperand Ptr) {
826 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, VT))];
827 if (N) return SDOperand(N, 0);
828 N = new SDNode(ISD::LOAD, Chain, Ptr);
830 // Loads have a token chain.
831 N->setValueTypes(VT, MVT::Other);
832 AllNodes.push_back(N);
833 return SDOperand(N, 0);
837 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
838 SDOperand N1, SDOperand N2, SDOperand N3) {
839 // Perform various simplifications.
840 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
841 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
842 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val);
847 return N2; // select true, X, Y -> X
849 return N3; // select false, X, Y -> Y
851 if (N2 == N3) return N2; // select C, X, X -> X
853 if (VT == MVT::i1) { // Boolean SELECT
856 if (N2C->getValue()) // select C, 1, 0 -> C
858 return getNode(ISD::XOR, VT, N1, N3); // select C, 0, 1 -> ~C
861 if (N2C->getValue()) // select C, 1, X -> C | X
862 return getNode(ISD::OR, VT, N1, N3);
863 else // select C, 0, X -> ~C & X
864 return getNode(ISD::AND, VT,
865 getNode(ISD::XOR, N1.getValueType(), N1,
866 getConstant(1, N1.getValueType())), N3);
868 if (N3C->getValue()) // select C, X, 1 -> ~C | X
869 return getNode(ISD::OR, VT,
870 getNode(ISD::XOR, N1.getValueType(), N1,
871 getConstant(1, N1.getValueType())), N2);
872 else // select C, X, 0 -> C & X
873 return getNode(ISD::AND, VT, N1, N2);
880 if (N2C->getValue()) // Unconditional branch
881 return getNode(ISD::BR, MVT::Other, N1, N3);
883 return N1; // Never-taken branch
887 SDNode *N = new SDNode(Opcode, N1, N2, N3);
890 N->setValueTypes(VT);
892 case ISD::DYNAMIC_STACKALLOC: // DYNAMIC_STACKALLOC produces pointer and chain
893 N->setValueTypes(VT, MVT::Other);
897 // FIXME: memoize NODES
898 AllNodes.push_back(N);
899 return SDOperand(N, 0);
902 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
903 std::vector<SDOperand> &Children) {
904 switch (Children.size()) {
905 case 0: return getNode(Opcode, VT);
906 case 1: return getNode(Opcode, VT, Children[0]);
907 case 2: return getNode(Opcode, VT, Children[0], Children[1]);
908 case 3: return getNode(Opcode, VT, Children[0], Children[1], Children[2]);
911 SDNode *N = new SDNode(Opcode, Children);
912 if (Opcode != ISD::ADD_PARTS && Opcode != ISD::SUB_PARTS) {
913 N->setValueTypes(VT);
915 std::vector<MVT::ValueType> V(N->getNumOperands()/2, VT);
918 AllNodes.push_back(N);
919 return SDOperand(N, 0);
923 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,SDOperand N1,
924 MVT::ValueType EVT) {
927 default: assert(0 && "Bad opcode for this accessor!");
928 case ISD::FP_ROUND_INREG:
929 assert(VT == N1.getValueType() && "Not an inreg round!");
930 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
931 "Cannot FP_ROUND_INREG integer types");
932 if (EVT == VT) return N1; // Not actually rounding
933 assert(EVT < VT && "Not rounding down!");
935 case ISD::ZERO_EXTEND_INREG:
936 case ISD::SIGN_EXTEND_INREG:
937 assert(VT == N1.getValueType() && "Not an inreg extend!");
938 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
939 "Cannot *_EXTEND_INREG FP types");
940 if (EVT == VT) return N1; // Not actually extending
941 assert(EVT < VT && "Not extending!");
943 // If we are sign extending an extension, use the original source.
944 if (N1.getOpcode() == ISD::ZERO_EXTEND_INREG ||
945 N1.getOpcode() == ISD::SIGN_EXTEND_INREG) {
946 if (N1.getOpcode() == Opcode &&
947 cast<MVTSDNode>(N1)->getExtraValueType() <= EVT)
958 NN.Ops.push_back(N1);
960 SDNode *&N = MVTSDNodes[NN];
961 if (N) return SDOperand(N, 0);
962 N = new MVTSDNode(Opcode, VT, N1, EVT);
963 AllNodes.push_back(N);
964 return SDOperand(N, 0);
967 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,SDOperand N1,
968 SDOperand N2, MVT::ValueType EVT) {
970 default: assert(0 && "Bad opcode for this accessor!");
974 // If they are asking for an extending loat from/to the same thing, return a
977 return getNode(ISD::LOAD, VT, N1, N2);
978 assert(EVT < VT && "Should only be an extending load, not truncating!");
979 assert((Opcode == ISD::EXTLOAD || MVT::isInteger(VT)) &&
980 "Cannot sign/zero extend a FP load!");
981 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
982 "Cannot convert from FP to Int or Int -> FP!");
990 NN.Ops.push_back(N1);
991 NN.Ops.push_back(N2);
993 SDNode *&N = MVTSDNodes[NN];
994 if (N) return SDOperand(N, 0);
995 N = new MVTSDNode(Opcode, VT, MVT::Other, N1, N2, EVT);
996 AllNodes.push_back(N);
997 return SDOperand(N, 0);
1000 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,SDOperand N1,
1001 SDOperand N2, SDOperand N3, MVT::ValueType EVT) {
1003 default: assert(0 && "Bad opcode for this accessor!");
1004 case ISD::TRUNCSTORE:
1005 #if 0 // FIXME: If the target supports EVT natively, convert to a truncate/store
1006 // If this is a truncating store of a constant, convert to the desired type
1007 // and store it instead.
1008 if (isa<Constant>(N1)) {
1009 SDOperand Op = getNode(ISD::TRUNCATE, EVT, N1);
1010 if (isa<Constant>(Op))
1013 // Also for ConstantFP?
1015 if (N1.getValueType() == EVT) // Normal store?
1016 return getNode(ISD::STORE, VT, N1, N2, N3);
1017 assert(N2.getValueType() > EVT && "Not a truncation?");
1018 assert(MVT::isInteger(N2.getValueType()) == MVT::isInteger(EVT) &&
1019 "Can't do FP-INT conversion!");
1027 NN.Ops.push_back(N1);
1028 NN.Ops.push_back(N2);
1029 NN.Ops.push_back(N3);
1031 SDNode *&N = MVTSDNodes[NN];
1032 if (N) return SDOperand(N, 0);
1033 N = new MVTSDNode(Opcode, VT, N1, N2, N3, EVT);
1034 AllNodes.push_back(N);
1035 return SDOperand(N, 0);
1039 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
1040 /// indicated value. This method ignores uses of other values defined by this
1042 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) {
1043 assert(Value < getNumValues() && "Bad value!");
1045 // If there is only one value, this is easy.
1046 if (getNumValues() == 1)
1047 return use_size() == NUses;
1048 if (Uses.size() < NUses) return false;
1050 SDOperand TheValue(this, Value);
1052 std::set<SDNode*> UsersHandled;
1054 for (std::vector<SDNode*>::iterator UI = Uses.begin(), E = Uses.end();
1057 if (User->getNumOperands() == 1 ||
1058 UsersHandled.insert(User).second) // First time we've seen this?
1059 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
1060 if (User->getOperand(i) == TheValue) {
1062 return false; // too many uses
1067 // Found exactly the right number of uses?
1072 const char *SDNode::getOperationName() const {
1073 switch (getOpcode()) {
1074 default: return "<<Unknown>>";
1075 case ISD::EntryToken: return "EntryToken";
1076 case ISD::TokenFactor: return "TokenFactor";
1077 case ISD::Constant: return "Constant";
1078 case ISD::ConstantFP: return "ConstantFP";
1079 case ISD::GlobalAddress: return "GlobalAddress";
1080 case ISD::FrameIndex: return "FrameIndex";
1081 case ISD::BasicBlock: return "BasicBlock";
1082 case ISD::ExternalSymbol: return "ExternalSymbol";
1083 case ISD::ConstantPool: return "ConstantPoolIndex";
1084 case ISD::CopyToReg: return "CopyToReg";
1085 case ISD::CopyFromReg: return "CopyFromReg";
1086 case ISD::ImplicitDef: return "ImplicitDef";
1088 case ISD::ADD: return "add";
1089 case ISD::SUB: return "sub";
1090 case ISD::MUL: return "mul";
1091 case ISD::SDIV: return "sdiv";
1092 case ISD::UDIV: return "udiv";
1093 case ISD::SREM: return "srem";
1094 case ISD::UREM: return "urem";
1095 case ISD::AND: return "and";
1096 case ISD::OR: return "or";
1097 case ISD::XOR: return "xor";
1098 case ISD::SHL: return "shl";
1099 case ISD::SRA: return "sra";
1100 case ISD::SRL: return "srl";
1102 case ISD::SELECT: return "select";
1103 case ISD::ADD_PARTS: return "add_parts";
1104 case ISD::SUB_PARTS: return "sub_parts";
1106 // Conversion operators.
1107 case ISD::SIGN_EXTEND: return "sign_extend";
1108 case ISD::ZERO_EXTEND: return "zero_extend";
1109 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
1110 case ISD::ZERO_EXTEND_INREG: return "zero_extend_inreg";
1111 case ISD::TRUNCATE: return "truncate";
1112 case ISD::FP_ROUND: return "fp_round";
1113 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
1114 case ISD::FP_EXTEND: return "fp_extend";
1116 case ISD::SINT_TO_FP: return "sint_to_fp";
1117 case ISD::UINT_TO_FP: return "uint_to_fp";
1118 case ISD::FP_TO_SINT: return "fp_to_sint";
1119 case ISD::FP_TO_UINT: return "fp_to_uint";
1121 // Control flow instructions
1122 case ISD::BR: return "br";
1123 case ISD::BRCOND: return "brcond";
1124 case ISD::RET: return "ret";
1125 case ISD::CALL: return "call";
1126 case ISD::ADJCALLSTACKDOWN: return "adjcallstackdown";
1127 case ISD::ADJCALLSTACKUP: return "adjcallstackup";
1130 case ISD::LOAD: return "load";
1131 case ISD::STORE: return "store";
1132 case ISD::EXTLOAD: return "extload";
1133 case ISD::SEXTLOAD: return "sextload";
1134 case ISD::ZEXTLOAD: return "zextload";
1135 case ISD::TRUNCSTORE: return "truncstore";
1137 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
1138 case ISD::EXTRACT_ELEMENT: return "extract_element";
1139 case ISD::BUILD_PAIR: return "build_pair";
1140 case ISD::MEMSET: return "memset";
1141 case ISD::MEMCPY: return "memcpy";
1142 case ISD::MEMMOVE: return "memmove";
1145 const SetCCSDNode *SetCC = cast<SetCCSDNode>(this);
1146 switch (SetCC->getCondition()) {
1147 default: assert(0 && "Unknown setcc condition!");
1148 case ISD::SETOEQ: return "setcc:setoeq";
1149 case ISD::SETOGT: return "setcc:setogt";
1150 case ISD::SETOGE: return "setcc:setoge";
1151 case ISD::SETOLT: return "setcc:setolt";
1152 case ISD::SETOLE: return "setcc:setole";
1153 case ISD::SETONE: return "setcc:setone";
1155 case ISD::SETO: return "setcc:seto";
1156 case ISD::SETUO: return "setcc:setuo";
1157 case ISD::SETUEQ: return "setcc:setue";
1158 case ISD::SETUGT: return "setcc:setugt";
1159 case ISD::SETUGE: return "setcc:setuge";
1160 case ISD::SETULT: return "setcc:setult";
1161 case ISD::SETULE: return "setcc:setule";
1162 case ISD::SETUNE: return "setcc:setune";
1164 case ISD::SETEQ: return "setcc:seteq";
1165 case ISD::SETGT: return "setcc:setgt";
1166 case ISD::SETGE: return "setcc:setge";
1167 case ISD::SETLT: return "setcc:setlt";
1168 case ISD::SETLE: return "setcc:setle";
1169 case ISD::SETNE: return "setcc:setne";
1174 void SDNode::dump() const {
1175 std::cerr << (void*)this << ": ";
1177 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
1178 if (i) std::cerr << ",";
1179 if (getValueType(i) == MVT::Other)
1182 std::cerr << MVT::getValueTypeString(getValueType(i));
1184 std::cerr << " = " << getOperationName();
1187 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
1188 if (i) std::cerr << ", ";
1189 std::cerr << (void*)getOperand(i).Val;
1190 if (unsigned RN = getOperand(i).ResNo)
1191 std::cerr << ":" << RN;
1194 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
1195 std::cerr << "<" << CSDN->getValue() << ">";
1196 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
1197 std::cerr << "<" << CSDN->getValue() << ">";
1198 } else if (const GlobalAddressSDNode *GADN =
1199 dyn_cast<GlobalAddressSDNode>(this)) {
1201 WriteAsOperand(std::cerr, GADN->getGlobal()) << ">";
1202 } else if (const FrameIndexSDNode *FIDN =
1203 dyn_cast<FrameIndexSDNode>(this)) {
1204 std::cerr << "<" << FIDN->getIndex() << ">";
1205 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
1206 std::cerr << "<" << CP->getIndex() << ">";
1207 } else if (const BasicBlockSDNode *BBDN =
1208 dyn_cast<BasicBlockSDNode>(this)) {
1210 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
1212 std::cerr << LBB->getName() << " ";
1213 std::cerr << (const void*)BBDN->getBasicBlock() << ">";
1214 } else if (const RegSDNode *C2V = dyn_cast<RegSDNode>(this)) {
1215 std::cerr << "<reg #" << C2V->getReg() << ">";
1216 } else if (const ExternalSymbolSDNode *ES =
1217 dyn_cast<ExternalSymbolSDNode>(this)) {
1218 std::cerr << "'" << ES->getSymbol() << "'";
1219 } else if (const MVTSDNode *M = dyn_cast<MVTSDNode>(this)) {
1220 std::cerr << " - Ty = " << MVT::getValueTypeString(M->getExtraValueType());
1224 static void DumpNodes(SDNode *N, unsigned indent) {
1225 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
1226 if (N->getOperand(i).Val->hasOneUse())
1227 DumpNodes(N->getOperand(i).Val, indent+2);
1229 std::cerr << "\n" << std::string(indent+2, ' ')
1230 << (void*)N->getOperand(i).Val << ": <multiple use>";
1233 std::cerr << "\n" << std::string(indent, ' ');
1237 void SelectionDAG::dump() const {
1238 std::cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
1239 std::vector<SDNode*> Nodes(AllNodes);
1240 std::sort(Nodes.begin(), Nodes.end());
1242 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
1243 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
1244 DumpNodes(Nodes[i], 2);
1247 DumpNodes(getRoot().Val, 2);
1249 std::cerr << "\n\n";