mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-02-08 21:32:39 +00:00
Use deterministic iterator for SchedGraphs. This is actually not
useful right now when we only do local scheduling. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@1975 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
1392d6903c
commit
97fb99bc54
@ -336,49 +336,35 @@ private:
|
||||
|
||||
class SchedGraphSet :
|
||||
public NonCopyable,
|
||||
private std::hash_map<const BasicBlock*, SchedGraph*>
|
||||
private std::vector<SchedGraph*>
|
||||
{
|
||||
private:
|
||||
const Function* method;
|
||||
|
||||
public:
|
||||
typedef std::hash_map<const BasicBlock*, SchedGraph*> map_base;
|
||||
using map_base::iterator;
|
||||
using map_base::const_iterator;
|
||||
typedef std::vector<SchedGraph*> baseVector;
|
||||
using baseVector::iterator;
|
||||
using baseVector::const_iterator;
|
||||
|
||||
public:
|
||||
/*ctor*/ SchedGraphSet (const Function * function,
|
||||
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
|
||||
//
|
||||
using map_base::begin;
|
||||
using map_base::end;
|
||||
using baseVector::begin;
|
||||
using baseVector::end;
|
||||
|
||||
//
|
||||
// Debugging support
|
||||
//
|
||||
void dump () const;
|
||||
|
||||
private:
|
||||
inline void noteGraphForBlock(const BasicBlock* bb, SchedGraph* graph) {
|
||||
assert((*this)[bb] == NULL);
|
||||
(*this)[bb] = graph;
|
||||
inline void addGraph(SchedGraph* graph) {
|
||||
assert(graph != NULL);
|
||||
this->push_back(graph);
|
||||
}
|
||||
|
||||
//
|
||||
|
||||
// Graph builder
|
||||
//
|
||||
void buildGraphsForMethod (const Function *F,
|
||||
const TargetMachine& target);
|
||||
};
|
||||
|
@ -336,49 +336,35 @@ private:
|
||||
|
||||
class SchedGraphSet :
|
||||
public NonCopyable,
|
||||
private std::hash_map<const BasicBlock*, SchedGraph*>
|
||||
private std::vector<SchedGraph*>
|
||||
{
|
||||
private:
|
||||
const Function* method;
|
||||
|
||||
public:
|
||||
typedef std::hash_map<const BasicBlock*, SchedGraph*> map_base;
|
||||
using map_base::iterator;
|
||||
using map_base::const_iterator;
|
||||
typedef std::vector<SchedGraph*> baseVector;
|
||||
using baseVector::iterator;
|
||||
using baseVector::const_iterator;
|
||||
|
||||
public:
|
||||
/*ctor*/ SchedGraphSet (const Function * function,
|
||||
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
|
||||
//
|
||||
using map_base::begin;
|
||||
using map_base::end;
|
||||
using baseVector::begin;
|
||||
using baseVector::end;
|
||||
|
||||
//
|
||||
// Debugging support
|
||||
//
|
||||
void dump () const;
|
||||
|
||||
private:
|
||||
inline void noteGraphForBlock(const BasicBlock* bb, SchedGraph* graph) {
|
||||
assert((*this)[bb] == NULL);
|
||||
(*this)[bb] = graph;
|
||||
inline void addGraph(SchedGraph* graph) {
|
||||
assert(graph != NULL);
|
||||
this->push_back(graph);
|
||||
}
|
||||
|
||||
//
|
||||
|
||||
// Graph builder
|
||||
//
|
||||
void buildGraphsForMethod (const Function *F,
|
||||
const TargetMachine& target);
|
||||
};
|
||||
|
Loading…
x
Reference in New Issue
Block a user