gem5 v24.0.0.0
Loading...
Searching...
No Matches
random_gen.cc
Go to the documentation of this file.
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
39
40#include <algorithm>
41
42#include "base/random.hh"
43#include "base/trace.hh"
44#include "debug/TrafficGen.hh"
45
46namespace gem5
47{
48
49void
51{
52 // reset the counter to zero
54}
55
58{
59 // choose if we generate a read or a write here
60 bool isRead = readPercent != 0 &&
61 (readPercent == 100 || random_mt.random(0, 100) < readPercent);
62
63 assert((readPercent == 0 && !isRead) || (readPercent == 100 && isRead) ||
64 readPercent != 100);
65
66 // address of the request
68
69 // round down to start address of block
70 addr -= addr % blocksize;
71
72 DPRINTF(TrafficGen, "RandomGen::getNextPacket: %c to addr %x, size %d\n",
73 isRead ? 'r' : 'w', addr, blocksize);
74
75 // add the amount of data manipulated to the total
77
78 // create a new request packet
79 return getPacket(addr, blocksize,
81}
82
83Tick
84RandomGen::nextPacketTick(bool elastic, Tick delay) const
85{
86 // Check to see if we have reached the data limit. If dataLimit is
87 // zero we do not have a data limit and therefore we will keep
88 // generating requests for the entire residency in this state.
90 {
91 DPRINTF(TrafficGen, "Data limit for RandomGen reached.\n");
92 // No more requests. Return MaxTick.
93 return MaxTick;
94 } else {
95 // return the time when the next request should take place
97
98 // compensate for the delay experienced to not be elastic, by
99 // default the value we generate is from the time we are
100 // asked, so the elasticity happens automatically
101 if (!elastic) {
102 if (wait < delay)
103 wait = 0;
104 else
105 wait -= delay;
106 }
107
108 return curTick() + wait;
109 }
110}
111
112} // namespace gem5
#define DPRINTF(x,...)
Definition trace.hh:210
PacketPtr getPacket(Addr addr, unsigned size, const MemCmd &cmd, Request::FlagsType flags=0)
Generate a new request and associated packet.
Definition base_gen.cc:55
A Packet is used to encapsulate a transfer between two objects in the memory system (e....
Definition packet.hh:295
PacketPtr getNextPacket()
Get the next generated packet.
Definition random_gen.cc:57
Addr dataManipulated
Counter to determine the amount of data manipulated.
Tick nextPacketTick(bool elastic, Tick delay) const
Determine the tick when the next packet is available.
Definition random_gen.cc:84
void enter()
Enter this generator state.
Definition random_gen.cc:50
const Addr startAddr
Start of address range.
Definition base_gen.hh:151
const Tick minPeriod
Request generation period.
Definition base_gen.hh:163
const Addr dataLimit
Maximum amount of data to manipulate.
Definition base_gen.hh:172
const Addr endAddr
End of address range.
Definition base_gen.hh:154
const Tick maxPeriod
Definition base_gen.hh:164
const Addr blocksize
Blocksize and address increment.
Definition base_gen.hh:157
const uint8_t readPercent
Percent of generated transactions that should be reads.
Definition base_gen.hh:169
The traffic generator is a module that generates stimuli for the memory system, based on a collection...
Random random_mt
Definition random.cc:99
std::enable_if_t< std::is_integral_v< T >, T > random()
Use the SFINAE idiom to choose an implementation based on whether the type is integral or floating po...
Definition random.hh:90
Bitfield< 3 > addr
Definition types.hh:84
Copyright (c) 2024 - Pranith Kumar Copyright (c) 2020 Inria All rights reserved.
Definition binary32.hh:36
Tick curTick()
The universal simulation clock.
Definition cur_tick.hh:46
uint64_t Addr
Address type This will probably be moved somewhere else in the near future.
Definition types.hh:147
uint64_t Tick
Tick count type.
Definition types.hh:58
const Tick MaxTick
Definition types.hh:60
Declaration of the random generator that randomly selects addresses within a range.

Generated on Tue Jun 18 2024 16:24:02 for gem5 by doxygen 1.11.0