diff options
| author | Tanya Lattner <tonic@nondot.org> | 2004-05-26 06:27:18 +0000 |
|---|---|---|
| committer | Tanya Lattner <tonic@nondot.org> | 2004-05-26 06:27:18 +0000 |
| commit | a066df6bd75e021fb72dbf6ec873c8a0667e165f (patch) | |
| tree | e13269b6a49e4403772ddc10edfe8fd4939c8452 /llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.h | |
| parent | 230deea60f0ce172dda03d7803a6d3bd851cdba9 (diff) | |
| download | bcm5719-llvm-a066df6bd75e021fb72dbf6ec873c8a0667e165f.tar.gz bcm5719-llvm-a066df6bd75e021fb72dbf6ec873c8a0667e165f.zip | |
Updating my cvs versions. THis is still in progress and much will be changed.
llvm-svn: 13782
Diffstat (limited to 'llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.h')
| -rw-r--r-- | llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.h | 10 |
1 files changed, 6 insertions, 4 deletions
diff --git a/llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.h b/llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.h index 9680fc09944..0dcbb496f19 100644 --- a/llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.h +++ b/llvm/lib/CodeGen/ModuloScheduling/MSchedGraph.h @@ -58,13 +58,14 @@ namespace llvm { const MachineInstr* Inst; //Machine Instruction MSchedGraph* Parent; //Graph this node belongs to unsigned latency; //Latency of Instruction - + bool isBranchInstr; //Is this node the branch instr or not + std::vector<MSchedGraphNode*> Predecessors; //Predecessor Nodes std::vector<MSchedGraphEdge> Successors; public: MSchedGraphNode(const MachineInstr *inst, MSchedGraph *graph, - unsigned late=0); + unsigned late=0, bool isBranch=false); //Iterators typedef std::vector<MSchedGraphNode*>::iterator pred_iterator; @@ -85,6 +86,7 @@ namespace llvm { MSchedGraphNode> succ_iterator; succ_iterator succ_begin(); succ_iterator succ_end(); + void addOutEdge(MSchedGraphNode *destination, @@ -103,7 +105,7 @@ namespace llvm { bool isSuccessor(MSchedGraphNode *); bool isPredecessor(MSchedGraphNode *); - + bool isBranch() { return isBranchInstr; } //Debug support void print(std::ostream &os) const; @@ -200,7 +202,7 @@ namespace llvm { iterator begin() { return GraphMap.begin(); } reverse_iterator rbegin() { return GraphMap.rbegin(); } reverse_iterator rend() { return GraphMap.rend(); } - + const TargetMachine* getTarget() { return &Target; } }; |

