-/* -*-C++-*-
- ****************************************************************************
- * File:
- * SchedGraph.h
- *
- * Purpose:
- * Scheduling graph based on SSA graph plus extra dependence edges
- * capturing dependences due to machine resources (machine registers,
- * CC registers, and any others).
- *
- * Strategy:
- * This graph tries to leverage the SSA graph as much as possible,
- * but captures the extra dependences through a common interface.
- *
- * History:
- * 7/20/01 - Vikram Adve - Created
- ***************************************************************************/
+//===-- SchedGraph.h - Scheduling Graph --------------------------*- C++ -*--=//
+//
+// Purpose:
+// Scheduling graph based on SSA graph plus extra dependence edges
+// capturing dependences due to machine resources (machine registers,
+// CC registers, and any others).
+//
+// Strategy:
+// This graph tries to leverage the SSA graph as much as possible,
+// but captures the extra dependences through a common interface.
+//
+//===----------------------------------------------------------------------===//
#ifndef LLVM_CODEGEN_SCHEDGRAPH_H
#define LLVM_CODEGEN_SCHEDGRAPH_H
-#include "llvm/Support/NonCopyable.h"
-#include "llvm/Support/HashExtras.h"
-#include "llvm/Support/GraphTraits.h"
-#include <hash_map>
-
-class Value;
-class Instruction;
-class TerminatorInst;
-class BasicBlock;
-class Method;
-class TargetMachine;
-class SchedGraphEdge;
-class SchedGraphNode;
-class SchedGraph;
-class RegToRefVecMap;
-class MachineInstr;
+#include "llvm/CodeGen/SchedGraphCommon.h"
+#include "llvm/CodeGen/MachineInstr.h"
+#include "llvm/Transforms/Scalar.h"
+#include "Support/hash_map"
+#include "Support/GraphTraits.h"
-/******************** Exported Data Types and Constants ********************/
-typedef int ResourceId;
-const ResourceId InvalidResourceId = -1;
+class RegToRefVecMap;
+class ValueToDefVecMap;
+class RefVec;
+class SchedGraphNode : public SchedGraphNodeCommon {
-//*********************** Public Class Declarations ************************/
+ int origIndexInBB; // original position of machine instr in BB
+ MachineBasicBlock *MBB;
+ const MachineInstr *MI;
-class SchedGraphEdge: public NonCopyable {
-public:
- enum SchedGraphEdgeDepType {
- CtrlDep, MemoryDep, DefUseDep, MachineRegister, MachineResource
- };
- enum DataDepOrderType {
- TrueDep, AntiDep, OutputDep, NonDataDep
- };
-
-protected:
- SchedGraphNode* src;
- SchedGraphNode* sink;
- SchedGraphEdgeDepType depType;
- DataDepOrderType depOrderType;
- int minDelay; // cached latency (assumes fixed target arch)
-
- union {
- const Value* val;
- int machineRegNum;
- ResourceId resourceId;
- };
-
-public:
- // For all constructors, if minDelay is unspecified, minDelay is
- // set to _src->getLatency().
- // constructor for CtrlDep or MemoryDep edges, selected by 3rd argument
- /*ctor*/ SchedGraphEdge(SchedGraphNode* _src,
- SchedGraphNode* _sink,
- SchedGraphEdgeDepType _depType,
- DataDepOrderType _depOrderType =TrueDep,
- int _minDelay = -1);
-
- // constructor for explicit def-use or memory def-use edge
- /*ctor*/ SchedGraphEdge(SchedGraphNode* _src,
- SchedGraphNode* _sink,
- const Value* _val,
- DataDepOrderType _depOrderType =TrueDep,
- int _minDelay = -1);
-
- // constructor for machine register dependence
- /*ctor*/ SchedGraphEdge(SchedGraphNode* _src,
- SchedGraphNode* _sink,
- unsigned int _regNum,
- DataDepOrderType _depOrderType =TrueDep,
- int _minDelay = -1);
-
- // constructor for any other machine resource dependences.
- // DataDepOrderType is always NonDataDep. It it not an argument to
- // avoid overloading ambiguity with previous constructor.
- /*ctor*/ SchedGraphEdge(SchedGraphNode* _src,
- SchedGraphNode* _sink,
- ResourceId _resourceId,
- int _minDelay = -1);
-
- /*dtor*/ ~SchedGraphEdge();
-
- SchedGraphNode* getSrc () const { return src; }
- SchedGraphNode* getSink () const { return sink; }
- int getMinDelay () const { return minDelay; }
- SchedGraphEdgeDepType getDepType () const { return depType; }
-
- const Value* getValue () const {
- assert(depType == DefUseDep || depType == MemoryDep); return val;
- }
- int getMachineReg () const {
- assert(depType == MachineRegister); return machineRegNum;
- }
- int getResourceId () const {
- assert(depType == MachineResource); return resourceId;
- }
-
-public:
- //
- // Debugging support
- //
- friend ostream& operator<<(ostream& os, const SchedGraphEdge& edge);
-
- void dump (int indent=0) const;
-
-private:
- // disable default ctor
- /*ctor*/ SchedGraphEdge(); // DO NOT IMPLEMENT
-};
+ SchedGraphNode(unsigned nodeId, MachineBasicBlock *mbb, int indexInBB,
+ const TargetMachine& Target);
+ ~SchedGraphNode();
-
-class SchedGraphNode: public NonCopyable {
-private:
- unsigned int nodeId;
- const Instruction* instr;
- const MachineInstr* minstr;
- vector<SchedGraphEdge*> inEdges;
- vector<SchedGraphEdge*> outEdges;
- int latency;
-
-public:
- typedef vector<SchedGraphEdge*>:: iterator iterator;
- typedef vector<SchedGraphEdge*>::const_iterator const_iterator;
- typedef vector<SchedGraphEdge*>:: reverse_iterator reverse_iterator;
- typedef vector<SchedGraphEdge*>::const_reverse_iterator const_reverse_iterator;
-
-public:
- //
- // Accessor methods
- //
- unsigned int getNodeId () const { return nodeId; }
- const Instruction* getInstr () const { return instr; }
- const MachineInstr* getMachineInstr () const { return minstr; }
- int getLatency () const { return latency; }
- unsigned int getNumInEdges () const { return inEdges.size(); }
- unsigned int getNumOutEdges () const { return outEdges.size(); }
- bool isDummyNode () const { return (minstr == NULL); }
-
- //
- // Iterators
- //
- iterator beginInEdges () { return inEdges.begin(); }
- iterator endInEdges () { return inEdges.end(); }
- iterator beginOutEdges () { return outEdges.begin(); }
- iterator endOutEdges () { return outEdges.end(); }
-
- const_iterator beginInEdges () const { return inEdges.begin(); }
- const_iterator endInEdges () const { return inEdges.end(); }
- const_iterator beginOutEdges () const { return outEdges.begin(); }
- const_iterator endOutEdges () const { return outEdges.end(); }
-
-public:
- //
- // Debugging support
- //
- friend ostream& operator<<(ostream& os, const SchedGraphNode& node);
-
- void dump (int indent=0) const;
-
-private:
friend class SchedGraph; // give access for ctor and dtor
friend class SchedGraphEdge; // give access for adding edges
-
- void addInEdge (SchedGraphEdge* edge);
- void addOutEdge (SchedGraphEdge* edge);
-
- void removeInEdge (const SchedGraphEdge* edge);
- void removeOutEdge (const SchedGraphEdge* edge);
-
- // disable default constructor and provide a ctor for single-block graphs
- /*ctor*/ SchedGraphNode(); // DO NOT IMPLEMENT
- /*ctor*/ SchedGraphNode (unsigned int _nodeId,
- const Instruction* _instr,
- const MachineInstr* _minstr,
- const TargetMachine& _target);
- /*dtor*/ ~SchedGraphNode ();
-};
+public:
+ // Accessor methods
+ const MachineInstr* getMachineInstr() const { return MI; }
+ const MachineOpCode getOpCode() const { return MI->getOpCode(); }
+ bool isDummyNode() const { return (MI == NULL); }
+ MachineBasicBlock &getMachineBasicBlock() const { return *MBB; }
-class SchedGraph :
- public NonCopyable,
- private hash_map<const MachineInstr*, SchedGraphNode*>
-{
-private:
- vector<const BasicBlock*> bbVec; // basic blocks included in the graph
- SchedGraphNode* graphRoot; // the root and leaf are not inserted
- SchedGraphNode* graphLeaf; // in the hash_map (see getNumNodes())
+ int getOrigIndexInBB() const { return origIndexInBB; }
+ void print(std::ostream &os) const;
+};
+
+class SchedGraph : public SchedGraphCommon {
+ MachineBasicBlock &MBB;
+ hash_map<const MachineInstr*, SchedGraphNode*> GraphMap;
public:
- typedef hash_map<const MachineInstr*, SchedGraphNode*>::iterator iterator;
+ typedef hash_map<const MachineInstr*, SchedGraphNode*>::const_iterator iterator;
typedef hash_map<const MachineInstr*, SchedGraphNode*>::const_iterator const_iterator;
-
-public:
- //
- // Accessor methods
- //
- const vector<const BasicBlock*>& getBasicBlocks() const { return bbVec; }
- const unsigned int getNumNodes() const { return size()+2; }
- SchedGraphNode* getRoot() const { return graphRoot; }
- SchedGraphNode* getLeaf() const { return graphLeaf; }
-
- SchedGraphNode* getGraphNodeForInstr(const MachineInstr* minstr) const {
- const_iterator onePair = this->find(minstr);
- return (onePair != this->end())? (*onePair).second : NULL;
+
+ MachineBasicBlock& getBasicBlock() const{return MBB;}
+ const unsigned int getNumNodes() const { return GraphMap.size()+2; }
+ SchedGraphNode* getGraphNodeForInstr(const MachineInstr* MI) const {
+ const_iterator onePair = find(MI);
+ return (onePair != end())? onePair->second : NULL;
}
- //
- // Delete nodes or edges from the graph.
- //
- void eraseNode (SchedGraphNode* node);
-
- void eraseIncomingEdges (SchedGraphNode* node,
- bool addDummyEdges = true);
-
- void eraseOutgoingEdges (SchedGraphNode* node,
- bool addDummyEdges = true);
-
- void eraseIncidentEdges (SchedGraphNode* node,
- bool addDummyEdges = true);
+ // Debugging support
+ void dump() const;
- //
+protected:
+ SchedGraph(MachineBasicBlock& mbb, const TargetMachine& TM);
+ ~SchedGraph();
+
// Unordered iterators.
// Return values is pair<const MachineIntr*,SchedGraphNode*>.
//
- iterator begin() {
- return hash_map<const MachineInstr*, SchedGraphNode*>::begin();
- }
- iterator end() {
- return hash_map<const MachineInstr*, SchedGraphNode*>::end();
- }
- const_iterator begin() const {
- return hash_map<const MachineInstr*, SchedGraphNode*>::begin();
+ hash_map<const MachineInstr*, SchedGraphNode*>::const_iterator begin() const {
+ return GraphMap.begin();
}
- const_iterator end() const {
- return hash_map<const MachineInstr*, SchedGraphNode*>::end();
+ hash_map<const MachineInstr*, SchedGraphNode*>::const_iterator end() const {
+ return GraphMap.end();
}
+
+ unsigned size() { return GraphMap.size(); }
+ iterator find(const MachineInstr *MI) const { return GraphMap.find(MI); }
- //
- // Ordered iterators.
- // Return values is pair<const MachineIntr*,SchedGraphNode*>.
- //
- // void postord_init();
- // postorder_iterator postord_begin();
- // postorder_iterator postord_end();
- // const_postorder_iterator postord_begin() const;
- // const_postorder_iterator postord_end() const;
-
- //
- // Debugging support
- //
- void dump () const;
+ SchedGraphNode *&operator[](const MachineInstr *MI) {
+ return GraphMap[MI];
+ }
private:
friend class SchedGraphSet; // give access to ctor
-
- // disable default constructor and provide a ctor for single-block graphs
- /*ctor*/ SchedGraph (); // DO NOT IMPLEMENT
- /*ctor*/ SchedGraph (const BasicBlock* bb,
- const TargetMachine& target);
- /*dtor*/ ~SchedGraph ();
-
+
inline void noteGraphNodeForInstr (const MachineInstr* minstr,
- SchedGraphNode* node)
- {
+ SchedGraphNode* node) {
assert((*this)[minstr] == NULL);
(*this)[minstr] = node;
}
//
// Graph builder
//
- void buildGraph (const TargetMachine& target);
+ void buildGraph(const TargetMachine& target);
- void buildNodesforVMInstr (const TargetMachine& target,
- const Instruction* instr);
-
- void addEdgesForInstruction (const MachineInstr& minstr,
- RegToRefVecMap& regToRefVecMap,
- const TargetMachine& target);
+ void buildNodesForBB(const TargetMachine& target,MachineBasicBlock &MBB,
+ std::vector<SchedGraphNode*>& memNV,
+ std::vector<SchedGraphNode*>& callNV,
+ RegToRefVecMap& regToRefVecMap,
+ ValueToDefVecMap& valueToDefVecMap);
+
- void addCDEdges (const TerminatorInst* term,
- const TargetMachine& target);
+ void findDefUseInfoAtInstr(const TargetMachine& target, SchedGraphNode* node,
+ std::vector<SchedGraphNode*>& memNV,
+ std::vector<SchedGraphNode*>& callNV,
+ RegToRefVecMap& regToRefVecMap,
+ ValueToDefVecMap& valueToDefVecMap);
+
+ void addEdgesForInstruction(const MachineInstr& minstr,
+ const ValueToDefVecMap& valueToDefVecMap,
+ const TargetMachine& target);
- void addMemEdges (const vector<const Instruction*>& memVec,
- const TargetMachine& target);
+ void addCDEdges(const TerminatorInst* term, const TargetMachine& target);
- void addMachineRegEdges (RegToRefVecMap& regToRefVecMap,
- const TargetMachine& target);
+ void addMemEdges(const std::vector<SchedGraphNode*>& memNod,
+ const TargetMachine& target);
- void addSSAEdge (SchedGraphNode* node,
- const Value* val,
- const TargetMachine& target);
+ void addCallCCEdges(const std::vector<SchedGraphNode*>& memNod,
+ MachineBasicBlock& bbMvec,
+ const TargetMachine& target);
+
+ void addCallDepEdges(const std::vector<SchedGraphNode*>& callNV,
+ const TargetMachine& target);
- void addNonSSAEdgesForValue (const Instruction* instr,
- const TargetMachine& target);
+ void addMachineRegEdges(RegToRefVecMap& regToRefVecMap,
+ const TargetMachine& target);
- void addDummyEdges ();
+ void addEdgesForValue(SchedGraphNode* refNode, const RefVec& defVec,
+ const Value* defValue, bool refNodeIsDef,
+ bool refNodeIsDefAndUse,
+ const TargetMachine& target);
+
+ void addDummyEdges();
+
};
-class SchedGraphSet :
- public NonCopyable,
- private hash_map<const BasicBlock*, SchedGraph*>
-{
-private:
- const Method* method;
-
-public:
- typedef hash_map<const BasicBlock*, SchedGraph*>::iterator iterator;
- typedef hash_map<const BasicBlock*, SchedGraph*>::const_iterator const_iterator;
-
+
+class SchedGraphSet {
+ const Function* function;
+ std::vector<SchedGraph*> Graphs;
+
+ // Graph builder
+ void buildGraphsForMethod(const Function *F, const TargetMachine& target);
+
+ inline void addGraph(SchedGraph* graph) {
+ assert(graph != NULL);
+ Graphs.push_back(graph);
+ }
+
public:
- /*ctor*/ SchedGraphSet (const Method* _method,
- const TargetMachine& target);
- /*dtor*/ ~SchedGraphSet ();
-
- //
- // Accessors
- //
- SchedGraph* getGraphForBasicBlock (const BasicBlock* bb) const {
- const_iterator onePair = this->find(bb);
- return (onePair != this->end())? (*onePair).second : NULL;
- }
-
- //
- // Iterators
- //
- iterator begin() {
- return hash_map<const BasicBlock*, SchedGraph*>::begin();
- }
- iterator end() {
- return hash_map<const BasicBlock*, SchedGraph*>::end();
- }
- const_iterator begin() const {
- return hash_map<const BasicBlock*, SchedGraph*>::begin();
- }
- const_iterator end() const {
- return hash_map<const BasicBlock*, SchedGraph*>::end();
- }
-
- //
- // Debugging support
- //
- void dump () const;
+ SchedGraphSet(const Function *function, const TargetMachine& target);
+ ~SchedGraphSet();
-private:
- inline void noteGraphForBlock(const BasicBlock* bb, SchedGraph* graph) {
- assert((*this)[bb] == NULL);
- (*this)[bb] = graph;
- }
+ //iterators
+ typedef std::vector<SchedGraph*>::const_iterator iterator;
+ typedef std::vector<SchedGraph*>::const_iterator const_iterator;
- //
- // Graph builder
- //
- void buildGraphsForMethod (const Method *method,
- const TargetMachine& target);
+ std::vector<SchedGraph*>::const_iterator begin() const { return Graphs.begin(); }
+ std::vector<SchedGraph*>::const_iterator end() const { return Graphs.end(); }
+
+ // Debugging support
+ void dump() const;
};
+
//********************** Sched Graph Iterators *****************************/
// Ok to make it a template because it shd get instantiated at most twice:
// for <const SchedGraphNode, SchedGraphNode::const_iterator>.
//
template <class _NodeType, class _EdgeType, class _EdgeIter>
-class PredIterator: public std::bidirectional_iterator<_NodeType, ptrdiff_t> {
+class SGPredIterator: public bidirectional_iterator<_NodeType, ptrdiff_t> {
protected:
_EdgeIter oi;
public:
- typedef PredIterator<_NodeType, _EdgeType, _EdgeIter> _Self;
+ typedef SGPredIterator<_NodeType, _EdgeType, _EdgeIter> _Self;
- inline PredIterator(_EdgeIter startEdge) : oi(startEdge) {}
+ inline SGPredIterator(_EdgeIter startEdge) : oi(startEdge) {}
inline bool operator==(const _Self& x) const { return oi == x.oi; }
inline bool operator!=(const _Self& x) const { return !operator==(x); }
// operator*() differs for pred or succ iterator
- inline _NodeType* operator*() const { return (*oi)->getSrc(); }
- inline _NodeType* operator->() const { return operator*(); }
+ inline _NodeType* operator*() const { return (_NodeType*)(*oi)->getSrc(); }
+ inline _NodeType* operator->() const { return operator*(); }
inline _EdgeType* getEdge() const { return *(oi); }
};
template <class _NodeType, class _EdgeType, class _EdgeIter>
-class SuccIterator: public std::bidirectional_iterator<_NodeType, ptrdiff_t> {
+class SGSuccIterator : public bidirectional_iterator<_NodeType, ptrdiff_t> {
protected:
_EdgeIter oi;
public:
- typedef SuccIterator<_NodeType, _EdgeType, _EdgeIter> _Self;
+ typedef SGSuccIterator<_NodeType, _EdgeType, _EdgeIter> _Self;
- inline SuccIterator(_EdgeIter startEdge) : oi(startEdge) {}
+ inline SGSuccIterator(_EdgeIter startEdge) : oi(startEdge) {}
inline bool operator==(const _Self& x) const { return oi == x.oi; }
inline bool operator!=(const _Self& x) const { return !operator==(x); }
- inline _NodeType* operator*() const { return (*oi)->getSink(); }
- inline _NodeType* operator->() const { return operator*(); }
+ inline _NodeType* operator*() const { return (_NodeType*)(*oi)->getSink(); }
+ inline _NodeType* operator->() const { return operator*(); }
inline _EdgeType* getEdge() const { return *(oi); }
// sg_pred_iterator
// sg_pred_const_iterator
//
-typedef PredIterator<SchedGraphNode, SchedGraphEdge, SchedGraphNode::iterator>
+typedef SGPredIterator<SchedGraphNode, SchedGraphEdge, SchedGraphNode::iterator>
sg_pred_iterator;
-typedef PredIterator<const SchedGraphNode, const SchedGraphEdge,SchedGraphNode::const_iterator>
+typedef SGPredIterator<const SchedGraphNode, const SchedGraphEdge,SchedGraphNode::const_iterator>
sg_pred_const_iterator;
-inline sg_pred_iterator pred_begin( SchedGraphNode *N) {
+inline sg_pred_iterator pred_begin(SchedGraphNode *N) {
return sg_pred_iterator(N->beginInEdges());
}
-inline sg_pred_iterator pred_end( SchedGraphNode *N) {
+inline sg_pred_iterator pred_end(SchedGraphNode *N) {
return sg_pred_iterator(N->endInEdges());
}
inline sg_pred_const_iterator pred_begin(const SchedGraphNode *N) {
return sg_pred_const_iterator(N->beginInEdges());
}
-inline sg_pred_const_iterator pred_end( const SchedGraphNode *N) {
+inline sg_pred_const_iterator pred_end(const SchedGraphNode *N) {
return sg_pred_const_iterator(N->endInEdges());
}
// sg_succ_iterator
// sg_succ_const_iterator
//
-typedef SuccIterator<SchedGraphNode, SchedGraphEdge, SchedGraphNode::iterator>
+typedef SGSuccIterator<SchedGraphNode, SchedGraphEdge, SchedGraphNode::iterator>
sg_succ_iterator;
-typedef SuccIterator<const SchedGraphNode, const SchedGraphEdge,SchedGraphNode::const_iterator>
+typedef SGSuccIterator<const SchedGraphNode, const SchedGraphEdge,SchedGraphNode::const_iterator>
sg_succ_const_iterator;
-inline sg_succ_iterator succ_begin( SchedGraphNode *N) {
+inline sg_succ_iterator succ_begin(SchedGraphNode *N) {
return sg_succ_iterator(N->beginOutEdges());
}
-inline sg_succ_iterator succ_end( SchedGraphNode *N) {
+inline sg_succ_iterator succ_end(SchedGraphNode *N) {
return sg_succ_iterator(N->endOutEdges());
}
inline sg_succ_const_iterator succ_begin(const SchedGraphNode *N) {
return sg_succ_const_iterator(N->beginOutEdges());
}
-inline sg_succ_const_iterator succ_end( const SchedGraphNode *N) {
+inline sg_succ_const_iterator succ_end(const SchedGraphNode *N) {
return sg_succ_const_iterator(N->endOutEdges());
}
typedef SchedGraphNode NodeType;
typedef sg_succ_iterator ChildIteratorType;
- static inline NodeType *getEntryNode(SchedGraph *SG) { return SG->getRoot(); }
+ static inline NodeType *getEntryNode(SchedGraph *SG) { return (NodeType*)SG->getRoot(); }
static inline ChildIteratorType child_begin(NodeType *N) {
return succ_begin(N);
}
typedef sg_succ_const_iterator ChildIteratorType;
static inline NodeType *getEntryNode(const SchedGraph *SG) {
- return SG->getRoot();
+ return (NodeType*)SG->getRoot();
}
static inline ChildIteratorType child_begin(NodeType *N) {
return succ_begin(N);
}
};
-
-//************************ External Functions *****************************/
-
-
-ostream& operator<<(ostream& os, const SchedGraphEdge& edge);
-
-ostream& operator<<(ostream& os, const SchedGraphNode& node);
-
-
-/***************************************************************************/
-
#endif
projects / oota-llvm.git / blobdiff