2013-04-22 19:20:33 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2012-2013 ARM Limited
|
|
|
|
* All rights reserved
|
|
|
|
*
|
|
|
|
* The license below extends only to copyright in the software and shall
|
|
|
|
* not be construed as granting a license to any other intellectual
|
|
|
|
* property including but not limited to intellectual property relating
|
|
|
|
* to a hardware implementation of the functionality of the software
|
|
|
|
* licensed hereunder. You may use the software subject to the license
|
|
|
|
* terms below provided that you ensure that this notice is replicated
|
|
|
|
* unmodified and in its entirety in all distributions of the software,
|
|
|
|
* modified or unmodified, in source code or in binary form.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* Authors: Thomas Grass
|
|
|
|
* Andreas Hansson
|
|
|
|
* Sascha Bischoff
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "base/random.hh"
|
2013-05-30 18:54:04 +02:00
|
|
|
#include "base/trace.hh"
|
2013-04-22 19:20:33 +02:00
|
|
|
#include "cpu/testers/traffic_gen/generators.hh"
|
|
|
|
#include "debug/TrafficGen.hh"
|
|
|
|
#include "proto/packet.pb.h"
|
|
|
|
|
2013-05-30 18:54:04 +02:00
|
|
|
BaseGen::BaseGen(const std::string& _name, MasterID master_id, Tick _duration)
|
|
|
|
: _name(_name), masterID(master_id), duration(_duration)
|
2013-04-22 19:20:33 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2013-05-30 18:54:04 +02:00
|
|
|
PacketPtr
|
|
|
|
BaseGen::getPacket(Addr addr, unsigned size, const MemCmd& cmd,
|
|
|
|
Request::FlagsType flags)
|
2013-04-22 19:20:33 +02:00
|
|
|
{
|
|
|
|
// Create new request
|
|
|
|
Request *req = new Request(addr, size, flags, masterID);
|
|
|
|
|
|
|
|
// Embed it in a packet
|
|
|
|
PacketPtr pkt = new Packet(req, cmd);
|
|
|
|
|
|
|
|
uint8_t* pkt_data = new uint8_t[req->getSize()];
|
|
|
|
pkt->dataDynamicArray(pkt_data);
|
|
|
|
|
|
|
|
if (cmd.isWrite()) {
|
|
|
|
memset(pkt_data, 0xA, req->getSize());
|
|
|
|
}
|
|
|
|
|
2013-05-30 18:54:04 +02:00
|
|
|
return pkt;
|
2013-04-22 19:20:33 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
LinearGen::enter()
|
|
|
|
{
|
|
|
|
// reset the address and the data counter
|
|
|
|
nextAddr = startAddr;
|
|
|
|
dataManipulated = 0;
|
|
|
|
}
|
|
|
|
|
2013-05-30 18:54:04 +02:00
|
|
|
PacketPtr
|
|
|
|
LinearGen::getNextPacket()
|
2013-04-22 19:20:33 +02:00
|
|
|
{
|
|
|
|
// choose if we generate a read or a write here
|
|
|
|
bool isRead = readPercent != 0 &&
|
|
|
|
(readPercent == 100 || random_mt.random<uint8_t>(0, 100) < readPercent);
|
|
|
|
|
|
|
|
assert((readPercent == 0 && !isRead) || (readPercent == 100 && isRead) ||
|
|
|
|
readPercent != 100);
|
|
|
|
|
2013-05-30 18:54:04 +02:00
|
|
|
DPRINTF(TrafficGen, "LinearGen::getNextPacket: %c to addr %x, size %d\n",
|
2013-04-22 19:20:33 +02:00
|
|
|
isRead ? 'r' : 'w', nextAddr, blocksize);
|
|
|
|
|
2013-05-30 18:54:04 +02:00
|
|
|
// Add the amount of data manipulated to the total
|
|
|
|
dataManipulated += blocksize;
|
|
|
|
|
|
|
|
PacketPtr pkt = getPacket(nextAddr, blocksize,
|
|
|
|
isRead ? MemCmd::ReadReq : MemCmd::WriteReq);
|
2013-04-22 19:20:33 +02:00
|
|
|
|
|
|
|
// increment the address
|
|
|
|
nextAddr += blocksize;
|
|
|
|
|
|
|
|
// If we have reached the end of the address space, reset the
|
|
|
|
// address to the start of the range
|
2013-05-30 18:54:05 +02:00
|
|
|
if (nextAddr > endAddr) {
|
2013-04-22 19:20:33 +02:00
|
|
|
DPRINTF(TrafficGen, "Wrapping address to the start of "
|
|
|
|
"the range\n");
|
|
|
|
nextAddr = startAddr;
|
|
|
|
}
|
|
|
|
|
2013-05-30 18:54:05 +02:00
|
|
|
return pkt;
|
|
|
|
}
|
|
|
|
|
|
|
|
Tick
|
2013-05-30 18:54:06 +02:00
|
|
|
LinearGen::nextPacketTick(bool elastic, Tick delay) const
|
2013-05-30 18:54:05 +02:00
|
|
|
{
|
2013-04-22 19:20:33 +02:00
|
|
|
// Check to see if we have reached the data limit. If dataLimit is
|
|
|
|
// zero we do not have a data limit and therefore we will keep
|
|
|
|
// generating requests for the entire residency in this state.
|
|
|
|
if (dataLimit && dataManipulated >= dataLimit) {
|
|
|
|
DPRINTF(TrafficGen, "Data limit for LinearGen reached.\n");
|
|
|
|
// there are no more requests, therefore return MaxTick
|
|
|
|
return MaxTick;
|
|
|
|
} else {
|
|
|
|
// return the time when the next request should take place
|
2013-05-30 18:54:06 +02:00
|
|
|
Tick wait = random_mt.random<Tick>(minPeriod, maxPeriod);
|
|
|
|
|
|
|
|
// compensate for the delay experienced to not be elastic, by
|
|
|
|
// default the value we generate is from the time we are
|
|
|
|
// asked, so the elasticity happens automatically
|
|
|
|
if (!elastic) {
|
|
|
|
if (wait < delay)
|
|
|
|
wait = 0;
|
|
|
|
else
|
|
|
|
wait -= delay;
|
|
|
|
}
|
|
|
|
|
|
|
|
return curTick() + wait;
|
2013-04-22 19:20:33 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
RandomGen::enter()
|
|
|
|
{
|
|
|
|
// reset the counter to zero
|
|
|
|
dataManipulated = 0;
|
|
|
|
}
|
|
|
|
|
2013-05-30 18:54:04 +02:00
|
|
|
PacketPtr
|
|
|
|
RandomGen::getNextPacket()
|
2013-04-22 19:20:33 +02:00
|
|
|
{
|
|
|
|
// choose if we generate a read or a write here
|
|
|
|
bool isRead = readPercent != 0 &&
|
|
|
|
(readPercent == 100 || random_mt.random<uint8_t>(0, 100) < readPercent);
|
|
|
|
|
|
|
|
assert((readPercent == 0 && !isRead) || (readPercent == 100 && isRead) ||
|
|
|
|
readPercent != 100);
|
|
|
|
|
|
|
|
// address of the request
|
|
|
|
Addr addr = random_mt.random<Addr>(startAddr, endAddr - 1);
|
|
|
|
|
|
|
|
// round down to start address of block
|
|
|
|
addr -= addr % blocksize;
|
|
|
|
|
2013-05-30 18:54:04 +02:00
|
|
|
DPRINTF(TrafficGen, "RandomGen::getNextPacket: %c to addr %x, size %d\n",
|
2013-04-22 19:20:33 +02:00
|
|
|
isRead ? 'r' : 'w', addr, blocksize);
|
|
|
|
|
2013-05-30 18:54:04 +02:00
|
|
|
// add the amount of data manipulated to the total
|
2013-04-22 19:20:33 +02:00
|
|
|
dataManipulated += blocksize;
|
2013-05-30 18:54:04 +02:00
|
|
|
|
|
|
|
// create a new request packet
|
|
|
|
return getPacket(addr, blocksize,
|
|
|
|
isRead ? MemCmd::ReadReq : MemCmd::WriteReq);
|
2013-04-22 19:20:33 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
Tick
|
2013-05-30 18:54:06 +02:00
|
|
|
RandomGen::nextPacketTick(bool elastic, Tick delay) const
|
2013-04-22 19:20:33 +02:00
|
|
|
{
|
|
|
|
// Check to see if we have reached the data limit. If dataLimit is
|
|
|
|
// zero we do not have a data limit and therefore we will keep
|
|
|
|
// generating requests for the entire residency in this state.
|
|
|
|
if (dataLimit && dataManipulated >= dataLimit)
|
|
|
|
{
|
|
|
|
DPRINTF(TrafficGen, "Data limit for RandomGen reached.\n");
|
|
|
|
// No more requests. Return MaxTick.
|
|
|
|
return MaxTick;
|
|
|
|
} else {
|
2013-05-30 18:54:06 +02:00
|
|
|
// return the time when the next request should take place
|
|
|
|
Tick wait = random_mt.random<Tick>(minPeriod, maxPeriod);
|
|
|
|
|
|
|
|
// compensate for the delay experienced to not be elastic, by
|
|
|
|
// default the value we generate is from the time we are
|
|
|
|
// asked, so the elasticity happens automatically
|
|
|
|
if (!elastic) {
|
|
|
|
if (wait < delay)
|
|
|
|
wait = 0;
|
|
|
|
else
|
|
|
|
wait -= delay;
|
|
|
|
}
|
|
|
|
|
|
|
|
return curTick() + wait;
|
2013-04-22 19:20:33 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
TraceGen::InputStream::InputStream(const std::string& filename)
|
|
|
|
: trace(filename)
|
2013-08-19 09:52:32 +02:00
|
|
|
{
|
|
|
|
init();
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TraceGen::InputStream::init()
|
2013-04-22 19:20:33 +02:00
|
|
|
{
|
|
|
|
// Create a protobuf message for the header and read it from the stream
|
|
|
|
Message::PacketHeader header_msg;
|
|
|
|
if (!trace.read(header_msg)) {
|
2013-08-19 09:52:32 +02:00
|
|
|
panic("Failed to read packet header from trace\n");
|
2013-04-22 19:20:33 +02:00
|
|
|
|
|
|
|
if (header_msg.tick_freq() != SimClock::Frequency) {
|
2013-08-19 09:52:32 +02:00
|
|
|
panic("Trace was recorded with a different tick frequency %d\n",
|
2013-04-22 19:20:33 +02:00
|
|
|
header_msg.tick_freq());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TraceGen::InputStream::reset()
|
|
|
|
{
|
|
|
|
trace.reset();
|
2013-08-19 09:52:32 +02:00
|
|
|
init();
|
2013-04-22 19:20:33 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
TraceGen::InputStream::read(TraceElement& element)
|
|
|
|
{
|
|
|
|
Message::Packet pkt_msg;
|
|
|
|
if (trace.read(pkt_msg)) {
|
|
|
|
element.cmd = pkt_msg.cmd();
|
|
|
|
element.addr = pkt_msg.addr();
|
|
|
|
element.blocksize = pkt_msg.size();
|
|
|
|
element.tick = pkt_msg.tick();
|
2013-04-23 11:07:10 +02:00
|
|
|
element.flags = pkt_msg.has_flags() ? pkt_msg.flags() : 0;
|
2013-04-22 19:20:33 +02:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// We have reached the end of the file
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
Tick
|
2013-05-30 18:54:06 +02:00
|
|
|
TraceGen::nextPacketTick(bool elastic, Tick delay) const
|
2013-05-30 18:54:05 +02:00
|
|
|
{
|
|
|
|
if (traceComplete) {
|
|
|
|
DPRINTF(TrafficGen, "No next tick as trace is finished\n");
|
2013-04-22 19:20:33 +02:00
|
|
|
// We are at the end of the file, thus we have no more data in
|
|
|
|
// the trace Return MaxTick to signal that there will be no
|
|
|
|
// more transactions in this active period for the state.
|
|
|
|
return MaxTick;
|
|
|
|
}
|
|
|
|
|
2013-05-30 18:54:05 +02:00
|
|
|
assert(nextElement.isValid());
|
|
|
|
|
|
|
|
DPRINTF(TrafficGen, "Next packet tick is %d\n", tickOffset +
|
2013-04-22 19:20:33 +02:00
|
|
|
nextElement.tick);
|
|
|
|
|
2013-05-30 18:54:06 +02:00
|
|
|
// if the playback is supposed to be elastic, add the delay
|
|
|
|
if (elastic)
|
|
|
|
tickOffset += delay;
|
|
|
|
|
|
|
|
return std::max(tickOffset + nextElement.tick, curTick());
|
2013-04-22 19:20:33 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TraceGen::enter()
|
|
|
|
{
|
|
|
|
// update the trace offset to the time where the state was entered.
|
|
|
|
tickOffset = curTick();
|
|
|
|
|
|
|
|
// clear everything
|
|
|
|
currElement.clear();
|
|
|
|
|
2013-05-30 18:54:05 +02:00
|
|
|
// read the first element in the file and set the complete flag
|
|
|
|
traceComplete = !trace.read(nextElement);
|
2013-04-22 19:20:33 +02:00
|
|
|
}
|
|
|
|
|
2013-05-30 18:54:04 +02:00
|
|
|
PacketPtr
|
|
|
|
TraceGen::getNextPacket()
|
2013-04-22 19:20:33 +02:00
|
|
|
{
|
2013-05-30 18:54:05 +02:00
|
|
|
// shift things one step forward
|
|
|
|
currElement = nextElement;
|
|
|
|
nextElement.clear();
|
|
|
|
|
|
|
|
// read the next element and set the complete flag
|
|
|
|
traceComplete = !trace.read(nextElement);
|
|
|
|
|
|
|
|
// it is the responsibility of the traceComplete flag to ensure we
|
|
|
|
// always have a valid element here
|
2013-04-22 19:20:33 +02:00
|
|
|
assert(currElement.isValid());
|
|
|
|
|
2013-05-30 18:54:04 +02:00
|
|
|
DPRINTF(TrafficGen, "TraceGen::getNextPacket: %c %d %d %d 0x%x\n",
|
2013-04-22 19:20:33 +02:00
|
|
|
currElement.cmd.isRead() ? 'r' : 'w',
|
|
|
|
currElement.addr,
|
|
|
|
currElement.blocksize,
|
2013-04-22 19:20:33 +02:00
|
|
|
currElement.tick,
|
|
|
|
currElement.flags);
|
2013-04-22 19:20:33 +02:00
|
|
|
|
2013-05-30 18:54:05 +02:00
|
|
|
PacketPtr pkt = getPacket(currElement.addr + addrOffset,
|
|
|
|
currElement.blocksize,
|
|
|
|
currElement.cmd, currElement.flags);
|
|
|
|
|
|
|
|
if (!traceComplete)
|
|
|
|
DPRINTF(TrafficGen, "nextElement: %c addr %d size %d tick %d (%d)\n",
|
|
|
|
nextElement.cmd.isRead() ? 'r' : 'w',
|
|
|
|
nextElement.addr,
|
|
|
|
nextElement.blocksize,
|
|
|
|
nextElement.tick + tickOffset,
|
|
|
|
nextElement.tick);
|
|
|
|
|
|
|
|
return pkt;
|
2013-04-22 19:20:33 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TraceGen::exit()
|
|
|
|
{
|
|
|
|
// Check if we reached the end of the trace file. If we did not
|
|
|
|
// then we want to generate a warning stating that not the entire
|
|
|
|
// trace was played.
|
|
|
|
if (!traceComplete) {
|
|
|
|
warn("Trace player %s was unable to replay the entire trace!\n",
|
|
|
|
name());
|
|
|
|
}
|
|
|
|
|
|
|
|
// Clear any flags and start over again from the beginning of the
|
|
|
|
// file
|
|
|
|
trace.reset();
|
|
|
|
}
|