LegalizeDAG.cpp revision 8e21e71b248365c69c0f666518c378b5819ce6fb
13e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner//===-- LegalizeDAG.cpp - Implement SelectionDAG::Legalize ----------------===// 23e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner// 33e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner// The LLVM Compiler Infrastructure 43e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner// 53e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner// This file was developed by the LLVM research group and is distributed under 63e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner// the University of Illinois Open Source License. See LICENSE.TXT for details. 73e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner// 83e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner//===----------------------------------------------------------------------===// 93e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner// 103e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner// This file implements the SelectionDAG::Legalize method. 113e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner// 123e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner//===----------------------------------------------------------------------===// 133e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 143e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner#include "llvm/CodeGen/SelectionDAG.h" 153e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner#include "llvm/CodeGen/MachineConstantPool.h" 163e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner#include "llvm/CodeGen/MachineFunction.h" 1745b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 183e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner#include "llvm/Target/TargetLowering.h" 19e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner#include "llvm/Target/TargetData.h" 200f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner#include "llvm/Target/TargetOptions.h" 213e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner#include "llvm/Constants.h" 223e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner#include <iostream> 233e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattnerusing namespace llvm; 243e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 253e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner//===----------------------------------------------------------------------===// 263e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// SelectionDAGLegalize - This takes an arbitrary SelectionDAG as input and 273e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// hacks on it until the target machine can handle it. This involves 283e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// eliminating value sizes the machine cannot handle (promoting small sizes to 293e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// large sizes or splitting up large values into small values) as well as 303e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// eliminating operations the machine cannot handle. 313e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// 323e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// This code also does a small amount of optimization and recognition of idioms 333e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// as part of its processing. For example, if a target does not support a 343e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// 'setcc' instruction efficiently, but does support 'brcc' instruction, this 353e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// will attempt merge setcc and brc instructions into brcc's. 363e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// 373e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattnernamespace { 383e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattnerclass SelectionDAGLegalize { 393e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner TargetLowering &TLI; 403e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SelectionDAG &DAG; 413e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 423e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// LegalizeAction - This enum indicates what action we should take for each 433e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// value type the can occur in the program. 443e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner enum LegalizeAction { 453e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Legal, // The target natively supports this value type. 463e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Promote, // This should be promoted to the next larger type. 473e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Expand, // This integer type should be broken into smaller pieces. 483e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner }; 493e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 503e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// ValueTypeActions - This is a bitvector that contains two bits for each 513e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// value type, where the two bits correspond to the LegalizeAction enum. 523e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// This can be queried with "getTypeAction(VT)". 533e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner unsigned ValueTypeActions; 543e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 553e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// NeedsAnotherIteration - This is set when we expand a large integer 563e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// operation into smaller integer operations, but the smaller operations are 573e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// not set. This occurs only rarely in practice, for targets that don't have 583e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// 32-bit or larger integer registers. 593e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner bool NeedsAnotherIteration; 603e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 613e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// LegalizedNodes - For nodes that are of legal width, and that have more 623e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// than one use, this map indicates what regularized operand to use. This 633e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// allows us to avoid legalizing the same thing more than once. 643e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner std::map<SDOperand, SDOperand> LegalizedNodes; 653e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 6603c8546ec57523970874917854a2fb77b1ff598eChris Lattner /// PromotedNodes - For nodes that are below legal width, and that have more 6703c8546ec57523970874917854a2fb77b1ff598eChris Lattner /// than one use, this map indicates what promoted value to use. This allows 6803c8546ec57523970874917854a2fb77b1ff598eChris Lattner /// us to avoid promoting the same thing more than once. 6903c8546ec57523970874917854a2fb77b1ff598eChris Lattner std::map<SDOperand, SDOperand> PromotedNodes; 7003c8546ec57523970874917854a2fb77b1ff598eChris Lattner 713e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// ExpandedNodes - For nodes that need to be expanded, and which have more 723e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// than one use, this map indicates which which operands are the expanded 733e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// version of the input. This allows us to avoid expanding the same node 743e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// more than once. 753e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner std::map<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedNodes; 763e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 778afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner void AddLegalizedOperand(SDOperand From, SDOperand To) { 788afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner bool isNew = LegalizedNodes.insert(std::make_pair(From, To)).second; 798afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner assert(isNew && "Got into the map somehow?"); 808afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner } 8103c8546ec57523970874917854a2fb77b1ff598eChris Lattner void AddPromotedOperand(SDOperand From, SDOperand To) { 8203c8546ec57523970874917854a2fb77b1ff598eChris Lattner bool isNew = PromotedNodes.insert(std::make_pair(From, To)).second; 8303c8546ec57523970874917854a2fb77b1ff598eChris Lattner assert(isNew && "Got into the map somehow?"); 8403c8546ec57523970874917854a2fb77b1ff598eChris Lattner } 858afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner 863e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattnerpublic: 873e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 889c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SelectionDAGLegalize(SelectionDAG &DAG); 893e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 903e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// Run - While there is still lowering to do, perform a pass over the DAG. 913e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// Most regularization can be done in a single pass, but targets that require 923e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// large values to be split into registers multiple times (e.g. i64 -> 4x 933e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// i16) require iteration for these values (the first iteration will demote 943e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// to i32, the second will demote to i16). 953e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner void Run() { 963e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner do { 973e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner NeedsAnotherIteration = false; 983e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner LegalizeDAG(); 993e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } while (NeedsAnotherIteration); 1003e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 1013e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1023e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// getTypeAction - Return how we should legalize values of this type, either 1033e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// it is already legal or we need to expand it into multiple registers of 1043e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// smaller integer type, or we need to promote it to a larger type. 1053e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner LegalizeAction getTypeAction(MVT::ValueType VT) const { 1063e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner return (LegalizeAction)((ValueTypeActions >> (2*VT)) & 3); 1073e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 1083e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1093e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// isTypeLegal - Return true if this type is legal on this target. 1103e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// 1113e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner bool isTypeLegal(MVT::ValueType VT) const { 1123e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner return getTypeAction(VT) == Legal; 1133e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 1143e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1153e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattnerprivate: 1163e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner void LegalizeDAG(); 1173e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1183e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand LegalizeOp(SDOperand O); 1193e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner void ExpandOp(SDOperand O, SDOperand &Lo, SDOperand &Hi); 12003c8546ec57523970874917854a2fb77b1ff598eChris Lattner SDOperand PromoteOp(SDOperand O); 1213e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 12277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner SDOperand ExpandLibCall(const char *Name, SDNode *Node, 12377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner SDOperand &Hi); 12477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner SDOperand ExpandIntToFP(bool isSigned, MVT::ValueType DestTy, 12577e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner SDOperand Source); 126e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner bool ExpandShift(unsigned Opc, SDOperand Op, SDOperand Amt, 127e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner SDOperand &Lo, SDOperand &Hi); 12884f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner void ExpandAddSub(bool isAdd, SDOperand Op, SDOperand Amt, 12984f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner SDOperand &Lo, SDOperand &Hi); 130e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 1313e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 1323e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 1333e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 1343e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner}; 1353e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner} 1363e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1373e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1389c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris LattnerSelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag) 1399c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner : TLI(dag.getTargetLoweringInfo()), DAG(dag), 1409c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner ValueTypeActions(TLI.getValueTypeActions()) { 1413e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(MVT::LAST_VALUETYPE <= 16 && 1423e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner "Too many value types for ValueTypeActions to hold!"); 1433e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner} 1443e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1453e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattnervoid SelectionDAGLegalize::LegalizeDAG() { 1463e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand OldRoot = DAG.getRoot(); 1473e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand NewRoot = LegalizeOp(OldRoot); 1483e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner DAG.setRoot(NewRoot); 1493e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1503e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandedNodes.clear(); 1513e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner LegalizedNodes.clear(); 15271c42a0190300a8903aaea80467b88f15f327ea9Chris Lattner PromotedNodes.clear(); 1533e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1543e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Remove dead nodes now. 15562fd269c146d9023efe32644e44cd97b88631d4fChris Lattner DAG.RemoveDeadNodes(OldRoot.Val); 1563e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner} 1573e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1583e928bbd6153eb08641cbd0ad7d8487378a8b12aChris LattnerSDOperand SelectionDAGLegalize::LegalizeOp(SDOperand Op) { 159e3304a3d24afc952d3cb415d1b504d973573c5c5Chris Lattner assert(getTypeAction(Op.getValueType()) == Legal && 160e3304a3d24afc952d3cb415d1b504d973573c5c5Chris Lattner "Caller should expand or promote operands that are not legal!"); 161e3304a3d24afc952d3cb415d1b504d973573c5c5Chris Lattner 1623e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // If this operation defines any values that cannot be represented in a 163e3304a3d24afc952d3cb415d1b504d973573c5c5Chris Lattner // register on this target, make sure to expand or promote them. 164e3304a3d24afc952d3cb415d1b504d973573c5c5Chris Lattner if (Op.Val->getNumValues() > 1) { 1653e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner for (unsigned i = 0, e = Op.Val->getNumValues(); i != e; ++i) 1663e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (getTypeAction(Op.Val->getValueType(i))) { 1673e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Legal: break; // Nothing to do. 1683e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Expand: { 1693e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand T1, T2; 1703e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Op.getValue(i), T1, T2); 1713e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(LegalizedNodes.count(Op) && 1723e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner "Expansion didn't add legal operands!"); 1733e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner return LegalizedNodes[Op]; 1743e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 1753e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Promote: 17603c8546ec57523970874917854a2fb77b1ff598eChris Lattner PromoteOp(Op.getValue(i)); 17703c8546ec57523970874917854a2fb77b1ff598eChris Lattner assert(LegalizedNodes.count(Op) && 17803c8546ec57523970874917854a2fb77b1ff598eChris Lattner "Expansion didn't add legal operands!"); 17903c8546ec57523970874917854a2fb77b1ff598eChris Lattner return LegalizedNodes[Op]; 1803e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 1813e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 1823e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 183e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner std::map<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op); 184e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner if (I != LegalizedNodes.end()) return I->second; 1853e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 186fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner SDOperand Tmp1, Tmp2, Tmp3; 1873e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1883e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand Result = Op; 1893e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDNode *Node = Op.Val; 1903e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1913e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (Node->getOpcode()) { 1923e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner default: 1933e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner std::cerr << "NODE: "; Node->dump(); std::cerr << "\n"; 1943e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(0 && "Do not know how to legalize this operator!"); 1953e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner abort(); 1963e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::EntryToken: 1973e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::FrameIndex: 1983e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::GlobalAddress: 19903c0cf822e9a57109d1b4e6a2705d68852c93e1dChris Lattner case ISD::ExternalSymbol: 20069a52155d2eff066b49dbac385113002fd9dba14Chris Lattner case ISD::ConstantPool: // Nothing to do. 2013e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(getTypeAction(Node->getValueType(0)) == Legal && 2023e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner "This must be legal!"); 2033e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 20469a52155d2eff066b49dbac385113002fd9dba14Chris Lattner case ISD::CopyFromReg: 20569a52155d2eff066b49dbac385113002fd9dba14Chris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); 20669a52155d2eff066b49dbac385113002fd9dba14Chris Lattner if (Tmp1 != Node->getOperand(0)) 20769a52155d2eff066b49dbac385113002fd9dba14Chris Lattner Result = DAG.getCopyFromReg(cast<RegSDNode>(Node)->getReg(), 20869a52155d2eff066b49dbac385113002fd9dba14Chris Lattner Node->getValueType(0), Tmp1); 20913c184de29c09294ed63b01ac43e1b46c049278eChris Lattner else 21013c184de29c09294ed63b01ac43e1b46c049278eChris Lattner Result = Op.getValue(0); 21113c184de29c09294ed63b01ac43e1b46c049278eChris Lattner 21213c184de29c09294ed63b01ac43e1b46c049278eChris Lattner // Since CopyFromReg produces two values, make sure to remember that we 21313c184de29c09294ed63b01ac43e1b46c049278eChris Lattner // legalized both of them. 21413c184de29c09294ed63b01ac43e1b46c049278eChris Lattner AddLegalizedOperand(Op.getValue(0), Result); 21513c184de29c09294ed63b01ac43e1b46c049278eChris Lattner AddLegalizedOperand(Op.getValue(1), Result.getValue(1)); 21613c184de29c09294ed63b01ac43e1b46c049278eChris Lattner return Result.getValue(Op.ResNo); 21718c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner case ISD::ImplicitDef: 21818c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); 21918c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner if (Tmp1 != Node->getOperand(0)) 2202ee743ff9be43c350075a2fa15d11a79bff36775Chris Lattner Result = DAG.getImplicitDef(Tmp1, cast<RegSDNode>(Node)->getReg()); 22118c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner break; 2223e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::Constant: 2233e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // We know we don't need to expand constants here, constants only have one 2243e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // value and we check that it is fine above. 2253e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 2263e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // FIXME: Maybe we should handle things like targets that don't support full 2273e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // 32-bit immediates? 2283e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 2293e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::ConstantFP: { 2303e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Spill FP immediates to the constant pool if the target cannot directly 2313e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // codegen them. Targets often have some immediate values that can be 2323e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // efficiently generated into an FP register without a load. We explicitly 2333e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // leave these constants as ConstantFP nodes for the target to deal with. 2343e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 2353e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node); 2363e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 2373e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Check to see if this FP immediate is already legal. 2383e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner bool isLegal = false; 2393e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner for (TargetLowering::legal_fpimm_iterator I = TLI.legal_fpimm_begin(), 2403e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner E = TLI.legal_fpimm_end(); I != E; ++I) 2413e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (CFP->isExactlyValue(*I)) { 2423e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner isLegal = true; 2433e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 2443e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 2453e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 2463e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (!isLegal) { 2473e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Otherwise we need to spill the constant to memory. 2483e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner MachineConstantPool *CP = DAG.getMachineFunction().getConstantPool(); 2493e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 2503e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner bool Extend = false; 2513e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 2523e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // If a FP immediate is precise when represented as a float, we put it 2533e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // into the constant pool as a float, even if it's is statically typed 2543e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // as a double. 2553e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner MVT::ValueType VT = CFP->getValueType(0); 2563e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner bool isDouble = VT == MVT::f64; 2573e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ConstantFP *LLVMC = ConstantFP::get(isDouble ? Type::DoubleTy : 2583e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Type::FloatTy, CFP->getValue()); 25999939d39c9555ebecbcd24c1b607eae52804ea37Chris Lattner if (isDouble && CFP->isExactlyValue((float)CFP->getValue()) && 26099939d39c9555ebecbcd24c1b607eae52804ea37Chris Lattner // Only do this if the target has a native EXTLOAD instruction from 26199939d39c9555ebecbcd24c1b607eae52804ea37Chris Lattner // f32. 26299939d39c9555ebecbcd24c1b607eae52804ea37Chris Lattner TLI.getOperationAction(ISD::EXTLOAD, 26399939d39c9555ebecbcd24c1b607eae52804ea37Chris Lattner MVT::f32) == TargetLowering::Legal) { 2643e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner LLVMC = cast<ConstantFP>(ConstantExpr::getCast(LLVMC, Type::FloatTy)); 2653e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner VT = MVT::f32; 2663e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Extend = true; 2673e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 2683e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 2693e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand CPIdx = DAG.getConstantPool(CP->getConstantPoolIndex(LLVMC), 2703e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner TLI.getPointerTy()); 271f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner if (Extend) { 272f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result = DAG.getNode(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(), CPIdx, 273f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner MVT::f32); 274f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner } else { 275f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result = DAG.getLoad(VT, DAG.getEntryNode(), CPIdx); 276f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner } 2773e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 2783e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 2793e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 280a385e9b20fa7d37d3842ce15afd412f617d83a27Chris Lattner case ISD::TokenFactor: { 281a385e9b20fa7d37d3842ce15afd412f617d83a27Chris Lattner std::vector<SDOperand> Ops; 282a385e9b20fa7d37d3842ce15afd412f617d83a27Chris Lattner bool Changed = false; 283a385e9b20fa7d37d3842ce15afd412f617d83a27Chris Lattner for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) { 2841e81b9e5112c40c23ecca9a64b6ab2ce97c8c6d4Chris Lattner SDOperand Op = Node->getOperand(i); 2851e81b9e5112c40c23ecca9a64b6ab2ce97c8c6d4Chris Lattner // Fold single-use TokenFactor nodes into this token factor as we go. 2861e81b9e5112c40c23ecca9a64b6ab2ce97c8c6d4Chris Lattner if (Op.getOpcode() == ISD::TokenFactor && Op.hasOneUse()) { 2871e81b9e5112c40c23ecca9a64b6ab2ce97c8c6d4Chris Lattner Changed = true; 2881e81b9e5112c40c23ecca9a64b6ab2ce97c8c6d4Chris Lattner for (unsigned j = 0, e = Op.getNumOperands(); j != e; ++j) 2891e81b9e5112c40c23ecca9a64b6ab2ce97c8c6d4Chris Lattner Ops.push_back(LegalizeOp(Op.getOperand(j))); 2901e81b9e5112c40c23ecca9a64b6ab2ce97c8c6d4Chris Lattner } else { 2911e81b9e5112c40c23ecca9a64b6ab2ce97c8c6d4Chris Lattner Ops.push_back(LegalizeOp(Op)); // Legalize the operands 2921e81b9e5112c40c23ecca9a64b6ab2ce97c8c6d4Chris Lattner Changed |= Ops[i] != Op; 2931e81b9e5112c40c23ecca9a64b6ab2ce97c8c6d4Chris Lattner } 294a385e9b20fa7d37d3842ce15afd412f617d83a27Chris Lattner } 295a385e9b20fa7d37d3842ce15afd412f617d83a27Chris Lattner if (Changed) 296a385e9b20fa7d37d3842ce15afd412f617d83a27Chris Lattner Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Ops); 297a385e9b20fa7d37d3842ce15afd412f617d83a27Chris Lattner break; 298a385e9b20fa7d37d3842ce15afd412f617d83a27Chris Lattner } 299a385e9b20fa7d37d3842ce15afd412f617d83a27Chris Lattner 3003e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::ADJCALLSTACKDOWN: 3013e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::ADJCALLSTACKUP: 3023e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 3033e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // There is no need to legalize the size argument (Operand #1) 3043e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (Tmp1 != Node->getOperand(0)) 3053e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = DAG.getNode(Node->getOpcode(), MVT::Other, Tmp1, 3063e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Node->getOperand(1)); 3073e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 308fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner case ISD::DYNAMIC_STACKALLOC: 309fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 310fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the size. 311fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the alignment. 312fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || 313fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner Tmp3 != Node->getOperand(2)) 314fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner Result = DAG.getNode(ISD::DYNAMIC_STACKALLOC, Node->getValueType(0), 315fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner Tmp1, Tmp2, Tmp3); 316513e52ec4e20048a8f491498d219a2669283f3bdChris Lattner else 317513e52ec4e20048a8f491498d219a2669283f3bdChris Lattner Result = Op.getValue(0); 318fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner 319fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner // Since this op produces two values, make sure to remember that we 320fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner // legalized both of them. 321fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner AddLegalizedOperand(SDOperand(Node, 0), Result); 322fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); 323fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner return Result.getValue(Op.ResNo); 324fa404e8a76abfdafefb8806b35f596d288609496Chris Lattner 3253d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner case ISD::CALL: { 3263e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 3273e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the callee. 3283d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner 3293d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner bool Changed = false; 3303d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner std::vector<SDOperand> Ops; 3313d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner for (unsigned i = 2, e = Node->getNumOperands(); i != e; ++i) { 3323d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner Ops.push_back(LegalizeOp(Node->getOperand(i))); 3333d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner Changed |= Ops.back() != Node->getOperand(i); 3343d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner } 3353d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner 3363d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || Changed) { 3373e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner std::vector<MVT::ValueType> RetTyVTs; 3383e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner RetTyVTs.reserve(Node->getNumValues()); 3393e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) 340ebda942efcb86634a6581aae76a0d0c92c4a232eChris Lattner RetTyVTs.push_back(Node->getValueType(i)); 3413d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner Result = SDOperand(DAG.getCall(RetTyVTs, Tmp1, Tmp2, Ops), 0); 34238d6be5d49e61e4be9bb12ee3cedf2a4fcddb8f3Chris Lattner } else { 34338d6be5d49e61e4be9bb12ee3cedf2a4fcddb8f3Chris Lattner Result = Result.getValue(0); 3443e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 34538d6be5d49e61e4be9bb12ee3cedf2a4fcddb8f3Chris Lattner // Since calls produce multiple values, make sure to remember that we 34638d6be5d49e61e4be9bb12ee3cedf2a4fcddb8f3Chris Lattner // legalized all of them. 34738d6be5d49e61e4be9bb12ee3cedf2a4fcddb8f3Chris Lattner for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) 34838d6be5d49e61e4be9bb12ee3cedf2a4fcddb8f3Chris Lattner AddLegalizedOperand(SDOperand(Node, i), Result.getValue(i)); 34938d6be5d49e61e4be9bb12ee3cedf2a4fcddb8f3Chris Lattner return Result.getValue(Op.ResNo); 3503d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner } 351c7af17923e3bb6053f529679ef0be5399d3519edChris Lattner case ISD::BR: 352c7af17923e3bb6053f529679ef0be5399d3519edChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 353c7af17923e3bb6053f529679ef0be5399d3519edChris Lattner if (Tmp1 != Node->getOperand(0)) 354c7af17923e3bb6053f529679ef0be5399d3519edChris Lattner Result = DAG.getNode(ISD::BR, MVT::Other, Tmp1, Node->getOperand(1)); 355c7af17923e3bb6053f529679ef0be5399d3519edChris Lattner break; 356c7af17923e3bb6053f529679ef0be5399d3519edChris Lattner 357c18ae4cb6a263cf31283c0ef51ace24350f8d72bChris Lattner case ISD::BRCOND: 358c18ae4cb6a263cf31283c0ef51ace24350f8d72bChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 35947e9223e06390897c3834f8c527001df392570ffChris Lattner 36047e9223e06390897c3834f8c527001df392570ffChris Lattner switch (getTypeAction(Node->getOperand(1).getValueType())) { 36147e9223e06390897c3834f8c527001df392570ffChris Lattner case Expand: assert(0 && "It's impossible to expand bools"); 36247e9223e06390897c3834f8c527001df392570ffChris Lattner case Legal: 36347e9223e06390897c3834f8c527001df392570ffChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition. 36447e9223e06390897c3834f8c527001df392570ffChris Lattner break; 36547e9223e06390897c3834f8c527001df392570ffChris Lattner case Promote: 36647e9223e06390897c3834f8c527001df392570ffChris Lattner Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the condition. 36747e9223e06390897c3834f8c527001df392570ffChris Lattner break; 36847e9223e06390897c3834f8c527001df392570ffChris Lattner } 369c18ae4cb6a263cf31283c0ef51ace24350f8d72bChris Lattner // Basic block destination (Op#2) is always legal. 370c18ae4cb6a263cf31283c0ef51ace24350f8d72bChris Lattner if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) 371c18ae4cb6a263cf31283c0ef51ace24350f8d72bChris Lattner Result = DAG.getNode(ISD::BRCOND, MVT::Other, Tmp1, Tmp2, 372c18ae4cb6a263cf31283c0ef51ace24350f8d72bChris Lattner Node->getOperand(2)); 373c18ae4cb6a263cf31283c0ef51ace24350f8d72bChris Lattner break; 374c18ae4cb6a263cf31283c0ef51ace24350f8d72bChris Lattner 3753e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::LOAD: 3763e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 3773e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. 3783e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (Tmp1 != Node->getOperand(0) || 3793e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 != Node->getOperand(1)) 3803e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = DAG.getLoad(Node->getValueType(0), Tmp1, Tmp2); 3818afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner else 3828afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner Result = SDOperand(Node, 0); 3838afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner 3848afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner // Since loads produce two values, make sure to remember that we legalized 3858afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner // both of them. 3868afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner AddLegalizedOperand(SDOperand(Node, 0), Result); 3878afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); 3888afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner return Result.getValue(Op.ResNo); 3893e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 3900f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner case ISD::EXTLOAD: 3910f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner case ISD::SEXTLOAD: 3920f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner case ISD::ZEXTLOAD: 3930f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 3940f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. 3950f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner if (Tmp1 != Node->getOperand(0) || 3960f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Tmp2 != Node->getOperand(1)) 3970f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1, Tmp2, 3980f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner cast<MVTSDNode>(Node)->getExtraValueType()); 3990f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner else 4000f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Result = SDOperand(Node, 0); 4010f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner 4020f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner // Since loads produce two values, make sure to remember that we legalized 4030f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner // both of them. 4040f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner AddLegalizedOperand(SDOperand(Node, 0), Result); 4050f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); 4060f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner return Result.getValue(Op.ResNo); 4070f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner 4083e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::EXTRACT_ELEMENT: 4093e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Get both the low and high parts. 4103e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Node->getOperand(0), Tmp1, Tmp2); 4113e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (cast<ConstantSDNode>(Node->getOperand(1))->getValue()) 4123e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = Tmp2; // 1 -> Hi 4133e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner else 4143e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = Tmp1; // 0 -> Lo 4153e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 4163e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 4173e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::CopyToReg: 4183e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 4193e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 4203e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (getTypeAction(Node->getOperand(1).getValueType())) { 4213e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Legal: 4223e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Legalize the incoming value (must be legal). 4233e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); 4243e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) 42518c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner Result = DAG.getCopyToReg(Tmp1, Tmp2, cast<RegSDNode>(Node)->getReg()); 4263e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 427ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner case Promote: 428ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner Tmp2 = PromoteOp(Node->getOperand(1)); 429ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner Result = DAG.getCopyToReg(Tmp1, Tmp2, cast<RegSDNode>(Node)->getReg()); 430ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner break; 431ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner case Expand: 4323e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand Lo, Hi; 4333e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Node->getOperand(1), Lo, Hi); 43418c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner unsigned Reg = cast<RegSDNode>(Node)->getReg(); 435ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner Lo = DAG.getCopyToReg(Tmp1, Lo, Reg); 436ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner Hi = DAG.getCopyToReg(Tmp1, Hi, Reg+1); 437ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner // Note that the copytoreg nodes are independent of each other. 438ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo, Hi); 4393e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(isTypeLegal(Result.getValueType()) && 4403e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner "Cannot expand multiple times yet (i64 -> i16)"); 4413e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 4423e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 4433e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 4443e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 4453e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::RET: 4463e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 4473e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (Node->getNumOperands()) { 4483e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case 2: // ret val 4493e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (getTypeAction(Node->getOperand(1).getValueType())) { 4503e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Legal: 4513e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); 4528afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) 4533e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Tmp2); 4543e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 4553e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Expand: { 4563e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand Lo, Hi; 4573e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Node->getOperand(1), Lo, Hi); 4583e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Hi); 4593e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 4603e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 4613e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Promote: 4628b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp2 = PromoteOp(Node->getOperand(1)); 4638b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Tmp2); 4648b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 4653e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 4663e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 4673e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case 1: // ret void 4683e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (Tmp1 != Node->getOperand(0)) 4693e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1); 4703e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 4713e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner default: { // ret <values> 4723e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner std::vector<SDOperand> NewValues; 4733e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner NewValues.push_back(Tmp1); 4743e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner for (unsigned i = 1, e = Node->getNumOperands(); i != e; ++i) 4753e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (getTypeAction(Node->getOperand(i).getValueType())) { 4763e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Legal: 4774e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner NewValues.push_back(LegalizeOp(Node->getOperand(i))); 4783e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 4793e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Expand: { 4803e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand Lo, Hi; 4813e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Node->getOperand(i), Lo, Hi); 4823e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner NewValues.push_back(Lo); 4833e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner NewValues.push_back(Hi); 4843e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 4853e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 4863e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Promote: 4878b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner assert(0 && "Can't promote multiple return value yet!"); 4883e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 4893e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = DAG.getNode(ISD::RET, MVT::Other, NewValues); 4903e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 4913e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 4923e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 4933e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 4943e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::STORE: 4953e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 4963e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer. 4973e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 4985d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr' 49903c8546ec57523970874917854a2fb77b1ff598eChris Lattner if (ConstantFPSDNode *CFP =dyn_cast<ConstantFPSDNode>(Node->getOperand(1))){ 5005d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner if (CFP->getValueType(0) == MVT::f32) { 5015d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner union { 5025d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner unsigned I; 5035d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner float F; 5045d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner } V; 5055d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner V.F = CFP->getValue(); 5065d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, 5075d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner DAG.getConstant(V.I, MVT::i32), Tmp2); 5085d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner } else { 5095d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner assert(CFP->getValueType(0) == MVT::f64 && "Unknown FP type!"); 5105d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner union { 5115d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner uint64_t I; 5125d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner double F; 5135d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner } V; 5145d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner V.F = CFP->getValue(); 5155d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, 5165d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner DAG.getConstant(V.I, MVT::i64), Tmp2); 5175d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner } 51884734ce8ef1a21eb347d4deca0bf32d59001f751Chris Lattner Node = Result.Val; 5195d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner } 5205d2c6c784bdc3d572a553ed7aa48dcf27a45b1a3Chris Lattner 5213e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (getTypeAction(Node->getOperand(1).getValueType())) { 5223e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Legal: { 5233e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand Val = LegalizeOp(Node->getOperand(1)); 5243e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (Val != Node->getOperand(1) || Tmp1 != Node->getOperand(0) || 5253e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 != Node->getOperand(2)) 5263e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Val, Tmp2); 5273e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 5283e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 5293e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Promote: 53003c8546ec57523970874917854a2fb77b1ff598eChris Lattner // Truncate the value and store the result. 53103c8546ec57523970874917854a2fb77b1ff598eChris Lattner Tmp3 = PromoteOp(Node->getOperand(1)); 53203c8546ec57523970874917854a2fb77b1ff598eChris Lattner Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp3, Tmp2, 53303c8546ec57523970874917854a2fb77b1ff598eChris Lattner Node->getOperand(1).getValueType()); 53403c8546ec57523970874917854a2fb77b1ff598eChris Lattner break; 53503c8546ec57523970874917854a2fb77b1ff598eChris Lattner 5363e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Expand: 5373e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand Lo, Hi; 5383e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Node->getOperand(1), Lo, Hi); 5393e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 5403e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (!TLI.isLittleEndian()) 5413e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner std::swap(Lo, Hi); 5423e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 543ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner Lo = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Lo, Tmp2); 5443e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 545ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner unsigned IncrementSize = MVT::getSizeInBits(Hi.getValueType())/8; 5463e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 = DAG.getNode(ISD::ADD, Tmp2.getValueType(), Tmp2, 5473e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner getIntPtrConstant(IncrementSize)); 5483e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(isTypeLegal(Tmp2.getValueType()) && 5493e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner "Pointers must be legal!"); 550ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner Hi = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Hi, Tmp2); 551ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo, Hi); 552ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner break; 5533e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 5543e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 5550f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner case ISD::TRUNCSTORE: 5560f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 5570f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer. 5580f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner 5590f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner switch (getTypeAction(Node->getOperand(1).getValueType())) { 5600f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner case Legal: 5610f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); 5620f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || 5630f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Tmp3 != Node->getOperand(2)) 56445b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp2, Tmp3, 5650f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner cast<MVTSDNode>(Node)->getExtraValueType()); 5660f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner break; 5670f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner case Promote: 5680f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner case Expand: 5690f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner assert(0 && "Cannot handle illegal TRUNCSTORE yet!"); 5700f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner } 5710f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner break; 5722ee743ff9be43c350075a2fa15d11a79bff36775Chris Lattner case ISD::SELECT: 57347e9223e06390897c3834f8c527001df392570ffChris Lattner switch (getTypeAction(Node->getOperand(0).getValueType())) { 57447e9223e06390897c3834f8c527001df392570ffChris Lattner case Expand: assert(0 && "It's impossible to expand bools"); 57547e9223e06390897c3834f8c527001df392570ffChris Lattner case Legal: 57647e9223e06390897c3834f8c527001df392570ffChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the condition. 57747e9223e06390897c3834f8c527001df392570ffChris Lattner break; 57847e9223e06390897c3834f8c527001df392570ffChris Lattner case Promote: 57947e9223e06390897c3834f8c527001df392570ffChris Lattner Tmp1 = PromoteOp(Node->getOperand(0)); // Promote the condition. 58047e9223e06390897c3834f8c527001df392570ffChris Lattner break; 58147e9223e06390897c3834f8c527001df392570ffChris Lattner } 5823e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); // TrueVal 5832ee743ff9be43c350075a2fa15d11a79bff36775Chris Lattner Tmp3 = LegalizeOp(Node->getOperand(2)); // FalseVal 58455ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner 58555ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner switch (TLI.getOperationAction(Node->getOpcode(), Tmp2.getValueType())) { 58655ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner default: assert(0 && "This action is not supported yet!"); 58755ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner case TargetLowering::Legal: 58855ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || 58955ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Tmp3 != Node->getOperand(2)) 59055ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Result = DAG.getNode(ISD::SELECT, Node->getValueType(0), 59155ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Tmp1, Tmp2, Tmp3); 59255ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner break; 59355ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner case TargetLowering::Promote: { 59455ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner MVT::ValueType NVT = 59555ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner TLI.getTypeToPromoteTo(ISD::SELECT, Tmp2.getValueType()); 59655ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner unsigned ExtOp, TruncOp; 59755ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner if (MVT::isInteger(Tmp2.getValueType())) { 59855ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner ExtOp = ISD::ZERO_EXTEND; 59955ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner TruncOp = ISD::TRUNCATE; 60055ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner } else { 60155ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner ExtOp = ISD::FP_EXTEND; 60255ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner TruncOp = ISD::FP_ROUND; 60355ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner } 60455ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner // Promote each of the values to the new type. 60555ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Tmp2 = DAG.getNode(ExtOp, NVT, Tmp2); 60655ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Tmp3 = DAG.getNode(ExtOp, NVT, Tmp3); 60755ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner // Perform the larger operation, then round down. 60855ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Result = DAG.getNode(ISD::SELECT, NVT, Tmp1, Tmp2,Tmp3); 60955ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Result = DAG.getNode(TruncOp, Node->getValueType(0), Result); 61055ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner break; 61155ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner } 61255ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner } 6133e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 6143e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SETCC: 6153e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (getTypeAction(Node->getOperand(0).getValueType())) { 6163e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Legal: 6173e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS 6183e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS 6193e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) 6203e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), 621f30b73b1c6b6ca8453dc61eb3777b4e4414d3839Chris Lattner Node->getValueType(0), Tmp1, Tmp2); 6223e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 6233e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Promote: 6248b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = PromoteOp(Node->getOperand(0)); // LHS 6258b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp2 = PromoteOp(Node->getOperand(1)); // RHS 6268b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner 6278b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // If this is an FP compare, the operands have already been extended. 6288b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner if (MVT::isInteger(Node->getOperand(0).getValueType())) { 6298b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner MVT::ValueType VT = Node->getOperand(0).getValueType(); 63071c42a0190300a8903aaea80467b88f15f327ea9Chris Lattner MVT::ValueType NVT = TLI.getTypeToTransformTo(VT); 6318b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner 6328b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // Otherwise, we have to insert explicit sign or zero extends. Note 6338b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // that we could insert sign extends for ALL conditions, but zero extend 6348b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // is cheaper on many machines (an AND instead of two shifts), so prefer 6358b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // it. 6368b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner switch (cast<SetCCSDNode>(Node)->getCondition()) { 6378b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner default: assert(0 && "Unknown integer comparison!"); 6388b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SETEQ: 6398b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SETNE: 6408b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SETUGE: 6418b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SETUGT: 6428b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SETULE: 6438b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SETULT: 6448b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // ALL of these operations will work if we either sign or zero extend 6458b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // the operands (including the unsigned comparisons!). Zero extend is 6468b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // usually a simpler/cheaper operation, so prefer it. 6478b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = DAG.getNode(ISD::ZERO_EXTEND_INREG, NVT, Tmp1, VT); 6488b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp2 = DAG.getNode(ISD::ZERO_EXTEND_INREG, NVT, Tmp2, VT); 6498b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 6508b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SETGE: 6518b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SETGT: 6528b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SETLT: 6538b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SETLE: 6548b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1, VT); 6558b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2, VT); 6568b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 6578b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner } 6588b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner 6598b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner } 6608b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), 661f30b73b1c6b6ca8453dc61eb3777b4e4414d3839Chris Lattner Node->getValueType(0), Tmp1, Tmp2); 6623e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 6633e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Expand: 6643e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand LHSLo, LHSHi, RHSLo, RHSHi; 6653e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Node->getOperand(0), LHSLo, LHSHi); 6663e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Node->getOperand(1), RHSLo, RHSHi); 6673e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (cast<SetCCSDNode>(Node)->getCondition()) { 6683e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SETEQ: 6693e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SETNE: 6703e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp1 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSLo, RHSLo); 6713e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSHi, RHSHi); 6723e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp1 = DAG.getNode(ISD::OR, Tmp1.getValueType(), Tmp1, Tmp2); 673f30b73b1c6b6ca8453dc61eb3777b4e4414d3839Chris Lattner Result = DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), 674f30b73b1c6b6ca8453dc61eb3777b4e4414d3839Chris Lattner Node->getValueType(0), Tmp1, 6753e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner DAG.getConstant(0, Tmp1.getValueType())); 6763e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 6773e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner default: 6783e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // FIXME: This generated code sucks. 6793e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ISD::CondCode LowCC; 6803e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (cast<SetCCSDNode>(Node)->getCondition()) { 6813e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner default: assert(0 && "Unknown integer setcc!"); 6823e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SETLT: 6833e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SETULT: LowCC = ISD::SETULT; break; 6843e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SETGT: 6853e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SETUGT: LowCC = ISD::SETUGT; break; 6863e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SETLE: 6873e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SETULE: LowCC = ISD::SETULE; break; 6883e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SETGE: 6893e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SETUGE: LowCC = ISD::SETUGE; break; 6903e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 6913e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 6923e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison 6933e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands 6943e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2; 6953e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 6963e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // NOTE: on targets without efficient SELECT of bools, we can always use 6973e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3) 698f30b73b1c6b6ca8453dc61eb3777b4e4414d3839Chris Lattner Tmp1 = DAG.getSetCC(LowCC, Node->getValueType(0), LHSLo, RHSLo); 6993e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 = DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), 700f30b73b1c6b6ca8453dc61eb3777b4e4414d3839Chris Lattner Node->getValueType(0), LHSHi, RHSHi); 701f30b73b1c6b6ca8453dc61eb3777b4e4414d3839Chris Lattner Result = DAG.getSetCC(ISD::SETEQ, Node->getValueType(0), LHSHi, RHSHi); 702f30b73b1c6b6ca8453dc61eb3777b4e4414d3839Chris Lattner Result = DAG.getNode(ISD::SELECT, Tmp1.getValueType(), 703f30b73b1c6b6ca8453dc61eb3777b4e4414d3839Chris Lattner Result, Tmp1, Tmp2); 7043e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 7053e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 7063e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 7073e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 7083e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 709e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner case ISD::MEMSET: 710e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner case ISD::MEMCPY: 711e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner case ISD::MEMMOVE: { 712deb692e756cd3826e4ecc6eaec3397177c8b89ceChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Chain 713e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); // Pointer 714e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner 715e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner if (Node->getOpcode() == ISD::MEMSET) { // memset = ubyte 716e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner switch (getTypeAction(Node->getOperand(2).getValueType())) { 717e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner case Expand: assert(0 && "Cannot expand a byte!"); 718e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner case Legal: 719deb692e756cd3826e4ecc6eaec3397177c8b89ceChris Lattner Tmp3 = LegalizeOp(Node->getOperand(2)); 720e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner break; 721e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner case Promote: 722deb692e756cd3826e4ecc6eaec3397177c8b89ceChris Lattner Tmp3 = PromoteOp(Node->getOperand(2)); 723e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner break; 724e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner } 725e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner } else { 726e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner Tmp3 = LegalizeOp(Node->getOperand(2)); // memcpy/move = pointer, 727e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner } 728272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner 729272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner SDOperand Tmp4; 730272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner switch (getTypeAction(Node->getOperand(3).getValueType())) { 731e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner case Expand: assert(0 && "Cannot expand this yet!"); 732e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner case Legal: 733e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner Tmp4 = LegalizeOp(Node->getOperand(3)); 734e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner break; 735e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner case Promote: 736e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner Tmp4 = PromoteOp(Node->getOperand(3)); 737272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner break; 738272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner } 739272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner 740272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner SDOperand Tmp5; 741272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner switch (getTypeAction(Node->getOperand(4).getValueType())) { // uint 742272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner case Expand: assert(0 && "Cannot expand this yet!"); 743272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner case Legal: 744272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner Tmp5 = LegalizeOp(Node->getOperand(4)); 745272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner break; 746272455b404eabe70ce9e033ba19ec1b6cfe603a5Chris Lattner case Promote: 747e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner Tmp5 = PromoteOp(Node->getOperand(4)); 748e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner break; 749e560521f1af300a10717ca5c73d42df9ffb1b121Chris Lattner } 75055ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner 75155ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) { 75255ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner default: assert(0 && "This action not implemented for this operation!"); 75355ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner case TargetLowering::Legal: 754e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || 755e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Tmp3 != Node->getOperand(2) || Tmp4 != Node->getOperand(3) || 756e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Tmp5 != Node->getOperand(4)) { 757e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner std::vector<SDOperand> Ops; 758e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Ops.push_back(Tmp1); Ops.push_back(Tmp2); Ops.push_back(Tmp3); 759e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Ops.push_back(Tmp4); Ops.push_back(Tmp5); 760e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Result = DAG.getNode(Node->getOpcode(), MVT::Other, Ops); 761e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner } 76255ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner break; 76355ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner case TargetLowering::Expand: { 764e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner // Otherwise, the target does not support this operation. Lower the 765e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner // operation to an explicit libcall as appropriate. 766e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 767e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner const Type *IntPtrTy = TLI.getTargetData().getIntPtrType(); 768e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 769e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner 7703bfbf4ea990930d153e58e153f319408341a94feReid Spencer const char *FnName = 0; 771e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner if (Node->getOpcode() == ISD::MEMSET) { 772e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Args.push_back(std::make_pair(Tmp2, IntPtrTy)); 773e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner // Extend the ubyte argument to be an int value for the call. 774e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Tmp3 = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, Tmp3); 775e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Args.push_back(std::make_pair(Tmp3, Type::IntTy)); 776e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Args.push_back(std::make_pair(Tmp4, IntPtrTy)); 777e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner 778e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner FnName = "memset"; 779e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner } else if (Node->getOpcode() == ISD::MEMCPY || 780e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Node->getOpcode() == ISD::MEMMOVE) { 781e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Args.push_back(std::make_pair(Tmp2, IntPtrTy)); 782e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Args.push_back(std::make_pair(Tmp3, IntPtrTy)); 783e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Args.push_back(std::make_pair(Tmp4, IntPtrTy)); 784e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner FnName = Node->getOpcode() == ISD::MEMMOVE ? "memmove" : "memcpy"; 785e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner } else { 786e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner assert(0 && "Unknown op!"); 787e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner } 788e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner std::pair<SDOperand,SDOperand> CallResult = 7898e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman TLI.LowerCallTo(Tmp1, Type::VoidTy, false, 790e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner DAG.getExternalSymbol(FnName, IntPtr), Args, DAG); 791e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner Result = LegalizeOp(CallResult.second); 79255ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner break; 79355ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner } 79455ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner case TargetLowering::Custom: 79555ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner std::vector<SDOperand> Ops; 79655ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Ops.push_back(Tmp1); Ops.push_back(Tmp2); Ops.push_back(Tmp3); 79755ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Ops.push_back(Tmp4); Ops.push_back(Tmp5); 79855ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Result = DAG.getNode(Node->getOpcode(), MVT::Other, Ops); 79955ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Result = TLI.LowerOperation(Result); 80055ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Result = LegalizeOp(Result); 80155ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner break; 802e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner } 803e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner break; 804e1bd822ddb0099406d9f280535461033dfeeb190Chris Lattner } 80584f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner case ISD::ADD_PARTS: 80684f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner case ISD::SUB_PARTS: { 80784f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner std::vector<SDOperand> Ops; 80884f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner bool Changed = false; 80984f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) { 81084f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner Ops.push_back(LegalizeOp(Node->getOperand(i))); 81184f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner Changed |= Ops.back() != Node->getOperand(i); 81284f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner } 81384f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner if (Changed) 81484f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Ops); 81584f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner break; 81684f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner } 8173e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::ADD: 8183e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SUB: 8193e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::MUL: 8203e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::UDIV: 8213e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SDIV: 8223e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::UREM: 8233e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SREM: 8243e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::AND: 8253e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::OR: 8263e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::XOR: 82703c0cf822e9a57109d1b4e6a2705d68852c93e1dChris Lattner case ISD::SHL: 82803c0cf822e9a57109d1b4e6a2705d68852c93e1dChris Lattner case ISD::SRL: 82903c0cf822e9a57109d1b4e6a2705d68852c93e1dChris Lattner case ISD::SRA: 8303e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS 8313e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS 8323e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (Tmp1 != Node->getOperand(0) || 8333e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp2 != Node->getOperand(1)) 8343e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1,Tmp2); 8353e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 8363e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::ZERO_EXTEND: 8373e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SIGN_EXTEND: 8387cc4777a263f6a52877d29201311fde5f6edb632Chris Lattner case ISD::TRUNCATE: 83903c0cf822e9a57109d1b4e6a2705d68852c93e1dChris Lattner case ISD::FP_EXTEND: 84003c0cf822e9a57109d1b4e6a2705d68852c93e1dChris Lattner case ISD::FP_ROUND: 841ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner case ISD::FP_TO_SINT: 842ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner case ISD::FP_TO_UINT: 843ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner case ISD::SINT_TO_FP: 844ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner case ISD::UINT_TO_FP: 8453e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (getTypeAction(Node->getOperand(0).getValueType())) { 8463e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case Legal: 8473e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); 8483e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (Tmp1 != Node->getOperand(0)) 8493e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1); 8503e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 851b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner case Expand: 85277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner if (Node->getOpcode() == ISD::SINT_TO_FP || 85377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Node->getOpcode() == ISD::UINT_TO_FP) { 85477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, 85577e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Node->getValueType(0), Node->getOperand(0)); 85677e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Result = LegalizeOp(Result); 85777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner break; 85877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner } 859b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner // In the expand case, we must be dealing with a truncate, because 860b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner // otherwise the result would be larger than the source. 861b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner assert(Node->getOpcode() == ISD::TRUNCATE && 862b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner "Shouldn't need to expand other operators here!"); 863b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner ExpandOp(Node->getOperand(0), Tmp1, Tmp2); 864b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner 865b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner // Since the result is legal, we should just be able to truncate the low 866b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner // part of the source. 867b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Tmp1); 868b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner break; 869b00a6425de1ef8668b63f29927c38da8a19ce904Chris Lattner 87003c8546ec57523970874917854a2fb77b1ff598eChris Lattner case Promote: 87103c8546ec57523970874917854a2fb77b1ff598eChris Lattner switch (Node->getOpcode()) { 8721713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner case ISD::ZERO_EXTEND: 8731713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner Result = PromoteOp(Node->getOperand(0)); 87447e9223e06390897c3834f8c527001df392570ffChris Lattner // NOTE: Any extend would work here... 87547e9223e06390897c3834f8c527001df392570ffChris Lattner Result = DAG.getNode(ISD::ZERO_EXTEND, Op.getValueType(), Result); 87647e9223e06390897c3834f8c527001df392570ffChris Lattner Result = DAG.getNode(ISD::ZERO_EXTEND_INREG, Op.getValueType(), 8771713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner Result, Node->getOperand(0).getValueType()); 87803c8546ec57523970874917854a2fb77b1ff598eChris Lattner break; 87903c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::SIGN_EXTEND: 8801713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner Result = PromoteOp(Node->getOperand(0)); 88147e9223e06390897c3834f8c527001df392570ffChris Lattner // NOTE: Any extend would work here... 882d5d56825123665b60d4eada0a4ad7d0adc5cf3a3Chris Lattner Result = DAG.getNode(ISD::ZERO_EXTEND, Op.getValueType(), Result); 8831713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(), 8841713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner Result, Node->getOperand(0).getValueType()); 8851713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner break; 88603c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::TRUNCATE: 8871713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner Result = PromoteOp(Node->getOperand(0)); 8881713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner Result = DAG.getNode(ISD::TRUNCATE, Op.getValueType(), Result); 8891713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner break; 89003c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::FP_EXTEND: 8911713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner Result = PromoteOp(Node->getOperand(0)); 8921713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner if (Result.getValueType() != Op.getValueType()) 8931713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner // Dynamically dead while we have only 2 FP types. 8941713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner Result = DAG.getNode(ISD::FP_EXTEND, Op.getValueType(), Result); 8951713e73b8ac53f045150cb2a7d7ba9781dc35ef8Chris Lattner break; 89603c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::FP_ROUND: 89703c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::FP_TO_SINT: 89803c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::FP_TO_UINT: 899f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result = PromoteOp(Node->getOperand(0)); 900f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result = DAG.getNode(Node->getOpcode(), Op.getValueType(), Result); 901f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner break; 90203c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::SINT_TO_FP: 903f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result = PromoteOp(Node->getOperand(0)); 904f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(), 905f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result, Node->getOperand(0).getValueType()); 906f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result = DAG.getNode(ISD::SINT_TO_FP, Op.getValueType(), Result); 907f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner break; 90803c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::UINT_TO_FP: 909f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result = PromoteOp(Node->getOperand(0)); 910f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result = DAG.getNode(ISD::ZERO_EXTEND_INREG, Result.getValueType(), 911f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result, Node->getOperand(0).getValueType()); 912f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner Result = DAG.getNode(ISD::UINT_TO_FP, Op.getValueType(), Result); 913f8161d83f0201a32a33a0c875eb43df81d8586abChris Lattner break; 91403c8546ec57523970874917854a2fb77b1ff598eChris Lattner } 9153e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 9163e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 9170f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner case ISD::FP_ROUND_INREG: 9180f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner case ISD::SIGN_EXTEND_INREG: 91945b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner case ISD::ZERO_EXTEND_INREG: { 9200f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); 92145b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner MVT::ValueType ExtraVT = cast<MVTSDNode>(Node)->getExtraValueType(); 92245b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner 92345b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // If this operation is not supported, convert it to a shl/shr or load/store 92445b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // pair. 92555ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner switch (TLI.getOperationAction(Node->getOpcode(), ExtraVT)) { 92655ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner default: assert(0 && "This action not supported for this op yet!"); 92755ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner case TargetLowering::Legal: 92855ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner if (Tmp1 != Node->getOperand(0)) 92955ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1, 93055ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner ExtraVT); 93155ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner break; 93255ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner case TargetLowering::Expand: 93345b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // If this is an integer extend and shifts are supported, do that. 93445b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner if (Node->getOpcode() == ISD::ZERO_EXTEND_INREG) { 93545b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // NOTE: we could fall back on load/store here too for targets without 93645b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // AND. However, it is doubtful that any exist. 93745b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // AND out the appropriate bits. 93845b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner SDOperand Mask = 93945b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner DAG.getConstant((1ULL << MVT::getSizeInBits(ExtraVT))-1, 94045b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Node->getValueType(0)); 94145b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Result = DAG.getNode(ISD::AND, Node->getValueType(0), 94245b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Node->getOperand(0), Mask); 94345b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner } else if (Node->getOpcode() == ISD::SIGN_EXTEND_INREG) { 94445b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // NOTE: we could fall back on load/store here too for targets without 94545b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // SAR. However, it is doubtful that any exist. 94645b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner unsigned BitsDiff = MVT::getSizeInBits(Node->getValueType(0)) - 94745b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner MVT::getSizeInBits(ExtraVT); 94827ff112948d059524e5f4ebe249a1da0b7c710e8Chris Lattner SDOperand ShiftCst = DAG.getConstant(BitsDiff, TLI.getShiftAmountTy()); 94945b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Result = DAG.getNode(ISD::SHL, Node->getValueType(0), 95045b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Node->getOperand(0), ShiftCst); 95145b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Result = DAG.getNode(ISD::SRA, Node->getValueType(0), 95245b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Result, ShiftCst); 95345b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner } else if (Node->getOpcode() == ISD::FP_ROUND_INREG) { 95445b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // The only way we can lower this is to turn it into a STORETRUNC, 95545b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // EXTLOAD pair, targetting a temporary location (a stack slot). 95645b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner 95745b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // NOTE: there is a choice here between constantly creating new stack 95845b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // slots and always reusing the same one. We currently always create 95945b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner // new ones, as reuse may inhibit scheduling. 96045b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner const Type *Ty = MVT::getTypeForValueType(ExtraVT); 96145b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner unsigned TySize = (unsigned)TLI.getTargetData().getTypeSize(Ty); 96245b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner unsigned Align = TLI.getTargetData().getTypeAlignment(Ty); 96345b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 96445b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner int SSFI = 96545b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align); 96645b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 96745b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, DAG.getEntryNode(), 96845b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Node->getOperand(0), StackSlot, ExtraVT); 96945b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Result = DAG.getNode(ISD::EXTLOAD, Node->getValueType(0), 97045b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Result, StackSlot, ExtraVT); 97145b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner } else { 97245b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner assert(0 && "Unknown op"); 97345b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner } 97445b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner Result = LegalizeOp(Result); 97555ba8fba750ee0a51a9d74fa33b7242d24a4ff35Chris Lattner break; 97645b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner } 9770f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner break; 9783e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 97945b8caf1c5a1fd8337038d64c6da8fba2d299fdfChris Lattner } 9803e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 9818afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner if (!Op.Val->hasOneUse()) 9828afc48e44ad8868c1d41511db645e2ba1a4b894eChris Lattner AddLegalizedOperand(Op, Result); 9833e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 9843e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner return Result; 9853e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner} 9863e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 9878b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner/// PromoteOp - Given an operation that produces a value in an invalid type, 9888b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner/// promote it to compute the value into a larger type. The produced value will 9898b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner/// have the correct bits for the low portion of the register, but no guarantee 9908b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner/// is made about the top bits: it may be zero, sign-extended, or garbage. 99103c8546ec57523970874917854a2fb77b1ff598eChris LattnerSDOperand SelectionDAGLegalize::PromoteOp(SDOperand Op) { 99203c8546ec57523970874917854a2fb77b1ff598eChris Lattner MVT::ValueType VT = Op.getValueType(); 99371c42a0190300a8903aaea80467b88f15f327ea9Chris Lattner MVT::ValueType NVT = TLI.getTypeToTransformTo(VT); 99403c8546ec57523970874917854a2fb77b1ff598eChris Lattner assert(getTypeAction(VT) == Promote && 99503c8546ec57523970874917854a2fb77b1ff598eChris Lattner "Caller should expand or legalize operands that are not promotable!"); 99603c8546ec57523970874917854a2fb77b1ff598eChris Lattner assert(NVT > VT && MVT::isInteger(NVT) == MVT::isInteger(VT) && 99703c8546ec57523970874917854a2fb77b1ff598eChris Lattner "Cannot promote to smaller type!"); 99803c8546ec57523970874917854a2fb77b1ff598eChris Lattner 99903c8546ec57523970874917854a2fb77b1ff598eChris Lattner std::map<SDOperand, SDOperand>::iterator I = PromotedNodes.find(Op); 100003c8546ec57523970874917854a2fb77b1ff598eChris Lattner if (I != PromotedNodes.end()) return I->second; 100103c8546ec57523970874917854a2fb77b1ff598eChris Lattner 100203c8546ec57523970874917854a2fb77b1ff598eChris Lattner SDOperand Tmp1, Tmp2, Tmp3; 100303c8546ec57523970874917854a2fb77b1ff598eChris Lattner 100403c8546ec57523970874917854a2fb77b1ff598eChris Lattner SDOperand Result; 100503c8546ec57523970874917854a2fb77b1ff598eChris Lattner SDNode *Node = Op.Val; 100603c8546ec57523970874917854a2fb77b1ff598eChris Lattner 10070f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner // Promotion needs an optimization step to clean up after it, and is not 10080f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner // careful to avoid operations the target does not support. Make sure that 10090f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner // all generated operations are legalized in the next iteration. 10100f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner NeedsAnotherIteration = true; 10110f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner 101203c8546ec57523970874917854a2fb77b1ff598eChris Lattner switch (Node->getOpcode()) { 101303c8546ec57523970874917854a2fb77b1ff598eChris Lattner default: 101403c8546ec57523970874917854a2fb77b1ff598eChris Lattner std::cerr << "NODE: "; Node->dump(); std::cerr << "\n"; 101503c8546ec57523970874917854a2fb77b1ff598eChris Lattner assert(0 && "Do not know how to promote this operator!"); 101603c8546ec57523970874917854a2fb77b1ff598eChris Lattner abort(); 101703c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::Constant: 101803c8546ec57523970874917854a2fb77b1ff598eChris Lattner Result = DAG.getNode(ISD::ZERO_EXTEND, NVT, Op); 101903c8546ec57523970874917854a2fb77b1ff598eChris Lattner assert(isa<ConstantSDNode>(Result) && "Didn't constant fold zext?"); 102003c8546ec57523970874917854a2fb77b1ff598eChris Lattner break; 102103c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::ConstantFP: 102203c8546ec57523970874917854a2fb77b1ff598eChris Lattner Result = DAG.getNode(ISD::FP_EXTEND, NVT, Op); 102303c8546ec57523970874917854a2fb77b1ff598eChris Lattner assert(isa<ConstantFPSDNode>(Result) && "Didn't constant fold fp_extend?"); 102403c8546ec57523970874917854a2fb77b1ff598eChris Lattner break; 1025ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner case ISD::CopyFromReg: 1026ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner Result = DAG.getCopyFromReg(cast<RegSDNode>(Node)->getReg(), NVT, 1027ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner Node->getOperand(0)); 1028ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner // Remember that we legalized the chain. 1029ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner AddLegalizedOperand(Op.getValue(1), Result.getValue(1)); 1030ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner break; 1031ef5cd1d3cf7d0b20987a545fcd2d0af2bfe6c422Chris Lattner 103282fbfb6984c1feb7d44a077ac2dc031f4a950005Chris Lattner case ISD::SETCC: 103382fbfb6984c1feb7d44a077ac2dc031f4a950005Chris Lattner assert(getTypeAction(TLI.getSetCCResultTy()) == Legal && 103482fbfb6984c1feb7d44a077ac2dc031f4a950005Chris Lattner "SetCC type is not legal??"); 103582fbfb6984c1feb7d44a077ac2dc031f4a950005Chris Lattner Result = DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), 103682fbfb6984c1feb7d44a077ac2dc031f4a950005Chris Lattner TLI.getSetCCResultTy(), Node->getOperand(0), 103782fbfb6984c1feb7d44a077ac2dc031f4a950005Chris Lattner Node->getOperand(1)); 103882fbfb6984c1feb7d44a077ac2dc031f4a950005Chris Lattner Result = LegalizeOp(Result); 103982fbfb6984c1feb7d44a077ac2dc031f4a950005Chris Lattner break; 104003c8546ec57523970874917854a2fb77b1ff598eChris Lattner 104103c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::TRUNCATE: 104203c8546ec57523970874917854a2fb77b1ff598eChris Lattner switch (getTypeAction(Node->getOperand(0).getValueType())) { 104303c8546ec57523970874917854a2fb77b1ff598eChris Lattner case Legal: 104403c8546ec57523970874917854a2fb77b1ff598eChris Lattner Result = LegalizeOp(Node->getOperand(0)); 104503c8546ec57523970874917854a2fb77b1ff598eChris Lattner assert(Result.getValueType() >= NVT && 104603c8546ec57523970874917854a2fb77b1ff598eChris Lattner "This truncation doesn't make sense!"); 104703c8546ec57523970874917854a2fb77b1ff598eChris Lattner if (Result.getValueType() > NVT) // Truncate to NVT instead of VT 104803c8546ec57523970874917854a2fb77b1ff598eChris Lattner Result = DAG.getNode(ISD::TRUNCATE, NVT, Result); 104903c8546ec57523970874917854a2fb77b1ff598eChris Lattner break; 1050e76ad6de40b5e4c0399257b0438914c8c85ceaa1Chris Lattner case Promote: 1051e76ad6de40b5e4c0399257b0438914c8c85ceaa1Chris Lattner // The truncation is not required, because we don't guarantee anything 1052e76ad6de40b5e4c0399257b0438914c8c85ceaa1Chris Lattner // about high bits anyway. 1053e76ad6de40b5e4c0399257b0438914c8c85ceaa1Chris Lattner Result = PromoteOp(Node->getOperand(0)); 1054e76ad6de40b5e4c0399257b0438914c8c85ceaa1Chris Lattner break; 105503c8546ec57523970874917854a2fb77b1ff598eChris Lattner case Expand: 105603c8546ec57523970874917854a2fb77b1ff598eChris Lattner assert(0 && "Cannot handle expand yet"); 105703c8546ec57523970874917854a2fb77b1ff598eChris Lattner } 105803c8546ec57523970874917854a2fb77b1ff598eChris Lattner break; 10598b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SIGN_EXTEND: 10608b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::ZERO_EXTEND: 10618b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner switch (getTypeAction(Node->getOperand(0).getValueType())) { 10628b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Expand: assert(0 && "BUG: Smaller reg should have been promoted!"); 10638b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Legal: 10648b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // Input is legal? Just do extend all the way to the larger type. 10658b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = LegalizeOp(Node->getOperand(0)); 10668b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(Node->getOpcode(), NVT, Result); 10678b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 10688b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Promote: 10698b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // Promote the reg if it's smaller. 10708b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = PromoteOp(Node->getOperand(0)); 10718b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // The high bits are not guaranteed to be anything. Insert an extend. 10728b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner if (Node->getOpcode() == ISD::SIGN_EXTEND) 1073595dc5408ad809b9a9a417db275c43242e54b8dcChris Lattner Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result, 1074595dc5408ad809b9a9a417db275c43242e54b8dcChris Lattner Node->getOperand(0).getValueType()); 10758b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner else 1076595dc5408ad809b9a9a417db275c43242e54b8dcChris Lattner Result = DAG.getNode(ISD::ZERO_EXTEND_INREG, NVT, Result, 1077595dc5408ad809b9a9a417db275c43242e54b8dcChris Lattner Node->getOperand(0).getValueType()); 10788b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 10798b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner } 10808b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 10818b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner 10828b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::FP_EXTEND: 10838b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner assert(0 && "Case not implemented. Dynamically dead with 2 FP types!"); 10848b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::FP_ROUND: 10858b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner switch (getTypeAction(Node->getOperand(0).getValueType())) { 10868b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Expand: assert(0 && "BUG: Cannot expand FP regs!"); 10878b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Promote: assert(0 && "Unreachable with 2 FP types!"); 10888b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Legal: 10898b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // Input is legal? Do an FP_ROUND_INREG. 10908b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = LegalizeOp(Node->getOperand(0)); 10918b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, VT); 10928b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 10938b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner } 10948b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 10958b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner 10968b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SINT_TO_FP: 10978b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::UINT_TO_FP: 10988b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner switch (getTypeAction(Node->getOperand(0).getValueType())) { 10998b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Legal: 11008b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = LegalizeOp(Node->getOperand(0)); 110177e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner // No extra round required here. 110277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Result = DAG.getNode(Node->getOpcode(), NVT, Result); 11038b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 11048b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner 11058b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Promote: 11068b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = PromoteOp(Node->getOperand(0)); 11078b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner if (Node->getOpcode() == ISD::SINT_TO_FP) 11088b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(), 11098b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result, Node->getOperand(0).getValueType()); 11108b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner else 11118b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(ISD::ZERO_EXTEND_INREG, Result.getValueType(), 11128b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result, Node->getOperand(0).getValueType()); 111377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner // No extra round required here. 111477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Result = DAG.getNode(Node->getOpcode(), NVT, Result); 11158b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 11168b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Expand: 111777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, NVT, 111877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Node->getOperand(0)); 111977e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Result = LegalizeOp(Result); 112077e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner 112177e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner // Round if we cannot tolerate excess precision. 112277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner if (NoExcessFPPrecision) 112377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, VT); 112477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner break; 11258b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner } 11268b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 11278b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner 11288b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::FP_TO_SINT: 11298b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::FP_TO_UINT: 11308b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner switch (getTypeAction(Node->getOperand(0).getValueType())) { 11318b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Legal: 11328b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); 11338b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 11348b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Promote: 11358b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // The input result is prerounded, so we don't have to do anything 11368b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // special. 11378b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = PromoteOp(Node->getOperand(0)); 11388b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 11398b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case Expand: 11408b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner assert(0 && "not implemented"); 11418b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner } 11428b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1); 11438b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 11448b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner 114503c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::AND: 114603c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::OR: 114703c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::XOR: 11480f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner case ISD::ADD: 11498b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SUB: 11500f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner case ISD::MUL: 11510f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner // The input may have strange things in the top bits of the registers, but 11520f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner // these operations don't care. They may have wierd bits going out, but 11530f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner // that too is okay if they are integer operations. 11540f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Tmp1 = PromoteOp(Node->getOperand(0)); 11550f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Tmp2 = PromoteOp(Node->getOperand(1)); 11560f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT); 11570f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); 11580f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner 11590f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner // However, if this is a floating point operation, they will give excess 11600f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner // precision that we may not be able to tolerate. If we DO allow excess 11610f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner // precision, just leave it, otherwise excise it. 11628b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // FIXME: Why would we need to round FP ops more than integer ones? 11638b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // Is Round(Add(Add(A,B),C)) != Round(Add(Round(Add(A,B)), C)) 11640f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner if (MVT::isFloatingPoint(NVT) && NoExcessFPPrecision) 11650f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, VT); 11660f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner break; 11670f69b2910810b7c0971a739f18b37fae2a20eca5Chris Lattner 11688b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SDIV: 11698b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SREM: 11708b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // These operators require that their input be sign extended. 11718b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = PromoteOp(Node->getOperand(0)); 11728b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp2 = PromoteOp(Node->getOperand(1)); 11738b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner if (MVT::isInteger(NVT)) { 11748b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1, VT); 1175ff3e50cc39db6939b637165997283f59412387bbChris Lattner Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2, VT); 11768b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner } 11778b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); 11788b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner 11798b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // Perform FP_ROUND: this is probably overly pessimistic. 11808b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner if (MVT::isFloatingPoint(NVT) && NoExcessFPPrecision) 11818b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, VT); 11828b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 11838b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner 11848b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::UDIV: 11858b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::UREM: 11868b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // These operators require that their input be zero extended. 11878b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = PromoteOp(Node->getOperand(0)); 11888b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp2 = PromoteOp(Node->getOperand(1)); 11898b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner assert(MVT::isInteger(NVT) && "Operators don't apply to FP!"); 11908b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = DAG.getNode(ISD::ZERO_EXTEND_INREG, NVT, Tmp1, VT); 1191ff3e50cc39db6939b637165997283f59412387bbChris Lattner Tmp2 = DAG.getNode(ISD::ZERO_EXTEND_INREG, NVT, Tmp2, VT); 11928b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); 11938b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 11948b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner 11958b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SHL: 11968b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = PromoteOp(Node->getOperand(0)); 11978b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); 11988b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(ISD::SHL, NVT, Tmp1, Tmp2); 11998b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 12008b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SRA: 12018b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // The input value must be properly sign extended. 12028b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = PromoteOp(Node->getOperand(0)); 12038b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1, VT); 12048b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); 12058b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(ISD::SRA, NVT, Tmp1, Tmp2); 12068b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 12078b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner case ISD::SRL: 12088b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner // The input value must be properly zero extended. 12098b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = PromoteOp(Node->getOperand(0)); 12108b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp1 = DAG.getNode(ISD::ZERO_EXTEND_INREG, NVT, Tmp1, VT); 12118b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); 12128b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner Result = DAG.getNode(ISD::SRL, NVT, Tmp1, Tmp2); 12138b6fa22e722e1de7522aae51d6cdd0f552d489daChris Lattner break; 121403c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::LOAD: 121503c8546ec57523970874917854a2fb77b1ff598eChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 121603c8546ec57523970874917854a2fb77b1ff598eChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. 121703c8546ec57523970874917854a2fb77b1ff598eChris Lattner Result = DAG.getNode(ISD::EXTLOAD, NVT, Tmp1, Tmp2, VT); 121803c8546ec57523970874917854a2fb77b1ff598eChris Lattner 121903c8546ec57523970874917854a2fb77b1ff598eChris Lattner // Remember that we legalized the chain. 122003c8546ec57523970874917854a2fb77b1ff598eChris Lattner AddLegalizedOperand(Op.getValue(1), Result.getValue(1)); 122103c8546ec57523970874917854a2fb77b1ff598eChris Lattner break; 122203c8546ec57523970874917854a2fb77b1ff598eChris Lattner case ISD::SELECT: 122347e9223e06390897c3834f8c527001df392570ffChris Lattner switch (getTypeAction(Node->getOperand(0).getValueType())) { 122447e9223e06390897c3834f8c527001df392570ffChris Lattner case Expand: assert(0 && "It's impossible to expand bools"); 122547e9223e06390897c3834f8c527001df392570ffChris Lattner case Legal: 122647e9223e06390897c3834f8c527001df392570ffChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0));// Legalize the condition. 122747e9223e06390897c3834f8c527001df392570ffChris Lattner break; 122847e9223e06390897c3834f8c527001df392570ffChris Lattner case Promote: 122947e9223e06390897c3834f8c527001df392570ffChris Lattner Tmp1 = PromoteOp(Node->getOperand(0)); // Promote the condition. 123047e9223e06390897c3834f8c527001df392570ffChris Lattner break; 123147e9223e06390897c3834f8c527001df392570ffChris Lattner } 123203c8546ec57523970874917854a2fb77b1ff598eChris Lattner Tmp2 = PromoteOp(Node->getOperand(1)); // Legalize the op0 123303c8546ec57523970874917854a2fb77b1ff598eChris Lattner Tmp3 = PromoteOp(Node->getOperand(2)); // Legalize the op1 123403c8546ec57523970874917854a2fb77b1ff598eChris Lattner Result = DAG.getNode(ISD::SELECT, NVT, Tmp1, Tmp2, Tmp3); 123503c8546ec57523970874917854a2fb77b1ff598eChris Lattner break; 12368ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner case ISD::CALL: { 12378ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 12388ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the callee. 12398ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner 12403d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner std::vector<SDOperand> Ops; 12413d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner for (unsigned i = 2, e = Node->getNumOperands(); i != e; ++i) 12423d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner Ops.push_back(LegalizeOp(Node->getOperand(i))); 12433d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner 12448ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner assert(Node->getNumValues() == 2 && Op.ResNo == 0 && 12458ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner "Can only promote single result calls"); 12468ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner std::vector<MVT::ValueType> RetTyVTs; 12478ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner RetTyVTs.reserve(2); 12488ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner RetTyVTs.push_back(NVT); 12498ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner RetTyVTs.push_back(MVT::Other); 12503d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner SDNode *NC = DAG.getCall(RetTyVTs, Tmp1, Tmp2, Ops); 12518ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner Result = SDOperand(NC, 0); 12528ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner 12538ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner // Insert the new chain mapping. 12548ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner AddLegalizedOperand(Op.getValue(1), Result.getValue(1)); 12558ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner break; 12568ac532c55eb7f8698466f25d1a8a01240c44ec7dChris Lattner } 125703c8546ec57523970874917854a2fb77b1ff598eChris Lattner } 125803c8546ec57523970874917854a2fb77b1ff598eChris Lattner 125903c8546ec57523970874917854a2fb77b1ff598eChris Lattner assert(Result.Val && "Didn't set a result!"); 126003c8546ec57523970874917854a2fb77b1ff598eChris Lattner AddPromotedOperand(Op, Result); 126103c8546ec57523970874917854a2fb77b1ff598eChris Lattner return Result; 126203c8546ec57523970874917854a2fb77b1ff598eChris Lattner} 12633e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 126484f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner/// ExpandAddSub - Find a clever way to expand this add operation into 126584f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner/// subcomponents. 126684f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattnervoid SelectionDAGLegalize::ExpandAddSub(bool isAdd, SDOperand LHS,SDOperand RHS, 126784f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner SDOperand &Lo, SDOperand &Hi) { 126884f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner // Expand the subcomponents. 126984f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner SDOperand LHSL, LHSH, RHSL, RHSH; 127084f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner ExpandOp(LHS, LHSL, LHSH); 127184f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner ExpandOp(RHS, RHSL, RHSH); 127284f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner 127384f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner // Convert this add to the appropriate ADDC pair. The low part has no carry 127484f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner // in. 127584f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner unsigned Opc = isAdd ? ISD::ADD_PARTS : ISD::SUB_PARTS; 127684f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner std::vector<SDOperand> Ops; 127784f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner Ops.push_back(LHSL); 127884f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner Ops.push_back(LHSH); 127984f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner Ops.push_back(RHSL); 128084f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner Ops.push_back(RHSH); 128184f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner Lo = DAG.getNode(Opc, LHSL.getValueType(), Ops); 128284f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner Hi = Lo.getValue(1); 128384f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner} 128484f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner 1285e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner/// ExpandShift - Try to find a clever way to expand this shift operation out to 1286e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner/// smaller elements. If we can't find a way that is more efficient than a 1287e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner/// libcall on this target, return false. Otherwise, return true with the 1288e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner/// low-parts expanded into Lo and Hi. 1289e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattnerbool SelectionDAGLegalize::ExpandShift(unsigned Opc, SDOperand Op,SDOperand Amt, 1290e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner SDOperand &Lo, SDOperand &Hi) { 1291e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner assert((Opc == ISD::SHL || Opc == ISD::SRA || Opc == ISD::SRL) && 1292e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner "This is not a shift!"); 1293e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner MVT::ValueType NVT = TLI.getTypeToTransformTo(Op.getValueType()); 1294e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 1295e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner // If we have an efficient select operation (or if the selects will all fold 1296e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner // away), lower to some complex code, otherwise just emit the libcall. 1297e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner if (TLI.getOperationAction(ISD::SELECT, NVT) != TargetLowering::Legal && 1298e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner !isa<ConstantSDNode>(Amt)) 1299e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner return false; 1300e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 1301e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner SDOperand InL, InH; 1302e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner ExpandOp(Op, InL, InH); 1303e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner SDOperand ShAmt = LegalizeOp(Amt); 1304e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner MVT::ValueType ShTy = ShAmt.getValueType(); 1305e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 1306e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner unsigned NVTBits = MVT::getSizeInBits(NVT); 1307e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner SDOperand NAmt = DAG.getNode(ISD::SUB, ShTy, // NAmt = 32-ShAmt 1308e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner DAG.getConstant(NVTBits, ShTy), ShAmt); 1309e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 1310e5544f851a2a3f7b06339b132e60ad2f2d53e7b8Chris Lattner // Compare the unmasked shift amount against 32. 1311e5544f851a2a3f7b06339b132e60ad2f2d53e7b8Chris Lattner SDOperand Cond = DAG.getSetCC(ISD::SETGE, TLI.getSetCCResultTy(), ShAmt, 1312e5544f851a2a3f7b06339b132e60ad2f2d53e7b8Chris Lattner DAG.getConstant(NVTBits, ShTy)); 1313e5544f851a2a3f7b06339b132e60ad2f2d53e7b8Chris Lattner 1314e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner if (TLI.getShiftAmountFlavor() != TargetLowering::Mask) { 1315e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner ShAmt = DAG.getNode(ISD::AND, ShTy, ShAmt, // ShAmt &= 31 1316e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner DAG.getConstant(NVTBits-1, ShTy)); 1317e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner NAmt = DAG.getNode(ISD::AND, ShTy, NAmt, // NAmt &= 31 1318e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner DAG.getConstant(NVTBits-1, ShTy)); 1319e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner } 1320e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 1321e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner if (Opc == ISD::SHL) { 1322e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner SDOperand T1 = DAG.getNode(ISD::OR, NVT,// T1 = (Hi << Amt) | (Lo >> NAmt) 1323e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner DAG.getNode(ISD::SHL, NVT, InH, ShAmt), 1324e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner DAG.getNode(ISD::SRL, NVT, InL, NAmt)); 1325e5544f851a2a3f7b06339b132e60ad2f2d53e7b8Chris Lattner SDOperand T2 = DAG.getNode(ISD::SHL, NVT, InL, ShAmt); // T2 = Lo << Amt&31 1326e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 1327e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner Hi = DAG.getNode(ISD::SELECT, NVT, Cond, T2, T1); 1328e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner Lo = DAG.getNode(ISD::SELECT, NVT, Cond, DAG.getConstant(0, NVT), T2); 1329e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner } else { 133077e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner SDOperand HiLoPart = DAG.getNode(ISD::SELECT, NVT, 133177e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner DAG.getSetCC(ISD::SETEQ, 133277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner TLI.getSetCCResultTy(), NAmt, 133377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner DAG.getConstant(32, ShTy)), 133477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner DAG.getConstant(0, NVT), 133577e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner DAG.getNode(ISD::SHL, NVT, InH, NAmt)); 1336e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner SDOperand T1 = DAG.getNode(ISD::OR, NVT,// T1 = (Hi << NAmt) | (Lo >> Amt) 133777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner HiLoPart, 1338e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner DAG.getNode(ISD::SRL, NVT, InL, ShAmt)); 1339e5544f851a2a3f7b06339b132e60ad2f2d53e7b8Chris Lattner SDOperand T2 = DAG.getNode(Opc, NVT, InH, ShAmt); // T2 = InH >> ShAmt&31 1340e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 1341e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner SDOperand HiPart; 134277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner if (Opc == ISD::SRA) 134377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner HiPart = DAG.getNode(ISD::SRA, NVT, InH, 134477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner DAG.getConstant(NVTBits-1, ShTy)); 1345e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner else 1346e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner HiPart = DAG.getConstant(0, NVT); 1347e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner Lo = DAG.getNode(ISD::SELECT, NVT, Cond, T2, T1); 1348e5544f851a2a3f7b06339b132e60ad2f2d53e7b8Chris Lattner Hi = DAG.getNode(ISD::SELECT, NVT, Cond, HiPart, T2); 1349e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner } 1350e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner return true; 1351e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner} 135277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner 13539c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner/// FindLatestAdjCallStackDown - Scan up the dag to find the latest (highest 13549c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner/// NodeDepth) node that is an AdjCallStackDown operation and occurs later than 13559c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner/// Found. 13569c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattnerstatic void FindLatestAdjCallStackDown(SDNode *Node, SDNode *&Found) { 13579c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner if (Node->getNodeDepth() <= Found->getNodeDepth()) return; 13589c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 13599c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner // If we found an ADJCALLSTACKDOWN, we already know this node occurs later 13609c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner // than the Found node. Just remember this node and return. 13619c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner if (Node->getOpcode() == ISD::ADJCALLSTACKDOWN) { 13629c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner Found = Node; 13639c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner return; 13649c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner } 13659c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 13669c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner // Otherwise, scan the operands of Node to see if any of them is a call. 13679c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner assert(Node->getNumOperands() != 0 && 13689c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner "All leaves should have depth equal to the entry node!"); 13699c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner for (unsigned i = 0, e = Node->getNumOperands()-1; i != e; ++i) 13709c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner FindLatestAdjCallStackDown(Node->getOperand(i).Val, Found); 13719c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 13729c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner // Tail recurse for the last iteration. 13739c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner FindLatestAdjCallStackDown(Node->getOperand(Node->getNumOperands()-1).Val, 13749c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner Found); 13759c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner} 13769c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 13779c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 13789c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner/// FindEarliestAdjCallStackUp - Scan down the dag to find the earliest (lowest 13799c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner/// NodeDepth) node that is an AdjCallStackUp operation and occurs more recent 13809c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner/// than Found. 13819c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattnerstatic void FindEarliestAdjCallStackUp(SDNode *Node, SDNode *&Found) { 13829c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner if (Found && Node->getNodeDepth() >= Found->getNodeDepth()) return; 13839c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 13849c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner // If we found an ADJCALLSTACKUP, we already know this node occurs earlier 13859c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner // than the Found node. Just remember this node and return. 13869c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner if (Node->getOpcode() == ISD::ADJCALLSTACKUP) { 13879c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner Found = Node; 13889c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner return; 13899c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner } 13909c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 13919c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner // Otherwise, scan the operands of Node to see if any of them is a call. 13929c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SDNode::use_iterator UI = Node->use_begin(), E = Node->use_end(); 13939c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner if (UI == E) return; 13949c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner for (--E; UI != E; ++UI) 13959c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner FindEarliestAdjCallStackUp(*UI, Found); 13969c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 13979c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner // Tail recurse for the last iteration. 13989c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner FindEarliestAdjCallStackUp(*UI, Found); 13999c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner} 14009c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14019c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner/// FindAdjCallStackUp - Given a chained node that is part of a call sequence, 14029c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner/// find the ADJCALLSTACKUP node that terminates the call sequence. 14039c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattnerstatic SDNode *FindAdjCallStackUp(SDNode *Node) { 14049c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner if (Node->getOpcode() == ISD::ADJCALLSTACKUP) 14059c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner return Node; 14069c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner assert(!Node->use_empty() && "Could not find ADJCALLSTACKUP!"); 14079c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14089c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner if (Node->hasOneUse()) // Simple case, only has one user to check. 14099c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner return FindAdjCallStackUp(*Node->use_begin()); 14109c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14119c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SDOperand TheChain(Node, Node->getNumValues()-1); 14129c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner assert(TheChain.getValueType() == MVT::Other && "Is not a token chain!"); 14139c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14149c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner for (SDNode::use_iterator UI = Node->use_begin(), 14159c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner E = Node->use_end(); ; ++UI) { 14169c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner assert(UI != E && "Didn't find a user of the tokchain, no ADJCALLSTACKUP!"); 14179c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14189c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner // Make sure to only follow users of our token chain. 14199c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SDNode *User = *UI; 14209c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) 14219c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner if (User->getOperand(i) == TheChain) 14229c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner return FindAdjCallStackUp(User); 14239c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner } 14249c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner assert(0 && "Unreachable"); 14259c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner abort(); 14269c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner} 14279c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14289c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner/// FindInputOutputChains - If we are replacing an operation with a call we need 14299c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner/// to find the call that occurs before and the call that occurs after it to 14309c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner/// properly serialize the calls in the block. 14319c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattnerstatic SDOperand FindInputOutputChains(SDNode *OpNode, SDNode *&OutChain, 14329c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SDOperand Entry) { 14339c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SDNode *LatestAdjCallStackDown = Entry.Val; 14349c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner FindLatestAdjCallStackDown(OpNode, LatestAdjCallStackDown); 14359c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner //std::cerr << "Found node: "; LatestAdjCallStackDown->dump(); std::cerr <<"\n"; 14369c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14379c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SDNode *LatestAdjCallStackUp = FindAdjCallStackUp(LatestAdjCallStackDown); 14389c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14399c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14409c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SDNode *EarliestAdjCallStackUp = 0; 14419c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner FindEarliestAdjCallStackUp(OpNode, EarliestAdjCallStackUp); 14429c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14439c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner if (EarliestAdjCallStackUp) { 14449c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner //std::cerr << "Found node: "; 14459c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner //EarliestAdjCallStackUp->dump(); std::cerr <<"\n"; 14469c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner } 14479c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14489c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner return SDOperand(LatestAdjCallStackUp, 0); 14499c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner} 14509c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14519c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 14529c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 145377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner// ExpandLibCall - Expand a node into a call to a libcall. If the result value 145477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner// does not fit into a register, return the lo part and set the hi part to the 145577e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner// by-reg argument. If it does fit into a single register, return the result 145677e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner// and leave the Hi part unset. 145777e77a6aa0ab25a812947aed477220dd11220a18Chris LattnerSDOperand SelectionDAGLegalize::ExpandLibCall(const char *Name, SDNode *Node, 145877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner SDOperand &Hi) { 14599c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SDNode *OutChain; 14609c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SDOperand InChain = FindInputOutputChains(Node, OutChain, 14619c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner DAG.getEntryNode()); 14629c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner // TODO. Link in chains. 14639c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 146477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner TargetLowering::ArgListTy Args; 146577e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) { 146677e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner MVT::ValueType ArgVT = Node->getOperand(i).getValueType(); 146777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner const Type *ArgTy = MVT::getTypeForValueType(ArgVT); 146877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Args.push_back(std::make_pair(Node->getOperand(i), ArgTy)); 146977e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner } 147077e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner SDOperand Callee = DAG.getExternalSymbol(Name, TLI.getPointerTy()); 147177e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner 147277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner // We don't care about token chains for libcalls. We just use the entry 147377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner // node as our input and ignore the output chain. This allows us to place 147477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner // calls wherever we need them to satisfy data dependences. 147577e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner const Type *RetTy = MVT::getTypeForValueType(Node->getValueType(0)); 14768e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman SDOperand Result = TLI.LowerCallTo(InChain, RetTy, false, Callee, 147777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Args, DAG).first; 147877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner switch (getTypeAction(Result.getValueType())) { 147977e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner default: assert(0 && "Unknown thing"); 148077e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner case Legal: 148177e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner return Result; 148277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner case Promote: 148377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner assert(0 && "Cannot promote this yet!"); 148477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner case Expand: 148577e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner SDOperand Lo; 148677e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner ExpandOp(Result, Lo, Hi); 148777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner return Lo; 148877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner } 148977e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner} 149077e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner 14919c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 149277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner/// ExpandIntToFP - Expand a [US]INT_TO_FP operation, assuming that the 149377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner/// destination type is legal. 149477e77a6aa0ab25a812947aed477220dd11220a18Chris LattnerSDOperand SelectionDAGLegalize:: 149577e77a6aa0ab25a812947aed477220dd11220a18Chris LattnerExpandIntToFP(bool isSigned, MVT::ValueType DestTy, SDOperand Source) { 149677e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner assert(getTypeAction(DestTy) == Legal && "Destination type is not legal!"); 149777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner assert(getTypeAction(Source.getValueType()) == Expand && 149877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner "This is not an expansion!"); 149977e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner assert(Source.getValueType() == MVT::i64 && "Only handle expand from i64!"); 150077e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner 15019c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SDNode *OutChain; 15029c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SDOperand InChain = FindInputOutputChains(Source.Val, OutChain, 15039c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner DAG.getEntryNode()); 15049c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 1505fed5577066aa13948745415316ebad1c2e72507eChris Lattner const char *FnName = 0; 150677e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner if (isSigned) { 150777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner if (DestTy == MVT::f32) 150877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner FnName = "__floatdisf"; 150977e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner else { 151077e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner assert(DestTy == MVT::f64 && "Unknown fp value type!"); 151177e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner FnName = "__floatdidf"; 151277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner } 151377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner } else { 151477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner // If this is unsigned, and not supported, first perform the conversion to 151577e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner // signed, then adjust the result if the sign bit is set. 151677e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner SDOperand SignedConv = ExpandIntToFP(false, DestTy, Source); 151777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner 151877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner assert(0 && "Unsigned casts not supported yet!"); 151977e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner } 152077e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner SDOperand Callee = DAG.getExternalSymbol(FnName, TLI.getPointerTy()); 152177e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner 152277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner TargetLowering::ArgListTy Args; 152377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner const Type *ArgTy = MVT::getTypeForValueType(Source.getValueType()); 152477e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Args.push_back(std::make_pair(Source, ArgTy)); 152577e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner 152677e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner // We don't care about token chains for libcalls. We just use the entry 152777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner // node as our input and ignore the output chain. This allows us to place 152877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner // calls wherever we need them to satisfy data dependences. 152977e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner const Type *RetTy = MVT::getTypeForValueType(DestTy); 15308e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman return TLI.LowerCallTo(InChain, RetTy, false, Callee, Args, DAG).first; 15319c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner 153277e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner} 153377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner 1534e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 1535e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 15363e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// ExpandOp - Expand the specified SDOperand into its two component pieces 15373e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this, the 15383e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// LegalizeNodes map is filled in for any results that are not expanded, the 15393e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// ExpandedNodes map is filled in for any results that are expanded, and the 15403e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner/// Lo/Hi values are returned. 15413e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattnervoid SelectionDAGLegalize::ExpandOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi){ 15423e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner MVT::ValueType VT = Op.getValueType(); 154371c42a0190300a8903aaea80467b88f15f327ea9Chris Lattner MVT::ValueType NVT = TLI.getTypeToTransformTo(VT); 15443e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDNode *Node = Op.Val; 15453e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(getTypeAction(VT) == Expand && "Not an expanded type!"); 15463e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(MVT::isInteger(VT) && "Cannot expand FP values!"); 15473e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(MVT::isInteger(NVT) && NVT < VT && 15483e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner "Cannot expand to FP value or to larger int value!"); 15493e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 15503e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // If there is more than one use of this, see if we already expanded it. 15513e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // There is no use remembering values that only have a single use, as the map 15523e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // entries will never be reused. 15533e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (!Node->hasOneUse()) { 15543e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner std::map<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I 15553e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner = ExpandedNodes.find(Op); 15563e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (I != ExpandedNodes.end()) { 15573e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Lo = I->second.first; 15583e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Hi = I->second.second; 15593e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner return; 15603e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 15613e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 15623e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 15634e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner // Expanding to multiple registers needs to perform an optimization step, and 15644e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner // is not careful to avoid operations the target does not support. Make sure 15654e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner // that all generated operations are legalized in the next iteration. 15664e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner NeedsAnotherIteration = true; 15673e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 15683e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner switch (Node->getOpcode()) { 15693e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner default: 15703e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner std::cerr << "NODE: "; Node->dump(); std::cerr << "\n"; 15713e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(0 && "Do not know how to expand this operator!"); 15723e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner abort(); 15733e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::Constant: { 15743e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner uint64_t Cst = cast<ConstantSDNode>(Node)->getValue(); 15753e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Lo = DAG.getConstant(Cst, NVT); 15763e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Hi = DAG.getConstant(Cst >> MVT::getSizeInBits(NVT), NVT); 15773e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 15783e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 15793e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 15803e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::CopyFromReg: { 158118c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner unsigned Reg = cast<RegSDNode>(Node)->getReg(); 15823e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Aggregate register values are always in consequtive pairs. 158369a52155d2eff066b49dbac385113002fd9dba14Chris Lattner Lo = DAG.getCopyFromReg(Reg, NVT, Node->getOperand(0)); 158469a52155d2eff066b49dbac385113002fd9dba14Chris Lattner Hi = DAG.getCopyFromReg(Reg+1, NVT, Lo.getValue(1)); 158569a52155d2eff066b49dbac385113002fd9dba14Chris Lattner 158669a52155d2eff066b49dbac385113002fd9dba14Chris Lattner // Remember that we legalized the chain. 158769a52155d2eff066b49dbac385113002fd9dba14Chris Lattner AddLegalizedOperand(Op.getValue(1), Hi.getValue(1)); 158869a52155d2eff066b49dbac385113002fd9dba14Chris Lattner 15893e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(isTypeLegal(NVT) && "Cannot expand this multiple times yet!"); 15903e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 15913e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 15923e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 15933e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::LOAD: { 15943e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand Ch = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 15953e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand Ptr = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. 15963e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Lo = DAG.getLoad(NVT, Ch, Ptr); 15973e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 15983e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Increment the pointer to the other half. 159938d6be5d49e61e4be9bb12ee3cedf2a4fcddb8f3Chris Lattner unsigned IncrementSize = MVT::getSizeInBits(Lo.getValueType())/8; 16003e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr, 16013e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner getIntPtrConstant(IncrementSize)); 1602ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner Hi = DAG.getLoad(NVT, Ch, Ptr); 1603ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner 1604ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner // Build a factor node to remember that this load is independent of the 1605ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner // other one. 1606ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1), 1607ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner Hi.getValue(1)); 16083e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 16093e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Remember that we legalized the chain. 1610ec39a45bdb1eca0cfe77be6a05cc43e16f2338ebChris Lattner AddLegalizedOperand(Op.getValue(1), TF); 16113e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (!TLI.isLittleEndian()) 16123e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner std::swap(Lo, Hi); 16133e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 16143e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 16153e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::CALL: { 16163e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand Chain = LegalizeOp(Node->getOperand(0)); // Legalize the chain. 16173e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand Callee = LegalizeOp(Node->getOperand(1)); // Legalize the callee. 16183e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 16193d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner bool Changed = false; 16203d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner std::vector<SDOperand> Ops; 16213d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner for (unsigned i = 2, e = Node->getNumOperands(); i != e; ++i) { 16223d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner Ops.push_back(LegalizeOp(Node->getOperand(i))); 16233d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner Changed |= Ops.back() != Node->getOperand(i); 16243d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner } 16253d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner 16263e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(Node->getNumValues() == 2 && Op.ResNo == 0 && 16273e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner "Can only expand a call once so far, not i64 -> i16!"); 16283e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 16293e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner std::vector<MVT::ValueType> RetTyVTs; 16303e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner RetTyVTs.reserve(3); 16313e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner RetTyVTs.push_back(NVT); 16323e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner RetTyVTs.push_back(NVT); 16333e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner RetTyVTs.push_back(MVT::Other); 16343d9dffc5863d0319aa9c5cb156045ae6778cba01Chris Lattner SDNode *NC = DAG.getCall(RetTyVTs, Chain, Callee, Ops); 16353e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Lo = SDOperand(NC, 0); 16363e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Hi = SDOperand(NC, 1); 16373e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 16383e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Insert the new chain mapping. 1639e3304a3d24afc952d3cb415d1b504d973573c5c5Chris Lattner AddLegalizedOperand(Op.getValue(1), Hi.getValue(2)); 16403e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 16413e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 16423e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::AND: 16433e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::OR: 16443e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::XOR: { // Simple logical operators -> two trivial pieces. 16453e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand LL, LH, RL, RH; 16463e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Node->getOperand(0), LL, LH); 16473e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Node->getOperand(1), RL, RH); 16483e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Lo = DAG.getNode(Node->getOpcode(), NVT, LL, RL); 16493e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Hi = DAG.getNode(Node->getOpcode(), NVT, LH, RH); 16503e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 16513e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 16523e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SELECT: { 16533e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner SDOperand C, LL, LH, RL, RH; 165447e9223e06390897c3834f8c527001df392570ffChris Lattner 165547e9223e06390897c3834f8c527001df392570ffChris Lattner switch (getTypeAction(Node->getOperand(0).getValueType())) { 165647e9223e06390897c3834f8c527001df392570ffChris Lattner case Expand: assert(0 && "It's impossible to expand bools"); 165747e9223e06390897c3834f8c527001df392570ffChris Lattner case Legal: 165847e9223e06390897c3834f8c527001df392570ffChris Lattner C = LegalizeOp(Node->getOperand(0)); // Legalize the condition. 165947e9223e06390897c3834f8c527001df392570ffChris Lattner break; 166047e9223e06390897c3834f8c527001df392570ffChris Lattner case Promote: 166147e9223e06390897c3834f8c527001df392570ffChris Lattner C = PromoteOp(Node->getOperand(0)); // Promote the condition. 166247e9223e06390897c3834f8c527001df392570ffChris Lattner break; 166347e9223e06390897c3834f8c527001df392570ffChris Lattner } 16643e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Node->getOperand(1), LL, LH); 16653e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner ExpandOp(Node->getOperand(2), RL, RH); 16663e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Lo = DAG.getNode(ISD::SELECT, NVT, C, LL, RL); 16673e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Hi = DAG.getNode(ISD::SELECT, NVT, C, LH, RH); 16683e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 16693e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 16703e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::SIGN_EXTEND: { 16713e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // The low part is just a sign extension of the input (which degenerates to 16723e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // a copy). 16733e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Lo = DAG.getNode(ISD::SIGN_EXTEND, NVT, LegalizeOp(Node->getOperand(0))); 16743e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 16753e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // The high part is obtained by SRA'ing all but one of the bits of the lo 16763e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // part. 16772dad454af674cb41a14a85ad6ce5c85c43959acdChris Lattner unsigned LoSize = MVT::getSizeInBits(Lo.getValueType()); 167827ff112948d059524e5f4ebe249a1da0b7c710e8Chris Lattner Hi = DAG.getNode(ISD::SRA, NVT, Lo, DAG.getConstant(LoSize-1, 167927ff112948d059524e5f4ebe249a1da0b7c710e8Chris Lattner TLI.getShiftAmountTy())); 16803e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 16813e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 16823e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner case ISD::ZERO_EXTEND: 16833e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // The low part is just a zero extension of the input (which degenerates to 16843e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // a copy). 16853e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Lo = DAG.getNode(ISD::ZERO_EXTEND, NVT, LegalizeOp(Node->getOperand(0))); 16863e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 16873e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // The high part is just a zero. 16883e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner Hi = DAG.getConstant(0, NVT); 16893e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner break; 16904e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner 16914e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner // These operators cannot be expanded directly, emit them as calls to 16924e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner // library functions. 16934e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner case ISD::FP_TO_SINT: 16944e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner if (Node->getOperand(0).getValueType() == MVT::f32) 169577e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Lo = ExpandLibCall("__fixsfdi", Node, Hi); 16964e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner else 169777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Lo = ExpandLibCall("__fixdfdi", Node, Hi); 16984e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner break; 16994e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner case ISD::FP_TO_UINT: 17004e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner if (Node->getOperand(0).getValueType() == MVT::f32) 170177e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Lo = ExpandLibCall("__fixunssfdi", Node, Hi); 17024e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner else 170377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Lo = ExpandLibCall("__fixunsdfdi", Node, Hi); 17044e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner break; 17054e6c74689944be1de80c99dc0688ec0bcbd743aaChris Lattner 1706e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner case ISD::SHL: 1707e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner // If we can emit an efficient shift operation, do so now. 170877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner if (ExpandShift(ISD::SHL, Node->getOperand(0), Node->getOperand(1), Lo, Hi)) 1709e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner break; 1710e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner // Otherwise, emit a libcall. 171177e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Lo = ExpandLibCall("__ashldi3", Node, Hi); 1712e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner break; 1713e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 1714e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner case ISD::SRA: 1715e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner // If we can emit an efficient shift operation, do so now. 171677e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner if (ExpandShift(ISD::SRA, Node->getOperand(0), Node->getOperand(1), Lo, Hi)) 1717e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner break; 1718e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner // Otherwise, emit a libcall. 171977e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Lo = ExpandLibCall("__ashrdi3", Node, Hi); 1720e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner break; 1721e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner case ISD::SRL: 1722e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner // If we can emit an efficient shift operation, do so now. 172377e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner if (ExpandShift(ISD::SRL, Node->getOperand(0), Node->getOperand(1), Lo, Hi)) 1724e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner break; 1725e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner // Otherwise, emit a libcall. 172677e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner Lo = ExpandLibCall("__lshrdi3", Node, Hi); 1727e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner break; 1728e34b396ab7d28469bf3d9679a748b643d8e30458Chris Lattner 172984f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner case ISD::ADD: 173084f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner ExpandAddSub(true, Node->getOperand(0), Node->getOperand(1), Lo, Hi); 173184f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner break; 173284f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner case ISD::SUB: 173384f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner ExpandAddSub(false, Node->getOperand(0), Node->getOperand(1), Lo, Hi); 173484f6788044f9b1b47945e98ce23a6cf4d7d32579Chris Lattner break; 173577e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner case ISD::MUL: Lo = ExpandLibCall("__muldi3" , Node, Hi); break; 173677e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner case ISD::SDIV: Lo = ExpandLibCall("__divdi3" , Node, Hi); break; 173777e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner case ISD::UDIV: Lo = ExpandLibCall("__udivdi3", Node, Hi); break; 173877e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner case ISD::SREM: Lo = ExpandLibCall("__moddi3" , Node, Hi); break; 173977e77a6aa0ab25a812947aed477220dd11220a18Chris Lattner case ISD::UREM: Lo = ExpandLibCall("__umoddi3", Node, Hi); break; 17403e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 17413e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 17423e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner // Remember in a map if the values will be reused later. 17433e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner if (!Node->hasOneUse()) { 17443e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner bool isNew = ExpandedNodes.insert(std::make_pair(Op, 17453e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner std::make_pair(Lo, Hi))).second; 17463e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner assert(isNew && "Value already expanded?!?"); 17473e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner } 17483e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner} 17493e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 17503e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 17513e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner// SelectionDAG::Legalize - This is the entry point for the file. 17523e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner// 17539c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattnervoid SelectionDAG::Legalize() { 17543e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// run - This is the main entry point to this class. 17553e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner /// 17569c32d3b798dc6caeebe6cea2effe80ca5e84e66eChris Lattner SelectionDAGLegalize(*this).Run(); 17573e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner} 17583e928bbd6153eb08641cbd0ad7d8487378a8b12aChris Lattner 1759