1/*
2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#include "base/misc.hh"
30#include "base/str.hh"
31#include "config/the_isa.hh"
32#if THE_ISA == X86_ISA
33#include "arch/x86/insts/microldstop.hh"
34#endif // X86_ISA
35#include "cpu/testers/rubytest/RubyTester.hh"
36#include "debug/MemoryAccess.hh"
37#include "debug/ProtocolTrace.hh"
38#include "debug/RubySequencer.hh"
39#include "debug/RubyStats.hh"
40#include "mem/protocol/PrefetchBit.hh"
41#include "mem/protocol/RubyAccessMode.hh"
42#include "mem/ruby/buffers/MessageBuffer.hh"
43#include "mem/ruby/common/Global.hh"
44#include "mem/ruby/profiler/Profiler.hh"
45#include "mem/ruby/slicc_interface/RubyRequest.hh"
| 1/*
2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#include "base/misc.hh"
30#include "base/str.hh"
31#include "config/the_isa.hh"
32#if THE_ISA == X86_ISA
33#include "arch/x86/insts/microldstop.hh"
34#endif // X86_ISA
35#include "cpu/testers/rubytest/RubyTester.hh"
36#include "debug/MemoryAccess.hh"
37#include "debug/ProtocolTrace.hh"
38#include "debug/RubySequencer.hh"
39#include "debug/RubyStats.hh"
40#include "mem/protocol/PrefetchBit.hh"
41#include "mem/protocol/RubyAccessMode.hh"
42#include "mem/ruby/buffers/MessageBuffer.hh"
43#include "mem/ruby/common/Global.hh"
44#include "mem/ruby/profiler/Profiler.hh"
45#include "mem/ruby/slicc_interface/RubyRequest.hh"
|
46#include "mem/ruby/system/CacheMemory.hh"
| |
47#include "mem/ruby/system/Sequencer.hh"
48#include "mem/ruby/system/System.hh"
49#include "mem/packet.hh"
| 46#include "mem/ruby/system/Sequencer.hh"
47#include "mem/ruby/system/System.hh"
48#include "mem/packet.hh"
|
50#include "params/RubySequencer.hh"
| |
51
52using namespace std;
53
54Sequencer *
55RubySequencerParams::create()
56{
57 return new Sequencer(this);
58}
59
60Sequencer::Sequencer(const Params *p)
61 : RubyPort(p), deadlockCheckEvent(this)
62{
63 m_store_waiting_on_load_cycles = 0;
64 m_store_waiting_on_store_cycles = 0;
65 m_load_waiting_on_store_cycles = 0;
66 m_load_waiting_on_load_cycles = 0;
67
68 m_outstanding_count = 0;
69
70 m_instCache_ptr = p->icache;
71 m_dataCache_ptr = p->dcache;
72 m_max_outstanding_requests = p->max_outstanding_requests;
73 m_deadlock_threshold = p->deadlock_threshold;
74
75 assert(m_max_outstanding_requests > 0);
76 assert(m_deadlock_threshold > 0);
77 assert(m_instCache_ptr != NULL);
78 assert(m_dataCache_ptr != NULL);
79
80 m_usingNetworkTester = p->using_network_tester;
81}
82
83Sequencer::~Sequencer()
84{
85}
86
87void
88Sequencer::wakeup()
89{
90 // Check for deadlock of any of the requests
| 49
50using namespace std;
51
52Sequencer *
53RubySequencerParams::create()
54{
55 return new Sequencer(this);
56}
57
58Sequencer::Sequencer(const Params *p)
59 : RubyPort(p), deadlockCheckEvent(this)
60{
61 m_store_waiting_on_load_cycles = 0;
62 m_store_waiting_on_store_cycles = 0;
63 m_load_waiting_on_store_cycles = 0;
64 m_load_waiting_on_load_cycles = 0;
65
66 m_outstanding_count = 0;
67
68 m_instCache_ptr = p->icache;
69 m_dataCache_ptr = p->dcache;
70 m_max_outstanding_requests = p->max_outstanding_requests;
71 m_deadlock_threshold = p->deadlock_threshold;
72
73 assert(m_max_outstanding_requests > 0);
74 assert(m_deadlock_threshold > 0);
75 assert(m_instCache_ptr != NULL);
76 assert(m_dataCache_ptr != NULL);
77
78 m_usingNetworkTester = p->using_network_tester;
79}
80
81Sequencer::~Sequencer()
82{
83}
84
85void
86Sequencer::wakeup()
87{
88 // Check for deadlock of any of the requests
|
91 Time current_time = g_eventQueue_ptr->getTime();
| 89 Time current_time = g_system_ptr->getTime();
|
92
93 // Check across all outstanding requests
94 int total_outstanding = 0;
95
96 RequestTable::iterator read = m_readRequestTable.begin();
97 RequestTable::iterator read_end = m_readRequestTable.end();
98 for (; read != read_end; ++read) {
99 SequencerRequest* request = read->second;
100 if (current_time - request->issue_time < m_deadlock_threshold)
101 continue;
102
103 panic("Possible Deadlock detected. Aborting!\n"
104 "version: %d request.paddr: 0x%x m_readRequestTable: %d "
105 "current time: %u issue_time: %d difference: %d\n", m_version,
106 Address(request->pkt->getAddr()), m_readRequestTable.size(),
107 current_time, request->issue_time,
108 current_time - request->issue_time);
109 }
110
111 RequestTable::iterator write = m_writeRequestTable.begin();
112 RequestTable::iterator write_end = m_writeRequestTable.end();
113 for (; write != write_end; ++write) {
114 SequencerRequest* request = write->second;
115 if (current_time - request->issue_time < m_deadlock_threshold)
116 continue;
117
118 panic("Possible Deadlock detected. Aborting!\n"
119 "version: %d request.paddr: 0x%x m_writeRequestTable: %d "
120 "current time: %u issue_time: %d difference: %d\n", m_version,
121 Address(request->pkt->getAddr()), m_writeRequestTable.size(),
122 current_time, request->issue_time,
123 current_time - request->issue_time);
124 }
125
126 total_outstanding += m_writeRequestTable.size();
127 total_outstanding += m_readRequestTable.size();
128
129 assert(m_outstanding_count == total_outstanding);
130
131 if (m_outstanding_count > 0) {
132 // If there are still outstanding requests, keep checking
133 schedule(deadlockCheckEvent,
| 90
91 // Check across all outstanding requests
92 int total_outstanding = 0;
93
94 RequestTable::iterator read = m_readRequestTable.begin();
95 RequestTable::iterator read_end = m_readRequestTable.end();
96 for (; read != read_end; ++read) {
97 SequencerRequest* request = read->second;
98 if (current_time - request->issue_time < m_deadlock_threshold)
99 continue;
100
101 panic("Possible Deadlock detected. Aborting!\n"
102 "version: %d request.paddr: 0x%x m_readRequestTable: %d "
103 "current time: %u issue_time: %d difference: %d\n", m_version,
104 Address(request->pkt->getAddr()), m_readRequestTable.size(),
105 current_time, request->issue_time,
106 current_time - request->issue_time);
107 }
108
109 RequestTable::iterator write = m_writeRequestTable.begin();
110 RequestTable::iterator write_end = m_writeRequestTable.end();
111 for (; write != write_end; ++write) {
112 SequencerRequest* request = write->second;
113 if (current_time - request->issue_time < m_deadlock_threshold)
114 continue;
115
116 panic("Possible Deadlock detected. Aborting!\n"
117 "version: %d request.paddr: 0x%x m_writeRequestTable: %d "
118 "current time: %u issue_time: %d difference: %d\n", m_version,
119 Address(request->pkt->getAddr()), m_writeRequestTable.size(),
120 current_time, request->issue_time,
121 current_time - request->issue_time);
122 }
123
124 total_outstanding += m_writeRequestTable.size();
125 total_outstanding += m_readRequestTable.size();
126
127 assert(m_outstanding_count == total_outstanding);
128
129 if (m_outstanding_count > 0) {
130 // If there are still outstanding requests, keep checking
131 schedule(deadlockCheckEvent,
|
134 m_deadlock_threshold * g_eventQueue_ptr->getClock() +
| 132 m_deadlock_threshold * g_system_ptr->getClock() +
|
135 curTick());
136 }
137}
138
139void
140Sequencer::printStats(ostream & out) const
141{
142 out << "Sequencer: " << m_name << endl
143 << " store_waiting_on_load_cycles: "
144 << m_store_waiting_on_load_cycles << endl
145 << " store_waiting_on_store_cycles: "
146 << m_store_waiting_on_store_cycles << endl
147 << " load_waiting_on_load_cycles: "
148 << m_load_waiting_on_load_cycles << endl
149 << " load_waiting_on_store_cycles: "
150 << m_load_waiting_on_store_cycles << endl;
151}
152
153void
154Sequencer::printProgress(ostream& out) const
155{
156#if 0
157 int total_demand = 0;
158 out << "Sequencer Stats Version " << m_version << endl;
| 133 curTick());
134 }
135}
136
137void
138Sequencer::printStats(ostream & out) const
139{
140 out << "Sequencer: " << m_name << endl
141 << " store_waiting_on_load_cycles: "
142 << m_store_waiting_on_load_cycles << endl
143 << " store_waiting_on_store_cycles: "
144 << m_store_waiting_on_store_cycles << endl
145 << " load_waiting_on_load_cycles: "
146 << m_load_waiting_on_load_cycles << endl
147 << " load_waiting_on_store_cycles: "
148 << m_load_waiting_on_store_cycles << endl;
149}
150
151void
152Sequencer::printProgress(ostream& out) const
153{
154#if 0
155 int total_demand = 0;
156 out << "Sequencer Stats Version " << m_version << endl;
|
159 out << "Current time = " << g_eventQueue_ptr->getTime() << endl;
| 157 out << "Current time = " << g_system_ptr->getTime() << endl;
|
160 out << "---------------" << endl;
161 out << "outstanding requests" << endl;
162
163 out << "proc " << m_Read
164 << " version Requests = " << m_readRequestTable.size() << endl;
165
166 // print the request table
167 RequestTable::iterator read = m_readRequestTable.begin();
168 RequestTable::iterator read_end = m_readRequestTable.end();
169 for (; read != read_end; ++read) {
170 SequencerRequest* request = read->second;
171 out << "\tRequest[ " << i << " ] = " << request->type
172 << " Address " << rkeys[i]
173 << " Posted " << request->issue_time
174 << " PF " << PrefetchBit_No << endl;
175 total_demand++;
176 }
177
178 out << "proc " << m_version
179 << " Write Requests = " << m_writeRequestTable.size << endl;
180
181 // print the request table
182 RequestTable::iterator write = m_writeRequestTable.begin();
183 RequestTable::iterator write_end = m_writeRequestTable.end();
184 for (; write != write_end; ++write) {
185 SequencerRequest* request = write->second;
186 out << "\tRequest[ " << i << " ] = " << request.getType()
187 << " Address " << wkeys[i]
188 << " Posted " << request.getTime()
189 << " PF " << request.getPrefetch() << endl;
190 if (request.getPrefetch() == PrefetchBit_No) {
191 total_demand++;
192 }
193 }
194
195 out << endl;
196
197 out << "Total Number Outstanding: " << m_outstanding_count << endl
198 << "Total Number Demand : " << total_demand << endl
199 << "Total Number Prefetches : " << m_outstanding_count - total_demand
200 << endl << endl << endl;
201#endif
202}
203
204// Insert the request on the correct request table. Return true if
205// the entry was already present.
206RequestStatus
207Sequencer::insertRequest(PacketPtr pkt, RubyRequestType request_type)
208{
209 assert(m_outstanding_count ==
210 (m_writeRequestTable.size() + m_readRequestTable.size()));
211
212 // See if we should schedule a deadlock check
213 if (deadlockCheckEvent.scheduled() == false) {
214 schedule(deadlockCheckEvent,
| 158 out << "---------------" << endl;
159 out << "outstanding requests" << endl;
160
161 out << "proc " << m_Read
162 << " version Requests = " << m_readRequestTable.size() << endl;
163
164 // print the request table
165 RequestTable::iterator read = m_readRequestTable.begin();
166 RequestTable::iterator read_end = m_readRequestTable.end();
167 for (; read != read_end; ++read) {
168 SequencerRequest* request = read->second;
169 out << "\tRequest[ " << i << " ] = " << request->type
170 << " Address " << rkeys[i]
171 << " Posted " << request->issue_time
172 << " PF " << PrefetchBit_No << endl;
173 total_demand++;
174 }
175
176 out << "proc " << m_version
177 << " Write Requests = " << m_writeRequestTable.size << endl;
178
179 // print the request table
180 RequestTable::iterator write = m_writeRequestTable.begin();
181 RequestTable::iterator write_end = m_writeRequestTable.end();
182 for (; write != write_end; ++write) {
183 SequencerRequest* request = write->second;
184 out << "\tRequest[ " << i << " ] = " << request.getType()
185 << " Address " << wkeys[i]
186 << " Posted " << request.getTime()
187 << " PF " << request.getPrefetch() << endl;
188 if (request.getPrefetch() == PrefetchBit_No) {
189 total_demand++;
190 }
191 }
192
193 out << endl;
194
195 out << "Total Number Outstanding: " << m_outstanding_count << endl
196 << "Total Number Demand : " << total_demand << endl
197 << "Total Number Prefetches : " << m_outstanding_count - total_demand
198 << endl << endl << endl;
199#endif
200}
201
202// Insert the request on the correct request table. Return true if
203// the entry was already present.
204RequestStatus
205Sequencer::insertRequest(PacketPtr pkt, RubyRequestType request_type)
206{
207 assert(m_outstanding_count ==
208 (m_writeRequestTable.size() + m_readRequestTable.size()));
209
210 // See if we should schedule a deadlock check
211 if (deadlockCheckEvent.scheduled() == false) {
212 schedule(deadlockCheckEvent,
|
215 m_deadlock_threshold * g_eventQueue_ptr->getClock()
| 213 m_deadlock_threshold * g_system_ptr->getClock()
|
216 + curTick());
217 }
218
219 Address line_addr(pkt->getAddr());
220 line_addr.makeLineAddress();
221 if ((request_type == RubyRequestType_ST) ||
222 (request_type == RubyRequestType_RMW_Read) ||
223 (request_type == RubyRequestType_RMW_Write) ||
224 (request_type == RubyRequestType_Load_Linked) ||
225 (request_type == RubyRequestType_Store_Conditional) ||
226 (request_type == RubyRequestType_Locked_RMW_Read) ||
227 (request_type == RubyRequestType_Locked_RMW_Write) ||
228 (request_type == RubyRequestType_FLUSH)) {
229
230 // Check if there is any outstanding read request for the same
231 // cache line.
232 if (m_readRequestTable.count(line_addr) > 0) {
233 m_store_waiting_on_load_cycles++;
234 return RequestStatus_Aliased;
235 }
236
237 pair<RequestTable::iterator, bool> r =
238 m_writeRequestTable.insert(RequestTable::value_type(line_addr, 0));
239 if (r.second) {
240 RequestTable::iterator i = r.first;
241 i->second = new SequencerRequest(pkt, request_type,
| 214 + curTick());
215 }
216
217 Address line_addr(pkt->getAddr());
218 line_addr.makeLineAddress();
219 if ((request_type == RubyRequestType_ST) ||
220 (request_type == RubyRequestType_RMW_Read) ||
221 (request_type == RubyRequestType_RMW_Write) ||
222 (request_type == RubyRequestType_Load_Linked) ||
223 (request_type == RubyRequestType_Store_Conditional) ||
224 (request_type == RubyRequestType_Locked_RMW_Read) ||
225 (request_type == RubyRequestType_Locked_RMW_Write) ||
226 (request_type == RubyRequestType_FLUSH)) {
227
228 // Check if there is any outstanding read request for the same
229 // cache line.
230 if (m_readRequestTable.count(line_addr) > 0) {
231 m_store_waiting_on_load_cycles++;
232 return RequestStatus_Aliased;
233 }
234
235 pair<RequestTable::iterator, bool> r =
236 m_writeRequestTable.insert(RequestTable::value_type(line_addr, 0));
237 if (r.second) {
238 RequestTable::iterator i = r.first;
239 i->second = new SequencerRequest(pkt, request_type,
|
242 g_eventQueue_ptr->getTime());
| 240 g_system_ptr->getTime());
|
243 m_outstanding_count++;
244 } else {
245 // There is an outstanding write request for the cache line
246 m_store_waiting_on_store_cycles++;
247 return RequestStatus_Aliased;
248 }
249 } else {
250 // Check if there is any outstanding write request for the same
251 // cache line.
252 if (m_writeRequestTable.count(line_addr) > 0) {
253 m_load_waiting_on_store_cycles++;
254 return RequestStatus_Aliased;
255 }
256
257 pair<RequestTable::iterator, bool> r =
258 m_readRequestTable.insert(RequestTable::value_type(line_addr, 0));
259
260 if (r.second) {
261 RequestTable::iterator i = r.first;
262 i->second = new SequencerRequest(pkt, request_type,
| 241 m_outstanding_count++;
242 } else {
243 // There is an outstanding write request for the cache line
244 m_store_waiting_on_store_cycles++;
245 return RequestStatus_Aliased;
246 }
247 } else {
248 // Check if there is any outstanding write request for the same
249 // cache line.
250 if (m_writeRequestTable.count(line_addr) > 0) {
251 m_load_waiting_on_store_cycles++;
252 return RequestStatus_Aliased;
253 }
254
255 pair<RequestTable::iterator, bool> r =
256 m_readRequestTable.insert(RequestTable::value_type(line_addr, 0));
257
258 if (r.second) {
259 RequestTable::iterator i = r.first;
260 i->second = new SequencerRequest(pkt, request_type,
|
263 g_eventQueue_ptr->getTime());
| 261 g_system_ptr->getTime());
|
264 m_outstanding_count++;
265 } else {
266 // There is an outstanding read request for the cache line
267 m_load_waiting_on_load_cycles++;
268 return RequestStatus_Aliased;
269 }
270 }
271
272 g_system_ptr->getProfiler()->sequencerRequests(m_outstanding_count);
273 assert(m_outstanding_count ==
274 (m_writeRequestTable.size() + m_readRequestTable.size()));
275
276 return RequestStatus_Ready;
277}
278
279void
280Sequencer::markRemoved()
281{
282 m_outstanding_count--;
283 assert(m_outstanding_count ==
284 m_writeRequestTable.size() + m_readRequestTable.size());
285}
286
287void
288Sequencer::removeRequest(SequencerRequest* srequest)
289{
290 assert(m_outstanding_count ==
291 m_writeRequestTable.size() + m_readRequestTable.size());
292
293 Address line_addr(srequest->pkt->getAddr());
294 line_addr.makeLineAddress();
295 if ((srequest->m_type == RubyRequestType_ST) ||
296 (srequest->m_type == RubyRequestType_RMW_Read) ||
297 (srequest->m_type == RubyRequestType_RMW_Write) ||
298 (srequest->m_type == RubyRequestType_Load_Linked) ||
299 (srequest->m_type == RubyRequestType_Store_Conditional) ||
300 (srequest->m_type == RubyRequestType_Locked_RMW_Read) ||
301 (srequest->m_type == RubyRequestType_Locked_RMW_Write)) {
302 m_writeRequestTable.erase(line_addr);
303 } else {
304 m_readRequestTable.erase(line_addr);
305 }
306
307 markRemoved();
308}
309
310bool
311Sequencer::handleLlsc(const Address& address, SequencerRequest* request)
312{
313 //
314 // The success flag indicates whether the LLSC operation was successful.
315 // LL ops will always succeed, but SC may fail if the cache line is no
316 // longer locked.
317 //
318 bool success = true;
319 if (request->m_type == RubyRequestType_Store_Conditional) {
320 if (!m_dataCache_ptr->isLocked(address, m_version)) {
321 //
322 // For failed SC requests, indicate the failure to the cpu by
323 // setting the extra data to zero.
324 //
325 request->pkt->req->setExtraData(0);
326 success = false;
327 } else {
328 //
329 // For successful SC requests, indicate the success to the cpu by
330 // setting the extra data to one.
331 //
332 request->pkt->req->setExtraData(1);
333 }
334 //
335 // Independent of success, all SC operations must clear the lock
336 //
337 m_dataCache_ptr->clearLocked(address);
338 } else if (request->m_type == RubyRequestType_Load_Linked) {
339 //
340 // Note: To fully follow Alpha LLSC semantics, should the LL clear any
341 // previously locked cache lines?
342 //
343 m_dataCache_ptr->setLocked(address, m_version);
344 } else if ((m_dataCache_ptr->isTagPresent(address)) &&
345 (m_dataCache_ptr->isLocked(address, m_version))) {
346 //
347 // Normal writes should clear the locked address
348 //
349 m_dataCache_ptr->clearLocked(address);
350 }
351 return success;
352}
353
354void
355Sequencer::writeCallback(const Address& address, DataBlock& data)
356{
357 writeCallback(address, GenericMachineType_NULL, data);
358}
359
360void
361Sequencer::writeCallback(const Address& address,
362 GenericMachineType mach,
363 DataBlock& data)
364{
365 writeCallback(address, mach, data, 0, 0, 0);
366}
367
368void
369Sequencer::writeCallback(const Address& address,
370 GenericMachineType mach,
371 DataBlock& data,
372 Time initialRequestTime,
373 Time forwardRequestTime,
374 Time firstResponseTime)
375{
376 assert(address == line_address(address));
377 assert(m_writeRequestTable.count(line_address(address)));
378
379 RequestTable::iterator i = m_writeRequestTable.find(address);
380 assert(i != m_writeRequestTable.end());
381 SequencerRequest* request = i->second;
382
383 m_writeRequestTable.erase(i);
384 markRemoved();
385
386 assert((request->m_type == RubyRequestType_ST) ||
387 (request->m_type == RubyRequestType_ATOMIC) ||
388 (request->m_type == RubyRequestType_RMW_Read) ||
389 (request->m_type == RubyRequestType_RMW_Write) ||
390 (request->m_type == RubyRequestType_Load_Linked) ||
391 (request->m_type == RubyRequestType_Store_Conditional) ||
392 (request->m_type == RubyRequestType_Locked_RMW_Read) ||
393 (request->m_type == RubyRequestType_Locked_RMW_Write) ||
394 (request->m_type == RubyRequestType_FLUSH));
395
396
397 //
398 // For Alpha, properly handle LL, SC, and write requests with respect to
399 // locked cache blocks.
400 //
401 // Not valid for Network_test protocl
402 //
403 bool success = true;
404 if(!m_usingNetworkTester)
405 success = handleLlsc(address, request);
406
407 if (request->m_type == RubyRequestType_Locked_RMW_Read) {
408 m_controller->blockOnQueue(address, m_mandatory_q_ptr);
409 } else if (request->m_type == RubyRequestType_Locked_RMW_Write) {
410 m_controller->unblock(address);
411 }
412
413 hitCallback(request, mach, data, success,
414 initialRequestTime, forwardRequestTime, firstResponseTime);
415}
416
417void
418Sequencer::readCallback(const Address& address, DataBlock& data)
419{
420 readCallback(address, GenericMachineType_NULL, data);
421}
422
423void
424Sequencer::readCallback(const Address& address,
425 GenericMachineType mach,
426 DataBlock& data)
427{
428 readCallback(address, mach, data, 0, 0, 0);
429}
430
431void
432Sequencer::readCallback(const Address& address,
433 GenericMachineType mach,
434 DataBlock& data,
435 Time initialRequestTime,
436 Time forwardRequestTime,
437 Time firstResponseTime)
438{
439 assert(address == line_address(address));
440 assert(m_readRequestTable.count(line_address(address)));
441
442 RequestTable::iterator i = m_readRequestTable.find(address);
443 assert(i != m_readRequestTable.end());
444 SequencerRequest* request = i->second;
445
446 m_readRequestTable.erase(i);
447 markRemoved();
448
449 assert((request->m_type == RubyRequestType_LD) ||
450 (request->m_type == RubyRequestType_IFETCH));
451
452 hitCallback(request, mach, data, true,
453 initialRequestTime, forwardRequestTime, firstResponseTime);
454}
455
456void
457Sequencer::hitCallback(SequencerRequest* srequest,
458 GenericMachineType mach,
459 DataBlock& data,
460 bool success,
461 Time initialRequestTime,
462 Time forwardRequestTime,
463 Time firstResponseTime)
464{
465 PacketPtr pkt = srequest->pkt;
466 Address request_address(pkt->getAddr());
467 Address request_line_address(pkt->getAddr());
468 request_line_address.makeLineAddress();
469 RubyRequestType type = srequest->m_type;
470 Time issued_time = srequest->issue_time;
471
472 // Set this cache entry to the most recently used
473 if (type == RubyRequestType_IFETCH) {
474 m_instCache_ptr->setMRU(request_line_address);
475 } else {
476 m_dataCache_ptr->setMRU(request_line_address);
477 }
478
| 262 m_outstanding_count++;
263 } else {
264 // There is an outstanding read request for the cache line
265 m_load_waiting_on_load_cycles++;
266 return RequestStatus_Aliased;
267 }
268 }
269
270 g_system_ptr->getProfiler()->sequencerRequests(m_outstanding_count);
271 assert(m_outstanding_count ==
272 (m_writeRequestTable.size() + m_readRequestTable.size()));
273
274 return RequestStatus_Ready;
275}
276
277void
278Sequencer::markRemoved()
279{
280 m_outstanding_count--;
281 assert(m_outstanding_count ==
282 m_writeRequestTable.size() + m_readRequestTable.size());
283}
284
285void
286Sequencer::removeRequest(SequencerRequest* srequest)
287{
288 assert(m_outstanding_count ==
289 m_writeRequestTable.size() + m_readRequestTable.size());
290
291 Address line_addr(srequest->pkt->getAddr());
292 line_addr.makeLineAddress();
293 if ((srequest->m_type == RubyRequestType_ST) ||
294 (srequest->m_type == RubyRequestType_RMW_Read) ||
295 (srequest->m_type == RubyRequestType_RMW_Write) ||
296 (srequest->m_type == RubyRequestType_Load_Linked) ||
297 (srequest->m_type == RubyRequestType_Store_Conditional) ||
298 (srequest->m_type == RubyRequestType_Locked_RMW_Read) ||
299 (srequest->m_type == RubyRequestType_Locked_RMW_Write)) {
300 m_writeRequestTable.erase(line_addr);
301 } else {
302 m_readRequestTable.erase(line_addr);
303 }
304
305 markRemoved();
306}
307
308bool
309Sequencer::handleLlsc(const Address& address, SequencerRequest* request)
310{
311 //
312 // The success flag indicates whether the LLSC operation was successful.
313 // LL ops will always succeed, but SC may fail if the cache line is no
314 // longer locked.
315 //
316 bool success = true;
317 if (request->m_type == RubyRequestType_Store_Conditional) {
318 if (!m_dataCache_ptr->isLocked(address, m_version)) {
319 //
320 // For failed SC requests, indicate the failure to the cpu by
321 // setting the extra data to zero.
322 //
323 request->pkt->req->setExtraData(0);
324 success = false;
325 } else {
326 //
327 // For successful SC requests, indicate the success to the cpu by
328 // setting the extra data to one.
329 //
330 request->pkt->req->setExtraData(1);
331 }
332 //
333 // Independent of success, all SC operations must clear the lock
334 //
335 m_dataCache_ptr->clearLocked(address);
336 } else if (request->m_type == RubyRequestType_Load_Linked) {
337 //
338 // Note: To fully follow Alpha LLSC semantics, should the LL clear any
339 // previously locked cache lines?
340 //
341 m_dataCache_ptr->setLocked(address, m_version);
342 } else if ((m_dataCache_ptr->isTagPresent(address)) &&
343 (m_dataCache_ptr->isLocked(address, m_version))) {
344 //
345 // Normal writes should clear the locked address
346 //
347 m_dataCache_ptr->clearLocked(address);
348 }
349 return success;
350}
351
352void
353Sequencer::writeCallback(const Address& address, DataBlock& data)
354{
355 writeCallback(address, GenericMachineType_NULL, data);
356}
357
358void
359Sequencer::writeCallback(const Address& address,
360 GenericMachineType mach,
361 DataBlock& data)
362{
363 writeCallback(address, mach, data, 0, 0, 0);
364}
365
366void
367Sequencer::writeCallback(const Address& address,
368 GenericMachineType mach,
369 DataBlock& data,
370 Time initialRequestTime,
371 Time forwardRequestTime,
372 Time firstResponseTime)
373{
374 assert(address == line_address(address));
375 assert(m_writeRequestTable.count(line_address(address)));
376
377 RequestTable::iterator i = m_writeRequestTable.find(address);
378 assert(i != m_writeRequestTable.end());
379 SequencerRequest* request = i->second;
380
381 m_writeRequestTable.erase(i);
382 markRemoved();
383
384 assert((request->m_type == RubyRequestType_ST) ||
385 (request->m_type == RubyRequestType_ATOMIC) ||
386 (request->m_type == RubyRequestType_RMW_Read) ||
387 (request->m_type == RubyRequestType_RMW_Write) ||
388 (request->m_type == RubyRequestType_Load_Linked) ||
389 (request->m_type == RubyRequestType_Store_Conditional) ||
390 (request->m_type == RubyRequestType_Locked_RMW_Read) ||
391 (request->m_type == RubyRequestType_Locked_RMW_Write) ||
392 (request->m_type == RubyRequestType_FLUSH));
393
394
395 //
396 // For Alpha, properly handle LL, SC, and write requests with respect to
397 // locked cache blocks.
398 //
399 // Not valid for Network_test protocl
400 //
401 bool success = true;
402 if(!m_usingNetworkTester)
403 success = handleLlsc(address, request);
404
405 if (request->m_type == RubyRequestType_Locked_RMW_Read) {
406 m_controller->blockOnQueue(address, m_mandatory_q_ptr);
407 } else if (request->m_type == RubyRequestType_Locked_RMW_Write) {
408 m_controller->unblock(address);
409 }
410
411 hitCallback(request, mach, data, success,
412 initialRequestTime, forwardRequestTime, firstResponseTime);
413}
414
415void
416Sequencer::readCallback(const Address& address, DataBlock& data)
417{
418 readCallback(address, GenericMachineType_NULL, data);
419}
420
421void
422Sequencer::readCallback(const Address& address,
423 GenericMachineType mach,
424 DataBlock& data)
425{
426 readCallback(address, mach, data, 0, 0, 0);
427}
428
429void
430Sequencer::readCallback(const Address& address,
431 GenericMachineType mach,
432 DataBlock& data,
433 Time initialRequestTime,
434 Time forwardRequestTime,
435 Time firstResponseTime)
436{
437 assert(address == line_address(address));
438 assert(m_readRequestTable.count(line_address(address)));
439
440 RequestTable::iterator i = m_readRequestTable.find(address);
441 assert(i != m_readRequestTable.end());
442 SequencerRequest* request = i->second;
443
444 m_readRequestTable.erase(i);
445 markRemoved();
446
447 assert((request->m_type == RubyRequestType_LD) ||
448 (request->m_type == RubyRequestType_IFETCH));
449
450 hitCallback(request, mach, data, true,
451 initialRequestTime, forwardRequestTime, firstResponseTime);
452}
453
454void
455Sequencer::hitCallback(SequencerRequest* srequest,
456 GenericMachineType mach,
457 DataBlock& data,
458 bool success,
459 Time initialRequestTime,
460 Time forwardRequestTime,
461 Time firstResponseTime)
462{
463 PacketPtr pkt = srequest->pkt;
464 Address request_address(pkt->getAddr());
465 Address request_line_address(pkt->getAddr());
466 request_line_address.makeLineAddress();
467 RubyRequestType type = srequest->m_type;
468 Time issued_time = srequest->issue_time;
469
470 // Set this cache entry to the most recently used
471 if (type == RubyRequestType_IFETCH) {
472 m_instCache_ptr->setMRU(request_line_address);
473 } else {
474 m_dataCache_ptr->setMRU(request_line_address);
475 }
476
|
479 assert(g_eventQueue_ptr->getTime() >= issued_time);
480 Time miss_latency = g_eventQueue_ptr->getTime() - issued_time;
| 477 assert(g_system_ptr->getTime() >= issued_time);
478 Time miss_latency = g_system_ptr->getTime() - issued_time;
|
481
482 // Profile the miss latency for all non-zero demand misses
483 if (miss_latency != 0) {
484 g_system_ptr->getProfiler()->missLatency(miss_latency, type, mach);
485
486 if (mach == GenericMachineType_L1Cache_wCC) {
487 g_system_ptr->getProfiler()->missLatencyWcc(issued_time,
488 initialRequestTime,
489 forwardRequestTime,
490 firstResponseTime,
| 479
480 // Profile the miss latency for all non-zero demand misses
481 if (miss_latency != 0) {
482 g_system_ptr->getProfiler()->missLatency(miss_latency, type, mach);
483
484 if (mach == GenericMachineType_L1Cache_wCC) {
485 g_system_ptr->getProfiler()->missLatencyWcc(issued_time,
486 initialRequestTime,
487 forwardRequestTime,
488 firstResponseTime,
|
491 g_eventQueue_ptr->getTime());
| 489 g_system_ptr->getTime());
|
492 }
493
494 if (mach == GenericMachineType_Directory) {
495 g_system_ptr->getProfiler()->missLatencyDir(issued_time,
496 initialRequestTime,
497 forwardRequestTime,
498 firstResponseTime,
| 490 }
491
492 if (mach == GenericMachineType_Directory) {
493 g_system_ptr->getProfiler()->missLatencyDir(issued_time,
494 initialRequestTime,
495 forwardRequestTime,
496 firstResponseTime,
|
499 g_eventQueue_ptr->getTime());
| 497 g_system_ptr->getTime());
|
500 }
501
502 DPRINTFR(ProtocolTrace, "%15s %3s %10s%20s %6s>%-6s %s %d cycles\n",
503 curTick(), m_version, "Seq",
504 success ? "Done" : "SC_Failed", "", "",
505 request_address, miss_latency);
506 }
507
508 // update the data
509 if (g_system_ptr->m_warmup_enabled) {
510 assert(pkt->getPtr<uint8_t>(false) != NULL);
511 data.setData(pkt->getPtr<uint8_t>(false),
512 request_address.getOffset(), pkt->getSize());
513 } else if (pkt->getPtr<uint8_t>(true) != NULL) {
514 if ((type == RubyRequestType_LD) ||
515 (type == RubyRequestType_IFETCH) ||
516 (type == RubyRequestType_RMW_Read) ||
517 (type == RubyRequestType_Locked_RMW_Read) ||
518 (type == RubyRequestType_Load_Linked)) {
519 memcpy(pkt->getPtr<uint8_t>(true),
520 data.getData(request_address.getOffset(), pkt->getSize()),
521 pkt->getSize());
522 } else {
523 data.setData(pkt->getPtr<uint8_t>(true),
524 request_address.getOffset(), pkt->getSize());
525 }
526 } else {
527 DPRINTF(MemoryAccess,
528 "WARNING. Data not transfered from Ruby to M5 for type %s\n",
529 RubyRequestType_to_string(type));
530 }
531
532 // If using the RubyTester, update the RubyTester sender state's
533 // subBlock with the recieved data. The tester will later access
534 // this state.
535 // Note: RubyPort will access it's sender state before the
536 // RubyTester.
537 if (m_usingRubyTester) {
538 RubyPort::SenderState *requestSenderState =
539 safe_cast<RubyPort::SenderState*>(pkt->senderState);
540 RubyTester::SenderState* testerSenderState =
541 safe_cast<RubyTester::SenderState*>(requestSenderState->saved);
542 testerSenderState->subBlock->mergeFrom(data);
543 }
544
545 delete srequest;
546
547 if (g_system_ptr->m_warmup_enabled) {
548 delete pkt;
549 g_system_ptr->m_cache_recorder->enqueueNextFetchRequest();
550 } else if (g_system_ptr->m_cooldown_enabled) {
551 delete pkt;
552 g_system_ptr->m_cache_recorder->enqueueNextFlushRequest();
553 } else {
554 ruby_hit_callback(pkt);
555 }
556}
557
558bool
559Sequencer::empty() const
560{
561 return m_writeRequestTable.empty() && m_readRequestTable.empty();
562}
563
564RequestStatus
565Sequencer::makeRequest(PacketPtr pkt)
566{
567 if (m_outstanding_count >= m_max_outstanding_requests) {
568 return RequestStatus_BufferFull;
569 }
570
571 RubyRequestType primary_type = RubyRequestType_NULL;
572 RubyRequestType secondary_type = RubyRequestType_NULL;
573
574 if (pkt->isLLSC()) {
575 //
576 // Alpha LL/SC instructions need to be handled carefully by the cache
577 // coherence protocol to ensure they follow the proper semantics. In
578 // particular, by identifying the operations as atomic, the protocol
579 // should understand that migratory sharing optimizations should not
580 // be performed (i.e. a load between the LL and SC should not steal
581 // away exclusive permission).
582 //
583 if (pkt->isWrite()) {
584 DPRINTF(RubySequencer, "Issuing SC\n");
585 primary_type = RubyRequestType_Store_Conditional;
586 } else {
587 DPRINTF(RubySequencer, "Issuing LL\n");
588 assert(pkt->isRead());
589 primary_type = RubyRequestType_Load_Linked;
590 }
591 secondary_type = RubyRequestType_ATOMIC;
592 } else if (pkt->req->isLocked()) {
593 //
594 // x86 locked instructions are translated to store cache coherence
595 // requests because these requests should always be treated as read
596 // exclusive operations and should leverage any migratory sharing
597 // optimization built into the protocol.
598 //
599 if (pkt->isWrite()) {
600 DPRINTF(RubySequencer, "Issuing Locked RMW Write\n");
601 primary_type = RubyRequestType_Locked_RMW_Write;
602 } else {
603 DPRINTF(RubySequencer, "Issuing Locked RMW Read\n");
604 assert(pkt->isRead());
605 primary_type = RubyRequestType_Locked_RMW_Read;
606 }
607 secondary_type = RubyRequestType_ST;
608 } else {
609 if (pkt->isRead()) {
610 if (pkt->req->isInstFetch()) {
611 primary_type = secondary_type = RubyRequestType_IFETCH;
612 } else {
613#if THE_ISA == X86_ISA
614 uint32_t flags = pkt->req->getFlags();
615 bool storeCheck = flags &
616 (TheISA::StoreCheck << TheISA::FlagShift);
617#else
618 bool storeCheck = false;
619#endif // X86_ISA
620 if (storeCheck) {
621 primary_type = RubyRequestType_RMW_Read;
622 secondary_type = RubyRequestType_ST;
623 } else {
624 primary_type = secondary_type = RubyRequestType_LD;
625 }
626 }
627 } else if (pkt->isWrite()) {
628 //
629 // Note: M5 packets do not differentiate ST from RMW_Write
630 //
631 primary_type = secondary_type = RubyRequestType_ST;
632 } else if (pkt->isFlush()) {
633 primary_type = secondary_type = RubyRequestType_FLUSH;
634 } else {
635 panic("Unsupported ruby packet type\n");
636 }
637 }
638
639 RequestStatus status = insertRequest(pkt, primary_type);
640 if (status != RequestStatus_Ready)
641 return status;
642
643 issueRequest(pkt, secondary_type);
644
645 // TODO: issue hardware prefetches here
646 return RequestStatus_Issued;
647}
648
649void
650Sequencer::issueRequest(PacketPtr pkt, RubyRequestType secondary_type)
651{
652 int proc_id = -1;
653 if (pkt != NULL && pkt->req->hasContextId()) {
654 proc_id = pkt->req->contextId();
655 }
656
657 // If valid, copy the pc to the ruby request
658 Addr pc = 0;
659 if (pkt->req->hasPC()) {
660 pc = pkt->req->getPC();
661 }
662
663 RubyRequest *msg = new RubyRequest(pkt->getAddr(),
664 pkt->getPtr<uint8_t>(true),
665 pkt->getSize(), pc, secondary_type,
666 RubyAccessMode_Supervisor, pkt,
667 PrefetchBit_No, proc_id);
668
669 DPRINTFR(ProtocolTrace, "%15s %3s %10s%20s %6s>%-6s %s %s\n",
670 curTick(), m_version, "Seq", "Begin", "", "",
671 msg->getPhysicalAddress(),
672 RubyRequestType_to_string(secondary_type));
673
674 Time latency = 0; // initialzed to an null value
675
676 if (secondary_type == RubyRequestType_IFETCH)
677 latency = m_instCache_ptr->getLatency();
678 else
679 latency = m_dataCache_ptr->getLatency();
680
681 // Send the message to the cache controller
682 assert(latency > 0);
683
684 assert(m_mandatory_q_ptr != NULL);
685 m_mandatory_q_ptr->enqueue(msg, latency);
686}
687
688template <class KEY, class VALUE>
689std::ostream &
690operator<<(ostream &out, const m5::hash_map<KEY, VALUE> &map)
691{
692 typename m5::hash_map<KEY, VALUE>::const_iterator i = map.begin();
693 typename m5::hash_map<KEY, VALUE>::const_iterator end = map.end();
694
695 out << "[";
696 for (; i != end; ++i)
697 out << " " << i->first << "=" << i->second;
698 out << " ]";
699
700 return out;
701}
702
703void
704Sequencer::print(ostream& out) const
705{
706 out << "[Sequencer: " << m_version
707 << ", outstanding requests: " << m_outstanding_count
708 << ", read request table: " << m_readRequestTable
709 << ", write request table: " << m_writeRequestTable
710 << "]";
711}
712
713// this can be called from setState whenever coherence permissions are
714// upgraded when invoked, coherence violations will be checked for the
715// given block
716void
717Sequencer::checkCoherence(const Address& addr)
718{
719#ifdef CHECK_COHERENCE
720 g_system_ptr->checkGlobalCoherenceInvariant(addr);
721#endif
722}
723
724void
725Sequencer::recordRequestType(SequencerRequestType requestType) {
726 DPRINTF(RubyStats, "Recorded statistic: %s\n",
727 SequencerRequestType_to_string(requestType));
728}
729
730
731void
732Sequencer::evictionCallback(const Address& address)
733{
734 ruby_eviction_callback(address);
735}
| 498 }
499
500 DPRINTFR(ProtocolTrace, "%15s %3s %10s%20s %6s>%-6s %s %d cycles\n",
501 curTick(), m_version, "Seq",
502 success ? "Done" : "SC_Failed", "", "",
503 request_address, miss_latency);
504 }
505
506 // update the data
507 if (g_system_ptr->m_warmup_enabled) {
508 assert(pkt->getPtr<uint8_t>(false) != NULL);
509 data.setData(pkt->getPtr<uint8_t>(false),
510 request_address.getOffset(), pkt->getSize());
511 } else if (pkt->getPtr<uint8_t>(true) != NULL) {
512 if ((type == RubyRequestType_LD) ||
513 (type == RubyRequestType_IFETCH) ||
514 (type == RubyRequestType_RMW_Read) ||
515 (type == RubyRequestType_Locked_RMW_Read) ||
516 (type == RubyRequestType_Load_Linked)) {
517 memcpy(pkt->getPtr<uint8_t>(true),
518 data.getData(request_address.getOffset(), pkt->getSize()),
519 pkt->getSize());
520 } else {
521 data.setData(pkt->getPtr<uint8_t>(true),
522 request_address.getOffset(), pkt->getSize());
523 }
524 } else {
525 DPRINTF(MemoryAccess,
526 "WARNING. Data not transfered from Ruby to M5 for type %s\n",
527 RubyRequestType_to_string(type));
528 }
529
530 // If using the RubyTester, update the RubyTester sender state's
531 // subBlock with the recieved data. The tester will later access
532 // this state.
533 // Note: RubyPort will access it's sender state before the
534 // RubyTester.
535 if (m_usingRubyTester) {
536 RubyPort::SenderState *requestSenderState =
537 safe_cast<RubyPort::SenderState*>(pkt->senderState);
538 RubyTester::SenderState* testerSenderState =
539 safe_cast<RubyTester::SenderState*>(requestSenderState->saved);
540 testerSenderState->subBlock->mergeFrom(data);
541 }
542
543 delete srequest;
544
545 if (g_system_ptr->m_warmup_enabled) {
546 delete pkt;
547 g_system_ptr->m_cache_recorder->enqueueNextFetchRequest();
548 } else if (g_system_ptr->m_cooldown_enabled) {
549 delete pkt;
550 g_system_ptr->m_cache_recorder->enqueueNextFlushRequest();
551 } else {
552 ruby_hit_callback(pkt);
553 }
554}
555
556bool
557Sequencer::empty() const
558{
559 return m_writeRequestTable.empty() && m_readRequestTable.empty();
560}
561
562RequestStatus
563Sequencer::makeRequest(PacketPtr pkt)
564{
565 if (m_outstanding_count >= m_max_outstanding_requests) {
566 return RequestStatus_BufferFull;
567 }
568
569 RubyRequestType primary_type = RubyRequestType_NULL;
570 RubyRequestType secondary_type = RubyRequestType_NULL;
571
572 if (pkt->isLLSC()) {
573 //
574 // Alpha LL/SC instructions need to be handled carefully by the cache
575 // coherence protocol to ensure they follow the proper semantics. In
576 // particular, by identifying the operations as atomic, the protocol
577 // should understand that migratory sharing optimizations should not
578 // be performed (i.e. a load between the LL and SC should not steal
579 // away exclusive permission).
580 //
581 if (pkt->isWrite()) {
582 DPRINTF(RubySequencer, "Issuing SC\n");
583 primary_type = RubyRequestType_Store_Conditional;
584 } else {
585 DPRINTF(RubySequencer, "Issuing LL\n");
586 assert(pkt->isRead());
587 primary_type = RubyRequestType_Load_Linked;
588 }
589 secondary_type = RubyRequestType_ATOMIC;
590 } else if (pkt->req->isLocked()) {
591 //
592 // x86 locked instructions are translated to store cache coherence
593 // requests because these requests should always be treated as read
594 // exclusive operations and should leverage any migratory sharing
595 // optimization built into the protocol.
596 //
597 if (pkt->isWrite()) {
598 DPRINTF(RubySequencer, "Issuing Locked RMW Write\n");
599 primary_type = RubyRequestType_Locked_RMW_Write;
600 } else {
601 DPRINTF(RubySequencer, "Issuing Locked RMW Read\n");
602 assert(pkt->isRead());
603 primary_type = RubyRequestType_Locked_RMW_Read;
604 }
605 secondary_type = RubyRequestType_ST;
606 } else {
607 if (pkt->isRead()) {
608 if (pkt->req->isInstFetch()) {
609 primary_type = secondary_type = RubyRequestType_IFETCH;
610 } else {
611#if THE_ISA == X86_ISA
612 uint32_t flags = pkt->req->getFlags();
613 bool storeCheck = flags &
614 (TheISA::StoreCheck << TheISA::FlagShift);
615#else
616 bool storeCheck = false;
617#endif // X86_ISA
618 if (storeCheck) {
619 primary_type = RubyRequestType_RMW_Read;
620 secondary_type = RubyRequestType_ST;
621 } else {
622 primary_type = secondary_type = RubyRequestType_LD;
623 }
624 }
625 } else if (pkt->isWrite()) {
626 //
627 // Note: M5 packets do not differentiate ST from RMW_Write
628 //
629 primary_type = secondary_type = RubyRequestType_ST;
630 } else if (pkt->isFlush()) {
631 primary_type = secondary_type = RubyRequestType_FLUSH;
632 } else {
633 panic("Unsupported ruby packet type\n");
634 }
635 }
636
637 RequestStatus status = insertRequest(pkt, primary_type);
638 if (status != RequestStatus_Ready)
639 return status;
640
641 issueRequest(pkt, secondary_type);
642
643 // TODO: issue hardware prefetches here
644 return RequestStatus_Issued;
645}
646
647void
648Sequencer::issueRequest(PacketPtr pkt, RubyRequestType secondary_type)
649{
650 int proc_id = -1;
651 if (pkt != NULL && pkt->req->hasContextId()) {
652 proc_id = pkt->req->contextId();
653 }
654
655 // If valid, copy the pc to the ruby request
656 Addr pc = 0;
657 if (pkt->req->hasPC()) {
658 pc = pkt->req->getPC();
659 }
660
661 RubyRequest *msg = new RubyRequest(pkt->getAddr(),
662 pkt->getPtr<uint8_t>(true),
663 pkt->getSize(), pc, secondary_type,
664 RubyAccessMode_Supervisor, pkt,
665 PrefetchBit_No, proc_id);
666
667 DPRINTFR(ProtocolTrace, "%15s %3s %10s%20s %6s>%-6s %s %s\n",
668 curTick(), m_version, "Seq", "Begin", "", "",
669 msg->getPhysicalAddress(),
670 RubyRequestType_to_string(secondary_type));
671
672 Time latency = 0; // initialzed to an null value
673
674 if (secondary_type == RubyRequestType_IFETCH)
675 latency = m_instCache_ptr->getLatency();
676 else
677 latency = m_dataCache_ptr->getLatency();
678
679 // Send the message to the cache controller
680 assert(latency > 0);
681
682 assert(m_mandatory_q_ptr != NULL);
683 m_mandatory_q_ptr->enqueue(msg, latency);
684}
685
686template <class KEY, class VALUE>
687std::ostream &
688operator<<(ostream &out, const m5::hash_map<KEY, VALUE> &map)
689{
690 typename m5::hash_map<KEY, VALUE>::const_iterator i = map.begin();
691 typename m5::hash_map<KEY, VALUE>::const_iterator end = map.end();
692
693 out << "[";
694 for (; i != end; ++i)
695 out << " " << i->first << "=" << i->second;
696 out << " ]";
697
698 return out;
699}
700
701void
702Sequencer::print(ostream& out) const
703{
704 out << "[Sequencer: " << m_version
705 << ", outstanding requests: " << m_outstanding_count
706 << ", read request table: " << m_readRequestTable
707 << ", write request table: " << m_writeRequestTable
708 << "]";
709}
710
711// this can be called from setState whenever coherence permissions are
712// upgraded when invoked, coherence violations will be checked for the
713// given block
714void
715Sequencer::checkCoherence(const Address& addr)
716{
717#ifdef CHECK_COHERENCE
718 g_system_ptr->checkGlobalCoherenceInvariant(addr);
719#endif
720}
721
722void
723Sequencer::recordRequestType(SequencerRequestType requestType) {
724 DPRINTF(RubyStats, "Recorded statistic: %s\n",
725 SequencerRequestType_to_string(requestType));
726}
727
728
729void
730Sequencer::evictionCallback(const Address& address)
731{
732 ruby_eviction_callback(address);
733}
|