gem5  v19.0.0.0
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
noncoherent_xbar.cc
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2011-2015, 2018-2019 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 hereunder. 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  * Copyright (c) 2006 The Regents of The University of Michigan
15  * All rights reserved.
16  *
17  * Redistribution and use in source and binary forms, with or without
18  * modification, are permitted provided that the following conditions are
19  * met: redistributions of source code must retain the above copyright
20  * notice, this list of conditions and the following disclaimer;
21  * redistributions in binary form must reproduce the above copyright
22  * notice, this list of conditions and the following disclaimer in the
23  * documentation and/or other materials provided with the distribution;
24  * neither the name of the copyright holders nor the names of its
25  * contributors may be used to endorse or promote products derived from
26  * this software without specific prior written permission.
27  *
28  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
29  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
30  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
31  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
32  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
33  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
34  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
35  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
36  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
37  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
38  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39  *
40  * Authors: Ali Saidi
41  * Andreas Hansson
42  * William Wang
43  */
44 
50 #include "mem/noncoherent_xbar.hh"
51 
52 #include "base/logging.hh"
53 #include "base/trace.hh"
54 #include "debug/NoncoherentXBar.hh"
55 #include "debug/XBar.hh"
56 
57 NoncoherentXBar::NoncoherentXBar(const NoncoherentXBarParams *p)
58  : BaseXBar(p)
59 {
60  // create the ports based on the size of the master and slave
61  // vector ports, and the presence of the default port, the ports
62  // are enumerated starting from zero
63  for (int i = 0; i < p->port_master_connection_count; ++i) {
64  std::string portName = csprintf("%s.master[%d]", name(), i);
65  MasterPort* bp = new NoncoherentXBarMasterPort(portName, *this, i);
66  masterPorts.push_back(bp);
67  reqLayers.push_back(new ReqLayer(*bp, *this,
68  csprintf("reqLayer%d", i)));
69  }
70 
71  // see if we have a default slave device connected and if so add
72  // our corresponding master port
73  if (p->port_default_connection_count) {
74  defaultPortID = masterPorts.size();
75  std::string portName = name() + ".default";
76  MasterPort* bp = new NoncoherentXBarMasterPort(portName, *this,
78  masterPorts.push_back(bp);
79  reqLayers.push_back(new ReqLayer(*bp, *this, csprintf("reqLayer%d",
80  defaultPortID)));
81  }
82 
83  // create the slave ports, once again starting at zero
84  for (int i = 0; i < p->port_slave_connection_count; ++i) {
85  std::string portName = csprintf("%s.slave[%d]", name(), i);
86  QueuedSlavePort* bp = new NoncoherentXBarSlavePort(portName, *this, i);
87  slavePorts.push_back(bp);
88  respLayers.push_back(new RespLayer(*bp, *this,
89  csprintf("respLayer%d", i)));
90  }
91 }
92 
94 {
95  for (auto l: reqLayers)
96  delete l;
97  for (auto l: respLayers)
98  delete l;
99 }
100 
101 bool
103 {
104  // determine the source port based on the id
105  SlavePort *src_port = slavePorts[slave_port_id];
106 
107  // we should never see express snoops on a non-coherent crossbar
108  assert(!pkt->isExpressSnoop());
109 
110  // determine the destination based on the address
111  PortID master_port_id = findPort(pkt->getAddrRange());
112 
113  // test if the layer should be considered occupied for the current
114  // port
115  if (!reqLayers[master_port_id]->tryTiming(src_port)) {
116  DPRINTF(NoncoherentXBar, "recvTimingReq: src %s %s 0x%x BUSY\n",
117  src_port->name(), pkt->cmdString(), pkt->getAddr());
118  return false;
119  }
120 
121  DPRINTF(NoncoherentXBar, "recvTimingReq: src %s %s 0x%x\n",
122  src_port->name(), pkt->cmdString(), pkt->getAddr());
123 
124  // store size and command as they might be modified when
125  // forwarding the packet
126  unsigned int pkt_size = pkt->hasData() ? pkt->getSize() : 0;
127  unsigned int pkt_cmd = pkt->cmdToIndex();
128 
129  // store the old header delay so we can restore it if needed
130  Tick old_header_delay = pkt->headerDelay;
131 
132  // a request sees the frontend and forward latency
133  Tick xbar_delay = (frontendLatency + forwardLatency) * clockPeriod();
134 
135  // set the packet header and payload delay
136  calcPacketTiming(pkt, xbar_delay);
137 
138  // determine how long to be crossbar layer is busy
139  Tick packetFinishTime = clockEdge(Cycles(1)) + pkt->payloadDelay;
140 
141  // before forwarding the packet (and possibly altering it),
142  // remember if we are expecting a response
143  const bool expect_response = pkt->needsResponse() &&
144  !pkt->cacheResponding();
145 
146  // since it is a normal request, attempt to send the packet
147  bool success = masterPorts[master_port_id]->sendTimingReq(pkt);
148 
149  if (!success) {
150  DPRINTF(NoncoherentXBar, "recvTimingReq: src %s %s 0x%x RETRY\n",
151  src_port->name(), pkt->cmdString(), pkt->getAddr());
152 
153  // restore the header delay as it is additive
154  pkt->headerDelay = old_header_delay;
155 
156  // occupy until the header is sent
157  reqLayers[master_port_id]->failedTiming(src_port,
158  clockEdge(Cycles(1)));
159 
160  return false;
161  }
162 
163  // remember where to route the response to
164  if (expect_response) {
165  assert(routeTo.find(pkt->req) == routeTo.end());
166  routeTo[pkt->req] = slave_port_id;
167  }
168 
169  reqLayers[master_port_id]->succeededTiming(packetFinishTime);
170 
171  // stats updates
172  pktCount[slave_port_id][master_port_id]++;
173  pktSize[slave_port_id][master_port_id] += pkt_size;
174  transDist[pkt_cmd]++;
175 
176  return true;
177 }
178 
179 bool
181 {
182  // determine the source port based on the id
183  MasterPort *src_port = masterPorts[master_port_id];
184 
185  // determine the destination
186  const auto route_lookup = routeTo.find(pkt->req);
187  assert(route_lookup != routeTo.end());
188  const PortID slave_port_id = route_lookup->second;
189  assert(slave_port_id != InvalidPortID);
190  assert(slave_port_id < respLayers.size());
191 
192  // test if the layer should be considered occupied for the current
193  // port
194  if (!respLayers[slave_port_id]->tryTiming(src_port)) {
195  DPRINTF(NoncoherentXBar, "recvTimingResp: src %s %s 0x%x BUSY\n",
196  src_port->name(), pkt->cmdString(), pkt->getAddr());
197  return false;
198  }
199 
200  DPRINTF(NoncoherentXBar, "recvTimingResp: src %s %s 0x%x\n",
201  src_port->name(), pkt->cmdString(), pkt->getAddr());
202 
203  // store size and command as they might be modified when
204  // forwarding the packet
205  unsigned int pkt_size = pkt->hasData() ? pkt->getSize() : 0;
206  unsigned int pkt_cmd = pkt->cmdToIndex();
207 
208  // a response sees the response latency
209  Tick xbar_delay = responseLatency * clockPeriod();
210 
211  // set the packet header and payload delay
212  calcPacketTiming(pkt, xbar_delay);
213 
214  // determine how long to be crossbar layer is busy
215  Tick packetFinishTime = clockEdge(Cycles(1)) + pkt->payloadDelay;
216 
217  // send the packet through the destination slave port, and pay for
218  // any outstanding latency
219  Tick latency = pkt->headerDelay;
220  pkt->headerDelay = 0;
221  slavePorts[slave_port_id]->schedTimingResp(pkt, curTick() + latency);
222 
223  // remove the request from the routing table
224  routeTo.erase(route_lookup);
225 
226  respLayers[slave_port_id]->succeededTiming(packetFinishTime);
227 
228  // stats updates
229  pktCount[slave_port_id][master_port_id]++;
230  pktSize[slave_port_id][master_port_id] += pkt_size;
231  transDist[pkt_cmd]++;
232 
233  return true;
234 }
235 
236 void
238 {
239  // responses never block on forwarding them, so the retry will
240  // always be coming from a port to which we tried to forward a
241  // request
242  reqLayers[master_port_id]->recvRetry();
243 }
244 
245 Tick
247  MemBackdoorPtr *backdoor)
248 {
249  DPRINTF(NoncoherentXBar, "recvAtomic: packet src %s addr 0x%x cmd %s\n",
250  slavePorts[slave_port_id]->name(), pkt->getAddr(),
251  pkt->cmdString());
252 
253  unsigned int pkt_size = pkt->hasData() ? pkt->getSize() : 0;
254  unsigned int pkt_cmd = pkt->cmdToIndex();
255 
256  // determine the destination port
257  PortID master_port_id = findPort(pkt->getAddrRange());
258 
259  // stats updates for the request
260  pktCount[slave_port_id][master_port_id]++;
261  pktSize[slave_port_id][master_port_id] += pkt_size;
262  transDist[pkt_cmd]++;
263 
264  // forward the request to the appropriate destination
265  auto master = masterPorts[master_port_id];
266  Tick response_latency = backdoor ?
267  master->sendAtomicBackdoor(pkt, *backdoor) : master->sendAtomic(pkt);
268 
269  // add the response data
270  if (pkt->isResponse()) {
271  pkt_size = pkt->hasData() ? pkt->getSize() : 0;
272  pkt_cmd = pkt->cmdToIndex();
273 
274  // stats updates
275  pktCount[slave_port_id][master_port_id]++;
276  pktSize[slave_port_id][master_port_id] += pkt_size;
277  transDist[pkt_cmd]++;
278  }
279 
280  // @todo: Not setting first-word time
281  pkt->payloadDelay = response_latency;
282  return response_latency;
283 }
284 
285 void
287 {
288  if (!pkt->isPrint()) {
289  // don't do DPRINTFs on PrintReq as it clutters up the output
291  "recvFunctional: packet src %s addr 0x%x cmd %s\n",
292  slavePorts[slave_port_id]->name(), pkt->getAddr(),
293  pkt->cmdString());
294  }
295 
296  // since our slave ports are queued ports we need to check them as well
297  for (const auto& p : slavePorts) {
298  // if we find a response that has the data, then the
299  // downstream caches/memories may be out of date, so simply stop
300  // here
301  if (p->trySatisfyFunctional(pkt)) {
302  if (pkt->needsResponse())
303  pkt->makeResponse();
304  return;
305  }
306  }
307 
308  // determine the destination port
309  PortID dest_id = findPort(pkt->getAddrRange());
310 
311  // forward the request to the appropriate destination
312  masterPorts[dest_id]->sendFunctional(pkt);
313 }
314 
316 NoncoherentXBarParams::create()
317 {
318  return new NoncoherentXBar(this);
319 }
A MasterPort is a specialisation of a BaseMasterPort, which implements the default protocol for the t...
Definition: port.hh:75
#define DPRINTF(x,...)
Definition: trace.hh:229
bool isExpressSnoop() const
Definition: packet.hh:634
Cycles is a wrapper class for representing cycle counts, i.e.
Definition: types.hh:83
Declaration of the non-coherent crossbar slave port type, one will be instantiated for each of the ma...
virtual bool recvTimingResp(PacketPtr pkt, PortID master_port_id)
Bitfield< 7 > i
const PortID InvalidPortID
Definition: types.hh:238
std::vector< ReqLayer * > reqLayers
Declare the layers of this crossbar, one vector for requests and one for responses.
std::vector< RespLayer * > respLayers
PortID defaultPortID
Port that handles requests that don&#39;t match any of the interfaces.
Definition: xbar.hh:382
std::unordered_map< RequestPtr, PortID > routeTo
Remember where request packets came from so that we can route responses to the appropriate port...
Definition: xbar.hh:326
bool cacheResponding() const
Definition: packet.hh:591
const Cycles responseLatency
Definition: xbar.hh:314
A queued port is a port that has an infinite queue for outgoing packets and thus decouples the module...
Definition: qport.hh:60
A SlavePort is a specialisation of a port.
Definition: port.hh:258
Tick clockPeriod() const
NoncoherentXBar(const NoncoherentXBarParams *p)
virtual bool recvTimingReq(PacketPtr pkt, PortID slave_port_id)
The base crossbar contains the common elements of the non-coherent and coherent crossbar.
Definition: xbar.hh:73
RequestPtr req
A pointer to the original request.
Definition: packet.hh:327
void recvFunctional(PacketPtr pkt, PortID slave_port_id)
unsigned getSize() const
Definition: packet.hh:736
Tick curTick()
The current simulated tick.
Definition: core.hh:47
void recvReqRetry(PortID master_port_id)
std::string csprintf(const char *format, const Args &...args)
Definition: cprintf.hh:162
bool needsResponse() const
Definition: packet.hh:542
uint32_t headerDelay
The extra delay from seeing the packet until the header is transmitted.
Definition: packet.hh:366
uint64_t Tick
Tick count type.
Definition: types.hh:63
Stats::Vector transDist
Stats for transaction distribution and data passing through the crossbar.
Definition: xbar.hh:401
bool isResponse() const
Definition: packet.hh:532
Addr getAddr() const
Definition: packet.hh:726
AddrRange getAddrRange() const
Get address range to which this packet belongs.
Definition: packet.cc:228
bool hasData() const
Definition: packet.hh:548
void calcPacketTiming(PacketPtr pkt, Tick header_delay)
Calculate the timing parameters for the packet.
Definition: xbar.cc:103
virtual ~NoncoherentXBar()
uint32_t payloadDelay
The extra pipelining delay from seeing the packet until the end of payload is transmitted by the comp...
Definition: packet.hh:384
virtual const std::string name() const
Definition: sim_object.hh:120
A Packet is used to encapsulate a transfer between two objects in the memory system (e...
Definition: packet.hh:255
const Cycles frontendLatency
Cycles of front-end pipeline including the delay to accept the request and to decode the address...
Definition: xbar.hh:312
Tick clockEdge(Cycles cycles=Cycles(0)) const
Determine the tick when a cycle begins, by default the current one, but the argument also enables the...
A non-coherent crossbar connects a number of non-snooping masters and slaves, and routes the request ...
int cmdToIndex() const
Return the index of this command.
Definition: packet.hh:526
std::vector< MasterPort * > masterPorts
Definition: xbar.hh:379
void makeResponse()
Take a request packet and modify it in place to be suitable for returning as a response to that reque...
Definition: packet.hh:937
std::vector< QueuedSlavePort * > slavePorts
The master and slave ports of the crossbar.
Definition: xbar.hh:378
const std::string name() const
Return port name (for DPRINTF).
Definition: port.hh:106
PortID findPort(AddrRange addr_range)
Find which port connected to this crossbar (if any) should be given a packet with this address range...
Definition: xbar.cc:329
bool isPrint() const
Definition: packet.hh:556
Declaration of the crossbar master port type, one will be instantiated for each of the slave ports co...
Declaration of a non-coherent crossbar.
int16_t PortID
Port index/ID type, and a symbolic name for an invalid port id.
Definition: types.hh:237
const Cycles forwardLatency
Definition: xbar.hh:313
Tick recvAtomicBackdoor(PacketPtr pkt, PortID slave_port_id, MemBackdoorPtr *backdoor=nullptr)
const std::string & cmdString() const
Return the string name of the cmd field (for debugging and tracing).
Definition: packet.hh:523
Bitfield< 0 > p
Stats::Vector2d pktSize
Definition: xbar.hh:403
Bitfield< 5 > l
Stats::Vector2d pktCount
Definition: xbar.hh:402

Generated on Fri Feb 28 2020 16:27:02 for gem5 by doxygen 1.8.13