RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-21 03:53:04 +02:00
Code Issues Projects Releases Wiki Activity

*** empty log message ***

Browse Source 
llvm-svn: 3058
This commit is contained in:
Chris Lattner 2002-07-24 21:21:33 +00:00
parent ad8fc4ba3e
commit 5d262d3846
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
include/llvm/Target/TargetSchedInfo.h
View File

@ -245,14 +245,14 @@ public:
inline int getMinIssueGap (MachineOpCode fromOp,
MachineOpCode toOp) const {
std::hash_map<OpCodePair,int>::const_iterator
hash_map<OpCodePair,int>::const_iterator
I = issueGaps.find(OpCodePair(fromOp, toOp));
return (I == issueGaps.end())? 0 : (*I).second;
}
inline const std::vector<MachineOpCode>*
getConflictList(MachineOpCode opCode) const {
std::hash_map<MachineOpCode, std::vector<MachineOpCode> >::const_iterator
hash_map<MachineOpCode, std::vector<MachineOpCode> >::const_iterator
I = conflictLists.find(opCode);
return (I == conflictLists.end())? NULL : & (*I).second;
}
@ -286,8 +286,8 @@ protected:
unsigned numIssueDeltas;
std::vector<InstrRUsage> instrRUsages; // indexed by opcode
std::hash_map<OpCodePair,int> issueGaps; // indexed by opcode pair
std::hash_map<MachineOpCode, std::vector<MachineOpCode> >
hash_map<OpCodePair,int> issueGaps; // indexed by opcode pair
hash_map<MachineOpCode, std::vector<MachineOpCode> >
conflictLists; // indexed by opcode
};

4
lib/CodeGen/InstrSched/SchedPriorities.h
View File

@ -157,13 +157,13 @@ private:
cycles_t curTime;
const SchedGraph* graph;
FunctionLiveVarInfo &methodLiveVarInfo;
std::hash_map<const MachineInstr*, bool> lastUseMap;
hash_map<const MachineInstr*, bool> lastUseMap;
std::vector<cycles_t> nodeDelayVec;
std::vector<cycles_t> nodeEarliestUseVec;
std::vector<cycles_t> earliestReadyTimeForNode;
cycles_t earliestReadyTime;
NodeHeap candsAsHeap; // candidate nodes, ready to go
std::hash_set<const SchedGraphNode*> candsAsSet;//same entries as candsAsHeap,
hash_set<const SchedGraphNode*> candsAsSet; //same entries as candsAsHeap,
// but as set for fast lookup
std::vector<candIndex> mcands; // holds pointers into cands
candIndex nextToTry; // next cand after the last