2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are
|
|
|
|
* met: redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer;
|
|
|
|
* redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution;
|
|
|
|
* neither the name of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
2009-07-07 00:49:47 +02:00
|
|
|
* System.hh
|
2009-05-11 19:38:43 +02:00
|
|
|
*
|
|
|
|
* Description: Contains all of the various parts of the system we are
|
|
|
|
* simulating. Performs allocation, deallocation, and setup of all
|
|
|
|
* the major components of the system
|
|
|
|
*
|
|
|
|
* $Id$
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef SYSTEM_H
|
|
|
|
#define SYSTEM_H
|
|
|
|
|
2009-07-07 00:49:47 +02:00
|
|
|
#include "mem/ruby/system/RubyPort.hh"
|
2009-05-11 19:38:45 +02:00
|
|
|
#include "mem/ruby/common/Global.hh"
|
|
|
|
#include "mem/gems_common/Vector.hh"
|
2009-07-07 00:49:47 +02:00
|
|
|
#include "mem/ruby/eventqueue/RubyEventQueue.hh"
|
|
|
|
#include <map>
|
2010-01-30 05:29:17 +01:00
|
|
|
#include "sim/sim_object.hh"
|
|
|
|
#include "params/RubySystem.hh"
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
class Profiler;
|
|
|
|
class Network;
|
|
|
|
class CacheRecorder;
|
|
|
|
class Tracer;
|
|
|
|
class Sequencer;
|
2009-07-07 00:49:47 +02:00
|
|
|
class DMASequencer;
|
|
|
|
class MemoryVector;
|
|
|
|
class AbstractController;
|
|
|
|
class MessageBuffer;
|
|
|
|
class CacheMemory;
|
|
|
|
class DirectoryMemory;
|
|
|
|
class Topology;
|
|
|
|
class MemoryControl;
|
|
|
|
|
2009-07-19 01:20:03 +02:00
|
|
|
/*
|
|
|
|
* This defines the number of longs (32-bits on 32 bit machines,
|
|
|
|
* 64-bit on 64-bit AMD machines) to use to hold the set...
|
|
|
|
* the default is 4, allowing 128 or 256 different members
|
|
|
|
* of the set.
|
|
|
|
*
|
|
|
|
* This should never need to be changed for correctness reasons,
|
|
|
|
* though increasing it will increase performance for larger
|
|
|
|
* set sizes at the cost of a (much) larger memory footprint
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
const int NUMBER_WORDS_PER_SET = 4;
|
|
|
|
|
|
|
|
|
2009-07-07 00:49:47 +02:00
|
|
|
struct RubyObjConf {
|
|
|
|
string type;
|
|
|
|
string name;
|
|
|
|
vector<string> argv;
|
|
|
|
RubyObjConf(string _type, string _name, vector<string> _argv)
|
|
|
|
: type(_type), name(_name), argv(_argv)
|
|
|
|
{}
|
|
|
|
};
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-01-30 05:29:17 +01:00
|
|
|
class RubySystem : public SimObject {
|
2009-05-11 19:38:43 +02:00
|
|
|
public:
|
2010-01-30 05:29:17 +01:00
|
|
|
typedef RubySystemParams Params;
|
|
|
|
RubySystem(const Params *p);
|
2009-05-11 19:38:43 +02:00
|
|
|
// Destructor
|
2009-05-11 19:38:44 +02:00
|
|
|
~RubySystem();
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2009-07-07 00:49:47 +02:00
|
|
|
// config accessors
|
|
|
|
static int getRandomSeed() { return m_random_seed; }
|
|
|
|
static int getRandomization() { return m_randomization; }
|
|
|
|
static int getBlockSizeBytes() { return m_block_size_bytes; }
|
|
|
|
static int getBlockSizeBits() { return m_block_size_bits; }
|
|
|
|
static uint64 getMemorySizeBytes() { return m_memory_size_bytes; }
|
|
|
|
static int getMemorySizeBits() { return m_memory_size_bits; }
|
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
// Public Methods
|
2009-07-07 00:49:47 +02:00
|
|
|
static RubyPort* getPortOnly(const string & name) {
|
|
|
|
assert(m_ports.count(name) == 1); return m_ports[name]; }
|
|
|
|
static RubyPort* getPort(const string & name, void (*hit_callback)(int64_t)) {
|
2009-08-04 19:52:52 +02:00
|
|
|
if (m_ports.count(name) != 1){
|
|
|
|
cerr << "Port " << name << " has " << m_ports.count(name) << " instances" << endl;
|
|
|
|
}
|
2009-11-18 22:55:58 +01:00
|
|
|
assert(m_ports.count(name) == 1);
|
|
|
|
m_ports[name]->registerHitCallback(hit_callback);
|
|
|
|
return m_ports[name];
|
|
|
|
}
|
2009-07-07 00:49:47 +02:00
|
|
|
static Network* getNetwork() { assert(m_network_ptr != NULL); return m_network_ptr; }
|
|
|
|
static Topology* getTopology(const string & name) { assert(m_topologies.count(name) == 1); return m_topologies[name]; }
|
|
|
|
static CacheMemory* getCache(const string & name) { assert(m_caches.count(name) == 1); return m_caches[name]; }
|
|
|
|
static DirectoryMemory* getDirectory(const string & name) { assert(m_directories.count(name) == 1); return m_directories[name]; }
|
|
|
|
static MemoryControl* getMemoryControl(const string & name) { assert(m_memorycontrols.count(name) == 1); return m_memorycontrols[name]; }
|
|
|
|
static Sequencer* getSequencer(const string & name) { assert(m_sequencers.count(name) == 1); return m_sequencers[name]; }
|
|
|
|
static DMASequencer* getDMASequencer(const string & name) { assert(m_dma_sequencers.count(name) == 1); return m_dma_sequencers[name]; }
|
|
|
|
static AbstractController* getController(const string & name) { assert(m_controllers.count(name) == 1); return m_controllers[name]; }
|
|
|
|
|
|
|
|
static RubyEventQueue* getEventQueue() { return g_eventQueue_ptr; }
|
|
|
|
|
|
|
|
static int getNumberOfDirectories() { return m_directories.size(); }
|
|
|
|
static int getNumberOfSequencers() { return m_sequencers.size(); }
|
|
|
|
|
|
|
|
Profiler* getProfiler() {assert(m_profiler_ptr != NULL); return m_profiler_ptr; }
|
2009-07-13 19:50:10 +02:00
|
|
|
static Tracer* getTracer() { assert(m_tracer_ptr != NULL); return m_tracer_ptr; }
|
2009-07-07 00:49:47 +02:00
|
|
|
static MemoryVector* getMemoryVector() { assert(m_mem_vec_ptr != NULL); return m_mem_vec_ptr;}
|
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
void recordCacheContents(CacheRecorder& tr) const;
|
2009-07-07 00:49:47 +02:00
|
|
|
static void printConfig(ostream& out);
|
|
|
|
static void printStats(ostream& out);
|
2009-05-11 19:38:43 +02:00
|
|
|
void clearStats() const;
|
|
|
|
|
2009-07-07 00:49:47 +02:00
|
|
|
uint64 getInstructionCount(int thread) { return 1; }
|
|
|
|
static uint64 getCycleCount(int thread) { return g_eventQueue_ptr->getTime(); }
|
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
void print(ostream& out) const;
|
2009-07-07 00:49:47 +02:00
|
|
|
/*
|
2009-05-11 19:38:43 +02:00
|
|
|
#ifdef CHECK_COHERENCE
|
|
|
|
void checkGlobalCoherenceInvariant(const Address& addr);
|
|
|
|
#endif
|
2009-07-07 00:49:47 +02:00
|
|
|
*/
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
private:
|
2009-07-07 00:49:47 +02:00
|
|
|
// Constructors
|
|
|
|
RubySystem(const vector <RubyObjConf> & cfg_file);
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
// Private copy constructor and assignment operator
|
2009-05-11 19:38:44 +02:00
|
|
|
RubySystem(const RubySystem& obj);
|
|
|
|
RubySystem& operator=(const RubySystem& obj);
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-01-30 05:29:17 +01:00
|
|
|
void init();
|
2009-07-07 00:49:47 +02:00
|
|
|
|
|
|
|
static void printSystemConfig(ostream& out);
|
|
|
|
|
|
|
|
private:
|
|
|
|
// configuration parameters
|
|
|
|
static int m_random_seed;
|
|
|
|
static bool m_randomization;
|
2010-01-30 05:29:19 +01:00
|
|
|
static Tick m_clock;
|
2009-07-07 00:49:47 +02:00
|
|
|
static int m_block_size_bytes;
|
|
|
|
static int m_block_size_bits;
|
|
|
|
static uint64 m_memory_size_bytes;
|
|
|
|
static int m_memory_size_bits;
|
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
// Data Members (m_ prefix)
|
2009-07-07 00:49:47 +02:00
|
|
|
static Network* m_network_ptr;
|
|
|
|
static map< string, Topology* > m_topologies;
|
|
|
|
static map< string, RubyPort* > m_ports;
|
|
|
|
static map< string, CacheMemory* > m_caches;
|
|
|
|
static map< string, DirectoryMemory* > m_directories;
|
|
|
|
static map< string, Sequencer* > m_sequencers;
|
|
|
|
static map< string, DMASequencer* > m_dma_sequencers;
|
|
|
|
static map< string, AbstractController* > m_controllers;
|
|
|
|
static map< string, MemoryControl* > m_memorycontrols;
|
|
|
|
|
|
|
|
//added by SS
|
|
|
|
//static map< string, Tracer* > m_tracers;
|
|
|
|
|
2010-01-30 05:29:17 +01:00
|
|
|
public:
|
2009-07-07 00:49:47 +02:00
|
|
|
static Profiler* m_profiler_ptr;
|
|
|
|
static Tracer* m_tracer_ptr;
|
|
|
|
static MemoryVector* m_mem_vec_ptr;
|
2009-05-11 19:38:43 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
// Output operator declaration
|
2009-05-11 19:38:44 +02:00
|
|
|
ostream& operator<<(ostream& out, const RubySystem& obj);
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
// ******************* Definitions *******************
|
|
|
|
|
|
|
|
// Output operator definition
|
|
|
|
inline
|
2009-05-11 19:38:44 +02:00
|
|
|
ostream& operator<<(ostream& out, const RubySystem& obj)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
|
|
|
// obj.print(out);
|
|
|
|
out << flush;
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif //SYSTEM_H
|
|
|
|
|
|
|
|
|
|
|
|
|