1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
|
/*
* 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.
*/
/*
* RubySystem.cc
*
* Description: See System.hh
*
* $Id$
*
*/
#include "mem/ruby/system/System.hh"
#include "mem/ruby/profiler/Profiler.hh"
#include "mem/ruby/network/Network.hh"
#include "mem/ruby/tester/Tester.hh"
#include "mem/ruby/tester/SyntheticDriver.hh"
#include "mem/ruby/tester/DeterministicDriver.hh"
#include "mem/protocol/Chip.hh"
//#include "mem/ruby/recorder/Tracer.hh"
#include "mem/protocol/Protocol.hh"
RubySystem::RubySystem()
{
init();
m_preinitialized_driver = false;
createDriver();
/* gem5:Binkert for decomissiong of tracer
m_tracer_ptr = new Tracer;
*/
/* gem5:Arka for decomissiong of log_tm
if (XACT_MEMORY) {
m_xact_isolation_checker = new XactIsolationChecker;
m_xact_commit_arbiter = new XactCommitArbiter;
m_xact_visualizer = new XactVisualizer;
}
*/
}
RubySystem::RubySystem(Driver* _driver)
{
init();
m_preinitialized_driver = true;
m_driver_ptr = _driver;
}
RubySystem::~RubySystem()
{
for (int i = 0; i < m_chip_vector.size(); i++) {
delete m_chip_vector[i];
}
if (!m_preinitialized_driver)
delete m_driver_ptr;
delete m_network_ptr;
delete m_profiler_ptr;
/* gem5:Binkert for decomissiong of tracer
delete m_tracer_ptr;
*/
}
void RubySystem::init()
{
DEBUG_MSG(SYSTEM_COMP, MedPrio,"initializing");
m_driver_ptr = NULL;
m_profiler_ptr = new Profiler;
// NETWORK INITIALIZATION
// create the network by calling a function that calls new
m_network_ptr = Network::createNetwork(RubyConfig::numberOfChips());
DEBUG_MSG(SYSTEM_COMP, MedPrio,"Constructed network");
// CHIP INITIALIZATION
m_chip_vector.setSize(RubyConfig::numberOfChips());// create the vector of pointers to processors
for(int i=0; i<RubyConfig::numberOfChips(); i++) { // for each chip
// create the chip
m_chip_vector[i] = new Chip(i, m_network_ptr);
DEBUG_MSG(SYSTEM_COMP, MedPrio,"Constructed a chip");
}
// These must be after the chips are constructed
#if 0
if (!g_SIMICS) {
if (g_SYNTHETIC_DRIVER && !g_DETERMINISTIC_DRIVER) {
m_driver_ptr = new SyntheticDriver(this);
} else if (!g_SYNTHETIC_DRIVER && g_DETERMINISTIC_DRIVER) {
m_driver_ptr = new DeterministicDriver(this);
} else if (g_SYNTHETIC_DRIVER && g_DETERMINISTIC_DRIVER) {
ERROR_MSG("SYNTHETIC and DETERMINISTIC DRIVERS are exclusive and cannot be both enabled");
} else {
// normally make tester object, otherwise make an opal interface object.
if (!OpalInterface::isOpalLoaded()) {
m_driver_ptr = new Tester(this);
} else {
m_driver_ptr = new OpalInterface(this);
}
}
} else {
// detect if opal is loaded or not
if (OpalInterface::isOpalLoaded()) {
m_driver_ptr = new OpalInterface(this);
} else {
assert(0);
/* Need to allocate a driver here */
// m_driver_ptr = new SimicsDriver(this);
}
}
#endif
DEBUG_MSG(SYSTEM_COMP, MedPrio,"finished initializing");
DEBUG_NEWLINE(SYSTEM_COMP, MedPrio);
}
void RubySystem::createDriver()
{
if (g_SYNTHETIC_DRIVER && !g_DETERMINISTIC_DRIVER) {
cerr << "Creating Synthetic Driver" << endl;
m_driver_ptr = new SyntheticDriver(this);
} else if (!g_SYNTHETIC_DRIVER && g_DETERMINISTIC_DRIVER) {
cerr << "Creating Deterministic Driver" << endl;
m_driver_ptr = new DeterministicDriver(this);
}
}
void RubySystem::printConfig(ostream& out) const
{
out << "\n================ Begin RubySystem Configuration Print ================\n\n";
RubyConfig::printConfiguration(out);
out << endl;
getChip(0)->printConfig(out);
m_network_ptr->printConfig(out);
m_driver_ptr->printConfig(out);
m_profiler_ptr->printConfig(out);
out << "\n================ End RubySystem Configuration Print ================\n\n";
}
void RubySystem::printStats(ostream& out)
{
const time_t T = time(NULL);
tm *localTime = localtime(&T);
char buf[100];
strftime(buf, 100, "%b/%d/%Y %H:%M:%S", localTime);
out << "Real time: " << buf << endl;
m_profiler_ptr->printStats(out);
for(int i=0; i<RubyConfig::numberOfChips(); i++) { // for each chip
for(int p=0; p<RubyConfig::numberOfProcsPerChip(); p++) {
m_chip_vector[i]->m_L1Cache_mandatoryQueue_vec[p]->printStats(out);
}
}
m_network_ptr->printStats(out);
m_driver_ptr->printStats(out);
Chip::printStats(out);
}
void RubySystem::clearStats() const
{
m_profiler_ptr->clearStats();
m_network_ptr->clearStats();
m_driver_ptr->clearStats();
Chip::clearStats();
for(int i=0; i<RubyConfig::numberOfChips(); i++) { // for each chip
for(int p=0; p<RubyConfig::numberOfProcsPerChip(); p++) {
m_chip_vector[i]->m_L1Cache_mandatoryQueue_vec[p]->clearStats();
}
}
}
void RubySystem::recordCacheContents(CacheRecorder& tr) const
{
for (int i = 0; i < m_chip_vector.size(); i++) {
for (int m_version = 0; m_version < RubyConfig::numberOfProcsPerChip(); m_version++) {
if (Protocol::m_TwoLevelCache) {
m_chip_vector[i]->m_L1Cache_L1IcacheMemory_vec[m_version]->setAsInstructionCache(true);
m_chip_vector[i]->m_L1Cache_L1DcacheMemory_vec[m_version]->setAsInstructionCache(false);
} else {
m_chip_vector[i]->m_L1Cache_cacheMemory_vec[m_version]->setAsInstructionCache(false);
}
}
m_chip_vector[i]->recordCacheContents(tr);
}
}
#ifdef CHECK_COHERENCE
// This code will check for cases if the given cache block is exclusive in
// one node and shared in another-- a coherence violation
//
// To use, the SLICC specification must call sequencer.checkCoherence(address)
// when the controller changes to a state with new permissions. Do this
// in setState. The SLICC spec must also define methods "isBlockShared"
// and "isBlockExclusive" that are specific to that protocol
//
void RubySystem::checkGlobalCoherenceInvariant(const Address& addr ) {
NodeID exclusive = -1;
bool sharedDetected = false;
NodeID lastShared = -1;
for (int i = 0; i < m_chip_vector.size(); i++) {
if (m_chip_vector[i]->isBlockExclusive(addr)) {
if (exclusive != -1) {
// coherence violation
WARN_EXPR(exclusive);
WARN_EXPR(m_chip_vector[i]->getID());
WARN_EXPR(addr);
WARN_EXPR(g_eventQueue_ptr->getTime());
ERROR_MSG("Coherence Violation Detected -- 2 exclusive chips");
}
else if (sharedDetected) {
WARN_EXPR(lastShared);
WARN_EXPR(m_chip_vector[i]->getID());
WARN_EXPR(addr);
WARN_EXPR(g_eventQueue_ptr->getTime());
ERROR_MSG("Coherence Violation Detected -- exclusive chip with >=1 shared");
}
else {
exclusive = m_chip_vector[i]->getID();
}
}
else if (m_chip_vector[i]->isBlockShared(addr)) {
sharedDetected = true;
lastShared = m_chip_vector[i]->getID();
if (exclusive != -1) {
WARN_EXPR(lastShared);
WARN_EXPR(exclusive);
WARN_EXPR(addr);
WARN_EXPR(g_eventQueue_ptr->getTime());
ERROR_MSG("Coherence Violation Detected -- exclusive chip with >=1 shared");
}
}
}
}
#endif
|