fc09bc8678
This patch adds an optional request elasticity to the traffic generator, effectievly compensating for it in the case of the linear and random generators, and adding it in the case of the trace generator. The accounting is left with the top-level traffic generator, and the individual generators do the necessary math as part of determining the next packet tick. Note that in the linear and random generators we have to compensate for the blocked time to not be elastic, i.e. without this patch the aforementioned generators will slow down in the case of back-pressure.
330 lines
10 KiB
C++
330 lines
10 KiB
C++
/*
|
|
* 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"
|
|
#include "base/trace.hh"
|
|
#include "cpu/testers/traffic_gen/generators.hh"
|
|
#include "debug/TrafficGen.hh"
|
|
#include "proto/packet.pb.h"
|
|
|
|
BaseGen::BaseGen(const std::string& _name, MasterID master_id, Tick _duration)
|
|
: _name(_name), masterID(master_id), duration(_duration)
|
|
{
|
|
}
|
|
|
|
PacketPtr
|
|
BaseGen::getPacket(Addr addr, unsigned size, const MemCmd& cmd,
|
|
Request::FlagsType flags)
|
|
{
|
|
// 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());
|
|
}
|
|
|
|
return pkt;
|
|
}
|
|
|
|
void
|
|
LinearGen::enter()
|
|
{
|
|
// reset the address and the data counter
|
|
nextAddr = startAddr;
|
|
dataManipulated = 0;
|
|
}
|
|
|
|
PacketPtr
|
|
LinearGen::getNextPacket()
|
|
{
|
|
// 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);
|
|
|
|
DPRINTF(TrafficGen, "LinearGen::getNextPacket: %c to addr %x, size %d\n",
|
|
isRead ? 'r' : 'w', nextAddr, blocksize);
|
|
|
|
// Add the amount of data manipulated to the total
|
|
dataManipulated += blocksize;
|
|
|
|
PacketPtr pkt = getPacket(nextAddr, blocksize,
|
|
isRead ? MemCmd::ReadReq : MemCmd::WriteReq);
|
|
|
|
// increment the address
|
|
nextAddr += blocksize;
|
|
|
|
// If we have reached the end of the address space, reset the
|
|
// address to the start of the range
|
|
if (nextAddr > endAddr) {
|
|
DPRINTF(TrafficGen, "Wrapping address to the start of "
|
|
"the range\n");
|
|
nextAddr = startAddr;
|
|
}
|
|
|
|
return pkt;
|
|
}
|
|
|
|
Tick
|
|
LinearGen::nextPacketTick(bool elastic, Tick delay) const
|
|
{
|
|
// 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
|
|
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;
|
|
}
|
|
}
|
|
|
|
void
|
|
RandomGen::enter()
|
|
{
|
|
// reset the counter to zero
|
|
dataManipulated = 0;
|
|
}
|
|
|
|
PacketPtr
|
|
RandomGen::getNextPacket()
|
|
{
|
|
// 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;
|
|
|
|
DPRINTF(TrafficGen, "RandomGen::getNextPacket: %c to addr %x, size %d\n",
|
|
isRead ? 'r' : 'w', addr, blocksize);
|
|
|
|
// add the amount of data manipulated to the total
|
|
dataManipulated += blocksize;
|
|
|
|
// create a new request packet
|
|
return getPacket(addr, blocksize,
|
|
isRead ? MemCmd::ReadReq : MemCmd::WriteReq);
|
|
}
|
|
|
|
Tick
|
|
RandomGen::nextPacketTick(bool elastic, Tick delay) const
|
|
{
|
|
// 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 {
|
|
// 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;
|
|
}
|
|
}
|
|
|
|
TraceGen::InputStream::InputStream(const std::string& filename)
|
|
: trace(filename)
|
|
{
|
|
// Create a protobuf message for the header and read it from the stream
|
|
Message::PacketHeader header_msg;
|
|
if (!trace.read(header_msg)) {
|
|
panic("Failed to read packet header from %s\n", filename);
|
|
|
|
if (header_msg.tick_freq() != SimClock::Frequency) {
|
|
panic("Trace %s was recorded with a different tick frequency %d\n",
|
|
header_msg.tick_freq());
|
|
}
|
|
}
|
|
}
|
|
|
|
void
|
|
TraceGen::InputStream::reset()
|
|
{
|
|
trace.reset();
|
|
}
|
|
|
|
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();
|
|
element.flags = pkt_msg.has_flags() ? pkt_msg.flags() : 0;
|
|
return true;
|
|
}
|
|
|
|
// We have reached the end of the file
|
|
return false;
|
|
}
|
|
|
|
Tick
|
|
TraceGen::nextPacketTick(bool elastic, Tick delay) const
|
|
{
|
|
if (traceComplete) {
|
|
DPRINTF(TrafficGen, "No next tick as trace is finished\n");
|
|
// 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;
|
|
}
|
|
|
|
assert(nextElement.isValid());
|
|
|
|
DPRINTF(TrafficGen, "Next packet tick is %d\n", tickOffset +
|
|
nextElement.tick);
|
|
|
|
// if the playback is supposed to be elastic, add the delay
|
|
if (elastic)
|
|
tickOffset += delay;
|
|
|
|
return std::max(tickOffset + nextElement.tick, curTick());
|
|
}
|
|
|
|
void
|
|
TraceGen::enter()
|
|
{
|
|
// update the trace offset to the time where the state was entered.
|
|
tickOffset = curTick();
|
|
|
|
// clear everything
|
|
currElement.clear();
|
|
|
|
// read the first element in the file and set the complete flag
|
|
traceComplete = !trace.read(nextElement);
|
|
}
|
|
|
|
PacketPtr
|
|
TraceGen::getNextPacket()
|
|
{
|
|
// 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
|
|
assert(currElement.isValid());
|
|
|
|
DPRINTF(TrafficGen, "TraceGen::getNextPacket: %c %d %d %d 0x%x\n",
|
|
currElement.cmd.isRead() ? 'r' : 'w',
|
|
currElement.addr,
|
|
currElement.blocksize,
|
|
currElement.tick,
|
|
currElement.flags);
|
|
|
|
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;
|
|
}
|
|
|
|
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();
|
|
}
|