linear_gen.cc revision 12396
1/* 2 * Copyright (c) 2012-2013, 2016-2017 ARM Limited 3 * All rights reserved 4 * 5 * The license below extends only to copyright in the software and shall 6 * not be construed as granting a license to any other intellectual 7 * property including but not limited to intellectual property relating 8 * to a hardware implementation of the functionality of the software 9 * licensed here under. You may use the software subject to the license 10 * terms below provided that you ensure that this notice is replicated 11 * unmodified and in its entirety in all distributions of the software, 12 * modified or unmodified, in source code or in binary form. 13 * 14 * Redistribution and use in source and binary forms, with or without 15 * modification, are permitted provided that the following conditions are 16 * met: redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer; 18 * redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution; 21 * neither the name of the copyright holders nor the names of its 22 * contributors may be used to endorse or promote products derived from 23 * this software without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 26 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 27 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 28 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 29 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 30 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 31 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 32 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 33 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 34 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 35 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 36 * 37 * Authors: Thomas Grass 38 * Andreas Hansson 39 * Sascha Bischoff 40 * Neha Agarwal 41 */ 42 43#include "cpu/testers/traffic_gen/linear_gen.hh" 44 45#include <algorithm> 46 47#include "base/random.hh" 48#include "base/trace.hh" 49#include "debug/TrafficGen.hh" 50#include "proto/packet.pb.h" 51 52void 53LinearGen::enter() 54{ 55 // reset the address and the data counter 56 nextAddr = startAddr; 57 dataManipulated = 0; 58} 59 60PacketPtr 61LinearGen::getNextPacket() 62{ 63 // choose if we generate a read or a write here 64 bool isRead = readPercent != 0 && 65 (readPercent == 100 || random_mt.random(0, 100) < readPercent); 66 67 assert((readPercent == 0 && !isRead) || (readPercent == 100 && isRead) || 68 readPercent != 100); 69 70 DPRINTF(TrafficGen, "LinearGen::getNextPacket: %c to addr %x, size %d\n", 71 isRead ? 'r' : 'w', nextAddr, blocksize); 72 73 // Add the amount of data manipulated to the total 74 dataManipulated += blocksize; 75 76 PacketPtr pkt = getPacket(nextAddr, blocksize, 77 isRead ? MemCmd::ReadReq : MemCmd::WriteReq); 78 79 // increment the address 80 nextAddr += blocksize; 81 82 // If we have reached the end of the address space, reset the 83 // address to the start of the range 84 if (nextAddr > endAddr) { 85 DPRINTF(TrafficGen, "Wrapping address to the start of " 86 "the range\n"); 87 nextAddr = startAddr; 88 } 89 90 return pkt; 91} 92 93Tick 94LinearGen::nextPacketTick(bool elastic, Tick delay) const 95{ 96 // Check to see if we have reached the data limit. If dataLimit is 97 // zero we do not have a data limit and therefore we will keep 98 // generating requests for the entire residency in this state. 99 if (dataLimit && dataManipulated >= dataLimit) { 100 DPRINTF(TrafficGen, "Data limit for LinearGen reached.\n"); 101 // there are no more requests, therefore return MaxTick 102 return MaxTick; 103 } else { 104 // return the time when the next request should take place 105 Tick wait = random_mt.random(minPeriod, maxPeriod); 106 107 // compensate for the delay experienced to not be elastic, by 108 // default the value we generate is from the time we are 109 // asked, so the elasticity happens automatically 110 if (!elastic) { 111 if (wait < delay) 112 wait = 0; 113 else 114 wait -= delay; 115 } 116 117 return curTick() + wait; 118 } 119} 120