2 * Copyright (c) 2010-2017 ARM Limited
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.
14 * Copyright (c) 2013 Amin Farmahini-Farahani
15 * All rights reserved.
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.
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.
40 * Authors: Andreas Hansson
48 #include "mem/dram_ctrl.hh"
50 #include "base/bitfield.hh"
51 #include "base/trace.hh"
52 #include "debug/DRAM.hh"
53 #include "debug/DRAMPower.hh"
54 #include "debug/DRAMState.hh"
55 #include "debug/Drain.hh"
56 #include "sim/system.hh"
61 DRAMCtrl::DRAMCtrl(const DRAMCtrlParams
* p
) :
63 port(name() + ".port", *this), isTimingMode(false),
64 retryRdReq(false), retryWrReq(false),
67 nextReqEvent([this]{ processNextReqEvent(); }, name()),
68 respondEvent([this]{ processRespondEvent(); }, name()),
69 deviceSize(p
->device_size
),
70 deviceBusWidth(p
->device_bus_width
), burstLength(p
->burst_length
),
71 deviceRowBufferSize(p
->device_rowbuffer_size
),
72 devicesPerRank(p
->devices_per_rank
),
73 burstSize((devicesPerRank
* burstLength
* deviceBusWidth
) / 8),
74 rowBufferSize(devicesPerRank
* deviceRowBufferSize
),
75 columnsPerRowBuffer(rowBufferSize
/ burstSize
),
76 columnsPerStripe(range
.interleaved() ? range
.granularity() / burstSize
: 1),
77 ranksPerChannel(p
->ranks_per_channel
),
78 bankGroupsPerRank(p
->bank_groups_per_rank
),
79 bankGroupArch(p
->bank_groups_per_rank
> 0),
80 banksPerRank(p
->banks_per_rank
), channels(p
->channels
), rowsPerBank(0),
81 readBufferSize(p
->read_buffer_size
),
82 writeBufferSize(p
->write_buffer_size
),
83 writeHighThreshold(writeBufferSize
* p
->write_high_thresh_perc
/ 100.0),
84 writeLowThreshold(writeBufferSize
* p
->write_low_thresh_perc
/ 100.0),
85 minWritesPerSwitch(p
->min_writes_per_switch
),
86 writesThisTime(0), readsThisTime(0),
87 tCK(p
->tCK
), tWTR(p
->tWTR
), tRTW(p
->tRTW
), tCS(p
->tCS
), tBURST(p
->tBURST
),
88 tCCD_L(p
->tCCD_L
), tRCD(p
->tRCD
), tCL(p
->tCL
), tRP(p
->tRP
), tRAS(p
->tRAS
),
89 tWR(p
->tWR
), tRTP(p
->tRTP
), tRFC(p
->tRFC
), tREFI(p
->tREFI
), tRRD(p
->tRRD
),
90 tRRD_L(p
->tRRD_L
), tXAW(p
->tXAW
), tXP(p
->tXP
), tXS(p
->tXS
),
91 activationLimit(p
->activation_limit
),
92 memSchedPolicy(p
->mem_sched_policy
), addrMapping(p
->addr_mapping
),
93 pageMgmt(p
->page_policy
),
94 maxAccessesPerRow(p
->max_accesses_per_row
),
95 frontendLatency(p
->static_frontend_latency
),
96 backendLatency(p
->static_backend_latency
),
97 busBusyUntil(0), prevArrival(0),
98 nextReqTime(0), activeRank(0), timeStampOffset(0),
101 // sanity check the ranks since we rely on bit slicing for the
103 fatal_if(!isPowerOf2(ranksPerChannel
), "DRAM rank count of %d is not "
104 "allowed, must be a power of two\n", ranksPerChannel
);
106 fatal_if(!isPowerOf2(burstSize
), "DRAM burst size %d is not allowed, "
107 "must be a power of two\n", burstSize
);
109 for (int i
= 0; i
< ranksPerChannel
; i
++) {
110 Rank
* rank
= new Rank(*this, p
, i
);
111 ranks
.push_back(rank
);
114 // perform a basic check of the write thresholds
115 if (p
->write_low_thresh_perc
>= p
->write_high_thresh_perc
)
116 fatal("Write buffer low threshold %d must be smaller than the "
117 "high threshold %d\n", p
->write_low_thresh_perc
,
118 p
->write_high_thresh_perc
);
120 // determine the rows per bank by looking at the total capacity
121 uint64_t capacity
= ULL(1) << ceilLog2(AbstractMemory::size());
123 // determine the dram actual capacity from the DRAM config in Mbytes
124 uint64_t deviceCapacity
= deviceSize
/ (1024 * 1024) * devicesPerRank
*
127 // if actual DRAM size does not match memory capacity in system warn!
128 if (deviceCapacity
!= capacity
/ (1024 * 1024))
129 warn("DRAM device capacity (%d Mbytes) does not match the "
130 "address range assigned (%d Mbytes)\n", deviceCapacity
,
131 capacity
/ (1024 * 1024));
133 DPRINTF(DRAM
, "Memory capacity %lld (%lld) bytes\n", capacity
,
134 AbstractMemory::size());
136 DPRINTF(DRAM
, "Row buffer size %d bytes with %d columns per row buffer\n",
137 rowBufferSize
, columnsPerRowBuffer
);
139 rowsPerBank
= capacity
/ (rowBufferSize
* banksPerRank
* ranksPerChannel
);
141 // some basic sanity checks
142 if (tREFI
<= tRP
|| tREFI
<= tRFC
) {
143 fatal("tREFI (%d) must be larger than tRP (%d) and tRFC (%d)\n",
147 // basic bank group architecture checks ->
149 // must have at least one bank per bank group
150 if (bankGroupsPerRank
> banksPerRank
) {
151 fatal("banks per rank (%d) must be equal to or larger than "
152 "banks groups per rank (%d)\n",
153 banksPerRank
, bankGroupsPerRank
);
155 // must have same number of banks in each bank group
156 if ((banksPerRank
% bankGroupsPerRank
) != 0) {
157 fatal("Banks per rank (%d) must be evenly divisible by bank groups "
158 "per rank (%d) for equal banks per bank group\n",
159 banksPerRank
, bankGroupsPerRank
);
161 // tCCD_L should be greater than minimal, back-to-back burst delay
162 if (tCCD_L
<= tBURST
) {
163 fatal("tCCD_L (%d) should be larger than tBURST (%d) when "
164 "bank groups per rank (%d) is greater than 1\n",
165 tCCD_L
, tBURST
, bankGroupsPerRank
);
167 // tRRD_L is greater than minimal, same bank group ACT-to-ACT delay
168 // some datasheets might specify it equal to tRRD
170 fatal("tRRD_L (%d) should be larger than tRRD (%d) when "
171 "bank groups per rank (%d) is greater than 1\n",
172 tRRD_L
, tRRD
, bankGroupsPerRank
);
181 AbstractMemory::init();
183 if (!port
.isConnected()) {
184 fatal("DRAMCtrl %s is unconnected!\n", name());
186 port
.sendRangeChange();
189 // a bit of sanity checks on the interleaving, save it for here to
190 // ensure that the system pointer is initialised
191 if (range
.interleaved()) {
192 if (channels
!= range
.stripes())
193 fatal("%s has %d interleaved address stripes but %d channel(s)\n",
194 name(), range
.stripes(), channels
);
196 if (addrMapping
== Enums::RoRaBaChCo
) {
197 if (rowBufferSize
!= range
.granularity()) {
198 fatal("Channel interleaving of %s doesn't match RoRaBaChCo "
199 "address map\n", name());
201 } else if (addrMapping
== Enums::RoRaBaCoCh
||
202 addrMapping
== Enums::RoCoRaBaCh
) {
203 // for the interleavings with channel bits in the bottom,
204 // if the system uses a channel striping granularity that
205 // is larger than the DRAM burst size, then map the
206 // sequential accesses within a stripe to a number of
207 // columns in the DRAM, effectively placing some of the
208 // lower-order column bits as the least-significant bits
209 // of the address (above the ones denoting the burst size)
210 assert(columnsPerStripe
>= 1);
212 // channel striping has to be done at a granularity that
213 // is equal or larger to a cache line
214 if (system()->cacheLineSize() > range
.granularity()) {
215 fatal("Channel interleaving of %s must be at least as large "
216 "as the cache line size\n", name());
219 // ...and equal or smaller than the row-buffer size
220 if (rowBufferSize
< range
.granularity()) {
221 fatal("Channel interleaving of %s must be at most as large "
222 "as the row-buffer size\n", name());
224 // this is essentially the check above, so just to be sure
225 assert(columnsPerStripe
<= columnsPerRowBuffer
);
233 // remember the memory system mode of operation
234 isTimingMode
= system()->isTimingMode();
237 // timestamp offset should be in clock cycles for DRAMPower
238 timeStampOffset
= divCeil(curTick(), tCK
);
240 // update the start tick for the precharge accounting to the
242 for (auto r
: ranks
) {
243 r
->startup(curTick() + tREFI
- tRP
);
246 // shift the bus busy time sufficiently far ahead that we never
247 // have to worry about negative values when computing the time for
248 // the next request, this will add an insignificant bubble at the
249 // start of simulation
250 busBusyUntil
= curTick() + tRP
+ tRCD
+ tCL
;
255 DRAMCtrl::recvAtomic(PacketPtr pkt
)
257 DPRINTF(DRAM
, "recvAtomic: %s 0x%x\n", pkt
->cmdString(), pkt
->getAddr());
259 panic_if(pkt
->cacheResponding(), "Should not see packets where cache "
262 // do the actual memory access and turn the packet into a response
266 if (pkt
->hasData()) {
267 // this value is not supposed to be accurate, just enough to
268 // keep things going, mimic a closed page
269 latency
= tRP
+ tRCD
+ tCL
;
275 DRAMCtrl::readQueueFull(unsigned int neededEntries
) const
277 DPRINTF(DRAM
, "Read queue limit %d, current size %d, entries needed %d\n",
278 readBufferSize
, readQueue
.size() + respQueue
.size(),
282 (readQueue
.size() + respQueue
.size() + neededEntries
) > readBufferSize
;
286 DRAMCtrl::writeQueueFull(unsigned int neededEntries
) const
288 DPRINTF(DRAM
, "Write queue limit %d, current size %d, entries needed %d\n",
289 writeBufferSize
, writeQueue
.size(), neededEntries
);
290 return (writeQueue
.size() + neededEntries
) > writeBufferSize
;
293 DRAMCtrl::DRAMPacket
*
294 DRAMCtrl::decodeAddr(PacketPtr pkt
, Addr dramPktAddr
, unsigned size
,
297 // decode the address based on the address mapping scheme, with
298 // Ro, Ra, Co, Ba and Ch denoting row, rank, column, bank and
299 // channel, respectively
302 // use a 64-bit unsigned during the computations as the row is
303 // always the top bits, and check before creating the DRAMPacket
306 // truncate the address to a DRAM burst, which makes it unique to
307 // a specific column, row, bank, rank and channel
308 Addr addr
= dramPktAddr
/ burstSize
;
310 // we have removed the lowest order address bits that denote the
311 // position within the column
312 if (addrMapping
== Enums::RoRaBaChCo
) {
313 // the lowest order bits denote the column to ensure that
314 // sequential cache lines occupy the same row
315 addr
= addr
/ columnsPerRowBuffer
;
317 // take out the channel part of the address
318 addr
= addr
/ channels
;
320 // after the channel bits, get the bank bits to interleave
322 bank
= addr
% banksPerRank
;
323 addr
= addr
/ banksPerRank
;
325 // after the bank, we get the rank bits which thus interleaves
327 rank
= addr
% ranksPerChannel
;
328 addr
= addr
/ ranksPerChannel
;
330 // lastly, get the row bits, no need to remove them from addr
331 row
= addr
% rowsPerBank
;
332 } else if (addrMapping
== Enums::RoRaBaCoCh
) {
333 // take out the lower-order column bits
334 addr
= addr
/ columnsPerStripe
;
336 // take out the channel part of the address
337 addr
= addr
/ channels
;
339 // next, the higher-order column bites
340 addr
= addr
/ (columnsPerRowBuffer
/ columnsPerStripe
);
342 // after the column bits, we get the bank bits to interleave
344 bank
= addr
% banksPerRank
;
345 addr
= addr
/ banksPerRank
;
347 // after the bank, we get the rank bits which thus interleaves
349 rank
= addr
% ranksPerChannel
;
350 addr
= addr
/ ranksPerChannel
;
352 // lastly, get the row bits, no need to remove them from addr
353 row
= addr
% rowsPerBank
;
354 } else if (addrMapping
== Enums::RoCoRaBaCh
) {
355 // optimise for closed page mode and utilise maximum
356 // parallelism of the DRAM (at the cost of power)
358 // take out the lower-order column bits
359 addr
= addr
/ columnsPerStripe
;
361 // take out the channel part of the address, not that this has
362 // to match with how accesses are interleaved between the
363 // controllers in the address mapping
364 addr
= addr
/ channels
;
366 // start with the bank bits, as this provides the maximum
367 // opportunity for parallelism between requests
368 bank
= addr
% banksPerRank
;
369 addr
= addr
/ banksPerRank
;
371 // next get the rank bits
372 rank
= addr
% ranksPerChannel
;
373 addr
= addr
/ ranksPerChannel
;
375 // next, the higher-order column bites
376 addr
= addr
/ (columnsPerRowBuffer
/ columnsPerStripe
);
378 // lastly, get the row bits, no need to remove them from addr
379 row
= addr
% rowsPerBank
;
381 panic("Unknown address mapping policy chosen!");
383 assert(rank
< ranksPerChannel
);
384 assert(bank
< banksPerRank
);
385 assert(row
< rowsPerBank
);
386 assert(row
< Bank::NO_ROW
);
388 DPRINTF(DRAM
, "Address: %lld Rank %d Bank %d Row %d\n",
389 dramPktAddr
, rank
, bank
, row
);
391 // create the corresponding DRAM packet with the entry time and
392 // ready time set to the current tick, the latter will be updated
394 uint16_t bank_id
= banksPerRank
* rank
+ bank
;
395 return new DRAMPacket(pkt
, isRead
, rank
, bank
, row
, bank_id
, dramPktAddr
,
396 size
, ranks
[rank
]->banks
[bank
], *ranks
[rank
]);
400 DRAMCtrl::addToReadQueue(PacketPtr pkt
, unsigned int pktCount
)
402 // only add to the read queue here. whenever the request is
403 // eventually done, set the readyTime, and call schedule()
404 assert(!pkt
->isWrite());
406 assert(pktCount
!= 0);
408 // if the request size is larger than burst size, the pkt is split into
409 // multiple DRAM packets
410 // Note if the pkt starting address is not aligened to burst size, the
411 // address of first DRAM packet is kept unaliged. Subsequent DRAM packets
412 // are aligned to burst size boundaries. This is to ensure we accurately
413 // check read packets against packets in write queue.
414 Addr addr
= pkt
->getAddr();
415 unsigned pktsServicedByWrQ
= 0;
416 BurstHelper
* burst_helper
= NULL
;
417 for (int cnt
= 0; cnt
< pktCount
; ++cnt
) {
418 unsigned size
= std::min((addr
| (burstSize
- 1)) + 1,
419 pkt
->getAddr() + pkt
->getSize()) - addr
;
420 readPktSize
[ceilLog2(size
)]++;
423 // First check write buffer to see if the data is already at
425 bool foundInWrQ
= false;
426 Addr burst_addr
= burstAlign(addr
);
427 // if the burst address is not present then there is no need
428 // looking any further
429 if (isInWriteQueue
.find(burst_addr
) != isInWriteQueue
.end()) {
430 for (const auto& p
: writeQueue
) {
431 // check if the read is subsumed in the write queue
432 // packet we are looking at
433 if (p
->addr
<= addr
&& (addr
+ size
) <= (p
->addr
+ p
->size
)) {
437 DPRINTF(DRAM
, "Read to addr %lld with size %d serviced by "
438 "write queue\n", addr
, size
);
439 bytesReadWrQ
+= burstSize
;
445 // If not found in the write q, make a DRAM packet and
446 // push it onto the read queue
449 // Make the burst helper for split packets
450 if (pktCount
> 1 && burst_helper
== NULL
) {
451 DPRINTF(DRAM
, "Read to addr %lld translates to %d "
452 "dram requests\n", pkt
->getAddr(), pktCount
);
453 burst_helper
= new BurstHelper(pktCount
);
456 DRAMPacket
* dram_pkt
= decodeAddr(pkt
, addr
, size
, true);
457 dram_pkt
->burstHelper
= burst_helper
;
459 assert(!readQueueFull(1));
460 rdQLenPdf
[readQueue
.size() + respQueue
.size()]++;
462 DPRINTF(DRAM
, "Adding to read queue\n");
464 readQueue
.push_back(dram_pkt
);
466 // increment read entries of the rank
467 ++dram_pkt
->rankRef
.readEntries
;
470 avgRdQLen
= readQueue
.size() + respQueue
.size();
473 // Starting address of next dram pkt (aligend to burstSize boundary)
474 addr
= (addr
| (burstSize
- 1)) + 1;
477 // If all packets are serviced by write queue, we send the repsonse back
478 if (pktsServicedByWrQ
== pktCount
) {
479 accessAndRespond(pkt
, frontendLatency
);
483 // Update how many split packets are serviced by write queue
484 if (burst_helper
!= NULL
)
485 burst_helper
->burstsServiced
= pktsServicedByWrQ
;
487 // If we are not already scheduled to get a request out of the
489 if (!nextReqEvent
.scheduled()) {
490 DPRINTF(DRAM
, "Request scheduled immediately\n");
491 schedule(nextReqEvent
, curTick());
496 DRAMCtrl::addToWriteQueue(PacketPtr pkt
, unsigned int pktCount
)
498 // only add to the write queue here. whenever the request is
499 // eventually done, set the readyTime, and call schedule()
500 assert(pkt
->isWrite());
502 // if the request size is larger than burst size, the pkt is split into
503 // multiple DRAM packets
504 Addr addr
= pkt
->getAddr();
505 for (int cnt
= 0; cnt
< pktCount
; ++cnt
) {
506 unsigned size
= std::min((addr
| (burstSize
- 1)) + 1,
507 pkt
->getAddr() + pkt
->getSize()) - addr
;
508 writePktSize
[ceilLog2(size
)]++;
511 // see if we can merge with an existing item in the write
512 // queue and keep track of whether we have merged or not
513 bool merged
= isInWriteQueue
.find(burstAlign(addr
)) !=
514 isInWriteQueue
.end();
516 // if the item was not merged we need to create a new write
519 DRAMPacket
* dram_pkt
= decodeAddr(pkt
, addr
, size
, false);
521 assert(writeQueue
.size() < writeBufferSize
);
522 wrQLenPdf
[writeQueue
.size()]++;
524 DPRINTF(DRAM
, "Adding to write queue\n");
526 writeQueue
.push_back(dram_pkt
);
527 isInWriteQueue
.insert(burstAlign(addr
));
528 assert(writeQueue
.size() == isInWriteQueue
.size());
531 avgWrQLen
= writeQueue
.size();
533 // increment write entries of the rank
534 ++dram_pkt
->rankRef
.writeEntries
;
536 DPRINTF(DRAM
, "Merging write burst with existing queue entry\n");
538 // keep track of the fact that this burst effectively
539 // disappeared as it was merged with an existing one
543 // Starting address of next dram pkt (aligend to burstSize boundary)
544 addr
= (addr
| (burstSize
- 1)) + 1;
547 // we do not wait for the writes to be send to the actual memory,
548 // but instead take responsibility for the consistency here and
549 // snoop the write queue for any upcoming reads
550 // @todo, if a pkt size is larger than burst size, we might need a
551 // different front end latency
552 accessAndRespond(pkt
, frontendLatency
);
554 // If we are not already scheduled to get a request out of the
556 if (!nextReqEvent
.scheduled()) {
557 DPRINTF(DRAM
, "Request scheduled immediately\n");
558 schedule(nextReqEvent
, curTick());
563 DRAMCtrl::printQs() const {
564 DPRINTF(DRAM
, "===READ QUEUE===\n\n");
565 for (auto i
= readQueue
.begin() ; i
!= readQueue
.end() ; ++i
) {
566 DPRINTF(DRAM
, "Read %lu\n", (*i
)->addr
);
568 DPRINTF(DRAM
, "\n===RESP QUEUE===\n\n");
569 for (auto i
= respQueue
.begin() ; i
!= respQueue
.end() ; ++i
) {
570 DPRINTF(DRAM
, "Response %lu\n", (*i
)->addr
);
572 DPRINTF(DRAM
, "\n===WRITE QUEUE===\n\n");
573 for (auto i
= writeQueue
.begin() ; i
!= writeQueue
.end() ; ++i
) {
574 DPRINTF(DRAM
, "Write %lu\n", (*i
)->addr
);
579 DRAMCtrl::recvTimingReq(PacketPtr pkt
)
581 // This is where we enter from the outside world
582 DPRINTF(DRAM
, "recvTimingReq: request %s addr %lld size %d\n",
583 pkt
->cmdString(), pkt
->getAddr(), pkt
->getSize());
585 panic_if(pkt
->cacheResponding(), "Should not see packets where cache "
588 panic_if(!(pkt
->isRead() || pkt
->isWrite()),
589 "Should only see read and writes at memory controller\n");
591 // Calc avg gap between requests
592 if (prevArrival
!= 0) {
593 totGap
+= curTick() - prevArrival
;
595 prevArrival
= curTick();
598 // Find out how many dram packets a pkt translates to
599 // If the burst size is equal or larger than the pkt size, then a pkt
600 // translates to only one dram packet. Otherwise, a pkt translates to
601 // multiple dram packets
602 unsigned size
= pkt
->getSize();
603 unsigned offset
= pkt
->getAddr() & (burstSize
- 1);
604 unsigned int dram_pkt_count
= divCeil(offset
+ size
, burstSize
);
606 // check local buffers and do not accept if full
609 if (readQueueFull(dram_pkt_count
)) {
610 DPRINTF(DRAM
, "Read queue full, not accepting\n");
611 // remember that we have to retry this port
616 addToReadQueue(pkt
, dram_pkt_count
);
618 bytesReadSys
+= size
;
621 assert(pkt
->isWrite());
623 if (writeQueueFull(dram_pkt_count
)) {
624 DPRINTF(DRAM
, "Write queue full, not accepting\n");
625 // remember that we have to retry this port
630 addToWriteQueue(pkt
, dram_pkt_count
);
632 bytesWrittenSys
+= size
;
640 DRAMCtrl::processRespondEvent()
643 "processRespondEvent(): Some req has reached its readyTime\n");
645 DRAMPacket
* dram_pkt
= respQueue
.front();
647 // if a read has reached its ready-time, decrement the number of reads
648 // At this point the packet has been handled and there is a possibility
649 // to switch to low-power mode if no other packet is available
650 --dram_pkt
->rankRef
.readEntries
;
651 DPRINTF(DRAM
, "number of read entries for rank %d is %d\n",
652 dram_pkt
->rank
, dram_pkt
->rankRef
.readEntries
);
654 // counter should at least indicate one outstanding request
656 assert(dram_pkt
->rankRef
.outstandingEvents
> 0);
657 // read response received, decrement count
658 --dram_pkt
->rankRef
.outstandingEvents
;
660 // at this moment should not have transitioned to a low-power state
661 assert((dram_pkt
->rankRef
.pwrState
!= PWR_SREF
) &&
662 (dram_pkt
->rankRef
.pwrState
!= PWR_PRE_PDN
) &&
663 (dram_pkt
->rankRef
.pwrState
!= PWR_ACT_PDN
));
665 // track if this is the last packet before idling
666 // and that there are no outstanding commands to this rank
667 if (dram_pkt
->rankRef
.isQueueEmpty() &&
668 dram_pkt
->rankRef
.outstandingEvents
== 0) {
669 // verify that there are no events scheduled
670 assert(!dram_pkt
->rankRef
.activateEvent
.scheduled());
671 assert(!dram_pkt
->rankRef
.prechargeEvent
.scheduled());
673 // if coming from active state, schedule power event to
674 // active power-down else go to precharge power-down
675 DPRINTF(DRAMState
, "Rank %d sleep at tick %d; current power state is "
676 "%d\n", dram_pkt
->rank
, curTick(), dram_pkt
->rankRef
.pwrState
);
678 // default to ACT power-down unless already in IDLE state
679 // could be in IDLE if PRE issued before data returned
680 PowerState next_pwr_state
= PWR_ACT_PDN
;
681 if (dram_pkt
->rankRef
.pwrState
== PWR_IDLE
) {
682 next_pwr_state
= PWR_PRE_PDN
;
685 dram_pkt
->rankRef
.powerDownSleep(next_pwr_state
, curTick());
688 if (dram_pkt
->burstHelper
) {
689 // it is a split packet
690 dram_pkt
->burstHelper
->burstsServiced
++;
691 if (dram_pkt
->burstHelper
->burstsServiced
==
692 dram_pkt
->burstHelper
->burstCount
) {
693 // we have now serviced all children packets of a system packet
694 // so we can now respond to the requester
695 // @todo we probably want to have a different front end and back
696 // end latency for split packets
697 accessAndRespond(dram_pkt
->pkt
, frontendLatency
+ backendLatency
);
698 delete dram_pkt
->burstHelper
;
699 dram_pkt
->burstHelper
= NULL
;
702 // it is not a split packet
703 accessAndRespond(dram_pkt
->pkt
, frontendLatency
+ backendLatency
);
706 delete respQueue
.front();
707 respQueue
.pop_front();
709 if (!respQueue
.empty()) {
710 assert(respQueue
.front()->readyTime
>= curTick());
711 assert(!respondEvent
.scheduled());
712 schedule(respondEvent
, respQueue
.front()->readyTime
);
714 // if there is nothing left in any queue, signal a drain
715 if (drainState() == DrainState::Draining
&&
716 writeQueue
.empty() && readQueue
.empty() && allRanksDrained()) {
718 DPRINTF(Drain
, "DRAM controller done draining\n");
723 // We have made a location in the queue available at this point,
724 // so if there is a read that was forced to wait, retry now
732 DRAMCtrl::chooseNext(std::deque
<DRAMPacket
*>& queue
, Tick extra_col_delay
)
734 // This method does the arbitration between requests. The chosen
735 // packet is simply moved to the head of the queue. The other
736 // methods know that this is the place to look. For example, with
737 // FCFS, this method does nothing
738 assert(!queue
.empty());
740 // bool to indicate if a packet to an available rank is found
741 bool found_packet
= false;
742 if (queue
.size() == 1) {
743 DRAMPacket
* dram_pkt
= queue
.front();
744 // available rank corresponds to state refresh idle
745 if (ranks
[dram_pkt
->rank
]->inRefIdleState()) {
747 DPRINTF(DRAM
, "Single request, going to a free rank\n");
749 DPRINTF(DRAM
, "Single request, going to a busy rank\n");
754 if (memSchedPolicy
== Enums::fcfs
) {
755 // check if there is a packet going to a free rank
756 for (auto i
= queue
.begin(); i
!= queue
.end() ; ++i
) {
757 DRAMPacket
* dram_pkt
= *i
;
758 if (ranks
[dram_pkt
->rank
]->inRefIdleState()) {
760 queue
.push_front(dram_pkt
);
765 } else if (memSchedPolicy
== Enums::frfcfs
) {
766 found_packet
= reorderQueue(queue
, extra_col_delay
);
768 panic("No scheduling policy chosen\n");
773 DRAMCtrl::reorderQueue(std::deque
<DRAMPacket
*>& queue
, Tick extra_col_delay
)
775 // Only determine this if needed
776 uint64_t earliest_banks
= 0;
777 bool hidden_bank_prep
= false;
779 // search for seamless row hits first, if no seamless row hit is
780 // found then determine if there are other packets that can be issued
781 // without incurring additional bus delay due to bank timing
782 // Will select closed rows first to enable more open row possibilies
783 // in future selections
784 bool found_hidden_bank
= false;
786 // remember if we found a row hit, not seamless, but bank prepped
788 bool found_prepped_pkt
= false;
790 // if we have no row hit, prepped or not, and no seamless packet,
791 // just go for the earliest possible
792 bool found_earliest_pkt
= false;
794 auto selected_pkt_it
= queue
.end();
796 // time we need to issue a column command to be seamless
797 const Tick min_col_at
= std::max(busBusyUntil
- tCL
+ extra_col_delay
,
800 for (auto i
= queue
.begin(); i
!= queue
.end() ; ++i
) {
801 DRAMPacket
* dram_pkt
= *i
;
802 const Bank
& bank
= dram_pkt
->bankRef
;
804 // check if rank is not doing a refresh and thus is available, if not,
805 // jump to the next packet
806 if (dram_pkt
->rankRef
.inRefIdleState()) {
807 // check if it is a row hit
808 if (bank
.openRow
== dram_pkt
->row
) {
809 // no additional rank-to-rank or same bank-group
810 // delays, or we switched read/write and might as well
811 // go for the row hit
812 if (bank
.colAllowedAt
<= min_col_at
) {
813 // FCFS within the hits, giving priority to
814 // commands that can issue seamlessly, without
815 // additional delay, such as same rank accesses
816 // and/or different bank-group accesses
817 DPRINTF(DRAM
, "Seamless row buffer hit\n");
819 // no need to look through the remaining queue entries
821 } else if (!found_hidden_bank
&& !found_prepped_pkt
) {
822 // if we did not find a packet to a closed row that can
823 // issue the bank commands without incurring delay, and
824 // did not yet find a packet to a prepped row, remember
827 found_prepped_pkt
= true;
828 DPRINTF(DRAM
, "Prepped row buffer hit\n");
830 } else if (!found_earliest_pkt
) {
831 // if we have not initialised the bank status, do it
832 // now, and only once per scheduling decisions
833 if (earliest_banks
== 0) {
834 // determine entries with earliest bank delay
835 pair
<uint64_t, bool> bankStatus
=
836 minBankPrep(queue
, min_col_at
);
837 earliest_banks
= bankStatus
.first
;
838 hidden_bank_prep
= bankStatus
.second
;
841 // bank is amongst first available banks
842 // minBankPrep will give priority to packets that can
844 if (bits(earliest_banks
, dram_pkt
->bankId
, dram_pkt
->bankId
)) {
845 found_earliest_pkt
= true;
846 found_hidden_bank
= hidden_bank_prep
;
848 // give priority to packets that can issue
849 // bank commands 'behind the scenes'
850 // any additional delay if any will be due to
851 // col-to-col command requirements
852 if (hidden_bank_prep
|| !found_prepped_pkt
)
859 if (selected_pkt_it
!= queue
.end()) {
860 DRAMPacket
* selected_pkt
= *selected_pkt_it
;
861 queue
.erase(selected_pkt_it
);
862 queue
.push_front(selected_pkt
);
870 DRAMCtrl::accessAndRespond(PacketPtr pkt
, Tick static_latency
)
872 DPRINTF(DRAM
, "Responding to Address %lld.. ",pkt
->getAddr());
874 bool needsResponse
= pkt
->needsResponse();
875 // do the actual memory access which also turns the packet into a
879 // turn packet around to go back to requester if response expected
881 // access already turned the packet into a response
882 assert(pkt
->isResponse());
883 // response_time consumes the static latency and is charged also
884 // with headerDelay that takes into account the delay provided by
885 // the xbar and also the payloadDelay that takes into account the
886 // number of data beats.
887 Tick response_time
= curTick() + static_latency
+ pkt
->headerDelay
+
889 // Here we reset the timing of the packet before sending it out.
890 pkt
->headerDelay
= pkt
->payloadDelay
= 0;
892 // queue the packet in the response queue to be sent out after
893 // the static latency has passed
894 port
.schedTimingResp(pkt
, response_time
, true);
896 // @todo the packet is going to be deleted, and the DRAMPacket
897 // is still having a pointer to it
898 pendingDelete
.reset(pkt
);
901 DPRINTF(DRAM
, "Done\n");
907 DRAMCtrl::activateBank(Rank
& rank_ref
, Bank
& bank_ref
,
908 Tick act_tick
, uint32_t row
)
910 assert(rank_ref
.actTicks
.size() == activationLimit
);
912 DPRINTF(DRAM
, "Activate at tick %d\n", act_tick
);
914 // update the open row
915 assert(bank_ref
.openRow
== Bank::NO_ROW
);
916 bank_ref
.openRow
= row
;
918 // start counting anew, this covers both the case when we
919 // auto-precharged, and when this access is forced to
921 bank_ref
.bytesAccessed
= 0;
922 bank_ref
.rowAccesses
= 0;
924 ++rank_ref
.numBanksActive
;
925 assert(rank_ref
.numBanksActive
<= banksPerRank
);
927 DPRINTF(DRAM
, "Activate bank %d, rank %d at tick %lld, now got %d active\n",
928 bank_ref
.bank
, rank_ref
.rank
, act_tick
,
929 ranks
[rank_ref
.rank
]->numBanksActive
);
931 rank_ref
.cmdList
.push_back(Command(MemCommand::ACT
, bank_ref
.bank
,
934 DPRINTF(DRAMPower
, "%llu,ACT,%d,%d\n", divCeil(act_tick
, tCK
) -
935 timeStampOffset
, bank_ref
.bank
, rank_ref
.rank
);
937 // The next access has to respect tRAS for this bank
938 bank_ref
.preAllowedAt
= act_tick
+ tRAS
;
940 // Respect the row-to-column command delay
941 bank_ref
.colAllowedAt
= std::max(act_tick
+ tRCD
, bank_ref
.colAllowedAt
);
943 // start by enforcing tRRD
944 for (int i
= 0; i
< banksPerRank
; i
++) {
945 // next activate to any bank in this rank must not happen
947 if (bankGroupArch
&& (bank_ref
.bankgr
== rank_ref
.banks
[i
].bankgr
)) {
948 // bank group architecture requires longer delays between
949 // ACT commands within the same bank group. Use tRRD_L
951 rank_ref
.banks
[i
].actAllowedAt
= std::max(act_tick
+ tRRD_L
,
952 rank_ref
.banks
[i
].actAllowedAt
);
954 // use shorter tRRD value when either
955 // 1) bank group architecture is not supportted
956 // 2) bank is in a different bank group
957 rank_ref
.banks
[i
].actAllowedAt
= std::max(act_tick
+ tRRD
,
958 rank_ref
.banks
[i
].actAllowedAt
);
962 // next, we deal with tXAW, if the activation limit is disabled
963 // then we directly schedule an activate power event
964 if (!rank_ref
.actTicks
.empty()) {
966 if (rank_ref
.actTicks
.back() &&
967 (act_tick
- rank_ref
.actTicks
.back()) < tXAW
) {
968 panic("Got %d activates in window %d (%llu - %llu) which "
969 "is smaller than %llu\n", activationLimit
, act_tick
-
970 rank_ref
.actTicks
.back(), act_tick
,
971 rank_ref
.actTicks
.back(), tXAW
);
974 // shift the times used for the book keeping, the last element
975 // (highest index) is the oldest one and hence the lowest value
976 rank_ref
.actTicks
.pop_back();
978 // record an new activation (in the future)
979 rank_ref
.actTicks
.push_front(act_tick
);
981 // cannot activate more than X times in time window tXAW, push the
982 // next one (the X + 1'st activate) to be tXAW away from the
983 // oldest in our window of X
984 if (rank_ref
.actTicks
.back() &&
985 (act_tick
- rank_ref
.actTicks
.back()) < tXAW
) {
986 DPRINTF(DRAM
, "Enforcing tXAW with X = %d, next activate "
987 "no earlier than %llu\n", activationLimit
,
988 rank_ref
.actTicks
.back() + tXAW
);
989 for (int j
= 0; j
< banksPerRank
; j
++)
990 // next activate must not happen before end of window
991 rank_ref
.banks
[j
].actAllowedAt
=
992 std::max(rank_ref
.actTicks
.back() + tXAW
,
993 rank_ref
.banks
[j
].actAllowedAt
);
997 // at the point when this activate takes place, make sure we
998 // transition to the active power state
999 if (!rank_ref
.activateEvent
.scheduled())
1000 schedule(rank_ref
.activateEvent
, act_tick
);
1001 else if (rank_ref
.activateEvent
.when() > act_tick
)
1002 // move it sooner in time
1003 reschedule(rank_ref
.activateEvent
, act_tick
);
1007 DRAMCtrl::prechargeBank(Rank
& rank_ref
, Bank
& bank
, Tick pre_at
, bool trace
)
1009 // make sure the bank has an open row
1010 assert(bank
.openRow
!= Bank::NO_ROW
);
1012 // sample the bytes per activate here since we are closing
1014 bytesPerActivate
.sample(bank
.bytesAccessed
);
1016 bank
.openRow
= Bank::NO_ROW
;
1018 // no precharge allowed before this one
1019 bank
.preAllowedAt
= pre_at
;
1021 Tick pre_done_at
= pre_at
+ tRP
;
1023 bank
.actAllowedAt
= std::max(bank
.actAllowedAt
, pre_done_at
);
1025 assert(rank_ref
.numBanksActive
!= 0);
1026 --rank_ref
.numBanksActive
;
1028 DPRINTF(DRAM
, "Precharging bank %d, rank %d at tick %lld, now got "
1029 "%d active\n", bank
.bank
, rank_ref
.rank
, pre_at
,
1030 rank_ref
.numBanksActive
);
1034 rank_ref
.cmdList
.push_back(Command(MemCommand::PRE
, bank
.bank
,
1036 DPRINTF(DRAMPower
, "%llu,PRE,%d,%d\n", divCeil(pre_at
, tCK
) -
1037 timeStampOffset
, bank
.bank
, rank_ref
.rank
);
1039 // if we look at the current number of active banks we might be
1040 // tempted to think the DRAM is now idle, however this can be
1041 // undone by an activate that is scheduled to happen before we
1042 // would have reached the idle state, so schedule an event and
1043 // rather check once we actually make it to the point in time when
1044 // the (last) precharge takes place
1045 if (!rank_ref
.prechargeEvent
.scheduled()) {
1046 schedule(rank_ref
.prechargeEvent
, pre_done_at
);
1047 // New event, increment count
1048 ++rank_ref
.outstandingEvents
;
1049 } else if (rank_ref
.prechargeEvent
.when() < pre_done_at
) {
1050 reschedule(rank_ref
.prechargeEvent
, pre_done_at
);
1055 DRAMCtrl::doDRAMAccess(DRAMPacket
* dram_pkt
)
1057 DPRINTF(DRAM
, "Timing access to addr %lld, rank/bank/row %d %d %d\n",
1058 dram_pkt
->addr
, dram_pkt
->rank
, dram_pkt
->bank
, dram_pkt
->row
);
1061 Rank
& rank
= dram_pkt
->rankRef
;
1063 // are we in or transitioning to a low-power state and have not scheduled
1064 // a power-up event?
1065 // if so, wake up from power down to issue RD/WR burst
1066 if (rank
.inLowPowerState
) {
1067 assert(rank
.pwrState
!= PWR_SREF
);
1068 rank
.scheduleWakeUpEvent(tXP
);
1072 Bank
& bank
= dram_pkt
->bankRef
;
1074 // for the state we need to track if it is a row hit or not
1075 bool row_hit
= true;
1077 // respect any constraints on the command (e.g. tRCD or tCCD)
1078 Tick cmd_at
= std::max(bank
.colAllowedAt
, curTick());
1080 // Determine the access latency and update the bank state
1081 if (bank
.openRow
== dram_pkt
->row
) {
1086 // If there is a page open, precharge it.
1087 if (bank
.openRow
!= Bank::NO_ROW
) {
1088 prechargeBank(rank
, bank
, std::max(bank
.preAllowedAt
, curTick()));
1091 // next we need to account for the delay in activating the
1093 Tick act_tick
= std::max(bank
.actAllowedAt
, curTick());
1095 // Record the activation and deal with all the global timing
1096 // constraints caused be a new activation (tRRD and tXAW)
1097 activateBank(rank
, bank
, act_tick
, dram_pkt
->row
);
1099 // issue the command as early as possible
1100 cmd_at
= bank
.colAllowedAt
;
1103 // we need to wait until the bus is available before we can issue
1105 cmd_at
= std::max(cmd_at
, busBusyUntil
- tCL
);
1107 // update the packet ready time
1108 dram_pkt
->readyTime
= cmd_at
+ tCL
+ tBURST
;
1110 // only one burst can use the bus at any one point in time
1111 assert(dram_pkt
->readyTime
- busBusyUntil
>= tBURST
);
1113 // update the time for the next read/write burst for each
1114 // bank (add a max with tCCD/tCCD_L here)
1116 for (int j
= 0; j
< ranksPerChannel
; j
++) {
1117 for (int i
= 0; i
< banksPerRank
; i
++) {
1118 // next burst to same bank group in this rank must not happen
1119 // before tCCD_L. Different bank group timing requirement is
1120 // tBURST; Add tCS for different ranks
1121 if (dram_pkt
->rank
== j
) {
1122 if (bankGroupArch
&&
1123 (bank
.bankgr
== ranks
[j
]->banks
[i
].bankgr
)) {
1124 // bank group architecture requires longer delays between
1125 // RD/WR burst commands to the same bank group.
1126 // Use tCCD_L in this case
1129 // use tBURST (equivalent to tCCD_S), the shorter
1130 // cas-to-cas delay value, when either:
1131 // 1) bank group architecture is not supportted
1132 // 2) bank is in a different bank group
1136 // different rank is by default in a different bank group
1137 // use tBURST (equivalent to tCCD_S), which is the shorter
1138 // cas-to-cas delay in this case
1139 // Add tCS to account for rank-to-rank bus delay requirements
1140 cmd_dly
= tBURST
+ tCS
;
1142 ranks
[j
]->banks
[i
].colAllowedAt
= std::max(cmd_at
+ cmd_dly
,
1143 ranks
[j
]->banks
[i
].colAllowedAt
);
1147 // Save rank of current access
1148 activeRank
= dram_pkt
->rank
;
1150 // If this is a write, we also need to respect the write recovery
1151 // time before a precharge, in the case of a read, respect the
1152 // read to precharge constraint
1153 bank
.preAllowedAt
= std::max(bank
.preAllowedAt
,
1154 dram_pkt
->isRead
? cmd_at
+ tRTP
:
1155 dram_pkt
->readyTime
+ tWR
);
1157 // increment the bytes accessed and the accesses per row
1158 bank
.bytesAccessed
+= burstSize
;
1161 // if we reached the max, then issue with an auto-precharge
1162 bool auto_precharge
= pageMgmt
== Enums::close
||
1163 bank
.rowAccesses
== maxAccessesPerRow
;
1165 // if we did not hit the limit, we might still want to
1167 if (!auto_precharge
&&
1168 (pageMgmt
== Enums::open_adaptive
||
1169 pageMgmt
== Enums::close_adaptive
)) {
1170 // a twist on the open and close page policies:
1171 // 1) open_adaptive page policy does not blindly keep the
1172 // page open, but close it if there are no row hits, and there
1173 // are bank conflicts in the queue
1174 // 2) close_adaptive page policy does not blindly close the
1175 // page, but closes it only if there are no row hits in the queue.
1176 // In this case, only force an auto precharge when there
1177 // are no same page hits in the queue
1178 bool got_more_hits
= false;
1179 bool got_bank_conflict
= false;
1181 // either look at the read queue or write queue
1182 const deque
<DRAMPacket
*>& queue
= dram_pkt
->isRead
? readQueue
:
1184 auto p
= queue
.begin();
1185 // make sure we are not considering the packet that we are
1186 // currently dealing with (which is the head of the queue)
1189 // keep on looking until we find a hit or reach the end of the queue
1190 // 1) if a hit is found, then both open and close adaptive policies keep
1192 // 2) if no hit is found, got_bank_conflict is set to true if a bank
1193 // conflict request is waiting in the queue
1194 while (!got_more_hits
&& p
!= queue
.end()) {
1195 bool same_rank_bank
= (dram_pkt
->rank
== (*p
)->rank
) &&
1196 (dram_pkt
->bank
== (*p
)->bank
);
1197 bool same_row
= dram_pkt
->row
== (*p
)->row
;
1198 got_more_hits
|= same_rank_bank
&& same_row
;
1199 got_bank_conflict
|= same_rank_bank
&& !same_row
;
1203 // auto pre-charge when either
1204 // 1) open_adaptive policy, we have not got any more hits, and
1205 // have a bank conflict
1206 // 2) close_adaptive policy and we have not got any more hits
1207 auto_precharge
= !got_more_hits
&&
1208 (got_bank_conflict
|| pageMgmt
== Enums::close_adaptive
);
1211 // DRAMPower trace command to be written
1212 std::string mem_cmd
= dram_pkt
->isRead
? "RD" : "WR";
1214 // MemCommand required for DRAMPower library
1215 MemCommand::cmds command
= (mem_cmd
== "RD") ? MemCommand::RD
:
1219 busBusyUntil
= dram_pkt
->readyTime
;
1221 DPRINTF(DRAM
, "Access to %lld, ready at %lld bus busy until %lld.\n",
1222 dram_pkt
->addr
, dram_pkt
->readyTime
, busBusyUntil
);
1224 dram_pkt
->rankRef
.cmdList
.push_back(Command(command
, dram_pkt
->bank
,
1227 DPRINTF(DRAMPower
, "%llu,%s,%d,%d\n", divCeil(cmd_at
, tCK
) -
1228 timeStampOffset
, mem_cmd
, dram_pkt
->bank
, dram_pkt
->rank
);
1230 // if this access should use auto-precharge, then we are
1231 // closing the row after the read/write burst
1232 if (auto_precharge
) {
1233 // if auto-precharge push a PRE command at the correct tick to the
1234 // list used by DRAMPower library to calculate power
1235 prechargeBank(rank
, bank
, std::max(curTick(), bank
.preAllowedAt
));
1237 DPRINTF(DRAM
, "Auto-precharged bank: %d\n", dram_pkt
->bankId
);
1240 // Update the minimum timing between the requests, this is a
1241 // conservative estimate of when we have to schedule the next
1242 // request to not introduce any unecessary bubbles. In most cases
1243 // we will wake up sooner than we have to.
1244 nextReqTime
= busBusyUntil
- (tRP
+ tRCD
+ tCL
);
1246 // Update the stats and schedule the next request
1247 if (dram_pkt
->isRead
) {
1251 bytesReadDRAM
+= burstSize
;
1252 perBankRdBursts
[dram_pkt
->bankId
]++;
1254 // Update latency stats
1255 totMemAccLat
+= dram_pkt
->readyTime
- dram_pkt
->entryTime
;
1256 totBusLat
+= tBURST
;
1257 totQLat
+= cmd_at
- dram_pkt
->entryTime
;
1262 bytesWritten
+= burstSize
;
1263 perBankWrBursts
[dram_pkt
->bankId
]++;
1268 DRAMCtrl::processNextReqEvent()
1271 for (auto r
: ranks
) {
1272 if (!r
->inRefIdleState()) {
1273 if (r
->pwrState
!= PWR_SREF
) {
1274 // rank is busy refreshing
1275 DPRINTF(DRAMState
, "Rank %d is not available\n", r
->rank
);
1278 // let the rank know that if it was waiting to drain, it
1279 // is now done and ready to proceed
1280 r
->checkDrainDone();
1283 // check if we were in self-refresh and haven't started
1284 // to transition out
1285 if ((r
->pwrState
== PWR_SREF
) && r
->inLowPowerState
) {
1286 DPRINTF(DRAMState
, "Rank %d is in self-refresh\n", r
->rank
);
1287 // if we have commands queued to this rank and we don't have
1288 // a minimum number of active commands enqueued,
1289 // exit self-refresh
1290 if (r
->forceSelfRefreshExit()) {
1291 DPRINTF(DRAMState
, "rank %d was in self refresh and"
1292 " should wake up\n", r
->rank
);
1293 //wake up from self-refresh
1294 r
->scheduleWakeUpEvent(tXS
);
1295 // things are brought back into action once a refresh is
1296 // performed after self-refresh
1297 // continue with selection for other ranks
1303 if (busyRanks
== ranksPerChannel
) {
1304 // if all ranks are refreshing wait for them to finish
1305 // and stall this state machine without taking any further
1306 // action, and do not schedule a new nextReqEvent
1310 // pre-emptively set to false. Overwrite if in transitioning to
1312 bool switched_cmd_type
= false;
1313 if (busState
!= busStateNext
) {
1314 if (busState
== READ
) {
1315 DPRINTF(DRAM
, "Switching to writes after %d reads with %d reads "
1316 "waiting\n", readsThisTime
, readQueue
.size());
1318 // sample and reset the read-related stats as we are now
1319 // transitioning to writes, and all reads are done
1320 rdPerTurnAround
.sample(readsThisTime
);
1323 // now proceed to do the actual writes
1324 switched_cmd_type
= true;
1326 DPRINTF(DRAM
, "Switching to reads after %d writes with %d writes "
1327 "waiting\n", writesThisTime
, writeQueue
.size());
1329 wrPerTurnAround
.sample(writesThisTime
);
1332 switched_cmd_type
= true;
1334 // update busState to match next state until next transition
1335 busState
= busStateNext
;
1338 // when we get here it is either a read or a write
1339 if (busState
== READ
) {
1341 // track if we should switch or not
1342 bool switch_to_writes
= false;
1344 if (readQueue
.empty()) {
1345 // In the case there is no read request to go next,
1346 // trigger writes if we have passed the low threshold (or
1347 // if we are draining)
1348 if (!writeQueue
.empty() &&
1349 (drainState() == DrainState::Draining
||
1350 writeQueue
.size() > writeLowThreshold
)) {
1352 switch_to_writes
= true;
1354 // check if we are drained
1355 // not done draining until in PWR_IDLE state
1356 // ensuring all banks are closed and
1357 // have exited low power states
1358 if (drainState() == DrainState::Draining
&&
1359 respQueue
.empty() && allRanksDrained()) {
1361 DPRINTF(Drain
, "DRAM controller done draining\n");
1365 // nothing to do, not even any point in scheduling an
1366 // event for the next request
1370 // bool to check if there is a read to a free rank
1371 bool found_read
= false;
1373 // Figure out which read request goes next, and move it to the
1374 // front of the read queue
1375 // If we are changing command type, incorporate the minimum
1376 // bus turnaround delay which will be tCS (different rank) case
1377 found_read
= chooseNext(readQueue
,
1378 switched_cmd_type
? tCS
: 0);
1380 // if no read to an available rank is found then return
1381 // at this point. There could be writes to the available ranks
1382 // which are above the required threshold. However, to
1383 // avoid adding more complexity to the code, return and wait
1384 // for a refresh event to kick things into action again.
1388 DRAMPacket
* dram_pkt
= readQueue
.front();
1389 assert(dram_pkt
->rankRef
.inRefIdleState());
1391 // here we get a bit creative and shift the bus busy time not
1392 // just the tWTR, but also a CAS latency to capture the fact
1393 // that we are allowed to prepare a new bank, but not issue a
1394 // read command until after tWTR, in essence we capture a
1395 // bubble on the data bus that is tWTR + tCL
1396 if (switched_cmd_type
&& dram_pkt
->rank
== activeRank
) {
1397 busBusyUntil
+= tWTR
+ tCL
;
1400 doDRAMAccess(dram_pkt
);
1402 // At this point we're done dealing with the request
1403 readQueue
.pop_front();
1405 // Every respQueue which will generate an event, increment count
1406 ++dram_pkt
->rankRef
.outstandingEvents
;
1409 assert(dram_pkt
->size
<= burstSize
);
1410 assert(dram_pkt
->readyTime
>= curTick());
1412 // Insert into response queue. It will be sent back to the
1413 // requestor at its readyTime
1414 if (respQueue
.empty()) {
1415 assert(!respondEvent
.scheduled());
1416 schedule(respondEvent
, dram_pkt
->readyTime
);
1418 assert(respQueue
.back()->readyTime
<= dram_pkt
->readyTime
);
1419 assert(respondEvent
.scheduled());
1422 respQueue
.push_back(dram_pkt
);
1424 // we have so many writes that we have to transition
1425 if (writeQueue
.size() > writeHighThreshold
) {
1426 switch_to_writes
= true;
1430 // switching to writes, either because the read queue is empty
1431 // and the writes have passed the low threshold (or we are
1432 // draining), or because the writes hit the hight threshold
1433 if (switch_to_writes
) {
1434 // transition to writing
1435 busStateNext
= WRITE
;
1438 // bool to check if write to free rank is found
1439 bool found_write
= false;
1441 // If we are changing command type, incorporate the minimum
1442 // bus turnaround delay
1443 found_write
= chooseNext(writeQueue
,
1444 switched_cmd_type
? std::min(tRTW
, tCS
) : 0);
1446 // if there are no writes to a rank that is available to service
1447 // requests (i.e. rank is in refresh idle state) are found then
1448 // return. There could be reads to the available ranks. However, to
1449 // avoid adding more complexity to the code, return at this point and
1450 // wait for a refresh event to kick things into action again.
1454 DRAMPacket
* dram_pkt
= writeQueue
.front();
1455 assert(dram_pkt
->rankRef
.inRefIdleState());
1457 assert(dram_pkt
->size
<= burstSize
);
1459 // add a bubble to the data bus, as defined by the
1460 // tRTW when access is to the same rank as previous burst
1461 // Different rank timing is handled with tCS, which is
1462 // applied to colAllowedAt
1463 if (switched_cmd_type
&& dram_pkt
->rank
== activeRank
) {
1464 busBusyUntil
+= tRTW
;
1467 doDRAMAccess(dram_pkt
);
1469 writeQueue
.pop_front();
1471 // removed write from queue, decrement count
1472 --dram_pkt
->rankRef
.writeEntries
;
1474 // Schedule write done event to decrement event count
1475 // after the readyTime has been reached
1476 // Only schedule latest write event to minimize events
1477 // required; only need to ensure that final event scheduled covers
1478 // the time that writes are outstanding and bus is active
1479 // to holdoff power-down entry events
1480 if (!dram_pkt
->rankRef
.writeDoneEvent
.scheduled()) {
1481 schedule(dram_pkt
->rankRef
.writeDoneEvent
, dram_pkt
->readyTime
);
1482 // New event, increment count
1483 ++dram_pkt
->rankRef
.outstandingEvents
;
1485 } else if (dram_pkt
->rankRef
.writeDoneEvent
.when() <
1486 dram_pkt
-> readyTime
) {
1487 reschedule(dram_pkt
->rankRef
.writeDoneEvent
, dram_pkt
->readyTime
);
1490 isInWriteQueue
.erase(burstAlign(dram_pkt
->addr
));
1493 // If we emptied the write queue, or got sufficiently below the
1494 // threshold (using the minWritesPerSwitch as the hysteresis) and
1495 // are not draining, or we have reads waiting and have done enough
1496 // writes, then switch to reads.
1497 if (writeQueue
.empty() ||
1498 (writeQueue
.size() + minWritesPerSwitch
< writeLowThreshold
&&
1499 drainState() != DrainState::Draining
) ||
1500 (!readQueue
.empty() && writesThisTime
>= minWritesPerSwitch
)) {
1501 // turn the bus back around for reads again
1502 busStateNext
= READ
;
1504 // note that the we switch back to reads also in the idle
1505 // case, which eventually will check for any draining and
1506 // also pause any further scheduling if there is really
1510 // It is possible that a refresh to another rank kicks things back into
1511 // action before reaching this point.
1512 if (!nextReqEvent
.scheduled())
1513 schedule(nextReqEvent
, std::max(nextReqTime
, curTick()));
1515 // If there is space available and we have writes waiting then let
1516 // them retry. This is done here to ensure that the retry does not
1517 // cause a nextReqEvent to be scheduled before we do so as part of
1518 // the next request processing
1519 if (retryWrReq
&& writeQueue
.size() < writeBufferSize
) {
1521 port
.sendRetryReq();
1525 pair
<uint64_t, bool>
1526 DRAMCtrl::minBankPrep(const deque
<DRAMPacket
*>& queue
,
1527 Tick min_col_at
) const
1529 uint64_t bank_mask
= 0;
1530 Tick min_act_at
= MaxTick
;
1532 // latest Tick for which ACT can occur without incurring additoinal
1533 // delay on the data bus
1534 const Tick hidden_act_max
= std::max(min_col_at
- tRCD
, curTick());
1536 // Flag condition when burst can issue back-to-back with previous burst
1537 bool found_seamless_bank
= false;
1539 // Flag condition when bank can be opened without incurring additional
1540 // delay on the data bus
1541 bool hidden_bank_prep
= false;
1543 // determine if we have queued transactions targetting the
1545 vector
<bool> got_waiting(ranksPerChannel
* banksPerRank
, false);
1546 for (const auto& p
: queue
) {
1547 if (p
->rankRef
.inRefIdleState())
1548 got_waiting
[p
->bankId
] = true;
1551 // Find command with optimal bank timing
1552 // Will prioritize commands that can issue seamlessly.
1553 for (int i
= 0; i
< ranksPerChannel
; i
++) {
1554 for (int j
= 0; j
< banksPerRank
; j
++) {
1555 uint16_t bank_id
= i
* banksPerRank
+ j
;
1557 // if we have waiting requests for the bank, and it is
1558 // amongst the first available, update the mask
1559 if (got_waiting
[bank_id
]) {
1560 // make sure this rank is not currently refreshing.
1561 assert(ranks
[i
]->inRefIdleState());
1562 // simplistic approximation of when the bank can issue
1563 // an activate, ignoring any rank-to-rank switching
1564 // cost in this calculation
1565 Tick act_at
= ranks
[i
]->banks
[j
].openRow
== Bank::NO_ROW
?
1566 std::max(ranks
[i
]->banks
[j
].actAllowedAt
, curTick()) :
1567 std::max(ranks
[i
]->banks
[j
].preAllowedAt
, curTick()) + tRP
;
1569 // When is the earliest the R/W burst can issue?
1570 Tick col_at
= std::max(ranks
[i
]->banks
[j
].colAllowedAt
,
1573 // bank can issue burst back-to-back (seamlessly) with
1575 bool new_seamless_bank
= col_at
<= min_col_at
;
1577 // if we found a new seamless bank or we have no
1578 // seamless banks, and got a bank with an earlier
1579 // activate time, it should be added to the bit mask
1580 if (new_seamless_bank
||
1581 (!found_seamless_bank
&& act_at
<= min_act_at
)) {
1582 // if we did not have a seamless bank before, and
1583 // we do now, reset the bank mask, also reset it
1584 // if we have not yet found a seamless bank and
1585 // the activate time is smaller than what we have
1587 if (!found_seamless_bank
&&
1588 (new_seamless_bank
|| act_at
< min_act_at
)) {
1592 found_seamless_bank
|= new_seamless_bank
;
1594 // ACT can occur 'behind the scenes'
1595 hidden_bank_prep
= act_at
<= hidden_act_max
;
1597 // set the bit corresponding to the available bank
1598 replaceBits(bank_mask
, bank_id
, bank_id
, 1);
1599 min_act_at
= act_at
;
1605 return make_pair(bank_mask
, hidden_bank_prep
);
1608 DRAMCtrl::Rank::Rank(DRAMCtrl
& _memory
, const DRAMCtrlParams
* _p
, int rank
)
1609 : EventManager(&_memory
), memory(_memory
),
1610 pwrStateTrans(PWR_IDLE
), pwrStatePostRefresh(PWR_IDLE
),
1611 pwrStateTick(0), refreshDueAt(0), pwrState(PWR_IDLE
),
1612 refreshState(REF_IDLE
), inLowPowerState(false), rank(rank
),
1613 readEntries(0), writeEntries(0), outstandingEvents(0),
1614 wakeUpAllowedAt(0), power(_p
, false), banks(_p
->banks_per_rank
),
1615 numBanksActive(0), actTicks(_p
->activation_limit
, 0),
1616 writeDoneEvent([this]{ processWriteDoneEvent(); }, name()),
1617 activateEvent([this]{ processActivateEvent(); }, name()),
1618 prechargeEvent([this]{ processPrechargeEvent(); }, name()),
1619 refreshEvent([this]{ processRefreshEvent(); }, name()),
1620 powerEvent([this]{ processPowerEvent(); }, name()),
1621 wakeUpEvent([this]{ processWakeUpEvent(); }, name())
1623 for (int b
= 0; b
< _p
->banks_per_rank
; b
++) {
1625 // GDDR addressing of banks to BG is linear.
1626 // Here we assume that all DRAM generations address bank groups as
1628 if (_p
->bank_groups_per_rank
> 0) {
1629 // Simply assign lower bits to bank group in order to
1630 // rotate across bank groups as banks are incremented
1631 // e.g. with 4 banks per bank group and 16 banks total:
1632 // banks 0,4,8,12 are in bank group 0
1633 // banks 1,5,9,13 are in bank group 1
1634 // banks 2,6,10,14 are in bank group 2
1635 // banks 3,7,11,15 are in bank group 3
1636 banks
[b
].bankgr
= b
% _p
->bank_groups_per_rank
;
1638 // No bank groups; simply assign to bank number
1639 banks
[b
].bankgr
= b
;
1645 DRAMCtrl::Rank::startup(Tick ref_tick
)
1647 assert(ref_tick
> curTick());
1649 pwrStateTick
= curTick();
1651 // kick off the refresh, and give ourselves enough time to
1653 schedule(refreshEvent
, ref_tick
);
1657 DRAMCtrl::Rank::suspend()
1659 deschedule(refreshEvent
);
1664 // don't automatically transition back to LP state after next REF
1665 pwrStatePostRefresh
= PWR_IDLE
;
1669 DRAMCtrl::Rank::isQueueEmpty() const
1671 // check commmands in Q based on current bus direction
1672 bool no_queued_cmds
= ((memory
.busStateNext
== READ
) && (readEntries
== 0))
1673 || ((memory
.busStateNext
== WRITE
) &&
1674 (writeEntries
== 0));
1675 return no_queued_cmds
;
1679 DRAMCtrl::Rank::checkDrainDone()
1681 // if this rank was waiting to drain it is now able to proceed to
1683 if (refreshState
== REF_DRAIN
) {
1684 DPRINTF(DRAM
, "Refresh drain done, now precharging\n");
1686 refreshState
= REF_PD_EXIT
;
1688 // hand control back to the refresh event loop
1689 schedule(refreshEvent
, curTick());
1694 DRAMCtrl::Rank::flushCmdList()
1696 // at the moment sort the list of commands and update the counters
1697 // for DRAMPower libray when doing a refresh
1698 sort(cmdList
.begin(), cmdList
.end(), DRAMCtrl::sortTime
);
1700 auto next_iter
= cmdList
.begin();
1701 // push to commands to DRAMPower
1702 for ( ; next_iter
!= cmdList
.end() ; ++next_iter
) {
1703 Command cmd
= *next_iter
;
1704 if (cmd
.timeStamp
<= curTick()) {
1705 // Move all commands at or before curTick to DRAMPower
1706 power
.powerlib
.doCommand(cmd
.type
, cmd
.bank
,
1707 divCeil(cmd
.timeStamp
, memory
.tCK
) -
1708 memory
.timeStampOffset
);
1710 // done - found all commands at or before curTick()
1711 // next_iter references the 1st command after curTick
1715 // reset cmdList to only contain commands after curTick
1716 // if there are no commands after curTick, updated cmdList will be empty
1717 // in this case, next_iter is cmdList.end()
1718 cmdList
.assign(next_iter
, cmdList
.end());
1722 DRAMCtrl::Rank::processActivateEvent()
1724 // we should transition to the active state as soon as any bank is active
1725 if (pwrState
!= PWR_ACT
)
1726 // note that at this point numBanksActive could be back at
1727 // zero again due to a precharge scheduled in the future
1728 schedulePowerEvent(PWR_ACT
, curTick());
1732 DRAMCtrl::Rank::processPrechargeEvent()
1734 // counter should at least indicate one outstanding request
1735 // for this precharge
1736 assert(outstandingEvents
> 0);
1737 // precharge complete, decrement count
1738 --outstandingEvents
;
1740 // if we reached zero, then special conditions apply as we track
1741 // if all banks are precharged for the power models
1742 if (numBanksActive
== 0) {
1743 // no reads to this rank in the Q and no pending
1744 // RD/WR or refresh commands
1745 if (isQueueEmpty() && outstandingEvents
== 0) {
1746 // should still be in ACT state since bank still open
1747 assert(pwrState
== PWR_ACT
);
1749 // All banks closed - switch to precharge power down state.
1750 DPRINTF(DRAMState
, "Rank %d sleep at tick %d\n",
1752 powerDownSleep(PWR_PRE_PDN
, curTick());
1754 // we should transition to the idle state when the last bank
1756 schedulePowerEvent(PWR_IDLE
, curTick());
1762 DRAMCtrl::Rank::processWriteDoneEvent()
1764 // counter should at least indicate one outstanding request
1766 assert(outstandingEvents
> 0);
1767 // Write transfer on bus has completed
1768 // decrement per rank counter
1769 --outstandingEvents
;
1773 DRAMCtrl::Rank::processRefreshEvent()
1775 // when first preparing the refresh, remember when it was due
1776 if ((refreshState
== REF_IDLE
) || (refreshState
== REF_SREF_EXIT
)) {
1777 // remember when the refresh is due
1778 refreshDueAt
= curTick();
1781 refreshState
= REF_DRAIN
;
1783 // make nonzero while refresh is pending to ensure
1784 // power down and self-refresh are not entered
1785 ++outstandingEvents
;
1787 DPRINTF(DRAM
, "Refresh due\n");
1790 // let any scheduled read or write to the same rank go ahead,
1791 // after which it will
1792 // hand control back to this event loop
1793 if (refreshState
== REF_DRAIN
) {
1794 // if a request is at the moment being handled and this request is
1795 // accessing the current rank then wait for it to finish
1796 if ((rank
== memory
.activeRank
)
1797 && (memory
.nextReqEvent
.scheduled())) {
1798 // hand control over to the request loop until it is
1800 DPRINTF(DRAM
, "Refresh awaiting draining\n");
1804 refreshState
= REF_PD_EXIT
;
1808 // at this point, ensure that rank is not in a power-down state
1809 if (refreshState
== REF_PD_EXIT
) {
1810 // if rank was sleeping and we have't started exit process,
1811 // wake-up for refresh
1812 if (inLowPowerState
) {
1813 DPRINTF(DRAM
, "Wake Up for refresh\n");
1814 // save state and return after refresh completes
1815 scheduleWakeUpEvent(memory
.tXP
);
1818 refreshState
= REF_PRE
;
1822 // at this point, ensure that all banks are precharged
1823 if (refreshState
== REF_PRE
) {
1824 // precharge any active bank
1825 if (numBanksActive
!= 0) {
1826 // at the moment, we use a precharge all even if there is
1827 // only a single bank open
1828 DPRINTF(DRAM
, "Precharging all\n");
1830 // first determine when we can precharge
1831 Tick pre_at
= curTick();
1833 for (auto &b
: banks
) {
1834 // respect both causality and any existing bank
1835 // constraints, some banks could already have a
1836 // (auto) precharge scheduled
1837 pre_at
= std::max(b
.preAllowedAt
, pre_at
);
1840 // make sure all banks per rank are precharged, and for those that
1841 // already are, update their availability
1842 Tick act_allowed_at
= pre_at
+ memory
.tRP
;
1844 for (auto &b
: banks
) {
1845 if (b
.openRow
!= Bank::NO_ROW
) {
1846 memory
.prechargeBank(*this, b
, pre_at
, false);
1848 b
.actAllowedAt
= std::max(b
.actAllowedAt
, act_allowed_at
);
1849 b
.preAllowedAt
= std::max(b
.preAllowedAt
, pre_at
);
1853 // precharge all banks in rank
1854 cmdList
.push_back(Command(MemCommand::PREA
, 0, pre_at
));
1856 DPRINTF(DRAMPower
, "%llu,PREA,0,%d\n",
1857 divCeil(pre_at
, memory
.tCK
) -
1858 memory
.timeStampOffset
, rank
);
1859 } else if ((pwrState
== PWR_IDLE
) && (outstandingEvents
== 1)) {
1860 // Banks are closed, have transitioned to IDLE state, and
1861 // no outstanding ACT,RD/WR,Auto-PRE sequence scheduled
1862 DPRINTF(DRAM
, "All banks already precharged, starting refresh\n");
1864 // go ahead and kick the power state machine into gear since
1865 // we are already idle
1866 schedulePowerEvent(PWR_REF
, curTick());
1868 // banks state is closed but haven't transitioned pwrState to IDLE
1869 // or have outstanding ACT,RD/WR,Auto-PRE sequence scheduled
1870 // should have outstanding precharge event in this case
1871 assert(prechargeEvent
.scheduled());
1872 // will start refresh when pwrState transitions to IDLE
1875 assert(numBanksActive
== 0);
1877 // wait for all banks to be precharged, at which point the
1878 // power state machine will transition to the idle state, and
1879 // automatically move to a refresh, at that point it will also
1880 // call this method to get the refresh event loop going again
1884 // last but not least we perform the actual refresh
1885 if (refreshState
== REF_START
) {
1886 // should never get here with any banks active
1887 assert(numBanksActive
== 0);
1888 assert(pwrState
== PWR_REF
);
1890 Tick ref_done_at
= curTick() + memory
.tRFC
;
1892 for (auto &b
: banks
) {
1893 b
.actAllowedAt
= ref_done_at
;
1896 // at the moment this affects all ranks
1897 cmdList
.push_back(Command(MemCommand::REF
, 0, curTick()));
1902 DPRINTF(DRAMPower
, "%llu,REF,0,%d\n", divCeil(curTick(), memory
.tCK
) -
1903 memory
.timeStampOffset
, rank
);
1905 // Update for next refresh
1906 refreshDueAt
+= memory
.tREFI
;
1908 // make sure we did not wait so long that we cannot make up
1910 if (refreshDueAt
< ref_done_at
) {
1911 fatal("Refresh was delayed so long we cannot catch up\n");
1914 // Run the refresh and schedule event to transition power states
1915 // when refresh completes
1916 refreshState
= REF_RUN
;
1917 schedule(refreshEvent
, ref_done_at
);
1921 if (refreshState
== REF_RUN
) {
1922 // should never get here with any banks active
1923 assert(numBanksActive
== 0);
1924 assert(pwrState
== PWR_REF
);
1926 assert(!powerEvent
.scheduled());
1928 if ((memory
.drainState() == DrainState::Draining
) ||
1929 (memory
.drainState() == DrainState::Drained
)) {
1930 // if draining, do not re-enter low-power mode.
1931 // simply go to IDLE and wait
1932 schedulePowerEvent(PWR_IDLE
, curTick());
1934 // At the moment, we sleep when the refresh ends and wait to be
1935 // woken up again if previously in a low-power state.
1936 if (pwrStatePostRefresh
!= PWR_IDLE
) {
1937 // power State should be power Refresh
1938 assert(pwrState
== PWR_REF
);
1939 DPRINTF(DRAMState
, "Rank %d sleeping after refresh and was in "
1940 "power state %d before refreshing\n", rank
,
1941 pwrStatePostRefresh
);
1942 powerDownSleep(pwrState
, curTick());
1944 // Force PRE power-down if there are no outstanding commands
1945 // in Q after refresh.
1946 } else if (isQueueEmpty()) {
1947 // still have refresh event outstanding but there should
1948 // be no other events outstanding
1949 assert(outstandingEvents
== 1);
1950 DPRINTF(DRAMState
, "Rank %d sleeping after refresh but was NOT"
1951 " in a low power state before refreshing\n", rank
);
1952 powerDownSleep(PWR_PRE_PDN
, curTick());
1955 // move to the idle power state once the refresh is done, this
1956 // will also move the refresh state machine to the refresh
1958 schedulePowerEvent(PWR_IDLE
, curTick());
1962 // At this point, we have completed the current refresh.
1963 // In the SREF bypass case, we do not get to this state in the
1964 // refresh STM and therefore can always schedule next event.
1965 // Compensate for the delay in actually performing the refresh
1966 // when scheduling the next one
1967 schedule(refreshEvent
, refreshDueAt
- memory
.tRP
);
1969 DPRINTF(DRAMState
, "Refresh done at %llu and next refresh"
1970 " at %llu\n", curTick(), refreshDueAt
);
1975 DRAMCtrl::Rank::schedulePowerEvent(PowerState pwr_state
, Tick tick
)
1977 // respect causality
1978 assert(tick
>= curTick());
1980 if (!powerEvent
.scheduled()) {
1981 DPRINTF(DRAMState
, "Scheduling power event at %llu to state %d\n",
1984 // insert the new transition
1985 pwrStateTrans
= pwr_state
;
1987 schedule(powerEvent
, tick
);
1989 panic("Scheduled power event at %llu to state %d, "
1990 "with scheduled event at %llu to %d\n", tick
, pwr_state
,
1991 powerEvent
.when(), pwrStateTrans
);
1996 DRAMCtrl::Rank::powerDownSleep(PowerState pwr_state
, Tick tick
)
1998 // if low power state is active low, schedule to active low power state.
1999 // in reality tCKE is needed to enter active low power. This is neglected
2000 // here and could be added in the future.
2001 if (pwr_state
== PWR_ACT_PDN
) {
2002 schedulePowerEvent(pwr_state
, tick
);
2003 // push command to DRAMPower
2004 cmdList
.push_back(Command(MemCommand::PDN_F_ACT
, 0, tick
));
2005 DPRINTF(DRAMPower
, "%llu,PDN_F_ACT,0,%d\n", divCeil(tick
,
2006 memory
.tCK
) - memory
.timeStampOffset
, rank
);
2007 } else if (pwr_state
== PWR_PRE_PDN
) {
2008 // if low power state is precharge low, schedule to precharge low
2009 // power state. In reality tCKE is needed to enter active low power.
2010 // This is neglected here.
2011 schedulePowerEvent(pwr_state
, tick
);
2012 //push Command to DRAMPower
2013 cmdList
.push_back(Command(MemCommand::PDN_F_PRE
, 0, tick
));
2014 DPRINTF(DRAMPower
, "%llu,PDN_F_PRE,0,%d\n", divCeil(tick
,
2015 memory
.tCK
) - memory
.timeStampOffset
, rank
);
2016 } else if (pwr_state
== PWR_REF
) {
2017 // if a refresh just occurred
2018 // transition to PRE_PDN now that all banks are closed
2019 // precharge power down requires tCKE to enter. For simplicity
2020 // this is not considered.
2021 schedulePowerEvent(PWR_PRE_PDN
, tick
);
2022 //push Command to DRAMPower
2023 cmdList
.push_back(Command(MemCommand::PDN_F_PRE
, 0, tick
));
2024 DPRINTF(DRAMPower
, "%llu,PDN_F_PRE,0,%d\n", divCeil(tick
,
2025 memory
.tCK
) - memory
.timeStampOffset
, rank
);
2026 } else if (pwr_state
== PWR_SREF
) {
2027 // should only enter SREF after PRE-PD wakeup to do a refresh
2028 assert(pwrStatePostRefresh
== PWR_PRE_PDN
);
2029 // self refresh requires time tCKESR to enter. For simplicity,
2030 // this is not considered.
2031 schedulePowerEvent(PWR_SREF
, tick
);
2032 // push Command to DRAMPower
2033 cmdList
.push_back(Command(MemCommand::SREN
, 0, tick
));
2034 DPRINTF(DRAMPower
, "%llu,SREN,0,%d\n", divCeil(tick
,
2035 memory
.tCK
) - memory
.timeStampOffset
, rank
);
2037 // Ensure that we don't power-down and back up in same tick
2038 // Once we commit to PD entry, do it and wait for at least 1tCK
2039 // This could be replaced with tCKE if/when that is added to the model
2040 wakeUpAllowedAt
= tick
+ memory
.tCK
;
2042 // Transitioning to a low power state, set flag
2043 inLowPowerState
= true;
2047 DRAMCtrl::Rank::scheduleWakeUpEvent(Tick exit_delay
)
2049 Tick wake_up_tick
= std::max(curTick(), wakeUpAllowedAt
);
2051 DPRINTF(DRAMState
, "Scheduling wake-up for rank %d at tick %d\n",
2052 rank
, wake_up_tick
);
2054 // if waking for refresh, hold previous state
2055 // else reset state back to IDLE
2056 if (refreshState
== REF_PD_EXIT
) {
2057 pwrStatePostRefresh
= pwrState
;
2059 // don't automatically transition back to LP state after next REF
2060 pwrStatePostRefresh
= PWR_IDLE
;
2063 // schedule wake-up with event to ensure entry has completed before
2064 // we try to wake-up
2065 schedule(wakeUpEvent
, wake_up_tick
);
2067 for (auto &b
: banks
) {
2068 // respect both causality and any existing bank
2069 // constraints, some banks could already have a
2070 // (auto) precharge scheduled
2071 b
.colAllowedAt
= std::max(wake_up_tick
+ exit_delay
, b
.colAllowedAt
);
2072 b
.preAllowedAt
= std::max(wake_up_tick
+ exit_delay
, b
.preAllowedAt
);
2073 b
.actAllowedAt
= std::max(wake_up_tick
+ exit_delay
, b
.actAllowedAt
);
2075 // Transitioning out of low power state, clear flag
2076 inLowPowerState
= false;
2078 // push to DRAMPower
2079 // use pwrStateTrans for cases where we have a power event scheduled
2080 // to enter low power that has not yet been processed
2081 if (pwrStateTrans
== PWR_ACT_PDN
) {
2082 cmdList
.push_back(Command(MemCommand::PUP_ACT
, 0, wake_up_tick
));
2083 DPRINTF(DRAMPower
, "%llu,PUP_ACT,0,%d\n", divCeil(wake_up_tick
,
2084 memory
.tCK
) - memory
.timeStampOffset
, rank
);
2086 } else if (pwrStateTrans
== PWR_PRE_PDN
) {
2087 cmdList
.push_back(Command(MemCommand::PUP_PRE
, 0, wake_up_tick
));
2088 DPRINTF(DRAMPower
, "%llu,PUP_PRE,0,%d\n", divCeil(wake_up_tick
,
2089 memory
.tCK
) - memory
.timeStampOffset
, rank
);
2090 } else if (pwrStateTrans
== PWR_SREF
) {
2091 cmdList
.push_back(Command(MemCommand::SREX
, 0, wake_up_tick
));
2092 DPRINTF(DRAMPower
, "%llu,SREX,0,%d\n", divCeil(wake_up_tick
,
2093 memory
.tCK
) - memory
.timeStampOffset
, rank
);
2098 DRAMCtrl::Rank::processWakeUpEvent()
2100 // Should be in a power-down or self-refresh state
2101 assert((pwrState
== PWR_ACT_PDN
) || (pwrState
== PWR_PRE_PDN
) ||
2102 (pwrState
== PWR_SREF
));
2104 // Check current state to determine transition state
2105 if (pwrState
== PWR_ACT_PDN
) {
2106 // banks still open, transition to PWR_ACT
2107 schedulePowerEvent(PWR_ACT
, curTick());
2109 // transitioning from a precharge power-down or self-refresh state
2110 // banks are closed - transition to PWR_IDLE
2111 schedulePowerEvent(PWR_IDLE
, curTick());
2116 DRAMCtrl::Rank::processPowerEvent()
2118 assert(curTick() >= pwrStateTick
);
2119 // remember where we were, and for how long
2120 Tick duration
= curTick() - pwrStateTick
;
2121 PowerState prev_state
= pwrState
;
2123 // update the accounting
2124 pwrStateTime
[prev_state
] += duration
;
2126 // track to total idle time
2127 if ((prev_state
== PWR_PRE_PDN
) || (prev_state
== PWR_ACT_PDN
) ||
2128 (prev_state
== PWR_SREF
)) {
2129 totalIdleTime
+= duration
;
2132 pwrState
= pwrStateTrans
;
2133 pwrStateTick
= curTick();
2135 // if rank was refreshing, make sure to start scheduling requests again
2136 if (prev_state
== PWR_REF
) {
2137 // bus IDLED prior to REF
2138 // counter should be one for refresh command only
2139 assert(outstandingEvents
== 1);
2140 // REF complete, decrement count and go back to IDLE
2141 --outstandingEvents
;
2142 refreshState
= REF_IDLE
;
2144 DPRINTF(DRAMState
, "Was refreshing for %llu ticks\n", duration
);
2145 // if moving back to power-down after refresh
2146 if (pwrState
!= PWR_IDLE
) {
2147 assert(pwrState
== PWR_PRE_PDN
);
2148 DPRINTF(DRAMState
, "Switching to power down state after refreshing"
2149 " rank %d at %llu tick\n", rank
, curTick());
2152 // completed refresh event, ensure next request is scheduled
2153 if (!memory
.nextReqEvent
.scheduled()) {
2154 DPRINTF(DRAM
, "Scheduling next request after refreshing"
2155 " rank %d\n", rank
);
2156 schedule(memory
.nextReqEvent
, curTick());
2160 if ((pwrState
== PWR_ACT
) && (refreshState
== REF_PD_EXIT
)) {
2161 // have exited ACT PD
2162 assert(prev_state
== PWR_ACT_PDN
);
2164 // go back to REF event and close banks
2165 refreshState
= REF_PRE
;
2166 schedule(refreshEvent
, curTick());
2167 } else if (pwrState
== PWR_IDLE
) {
2168 DPRINTF(DRAMState
, "All banks precharged\n");
2169 if (prev_state
== PWR_SREF
) {
2170 // set refresh state to REF_SREF_EXIT, ensuring inRefIdleState
2171 // continues to return false during tXS after SREF exit
2172 // Schedule a refresh which kicks things back into action
2174 refreshState
= REF_SREF_EXIT
;
2175 schedule(refreshEvent
, curTick() + memory
.tXS
);
2177 // if we have a pending refresh, and are now moving to
2178 // the idle state, directly transition to, or schedule refresh
2179 if ((refreshState
== REF_PRE
) || (refreshState
== REF_PD_EXIT
)) {
2180 // ensure refresh is restarted only after final PRE command.
2181 // do not restart refresh if controller is in an intermediate
2182 // state, after PRE_PDN exit, when banks are IDLE but an
2183 // ACT is scheduled.
2184 if (!activateEvent
.scheduled()) {
2185 // there should be nothing waiting at this point
2186 assert(!powerEvent
.scheduled());
2187 if (refreshState
== REF_PD_EXIT
) {
2188 // exiting PRE PD, will be in IDLE until tXP expires
2189 // and then should transition to PWR_REF state
2190 assert(prev_state
== PWR_PRE_PDN
);
2191 schedulePowerEvent(PWR_REF
, curTick() + memory
.tXP
);
2192 } else if (refreshState
== REF_PRE
) {
2193 // can directly move to PWR_REF state and proceed below
2197 // must have PRE scheduled to transition back to IDLE
2198 // and re-kick off refresh
2199 assert(prechargeEvent
.scheduled());
2205 // transition to the refresh state and re-start refresh process
2206 // refresh state machine will schedule the next power state transition
2207 if (pwrState
== PWR_REF
) {
2208 // completed final PRE for refresh or exiting power-down
2209 assert(refreshState
== REF_PRE
|| refreshState
== REF_PD_EXIT
);
2211 // exited PRE PD for refresh, with no pending commands
2212 // bypass auto-refresh and go straight to SREF, where memory
2213 // will issue refresh immediately upon entry
2214 if (pwrStatePostRefresh
== PWR_PRE_PDN
&& isQueueEmpty() &&
2215 (memory
.drainState() != DrainState::Draining
) &&
2216 (memory
.drainState() != DrainState::Drained
)) {
2217 DPRINTF(DRAMState
, "Rank %d bypassing refresh and transitioning "
2218 "to self refresh at %11u tick\n", rank
, curTick());
2219 powerDownSleep(PWR_SREF
, curTick());
2221 // Since refresh was bypassed, remove event by decrementing count
2222 assert(outstandingEvents
== 1);
2223 --outstandingEvents
;
2225 // reset state back to IDLE temporarily until SREF is entered
2226 pwrState
= PWR_IDLE
;
2228 // Not bypassing refresh for SREF entry
2230 DPRINTF(DRAMState
, "Refreshing\n");
2232 // there should be nothing waiting at this point
2233 assert(!powerEvent
.scheduled());
2235 // kick the refresh event loop into action again, and that
2236 // in turn will schedule a transition to the idle power
2237 // state once the refresh is done
2238 schedule(refreshEvent
, curTick());
2240 // Banks transitioned to IDLE, start REF
2241 refreshState
= REF_START
;
2248 DRAMCtrl::Rank::updatePowerStats()
2250 // All commands up to refresh have completed
2251 // flush cmdList to DRAMPower
2254 // Call the function that calculates window energy at intermediate update
2255 // events like at refresh, stats dump as well as at simulation exit.
2256 // Window starts at the last time the calcWindowEnergy function was called
2257 // and is upto current time.
2258 power
.powerlib
.calcWindowEnergy(divCeil(curTick(), memory
.tCK
) -
2259 memory
.timeStampOffset
);
2261 // Get the energy from DRAMPower
2262 Data::MemoryPowerModel::Energy energy
= power
.powerlib
.getEnergy();
2264 // The energy components inside the power lib are calculated over
2265 // the window so accumulate into the corresponding gem5 stat
2266 actEnergy
+= energy
.act_energy
* memory
.devicesPerRank
;
2267 preEnergy
+= energy
.pre_energy
* memory
.devicesPerRank
;
2268 readEnergy
+= energy
.read_energy
* memory
.devicesPerRank
;
2269 writeEnergy
+= energy
.write_energy
* memory
.devicesPerRank
;
2270 refreshEnergy
+= energy
.ref_energy
* memory
.devicesPerRank
;
2271 actBackEnergy
+= energy
.act_stdby_energy
* memory
.devicesPerRank
;
2272 preBackEnergy
+= energy
.pre_stdby_energy
* memory
.devicesPerRank
;
2273 actPowerDownEnergy
+= energy
.f_act_pd_energy
* memory
.devicesPerRank
;
2274 prePowerDownEnergy
+= energy
.f_pre_pd_energy
* memory
.devicesPerRank
;
2275 selfRefreshEnergy
+= energy
.sref_energy
* memory
.devicesPerRank
;
2277 // Accumulate window energy into the total energy.
2278 totalEnergy
+= energy
.window_energy
* memory
.devicesPerRank
;
2279 // Average power must not be accumulated but calculated over the time
2280 // since last stats reset. SimClock::Frequency is tick period not tick
2283 // power (mW) = ----------- * ----------
2284 // time (tick) tick_frequency
2285 averagePower
= (totalEnergy
.value() /
2286 (curTick() - memory
.lastStatsResetTick
)) *
2287 (SimClock::Frequency
/ 1000000000.0);
2291 DRAMCtrl::Rank::computeStats()
2293 DPRINTF(DRAM
,"Computing stats due to a dump callback\n");
2298 // final update of power state times
2299 pwrStateTime
[pwrState
] += (curTick() - pwrStateTick
);
2300 pwrStateTick
= curTick();
2305 DRAMCtrl::Rank::resetStats() {
2306 // The only way to clear the counters in DRAMPower is to call
2307 // calcWindowEnergy function as that then calls clearCounters. The
2308 // clearCounters method itself is private.
2309 power
.powerlib
.calcWindowEnergy(divCeil(curTick(), memory
.tCK
) -
2310 memory
.timeStampOffset
);
2315 DRAMCtrl::Rank::regStats()
2319 .name(name() + ".memoryStateTime")
2320 .desc("Time in different power states");
2321 pwrStateTime
.subname(0, "IDLE");
2322 pwrStateTime
.subname(1, "REF");
2323 pwrStateTime
.subname(2, "SREF");
2324 pwrStateTime
.subname(3, "PRE_PDN");
2325 pwrStateTime
.subname(4, "ACT");
2326 pwrStateTime
.subname(5, "ACT_PDN");
2329 .name(name() + ".actEnergy")
2330 .desc("Energy for activate commands per rank (pJ)");
2333 .name(name() + ".preEnergy")
2334 .desc("Energy for precharge commands per rank (pJ)");
2337 .name(name() + ".readEnergy")
2338 .desc("Energy for read commands per rank (pJ)");
2341 .name(name() + ".writeEnergy")
2342 .desc("Energy for write commands per rank (pJ)");
2345 .name(name() + ".refreshEnergy")
2346 .desc("Energy for refresh commands per rank (pJ)");
2349 .name(name() + ".actBackEnergy")
2350 .desc("Energy for active background per rank (pJ)");
2353 .name(name() + ".preBackEnergy")
2354 .desc("Energy for precharge background per rank (pJ)");
2357 .name(name() + ".actPowerDownEnergy")
2358 .desc("Energy for active power-down per rank (pJ)");
2361 .name(name() + ".prePowerDownEnergy")
2362 .desc("Energy for precharge power-down per rank (pJ)");
2365 .name(name() + ".selfRefreshEnergy")
2366 .desc("Energy for self refresh per rank (pJ)");
2369 .name(name() + ".totalEnergy")
2370 .desc("Total energy per rank (pJ)");
2373 .name(name() + ".averagePower")
2374 .desc("Core power per rank (mW)");
2377 .name(name() + ".totalIdleTime")
2378 .desc("Total Idle time Per DRAM Rank");
2380 Stats::registerDumpCallback(new RankDumpCallback(this));
2381 Stats::registerResetCallback(new RankResetCallback(this));
2384 DRAMCtrl::regStats()
2386 using namespace Stats
;
2388 AbstractMemory::regStats();
2390 for (auto r
: ranks
) {
2394 registerResetCallback(new MemResetCallback(this));
2397 .name(name() + ".readReqs")
2398 .desc("Number of read requests accepted");
2401 .name(name() + ".writeReqs")
2402 .desc("Number of write requests accepted");
2405 .name(name() + ".readBursts")
2406 .desc("Number of DRAM read bursts, "
2407 "including those serviced by the write queue");
2410 .name(name() + ".writeBursts")
2411 .desc("Number of DRAM write bursts, "
2412 "including those merged in the write queue");
2415 .name(name() + ".servicedByWrQ")
2416 .desc("Number of DRAM read bursts serviced by the write queue");
2419 .name(name() + ".mergedWrBursts")
2420 .desc("Number of DRAM write bursts merged with an existing one");
2423 .name(name() + ".neitherReadNorWriteReqs")
2424 .desc("Number of requests that are neither read nor write");
2427 .init(banksPerRank
* ranksPerChannel
)
2428 .name(name() + ".perBankRdBursts")
2429 .desc("Per bank write bursts");
2432 .init(banksPerRank
* ranksPerChannel
)
2433 .name(name() + ".perBankWrBursts")
2434 .desc("Per bank write bursts");
2437 .name(name() + ".avgRdQLen")
2438 .desc("Average read queue length when enqueuing")
2442 .name(name() + ".avgWrQLen")
2443 .desc("Average write queue length when enqueuing")
2447 .name(name() + ".totQLat")
2448 .desc("Total ticks spent queuing");
2451 .name(name() + ".totBusLat")
2452 .desc("Total ticks spent in databus transfers");
2455 .name(name() + ".totMemAccLat")
2456 .desc("Total ticks spent from burst creation until serviced "
2460 .name(name() + ".avgQLat")
2461 .desc("Average queueing delay per DRAM burst")
2464 avgQLat
= totQLat
/ (readBursts
- servicedByWrQ
);
2467 .name(name() + ".avgBusLat")
2468 .desc("Average bus latency per DRAM burst")
2471 avgBusLat
= totBusLat
/ (readBursts
- servicedByWrQ
);
2474 .name(name() + ".avgMemAccLat")
2475 .desc("Average memory access latency per DRAM burst")
2478 avgMemAccLat
= totMemAccLat
/ (readBursts
- servicedByWrQ
);
2481 .name(name() + ".numRdRetry")
2482 .desc("Number of times read queue was full causing retry");
2485 .name(name() + ".numWrRetry")
2486 .desc("Number of times write queue was full causing retry");
2489 .name(name() + ".readRowHits")
2490 .desc("Number of row buffer hits during reads");
2493 .name(name() + ".writeRowHits")
2494 .desc("Number of row buffer hits during writes");
2497 .name(name() + ".readRowHitRate")
2498 .desc("Row buffer hit rate for reads")
2501 readRowHitRate
= (readRowHits
/ (readBursts
- servicedByWrQ
)) * 100;
2504 .name(name() + ".writeRowHitRate")
2505 .desc("Row buffer hit rate for writes")
2508 writeRowHitRate
= (writeRowHits
/ (writeBursts
- mergedWrBursts
)) * 100;
2511 .init(ceilLog2(burstSize
) + 1)
2512 .name(name() + ".readPktSize")
2513 .desc("Read request sizes (log2)");
2516 .init(ceilLog2(burstSize
) + 1)
2517 .name(name() + ".writePktSize")
2518 .desc("Write request sizes (log2)");
2521 .init(readBufferSize
)
2522 .name(name() + ".rdQLenPdf")
2523 .desc("What read queue length does an incoming req see");
2526 .init(writeBufferSize
)
2527 .name(name() + ".wrQLenPdf")
2528 .desc("What write queue length does an incoming req see");
2531 .init(maxAccessesPerRow
)
2532 .name(name() + ".bytesPerActivate")
2533 .desc("Bytes accessed per row activation")
2537 .init(readBufferSize
)
2538 .name(name() + ".rdPerTurnAround")
2539 .desc("Reads before turning the bus around for writes")
2543 .init(writeBufferSize
)
2544 .name(name() + ".wrPerTurnAround")
2545 .desc("Writes before turning the bus around for reads")
2549 .name(name() + ".bytesReadDRAM")
2550 .desc("Total number of bytes read from DRAM");
2553 .name(name() + ".bytesReadWrQ")
2554 .desc("Total number of bytes read from write queue");
2557 .name(name() + ".bytesWritten")
2558 .desc("Total number of bytes written to DRAM");
2561 .name(name() + ".bytesReadSys")
2562 .desc("Total read bytes from the system interface side");
2565 .name(name() + ".bytesWrittenSys")
2566 .desc("Total written bytes from the system interface side");
2569 .name(name() + ".avgRdBW")
2570 .desc("Average DRAM read bandwidth in MiByte/s")
2573 avgRdBW
= (bytesReadDRAM
/ 1000000) / simSeconds
;
2576 .name(name() + ".avgWrBW")
2577 .desc("Average achieved write bandwidth in MiByte/s")
2580 avgWrBW
= (bytesWritten
/ 1000000) / simSeconds
;
2583 .name(name() + ".avgRdBWSys")
2584 .desc("Average system read bandwidth in MiByte/s")
2587 avgRdBWSys
= (bytesReadSys
/ 1000000) / simSeconds
;
2590 .name(name() + ".avgWrBWSys")
2591 .desc("Average system write bandwidth in MiByte/s")
2594 avgWrBWSys
= (bytesWrittenSys
/ 1000000) / simSeconds
;
2597 .name(name() + ".peakBW")
2598 .desc("Theoretical peak bandwidth in MiByte/s")
2601 peakBW
= (SimClock::Frequency
/ tBURST
) * burstSize
/ 1000000;
2604 .name(name() + ".busUtil")
2605 .desc("Data bus utilization in percentage")
2607 busUtil
= (avgRdBW
+ avgWrBW
) / peakBW
* 100;
2610 .name(name() + ".totGap")
2611 .desc("Total gap between requests");
2614 .name(name() + ".avgGap")
2615 .desc("Average gap between requests")
2618 avgGap
= totGap
/ (readReqs
+ writeReqs
);
2620 // Stats for DRAM Power calculation based on Micron datasheet
2622 .name(name() + ".busUtilRead")
2623 .desc("Data bus utilization in percentage for reads")
2626 busUtilRead
= avgRdBW
/ peakBW
* 100;
2629 .name(name() + ".busUtilWrite")
2630 .desc("Data bus utilization in percentage for writes")
2633 busUtilWrite
= avgWrBW
/ peakBW
* 100;
2636 .name(name() + ".pageHitRate")
2637 .desc("Row buffer hit rate, read and write combined")
2640 pageHitRate
= (writeRowHits
+ readRowHits
) /
2641 (writeBursts
- mergedWrBursts
+ readBursts
- servicedByWrQ
) * 100;
2645 DRAMCtrl::recvFunctional(PacketPtr pkt
)
2647 // rely on the abstract memory
2648 functionalAccess(pkt
);
2652 DRAMCtrl::getSlavePort(const string
&if_name
, PortID idx
)
2654 if (if_name
!= "port") {
2655 return MemObject::getSlavePort(if_name
, idx
);
2664 // if there is anything in any of our internal queues, keep track
2666 if (!(writeQueue
.empty() && readQueue
.empty() && respQueue
.empty() &&
2667 allRanksDrained())) {
2669 DPRINTF(Drain
, "DRAM controller not drained, write: %d, read: %d,"
2670 " resp: %d\n", writeQueue
.size(), readQueue
.size(),
2673 // the only queue that is not drained automatically over time
2674 // is the write queue, thus kick things into action if needed
2675 if (!writeQueue
.empty() && !nextReqEvent
.scheduled()) {
2676 schedule(nextReqEvent
, curTick());
2679 // also need to kick off events to exit self-refresh
2680 for (auto r
: ranks
) {
2681 // force self-refresh exit, which in turn will issue auto-refresh
2682 if (r
->pwrState
== PWR_SREF
) {
2683 DPRINTF(DRAM
,"Rank%d: Forcing self-refresh wakeup in drain\n",
2685 r
->scheduleWakeUpEvent(tXS
);
2689 return DrainState::Draining
;
2691 return DrainState::Drained
;
2696 DRAMCtrl::allRanksDrained() const
2698 // true until proven false
2699 bool all_ranks_drained
= true;
2700 for (auto r
: ranks
) {
2701 // then verify that the power state is IDLE ensuring all banks are
2702 // closed and rank is not in a low power state. Also verify that rank
2703 // is idle from a refresh point of view.
2704 all_ranks_drained
= r
->inPwrIdleState() && r
->inRefIdleState() &&
2707 return all_ranks_drained
;
2711 DRAMCtrl::drainResume()
2713 if (!isTimingMode
&& system()->isTimingMode()) {
2714 // if we switched to timing mode, kick things into action,
2715 // and behave as if we restored from a checkpoint
2717 } else if (isTimingMode
&& !system()->isTimingMode()) {
2718 // if we switch from timing mode, stop the refresh events to
2719 // not cause issues with KVM
2720 for (auto r
: ranks
) {
2726 isTimingMode
= system()->isTimingMode();
2729 DRAMCtrl::MemoryPort::MemoryPort(const std::string
& name
, DRAMCtrl
& _memory
)
2730 : QueuedSlavePort(name
, &_memory
, queue
), queue(_memory
, *this),
2735 DRAMCtrl::MemoryPort::getAddrRanges() const
2737 AddrRangeList ranges
;
2738 ranges
.push_back(memory
.getAddrRange());
2743 DRAMCtrl::MemoryPort::recvFunctional(PacketPtr pkt
)
2745 pkt
->pushLabel(memory
.name());
2747 if (!queue
.checkFunctional(pkt
)) {
2748 // Default implementation of SimpleTimingPort::recvFunctional()
2749 // calls recvAtomic() and throws away the latency; we can save a
2750 // little here by just not calculating the latency.
2751 memory
.recvFunctional(pkt
);
2758 DRAMCtrl::MemoryPort::recvAtomic(PacketPtr pkt
)
2760 return memory
.recvAtomic(pkt
);
2764 DRAMCtrl::MemoryPort::recvTimingReq(PacketPtr pkt
)
2766 // pass it to the memory controller
2767 return memory
.recvTimingReq(pkt
);
2771 DRAMCtrlParams::create()
2773 return new DRAMCtrl(this);