maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Use deterministic iterator for SchedGraphs. This is actually not 

useful right now when we only do local scheduling.

llvm-svn: 1975
This commit is contained in:
Vikram S. Adve 2002-03-24 03:53:03 +00:00
parent 9db158f568
commit 479126b3d3
1 changed files with 10 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
llvm/lib/CodeGen/InstrSched/SchedGraph.h
View File

@ -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);
};