SelectionDAG.h revision f90b2a7742ddeddc448586cc050818a664419e74
1//===-- llvm/CodeGen/SelectionDAG.h - InstSelection DAG ---------*- C++ -*-===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 10// This file declares the SelectionDAG class, and transitively defines the 11// SDNode class and subclasses. 12// 13//===----------------------------------------------------------------------===// 14 15#ifndef LLVM_CODEGEN_SELECTIONDAG_H 16#define LLVM_CODEGEN_SELECTIONDAG_H 17 18#include "llvm/ADT/ilist.h" 19#include "llvm/ADT/DenseSet.h" 20#include "llvm/ADT/FoldingSet.h" 21#include "llvm/ADT/StringMap.h" 22#include "llvm/CodeGen/SelectionDAGNodes.h" 23 24#include <cassert> 25#include <vector> 26#include <map> 27#include <string> 28 29namespace llvm { 30 31class AliasAnalysis; 32class TargetLowering; 33class TargetMachine; 34class MachineModuleInfo; 35class DwarfWriter; 36class MachineFunction; 37class MachineConstantPoolValue; 38class FunctionLoweringInfo; 39 40template<> struct ilist_traits<SDNode> : public ilist_default_traits<SDNode> { 41private: 42 mutable SDNode Sentinel; 43public: 44 ilist_traits() : Sentinel(ISD::DELETED_NODE, SDVTList()) {} 45 46 SDNode *createSentinel() const { 47 return &Sentinel; 48 } 49 static void destroySentinel(SDNode *) {} 50 51 static void deleteNode(SDNode *) { 52 assert(0 && "ilist_traits<SDNode> shouldn't see a deleteNode call!"); 53 } 54private: 55 static void createNode(const SDNode &); 56}; 57 58enum CombineLevel { 59 Unrestricted, // Combine may create illegal operations and illegal types. 60 NoIllegalTypes, // Combine may create illegal operations but no illegal types. 61 NoIllegalOperations // Combine may only create legal operations and types. 62}; 63 64/// SelectionDAG class - This is used to represent a portion of an LLVM function 65/// in a low-level Data Dependence DAG representation suitable for instruction 66/// selection. This DAG is constructed as the first step of instruction 67/// selection in order to allow implementation of machine specific optimizations 68/// and code simplifications. 69/// 70/// The representation used by the SelectionDAG is a target-independent 71/// representation, which has some similarities to the GCC RTL representation, 72/// but is significantly more simple, powerful, and is a graph form instead of a 73/// linear form. 74/// 75class SelectionDAG { 76 TargetLowering &TLI; 77 MachineFunction *MF; 78 FunctionLoweringInfo &FLI; 79 MachineModuleInfo *MMI; 80 DwarfWriter *DW; 81 82 /// EntryNode - The starting token. 83 SDNode EntryNode; 84 85 /// Root - The root of the entire DAG. 86 SDValue Root; 87 88 /// AllNodes - A linked list of nodes in the current DAG. 89 ilist<SDNode> AllNodes; 90 91 /// NodeAllocatorType - The AllocatorType for allocating SDNodes. We use 92 /// pool allocation with recycling. 93 typedef RecyclingAllocator<BumpPtrAllocator, SDNode, sizeof(LargestSDNode), 94 AlignOf<MostAlignedSDNode>::Alignment> 95 NodeAllocatorType; 96 97 /// NodeAllocator - Pool allocation for nodes. 98 NodeAllocatorType NodeAllocator; 99 100 /// CSEMap - This structure is used to memoize nodes, automatically performing 101 /// CSE with existing nodes with a duplicate is requested. 102 FoldingSet<SDNode> CSEMap; 103 104 /// OperandAllocator - Pool allocation for machine-opcode SDNode operands. 105 BumpPtrAllocator OperandAllocator; 106 107 /// Allocator - Pool allocation for misc. objects that are created once per 108 /// SelectionDAG. 109 BumpPtrAllocator Allocator; 110 111 /// VerifyNode - Sanity check the given node. Aborts if it is invalid. 112 void VerifyNode(SDNode *N); 113 114 /// setGraphColorHelper - Implementation of setSubgraphColor. 115 /// Return whether we had to truncate the search. 116 /// 117 bool setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, 118 int level, bool &printed); 119 120public: 121 SelectionDAG(TargetLowering &tli, FunctionLoweringInfo &fli); 122 ~SelectionDAG(); 123 124 /// init - Prepare this SelectionDAG to process code in the given 125 /// MachineFunction. 126 /// 127 void init(MachineFunction &mf, MachineModuleInfo *mmi, DwarfWriter *dw); 128 129 /// clear - Clear state and free memory necessary to make this 130 /// SelectionDAG ready to process a new block. 131 /// 132 void clear(); 133 134 MachineFunction &getMachineFunction() const { return *MF; } 135 const TargetMachine &getTarget() const; 136 TargetLowering &getTargetLoweringInfo() const { return TLI; } 137 FunctionLoweringInfo &getFunctionLoweringInfo() const { return FLI; } 138 MachineModuleInfo *getMachineModuleInfo() const { return MMI; } 139 DwarfWriter *getDwarfWriter() const { return DW; } 140 141 /// viewGraph - Pop up a GraphViz/gv window with the DAG rendered using 'dot'. 142 /// 143 void viewGraph(const std::string &Title); 144 void viewGraph(); 145 146#ifndef NDEBUG 147 std::map<const SDNode *, std::string> NodeGraphAttrs; 148#endif 149 150 /// clearGraphAttrs - Clear all previously defined node graph attributes. 151 /// Intended to be used from a debugging tool (eg. gdb). 152 void clearGraphAttrs(); 153 154 /// setGraphAttrs - Set graph attributes for a node. (eg. "color=red".) 155 /// 156 void setGraphAttrs(const SDNode *N, const char *Attrs); 157 158 /// getGraphAttrs - Get graph attributes for a node. (eg. "color=red".) 159 /// Used from getNodeAttributes. 160 const std::string getGraphAttrs(const SDNode *N) const; 161 162 /// setGraphColor - Convenience for setting node color attribute. 163 /// 164 void setGraphColor(const SDNode *N, const char *Color); 165 166 /// setGraphColor - Convenience for setting subgraph color attribute. 167 /// 168 void setSubgraphColor(SDNode *N, const char *Color); 169 170 typedef ilist<SDNode>::const_iterator allnodes_const_iterator; 171 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); } 172 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); } 173 typedef ilist<SDNode>::iterator allnodes_iterator; 174 allnodes_iterator allnodes_begin() { return AllNodes.begin(); } 175 allnodes_iterator allnodes_end() { return AllNodes.end(); } 176 ilist<SDNode>::size_type allnodes_size() const { 177 return AllNodes.size(); 178 } 179 180 /// getRoot - Return the root tag of the SelectionDAG. 181 /// 182 const SDValue &getRoot() const { return Root; } 183 184 /// getEntryNode - Return the token chain corresponding to the entry of the 185 /// function. 186 SDValue getEntryNode() const { 187 return SDValue(const_cast<SDNode *>(&EntryNode), 0); 188 } 189 190 /// setRoot - Set the current root tag of the SelectionDAG. 191 /// 192 const SDValue &setRoot(SDValue N) { 193 assert((!N.getNode() || N.getValueType() == MVT::Other) && 194 "DAG root value is not a chain!"); 195 return Root = N; 196 } 197 198 /// Combine - This iterates over the nodes in the SelectionDAG, folding 199 /// certain types of nodes together, or eliminating superfluous nodes. The 200 /// Level argument controls whether Combine is allowed to produce nodes and 201 /// types that are illegal on the target. 202 void Combine(CombineLevel Level, AliasAnalysis &AA, bool Fast); 203 204 /// LegalizeTypes - This transforms the SelectionDAG into a SelectionDAG that 205 /// only uses types natively supported by the target. Returns "true" if it 206 /// made any changes. 207 /// 208 /// Note that this is an involved process that may invalidate pointers into 209 /// the graph. 210 bool LegalizeTypes(); 211 212 /// Legalize - This transforms the SelectionDAG into a SelectionDAG that is 213 /// compatible with the target instruction selector, as indicated by the 214 /// TargetLowering object. 215 /// 216 /// Note that this is an involved process that may invalidate pointers into 217 /// the graph. 218 void Legalize(bool TypesNeedLegalizing); 219 220 /// RemoveDeadNodes - This method deletes all unreachable nodes in the 221 /// SelectionDAG. 222 void RemoveDeadNodes(); 223 224 /// DeleteNode - Remove the specified node from the system. This node must 225 /// have no referrers. 226 void DeleteNode(SDNode *N); 227 228 /// getVTList - Return an SDVTList that represents the list of values 229 /// specified. 230 SDVTList getVTList(MVT VT); 231 SDVTList getVTList(MVT VT1, MVT VT2); 232 SDVTList getVTList(MVT VT1, MVT VT2, MVT VT3); 233 SDVTList getVTList(MVT VT1, MVT VT2, MVT VT3, MVT VT4); 234 SDVTList getVTList(const MVT *VTs, unsigned NumVTs); 235 236 /// getNodeValueTypes - These are obsolete, use getVTList instead. 237 const MVT *getNodeValueTypes(MVT VT) { 238 return getVTList(VT).VTs; 239 } 240 const MVT *getNodeValueTypes(MVT VT1, MVT VT2) { 241 return getVTList(VT1, VT2).VTs; 242 } 243 const MVT *getNodeValueTypes(MVT VT1, MVT VT2, MVT VT3) { 244 return getVTList(VT1, VT2, VT3).VTs; 245 } 246 const MVT *getNodeValueTypes(MVT VT1, MVT VT2, MVT VT3, MVT VT4) { 247 return getVTList(VT1, VT2, VT3, VT4).VTs; 248 } 249 const MVT *getNodeValueTypes(const std::vector<MVT> &vtList) { 250 return getVTList(&vtList[0], (unsigned)vtList.size()).VTs; 251 } 252 253 254 //===--------------------------------------------------------------------===// 255 // Node creation methods. 256 // 257 SDValue getConstant(uint64_t Val, MVT VT, bool isTarget = false); 258 SDValue getConstant(const APInt &Val, MVT VT, bool isTarget = false); 259 SDValue getConstant(const ConstantInt &Val, MVT VT, bool isTarget = false); 260 SDValue getIntPtrConstant(uint64_t Val, bool isTarget = false); 261 SDValue getTargetConstant(uint64_t Val, MVT VT) { 262 return getConstant(Val, VT, true); 263 } 264 SDValue getTargetConstant(const APInt &Val, MVT VT) { 265 return getConstant(Val, VT, true); 266 } 267 SDValue getTargetConstant(const ConstantInt &Val, MVT VT) { 268 return getConstant(Val, VT, true); 269 } 270 SDValue getConstantFP(double Val, MVT VT, bool isTarget = false); 271 SDValue getConstantFP(const APFloat& Val, MVT VT, bool isTarget = false); 272 SDValue getConstantFP(const ConstantFP &CF, MVT VT, bool isTarget = false); 273 SDValue getTargetConstantFP(double Val, MVT VT) { 274 return getConstantFP(Val, VT, true); 275 } 276 SDValue getTargetConstantFP(const APFloat& Val, MVT VT) { 277 return getConstantFP(Val, VT, true); 278 } 279 SDValue getTargetConstantFP(const ConstantFP &Val, MVT VT) { 280 return getConstantFP(Val, VT, true); 281 } 282 SDValue getGlobalAddress(const GlobalValue *GV, MVT VT, 283 int64_t offset = 0, bool isTargetGA = false); 284 SDValue getTargetGlobalAddress(const GlobalValue *GV, MVT VT, 285 int64_t offset = 0) { 286 return getGlobalAddress(GV, VT, offset, true); 287 } 288 SDValue getFrameIndex(int FI, MVT VT, bool isTarget = false); 289 SDValue getTargetFrameIndex(int FI, MVT VT) { 290 return getFrameIndex(FI, VT, true); 291 } 292 SDValue getJumpTable(int JTI, MVT VT, bool isTarget = false); 293 SDValue getTargetJumpTable(int JTI, MVT VT) { 294 return getJumpTable(JTI, VT, true); 295 } 296 SDValue getConstantPool(Constant *C, MVT VT, 297 unsigned Align = 0, int Offs = 0, bool isT=false); 298 SDValue getTargetConstantPool(Constant *C, MVT VT, 299 unsigned Align = 0, int Offset = 0) { 300 return getConstantPool(C, VT, Align, Offset, true); 301 } 302 SDValue getConstantPool(MachineConstantPoolValue *C, MVT VT, 303 unsigned Align = 0, int Offs = 0, bool isT=false); 304 SDValue getTargetConstantPool(MachineConstantPoolValue *C, 305 MVT VT, unsigned Align = 0, 306 int Offset = 0) { 307 return getConstantPool(C, VT, Align, Offset, true); 308 } 309 // When generating a branch to a BB, we don't in general know enough 310 // to provide debug info for the BB at that time, so keep this one around. 311 SDValue getBasicBlock(MachineBasicBlock *MBB); 312 SDValue getBasicBlock(MachineBasicBlock *MBB, DebugLoc dl); 313 SDValue getExternalSymbol(const char *Sym, MVT VT); 314 SDValue getExternalSymbol(const char *Sym, DebugLoc dl, MVT VT); 315 SDValue getTargetExternalSymbol(const char *Sym, MVT VT); 316 SDValue getTargetExternalSymbol(const char *Sym, DebugLoc dl, MVT VT); 317 SDValue getArgFlags(ISD::ArgFlagsTy Flags); 318 SDValue getValueType(MVT); 319 SDValue getRegister(unsigned Reg, MVT VT); 320 SDValue getDbgStopPoint(SDValue Root, unsigned Line, unsigned Col, 321 Value *CU); 322 SDValue getLabel(unsigned Opcode, DebugLoc dl, SDValue Root, 323 unsigned LabelID); 324 325 SDValue getCopyToReg(SDValue Chain, DebugLoc dl, unsigned Reg, SDValue N) { 326 return getNode(ISD::CopyToReg, dl, MVT::Other, Chain, 327 getRegister(Reg, N.getValueType()), N); 328 } 329 330 // This version of the getCopyToReg method takes an extra operand, which 331 // indicates that there is potentially an incoming flag value (if Flag is not 332 // null) and that there should be a flag result. 333 SDValue getCopyToReg(SDValue Chain, DebugLoc dl, unsigned Reg, SDValue N, 334 SDValue Flag) { 335 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag); 336 SDValue Ops[] = { Chain, getRegister(Reg, N.getValueType()), N, Flag }; 337 return getNode(ISD::CopyToReg, dl, VTs, 2, Ops, Flag.getNode() ? 4 : 3); 338 } 339 340 // Similar to last getCopyToReg() except parameter Reg is a SDValue 341 SDValue getCopyToReg(SDValue Chain, DebugLoc dl, SDValue Reg, SDValue N, 342 SDValue Flag) { 343 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag); 344 SDValue Ops[] = { Chain, Reg, N, Flag }; 345 return getNode(ISD::CopyToReg, dl, VTs, 2, Ops, Flag.getNode() ? 4 : 3); 346 } 347 348 SDValue getCopyFromReg(SDValue Chain, DebugLoc dl, unsigned Reg, MVT VT) { 349 const MVT *VTs = getNodeValueTypes(VT, MVT::Other); 350 SDValue Ops[] = { Chain, getRegister(Reg, VT) }; 351 return getNode(ISD::CopyFromReg, dl, VTs, 2, Ops, 2); 352 } 353 354 // This version of the getCopyFromReg method takes an extra operand, which 355 // indicates that there is potentially an incoming flag value (if Flag is not 356 // null) and that there should be a flag result. 357 SDValue getCopyFromReg(SDValue Chain, DebugLoc dl, unsigned Reg, MVT VT, 358 SDValue Flag) { 359 const MVT *VTs = getNodeValueTypes(VT, MVT::Other, MVT::Flag); 360 SDValue Ops[] = { Chain, getRegister(Reg, VT), Flag }; 361 return getNode(ISD::CopyFromReg, dl, VTs, 3, Ops, Flag.getNode() ? 3 : 2); 362 } 363 364 SDValue getCondCode(ISD::CondCode Cond); 365 366 /// Returns the ConvertRndSat Note: Avoid using this node because it may 367 /// disappear in the future and most targets don't support it. 368 SDValue getConvertRndSat(MVT VT, DebugLoc dl, SDValue Val, SDValue DTy, 369 SDValue STy, 370 SDValue Rnd, SDValue Sat, ISD::CvtCode Code); 371 372 /// getZeroExtendInReg - Return the expression required to zero extend the Op 373 /// value assuming it was the smaller SrcTy value. 374 SDValue getZeroExtendInReg(SDValue Op, DebugLoc DL, MVT SrcTy); 375 376 /// getNOT - Create a bitwise NOT operation as (XOR Val, -1). 377 SDValue getNOT(DebugLoc DL, SDValue Val, MVT VT); 378 379 /// getCALLSEQ_START - Return a new CALLSEQ_START node, which always must have 380 /// a flag result (to ensure it's not CSE'd). 381 SDValue getCALLSEQ_START(SDValue Chain, SDValue Op) { 382 const MVT *VTs = getNodeValueTypes(MVT::Other, MVT::Flag); 383 SDValue Ops[] = { Chain, Op }; 384 return getNode(ISD::CALLSEQ_START, VTs, 2, Ops, 2); 385 } 386 387 /// getCALLSEQ_END - Return a new CALLSEQ_END node, which always must have a 388 /// flag result (to ensure it's not CSE'd). 389 SDValue getCALLSEQ_END(SDValue Chain, SDValue Op1, SDValue Op2, 390 SDValue InFlag) { 391 SDVTList NodeTys = getVTList(MVT::Other, MVT::Flag); 392 SmallVector<SDValue, 4> Ops; 393 Ops.push_back(Chain); 394 Ops.push_back(Op1); 395 Ops.push_back(Op2); 396 Ops.push_back(InFlag); 397 return getNode(ISD::CALLSEQ_END, NodeTys, &Ops[0], 398 (unsigned)Ops.size() - (InFlag.getNode() == 0 ? 1 : 0)); 399 } 400 401 /// getNode - Gets or creates the specified node. 402 /// 403 SDValue getNode(unsigned Opcode, MVT VT); 404 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT); 405 SDValue getNode(unsigned Opcode, MVT VT, SDValue N); 406 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT, SDValue N); 407 SDValue getNode(unsigned Opcode, MVT VT, SDValue N1, SDValue N2); 408 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT, SDValue N1, SDValue N2); 409 SDValue getNode(unsigned Opcode, MVT VT, 410 SDValue N1, SDValue N2, SDValue N3); 411 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT, 412 SDValue N1, SDValue N2, SDValue N3); 413 SDValue getNode(unsigned Opcode, MVT VT, 414 SDValue N1, SDValue N2, SDValue N3, SDValue N4); 415 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT, 416 SDValue N1, SDValue N2, SDValue N3, SDValue N4); 417 SDValue getNode(unsigned Opcode, MVT VT, 418 SDValue N1, SDValue N2, SDValue N3, SDValue N4, 419 SDValue N5); 420 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT, 421 SDValue N1, SDValue N2, SDValue N3, SDValue N4, 422 SDValue N5); 423 SDValue getNode(unsigned Opcode, MVT VT, 424 const SDUse *Ops, unsigned NumOps); 425 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT, 426 const SDUse *Ops, unsigned NumOps); 427 SDValue getNode(unsigned Opcode, DebugLoc DL, MVT VT, 428 const SDValue *Ops, unsigned NumOps); 429 SDValue getNode(unsigned Opcode, DebugLoc DL, 430 const std::vector<MVT> &ResultTys, 431 const SDValue *Ops, unsigned NumOps); 432 SDValue getNode(unsigned Opcode, const MVT *VTs, unsigned NumVTs, 433 const SDValue *Ops, unsigned NumOps); 434 SDValue getNode(unsigned Opcode, DebugLoc DL, const MVT *VTs, unsigned NumVTs, 435 const SDValue *Ops, unsigned NumOps); 436 SDValue getNode(unsigned Opcode, SDVTList VTs, 437 const SDValue *Ops, unsigned NumOps); 438 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs, 439 const SDValue *Ops, unsigned NumOps); 440 441 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs); 442 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs, SDValue N); 443 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs, 444 SDValue N1, SDValue N2); 445 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs, 446 SDValue N1, SDValue N2, SDValue N3); 447 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs, 448 SDValue N1, SDValue N2, SDValue N3, SDValue N4); 449 SDValue getNode(unsigned Opcode, DebugLoc DL, SDVTList VTs, 450 SDValue N1, SDValue N2, SDValue N3, SDValue N4, 451 SDValue N5); 452 453 SDValue getMemcpy(SDValue Chain, DebugLoc dl, SDValue Dst, SDValue Src, 454 SDValue Size, unsigned Align, bool AlwaysInline, 455 const Value *DstSV, uint64_t DstSVOff, 456 const Value *SrcSV, uint64_t SrcSVOff); 457 458 SDValue getMemmove(SDValue Chain, DebugLoc dl, SDValue Dst, SDValue Src, 459 SDValue Size, unsigned Align, 460 const Value *DstSV, uint64_t DstOSVff, 461 const Value *SrcSV, uint64_t SrcSVOff); 462 463 SDValue getMemset(SDValue Chain, DebugLoc dl, SDValue Dst, SDValue Src, 464 SDValue Size, unsigned Align, 465 const Value *DstSV, uint64_t DstSVOff); 466 467 /// getSetCC - Helper function to make it easier to build SetCC's if you just 468 /// have an ISD::CondCode instead of an SDValue. 469 /// 470 SDValue getSetCC(DebugLoc DL, MVT VT, SDValue LHS, SDValue RHS, 471 ISD::CondCode Cond) { 472 return getNode(ISD::SETCC, DL, VT, LHS, RHS, getCondCode(Cond)); 473 } 474 475 /// getVSetCC - Helper function to make it easier to build VSetCC's nodes 476 /// if you just have an ISD::CondCode instead of an SDValue. 477 /// 478 SDValue getVSetCC(DebugLoc DL, MVT VT, SDValue LHS, SDValue RHS, 479 ISD::CondCode Cond) { 480 return getNode(ISD::VSETCC, DL, VT, LHS, RHS, getCondCode(Cond)); 481 } 482 483 /// getSelectCC - Helper function to make it easier to build SelectCC's if you 484 /// just have an ISD::CondCode instead of an SDValue. 485 /// 486 SDValue getSelectCC(DebugLoc DL, SDValue LHS, SDValue RHS, 487 SDValue True, SDValue False, ISD::CondCode Cond) { 488 return getNode(ISD::SELECT_CC, DL, True.getValueType(), 489 LHS, RHS, True, False, getCondCode(Cond)); 490 } 491 492 /// getVAArg - VAArg produces a result and token chain, and takes a pointer 493 /// and a source value as input. 494 SDValue getVAArg(MVT VT, DebugLoc dl, SDValue Chain, SDValue Ptr, 495 SDValue SV); 496 497 /// getAtomic - Gets a node for an atomic op, produces result and chain and 498 /// takes 3 operands 499 SDValue getAtomic(unsigned Opcode, DebugLoc dl, MVT MemVT, SDValue Chain, 500 SDValue Ptr, SDValue Cmp, SDValue Swp, const Value* PtrVal, 501 unsigned Alignment=0); 502 503 /// getAtomic - Gets a node for an atomic op, produces result and chain and 504 /// takes 2 operands. 505 SDValue getAtomic(unsigned Opcode, DebugLoc dl, MVT MemVT, SDValue Chain, 506 SDValue Ptr, SDValue Val, const Value* PtrVal, 507 unsigned Alignment = 0); 508 509 /// getMemIntrinsicNode - Creates a MemIntrinsicNode that may produce a 510 /// result and takes a list of operands. 511 SDValue getMemIntrinsicNode(unsigned Opcode, DebugLoc dl, 512 const MVT *VTs, unsigned NumVTs, 513 const SDValue *Ops, unsigned NumOps, 514 MVT MemVT, const Value *srcValue, int SVOff, 515 unsigned Align = 0, bool Vol = false, 516 bool ReadMem = true, bool WriteMem = true); 517 518 SDValue getMemIntrinsicNode(unsigned Opcode, DebugLoc dl, SDVTList VTList, 519 const SDValue *Ops, unsigned NumOps, 520 MVT MemVT, const Value *srcValue, int SVOff, 521 unsigned Align = 0, bool Vol = false, 522 bool ReadMem = true, bool WriteMem = true); 523 524 /// getMergeValues - Create a MERGE_VALUES node from the given operands. 525 SDValue getMergeValues(const SDValue *Ops, unsigned NumOps, DebugLoc dl); 526 527 /// getCall - Create a CALL node from the given information. 528 /// 529 SDValue getCall(unsigned CallingConv, DebugLoc dl, bool IsVarArgs, 530 bool IsTailCall, bool isInreg, SDVTList VTs, 531 const SDValue *Operands, unsigned NumOperands); 532 533 /// getLoad - Loads are not normal binary operators: their result type is not 534 /// determined by their operands, and they produce a value AND a token chain. 535 /// 536 SDValue getLoad(MVT VT, DebugLoc dl, SDValue Chain, SDValue Ptr, 537 const Value *SV, int SVOffset, bool isVolatile=false, 538 unsigned Alignment=0); 539 SDValue getExtLoad(ISD::LoadExtType ExtType, DebugLoc dl, MVT VT, 540 SDValue Chain, SDValue Ptr, const Value *SV, 541 int SVOffset, MVT EVT, bool isVolatile=false, 542 unsigned Alignment=0); 543 SDValue getIndexedLoad(SDValue OrigLoad, DebugLoc dl, SDValue Base, 544 SDValue Offset, ISD::MemIndexedMode AM); 545 SDValue getLoad(ISD::MemIndexedMode AM, DebugLoc dl, ISD::LoadExtType ExtType, 546 MVT VT, SDValue Chain, 547 SDValue Ptr, SDValue Offset, 548 const Value *SV, int SVOffset, MVT EVT, 549 bool isVolatile=false, unsigned Alignment=0); 550 551 /// getStore - Helper function to build ISD::STORE nodes. 552 /// 553 SDValue getStore(SDValue Chain, DebugLoc dl, SDValue Val, SDValue Ptr, 554 const Value *SV, int SVOffset, bool isVolatile=false, 555 unsigned Alignment=0); 556 SDValue getTruncStore(SDValue Chain, DebugLoc dl, SDValue Val, SDValue Ptr, 557 const Value *SV, int SVOffset, MVT TVT, 558 bool isVolatile=false, unsigned Alignment=0); 559 SDValue getIndexedStore(SDValue OrigStoe, DebugLoc dl, SDValue Base, 560 SDValue Offset, ISD::MemIndexedMode AM); 561 562 /// getSrcValue - Construct a node to track a Value* through the backend. 563 SDValue getSrcValue(const Value *v); 564 565 /// getMemOperand - Construct a node to track a memory reference 566 /// through the backend. 567 SDValue getMemOperand(const MachineMemOperand &MO); 568 569 /// getShiftAmountOperand - Return the specified value casted to 570 /// the target's desired shift amount type. 571 SDValue getShiftAmountOperand(SDValue Op); 572 573 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the 574 /// specified operands. If the resultant node already exists in the DAG, 575 /// this does not modify the specified node, instead it returns the node that 576 /// already exists. If the resultant node does not exist in the DAG, the 577 /// input node is returned. As a degenerate case, if you specify the same 578 /// input operands as the node already has, the input node is returned. 579 SDValue UpdateNodeOperands(SDValue N, SDValue Op); 580 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2); 581 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2, 582 SDValue Op3); 583 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2, 584 SDValue Op3, SDValue Op4); 585 SDValue UpdateNodeOperands(SDValue N, SDValue Op1, SDValue Op2, 586 SDValue Op3, SDValue Op4, SDValue Op5); 587 SDValue UpdateNodeOperands(SDValue N, 588 const SDValue *Ops, unsigned NumOps); 589 590 /// SelectNodeTo - These are used for target selectors to *mutate* the 591 /// specified node to have the specified return type, Target opcode, and 592 /// operands. Note that target opcodes are stored as 593 /// ~TargetOpcode in the node opcode field. The resultant node is returned. 594 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT); 595 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT, SDValue Op1); 596 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT, 597 SDValue Op1, SDValue Op2); 598 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT, 599 SDValue Op1, SDValue Op2, SDValue Op3); 600 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT, 601 const SDValue *Ops, unsigned NumOps); 602 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1, MVT VT2); 603 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1, 604 MVT VT2, const SDValue *Ops, unsigned NumOps); 605 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1, 606 MVT VT2, MVT VT3, const SDValue *Ops, unsigned NumOps); 607 SDNode *SelectNodeTo(SDNode *N, unsigned MachineOpc, MVT VT1, 608 MVT VT2, MVT VT3, MVT VT4, const SDValue *Ops, 609 unsigned NumOps); 610 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1, 611 MVT VT2, SDValue Op1); 612 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1, 613 MVT VT2, SDValue Op1, SDValue Op2); 614 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1, 615 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3); 616 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT VT1, 617 MVT VT2, MVT VT3, SDValue Op1, SDValue Op2, SDValue Op3); 618 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, SDVTList VTs, 619 const SDValue *Ops, unsigned NumOps); 620 621 /// MorphNodeTo - These *mutate* the specified node to have the specified 622 /// return type, opcode, and operands. 623 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT); 624 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT, SDValue Op1); 625 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT, 626 SDValue Op1, SDValue Op2); 627 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT, 628 SDValue Op1, SDValue Op2, SDValue Op3); 629 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT, 630 const SDValue *Ops, unsigned NumOps); 631 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1, MVT VT2); 632 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1, 633 MVT VT2, const SDValue *Ops, unsigned NumOps); 634 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1, 635 MVT VT2, MVT VT3, const SDValue *Ops, unsigned NumOps); 636 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1, 637 MVT VT2, SDValue Op1); 638 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1, 639 MVT VT2, SDValue Op1, SDValue Op2); 640 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, MVT VT1, 641 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3); 642 SDNode *MorphNodeTo(SDNode *N, unsigned Opc, SDVTList VTs, 643 const SDValue *Ops, unsigned NumOps); 644 645 /// getTargetNode - These are used for target selectors to create a new node 646 /// with specified return type(s), target opcode, and operands. 647 /// 648 /// Note that getTargetNode returns the resultant node. If there is already a 649 /// node of the specified opcode and operands, it returns that node instead of 650 /// the current one. 651 SDNode *getTargetNode(unsigned Opcode, MVT VT); 652 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT); 653 654 SDNode *getTargetNode(unsigned Opcode, MVT VT, SDValue Op1); 655 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT, SDValue Op1); 656 657 SDNode *getTargetNode(unsigned Opcode, MVT VT, SDValue Op1, SDValue Op2); 658 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT, SDValue Op1, 659 SDValue Op2); 660 661 SDNode *getTargetNode(unsigned Opcode, MVT VT, 662 SDValue Op1, SDValue Op2, SDValue Op3); 663 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT, 664 SDValue Op1, SDValue Op2, SDValue Op3); 665 666 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT, 667 const SDValue *Ops, unsigned NumOps); 668 669 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2); 670 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2); 671 672 SDNode *getTargetNode(unsigned Opcode, MVT VT1, MVT VT2, SDValue Op1); 673 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2, 674 SDValue Op1); 675 676 SDNode *getTargetNode(unsigned Opcode, MVT VT1, 677 MVT VT2, SDValue Op1, SDValue Op2); 678 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, 679 MVT VT2, SDValue Op1, SDValue Op2); 680 681 SDNode *getTargetNode(unsigned Opcode, MVT VT1, 682 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3); 683 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, 684 MVT VT2, SDValue Op1, SDValue Op2, SDValue Op3); 685 686 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2, 687 const SDValue *Ops, unsigned NumOps); 688 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2, MVT VT3, 689 SDValue Op1, SDValue Op2); 690 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2, MVT VT3, 691 SDValue Op1, SDValue Op2, SDValue Op3); 692 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2, MVT VT3, 693 const SDValue *Ops, unsigned NumOps); 694 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, MVT VT1, MVT VT2, MVT VT3, 695 MVT VT4, const SDValue *Ops, unsigned NumOps); 696 SDNode *getTargetNode(unsigned Opcode, DebugLoc dl, 697 const std::vector<MVT> &ResultTys, const SDValue *Ops, 698 unsigned NumOps); 699 700 /// getNodeIfExists - Get the specified node if it's already available, or 701 /// else return NULL. 702 SDNode *getNodeIfExists(unsigned Opcode, SDVTList VTs, 703 const SDValue *Ops, unsigned NumOps); 704 705 /// DAGUpdateListener - Clients of various APIs that cause global effects on 706 /// the DAG can optionally implement this interface. This allows the clients 707 /// to handle the various sorts of updates that happen. 708 class DAGUpdateListener { 709 public: 710 virtual ~DAGUpdateListener(); 711 712 /// NodeDeleted - The node N that was deleted and, if E is not null, an 713 /// equivalent node E that replaced it. 714 virtual void NodeDeleted(SDNode *N, SDNode *E) = 0; 715 716 /// NodeUpdated - The node N that was updated. 717 virtual void NodeUpdated(SDNode *N) = 0; 718 }; 719 720 /// RemoveDeadNode - Remove the specified node from the system. If any of its 721 /// operands then becomes dead, remove them as well. Inform UpdateListener 722 /// for each node deleted. 723 void RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener = 0); 724 725 /// RemoveDeadNodes - This method deletes the unreachable nodes in the 726 /// given list, and any nodes that become unreachable as a result. 727 void RemoveDeadNodes(SmallVectorImpl<SDNode *> &DeadNodes, 728 DAGUpdateListener *UpdateListener = 0); 729 730 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 731 /// This can cause recursive merging of nodes in the DAG. Use the first 732 /// version if 'From' is known to have a single result, use the second 733 /// if you have two nodes with identical results, use the third otherwise. 734 /// 735 /// These methods all take an optional UpdateListener, which (if not null) is 736 /// informed about nodes that are deleted and modified due to recursive 737 /// changes in the dag. 738 /// 739 /// These functions only replace all existing uses. It's possible that as 740 /// these replacements are being performed, CSE may cause the From node 741 /// to be given new uses. These new uses of From are left in place, and 742 /// not automatically transfered to To. 743 /// 744 void ReplaceAllUsesWith(SDValue From, SDValue Op, 745 DAGUpdateListener *UpdateListener = 0); 746 void ReplaceAllUsesWith(SDNode *From, SDNode *To, 747 DAGUpdateListener *UpdateListener = 0); 748 void ReplaceAllUsesWith(SDNode *From, const SDValue *To, 749 DAGUpdateListener *UpdateListener = 0); 750 751 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving 752 /// uses of other values produced by From.Val alone. 753 void ReplaceAllUsesOfValueWith(SDValue From, SDValue To, 754 DAGUpdateListener *UpdateListener = 0); 755 756 /// ReplaceAllUsesOfValuesWith - Like ReplaceAllUsesOfValueWith, but 757 /// for multiple values at once. This correctly handles the case where 758 /// there is an overlap between the From values and the To values. 759 void ReplaceAllUsesOfValuesWith(const SDValue *From, const SDValue *To, 760 unsigned Num, 761 DAGUpdateListener *UpdateListener = 0); 762 763 /// AssignTopologicalOrder - Topological-sort the AllNodes list and a 764 /// assign a unique node id for each node in the DAG based on their 765 /// topological order. Returns the number of nodes. 766 unsigned AssignTopologicalOrder(); 767 768 /// RepositionNode - Move node N in the AllNodes list to be immediately 769 /// before the given iterator Position. This may be used to update the 770 /// topological ordering when the list of nodes is modified. 771 void RepositionNode(allnodes_iterator Position, SDNode *N) { 772 AllNodes.insert(Position, AllNodes.remove(N)); 773 } 774 775 /// isCommutativeBinOp - Returns true if the opcode is a commutative binary 776 /// operation. 777 static bool isCommutativeBinOp(unsigned Opcode) { 778 // FIXME: This should get its info from the td file, so that we can include 779 // target info. 780 switch (Opcode) { 781 case ISD::ADD: 782 case ISD::MUL: 783 case ISD::MULHU: 784 case ISD::MULHS: 785 case ISD::SMUL_LOHI: 786 case ISD::UMUL_LOHI: 787 case ISD::FADD: 788 case ISD::FMUL: 789 case ISD::AND: 790 case ISD::OR: 791 case ISD::XOR: 792 case ISD::ADDC: 793 case ISD::ADDE: return true; 794 default: return false; 795 } 796 } 797 798 void dump() const; 799 800 /// CreateStackTemporary - Create a stack temporary, suitable for holding the 801 /// specified value type. If minAlign is specified, the slot size will have 802 /// at least that alignment. 803 SDValue CreateStackTemporary(MVT VT, unsigned minAlign = 1); 804 805 /// CreateStackTemporary - Create a stack temporary suitable for holding 806 /// either of the specified value types. 807 SDValue CreateStackTemporary(MVT VT1, MVT VT2); 808 809 /// FoldConstantArithmetic - 810 SDValue FoldConstantArithmetic(unsigned Opcode, 811 MVT VT, 812 ConstantSDNode *Cst1, 813 ConstantSDNode *Cst2); 814 815 /// FoldSetCC - Constant fold a setcc to true or false. 816 SDValue FoldSetCC(MVT VT, SDValue N1, 817 SDValue N2, ISD::CondCode Cond, DebugLoc dl); 818 819 /// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We 820 /// use this predicate to simplify operations downstream. 821 bool SignBitIsZero(SDValue Op, unsigned Depth = 0) const; 822 823 /// MaskedValueIsZero - Return true if 'Op & Mask' is known to be zero. We 824 /// use this predicate to simplify operations downstream. Op and Mask are 825 /// known to be the same type. 826 bool MaskedValueIsZero(SDValue Op, const APInt &Mask, unsigned Depth = 0) 827 const; 828 829 /// ComputeMaskedBits - Determine which of the bits specified in Mask are 830 /// known to be either zero or one and return them in the KnownZero/KnownOne 831 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit 832 /// processing. Targets can implement the computeMaskedBitsForTargetNode 833 /// method in the TargetLowering class to allow target nodes to be understood. 834 void ComputeMaskedBits(SDValue Op, const APInt &Mask, APInt &KnownZero, 835 APInt &KnownOne, unsigned Depth = 0) const; 836 837 /// ComputeNumSignBits - Return the number of times the sign bit of the 838 /// register is replicated into the other bits. We know that at least 1 bit 839 /// is always equal to the sign bit (itself), but other cases can give us 840 /// information. For example, immediately after an "SRA X, 2", we know that 841 /// the top 3 bits are all equal to each other, so we return 3. Targets can 842 /// implement the ComputeNumSignBitsForTarget method in the TargetLowering 843 /// class to allow target nodes to be understood. 844 unsigned ComputeNumSignBits(SDValue Op, unsigned Depth = 0) const; 845 846 /// isVerifiedDebugInfoDesc - Returns true if the specified SDValue has 847 /// been verified as a debug information descriptor. 848 bool isVerifiedDebugInfoDesc(SDValue Op) const; 849 850 /// getShuffleScalarElt - Returns the scalar element that will make up the ith 851 /// element of the result of the vector shuffle. 852 SDValue getShuffleScalarElt(const SDNode *N, unsigned Idx); 853 854private: 855 bool RemoveNodeFromCSEMaps(SDNode *N); 856 void AddModifiedNodeToCSEMaps(SDNode *N, DAGUpdateListener *UpdateListener); 857 SDNode *FindModifiedNodeSlot(SDNode *N, SDValue Op, void *&InsertPos); 858 SDNode *FindModifiedNodeSlot(SDNode *N, SDValue Op1, SDValue Op2, 859 void *&InsertPos); 860 SDNode *FindModifiedNodeSlot(SDNode *N, const SDValue *Ops, unsigned NumOps, 861 void *&InsertPos); 862 863 void DeleteNodeNotInCSEMaps(SDNode *N); 864 void DeallocateNode(SDNode *N); 865 866 unsigned getMVTAlignment(MVT MemoryVT) const; 867 868 void allnodes_clear(); 869 870 /// VTList - List of non-single value types. 871 std::vector<SDVTList> VTList; 872 873 /// CondCodeNodes - Maps to auto-CSE operations. 874 std::vector<CondCodeSDNode*> CondCodeNodes; 875 876 std::vector<SDNode*> ValueTypeNodes; 877 std::map<MVT, SDNode*, MVT::compareRawBits> ExtendedValueTypeNodes; 878 StringMap<SDNode*> ExternalSymbols; 879 StringMap<SDNode*> TargetExternalSymbols; 880}; 881 882template <> struct GraphTraits<SelectionDAG*> : public GraphTraits<SDNode*> { 883 typedef SelectionDAG::allnodes_iterator nodes_iterator; 884 static nodes_iterator nodes_begin(SelectionDAG *G) { 885 return G->allnodes_begin(); 886 } 887 static nodes_iterator nodes_end(SelectionDAG *G) { 888 return G->allnodes_end(); 889 } 890}; 891 892} // end namespace llvm 893 894#endif 895