6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-04-06 09:44:39 +00:00
Code Issues Projects Releases Wiki Activity

Moved erase-edge functions from SchedGraphNode to SchedGraph.

Browse Source 
Renamed some header files.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@607 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Vikram S. Adve 2001-09-18 12:49:26 +00:00
parent 5efa3ccbd1
commit f0b6d7960c
2 changed files with 32 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
lib/CodeGen/InstrSched/SchedGraph.h
View File

@ -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.

26
lib/Target/SparcV9/InstrSched/SchedGraph.h
View File

@ -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.