diff options
Diffstat (limited to 'lib/CodeGen')
-rw-r--r-- | lib/CodeGen/InstrSched/InstrScheduling.cpp | 10 | ||||
-rw-r--r-- | lib/CodeGen/InstrSched/SchedGraph.cpp | 1 | ||||
-rw-r--r-- | lib/CodeGen/InstrSched/SchedGraph.h | 4 | ||||
-rw-r--r-- | lib/CodeGen/InstrSched/SchedPriorities.cpp | 2 | ||||
-rw-r--r-- | lib/CodeGen/InstrSched/SchedPriorities.h | 2 | ||||
-rw-r--r-- | lib/CodeGen/MachineFunction.cpp | 2 |
6 files changed, 10 insertions, 11 deletions
diff --git a/lib/CodeGen/InstrSched/InstrScheduling.cpp b/lib/CodeGen/InstrSched/InstrScheduling.cpp index 1d4c18058f..2271c780a3 100644 --- a/lib/CodeGen/InstrSched/InstrScheduling.cpp +++ b/lib/CodeGen/InstrSched/InstrScheduling.cpp @@ -352,18 +352,18 @@ private: unsigned int totalInstrCount; cycles_t curTime; cycles_t nextEarliestIssueTime; // next cycle we can issue - vector<std::hash_set<const SchedGraphNode*> > choicesForSlot; // indexed by slot# + vector<hash_set<const SchedGraphNode*> > choicesForSlot; // indexed by slot# vector<const SchedGraphNode*> choiceVec; // indexed by node ptr vector<int> numInClass; // indexed by sched class vector<cycles_t> nextEarliestStartTime; // indexed by opCode - std::hash_map<const SchedGraphNode*, DelaySlotInfo*> delaySlotInfoForBranches; + hash_map<const SchedGraphNode*, DelaySlotInfo*> delaySlotInfoForBranches; // indexed by branch node ptr public: SchedulingManager(const TargetMachine& _target, const SchedGraph* graph, SchedPriorities& schedPrio); ~SchedulingManager() { - for (std::hash_map<const SchedGraphNode*, + for (hash_map<const SchedGraphNode*, DelaySlotInfo*>::iterator I = delaySlotInfoForBranches.begin(), E = delaySlotInfoForBranches.end(); I != E; ++I) delete I->second; @@ -422,7 +422,7 @@ public: return choiceVec[i]; } - inline std::hash_set<const SchedGraphNode*>& getChoicesForSlot(unsigned slotNum) { + inline hash_set<const SchedGraphNode*>& getChoicesForSlot(unsigned slotNum) { assert(slotNum < nslots); return choicesForSlot[slotNum]; } @@ -497,7 +497,7 @@ public: inline DelaySlotInfo* getDelaySlotInfoForInstr(const SchedGraphNode* bn, bool createIfMissing=false) { - std::hash_map<const SchedGraphNode*, DelaySlotInfo*>::const_iterator + hash_map<const SchedGraphNode*, DelaySlotInfo*>::const_iterator I = delaySlotInfoForBranches.find(bn); if (I != delaySlotInfoForBranches.end()) return I->second; diff --git a/lib/CodeGen/InstrSched/SchedGraph.cpp b/lib/CodeGen/InstrSched/SchedGraph.cpp index 96962ced14..8a9c8e573b 100644 --- a/lib/CodeGen/InstrSched/SchedGraph.cpp +++ b/lib/CodeGen/InstrSched/SchedGraph.cpp @@ -27,7 +27,6 @@ using std::vector; using std::pair; -using std::hash_map; using std::cerr; //*********************** Internal Data Structures *************************/ diff --git a/lib/CodeGen/InstrSched/SchedGraph.h b/lib/CodeGen/InstrSched/SchedGraph.h index aa258813c3..7db22d6734 100644 --- a/lib/CodeGen/InstrSched/SchedGraph.h +++ b/lib/CodeGen/InstrSched/SchedGraph.h @@ -211,14 +211,14 @@ private: class SchedGraph : public NonCopyable, - private std::hash_map<const MachineInstr*, SchedGraphNode*> + private hash_map<const MachineInstr*, SchedGraphNode*> { private: std::vector<const BasicBlock*> bbVec; // basic blocks included in the graph SchedGraphNode* graphRoot; // the root and leaf are not inserted SchedGraphNode* graphLeaf; // in the hash_map (see getNumNodes()) - typedef std::hash_map<const MachineInstr*, SchedGraphNode*> map_base; + typedef hash_map<const MachineInstr*, SchedGraphNode*> map_base; public: using map_base::iterator; using map_base::const_iterator; diff --git a/lib/CodeGen/InstrSched/SchedPriorities.cpp b/lib/CodeGen/InstrSched/SchedPriorities.cpp index 8a1c9a5348..6277576c23 100644 --- a/lib/CodeGen/InstrSched/SchedPriorities.cpp +++ b/lib/CodeGen/InstrSched/SchedPriorities.cpp @@ -270,7 +270,7 @@ SchedPriorities::instructionHasLastUse(FunctionLiveVarInfo &LVI, const SchedGraphNode* graphNode) { const MachineInstr *MI = graphNode->getMachineInstr(); - std::hash_map<const MachineInstr*, bool>::const_iterator + hash_map<const MachineInstr*, bool>::const_iterator ui = lastUseMap.find(MI); if (ui != lastUseMap.end()) return ui->second; diff --git a/lib/CodeGen/InstrSched/SchedPriorities.h b/lib/CodeGen/InstrSched/SchedPriorities.h index f5c29b27e3..b01c1a43d6 100644 --- a/lib/CodeGen/InstrSched/SchedPriorities.h +++ b/lib/CodeGen/InstrSched/SchedPriorities.h @@ -25,7 +25,7 @@ #include "llvm/CodeGen/InstrScheduling.h" #include "llvm/Target/MachineSchedInfo.h" #include <list> -#include <ext/hash_set> +#include <Support/hash_set> #include <iostream> class Function; class MachineInstr; diff --git a/lib/CodeGen/MachineFunction.cpp b/lib/CodeGen/MachineFunction.cpp index a435be646b..ce39b45f12 100644 --- a/lib/CodeGen/MachineFunction.cpp +++ b/lib/CodeGen/MachineFunction.cpp @@ -266,7 +266,7 @@ MachineCodeForMethod::popAllTempValues(const TargetMachine& target) int MachineCodeForMethod::getOffset(const Value* val) const { - std::hash_map<const Value*, int>::const_iterator pair = offsets.find(val); + hash_map<const Value*, int>::const_iterator pair = offsets.find(val); return (pair == offsets.end())? INVALID_FRAME_OFFSET : pair->second; } |