SelectionDAG.h revision 276dcbdc8db6614cfd5004dc7dc35e437ddf9c58
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/FoldingSet.h" 19#include "llvm/ADT/ilist" 20#include "llvm/CodeGen/SelectionDAGNodes.h" 21 22#include <list> 23#include <vector> 24#include <map> 25#include <set> 26#include <string> 27 28namespace llvm { 29 class AliasAnalysis; 30 class TargetLowering; 31 class TargetMachine; 32 class MachineModuleInfo; 33 class MachineFunction; 34 class MachineConstantPoolValue; 35 36/// SelectionDAG class - This is used to represent a portion of an LLVM function 37/// in a low-level Data Dependence DAG representation suitable for instruction 38/// selection. This DAG is constructed as the first step of instruction 39/// selection in order to allow implementation of machine specific optimizations 40/// and code simplifications. 41/// 42/// The representation used by the SelectionDAG is a target-independent 43/// representation, which has some similarities to the GCC RTL representation, 44/// but is significantly more simple, powerful, and is a graph form instead of a 45/// linear form. 46/// 47class SelectionDAG { 48 TargetLowering &TLI; 49 MachineFunction &MF; 50 MachineModuleInfo *MMI; 51 52 /// Root - The root of the entire DAG. EntryNode - The starting token. 53 SDOperand Root, EntryNode; 54 55 /// AllNodes - A linked list of nodes in the current DAG. 56 ilist<SDNode> AllNodes; 57 58 /// CSEMap - This structure is used to memoize nodes, automatically performing 59 /// CSE with existing nodes with a duplicate is requested. 60 FoldingSet<SDNode> CSEMap; 61 62public: 63 SelectionDAG(TargetLowering &tli, MachineFunction &mf, MachineModuleInfo *mmi) 64 : TLI(tli), MF(mf), MMI(mmi) { 65 EntryNode = Root = getNode(ISD::EntryToken, MVT::Other); 66 } 67 ~SelectionDAG(); 68 69 MachineFunction &getMachineFunction() const { return MF; } 70 const TargetMachine &getTarget() const; 71 TargetLowering &getTargetLoweringInfo() const { return TLI; } 72 MachineModuleInfo *getMachineModuleInfo() const { return MMI; } 73 74 /// viewGraph - Pop up a GraphViz/gv window with the DAG rendered using 'dot'. 75 /// 76 void viewGraph(); 77 78#ifndef NDEBUG 79 std::map<const SDNode *, std::string> NodeGraphAttrs; 80#endif 81 82 /// clearGraphAttrs - Clear all previously defined node graph attributes. 83 /// Intended to be used from a debugging tool (eg. gdb). 84 void clearGraphAttrs(); 85 86 /// setGraphAttrs - Set graph attributes for a node. (eg. "color=red".) 87 /// 88 void setGraphAttrs(const SDNode *N, const char *Attrs); 89 90 /// getGraphAttrs - Get graph attributes for a node. (eg. "color=red".) 91 /// Used from getNodeAttributes. 92 const std::string getGraphAttrs(const SDNode *N) const; 93 94 /// setGraphColor - Convenience for setting node color attribute. 95 /// 96 void setGraphColor(const SDNode *N, const char *Color); 97 98 typedef ilist<SDNode>::const_iterator allnodes_const_iterator; 99 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); } 100 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); } 101 typedef ilist<SDNode>::iterator allnodes_iterator; 102 allnodes_iterator allnodes_begin() { return AllNodes.begin(); } 103 allnodes_iterator allnodes_end() { return AllNodes.end(); } 104 105 /// getRoot - Return the root tag of the SelectionDAG. 106 /// 107 const SDOperand &getRoot() const { return Root; } 108 109 /// getEntryNode - Return the token chain corresponding to the entry of the 110 /// function. 111 const SDOperand &getEntryNode() const { return EntryNode; } 112 113 /// setRoot - Set the current root tag of the SelectionDAG. 114 /// 115 const SDOperand &setRoot(SDOperand N) { return Root = N; } 116 117 /// Combine - This iterates over the nodes in the SelectionDAG, folding 118 /// certain types of nodes together, or eliminating superfluous nodes. When 119 /// the AfterLegalize argument is set to 'true', Combine takes care not to 120 /// generate any nodes that will be illegal on the target. 121 void Combine(bool AfterLegalize, AliasAnalysis &AA); 122 123 /// LegalizeTypes - This transforms the SelectionDAG into a SelectionDAG that 124 /// only uses types natively supported by the target. 125 /// 126 /// Note that this is an involved process that may invalidate pointers into 127 /// the graph. 128 void LegalizeTypes(); 129 130 /// Legalize - This transforms the SelectionDAG into a SelectionDAG that is 131 /// compatible with the target instruction selector, as indicated by the 132 /// TargetLowering object. 133 /// 134 /// Note that this is an involved process that may invalidate pointers into 135 /// the graph. 136 void Legalize(); 137 138 /// RemoveDeadNodes - This method deletes all unreachable nodes in the 139 /// SelectionDAG. 140 void RemoveDeadNodes(); 141 142 /// DeleteNode - Remove the specified node from the system. This node must 143 /// have no referrers. 144 void DeleteNode(SDNode *N); 145 146 /// getVTList - Return an SDVTList that represents the list of values 147 /// specified. 148 SDVTList getVTList(MVT::ValueType VT); 149 SDVTList getVTList(MVT::ValueType VT1, MVT::ValueType VT2); 150 SDVTList getVTList(MVT::ValueType VT1, MVT::ValueType VT2,MVT::ValueType VT3); 151 SDVTList getVTList(const MVT::ValueType *VTs, unsigned NumVTs); 152 153 /// getNodeValueTypes - These are obsolete, use getVTList instead. 154 const MVT::ValueType *getNodeValueTypes(MVT::ValueType VT) { 155 return getVTList(VT).VTs; 156 } 157 const MVT::ValueType *getNodeValueTypes(MVT::ValueType VT1, 158 MVT::ValueType VT2) { 159 return getVTList(VT1, VT2).VTs; 160 } 161 const MVT::ValueType *getNodeValueTypes(MVT::ValueType VT1,MVT::ValueType VT2, 162 MVT::ValueType VT3) { 163 return getVTList(VT1, VT2, VT3).VTs; 164 } 165 const MVT::ValueType *getNodeValueTypes(std::vector<MVT::ValueType> &VTList) { 166 return getVTList(&VTList[0], VTList.size()).VTs; 167 } 168 169 170 //===--------------------------------------------------------------------===// 171 // Node creation methods. 172 // 173 SDOperand getString(const std::string &Val); 174 SDOperand getConstant(uint64_t Val, MVT::ValueType VT, bool isTarget = false); 175 SDOperand getConstant(const APInt &Val, MVT::ValueType VT, bool isTarget = false); 176 SDOperand getIntPtrConstant(uint64_t Val, bool isTarget = false); 177 SDOperand getTargetConstant(uint64_t Val, MVT::ValueType VT) { 178 return getConstant(Val, VT, true); 179 } 180 SDOperand getTargetConstant(const APInt &Val, MVT::ValueType VT) { 181 return getConstant(Val, VT, true); 182 } 183 SDOperand getConstantFP(double Val, MVT::ValueType VT, bool isTarget = false); 184 SDOperand getConstantFP(const APFloat& Val, MVT::ValueType VT, 185 bool isTarget = false); 186 SDOperand getTargetConstantFP(double Val, MVT::ValueType VT) { 187 return getConstantFP(Val, VT, true); 188 } 189 SDOperand getTargetConstantFP(const APFloat& Val, MVT::ValueType VT) { 190 return getConstantFP(Val, VT, true); 191 } 192 SDOperand getGlobalAddress(const GlobalValue *GV, MVT::ValueType VT, 193 int offset = 0, bool isTargetGA = false); 194 SDOperand getTargetGlobalAddress(const GlobalValue *GV, MVT::ValueType VT, 195 int offset = 0) { 196 return getGlobalAddress(GV, VT, offset, true); 197 } 198 SDOperand getFrameIndex(int FI, MVT::ValueType VT, bool isTarget = false); 199 SDOperand getTargetFrameIndex(int FI, MVT::ValueType VT) { 200 return getFrameIndex(FI, VT, true); 201 } 202 SDOperand getJumpTable(int JTI, MVT::ValueType VT, bool isTarget = false); 203 SDOperand getTargetJumpTable(int JTI, MVT::ValueType VT) { 204 return getJumpTable(JTI, VT, true); 205 } 206 SDOperand getConstantPool(Constant *C, MVT::ValueType VT, 207 unsigned Align = 0, int Offs = 0, bool isT=false); 208 SDOperand getTargetConstantPool(Constant *C, MVT::ValueType VT, 209 unsigned Align = 0, int Offset = 0) { 210 return getConstantPool(C, VT, Align, Offset, true); 211 } 212 SDOperand getConstantPool(MachineConstantPoolValue *C, MVT::ValueType VT, 213 unsigned Align = 0, int Offs = 0, bool isT=false); 214 SDOperand getTargetConstantPool(MachineConstantPoolValue *C, 215 MVT::ValueType VT, unsigned Align = 0, 216 int Offset = 0) { 217 return getConstantPool(C, VT, Align, Offset, true); 218 } 219 SDOperand getBasicBlock(MachineBasicBlock *MBB); 220 SDOperand getExternalSymbol(const char *Sym, MVT::ValueType VT); 221 SDOperand getTargetExternalSymbol(const char *Sym, MVT::ValueType VT); 222 SDOperand getArgFlags(ISD::ArgFlagsTy Flags); 223 SDOperand getValueType(MVT::ValueType); 224 SDOperand getRegister(unsigned Reg, MVT::ValueType VT); 225 226 SDOperand getCopyToReg(SDOperand Chain, unsigned Reg, SDOperand N) { 227 return getNode(ISD::CopyToReg, MVT::Other, Chain, 228 getRegister(Reg, N.getValueType()), N); 229 } 230 231 // This version of the getCopyToReg method takes an extra operand, which 232 // indicates that there is potentially an incoming flag value (if Flag is not 233 // null) and that there should be a flag result. 234 SDOperand getCopyToReg(SDOperand Chain, unsigned Reg, SDOperand N, 235 SDOperand Flag) { 236 const MVT::ValueType *VTs = getNodeValueTypes(MVT::Other, MVT::Flag); 237 SDOperand Ops[] = { Chain, getRegister(Reg, N.getValueType()), N, Flag }; 238 return getNode(ISD::CopyToReg, VTs, 2, Ops, Flag.Val ? 4 : 3); 239 } 240 241 // Similar to last getCopyToReg() except parameter Reg is a SDOperand 242 SDOperand getCopyToReg(SDOperand Chain, SDOperand Reg, SDOperand N, 243 SDOperand Flag) { 244 const MVT::ValueType *VTs = getNodeValueTypes(MVT::Other, MVT::Flag); 245 SDOperand Ops[] = { Chain, Reg, N, Flag }; 246 return getNode(ISD::CopyToReg, VTs, 2, Ops, Flag.Val ? 4 : 3); 247 } 248 249 SDOperand getCopyFromReg(SDOperand Chain, unsigned Reg, MVT::ValueType VT) { 250 const MVT::ValueType *VTs = getNodeValueTypes(VT, MVT::Other); 251 SDOperand Ops[] = { Chain, getRegister(Reg, VT) }; 252 return getNode(ISD::CopyFromReg, VTs, 2, Ops, 2); 253 } 254 255 // This version of the getCopyFromReg method takes an extra operand, which 256 // indicates that there is potentially an incoming flag value (if Flag is not 257 // null) and that there should be a flag result. 258 SDOperand getCopyFromReg(SDOperand Chain, unsigned Reg, MVT::ValueType VT, 259 SDOperand Flag) { 260 const MVT::ValueType *VTs = getNodeValueTypes(VT, MVT::Other, MVT::Flag); 261 SDOperand Ops[] = { Chain, getRegister(Reg, VT), Flag }; 262 return getNode(ISD::CopyFromReg, VTs, 3, Ops, Flag.Val ? 3 : 2); 263 } 264 265 SDOperand getCondCode(ISD::CondCode Cond); 266 267 /// getZeroExtendInReg - Return the expression required to zero extend the Op 268 /// value assuming it was the smaller SrcTy value. 269 SDOperand getZeroExtendInReg(SDOperand Op, MVT::ValueType SrcTy); 270 271 /// getCALLSEQ_START - Return a new CALLSEQ_START node, which always must have 272 /// a flag result (to ensure it's not CSE'd). 273 SDOperand getCALLSEQ_START(SDOperand Chain, SDOperand Op) { 274 const MVT::ValueType *VTs = getNodeValueTypes(MVT::Other, MVT::Flag); 275 SDOperand Ops[] = { Chain, Op }; 276 return getNode(ISD::CALLSEQ_START, VTs, 2, Ops, 2); 277 } 278 279 /// getCALLSEQ_END - Return a new CALLSEQ_END node, which always must have a 280 /// flag result (to ensure it's not CSE'd). 281 SDOperand getCALLSEQ_END(SDOperand Chain, SDOperand Op1, SDOperand Op2, 282 SDOperand InFlag) { 283 SDVTList NodeTys = getVTList(MVT::Other, MVT::Flag); 284 SmallVector<SDOperand, 4> Ops; 285 Ops.push_back(Chain); 286 Ops.push_back(Op1); 287 Ops.push_back(Op2); 288 Ops.push_back(InFlag); 289 return getNode(ISD::CALLSEQ_END, NodeTys, &Ops[0], 290 Ops.size() - (InFlag.Val == 0 ? 1 : 0)); 291 } 292 293 /// getNode - Gets or creates the specified node. 294 /// 295 SDOperand getNode(unsigned Opcode, MVT::ValueType VT); 296 SDOperand getNode(unsigned Opcode, MVT::ValueType VT, SDOperand N); 297 SDOperand getNode(unsigned Opcode, MVT::ValueType VT, 298 SDOperand N1, SDOperand N2); 299 SDOperand getNode(unsigned Opcode, MVT::ValueType VT, 300 SDOperand N1, SDOperand N2, SDOperand N3); 301 SDOperand getNode(unsigned Opcode, MVT::ValueType VT, 302 SDOperand N1, SDOperand N2, SDOperand N3, SDOperand N4); 303 SDOperand getNode(unsigned Opcode, MVT::ValueType VT, 304 SDOperand N1, SDOperand N2, SDOperand N3, SDOperand N4, 305 SDOperand N5); 306 SDOperand getNode(unsigned Opcode, MVT::ValueType VT, 307 const SDOperand *Ops, unsigned NumOps); 308 SDOperand getNode(unsigned Opcode, std::vector<MVT::ValueType> &ResultTys, 309 const SDOperand *Ops, unsigned NumOps); 310 SDOperand getNode(unsigned Opcode, const MVT::ValueType *VTs, unsigned NumVTs, 311 const SDOperand *Ops, unsigned NumOps); 312 SDOperand getNode(unsigned Opcode, SDVTList VTs); 313 SDOperand getNode(unsigned Opcode, SDVTList VTs, SDOperand N); 314 SDOperand getNode(unsigned Opcode, SDVTList VTs, 315 SDOperand N1, SDOperand N2); 316 SDOperand getNode(unsigned Opcode, SDVTList VTs, 317 SDOperand N1, SDOperand N2, SDOperand N3); 318 SDOperand getNode(unsigned Opcode, SDVTList VTs, 319 SDOperand N1, SDOperand N2, SDOperand N3, SDOperand N4); 320 SDOperand getNode(unsigned Opcode, SDVTList VTs, 321 SDOperand N1, SDOperand N2, SDOperand N3, SDOperand N4, 322 SDOperand N5); 323 SDOperand getNode(unsigned Opcode, SDVTList VTs, 324 const SDOperand *Ops, unsigned NumOps); 325 326 SDOperand getMemcpy(SDOperand Chain, SDOperand Dest, SDOperand Src, 327 SDOperand Size, SDOperand Align, 328 SDOperand AlwaysInline); 329 330 SDOperand getMemmove(SDOperand Chain, SDOperand Dest, SDOperand Src, 331 SDOperand Size, SDOperand Align, 332 SDOperand AlwaysInline); 333 334 SDOperand getMemset(SDOperand Chain, SDOperand Dest, SDOperand Src, 335 SDOperand Size, SDOperand Align, 336 SDOperand AlwaysInline); 337 338 /// getSetCC - Helper function to make it easier to build SetCC's if you just 339 /// have an ISD::CondCode instead of an SDOperand. 340 /// 341 SDOperand getSetCC(MVT::ValueType VT, SDOperand LHS, SDOperand RHS, 342 ISD::CondCode Cond) { 343 return getNode(ISD::SETCC, VT, LHS, RHS, getCondCode(Cond)); 344 } 345 346 /// getSelectCC - Helper function to make it easier to build SelectCC's if you 347 /// just have an ISD::CondCode instead of an SDOperand. 348 /// 349 SDOperand getSelectCC(SDOperand LHS, SDOperand RHS, 350 SDOperand True, SDOperand False, ISD::CondCode Cond) { 351 return getNode(ISD::SELECT_CC, True.getValueType(), LHS, RHS, True, False, 352 getCondCode(Cond)); 353 } 354 355 /// getVAArg - VAArg produces a result and token chain, and takes a pointer 356 /// and a source value as input. 357 SDOperand getVAArg(MVT::ValueType VT, SDOperand Chain, SDOperand Ptr, 358 SDOperand SV); 359 360 /// getAtomic - Gets a node for an atomic op, produces result and chain, takes 361 // 3 operands 362 SDOperand getAtomic(unsigned Opcode, SDOperand Chain, SDOperand Ptr, 363 SDOperand Cmp, SDOperand Swp, MVT::ValueType VT); 364 365 /// getAtomic - Gets a node for an atomic op, produces result and chain, takes 366 // 2 operands 367 SDOperand getAtomic(unsigned Opcode, SDOperand Chain, SDOperand Ptr, 368 SDOperand Val, MVT::ValueType VT); 369 370 /// getLoad - Loads are not normal binary operators: their result type is not 371 /// determined by their operands, and they produce a value AND a token chain. 372 /// 373 SDOperand getLoad(MVT::ValueType VT, SDOperand Chain, SDOperand Ptr, 374 const Value *SV, int SVOffset, bool isVolatile=false, 375 unsigned Alignment=0); 376 SDOperand getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT, 377 SDOperand Chain, SDOperand Ptr, const Value *SV, 378 int SVOffset, MVT::ValueType EVT, bool isVolatile=false, 379 unsigned Alignment=0); 380 SDOperand getIndexedLoad(SDOperand OrigLoad, SDOperand Base, 381 SDOperand Offset, ISD::MemIndexedMode AM); 382 383 /// getStore - Helper function to build ISD::STORE nodes. 384 /// 385 SDOperand getStore(SDOperand Chain, SDOperand Val, SDOperand Ptr, 386 const Value *SV, int SVOffset, bool isVolatile=false, 387 unsigned Alignment=0); 388 SDOperand getTruncStore(SDOperand Chain, SDOperand Val, SDOperand Ptr, 389 const Value *SV, int SVOffset, MVT::ValueType TVT, 390 bool isVolatile=false, unsigned Alignment=0); 391 SDOperand getIndexedStore(SDOperand OrigStoe, SDOperand Base, 392 SDOperand Offset, ISD::MemIndexedMode AM); 393 394 // getSrcValue - Construct a node to track a Value* through the backend. 395 SDOperand getSrcValue(const Value *v); 396 397 // getMemOperand - Construct a node to track a memory reference 398 // through the backend. 399 SDOperand getMemOperand(const MemOperand &MO); 400 401 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the 402 /// specified operands. If the resultant node already exists in the DAG, 403 /// this does not modify the specified node, instead it returns the node that 404 /// already exists. If the resultant node does not exist in the DAG, the 405 /// input node is returned. As a degenerate case, if you specify the same 406 /// input operands as the node already has, the input node is returned. 407 SDOperand UpdateNodeOperands(SDOperand N, SDOperand Op); 408 SDOperand UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2); 409 SDOperand UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, 410 SDOperand Op3); 411 SDOperand UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, 412 SDOperand Op3, SDOperand Op4); 413 SDOperand UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, 414 SDOperand Op3, SDOperand Op4, SDOperand Op5); 415 SDOperand UpdateNodeOperands(SDOperand N, SDOperand *Ops, unsigned NumOps); 416 417 /// SelectNodeTo - These are used for target selectors to *mutate* the 418 /// specified node to have the specified return type, Target opcode, and 419 /// operands. Note that target opcodes are stored as 420 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field. The 0th value 421 /// of the resultant node is returned. 422 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT::ValueType VT); 423 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT::ValueType VT, 424 SDOperand Op1); 425 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT::ValueType VT, 426 SDOperand Op1, SDOperand Op2); 427 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT::ValueType VT, 428 SDOperand Op1, SDOperand Op2, SDOperand Op3); 429 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT::ValueType VT, 430 const SDOperand *Ops, unsigned NumOps); 431 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT::ValueType VT1, 432 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2); 433 SDNode *SelectNodeTo(SDNode *N, unsigned TargetOpc, MVT::ValueType VT1, 434 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2, 435 SDOperand Op3); 436 437 438 /// getTargetNode - These are used for target selectors to create a new node 439 /// with specified return type(s), target opcode, and operands. 440 /// 441 /// Note that getTargetNode returns the resultant node. If there is already a 442 /// node of the specified opcode and operands, it returns that node instead of 443 /// the current one. 444 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT); 445 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT, 446 SDOperand Op1); 447 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT, 448 SDOperand Op1, SDOperand Op2); 449 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT, 450 SDOperand Op1, SDOperand Op2, SDOperand Op3); 451 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT, 452 const SDOperand *Ops, unsigned NumOps); 453 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT1, 454 MVT::ValueType VT2); 455 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT1, 456 MVT::ValueType VT2, SDOperand Op1); 457 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT1, 458 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2); 459 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT1, 460 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2, 461 SDOperand Op3); 462 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT1, 463 MVT::ValueType VT2, 464 const SDOperand *Ops, unsigned NumOps); 465 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT1, 466 MVT::ValueType VT2, MVT::ValueType VT3, 467 SDOperand Op1, SDOperand Op2); 468 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT1, 469 MVT::ValueType VT2, MVT::ValueType VT3, 470 SDOperand Op1, SDOperand Op2, SDOperand Op3); 471 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT1, 472 MVT::ValueType VT2, MVT::ValueType VT3, 473 const SDOperand *Ops, unsigned NumOps); 474 SDNode *getTargetNode(unsigned Opcode, MVT::ValueType VT1, 475 MVT::ValueType VT2, MVT::ValueType VT3, 476 MVT::ValueType VT4, 477 const SDOperand *Ops, unsigned NumOps); 478 SDNode *getTargetNode(unsigned Opcode, std::vector<MVT::ValueType> &ResultTys, 479 const SDOperand *Ops, unsigned NumOps); 480 481 /// DAGUpdateListener - Clients of various APIs that cause global effects on 482 /// the DAG can optionally implement this interface. This allows the clients 483 /// to handle the various sorts of updates that happen. 484 class DAGUpdateListener { 485 public: 486 virtual ~DAGUpdateListener(); 487 virtual void NodeDeleted(SDNode *N) = 0; 488 virtual void NodeUpdated(SDNode *N) = 0; 489 }; 490 491 /// RemoveDeadNode - Remove the specified node from the system. If any of its 492 /// operands then becomes dead, remove them as well. Inform UpdateListener 493 /// for each node deleted. 494 void RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener = 0); 495 496 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead. 497 /// This can cause recursive merging of nodes in the DAG. Use the first 498 /// version if 'From' is known to have a single result, use the second 499 /// if you have two nodes with identical results, use the third otherwise. 500 /// 501 /// These methods all take an optional UpdateListener, which (if not null) is 502 /// informed about nodes that are deleted and modified due to recursive 503 /// changes in the dag. 504 /// 505 void ReplaceAllUsesWith(SDOperand From, SDOperand Op, 506 DAGUpdateListener *UpdateListener = 0); 507 void ReplaceAllUsesWith(SDNode *From, SDNode *To, 508 DAGUpdateListener *UpdateListener = 0); 509 void ReplaceAllUsesWith(SDNode *From, const SDOperand *To, 510 DAGUpdateListener *UpdateListener = 0); 511 512 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving 513 /// uses of other values produced by From.Val alone. 514 void ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To, 515 DAGUpdateListener *UpdateListener = 0); 516 517 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on 518 /// their allnodes order. It returns the maximum id. 519 unsigned AssignNodeIds(); 520 521 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG 522 /// based on their topological order. It returns the maximum id and a vector 523 /// of the SDNodes* in assigned order by reference. 524 unsigned AssignTopologicalOrder(std::vector<SDNode*> &TopOrder); 525 526 /// isCommutativeBinOp - Returns true if the opcode is a commutative binary 527 /// operation. 528 static bool isCommutativeBinOp(unsigned Opcode) { 529 // FIXME: This should get its info from the td file, so that we can include 530 // target info. 531 switch (Opcode) { 532 case ISD::ADD: 533 case ISD::MUL: 534 case ISD::MULHU: 535 case ISD::MULHS: 536 case ISD::SMUL_LOHI: 537 case ISD::UMUL_LOHI: 538 case ISD::FADD: 539 case ISD::FMUL: 540 case ISD::AND: 541 case ISD::OR: 542 case ISD::XOR: 543 case ISD::ADDC: 544 case ISD::ADDE: return true; 545 default: return false; 546 } 547 } 548 549 void dump() const; 550 551 /// CreateStackTemporary - Create a stack temporary, suitable for holding the 552 /// specified value type. 553 SDOperand CreateStackTemporary(MVT::ValueType VT); 554 555 /// FoldSetCC - Constant fold a setcc to true or false. 556 SDOperand FoldSetCC(MVT::ValueType VT, SDOperand N1, 557 SDOperand N2, ISD::CondCode Cond); 558 559 /// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We 560 /// use this predicate to simplify operations downstream. 561 bool SignBitIsZero(SDOperand Op, unsigned Depth = 0) const; 562 563 /// MaskedValueIsZero - Return true if 'Op & Mask' is known to be zero. We 564 /// use this predicate to simplify operations downstream. Op and Mask are 565 /// known to be the same type. 566 bool MaskedValueIsZero(SDOperand Op, const APInt &Mask, unsigned Depth = 0) 567 const; 568 569 /// ComputeMaskedBits - Determine which of the bits specified in Mask are 570 /// known to be either zero or one and return them in the KnownZero/KnownOne 571 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit 572 /// processing. Targets can implement the computeMaskedBitsForTargetNode 573 /// method in the TargetLowering class to allow target nodes to be understood. 574 void ComputeMaskedBits(SDOperand Op, const APInt &Mask, APInt &KnownZero, 575 APInt &KnownOne, unsigned Depth = 0) const; 576 577 /// ComputeNumSignBits - Return the number of times the sign bit of the 578 /// register is replicated into the other bits. We know that at least 1 bit 579 /// is always equal to the sign bit (itself), but other cases can give us 580 /// information. For example, immediately after an "SRA X, 2", we know that 581 /// the top 3 bits are all equal to each other, so we return 3. Targets can 582 /// implement the ComputeNumSignBitsForTarget method in the TargetLowering 583 /// class to allow target nodes to be understood. 584 unsigned ComputeNumSignBits(SDOperand Op, unsigned Depth = 0) const; 585 586 /// isVerifiedDebugInfoDesc - Returns true if the specified SDOperand has 587 /// been verified as a debug information descriptor. 588 bool isVerifiedDebugInfoDesc(SDOperand Op) const; 589 590private: 591 void RemoveNodeFromCSEMaps(SDNode *N); 592 SDNode *AddNonLeafNodeToCSEMaps(SDNode *N); 593 SDNode *FindModifiedNodeSlot(SDNode *N, SDOperand Op, void *&InsertPos); 594 SDNode *FindModifiedNodeSlot(SDNode *N, SDOperand Op1, SDOperand Op2, 595 void *&InsertPos); 596 SDNode *FindModifiedNodeSlot(SDNode *N, const SDOperand *Ops, unsigned NumOps, 597 void *&InsertPos); 598 599 void DeleteNodeNotInCSEMaps(SDNode *N); 600 601 // List of non-single value types. 602 std::list<std::vector<MVT::ValueType> > VTList; 603 604 // Maps to auto-CSE operations. 605 std::vector<CondCodeSDNode*> CondCodeNodes; 606 607 std::vector<SDNode*> ValueTypeNodes; 608 std::map<MVT::ValueType, SDNode*> ExtendedValueTypeNodes; 609 std::map<std::string, SDNode*> ExternalSymbols; 610 std::map<std::string, SDNode*> TargetExternalSymbols; 611 std::map<std::string, StringSDNode*> StringNodes; 612}; 613 614template <> struct GraphTraits<SelectionDAG*> : public GraphTraits<SDNode*> { 615 typedef SelectionDAG::allnodes_iterator nodes_iterator; 616 static nodes_iterator nodes_begin(SelectionDAG *G) { 617 return G->allnodes_begin(); 618 } 619 static nodes_iterator nodes_end(SelectionDAG *G) { 620 return G->allnodes_end(); 621 } 622}; 623 624} // end namespace llvm 625 626#endif 627