GarnetSyntheticTraffic.hh revision 12129 
1720SN/A/*
21762SN/A * Copyright (c) 2016 Georgia Institute of Technology
3720SN/A * All rights reserved.
4720SN/A *
5720SN/A * Redistribution and use in source and binary forms, with or without
6720SN/A * modification, are permitted provided that the following conditions are
7720SN/A * met: redistributions of source code must retain the above copyright
8720SN/A * notice, this list of conditions and the following disclaimer;
9720SN/A * redistributions in binary form must reproduce the above copyright
10720SN/A * notice, this list of conditions and the following disclaimer in the
11720SN/A * documentation and/or other materials provided with the distribution;
12720SN/A * neither the name of the copyright holders nor the names of its
13720SN/A * contributors may be used to endorse or promote products derived from
14720SN/A * this software without specific prior written permission.
15720SN/A *
16720SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17720SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18720SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19720SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20720SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21720SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22720SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23720SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24720SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25720SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26720SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
272665Ssaidi@eecs.umich.edu *
282665Ssaidi@eecs.umich.edu * Authors: Tushar Krishna
292665Ssaidi@eecs.umich.edu */
30720SN/A
31720SN/A#ifndef __CPU_GARNET_SYNTHETIC_TRAFFIC_HH__
323566Sgblack@eecs.umich.edu#define __CPU_GARNET_SYNTHETIC_TRAFFIC_HH__
337693SAli.Saidi@ARM.com
343549Sgblack@eecs.umich.edu#include <set>
356658Snate@binkert.org
362683Sktlim@umich.edu#include "base/statistics.hh"
372518SN/A#include "mem/mem_object.hh"
38720SN/A#include "mem/port.hh"
392107SN/A#include "params/GarnetSyntheticTraffic.hh"
402107SN/A#include "sim/eventq.hh"
41720SN/A#include "sim/sim_exit.hh"
422680Sktlim@umich.edu#include "sim/sim_object.hh"
43720SN/A#include "sim/stats.hh"
447693SAli.Saidi@ARM.com
457693SAli.Saidi@ARM.comenum TrafficType {BIT_COMPLEMENT_ = 0,
46720SN/A                  BIT_REVERSE_ = 1,
477693SAli.Saidi@ARM.com                  BIT_ROTATION_ = 2,
487693SAli.Saidi@ARM.com                  NEIGHBOR_ = 3,
49720SN/A                  SHUFFLE_ = 4,
50                  TORNADO_ = 5,
51                  TRANSPOSE_ = 6,
52                  UNIFORM_RANDOM_ = 7,
53                  NUM_TRAFFIC_PATTERNS_};
54
55class Packet;
56class GarnetSyntheticTraffic : public MemObject
57{
58  public:
59    typedef GarnetSyntheticTrafficParams Params;
60    GarnetSyntheticTraffic(const Params *p);
61
62    virtual void init();
63
64    // main simulation loop (one cycle)
65    void tick();
66
67    virtual BaseMasterPort &getMasterPort(const std::string &if_name,
68                                          PortID idx = InvalidPortID);
69
70    /**
71     * Print state of address in memory system via PrintReq (for
72     * debugging).
73     */
74    void printAddr(Addr a);
75
76  protected:
77    EventFunctionWrapper tickEvent;
78
79    class CpuPort : public MasterPort
80    {
81        GarnetSyntheticTraffic *tester;
82
83      public:
84
85        CpuPort(const std::string &_name, GarnetSyntheticTraffic *_tester)
86            : MasterPort(_name, _tester), tester(_tester)
87        { }
88
89      protected:
90
91        virtual bool recvTimingResp(PacketPtr pkt);
92
93        virtual void recvReqRetry();
94    };
95
96    CpuPort cachePort;
97
98    class GarnetSyntheticTrafficSenderState : public Packet::SenderState
99    {
100      public:
101        /** Constructor. */
102        GarnetSyntheticTrafficSenderState(uint8_t *_data)
103            : data(_data)
104        { }
105
106        // Hold onto data pointer
107        uint8_t *data;
108    };
109
110    PacketPtr retryPkt;
111    unsigned size;
112    int id;
113
114    std::map<std::string, TrafficType> trafficStringToEnum;
115
116    unsigned blockSizeBits;
117
118    Tick noResponseCycles;
119
120    int numDestinations;
121    Tick simCycles;
122    int numPacketsMax;
123    int numPacketsSent;
124    int singleSender;
125    int singleDest;
126
127    std::string trafficType; // string
128    TrafficType traffic; // enum from string
129    double injRate;
130    int injVnet;
131    int precision;
132
133    const Cycles responseLimit;
134
135    MasterID masterId;
136
137    void completeRequest(PacketPtr pkt);
138
139    void generatePkt();
140    void sendPkt(PacketPtr pkt);
141    void initTrafficType();
142
143    void doRetry();
144
145    friend class MemCompleteEvent;
146};
147
148#endif // __CPU_GARNET_SYNTHETIC_TRAFFIC_HH__
149