RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 11:42:57 +01:00
Code Issues Projects Releases Wiki Activity

Remove uses of the NonCopyable class, to make the doxygen output look better

Browse Source 
llvm-svn: 7880
This commit is contained in:
Chris Lattner 2003-08-15 05:20:06 +00:00
parent 899f2381f1
commit b2ff3ba7df
1 changed files with 17 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
lib/CodeGen/InstrSched/InstrScheduling.cpp
View File

@ -41,7 +41,10 @@ class SchedulingManager;
// in a single cycle. // in a single cycle.
//---------------------------------------------------------------------- //----------------------------------------------------------------------
class InstrGroup: public NonCopyable { class InstrGroup {
InstrGroup(const InstrGroup&); // DO NOT IMPLEMENT
void operator=(const InstrGroup&); // DO NOT IMPLEMENT
public: public:
inline const SchedGraphNode* operator[](unsigned int slotNum) const { inline const SchedGraphNode* operator[](unsigned int slotNum) const {
assert(slotNum < group.size()); assert(slotNum < group.size());
@ -124,12 +127,14 @@ private:
// Represents the schedule of machine instructions for a single basic block. // Represents the schedule of machine instructions for a single basic block.
//---------------------------------------------------------------------- //----------------------------------------------------------------------
class InstrSchedule: public NonCopyable { class InstrSchedule {
private:
const unsigned int nslots; const unsigned int nslots;
unsigned int numInstr; unsigned int numInstr;
std::vector<InstrGroup*> groups; // indexed by cycle number std::vector<InstrGroup*> groups; // indexed by cycle number
std::vector<cycles_t> startTime; // indexed by node id std::vector<cycles_t> startTime; // indexed by node id
InstrSchedule(InstrSchedule&); // DO NOT IMPLEMENT
void operator=(InstrSchedule&); // DO NOT IMPLEMENT
public: // iterators public: // iterators
typedef ScheduleIterator<SchedGraphNode> iterator; typedef ScheduleIterator<SchedGraphNode> iterator;
@ -292,14 +297,15 @@ InstrSchedule::end() const
// Delay slots are simply indexed by slot number 1 ... numDelaySlots // Delay slots are simply indexed by slot number 1 ... numDelaySlots
//---------------------------------------------------------------------- //----------------------------------------------------------------------
class DelaySlotInfo: public NonCopyable { class DelaySlotInfo {
private:
const SchedGraphNode* brNode; const SchedGraphNode* brNode;
unsigned int ndelays; unsigned ndelays;
std::vector<const SchedGraphNode*> delayNodeVec; std::vector<const SchedGraphNode*> delayNodeVec;
cycles_t delayedNodeCycle; cycles_t delayedNodeCycle;
unsigned int delayedNodeSlotNum; unsigned delayedNodeSlotNum;
DelaySlotInfo(const DelaySlotInfo &); // DO NOT IMPLEMENT
void operator=(const DelaySlotInfo&); // DO NOT IMPLEMENT
public: public:
/*ctor*/ DelaySlotInfo (const SchedGraphNode* _brNode, /*ctor*/ DelaySlotInfo (const SchedGraphNode* _brNode,
unsigned _ndelays) unsigned _ndelays)
@ -334,7 +340,9 @@ public:
// Represents the schedule of machine instructions for a single basic block. // Represents the schedule of machine instructions for a single basic block.
//---------------------------------------------------------------------- //----------------------------------------------------------------------
class SchedulingManager: public NonCopyable { class SchedulingManager {
SchedulingManager(SchedulingManager &); // DO NOT IMPLEMENT
void operator=(const SchedulingManager &); // DO NOT IMPLEMENT
public: // publicly accessible data members public: // publicly accessible data members
const unsigned nslots; const unsigned nslots;
const TargetSchedInfo& schedInfo; const TargetSchedInfo& schedInfo;
@ -342,7 +350,7 @@ public: // publicly accessible data members
InstrSchedule isched; InstrSchedule isched;
private: private:
unsigned int totalInstrCount; unsigned totalInstrCount;
cycles_t curTime; cycles_t curTime;
cycles_t nextEarliestIssueTime; // next cycle we can issue cycles_t nextEarliestIssueTime; // next cycle we can issue
// indexed by slot# // indexed by slot#