2009-05-11 19:38:43 +02:00
|
|
|
/*
|
2012-01-11 20:29:15 +01:00
|
|
|
* Copyright (c) 1999-2012 Mark D. Hill and David A. Wood
|
|
|
|
* Copyright (c) 2010 Advanced Micro Devices, Inc.
|
2009-05-11 19:38:43 +02:00
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2012-01-11 20:29:15 +01:00
|
|
|
#include "debug/RubyCacheTrace.hh"
|
2009-05-11 19:38:45 +02:00
|
|
|
#include "mem/ruby/recorder/CacheRecorder.hh"
|
2012-01-11 20:29:15 +01:00
|
|
|
#include "mem/ruby/system/Sequencer.hh"
|
|
|
|
#include "mem/ruby/system/System.hh"
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-04-02 20:20:32 +02:00
|
|
|
using namespace std;
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
2012-01-11 20:29:15 +01:00
|
|
|
TraceRecord::print(ostream& out) const
|
|
|
|
{
|
|
|
|
out << "[TraceRecord: Node, " << m_cntrl_id << ", "
|
|
|
|
<< m_data_address << ", " << m_pc_address << ", "
|
|
|
|
<< m_type << ", Time: " << m_time << "]";
|
|
|
|
}
|
|
|
|
|
|
|
|
CacheRecorder::CacheRecorder()
|
|
|
|
: m_uncompressed_trace(NULL),
|
2014-04-19 16:00:30 +02:00
|
|
|
m_uncompressed_trace_size(0),
|
|
|
|
m_block_size_bytes(RubySystem::getBlockSizeBytes())
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2012-01-11 20:29:15 +01:00
|
|
|
CacheRecorder::CacheRecorder(uint8_t* uncompressed_trace,
|
|
|
|
uint64_t uncompressed_trace_size,
|
2014-04-19 16:00:30 +02:00
|
|
|
std::vector<Sequencer*>& seq_map,
|
|
|
|
uint64_t block_size_bytes)
|
2012-01-11 20:29:15 +01:00
|
|
|
: m_uncompressed_trace(uncompressed_trace),
|
|
|
|
m_uncompressed_trace_size(uncompressed_trace_size),
|
|
|
|
m_seq_map(seq_map), m_bytes_read(0), m_records_read(0),
|
2014-04-19 16:00:30 +02:00
|
|
|
m_records_flushed(0), m_block_size_bytes(block_size_bytes)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2014-04-19 16:00:30 +02:00
|
|
|
if (m_uncompressed_trace != NULL) {
|
|
|
|
if (m_block_size_bytes < RubySystem::getBlockSizeBytes()) {
|
|
|
|
// Block sizes larger than when the trace was recorded are not
|
|
|
|
// supported, as we cannot reliably turn accesses to smaller blocks
|
|
|
|
// into larger ones.
|
|
|
|
panic("Recorded cache block size (%d) < current block size (%d) !!",
|
|
|
|
m_block_size_bytes, RubySystem::getBlockSizeBytes());
|
|
|
|
}
|
|
|
|
}
|
2012-01-11 20:29:15 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
CacheRecorder::~CacheRecorder()
|
|
|
|
{
|
|
|
|
if (m_uncompressed_trace != NULL) {
|
2013-04-08 03:31:15 +02:00
|
|
|
delete [] m_uncompressed_trace;
|
2012-01-11 20:29:15 +01:00
|
|
|
m_uncompressed_trace = NULL;
|
2010-04-01 01:56:45 +02:00
|
|
|
}
|
2012-01-11 20:29:15 +01:00
|
|
|
m_seq_map.clear();
|
|
|
|
}
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2012-01-11 20:29:15 +01:00
|
|
|
void
|
|
|
|
CacheRecorder::enqueueNextFlushRequest()
|
|
|
|
{
|
|
|
|
if (m_records_flushed < m_records.size()) {
|
|
|
|
TraceRecord* rec = m_records[m_records_flushed];
|
|
|
|
m_records_flushed++;
|
|
|
|
Request* req = new Request(rec->m_data_address,
|
2014-04-19 16:00:30 +02:00
|
|
|
m_block_size_bytes, 0,
|
2012-02-12 23:07:38 +01:00
|
|
|
Request::funcMasterId);
|
2012-01-11 20:29:15 +01:00
|
|
|
MemCmd::Command requestType = MemCmd::FlushReq;
|
MEM: Remove the Broadcast destination from the packet
This patch simplifies the packet by removing the broadcast flag and
instead more firmly relying on (and enforcing) the semantics of
transactions in the classic memory system, i.e. request packets are
routed from a master to a slave based on the address, and when they
are created they have neither a valid source, nor destination. On
their way to the slave, the request packet is updated with a source
field for all modules that multiplex packets from multiple master
(e.g. a bus). When a request packet is turned into a response packet
(at the final slave), it moves the potentially populated source field
to the destination field, and the response packet is routed through
any multiplexing components back to the master based on the
destination field.
Modules that connect multiplexing components, such as caches and
bridges store any existing source and destination field in the sender
state as a stack (just as before).
The packet constructor is simplified in that there is no longer a need
to pass the Packet::Broadcast as the destination (this was always the
case for the classic memory system). In the case of Ruby, rather than
using the parameter to the constructor we now rely on setDest, as
there is already another three-argument constructor in the packet
class.
In many places where the packet information was printed as part of
DPRINTFs, request packets would be printed with a numeric "dest" that
would always be -1 (Broadcast) and that field is now removed from the
printing.
2012-04-14 11:45:55 +02:00
|
|
|
Packet *pkt = new Packet(req, requestType);
|
2010-06-11 08:17:07 +02:00
|
|
|
|
2012-01-11 20:29:15 +01:00
|
|
|
Sequencer* m_sequencer_ptr = m_seq_map[rec->m_cntrl_id];
|
|
|
|
assert(m_sequencer_ptr != NULL);
|
|
|
|
m_sequencer_ptr->makeRequest(pkt);
|
2010-06-11 08:17:07 +02:00
|
|
|
|
2012-01-11 20:29:15 +01:00
|
|
|
DPRINTF(RubyCacheTrace, "Flushing %s\n", *rec);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
CacheRecorder::enqueueNextFetchRequest()
|
|
|
|
{
|
|
|
|
if (m_bytes_read < m_uncompressed_trace_size) {
|
|
|
|
TraceRecord* traceRecord = (TraceRecord*) (m_uncompressed_trace +
|
|
|
|
m_bytes_read);
|
2010-06-11 08:17:07 +02:00
|
|
|
|
2012-01-11 20:29:15 +01:00
|
|
|
DPRINTF(RubyCacheTrace, "Issuing %s\n", *traceRecord);
|
|
|
|
|
2014-04-19 16:00:30 +02:00
|
|
|
for (int rec_bytes_read = 0; rec_bytes_read < m_block_size_bytes;
|
|
|
|
rec_bytes_read += RubySystem::getBlockSizeBytes()) {
|
|
|
|
Request* req = new Request();
|
|
|
|
MemCmd::Command requestType;
|
|
|
|
|
|
|
|
if (traceRecord->m_type == RubyRequestType_LD) {
|
|
|
|
requestType = MemCmd::ReadReq;
|
|
|
|
req->setPhys(traceRecord->m_data_address + rec_bytes_read,
|
|
|
|
RubySystem::getBlockSizeBytes(), 0, Request::funcMasterId);
|
|
|
|
} else if (traceRecord->m_type == RubyRequestType_IFETCH) {
|
|
|
|
requestType = MemCmd::ReadReq;
|
|
|
|
req->setPhys(traceRecord->m_data_address + rec_bytes_read,
|
|
|
|
RubySystem::getBlockSizeBytes(),
|
|
|
|
Request::INST_FETCH, Request::funcMasterId);
|
|
|
|
} else {
|
|
|
|
requestType = MemCmd::WriteReq;
|
|
|
|
req->setPhys(traceRecord->m_data_address + rec_bytes_read,
|
|
|
|
RubySystem::getBlockSizeBytes(), 0, Request::funcMasterId);
|
|
|
|
}
|
2012-01-11 20:29:15 +01:00
|
|
|
|
2014-04-19 16:00:30 +02:00
|
|
|
Packet *pkt = new Packet(req, requestType);
|
|
|
|
pkt->dataStatic(traceRecord->m_data + rec_bytes_read);
|
|
|
|
|
|
|
|
Sequencer* m_sequencer_ptr = m_seq_map[traceRecord->m_cntrl_id];
|
|
|
|
assert(m_sequencer_ptr != NULL);
|
|
|
|
m_sequencer_ptr->makeRequest(pkt);
|
|
|
|
}
|
2012-01-11 20:29:15 +01:00
|
|
|
|
2014-04-19 16:00:30 +02:00
|
|
|
m_bytes_read += (sizeof(TraceRecord) + m_block_size_bytes);
|
2012-01-11 20:29:15 +01:00
|
|
|
m_records_read++;
|
|
|
|
}
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
2012-01-11 20:29:15 +01:00
|
|
|
CacheRecorder::addRecord(int cntrl, const physical_address_t data_addr,
|
|
|
|
const physical_address_t pc_addr,
|
|
|
|
RubyRequestType type, Time time, DataBlock& data)
|
|
|
|
{
|
|
|
|
TraceRecord* rec = (TraceRecord*)malloc(sizeof(TraceRecord) +
|
2014-04-19 16:00:30 +02:00
|
|
|
m_block_size_bytes);
|
2012-01-11 20:29:15 +01:00
|
|
|
rec->m_cntrl_id = cntrl;
|
|
|
|
rec->m_time = time;
|
|
|
|
rec->m_data_address = data_addr;
|
|
|
|
rec->m_pc_address = pc_addr;
|
|
|
|
rec->m_type = type;
|
2014-04-19 16:00:30 +02:00
|
|
|
memcpy(rec->m_data, data.getData(0, m_block_size_bytes),
|
|
|
|
m_block_size_bytes);
|
2012-01-11 20:29:15 +01:00
|
|
|
|
|
|
|
m_records.push_back(rec);
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64
|
|
|
|
CacheRecorder::aggregateRecords(uint8_t** buf, uint64 total_size)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2012-01-11 20:29:15 +01:00
|
|
|
std::sort(m_records.begin(), m_records.end(), compareTraceRecords);
|
|
|
|
|
|
|
|
int size = m_records.size();
|
|
|
|
uint64 current_size = 0;
|
2014-04-19 16:00:30 +02:00
|
|
|
int record_size = sizeof(TraceRecord) + m_block_size_bytes;
|
2012-01-11 20:29:15 +01:00
|
|
|
|
|
|
|
for (int i = 0; i < size; ++i) {
|
|
|
|
// Determine if we need to expand the buffer size
|
|
|
|
if (current_size + record_size > total_size) {
|
|
|
|
uint8_t* new_buf = new (nothrow) uint8_t[total_size * 2];
|
|
|
|
if (new_buf == NULL) {
|
|
|
|
fatal("Unable to allocate buffer of size %s\n",
|
|
|
|
total_size * 2);
|
|
|
|
}
|
|
|
|
total_size = total_size * 2;
|
|
|
|
uint8_t* old_buf = *buf;
|
|
|
|
memcpy(new_buf, old_buf, current_size);
|
|
|
|
*buf = new_buf;
|
|
|
|
delete [] old_buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Copy the current record into the buffer
|
|
|
|
memcpy(&((*buf)[current_size]), m_records[i], record_size);
|
|
|
|
current_size += record_size;
|
|
|
|
|
|
|
|
free(m_records[i]);
|
|
|
|
m_records[i] = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
m_records.clear();
|
|
|
|
return current_size;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|