diff options
| author | Vikram S. Adve <vadve@cs.uiuc.edu> | 2001-09-18 12:49:26 +0000 |
|---|---|---|
| committer | Vikram S. Adve <vadve@cs.uiuc.edu> | 2001-09-18 12:49:26 +0000 |
| commit | fa64a35a015f475ed747b84090cc18720e38fa74 (patch) | |
| tree | db3cc90bc862bdb6495b3a2c485266fd71fdb4e4 /llvm/lib/CodeGen | |
| parent | 13ba19a1a83f683a83167222bed2452d71853210 (diff) | |
| download | bcm5719-llvm-fa64a35a015f475ed747b84090cc18720e38fa74.tar.gz bcm5719-llvm-fa64a35a015f475ed747b84090cc18720e38fa74.zip | |
Moved erase-edge functions from SchedGraphNode to SchedGraph.
Renamed some header files.
llvm-svn: 607
Diffstat (limited to 'llvm/lib/CodeGen')
| -rw-r--r-- | llvm/lib/CodeGen/InstrSched/SchedGraph.h | 26 |
1 files changed, 16 insertions, 10 deletions
diff --git a/llvm/lib/CodeGen/InstrSched/SchedGraph.h b/llvm/lib/CodeGen/InstrSched/SchedGraph.h index 35cdfd2513b..5c4a6007904 100644 --- a/llvm/lib/CodeGen/InstrSched/SchedGraph.h +++ b/llvm/lib/CodeGen/InstrSched/SchedGraph.h @@ -97,7 +97,7 @@ public: ResourceId _resourceId, int _minDelay = -1); - /*dtor*/ ~SchedGraphEdge() {} + /*dtor*/ ~SchedGraphEdge(); SchedGraphNode* getSrc () const { return src; } SchedGraphNode* getSink () const { return sink; } @@ -139,8 +139,10 @@ private: int latency; public: - typedef vector<SchedGraphEdge*>::iterator iterator; - typedef vector<SchedGraphEdge*>::const_iterator const_iterator; + 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: // @@ -167,11 +169,6 @@ public: const_iterator beginOutEdges () const { return outEdges.begin(); } const_iterator endOutEdges () const { return outEdges.end(); } - // - // Limited modifier methods - // - void eraseAllEdges (); - public: // // Debugging support @@ -229,9 +226,18 @@ public: } // - // Delete a node from the graph. + // Delete nodes or edges from the graph. // - void eraseNode(SchedGraphNode* node); + 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); // // Unordered iterators. |
