dram_ctrl.cc revision 10561
19243SN/A/* 210206Sandreas.hansson@arm.com * Copyright (c) 2010-2014 ARM Limited 39243SN/A * All rights reserved 49243SN/A * 59243SN/A * The license below extends only to copyright in the software and shall 69243SN/A * not be construed as granting a license to any other intellectual 79243SN/A * property including but not limited to intellectual property relating 89243SN/A * to a hardware implementation of the functionality of the software 99243SN/A * licensed hereunder. You may use the software subject to the license 109243SN/A * terms below provided that you ensure that this notice is replicated 119243SN/A * unmodified and in its entirety in all distributions of the software, 129243SN/A * modified or unmodified, in source code or in binary form. 139243SN/A * 149831SN/A * Copyright (c) 2013 Amin Farmahini-Farahani 159831SN/A * All rights reserved. 169831SN/A * 179243SN/A * Redistribution and use in source and binary forms, with or without 189243SN/A * modification, are permitted provided that the following conditions are 199243SN/A * met: redistributions of source code must retain the above copyright 209243SN/A * notice, this list of conditions and the following disclaimer; 219243SN/A * redistributions in binary form must reproduce the above copyright 229243SN/A * notice, this list of conditions and the following disclaimer in the 239243SN/A * documentation and/or other materials provided with the distribution; 249243SN/A * neither the name of the copyright holders nor the names of its 259243SN/A * contributors may be used to endorse or promote products derived from 269243SN/A * this software without specific prior written permission. 279243SN/A * 289243SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 299243SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 309243SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 319243SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 329243SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 339243SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 349243SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 359243SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 369243SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 379243SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 389243SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 399243SN/A * 409243SN/A * Authors: Andreas Hansson 419243SN/A * Ani Udipi 429967SN/A * Neha Agarwal 439243SN/A */ 449243SN/A 4510146Sandreas.hansson@arm.com#include "base/bitfield.hh" 469356SN/A#include "base/trace.hh" 4710146Sandreas.hansson@arm.com#include "debug/DRAM.hh" 4810247Sandreas.hansson@arm.com#include "debug/DRAMPower.hh" 4910208Sandreas.hansson@arm.com#include "debug/DRAMState.hh" 509352SN/A#include "debug/Drain.hh" 5110146Sandreas.hansson@arm.com#include "mem/dram_ctrl.hh" 529814SN/A#include "sim/system.hh" 539243SN/A 549243SN/Ausing namespace std; 5510432SOmar.Naji@arm.comusing namespace Data; 569243SN/A 5710146Sandreas.hansson@arm.comDRAMCtrl::DRAMCtrl(const DRAMCtrlParams* p) : 589243SN/A AbstractMemory(p), 599243SN/A port(name() + ".port", *this), 609243SN/A retryRdReq(false), retryWrReq(false), 6110211Sandreas.hansson@arm.com busState(READ), 6210208Sandreas.hansson@arm.com nextReqEvent(this), respondEvent(this), activateEvent(this), 6310208Sandreas.hansson@arm.com prechargeEvent(this), refreshEvent(this), powerEvent(this), 6410208Sandreas.hansson@arm.com drainManager(NULL), 6510489SOmar.Naji@arm.com deviceSize(p->device_size), 669831SN/A deviceBusWidth(p->device_bus_width), burstLength(p->burst_length), 679831SN/A deviceRowBufferSize(p->device_rowbuffer_size), 689831SN/A devicesPerRank(p->devices_per_rank), 699831SN/A burstSize((devicesPerRank * burstLength * deviceBusWidth) / 8), 709831SN/A rowBufferSize(devicesPerRank * deviceRowBufferSize), 7110140SN/A columnsPerRowBuffer(rowBufferSize / burstSize), 7210286Sandreas.hansson@arm.com columnsPerStripe(range.granularity() / burstSize), 739243SN/A ranksPerChannel(p->ranks_per_channel), 7410394Swendy.elsasser@arm.com bankGroupsPerRank(p->bank_groups_per_rank), 7510394Swendy.elsasser@arm.com bankGroupArch(p->bank_groups_per_rank > 0), 769566SN/A banksPerRank(p->banks_per_rank), channels(p->channels), rowsPerBank(0), 779243SN/A readBufferSize(p->read_buffer_size), 789243SN/A writeBufferSize(p->write_buffer_size), 7910140SN/A writeHighThreshold(writeBufferSize * p->write_high_thresh_perc / 100.0), 8010140SN/A writeLowThreshold(writeBufferSize * p->write_low_thresh_perc / 100.0), 8110147Sandreas.hansson@arm.com minWritesPerSwitch(p->min_writes_per_switch), 8210147Sandreas.hansson@arm.com writesThisTime(0), readsThisTime(0), 8310393Swendy.elsasser@arm.com tCK(p->tCK), tWTR(p->tWTR), tRTW(p->tRTW), tCS(p->tCS), tBURST(p->tBURST), 8410394Swendy.elsasser@arm.com tCCD_L(p->tCCD_L), tRCD(p->tRCD), tCL(p->tCL), tRP(p->tRP), tRAS(p->tRAS), 8510394Swendy.elsasser@arm.com tWR(p->tWR), tRTP(p->tRTP), tRFC(p->tRFC), tREFI(p->tREFI), tRRD(p->tRRD), 8610394Swendy.elsasser@arm.com tRRD_L(p->tRRD_L), tXAW(p->tXAW), activationLimit(p->activation_limit), 879243SN/A memSchedPolicy(p->mem_sched_policy), addrMapping(p->addr_mapping), 889243SN/A pageMgmt(p->page_policy), 8910141SN/A maxAccessesPerRow(p->max_accesses_per_row), 909726SN/A frontendLatency(p->static_frontend_latency), 919726SN/A backendLatency(p->static_backend_latency), 9210208Sandreas.hansson@arm.com busBusyUntil(0), refreshDueAt(0), refreshState(REF_IDLE), 9310208Sandreas.hansson@arm.com pwrStateTrans(PWR_IDLE), pwrState(PWR_IDLE), prevArrival(0), 9410393Swendy.elsasser@arm.com nextReqTime(0), pwrStateTick(0), numBanksActive(0), 9510432SOmar.Naji@arm.com activeRank(0), timeStampOffset(0) 969243SN/A{ 979243SN/A // create the bank states based on the dimensions of the ranks and 989243SN/A // banks 999243SN/A banks.resize(ranksPerChannel); 10010432SOmar.Naji@arm.com 10110432SOmar.Naji@arm.com //create list of drampower objects. For each rank 1 drampower instance. 10210432SOmar.Naji@arm.com for (int i = 0; i < ranksPerChannel; i++) { 10310432SOmar.Naji@arm.com DRAMPower drampower = DRAMPower(p, false); 10410432SOmar.Naji@arm.com rankPower.emplace_back(drampower); 10510432SOmar.Naji@arm.com } 10610432SOmar.Naji@arm.com 1079969SN/A actTicks.resize(ranksPerChannel); 1089243SN/A for (size_t c = 0; c < ranksPerChannel; ++c) { 1099243SN/A banks[c].resize(banksPerRank); 1109969SN/A actTicks[c].resize(activationLimit, 0); 1119243SN/A } 1129243SN/A 11310246Sandreas.hansson@arm.com // set the bank indices 11410246Sandreas.hansson@arm.com for (int r = 0; r < ranksPerChannel; r++) { 11510246Sandreas.hansson@arm.com for (int b = 0; b < banksPerRank; b++) { 11610246Sandreas.hansson@arm.com banks[r][b].rank = r; 11710246Sandreas.hansson@arm.com banks[r][b].bank = b; 11810561SOmar.Naji@arm.com // GDDR addressing of banks to BG is linear. 11910561SOmar.Naji@arm.com // Here we assume that all DRAM generations address bank groups as 12010561SOmar.Naji@arm.com // follows: 12110394Swendy.elsasser@arm.com if (bankGroupArch) { 12210394Swendy.elsasser@arm.com // Simply assign lower bits to bank group in order to 12310394Swendy.elsasser@arm.com // rotate across bank groups as banks are incremented 12410394Swendy.elsasser@arm.com // e.g. with 4 banks per bank group and 16 banks total: 12510394Swendy.elsasser@arm.com // banks 0,4,8,12 are in bank group 0 12610394Swendy.elsasser@arm.com // banks 1,5,9,13 are in bank group 1 12710394Swendy.elsasser@arm.com // banks 2,6,10,14 are in bank group 2 12810394Swendy.elsasser@arm.com // banks 3,7,11,15 are in bank group 3 12910394Swendy.elsasser@arm.com banks[r][b].bankgr = b % bankGroupsPerRank; 13010394Swendy.elsasser@arm.com } else { 13110394Swendy.elsasser@arm.com // No bank groups; simply assign to bank number 13210394Swendy.elsasser@arm.com banks[r][b].bankgr = b; 13310394Swendy.elsasser@arm.com } 13410246Sandreas.hansson@arm.com } 13510246Sandreas.hansson@arm.com } 13610246Sandreas.hansson@arm.com 13710140SN/A // perform a basic check of the write thresholds 13810140SN/A if (p->write_low_thresh_perc >= p->write_high_thresh_perc) 13910140SN/A fatal("Write buffer low threshold %d must be smaller than the " 14010140SN/A "high threshold %d\n", p->write_low_thresh_perc, 14110140SN/A p->write_high_thresh_perc); 1429243SN/A 1439243SN/A // determine the rows per bank by looking at the total capacity 1449567SN/A uint64_t capacity = ULL(1) << ceilLog2(AbstractMemory::size()); 1459243SN/A 14610489SOmar.Naji@arm.com // determine the dram actual capacity from the DRAM config in Mbytes 14710489SOmar.Naji@arm.com uint64_t deviceCapacity = deviceSize / (1024 * 1024) * devicesPerRank * 14810489SOmar.Naji@arm.com ranksPerChannel; 14910489SOmar.Naji@arm.com 15010489SOmar.Naji@arm.com // if actual DRAM size does not match memory capacity in system warn! 15110489SOmar.Naji@arm.com if (deviceCapacity != capacity / (1024 * 1024)) 15210489SOmar.Naji@arm.com warn("DRAM device capacity (%d Mbytes) does not match the " 15310489SOmar.Naji@arm.com "address range assigned (%d Mbytes)\n", deviceCapacity, 15410489SOmar.Naji@arm.com capacity / (1024 * 1024)); 15510489SOmar.Naji@arm.com 1569243SN/A DPRINTF(DRAM, "Memory capacity %lld (%lld) bytes\n", capacity, 1579243SN/A AbstractMemory::size()); 1589831SN/A 1599831SN/A DPRINTF(DRAM, "Row buffer size %d bytes with %d columns per row buffer\n", 1609831SN/A rowBufferSize, columnsPerRowBuffer); 1619831SN/A 1629831SN/A rowsPerBank = capacity / (rowBufferSize * banksPerRank * ranksPerChannel); 1639243SN/A 16410286Sandreas.hansson@arm.com // a bit of sanity checks on the interleaving 1659566SN/A if (range.interleaved()) { 1669566SN/A if (channels != range.stripes()) 16710143SN/A fatal("%s has %d interleaved address stripes but %d channel(s)\n", 1689566SN/A name(), range.stripes(), channels); 1699566SN/A 17010136SN/A if (addrMapping == Enums::RoRaBaChCo) { 1719831SN/A if (rowBufferSize != range.granularity()) { 17210286Sandreas.hansson@arm.com fatal("Channel interleaving of %s doesn't match RoRaBaChCo " 17310136SN/A "address map\n", name()); 1749566SN/A } 17510286Sandreas.hansson@arm.com } else if (addrMapping == Enums::RoRaBaCoCh || 17610286Sandreas.hansson@arm.com addrMapping == Enums::RoCoRaBaCh) { 17710286Sandreas.hansson@arm.com // for the interleavings with channel bits in the bottom, 17810286Sandreas.hansson@arm.com // if the system uses a channel striping granularity that 17910286Sandreas.hansson@arm.com // is larger than the DRAM burst size, then map the 18010286Sandreas.hansson@arm.com // sequential accesses within a stripe to a number of 18110286Sandreas.hansson@arm.com // columns in the DRAM, effectively placing some of the 18210286Sandreas.hansson@arm.com // lower-order column bits as the least-significant bits 18310286Sandreas.hansson@arm.com // of the address (above the ones denoting the burst size) 18410286Sandreas.hansson@arm.com assert(columnsPerStripe >= 1); 18510286Sandreas.hansson@arm.com 18610286Sandreas.hansson@arm.com // channel striping has to be done at a granularity that 18710286Sandreas.hansson@arm.com // is equal or larger to a cache line 18810286Sandreas.hansson@arm.com if (system()->cacheLineSize() > range.granularity()) { 18910286Sandreas.hansson@arm.com fatal("Channel interleaving of %s must be at least as large " 19010286Sandreas.hansson@arm.com "as the cache line size\n", name()); 1919669SN/A } 19210286Sandreas.hansson@arm.com 19310286Sandreas.hansson@arm.com // ...and equal or smaller than the row-buffer size 19410286Sandreas.hansson@arm.com if (rowBufferSize < range.granularity()) { 19510286Sandreas.hansson@arm.com fatal("Channel interleaving of %s must be at most as large " 19610286Sandreas.hansson@arm.com "as the row-buffer size\n", name()); 19710286Sandreas.hansson@arm.com } 19810286Sandreas.hansson@arm.com // this is essentially the check above, so just to be sure 19910286Sandreas.hansson@arm.com assert(columnsPerStripe <= columnsPerRowBuffer); 2009566SN/A } 2019566SN/A } 20210207Sandreas.hansson@arm.com 20310207Sandreas.hansson@arm.com // some basic sanity checks 20410207Sandreas.hansson@arm.com if (tREFI <= tRP || tREFI <= tRFC) { 20510207Sandreas.hansson@arm.com fatal("tREFI (%d) must be larger than tRP (%d) and tRFC (%d)\n", 20610207Sandreas.hansson@arm.com tREFI, tRP, tRFC); 20710207Sandreas.hansson@arm.com } 20810394Swendy.elsasser@arm.com 20910394Swendy.elsasser@arm.com // basic bank group architecture checks -> 21010394Swendy.elsasser@arm.com if (bankGroupArch) { 21110394Swendy.elsasser@arm.com // must have at least one bank per bank group 21210394Swendy.elsasser@arm.com if (bankGroupsPerRank > banksPerRank) { 21310394Swendy.elsasser@arm.com fatal("banks per rank (%d) must be equal to or larger than " 21410394Swendy.elsasser@arm.com "banks groups per rank (%d)\n", 21510394Swendy.elsasser@arm.com banksPerRank, bankGroupsPerRank); 21610394Swendy.elsasser@arm.com } 21710394Swendy.elsasser@arm.com // must have same number of banks in each bank group 21810394Swendy.elsasser@arm.com if ((banksPerRank % bankGroupsPerRank) != 0) { 21910394Swendy.elsasser@arm.com fatal("Banks per rank (%d) must be evenly divisible by bank groups " 22010394Swendy.elsasser@arm.com "per rank (%d) for equal banks per bank group\n", 22110394Swendy.elsasser@arm.com banksPerRank, bankGroupsPerRank); 22210394Swendy.elsasser@arm.com } 22310394Swendy.elsasser@arm.com // tCCD_L should be greater than minimal, back-to-back burst delay 22410394Swendy.elsasser@arm.com if (tCCD_L <= tBURST) { 22510394Swendy.elsasser@arm.com fatal("tCCD_L (%d) should be larger than tBURST (%d) when " 22610394Swendy.elsasser@arm.com "bank groups per rank (%d) is greater than 1\n", 22710394Swendy.elsasser@arm.com tCCD_L, tBURST, bankGroupsPerRank); 22810394Swendy.elsasser@arm.com } 22910394Swendy.elsasser@arm.com // tRRD_L is greater than minimal, same bank group ACT-to-ACT delay 23010561SOmar.Naji@arm.com // some datasheets might specify it equal to tRRD 23110561SOmar.Naji@arm.com if (tRRD_L < tRRD) { 23210394Swendy.elsasser@arm.com fatal("tRRD_L (%d) should be larger than tRRD (%d) when " 23310394Swendy.elsasser@arm.com "bank groups per rank (%d) is greater than 1\n", 23410394Swendy.elsasser@arm.com tRRD_L, tRRD, bankGroupsPerRank); 23510394Swendy.elsasser@arm.com } 23610394Swendy.elsasser@arm.com } 23710394Swendy.elsasser@arm.com 2389243SN/A} 2399243SN/A 2409243SN/Avoid 24110146Sandreas.hansson@arm.comDRAMCtrl::init() 24210140SN/A{ 24310466Sandreas.hansson@arm.com AbstractMemory::init(); 24410466Sandreas.hansson@arm.com 24510466Sandreas.hansson@arm.com if (!port.isConnected()) { 24610146Sandreas.hansson@arm.com fatal("DRAMCtrl %s is unconnected!\n", name()); 24710140SN/A } else { 24810140SN/A port.sendRangeChange(); 24910140SN/A } 25010140SN/A} 25110140SN/A 25210140SN/Avoid 25310146Sandreas.hansson@arm.comDRAMCtrl::startup() 2549243SN/A{ 25510432SOmar.Naji@arm.com // timestamp offset should be in clock cycles for DRAMPower 25610432SOmar.Naji@arm.com timeStampOffset = divCeil(curTick(), tCK); 25710143SN/A // update the start tick for the precharge accounting to the 25810143SN/A // current tick 25910208Sandreas.hansson@arm.com pwrStateTick = curTick(); 26010143SN/A 26110206Sandreas.hansson@arm.com // shift the bus busy time sufficiently far ahead that we never 26210206Sandreas.hansson@arm.com // have to worry about negative values when computing the time for 26310206Sandreas.hansson@arm.com // the next request, this will add an insignificant bubble at the 26410206Sandreas.hansson@arm.com // start of simulation 26510206Sandreas.hansson@arm.com busBusyUntil = curTick() + tRP + tRCD + tCL; 26610206Sandreas.hansson@arm.com 26710207Sandreas.hansson@arm.com // kick off the refresh, and give ourselves enough time to 26810207Sandreas.hansson@arm.com // precharge 26910207Sandreas.hansson@arm.com schedule(refreshEvent, curTick() + tREFI - tRP); 2709243SN/A} 2719243SN/A 2729243SN/ATick 27310146Sandreas.hansson@arm.comDRAMCtrl::recvAtomic(PacketPtr pkt) 2749243SN/A{ 2759243SN/A DPRINTF(DRAM, "recvAtomic: %s 0x%x\n", pkt->cmdString(), pkt->getAddr()); 2769243SN/A 2779243SN/A // do the actual memory access and turn the packet into a response 2789243SN/A access(pkt); 2799243SN/A 2809243SN/A Tick latency = 0; 2819243SN/A if (!pkt->memInhibitAsserted() && pkt->hasData()) { 2829243SN/A // this value is not supposed to be accurate, just enough to 2839243SN/A // keep things going, mimic a closed page 2849243SN/A latency = tRP + tRCD + tCL; 2859243SN/A } 2869243SN/A return latency; 2879243SN/A} 2889243SN/A 2899243SN/Abool 29010146Sandreas.hansson@arm.comDRAMCtrl::readQueueFull(unsigned int neededEntries) const 2919243SN/A{ 2929831SN/A DPRINTF(DRAM, "Read queue limit %d, current size %d, entries needed %d\n", 2939831SN/A readBufferSize, readQueue.size() + respQueue.size(), 2949831SN/A neededEntries); 2959243SN/A 2969831SN/A return 2979831SN/A (readQueue.size() + respQueue.size() + neededEntries) > readBufferSize; 2989243SN/A} 2999243SN/A 3009243SN/Abool 30110146Sandreas.hansson@arm.comDRAMCtrl::writeQueueFull(unsigned int neededEntries) const 3029243SN/A{ 3039831SN/A DPRINTF(DRAM, "Write queue limit %d, current size %d, entries needed %d\n", 3049831SN/A writeBufferSize, writeQueue.size(), neededEntries); 3059831SN/A return (writeQueue.size() + neededEntries) > writeBufferSize; 3069243SN/A} 3079243SN/A 30810146Sandreas.hansson@arm.comDRAMCtrl::DRAMPacket* 30910146Sandreas.hansson@arm.comDRAMCtrl::decodeAddr(PacketPtr pkt, Addr dramPktAddr, unsigned size, 31010143SN/A bool isRead) 3119243SN/A{ 3129669SN/A // decode the address based on the address mapping scheme, with 31310136SN/A // Ro, Ra, Co, Ba and Ch denoting row, rank, column, bank and 31410136SN/A // channel, respectively 3159243SN/A uint8_t rank; 3169967SN/A uint8_t bank; 31710245Sandreas.hansson@arm.com // use a 64-bit unsigned during the computations as the row is 31810245Sandreas.hansson@arm.com // always the top bits, and check before creating the DRAMPacket 31910245Sandreas.hansson@arm.com uint64_t row; 3209243SN/A 32110286Sandreas.hansson@arm.com // truncate the address to a DRAM burst, which makes it unique to 32210286Sandreas.hansson@arm.com // a specific column, row, bank, rank and channel 3239831SN/A Addr addr = dramPktAddr / burstSize; 3249243SN/A 3259491SN/A // we have removed the lowest order address bits that denote the 3269831SN/A // position within the column 32710136SN/A if (addrMapping == Enums::RoRaBaChCo) { 3289491SN/A // the lowest order bits denote the column to ensure that 3299491SN/A // sequential cache lines occupy the same row 3309831SN/A addr = addr / columnsPerRowBuffer; 3319243SN/A 3329669SN/A // take out the channel part of the address 3339566SN/A addr = addr / channels; 3349566SN/A 3359669SN/A // after the channel bits, get the bank bits to interleave 3369669SN/A // over the banks 3379669SN/A bank = addr % banksPerRank; 3389669SN/A addr = addr / banksPerRank; 3399669SN/A 3409669SN/A // after the bank, we get the rank bits which thus interleaves 3419669SN/A // over the ranks 3429669SN/A rank = addr % ranksPerChannel; 3439669SN/A addr = addr / ranksPerChannel; 3449669SN/A 3459669SN/A // lastly, get the row bits 3469669SN/A row = addr % rowsPerBank; 3479669SN/A addr = addr / rowsPerBank; 34810136SN/A } else if (addrMapping == Enums::RoRaBaCoCh) { 34910286Sandreas.hansson@arm.com // take out the lower-order column bits 35010286Sandreas.hansson@arm.com addr = addr / columnsPerStripe; 35110286Sandreas.hansson@arm.com 3529669SN/A // take out the channel part of the address 3539669SN/A addr = addr / channels; 3549669SN/A 35510286Sandreas.hansson@arm.com // next, the higher-order column bites 35610286Sandreas.hansson@arm.com addr = addr / (columnsPerRowBuffer / columnsPerStripe); 3579669SN/A 3589669SN/A // after the column bits, we get the bank bits to interleave 3599491SN/A // over the banks 3609243SN/A bank = addr % banksPerRank; 3619243SN/A addr = addr / banksPerRank; 3629243SN/A 3639491SN/A // after the bank, we get the rank bits which thus interleaves 3649491SN/A // over the ranks 3659243SN/A rank = addr % ranksPerChannel; 3669243SN/A addr = addr / ranksPerChannel; 3679243SN/A 3689491SN/A // lastly, get the row bits 3699243SN/A row = addr % rowsPerBank; 3709243SN/A addr = addr / rowsPerBank; 37110136SN/A } else if (addrMapping == Enums::RoCoRaBaCh) { 3729491SN/A // optimise for closed page mode and utilise maximum 3739491SN/A // parallelism of the DRAM (at the cost of power) 3749491SN/A 37510286Sandreas.hansson@arm.com // take out the lower-order column bits 37610286Sandreas.hansson@arm.com addr = addr / columnsPerStripe; 37710286Sandreas.hansson@arm.com 3789566SN/A // take out the channel part of the address, not that this has 3799566SN/A // to match with how accesses are interleaved between the 3809566SN/A // controllers in the address mapping 3819566SN/A addr = addr / channels; 3829566SN/A 3839491SN/A // start with the bank bits, as this provides the maximum 3849491SN/A // opportunity for parallelism between requests 3859243SN/A bank = addr % banksPerRank; 3869243SN/A addr = addr / banksPerRank; 3879243SN/A 3889491SN/A // next get the rank bits 3899243SN/A rank = addr % ranksPerChannel; 3909243SN/A addr = addr / ranksPerChannel; 3919243SN/A 39210286Sandreas.hansson@arm.com // next, the higher-order column bites 39310286Sandreas.hansson@arm.com addr = addr / (columnsPerRowBuffer / columnsPerStripe); 3949243SN/A 3959491SN/A // lastly, get the row bits 3969243SN/A row = addr % rowsPerBank; 3979243SN/A addr = addr / rowsPerBank; 3989243SN/A } else 3999243SN/A panic("Unknown address mapping policy chosen!"); 4009243SN/A 4019243SN/A assert(rank < ranksPerChannel); 4029243SN/A assert(bank < banksPerRank); 4039243SN/A assert(row < rowsPerBank); 40410245Sandreas.hansson@arm.com assert(row < Bank::NO_ROW); 4059243SN/A 4069243SN/A DPRINTF(DRAM, "Address: %lld Rank %d Bank %d Row %d\n", 4079831SN/A dramPktAddr, rank, bank, row); 4089243SN/A 4099243SN/A // create the corresponding DRAM packet with the entry time and 4109567SN/A // ready time set to the current tick, the latter will be updated 4119567SN/A // later 4129967SN/A uint16_t bank_id = banksPerRank * rank + bank; 4139967SN/A return new DRAMPacket(pkt, isRead, rank, bank, row, bank_id, dramPktAddr, 4149967SN/A size, banks[rank][bank]); 4159243SN/A} 4169243SN/A 4179243SN/Avoid 41810146Sandreas.hansson@arm.comDRAMCtrl::addToReadQueue(PacketPtr pkt, unsigned int pktCount) 4199243SN/A{ 4209243SN/A // only add to the read queue here. whenever the request is 4219243SN/A // eventually done, set the readyTime, and call schedule() 4229243SN/A assert(!pkt->isWrite()); 4239243SN/A 4249831SN/A assert(pktCount != 0); 4259831SN/A 4269831SN/A // if the request size is larger than burst size, the pkt is split into 4279831SN/A // multiple DRAM packets 4289831SN/A // Note if the pkt starting address is not aligened to burst size, the 4299831SN/A // address of first DRAM packet is kept unaliged. Subsequent DRAM packets 4309831SN/A // are aligned to burst size boundaries. This is to ensure we accurately 4319831SN/A // check read packets against packets in write queue. 4329243SN/A Addr addr = pkt->getAddr(); 4339831SN/A unsigned pktsServicedByWrQ = 0; 4349831SN/A BurstHelper* burst_helper = NULL; 4359831SN/A for (int cnt = 0; cnt < pktCount; ++cnt) { 4369831SN/A unsigned size = std::min((addr | (burstSize - 1)) + 1, 4379831SN/A pkt->getAddr() + pkt->getSize()) - addr; 4389831SN/A readPktSize[ceilLog2(size)]++; 4399831SN/A readBursts++; 4409243SN/A 4419831SN/A // First check write buffer to see if the data is already at 4429831SN/A // the controller 4439831SN/A bool foundInWrQ = false; 4449833SN/A for (auto i = writeQueue.begin(); i != writeQueue.end(); ++i) { 4459832SN/A // check if the read is subsumed in the write entry we are 4469832SN/A // looking at 4479832SN/A if ((*i)->addr <= addr && 4489832SN/A (addr + size) <= ((*i)->addr + (*i)->size)) { 4499831SN/A foundInWrQ = true; 4509831SN/A servicedByWrQ++; 4519831SN/A pktsServicedByWrQ++; 4529831SN/A DPRINTF(DRAM, "Read to addr %lld with size %d serviced by " 4539831SN/A "write queue\n", addr, size); 4549975SN/A bytesReadWrQ += burstSize; 4559831SN/A break; 4569831SN/A } 4579243SN/A } 4589831SN/A 4599831SN/A // If not found in the write q, make a DRAM packet and 4609831SN/A // push it onto the read queue 4619831SN/A if (!foundInWrQ) { 4629831SN/A 4639831SN/A // Make the burst helper for split packets 4649831SN/A if (pktCount > 1 && burst_helper == NULL) { 4659831SN/A DPRINTF(DRAM, "Read to addr %lld translates to %d " 4669831SN/A "dram requests\n", pkt->getAddr(), pktCount); 4679831SN/A burst_helper = new BurstHelper(pktCount); 4689831SN/A } 4699831SN/A 4709966SN/A DRAMPacket* dram_pkt = decodeAddr(pkt, addr, size, true); 4719831SN/A dram_pkt->burstHelper = burst_helper; 4729831SN/A 4739831SN/A assert(!readQueueFull(1)); 4749831SN/A rdQLenPdf[readQueue.size() + respQueue.size()]++; 4759831SN/A 4769831SN/A DPRINTF(DRAM, "Adding to read queue\n"); 4779831SN/A 4789831SN/A readQueue.push_back(dram_pkt); 4799831SN/A 4809831SN/A // Update stats 4819831SN/A avgRdQLen = readQueue.size() + respQueue.size(); 4829831SN/A } 4839831SN/A 4849831SN/A // Starting address of next dram pkt (aligend to burstSize boundary) 4859831SN/A addr = (addr | (burstSize - 1)) + 1; 4869243SN/A } 4879243SN/A 4889831SN/A // If all packets are serviced by write queue, we send the repsonse back 4899831SN/A if (pktsServicedByWrQ == pktCount) { 4909831SN/A accessAndRespond(pkt, frontendLatency); 4919831SN/A return; 4929831SN/A } 4939243SN/A 4949831SN/A // Update how many split packets are serviced by write queue 4959831SN/A if (burst_helper != NULL) 4969831SN/A burst_helper->burstsServiced = pktsServicedByWrQ; 4979243SN/A 49810206Sandreas.hansson@arm.com // If we are not already scheduled to get a request out of the 49910206Sandreas.hansson@arm.com // queue, do so now 50010206Sandreas.hansson@arm.com if (!nextReqEvent.scheduled()) { 5019567SN/A DPRINTF(DRAM, "Request scheduled immediately\n"); 5029567SN/A schedule(nextReqEvent, curTick()); 5039243SN/A } 5049243SN/A} 5059243SN/A 5069243SN/Avoid 50710146Sandreas.hansson@arm.comDRAMCtrl::addToWriteQueue(PacketPtr pkt, unsigned int pktCount) 5089243SN/A{ 5099243SN/A // only add to the write queue here. whenever the request is 5109243SN/A // eventually done, set the readyTime, and call schedule() 5119243SN/A assert(pkt->isWrite()); 5129243SN/A 5139831SN/A // if the request size is larger than burst size, the pkt is split into 5149831SN/A // multiple DRAM packets 5159831SN/A Addr addr = pkt->getAddr(); 5169831SN/A for (int cnt = 0; cnt < pktCount; ++cnt) { 5179831SN/A unsigned size = std::min((addr | (burstSize - 1)) + 1, 5189831SN/A pkt->getAddr() + pkt->getSize()) - addr; 5199831SN/A writePktSize[ceilLog2(size)]++; 5209831SN/A writeBursts++; 5219243SN/A 5229832SN/A // see if we can merge with an existing item in the write 5239838SN/A // queue and keep track of whether we have merged or not so we 5249838SN/A // can stop at that point and also avoid enqueueing a new 5259838SN/A // request 5269832SN/A bool merged = false; 5279832SN/A auto w = writeQueue.begin(); 5289243SN/A 5299832SN/A while(!merged && w != writeQueue.end()) { 5309832SN/A // either of the two could be first, if they are the same 5319832SN/A // it does not matter which way we go 5329832SN/A if ((*w)->addr >= addr) { 5339838SN/A // the existing one starts after the new one, figure 5349838SN/A // out where the new one ends with respect to the 5359838SN/A // existing one 5369832SN/A if ((addr + size) >= ((*w)->addr + (*w)->size)) { 5379832SN/A // check if the existing one is completely 5389832SN/A // subsumed in the new one 5399832SN/A DPRINTF(DRAM, "Merging write covering existing burst\n"); 5409832SN/A merged = true; 5419832SN/A // update both the address and the size 5429832SN/A (*w)->addr = addr; 5439832SN/A (*w)->size = size; 5449832SN/A } else if ((addr + size) >= (*w)->addr && 5459832SN/A ((*w)->addr + (*w)->size - addr) <= burstSize) { 5469832SN/A // the new one is just before or partially 5479832SN/A // overlapping with the existing one, and together 5489832SN/A // they fit within a burst 5499832SN/A DPRINTF(DRAM, "Merging write before existing burst\n"); 5509832SN/A merged = true; 5519832SN/A // the existing queue item needs to be adjusted with 5529832SN/A // respect to both address and size 55310047SN/A (*w)->size = (*w)->addr + (*w)->size - addr; 5549832SN/A (*w)->addr = addr; 5559832SN/A } 5569832SN/A } else { 5579838SN/A // the new one starts after the current one, figure 5589838SN/A // out where the existing one ends with respect to the 5599838SN/A // new one 5609832SN/A if (((*w)->addr + (*w)->size) >= (addr + size)) { 5619832SN/A // check if the new one is completely subsumed in the 5629832SN/A // existing one 5639832SN/A DPRINTF(DRAM, "Merging write into existing burst\n"); 5649832SN/A merged = true; 5659832SN/A // no adjustments necessary 5669832SN/A } else if (((*w)->addr + (*w)->size) >= addr && 5679832SN/A (addr + size - (*w)->addr) <= burstSize) { 5689832SN/A // the existing one is just before or partially 5699832SN/A // overlapping with the new one, and together 5709832SN/A // they fit within a burst 5719832SN/A DPRINTF(DRAM, "Merging write after existing burst\n"); 5729832SN/A merged = true; 5739832SN/A // the address is right, and only the size has 5749832SN/A // to be adjusted 5759832SN/A (*w)->size = addr + size - (*w)->addr; 5769832SN/A } 5779832SN/A } 5789832SN/A ++w; 5799832SN/A } 5809243SN/A 5819832SN/A // if the item was not merged we need to create a new write 5829832SN/A // and enqueue it 5839832SN/A if (!merged) { 5849966SN/A DRAMPacket* dram_pkt = decodeAddr(pkt, addr, size, false); 5859243SN/A 5869832SN/A assert(writeQueue.size() < writeBufferSize); 5879832SN/A wrQLenPdf[writeQueue.size()]++; 5889243SN/A 5899832SN/A DPRINTF(DRAM, "Adding to write queue\n"); 5909831SN/A 5919832SN/A writeQueue.push_back(dram_pkt); 5929831SN/A 5939832SN/A // Update stats 5949832SN/A avgWrQLen = writeQueue.size(); 5959977SN/A } else { 5969977SN/A // keep track of the fact that this burst effectively 5979977SN/A // disappeared as it was merged with an existing one 5989977SN/A mergedWrBursts++; 5999832SN/A } 6009832SN/A 6019831SN/A // Starting address of next dram pkt (aligend to burstSize boundary) 6029831SN/A addr = (addr | (burstSize - 1)) + 1; 6039831SN/A } 6049243SN/A 6059243SN/A // we do not wait for the writes to be send to the actual memory, 6069243SN/A // but instead take responsibility for the consistency here and 6079243SN/A // snoop the write queue for any upcoming reads 6089831SN/A // @todo, if a pkt size is larger than burst size, we might need a 6099831SN/A // different front end latency 6109726SN/A accessAndRespond(pkt, frontendLatency); 6119243SN/A 61210206Sandreas.hansson@arm.com // If we are not already scheduled to get a request out of the 61310206Sandreas.hansson@arm.com // queue, do so now 61410206Sandreas.hansson@arm.com if (!nextReqEvent.scheduled()) { 61510206Sandreas.hansson@arm.com DPRINTF(DRAM, "Request scheduled immediately\n"); 61610206Sandreas.hansson@arm.com schedule(nextReqEvent, curTick()); 6179243SN/A } 6189243SN/A} 6199243SN/A 6209243SN/Avoid 62110146Sandreas.hansson@arm.comDRAMCtrl::printQs() const { 6229243SN/A DPRINTF(DRAM, "===READ QUEUE===\n\n"); 6239833SN/A for (auto i = readQueue.begin() ; i != readQueue.end() ; ++i) { 6249243SN/A DPRINTF(DRAM, "Read %lu\n", (*i)->addr); 6259243SN/A } 6269243SN/A DPRINTF(DRAM, "\n===RESP QUEUE===\n\n"); 6279833SN/A for (auto i = respQueue.begin() ; i != respQueue.end() ; ++i) { 6289243SN/A DPRINTF(DRAM, "Response %lu\n", (*i)->addr); 6299243SN/A } 6309243SN/A DPRINTF(DRAM, "\n===WRITE QUEUE===\n\n"); 6319833SN/A for (auto i = writeQueue.begin() ; i != writeQueue.end() ; ++i) { 6329243SN/A DPRINTF(DRAM, "Write %lu\n", (*i)->addr); 6339243SN/A } 6349243SN/A} 6359243SN/A 6369243SN/Abool 63710146Sandreas.hansson@arm.comDRAMCtrl::recvTimingReq(PacketPtr pkt) 6389243SN/A{ 6399349SN/A /// @todo temporary hack to deal with memory corruption issues until 6409349SN/A /// 4-phase transactions are complete 6419349SN/A for (int x = 0; x < pendingDelete.size(); x++) 6429349SN/A delete pendingDelete[x]; 6439349SN/A pendingDelete.clear(); 6449349SN/A 6459243SN/A // This is where we enter from the outside world 6469567SN/A DPRINTF(DRAM, "recvTimingReq: request %s addr %lld size %d\n", 6479831SN/A pkt->cmdString(), pkt->getAddr(), pkt->getSize()); 6489243SN/A 6499567SN/A // simply drop inhibited packets for now 6509567SN/A if (pkt->memInhibitAsserted()) { 65110143SN/A DPRINTF(DRAM, "Inhibited packet -- Dropping it now\n"); 6529567SN/A pendingDelete.push_back(pkt); 6539567SN/A return true; 6549567SN/A } 6559243SN/A 6569243SN/A // Calc avg gap between requests 6579243SN/A if (prevArrival != 0) { 6589243SN/A totGap += curTick() - prevArrival; 6599243SN/A } 6609243SN/A prevArrival = curTick(); 6619243SN/A 6629831SN/A 6639831SN/A // Find out how many dram packets a pkt translates to 6649831SN/A // If the burst size is equal or larger than the pkt size, then a pkt 6659831SN/A // translates to only one dram packet. Otherwise, a pkt translates to 6669831SN/A // multiple dram packets 6679243SN/A unsigned size = pkt->getSize(); 6689831SN/A unsigned offset = pkt->getAddr() & (burstSize - 1); 6699831SN/A unsigned int dram_pkt_count = divCeil(offset + size, burstSize); 6709243SN/A 6719243SN/A // check local buffers and do not accept if full 6729243SN/A if (pkt->isRead()) { 6739567SN/A assert(size != 0); 6749831SN/A if (readQueueFull(dram_pkt_count)) { 6759567SN/A DPRINTF(DRAM, "Read queue full, not accepting\n"); 6769243SN/A // remember that we have to retry this port 6779243SN/A retryRdReq = true; 6789243SN/A numRdRetry++; 6799243SN/A return false; 6809243SN/A } else { 6819831SN/A addToReadQueue(pkt, dram_pkt_count); 6829243SN/A readReqs++; 6839977SN/A bytesReadSys += size; 6849243SN/A } 6859243SN/A } else if (pkt->isWrite()) { 6869567SN/A assert(size != 0); 6879831SN/A if (writeQueueFull(dram_pkt_count)) { 6889567SN/A DPRINTF(DRAM, "Write queue full, not accepting\n"); 6899243SN/A // remember that we have to retry this port 6909243SN/A retryWrReq = true; 6919243SN/A numWrRetry++; 6929243SN/A return false; 6939243SN/A } else { 6949831SN/A addToWriteQueue(pkt, dram_pkt_count); 6959243SN/A writeReqs++; 6969977SN/A bytesWrittenSys += size; 6979243SN/A } 6989243SN/A } else { 6999243SN/A DPRINTF(DRAM,"Neither read nor write, ignore timing\n"); 7009243SN/A neitherReadNorWrite++; 7019726SN/A accessAndRespond(pkt, 1); 7029243SN/A } 7039243SN/A 7049243SN/A return true; 7059243SN/A} 7069243SN/A 7079243SN/Avoid 70810146Sandreas.hansson@arm.comDRAMCtrl::processRespondEvent() 7099243SN/A{ 7109243SN/A DPRINTF(DRAM, 7119243SN/A "processRespondEvent(): Some req has reached its readyTime\n"); 7129243SN/A 7139831SN/A DRAMPacket* dram_pkt = respQueue.front(); 7149243SN/A 7159831SN/A if (dram_pkt->burstHelper) { 7169831SN/A // it is a split packet 7179831SN/A dram_pkt->burstHelper->burstsServiced++; 7189831SN/A if (dram_pkt->burstHelper->burstsServiced == 71910143SN/A dram_pkt->burstHelper->burstCount) { 7209831SN/A // we have now serviced all children packets of a system packet 7219831SN/A // so we can now respond to the requester 7229831SN/A // @todo we probably want to have a different front end and back 7239831SN/A // end latency for split packets 7249831SN/A accessAndRespond(dram_pkt->pkt, frontendLatency + backendLatency); 7259831SN/A delete dram_pkt->burstHelper; 7269831SN/A dram_pkt->burstHelper = NULL; 7279831SN/A } 7289831SN/A } else { 7299831SN/A // it is not a split packet 7309831SN/A accessAndRespond(dram_pkt->pkt, frontendLatency + backendLatency); 7319831SN/A } 7329243SN/A 7339831SN/A delete respQueue.front(); 7349831SN/A respQueue.pop_front(); 7359243SN/A 7369831SN/A if (!respQueue.empty()) { 7379831SN/A assert(respQueue.front()->readyTime >= curTick()); 7389831SN/A assert(!respondEvent.scheduled()); 7399831SN/A schedule(respondEvent, respQueue.front()->readyTime); 7409831SN/A } else { 7419831SN/A // if there is nothing left in any queue, signal a drain 7429831SN/A if (writeQueue.empty() && readQueue.empty() && 7439831SN/A drainManager) { 74410509SAli.Saidi@ARM.com DPRINTF(Drain, "DRAM controller done draining\n"); 7459831SN/A drainManager->signalDrainDone(); 7469831SN/A drainManager = NULL; 7479831SN/A } 7489831SN/A } 7499567SN/A 7509831SN/A // We have made a location in the queue available at this point, 7519831SN/A // so if there is a read that was forced to wait, retry now 7529831SN/A if (retryRdReq) { 7539831SN/A retryRdReq = false; 7549831SN/A port.sendRetry(); 7559831SN/A } 7569243SN/A} 7579243SN/A 7589243SN/Avoid 75910393Swendy.elsasser@arm.comDRAMCtrl::chooseNext(std::deque<DRAMPacket*>& queue, bool switched_cmd_type) 7609243SN/A{ 76110206Sandreas.hansson@arm.com // This method does the arbitration between requests. The chosen 76210206Sandreas.hansson@arm.com // packet is simply moved to the head of the queue. The other 76310206Sandreas.hansson@arm.com // methods know that this is the place to look. For example, with 76410206Sandreas.hansson@arm.com // FCFS, this method does nothing 76510206Sandreas.hansson@arm.com assert(!queue.empty()); 7669243SN/A 76710206Sandreas.hansson@arm.com if (queue.size() == 1) { 76810206Sandreas.hansson@arm.com DPRINTF(DRAM, "Single request, nothing to do\n"); 7699243SN/A return; 7709243SN/A } 7719243SN/A 7729243SN/A if (memSchedPolicy == Enums::fcfs) { 7739243SN/A // Do nothing, since the correct request is already head 7749243SN/A } else if (memSchedPolicy == Enums::frfcfs) { 77510393Swendy.elsasser@arm.com reorderQueue(queue, switched_cmd_type); 7769243SN/A } else 7779243SN/A panic("No scheduling policy chosen\n"); 7789243SN/A} 7799243SN/A 7809243SN/Avoid 78110393Swendy.elsasser@arm.comDRAMCtrl::reorderQueue(std::deque<DRAMPacket*>& queue, bool switched_cmd_type) 7829974SN/A{ 7839974SN/A // Only determine this when needed 7849974SN/A uint64_t earliest_banks = 0; 7859974SN/A 7869974SN/A // Search for row hits first, if no row hit is found then schedule the 7879974SN/A // packet to one of the earliest banks available 7889974SN/A bool found_earliest_pkt = false; 78910393Swendy.elsasser@arm.com bool found_prepped_diff_rank_pkt = false; 7909974SN/A auto selected_pkt_it = queue.begin(); 7919974SN/A 7929974SN/A for (auto i = queue.begin(); i != queue.end() ; ++i) { 7939974SN/A DRAMPacket* dram_pkt = *i; 7949974SN/A const Bank& bank = dram_pkt->bankRef; 7959974SN/A // Check if it is a row hit 7969974SN/A if (bank.openRow == dram_pkt->row) { 79710393Swendy.elsasser@arm.com if (dram_pkt->rank == activeRank || switched_cmd_type) { 79810393Swendy.elsasser@arm.com // FCFS within the hits, giving priority to commands 79910393Swendy.elsasser@arm.com // that access the same rank as the previous burst 80010393Swendy.elsasser@arm.com // to minimize bus turnaround delays 80110393Swendy.elsasser@arm.com // Only give rank prioity when command type is not changing 80210393Swendy.elsasser@arm.com DPRINTF(DRAM, "Row buffer hit\n"); 80310393Swendy.elsasser@arm.com selected_pkt_it = i; 80410393Swendy.elsasser@arm.com break; 80510393Swendy.elsasser@arm.com } else if (!found_prepped_diff_rank_pkt) { 80610393Swendy.elsasser@arm.com // found row hit for command on different rank than prev burst 80710393Swendy.elsasser@arm.com selected_pkt_it = i; 80810393Swendy.elsasser@arm.com found_prepped_diff_rank_pkt = true; 80910393Swendy.elsasser@arm.com } 81010393Swendy.elsasser@arm.com } else if (!found_earliest_pkt & !found_prepped_diff_rank_pkt) { 81110393Swendy.elsasser@arm.com // No row hit and 81210393Swendy.elsasser@arm.com // haven't found an entry with a row hit to a new rank 8139974SN/A if (earliest_banks == 0) 81410393Swendy.elsasser@arm.com // Determine entries with earliest bank prep delay 81510393Swendy.elsasser@arm.com // Function will give priority to commands that access the 81610393Swendy.elsasser@arm.com // same rank as previous burst and can prep the bank seamlessly 81710393Swendy.elsasser@arm.com earliest_banks = minBankPrep(queue, switched_cmd_type); 81810211Sandreas.hansson@arm.com 81910393Swendy.elsasser@arm.com // FCFS - Bank is first available bank 82010393Swendy.elsasser@arm.com if (bits(earliest_banks, dram_pkt->bankId, dram_pkt->bankId)) { 8219974SN/A // Remember the packet to be scheduled to one of the earliest 82210211Sandreas.hansson@arm.com // banks available, FCFS amongst the earliest banks 8239974SN/A selected_pkt_it = i; 8249974SN/A found_earliest_pkt = true; 8259974SN/A } 8269974SN/A } 8279974SN/A } 8289974SN/A 8299974SN/A DRAMPacket* selected_pkt = *selected_pkt_it; 8309974SN/A queue.erase(selected_pkt_it); 8319974SN/A queue.push_front(selected_pkt); 8329974SN/A} 8339974SN/A 8349974SN/Avoid 83510146Sandreas.hansson@arm.comDRAMCtrl::accessAndRespond(PacketPtr pkt, Tick static_latency) 8369243SN/A{ 8379243SN/A DPRINTF(DRAM, "Responding to Address %lld.. ",pkt->getAddr()); 8389243SN/A 8399243SN/A bool needsResponse = pkt->needsResponse(); 8409243SN/A // do the actual memory access which also turns the packet into a 8419243SN/A // response 8429243SN/A access(pkt); 8439243SN/A 8449243SN/A // turn packet around to go back to requester if response expected 8459243SN/A if (needsResponse) { 8469243SN/A // access already turned the packet into a response 8479243SN/A assert(pkt->isResponse()); 8489243SN/A 8499549SN/A // @todo someone should pay for this 85010405Sandreas.hansson@arm.com pkt->firstWordDelay = pkt->lastWordDelay = 0; 8519549SN/A 8529726SN/A // queue the packet in the response queue to be sent out after 8539726SN/A // the static latency has passed 8549726SN/A port.schedTimingResp(pkt, curTick() + static_latency); 8559243SN/A } else { 8569587SN/A // @todo the packet is going to be deleted, and the DRAMPacket 8579587SN/A // is still having a pointer to it 8589587SN/A pendingDelete.push_back(pkt); 8599243SN/A } 8609243SN/A 8619243SN/A DPRINTF(DRAM, "Done\n"); 8629243SN/A 8639243SN/A return; 8649243SN/A} 8659243SN/A 8669243SN/Avoid 86710246Sandreas.hansson@arm.comDRAMCtrl::activateBank(Bank& bank, Tick act_tick, uint32_t row) 8689488SN/A{ 86910246Sandreas.hansson@arm.com // get the rank index from the bank 87010246Sandreas.hansson@arm.com uint8_t rank = bank.rank; 87110246Sandreas.hansson@arm.com 8729969SN/A assert(actTicks[rank].size() == activationLimit); 8739488SN/A 8749488SN/A DPRINTF(DRAM, "Activate at tick %d\n", act_tick); 8759488SN/A 87610207Sandreas.hansson@arm.com // update the open row 87710246Sandreas.hansson@arm.com assert(bank.openRow == Bank::NO_ROW); 87810246Sandreas.hansson@arm.com bank.openRow = row; 87910207Sandreas.hansson@arm.com 88010207Sandreas.hansson@arm.com // start counting anew, this covers both the case when we 88110207Sandreas.hansson@arm.com // auto-precharged, and when this access is forced to 88210207Sandreas.hansson@arm.com // precharge 88310246Sandreas.hansson@arm.com bank.bytesAccessed = 0; 88410246Sandreas.hansson@arm.com bank.rowAccesses = 0; 88510207Sandreas.hansson@arm.com 88610207Sandreas.hansson@arm.com ++numBanksActive; 88710207Sandreas.hansson@arm.com assert(numBanksActive <= banksPerRank * ranksPerChannel); 88810207Sandreas.hansson@arm.com 88910247Sandreas.hansson@arm.com DPRINTF(DRAM, "Activate bank %d, rank %d at tick %lld, now got %d active\n", 89010247Sandreas.hansson@arm.com bank.bank, bank.rank, act_tick, numBanksActive); 89110247Sandreas.hansson@arm.com 89210432SOmar.Naji@arm.com rankPower[bank.rank].powerlib.doCommand(MemCommand::ACT, bank.bank, 89310432SOmar.Naji@arm.com divCeil(act_tick, tCK) - 89410432SOmar.Naji@arm.com timeStampOffset); 89510432SOmar.Naji@arm.com 89610432SOmar.Naji@arm.com DPRINTF(DRAMPower, "%llu,ACT,%d,%d\n", divCeil(act_tick, tCK) - 89710432SOmar.Naji@arm.com timeStampOffset, bank.bank, bank.rank); 8989975SN/A 89910211Sandreas.hansson@arm.com // The next access has to respect tRAS for this bank 90010246Sandreas.hansson@arm.com bank.preAllowedAt = act_tick + tRAS; 90110211Sandreas.hansson@arm.com 90210211Sandreas.hansson@arm.com // Respect the row-to-column command delay 90310394Swendy.elsasser@arm.com bank.colAllowedAt = std::max(act_tick + tRCD, bank.colAllowedAt); 90410211Sandreas.hansson@arm.com 9059971SN/A // start by enforcing tRRD 9069971SN/A for(int i = 0; i < banksPerRank; i++) { 90710210Sandreas.hansson@arm.com // next activate to any bank in this rank must not happen 90810210Sandreas.hansson@arm.com // before tRRD 90910394Swendy.elsasser@arm.com if (bankGroupArch && (bank.bankgr == banks[rank][i].bankgr)) { 91010394Swendy.elsasser@arm.com // bank group architecture requires longer delays between 91110394Swendy.elsasser@arm.com // ACT commands within the same bank group. Use tRRD_L 91210394Swendy.elsasser@arm.com // in this case 91310394Swendy.elsasser@arm.com banks[rank][i].actAllowedAt = std::max(act_tick + tRRD_L, 91410394Swendy.elsasser@arm.com banks[rank][i].actAllowedAt); 91510394Swendy.elsasser@arm.com } else { 91610394Swendy.elsasser@arm.com // use shorter tRRD value when either 91710394Swendy.elsasser@arm.com // 1) bank group architecture is not supportted 91810394Swendy.elsasser@arm.com // 2) bank is in a different bank group 91910394Swendy.elsasser@arm.com banks[rank][i].actAllowedAt = std::max(act_tick + tRRD, 92010394Swendy.elsasser@arm.com banks[rank][i].actAllowedAt); 92110394Swendy.elsasser@arm.com } 9229971SN/A } 92310208Sandreas.hansson@arm.com 9249971SN/A // next, we deal with tXAW, if the activation limit is disabled 92510492SOmar.Naji@arm.com // then we directly schedule an activate power event 92610492SOmar.Naji@arm.com if (!actTicks[rank].empty()) { 92710492SOmar.Naji@arm.com // sanity check 92810492SOmar.Naji@arm.com if (actTicks[rank].back() && 92910492SOmar.Naji@arm.com (act_tick - actTicks[rank].back()) < tXAW) { 93010492SOmar.Naji@arm.com panic("Got %d activates in window %d (%llu - %llu) which " 93110492SOmar.Naji@arm.com "is smaller than %llu\n", activationLimit, act_tick - 93210492SOmar.Naji@arm.com actTicks[rank].back(), act_tick, actTicks[rank].back(), 93310492SOmar.Naji@arm.com tXAW); 93410492SOmar.Naji@arm.com } 9359824SN/A 93610492SOmar.Naji@arm.com // shift the times used for the book keeping, the last element 93710492SOmar.Naji@arm.com // (highest index) is the oldest one and hence the lowest value 93810492SOmar.Naji@arm.com actTicks[rank].pop_back(); 9399488SN/A 94010492SOmar.Naji@arm.com // record an new activation (in the future) 94110492SOmar.Naji@arm.com actTicks[rank].push_front(act_tick); 9429488SN/A 94310492SOmar.Naji@arm.com // cannot activate more than X times in time window tXAW, push the 94410492SOmar.Naji@arm.com // next one (the X + 1'st activate) to be tXAW away from the 94510492SOmar.Naji@arm.com // oldest in our window of X 94610492SOmar.Naji@arm.com if (actTicks[rank].back() && 94710492SOmar.Naji@arm.com (act_tick - actTicks[rank].back()) < tXAW) { 94810492SOmar.Naji@arm.com DPRINTF(DRAM, "Enforcing tXAW with X = %d, next activate " 94910492SOmar.Naji@arm.com "no earlier than %llu\n", activationLimit, 95010492SOmar.Naji@arm.com actTicks[rank].back() + tXAW); 9519488SN/A for(int j = 0; j < banksPerRank; j++) 9529488SN/A // next activate must not happen before end of window 95310210Sandreas.hansson@arm.com banks[rank][j].actAllowedAt = 95410210Sandreas.hansson@arm.com std::max(actTicks[rank].back() + tXAW, 95510210Sandreas.hansson@arm.com banks[rank][j].actAllowedAt); 95610492SOmar.Naji@arm.com } 9579488SN/A } 95810208Sandreas.hansson@arm.com 95910208Sandreas.hansson@arm.com // at the point when this activate takes place, make sure we 96010208Sandreas.hansson@arm.com // transition to the active power state 96110208Sandreas.hansson@arm.com if (!activateEvent.scheduled()) 96210208Sandreas.hansson@arm.com schedule(activateEvent, act_tick); 96310208Sandreas.hansson@arm.com else if (activateEvent.when() > act_tick) 96410208Sandreas.hansson@arm.com // move it sooner in time 96510208Sandreas.hansson@arm.com reschedule(activateEvent, act_tick); 96610208Sandreas.hansson@arm.com} 96710208Sandreas.hansson@arm.com 96810208Sandreas.hansson@arm.comvoid 96910208Sandreas.hansson@arm.comDRAMCtrl::processActivateEvent() 97010208Sandreas.hansson@arm.com{ 97110208Sandreas.hansson@arm.com // we should transition to the active state as soon as any bank is active 97210208Sandreas.hansson@arm.com if (pwrState != PWR_ACT) 97310208Sandreas.hansson@arm.com // note that at this point numBanksActive could be back at 97410208Sandreas.hansson@arm.com // zero again due to a precharge scheduled in the future 97510208Sandreas.hansson@arm.com schedulePowerEvent(PWR_ACT, curTick()); 9769488SN/A} 9779488SN/A 9789488SN/Avoid 97910247Sandreas.hansson@arm.comDRAMCtrl::prechargeBank(Bank& bank, Tick pre_at, bool trace) 98010207Sandreas.hansson@arm.com{ 98110207Sandreas.hansson@arm.com // make sure the bank has an open row 98210207Sandreas.hansson@arm.com assert(bank.openRow != Bank::NO_ROW); 98310207Sandreas.hansson@arm.com 98410207Sandreas.hansson@arm.com // sample the bytes per activate here since we are closing 98510207Sandreas.hansson@arm.com // the page 98610207Sandreas.hansson@arm.com bytesPerActivate.sample(bank.bytesAccessed); 98710207Sandreas.hansson@arm.com 98810207Sandreas.hansson@arm.com bank.openRow = Bank::NO_ROW; 98910207Sandreas.hansson@arm.com 99010214Sandreas.hansson@arm.com // no precharge allowed before this one 99110214Sandreas.hansson@arm.com bank.preAllowedAt = pre_at; 99210214Sandreas.hansson@arm.com 99310211Sandreas.hansson@arm.com Tick pre_done_at = pre_at + tRP; 99410211Sandreas.hansson@arm.com 99510211Sandreas.hansson@arm.com bank.actAllowedAt = std::max(bank.actAllowedAt, pre_done_at); 99610207Sandreas.hansson@arm.com 99710207Sandreas.hansson@arm.com assert(numBanksActive != 0); 99810207Sandreas.hansson@arm.com --numBanksActive; 99910207Sandreas.hansson@arm.com 100010247Sandreas.hansson@arm.com DPRINTF(DRAM, "Precharging bank %d, rank %d at tick %lld, now got " 100110247Sandreas.hansson@arm.com "%d active\n", bank.bank, bank.rank, pre_at, numBanksActive); 100210247Sandreas.hansson@arm.com 100310432SOmar.Naji@arm.com if (trace) { 100410207Sandreas.hansson@arm.com 100510432SOmar.Naji@arm.com rankPower[bank.rank].powerlib.doCommand(MemCommand::PRE, bank.bank, 100610432SOmar.Naji@arm.com divCeil(pre_at, tCK) - 100710432SOmar.Naji@arm.com timeStampOffset); 100810432SOmar.Naji@arm.com DPRINTF(DRAMPower, "%llu,PRE,%d,%d\n", divCeil(pre_at, tCK) - 100910432SOmar.Naji@arm.com timeStampOffset, bank.bank, bank.rank); 101010432SOmar.Naji@arm.com } 101110208Sandreas.hansson@arm.com // if we look at the current number of active banks we might be 101210208Sandreas.hansson@arm.com // tempted to think the DRAM is now idle, however this can be 101310208Sandreas.hansson@arm.com // undone by an activate that is scheduled to happen before we 101410208Sandreas.hansson@arm.com // would have reached the idle state, so schedule an event and 101510208Sandreas.hansson@arm.com // rather check once we actually make it to the point in time when 101610208Sandreas.hansson@arm.com // the (last) precharge takes place 101710208Sandreas.hansson@arm.com if (!prechargeEvent.scheduled()) 101810211Sandreas.hansson@arm.com schedule(prechargeEvent, pre_done_at); 101910211Sandreas.hansson@arm.com else if (prechargeEvent.when() < pre_done_at) 102010211Sandreas.hansson@arm.com reschedule(prechargeEvent, pre_done_at); 102110208Sandreas.hansson@arm.com} 102210208Sandreas.hansson@arm.com 102310208Sandreas.hansson@arm.comvoid 102410208Sandreas.hansson@arm.comDRAMCtrl::processPrechargeEvent() 102510208Sandreas.hansson@arm.com{ 102610207Sandreas.hansson@arm.com // if we reached zero, then special conditions apply as we track 102710207Sandreas.hansson@arm.com // if all banks are precharged for the power models 102810207Sandreas.hansson@arm.com if (numBanksActive == 0) { 102910208Sandreas.hansson@arm.com // we should transition to the idle state when the last bank 103010208Sandreas.hansson@arm.com // is precharged 103110208Sandreas.hansson@arm.com schedulePowerEvent(PWR_IDLE, curTick()); 103210207Sandreas.hansson@arm.com } 103310207Sandreas.hansson@arm.com} 103410207Sandreas.hansson@arm.com 103510207Sandreas.hansson@arm.comvoid 103610146Sandreas.hansson@arm.comDRAMCtrl::doDRAMAccess(DRAMPacket* dram_pkt) 10379243SN/A{ 10389243SN/A DPRINTF(DRAM, "Timing access to addr %lld, rank/bank/row %d %d %d\n", 10399243SN/A dram_pkt->addr, dram_pkt->rank, dram_pkt->bank, dram_pkt->row); 10409243SN/A 104110211Sandreas.hansson@arm.com // get the bank 10429967SN/A Bank& bank = dram_pkt->bankRef; 10439243SN/A 104410211Sandreas.hansson@arm.com // for the state we need to track if it is a row hit or not 104510211Sandreas.hansson@arm.com bool row_hit = true; 104610211Sandreas.hansson@arm.com 104710211Sandreas.hansson@arm.com // respect any constraints on the command (e.g. tRCD or tCCD) 104810211Sandreas.hansson@arm.com Tick cmd_at = std::max(bank.colAllowedAt, curTick()); 104910211Sandreas.hansson@arm.com 105010211Sandreas.hansson@arm.com // Determine the access latency and update the bank state 105110211Sandreas.hansson@arm.com if (bank.openRow == dram_pkt->row) { 105210211Sandreas.hansson@arm.com // nothing to do 105310209Sandreas.hansson@arm.com } else { 105410211Sandreas.hansson@arm.com row_hit = false; 105510211Sandreas.hansson@arm.com 105610209Sandreas.hansson@arm.com // If there is a page open, precharge it. 105710209Sandreas.hansson@arm.com if (bank.openRow != Bank::NO_ROW) { 105810211Sandreas.hansson@arm.com prechargeBank(bank, std::max(bank.preAllowedAt, curTick())); 10599488SN/A } 10609973SN/A 106110211Sandreas.hansson@arm.com // next we need to account for the delay in activating the 106210211Sandreas.hansson@arm.com // page 106310211Sandreas.hansson@arm.com Tick act_tick = std::max(bank.actAllowedAt, curTick()); 10649973SN/A 106510210Sandreas.hansson@arm.com // Record the activation and deal with all the global timing 106610210Sandreas.hansson@arm.com // constraints caused be a new activation (tRRD and tXAW) 106710246Sandreas.hansson@arm.com activateBank(bank, act_tick, dram_pkt->row); 106810210Sandreas.hansson@arm.com 106910211Sandreas.hansson@arm.com // issue the command as early as possible 107010211Sandreas.hansson@arm.com cmd_at = bank.colAllowedAt; 107110209Sandreas.hansson@arm.com } 107210209Sandreas.hansson@arm.com 107310211Sandreas.hansson@arm.com // we need to wait until the bus is available before we can issue 107410211Sandreas.hansson@arm.com // the command 107510211Sandreas.hansson@arm.com cmd_at = std::max(cmd_at, busBusyUntil - tCL); 107610211Sandreas.hansson@arm.com 107710211Sandreas.hansson@arm.com // update the packet ready time 107810211Sandreas.hansson@arm.com dram_pkt->readyTime = cmd_at + tCL + tBURST; 107910211Sandreas.hansson@arm.com 108010211Sandreas.hansson@arm.com // only one burst can use the bus at any one point in time 108110211Sandreas.hansson@arm.com assert(dram_pkt->readyTime - busBusyUntil >= tBURST); 108210211Sandreas.hansson@arm.com 108310394Swendy.elsasser@arm.com // update the time for the next read/write burst for each 108410394Swendy.elsasser@arm.com // bank (add a max with tCCD/tCCD_L here) 108510394Swendy.elsasser@arm.com Tick cmd_dly; 108610394Swendy.elsasser@arm.com for(int j = 0; j < ranksPerChannel; j++) { 108710394Swendy.elsasser@arm.com for(int i = 0; i < banksPerRank; i++) { 108810394Swendy.elsasser@arm.com // next burst to same bank group in this rank must not happen 108910394Swendy.elsasser@arm.com // before tCCD_L. Different bank group timing requirement is 109010394Swendy.elsasser@arm.com // tBURST; Add tCS for different ranks 109110394Swendy.elsasser@arm.com if (dram_pkt->rank == j) { 109210394Swendy.elsasser@arm.com if (bankGroupArch && (bank.bankgr == banks[j][i].bankgr)) { 109310394Swendy.elsasser@arm.com // bank group architecture requires longer delays between 109410394Swendy.elsasser@arm.com // RD/WR burst commands to the same bank group. 109510394Swendy.elsasser@arm.com // Use tCCD_L in this case 109610394Swendy.elsasser@arm.com cmd_dly = tCCD_L; 109710394Swendy.elsasser@arm.com } else { 109810394Swendy.elsasser@arm.com // use tBURST (equivalent to tCCD_S), the shorter 109910394Swendy.elsasser@arm.com // cas-to-cas delay value, when either: 110010394Swendy.elsasser@arm.com // 1) bank group architecture is not supportted 110110394Swendy.elsasser@arm.com // 2) bank is in a different bank group 110210394Swendy.elsasser@arm.com cmd_dly = tBURST; 110310394Swendy.elsasser@arm.com } 110410394Swendy.elsasser@arm.com } else { 110510394Swendy.elsasser@arm.com // different rank is by default in a different bank group 110610394Swendy.elsasser@arm.com // use tBURST (equivalent to tCCD_S), which is the shorter 110710394Swendy.elsasser@arm.com // cas-to-cas delay in this case 110810394Swendy.elsasser@arm.com // Add tCS to account for rank-to-rank bus delay requirements 110910394Swendy.elsasser@arm.com cmd_dly = tBURST + tCS; 111010394Swendy.elsasser@arm.com } 111110394Swendy.elsasser@arm.com banks[j][i].colAllowedAt = std::max(cmd_at + cmd_dly, 111210394Swendy.elsasser@arm.com banks[j][i].colAllowedAt); 111310394Swendy.elsasser@arm.com } 111410394Swendy.elsasser@arm.com } 111510211Sandreas.hansson@arm.com 111610393Swendy.elsasser@arm.com // Save rank of current access 111710393Swendy.elsasser@arm.com activeRank = dram_pkt->rank; 111810393Swendy.elsasser@arm.com 111910212Sandreas.hansson@arm.com // If this is a write, we also need to respect the write recovery 112010212Sandreas.hansson@arm.com // time before a precharge, in the case of a read, respect the 112110212Sandreas.hansson@arm.com // read to precharge constraint 112210212Sandreas.hansson@arm.com bank.preAllowedAt = std::max(bank.preAllowedAt, 112310212Sandreas.hansson@arm.com dram_pkt->isRead ? cmd_at + tRTP : 112410212Sandreas.hansson@arm.com dram_pkt->readyTime + tWR); 112510210Sandreas.hansson@arm.com 112610209Sandreas.hansson@arm.com // increment the bytes accessed and the accesses per row 112710209Sandreas.hansson@arm.com bank.bytesAccessed += burstSize; 112810209Sandreas.hansson@arm.com ++bank.rowAccesses; 112910209Sandreas.hansson@arm.com 113010209Sandreas.hansson@arm.com // if we reached the max, then issue with an auto-precharge 113110209Sandreas.hansson@arm.com bool auto_precharge = pageMgmt == Enums::close || 113210209Sandreas.hansson@arm.com bank.rowAccesses == maxAccessesPerRow; 113310209Sandreas.hansson@arm.com 113410209Sandreas.hansson@arm.com // if we did not hit the limit, we might still want to 113510209Sandreas.hansson@arm.com // auto-precharge 113610209Sandreas.hansson@arm.com if (!auto_precharge && 113710209Sandreas.hansson@arm.com (pageMgmt == Enums::open_adaptive || 113810209Sandreas.hansson@arm.com pageMgmt == Enums::close_adaptive)) { 113910209Sandreas.hansson@arm.com // a twist on the open and close page policies: 114010209Sandreas.hansson@arm.com // 1) open_adaptive page policy does not blindly keep the 114110209Sandreas.hansson@arm.com // page open, but close it if there are no row hits, and there 114210209Sandreas.hansson@arm.com // are bank conflicts in the queue 114310209Sandreas.hansson@arm.com // 2) close_adaptive page policy does not blindly close the 114410209Sandreas.hansson@arm.com // page, but closes it only if there are no row hits in the queue. 114510209Sandreas.hansson@arm.com // In this case, only force an auto precharge when there 114610209Sandreas.hansson@arm.com // are no same page hits in the queue 114710209Sandreas.hansson@arm.com bool got_more_hits = false; 114810209Sandreas.hansson@arm.com bool got_bank_conflict = false; 114910209Sandreas.hansson@arm.com 115010209Sandreas.hansson@arm.com // either look at the read queue or write queue 115110209Sandreas.hansson@arm.com const deque<DRAMPacket*>& queue = dram_pkt->isRead ? readQueue : 115210209Sandreas.hansson@arm.com writeQueue; 115310209Sandreas.hansson@arm.com auto p = queue.begin(); 115410209Sandreas.hansson@arm.com // make sure we are not considering the packet that we are 115510209Sandreas.hansson@arm.com // currently dealing with (which is the head of the queue) 115610209Sandreas.hansson@arm.com ++p; 115710209Sandreas.hansson@arm.com 115810209Sandreas.hansson@arm.com // keep on looking until we have found required condition or 115910209Sandreas.hansson@arm.com // reached the end 116010209Sandreas.hansson@arm.com while (!(got_more_hits && 116110209Sandreas.hansson@arm.com (got_bank_conflict || pageMgmt == Enums::close_adaptive)) && 116210209Sandreas.hansson@arm.com p != queue.end()) { 116310209Sandreas.hansson@arm.com bool same_rank_bank = (dram_pkt->rank == (*p)->rank) && 116410209Sandreas.hansson@arm.com (dram_pkt->bank == (*p)->bank); 116510209Sandreas.hansson@arm.com bool same_row = dram_pkt->row == (*p)->row; 116610209Sandreas.hansson@arm.com got_more_hits |= same_rank_bank && same_row; 116710209Sandreas.hansson@arm.com got_bank_conflict |= same_rank_bank && !same_row; 11689973SN/A ++p; 116910141SN/A } 117010141SN/A 117110209Sandreas.hansson@arm.com // auto pre-charge when either 117210209Sandreas.hansson@arm.com // 1) open_adaptive policy, we have not got any more hits, and 117310209Sandreas.hansson@arm.com // have a bank conflict 117410209Sandreas.hansson@arm.com // 2) close_adaptive policy and we have not got any more hits 117510209Sandreas.hansson@arm.com auto_precharge = !got_more_hits && 117610209Sandreas.hansson@arm.com (got_bank_conflict || pageMgmt == Enums::close_adaptive); 117710209Sandreas.hansson@arm.com } 117810142SN/A 117910247Sandreas.hansson@arm.com // DRAMPower trace command to be written 118010247Sandreas.hansson@arm.com std::string mem_cmd = dram_pkt->isRead ? "RD" : "WR"; 118110247Sandreas.hansson@arm.com 118210432SOmar.Naji@arm.com // MemCommand required for DRAMPower library 118310432SOmar.Naji@arm.com MemCommand::cmds command = (mem_cmd == "RD") ? MemCommand::RD : 118410432SOmar.Naji@arm.com MemCommand::WR; 118510432SOmar.Naji@arm.com 118610209Sandreas.hansson@arm.com // if this access should use auto-precharge, then we are 118710209Sandreas.hansson@arm.com // closing the row 118810209Sandreas.hansson@arm.com if (auto_precharge) { 118910432SOmar.Naji@arm.com // if auto-precharge push a PRE command at the correct tick to the 119010432SOmar.Naji@arm.com // list used by DRAMPower library to calculate power 119110432SOmar.Naji@arm.com prechargeBank(bank, std::max(curTick(), bank.preAllowedAt)); 11929973SN/A 119310209Sandreas.hansson@arm.com DPRINTF(DRAM, "Auto-precharged bank: %d\n", dram_pkt->bankId); 119410209Sandreas.hansson@arm.com } 11959963SN/A 11969243SN/A // Update bus state 11979243SN/A busBusyUntil = dram_pkt->readyTime; 11989243SN/A 119910211Sandreas.hansson@arm.com DPRINTF(DRAM, "Access to %lld, ready at %lld bus busy until %lld.\n", 120010211Sandreas.hansson@arm.com dram_pkt->addr, dram_pkt->readyTime, busBusyUntil); 12019243SN/A 120210432SOmar.Naji@arm.com rankPower[dram_pkt->rank].powerlib.doCommand(command, dram_pkt->bank, 120310432SOmar.Naji@arm.com divCeil(cmd_at, tCK) - 120410432SOmar.Naji@arm.com timeStampOffset); 120510432SOmar.Naji@arm.com 120610432SOmar.Naji@arm.com DPRINTF(DRAMPower, "%llu,%s,%d,%d\n", divCeil(cmd_at, tCK) - 120710432SOmar.Naji@arm.com timeStampOffset, mem_cmd, dram_pkt->bank, dram_pkt->rank); 120810247Sandreas.hansson@arm.com 120910206Sandreas.hansson@arm.com // Update the minimum timing between the requests, this is a 121010206Sandreas.hansson@arm.com // conservative estimate of when we have to schedule the next 121110206Sandreas.hansson@arm.com // request to not introduce any unecessary bubbles. In most cases 121210206Sandreas.hansson@arm.com // we will wake up sooner than we have to. 121310206Sandreas.hansson@arm.com nextReqTime = busBusyUntil - (tRP + tRCD + tCL); 12149972SN/A 121510206Sandreas.hansson@arm.com // Update the stats and schedule the next request 12169977SN/A if (dram_pkt->isRead) { 121710147Sandreas.hansson@arm.com ++readsThisTime; 121810211Sandreas.hansson@arm.com if (row_hit) 12199977SN/A readRowHits++; 12209977SN/A bytesReadDRAM += burstSize; 12219977SN/A perBankRdBursts[dram_pkt->bankId]++; 122210206Sandreas.hansson@arm.com 122310206Sandreas.hansson@arm.com // Update latency stats 122410206Sandreas.hansson@arm.com totMemAccLat += dram_pkt->readyTime - dram_pkt->entryTime; 122510206Sandreas.hansson@arm.com totBusLat += tBURST; 122610211Sandreas.hansson@arm.com totQLat += cmd_at - dram_pkt->entryTime; 12279977SN/A } else { 122810147Sandreas.hansson@arm.com ++writesThisTime; 122910211Sandreas.hansson@arm.com if (row_hit) 12309977SN/A writeRowHits++; 12319977SN/A bytesWritten += burstSize; 12329977SN/A perBankWrBursts[dram_pkt->bankId]++; 12339243SN/A } 12349243SN/A} 12359243SN/A 12369243SN/Avoid 123710206Sandreas.hansson@arm.comDRAMCtrl::processNextReqEvent() 12389243SN/A{ 123910393Swendy.elsasser@arm.com // pre-emptively set to false. Overwrite if in READ_TO_WRITE 124010393Swendy.elsasser@arm.com // or WRITE_TO_READ state 124110393Swendy.elsasser@arm.com bool switched_cmd_type = false; 124210206Sandreas.hansson@arm.com if (busState == READ_TO_WRITE) { 124310206Sandreas.hansson@arm.com DPRINTF(DRAM, "Switching to writes after %d reads with %d reads " 124410206Sandreas.hansson@arm.com "waiting\n", readsThisTime, readQueue.size()); 12459243SN/A 124610206Sandreas.hansson@arm.com // sample and reset the read-related stats as we are now 124710206Sandreas.hansson@arm.com // transitioning to writes, and all reads are done 124810206Sandreas.hansson@arm.com rdPerTurnAround.sample(readsThisTime); 124910206Sandreas.hansson@arm.com readsThisTime = 0; 125010206Sandreas.hansson@arm.com 125110206Sandreas.hansson@arm.com // now proceed to do the actual writes 125210206Sandreas.hansson@arm.com busState = WRITE; 125310393Swendy.elsasser@arm.com switched_cmd_type = true; 125410206Sandreas.hansson@arm.com } else if (busState == WRITE_TO_READ) { 125510206Sandreas.hansson@arm.com DPRINTF(DRAM, "Switching to reads after %d writes with %d writes " 125610206Sandreas.hansson@arm.com "waiting\n", writesThisTime, writeQueue.size()); 125710206Sandreas.hansson@arm.com 125810206Sandreas.hansson@arm.com wrPerTurnAround.sample(writesThisTime); 125910206Sandreas.hansson@arm.com writesThisTime = 0; 126010206Sandreas.hansson@arm.com 126110206Sandreas.hansson@arm.com busState = READ; 126210393Swendy.elsasser@arm.com switched_cmd_type = true; 126310206Sandreas.hansson@arm.com } 126410206Sandreas.hansson@arm.com 126510207Sandreas.hansson@arm.com if (refreshState != REF_IDLE) { 126610207Sandreas.hansson@arm.com // if a refresh waiting for this event loop to finish, then hand 126710207Sandreas.hansson@arm.com // over now, and do not schedule a new nextReqEvent 126810207Sandreas.hansson@arm.com if (refreshState == REF_DRAIN) { 126910207Sandreas.hansson@arm.com DPRINTF(DRAM, "Refresh drain done, now precharging\n"); 127010207Sandreas.hansson@arm.com 127110207Sandreas.hansson@arm.com refreshState = REF_PRE; 127210207Sandreas.hansson@arm.com 127310207Sandreas.hansson@arm.com // hand control back to the refresh event loop 127410207Sandreas.hansson@arm.com schedule(refreshEvent, curTick()); 127510207Sandreas.hansson@arm.com } 127610207Sandreas.hansson@arm.com 127710207Sandreas.hansson@arm.com // let the refresh finish before issuing any further requests 127810207Sandreas.hansson@arm.com return; 127910207Sandreas.hansson@arm.com } 128010207Sandreas.hansson@arm.com 128110206Sandreas.hansson@arm.com // when we get here it is either a read or a write 128210206Sandreas.hansson@arm.com if (busState == READ) { 128310206Sandreas.hansson@arm.com 128410206Sandreas.hansson@arm.com // track if we should switch or not 128510206Sandreas.hansson@arm.com bool switch_to_writes = false; 128610206Sandreas.hansson@arm.com 128710206Sandreas.hansson@arm.com if (readQueue.empty()) { 128810206Sandreas.hansson@arm.com // In the case there is no read request to go next, 128910206Sandreas.hansson@arm.com // trigger writes if we have passed the low threshold (or 129010206Sandreas.hansson@arm.com // if we are draining) 129110206Sandreas.hansson@arm.com if (!writeQueue.empty() && 129210206Sandreas.hansson@arm.com (drainManager || writeQueue.size() > writeLowThreshold)) { 129310206Sandreas.hansson@arm.com 129410206Sandreas.hansson@arm.com switch_to_writes = true; 129510206Sandreas.hansson@arm.com } else { 129610206Sandreas.hansson@arm.com // check if we are drained 129710206Sandreas.hansson@arm.com if (respQueue.empty () && drainManager) { 129810509SAli.Saidi@ARM.com DPRINTF(Drain, "DRAM controller done draining\n"); 129910206Sandreas.hansson@arm.com drainManager->signalDrainDone(); 130010206Sandreas.hansson@arm.com drainManager = NULL; 130110206Sandreas.hansson@arm.com } 130210206Sandreas.hansson@arm.com 130310206Sandreas.hansson@arm.com // nothing to do, not even any point in scheduling an 130410206Sandreas.hansson@arm.com // event for the next request 130510206Sandreas.hansson@arm.com return; 130610206Sandreas.hansson@arm.com } 130710206Sandreas.hansson@arm.com } else { 130810206Sandreas.hansson@arm.com // Figure out which read request goes next, and move it to the 130910206Sandreas.hansson@arm.com // front of the read queue 131010393Swendy.elsasser@arm.com chooseNext(readQueue, switched_cmd_type); 131110206Sandreas.hansson@arm.com 131210215Sandreas.hansson@arm.com DRAMPacket* dram_pkt = readQueue.front(); 131310215Sandreas.hansson@arm.com 131410393Swendy.elsasser@arm.com // here we get a bit creative and shift the bus busy time not 131510393Swendy.elsasser@arm.com // just the tWTR, but also a CAS latency to capture the fact 131610393Swendy.elsasser@arm.com // that we are allowed to prepare a new bank, but not issue a 131710393Swendy.elsasser@arm.com // read command until after tWTR, in essence we capture a 131810393Swendy.elsasser@arm.com // bubble on the data bus that is tWTR + tCL 131910394Swendy.elsasser@arm.com if (switched_cmd_type && dram_pkt->rank == activeRank) { 132010394Swendy.elsasser@arm.com busBusyUntil += tWTR + tCL; 132110393Swendy.elsasser@arm.com } 132210393Swendy.elsasser@arm.com 132310215Sandreas.hansson@arm.com doDRAMAccess(dram_pkt); 132410206Sandreas.hansson@arm.com 132510206Sandreas.hansson@arm.com // At this point we're done dealing with the request 132610215Sandreas.hansson@arm.com readQueue.pop_front(); 132710215Sandreas.hansson@arm.com 132810215Sandreas.hansson@arm.com // sanity check 132910215Sandreas.hansson@arm.com assert(dram_pkt->size <= burstSize); 133010215Sandreas.hansson@arm.com assert(dram_pkt->readyTime >= curTick()); 133110215Sandreas.hansson@arm.com 133210215Sandreas.hansson@arm.com // Insert into response queue. It will be sent back to the 133310215Sandreas.hansson@arm.com // requestor at its readyTime 133410215Sandreas.hansson@arm.com if (respQueue.empty()) { 133510215Sandreas.hansson@arm.com assert(!respondEvent.scheduled()); 133610215Sandreas.hansson@arm.com schedule(respondEvent, dram_pkt->readyTime); 133710215Sandreas.hansson@arm.com } else { 133810215Sandreas.hansson@arm.com assert(respQueue.back()->readyTime <= dram_pkt->readyTime); 133910215Sandreas.hansson@arm.com assert(respondEvent.scheduled()); 134010215Sandreas.hansson@arm.com } 134110215Sandreas.hansson@arm.com 134210215Sandreas.hansson@arm.com respQueue.push_back(dram_pkt); 134310206Sandreas.hansson@arm.com 134410206Sandreas.hansson@arm.com // we have so many writes that we have to transition 134510206Sandreas.hansson@arm.com if (writeQueue.size() > writeHighThreshold) { 134610206Sandreas.hansson@arm.com switch_to_writes = true; 134710206Sandreas.hansson@arm.com } 134810206Sandreas.hansson@arm.com } 134910206Sandreas.hansson@arm.com 135010206Sandreas.hansson@arm.com // switching to writes, either because the read queue is empty 135110206Sandreas.hansson@arm.com // and the writes have passed the low threshold (or we are 135210206Sandreas.hansson@arm.com // draining), or because the writes hit the hight threshold 135310206Sandreas.hansson@arm.com if (switch_to_writes) { 135410206Sandreas.hansson@arm.com // transition to writing 135510206Sandreas.hansson@arm.com busState = READ_TO_WRITE; 135610206Sandreas.hansson@arm.com } 13579352SN/A } else { 135810393Swendy.elsasser@arm.com chooseNext(writeQueue, switched_cmd_type); 135910206Sandreas.hansson@arm.com DRAMPacket* dram_pkt = writeQueue.front(); 136010206Sandreas.hansson@arm.com // sanity check 136110206Sandreas.hansson@arm.com assert(dram_pkt->size <= burstSize); 136210393Swendy.elsasser@arm.com 136310394Swendy.elsasser@arm.com // add a bubble to the data bus, as defined by the 136410394Swendy.elsasser@arm.com // tRTW when access is to the same rank as previous burst 136510394Swendy.elsasser@arm.com // Different rank timing is handled with tCS, which is 136610394Swendy.elsasser@arm.com // applied to colAllowedAt 136710394Swendy.elsasser@arm.com if (switched_cmd_type && dram_pkt->rank == activeRank) { 136810394Swendy.elsasser@arm.com busBusyUntil += tRTW; 136910393Swendy.elsasser@arm.com } 137010393Swendy.elsasser@arm.com 137110206Sandreas.hansson@arm.com doDRAMAccess(dram_pkt); 137210206Sandreas.hansson@arm.com 137310206Sandreas.hansson@arm.com writeQueue.pop_front(); 137410206Sandreas.hansson@arm.com delete dram_pkt; 137510206Sandreas.hansson@arm.com 137610206Sandreas.hansson@arm.com // If we emptied the write queue, or got sufficiently below the 137710206Sandreas.hansson@arm.com // threshold (using the minWritesPerSwitch as the hysteresis) and 137810206Sandreas.hansson@arm.com // are not draining, or we have reads waiting and have done enough 137910206Sandreas.hansson@arm.com // writes, then switch to reads. 138010206Sandreas.hansson@arm.com if (writeQueue.empty() || 138110206Sandreas.hansson@arm.com (writeQueue.size() + minWritesPerSwitch < writeLowThreshold && 138210206Sandreas.hansson@arm.com !drainManager) || 138310206Sandreas.hansson@arm.com (!readQueue.empty() && writesThisTime >= minWritesPerSwitch)) { 138410206Sandreas.hansson@arm.com // turn the bus back around for reads again 138510206Sandreas.hansson@arm.com busState = WRITE_TO_READ; 138610206Sandreas.hansson@arm.com 138710206Sandreas.hansson@arm.com // note that the we switch back to reads also in the idle 138810206Sandreas.hansson@arm.com // case, which eventually will check for any draining and 138910206Sandreas.hansson@arm.com // also pause any further scheduling if there is really 139010206Sandreas.hansson@arm.com // nothing to do 139110206Sandreas.hansson@arm.com } 139210206Sandreas.hansson@arm.com } 139310206Sandreas.hansson@arm.com 139410206Sandreas.hansson@arm.com schedule(nextReqEvent, std::max(nextReqTime, curTick())); 139510206Sandreas.hansson@arm.com 139610206Sandreas.hansson@arm.com // If there is space available and we have writes waiting then let 139710206Sandreas.hansson@arm.com // them retry. This is done here to ensure that the retry does not 139810206Sandreas.hansson@arm.com // cause a nextReqEvent to be scheduled before we do so as part of 139910206Sandreas.hansson@arm.com // the next request processing 140010206Sandreas.hansson@arm.com if (retryWrReq && writeQueue.size() < writeBufferSize) { 140110206Sandreas.hansson@arm.com retryWrReq = false; 140210206Sandreas.hansson@arm.com port.sendRetry(); 14039352SN/A } 14049243SN/A} 14059243SN/A 14069967SN/Auint64_t 140710393Swendy.elsasser@arm.comDRAMCtrl::minBankPrep(const deque<DRAMPacket*>& queue, 140810393Swendy.elsasser@arm.com bool switched_cmd_type) const 14099967SN/A{ 14109967SN/A uint64_t bank_mask = 0; 141110211Sandreas.hansson@arm.com Tick min_act_at = MaxTick; 14129967SN/A 141310393Swendy.elsasser@arm.com uint64_t bank_mask_same_rank = 0; 141410393Swendy.elsasser@arm.com Tick min_act_at_same_rank = MaxTick; 141510393Swendy.elsasser@arm.com 141610393Swendy.elsasser@arm.com // Give precedence to commands that access same rank as previous command 141710393Swendy.elsasser@arm.com bool same_rank_match = false; 141810393Swendy.elsasser@arm.com 141910393Swendy.elsasser@arm.com // determine if we have queued transactions targetting the 14209967SN/A // bank in question 14219967SN/A vector<bool> got_waiting(ranksPerChannel * banksPerRank, false); 14229967SN/A for (auto p = queue.begin(); p != queue.end(); ++p) { 14239967SN/A got_waiting[(*p)->bankId] = true; 14249967SN/A } 14259967SN/A 14269967SN/A for (int i = 0; i < ranksPerChannel; i++) { 14279967SN/A for (int j = 0; j < banksPerRank; j++) { 142810211Sandreas.hansson@arm.com uint8_t bank_id = i * banksPerRank + j; 142910211Sandreas.hansson@arm.com 14309967SN/A // if we have waiting requests for the bank, and it is 14319967SN/A // amongst the first available, update the mask 143210211Sandreas.hansson@arm.com if (got_waiting[bank_id]) { 143310211Sandreas.hansson@arm.com // simplistic approximation of when the bank can issue 143410211Sandreas.hansson@arm.com // an activate, ignoring any rank-to-rank switching 143510393Swendy.elsasser@arm.com // cost in this calculation 143610211Sandreas.hansson@arm.com Tick act_at = banks[i][j].openRow == Bank::NO_ROW ? 143710211Sandreas.hansson@arm.com banks[i][j].actAllowedAt : 143810211Sandreas.hansson@arm.com std::max(banks[i][j].preAllowedAt, curTick()) + tRP; 143910211Sandreas.hansson@arm.com 144010393Swendy.elsasser@arm.com // prioritize commands that access the 144110393Swendy.elsasser@arm.com // same rank as previous burst 144210393Swendy.elsasser@arm.com // Calculate bank mask separately for the case and 144310393Swendy.elsasser@arm.com // evaluate after loop iterations complete 144410393Swendy.elsasser@arm.com if (i == activeRank && ranksPerChannel > 1) { 144510393Swendy.elsasser@arm.com if (act_at <= min_act_at_same_rank) { 144610393Swendy.elsasser@arm.com // reset same rank bank mask if new minimum is found 144710393Swendy.elsasser@arm.com // and previous minimum could not immediately send ACT 144810393Swendy.elsasser@arm.com if (act_at < min_act_at_same_rank && 144910393Swendy.elsasser@arm.com min_act_at_same_rank > curTick()) 145010393Swendy.elsasser@arm.com bank_mask_same_rank = 0; 145110393Swendy.elsasser@arm.com 145210393Swendy.elsasser@arm.com // Set flag indicating that a same rank 145310393Swendy.elsasser@arm.com // opportunity was found 145410393Swendy.elsasser@arm.com same_rank_match = true; 145510393Swendy.elsasser@arm.com 145610393Swendy.elsasser@arm.com // set the bit corresponding to the available bank 145710393Swendy.elsasser@arm.com replaceBits(bank_mask_same_rank, bank_id, bank_id, 1); 145810393Swendy.elsasser@arm.com min_act_at_same_rank = act_at; 145910393Swendy.elsasser@arm.com } 146010393Swendy.elsasser@arm.com } else { 146110393Swendy.elsasser@arm.com if (act_at <= min_act_at) { 146210393Swendy.elsasser@arm.com // reset bank mask if new minimum is found 146310393Swendy.elsasser@arm.com // and either previous minimum could not immediately send ACT 146410393Swendy.elsasser@arm.com if (act_at < min_act_at && min_act_at > curTick()) 146510393Swendy.elsasser@arm.com bank_mask = 0; 146610393Swendy.elsasser@arm.com // set the bit corresponding to the available bank 146710393Swendy.elsasser@arm.com replaceBits(bank_mask, bank_id, bank_id, 1); 146810393Swendy.elsasser@arm.com min_act_at = act_at; 146910393Swendy.elsasser@arm.com } 147010211Sandreas.hansson@arm.com } 14719967SN/A } 14729967SN/A } 14739967SN/A } 147410211Sandreas.hansson@arm.com 147510393Swendy.elsasser@arm.com // Determine the earliest time when the next burst can issue based 147610393Swendy.elsasser@arm.com // on the current busBusyUntil delay. 147710393Swendy.elsasser@arm.com // Offset by tRCD to correlate with ACT timing variables 147810393Swendy.elsasser@arm.com Tick min_cmd_at = busBusyUntil - tCL - tRCD; 147910393Swendy.elsasser@arm.com 148010393Swendy.elsasser@arm.com // Prioritize same rank accesses that can issue B2B 148110393Swendy.elsasser@arm.com // Only optimize for same ranks when the command type 148210393Swendy.elsasser@arm.com // does not change; do not want to unnecessarily incur tWTR 148310393Swendy.elsasser@arm.com // 148410393Swendy.elsasser@arm.com // Resulting FCFS prioritization Order is: 148510393Swendy.elsasser@arm.com // 1) Commands that access the same rank as previous burst 148610393Swendy.elsasser@arm.com // and can prep the bank seamlessly. 148710393Swendy.elsasser@arm.com // 2) Commands (any rank) with earliest bank prep 148810393Swendy.elsasser@arm.com if (!switched_cmd_type && same_rank_match && 148910393Swendy.elsasser@arm.com min_act_at_same_rank <= min_cmd_at) { 149010393Swendy.elsasser@arm.com bank_mask = bank_mask_same_rank; 149110393Swendy.elsasser@arm.com } 149210393Swendy.elsasser@arm.com 14939967SN/A return bank_mask; 14949967SN/A} 14959967SN/A 14969243SN/Avoid 149710146Sandreas.hansson@arm.comDRAMCtrl::processRefreshEvent() 14989243SN/A{ 149910207Sandreas.hansson@arm.com // when first preparing the refresh, remember when it was due 150010207Sandreas.hansson@arm.com if (refreshState == REF_IDLE) { 150110207Sandreas.hansson@arm.com // remember when the refresh is due 150210207Sandreas.hansson@arm.com refreshDueAt = curTick(); 15039243SN/A 150410207Sandreas.hansson@arm.com // proceed to drain 150510207Sandreas.hansson@arm.com refreshState = REF_DRAIN; 15069243SN/A 150710207Sandreas.hansson@arm.com DPRINTF(DRAM, "Refresh due\n"); 150810207Sandreas.hansson@arm.com } 150910207Sandreas.hansson@arm.com 151010207Sandreas.hansson@arm.com // let any scheduled read or write go ahead, after which it will 151110207Sandreas.hansson@arm.com // hand control back to this event loop 151210207Sandreas.hansson@arm.com if (refreshState == REF_DRAIN) { 151310207Sandreas.hansson@arm.com if (nextReqEvent.scheduled()) { 151410207Sandreas.hansson@arm.com // hand control over to the request loop until it is 151510207Sandreas.hansson@arm.com // evaluated next 151610207Sandreas.hansson@arm.com DPRINTF(DRAM, "Refresh awaiting draining\n"); 151710207Sandreas.hansson@arm.com 151810207Sandreas.hansson@arm.com return; 151910207Sandreas.hansson@arm.com } else { 152010207Sandreas.hansson@arm.com refreshState = REF_PRE; 152110207Sandreas.hansson@arm.com } 152210207Sandreas.hansson@arm.com } 152310207Sandreas.hansson@arm.com 152410207Sandreas.hansson@arm.com // at this point, ensure that all banks are precharged 152510207Sandreas.hansson@arm.com if (refreshState == REF_PRE) { 152610208Sandreas.hansson@arm.com // precharge any active bank if we are not already in the idle 152710208Sandreas.hansson@arm.com // state 152810208Sandreas.hansson@arm.com if (pwrState != PWR_IDLE) { 152910214Sandreas.hansson@arm.com // at the moment, we use a precharge all even if there is 153010214Sandreas.hansson@arm.com // only a single bank open 153110208Sandreas.hansson@arm.com DPRINTF(DRAM, "Precharging all\n"); 153210214Sandreas.hansson@arm.com 153310214Sandreas.hansson@arm.com // first determine when we can precharge 153410214Sandreas.hansson@arm.com Tick pre_at = curTick(); 153510214Sandreas.hansson@arm.com for (int i = 0; i < ranksPerChannel; i++) { 153610214Sandreas.hansson@arm.com for (int j = 0; j < banksPerRank; j++) { 153710214Sandreas.hansson@arm.com // respect both causality and any existing bank 153810214Sandreas.hansson@arm.com // constraints, some banks could already have a 153910214Sandreas.hansson@arm.com // (auto) precharge scheduled 154010214Sandreas.hansson@arm.com pre_at = std::max(banks[i][j].preAllowedAt, pre_at); 154110214Sandreas.hansson@arm.com } 154210214Sandreas.hansson@arm.com } 154310214Sandreas.hansson@arm.com 154410214Sandreas.hansson@arm.com // make sure all banks are precharged, and for those that 154510214Sandreas.hansson@arm.com // already are, update their availability 154610214Sandreas.hansson@arm.com Tick act_allowed_at = pre_at + tRP; 154710214Sandreas.hansson@arm.com 154810208Sandreas.hansson@arm.com for (int i = 0; i < ranksPerChannel; i++) { 154910208Sandreas.hansson@arm.com for (int j = 0; j < banksPerRank; j++) { 155010208Sandreas.hansson@arm.com if (banks[i][j].openRow != Bank::NO_ROW) { 155110247Sandreas.hansson@arm.com prechargeBank(banks[i][j], pre_at, false); 155210214Sandreas.hansson@arm.com } else { 155310214Sandreas.hansson@arm.com banks[i][j].actAllowedAt = 155410214Sandreas.hansson@arm.com std::max(banks[i][j].actAllowedAt, act_allowed_at); 155510214Sandreas.hansson@arm.com banks[i][j].preAllowedAt = 155610214Sandreas.hansson@arm.com std::max(banks[i][j].preAllowedAt, pre_at); 155710208Sandreas.hansson@arm.com } 155810207Sandreas.hansson@arm.com } 155910247Sandreas.hansson@arm.com 156010247Sandreas.hansson@arm.com // at the moment this affects all ranks 156110432SOmar.Naji@arm.com rankPower[i].powerlib.doCommand(MemCommand::PREA, 0, 156210432SOmar.Naji@arm.com divCeil(pre_at, tCK) - 156310432SOmar.Naji@arm.com timeStampOffset); 156410432SOmar.Naji@arm.com 156510432SOmar.Naji@arm.com DPRINTF(DRAMPower, "%llu,PREA,0,%d\n", divCeil(pre_at, tCK) - 156610432SOmar.Naji@arm.com timeStampOffset, i); 156710207Sandreas.hansson@arm.com } 156810208Sandreas.hansson@arm.com } else { 156910208Sandreas.hansson@arm.com DPRINTF(DRAM, "All banks already precharged, starting refresh\n"); 157010208Sandreas.hansson@arm.com 157110208Sandreas.hansson@arm.com // go ahead and kick the power state machine into gear if 157210208Sandreas.hansson@arm.com // we are already idle 157310208Sandreas.hansson@arm.com schedulePowerEvent(PWR_REF, curTick()); 15749975SN/A } 15759975SN/A 157610208Sandreas.hansson@arm.com refreshState = REF_RUN; 157710208Sandreas.hansson@arm.com assert(numBanksActive == 0); 15789243SN/A 157910208Sandreas.hansson@arm.com // wait for all banks to be precharged, at which point the 158010208Sandreas.hansson@arm.com // power state machine will transition to the idle state, and 158110208Sandreas.hansson@arm.com // automatically move to a refresh, at that point it will also 158210208Sandreas.hansson@arm.com // call this method to get the refresh event loop going again 158310207Sandreas.hansson@arm.com return; 158410207Sandreas.hansson@arm.com } 158510207Sandreas.hansson@arm.com 158610207Sandreas.hansson@arm.com // last but not least we perform the actual refresh 158710207Sandreas.hansson@arm.com if (refreshState == REF_RUN) { 158810207Sandreas.hansson@arm.com // should never get here with any banks active 158910207Sandreas.hansson@arm.com assert(numBanksActive == 0); 159010208Sandreas.hansson@arm.com assert(pwrState == PWR_REF); 159110207Sandreas.hansson@arm.com 159210211Sandreas.hansson@arm.com Tick ref_done_at = curTick() + tRFC; 159310207Sandreas.hansson@arm.com 159410207Sandreas.hansson@arm.com for (int i = 0; i < ranksPerChannel; i++) { 159510207Sandreas.hansson@arm.com for (int j = 0; j < banksPerRank; j++) { 159610211Sandreas.hansson@arm.com banks[i][j].actAllowedAt = ref_done_at; 159710207Sandreas.hansson@arm.com } 159810247Sandreas.hansson@arm.com 159910247Sandreas.hansson@arm.com // at the moment this affects all ranks 160010432SOmar.Naji@arm.com rankPower[i].powerlib.doCommand(MemCommand::REF, 0, 160110432SOmar.Naji@arm.com divCeil(curTick(), tCK) - 160210432SOmar.Naji@arm.com timeStampOffset); 160310432SOmar.Naji@arm.com 160410432SOmar.Naji@arm.com // at the moment sort the list of commands and update the counters 160510432SOmar.Naji@arm.com // for DRAMPower libray when doing a refresh 160610432SOmar.Naji@arm.com sort(rankPower[i].powerlib.cmdList.begin(), 160710432SOmar.Naji@arm.com rankPower[i].powerlib.cmdList.end(), DRAMCtrl::sortTime); 160810432SOmar.Naji@arm.com 160910432SOmar.Naji@arm.com // update the counters for DRAMPower, passing false to 161010432SOmar.Naji@arm.com // indicate that this is not the last command in the 161110432SOmar.Naji@arm.com // list. DRAMPower requires this information for the 161210432SOmar.Naji@arm.com // correct calculation of the background energy at the end 161310432SOmar.Naji@arm.com // of the simulation. Ideally we would want to call this 161410432SOmar.Naji@arm.com // function with true once at the end of the 161510432SOmar.Naji@arm.com // simulation. However, the discarded energy is extremly 161610432SOmar.Naji@arm.com // small and does not effect the final results. 161710432SOmar.Naji@arm.com rankPower[i].powerlib.updateCounters(false); 161810432SOmar.Naji@arm.com 161910432SOmar.Naji@arm.com // call the energy function 162010432SOmar.Naji@arm.com rankPower[i].powerlib.calcEnergy(); 162110432SOmar.Naji@arm.com 162210432SOmar.Naji@arm.com // Update the stats 162310432SOmar.Naji@arm.com updatePowerStats(i); 162410432SOmar.Naji@arm.com 162510432SOmar.Naji@arm.com DPRINTF(DRAMPower, "%llu,REF,0,%d\n", divCeil(curTick(), tCK) - 162610432SOmar.Naji@arm.com timeStampOffset, i); 162710207Sandreas.hansson@arm.com } 162810207Sandreas.hansson@arm.com 162910207Sandreas.hansson@arm.com // make sure we did not wait so long that we cannot make up 163010207Sandreas.hansson@arm.com // for it 163110211Sandreas.hansson@arm.com if (refreshDueAt + tREFI < ref_done_at) { 163210207Sandreas.hansson@arm.com fatal("Refresh was delayed so long we cannot catch up\n"); 163310207Sandreas.hansson@arm.com } 163410207Sandreas.hansson@arm.com 163510207Sandreas.hansson@arm.com // compensate for the delay in actually performing the refresh 163610207Sandreas.hansson@arm.com // when scheduling the next one 163710207Sandreas.hansson@arm.com schedule(refreshEvent, refreshDueAt + tREFI - tRP); 163810207Sandreas.hansson@arm.com 163910208Sandreas.hansson@arm.com assert(!powerEvent.scheduled()); 164010207Sandreas.hansson@arm.com 164110208Sandreas.hansson@arm.com // move to the idle power state once the refresh is done, this 164210208Sandreas.hansson@arm.com // will also move the refresh state machine to the refresh 164310208Sandreas.hansson@arm.com // idle state 164410211Sandreas.hansson@arm.com schedulePowerEvent(PWR_IDLE, ref_done_at); 164510207Sandreas.hansson@arm.com 164610208Sandreas.hansson@arm.com DPRINTF(DRAMState, "Refresh done at %llu and next refresh at %llu\n", 164710211Sandreas.hansson@arm.com ref_done_at, refreshDueAt + tREFI); 164810208Sandreas.hansson@arm.com } 164910208Sandreas.hansson@arm.com} 165010208Sandreas.hansson@arm.com 165110208Sandreas.hansson@arm.comvoid 165210208Sandreas.hansson@arm.comDRAMCtrl::schedulePowerEvent(PowerState pwr_state, Tick tick) 165310208Sandreas.hansson@arm.com{ 165410208Sandreas.hansson@arm.com // respect causality 165510208Sandreas.hansson@arm.com assert(tick >= curTick()); 165610208Sandreas.hansson@arm.com 165710208Sandreas.hansson@arm.com if (!powerEvent.scheduled()) { 165810208Sandreas.hansson@arm.com DPRINTF(DRAMState, "Scheduling power event at %llu to state %d\n", 165910208Sandreas.hansson@arm.com tick, pwr_state); 166010208Sandreas.hansson@arm.com 166110208Sandreas.hansson@arm.com // insert the new transition 166210208Sandreas.hansson@arm.com pwrStateTrans = pwr_state; 166310208Sandreas.hansson@arm.com 166410208Sandreas.hansson@arm.com schedule(powerEvent, tick); 166510208Sandreas.hansson@arm.com } else { 166610208Sandreas.hansson@arm.com panic("Scheduled power event at %llu to state %d, " 166710208Sandreas.hansson@arm.com "with scheduled event at %llu to %d\n", tick, pwr_state, 166810208Sandreas.hansson@arm.com powerEvent.when(), pwrStateTrans); 166910208Sandreas.hansson@arm.com } 167010208Sandreas.hansson@arm.com} 167110208Sandreas.hansson@arm.com 167210208Sandreas.hansson@arm.comvoid 167310208Sandreas.hansson@arm.comDRAMCtrl::processPowerEvent() 167410208Sandreas.hansson@arm.com{ 167510208Sandreas.hansson@arm.com // remember where we were, and for how long 167610208Sandreas.hansson@arm.com Tick duration = curTick() - pwrStateTick; 167710208Sandreas.hansson@arm.com PowerState prev_state = pwrState; 167810208Sandreas.hansson@arm.com 167910208Sandreas.hansson@arm.com // update the accounting 168010208Sandreas.hansson@arm.com pwrStateTime[prev_state] += duration; 168110208Sandreas.hansson@arm.com 168210208Sandreas.hansson@arm.com pwrState = pwrStateTrans; 168310208Sandreas.hansson@arm.com pwrStateTick = curTick(); 168410208Sandreas.hansson@arm.com 168510208Sandreas.hansson@arm.com if (pwrState == PWR_IDLE) { 168610208Sandreas.hansson@arm.com DPRINTF(DRAMState, "All banks precharged\n"); 168710208Sandreas.hansson@arm.com 168810208Sandreas.hansson@arm.com // if we were refreshing, make sure we start scheduling requests again 168910208Sandreas.hansson@arm.com if (prev_state == PWR_REF) { 169010208Sandreas.hansson@arm.com DPRINTF(DRAMState, "Was refreshing for %llu ticks\n", duration); 169110208Sandreas.hansson@arm.com assert(pwrState == PWR_IDLE); 169210208Sandreas.hansson@arm.com 169310208Sandreas.hansson@arm.com // kick things into action again 169410208Sandreas.hansson@arm.com refreshState = REF_IDLE; 169510208Sandreas.hansson@arm.com assert(!nextReqEvent.scheduled()); 169610208Sandreas.hansson@arm.com schedule(nextReqEvent, curTick()); 169710208Sandreas.hansson@arm.com } else { 169810208Sandreas.hansson@arm.com assert(prev_state == PWR_ACT); 169910208Sandreas.hansson@arm.com 170010208Sandreas.hansson@arm.com // if we have a pending refresh, and are now moving to 170110208Sandreas.hansson@arm.com // the idle state, direclty transition to a refresh 170210208Sandreas.hansson@arm.com if (refreshState == REF_RUN) { 170310208Sandreas.hansson@arm.com // there should be nothing waiting at this point 170410208Sandreas.hansson@arm.com assert(!powerEvent.scheduled()); 170510208Sandreas.hansson@arm.com 170610208Sandreas.hansson@arm.com // update the state in zero time and proceed below 170710208Sandreas.hansson@arm.com pwrState = PWR_REF; 170810208Sandreas.hansson@arm.com } 170910208Sandreas.hansson@arm.com } 171010208Sandreas.hansson@arm.com } 171110208Sandreas.hansson@arm.com 171210208Sandreas.hansson@arm.com // we transition to the refresh state, let the refresh state 171310208Sandreas.hansson@arm.com // machine know of this state update and let it deal with the 171410208Sandreas.hansson@arm.com // scheduling of the next power state transition as well as the 171510208Sandreas.hansson@arm.com // following refresh 171610208Sandreas.hansson@arm.com if (pwrState == PWR_REF) { 171710208Sandreas.hansson@arm.com DPRINTF(DRAMState, "Refreshing\n"); 171810208Sandreas.hansson@arm.com // kick the refresh event loop into action again, and that 171910208Sandreas.hansson@arm.com // in turn will schedule a transition to the idle power 172010208Sandreas.hansson@arm.com // state once the refresh is done 172110208Sandreas.hansson@arm.com assert(refreshState == REF_RUN); 172210208Sandreas.hansson@arm.com processRefreshEvent(); 172310207Sandreas.hansson@arm.com } 17249243SN/A} 17259243SN/A 17269243SN/Avoid 172710432SOmar.Naji@arm.comDRAMCtrl::updatePowerStats(uint8_t rank) 172810432SOmar.Naji@arm.com{ 172910432SOmar.Naji@arm.com // Get the energy and power from DRAMPower 173010432SOmar.Naji@arm.com Data::MemoryPowerModel::Energy energy = 173110432SOmar.Naji@arm.com rankPower[rank].powerlib.getEnergy(); 173210432SOmar.Naji@arm.com Data::MemoryPowerModel::Power power = 173310432SOmar.Naji@arm.com rankPower[rank].powerlib.getPower(); 173410432SOmar.Naji@arm.com 173510432SOmar.Naji@arm.com actEnergy[rank] = energy.act_energy * devicesPerRank; 173610432SOmar.Naji@arm.com preEnergy[rank] = energy.pre_energy * devicesPerRank; 173710432SOmar.Naji@arm.com readEnergy[rank] = energy.read_energy * devicesPerRank; 173810432SOmar.Naji@arm.com writeEnergy[rank] = energy.write_energy * devicesPerRank; 173910432SOmar.Naji@arm.com refreshEnergy[rank] = energy.ref_energy * devicesPerRank; 174010432SOmar.Naji@arm.com actBackEnergy[rank] = energy.act_stdby_energy * devicesPerRank; 174110432SOmar.Naji@arm.com preBackEnergy[rank] = energy.pre_stdby_energy * devicesPerRank; 174210432SOmar.Naji@arm.com totalEnergy[rank] = energy.total_energy * devicesPerRank; 174310432SOmar.Naji@arm.com averagePower[rank] = power.average_power * devicesPerRank; 174410432SOmar.Naji@arm.com} 174510432SOmar.Naji@arm.com 174610432SOmar.Naji@arm.comvoid 174710146Sandreas.hansson@arm.comDRAMCtrl::regStats() 17489243SN/A{ 17499243SN/A using namespace Stats; 17509243SN/A 17519243SN/A AbstractMemory::regStats(); 17529243SN/A 17539243SN/A readReqs 17549243SN/A .name(name() + ".readReqs") 17559977SN/A .desc("Number of read requests accepted"); 17569243SN/A 17579243SN/A writeReqs 17589243SN/A .name(name() + ".writeReqs") 17599977SN/A .desc("Number of write requests accepted"); 17609831SN/A 17619831SN/A readBursts 17629831SN/A .name(name() + ".readBursts") 17639977SN/A .desc("Number of DRAM read bursts, " 17649977SN/A "including those serviced by the write queue"); 17659831SN/A 17669831SN/A writeBursts 17679831SN/A .name(name() + ".writeBursts") 17689977SN/A .desc("Number of DRAM write bursts, " 17699977SN/A "including those merged in the write queue"); 17709243SN/A 17719243SN/A servicedByWrQ 17729243SN/A .name(name() + ".servicedByWrQ") 17739977SN/A .desc("Number of DRAM read bursts serviced by the write queue"); 17749977SN/A 17759977SN/A mergedWrBursts 17769977SN/A .name(name() + ".mergedWrBursts") 17779977SN/A .desc("Number of DRAM write bursts merged with an existing one"); 17789243SN/A 17799243SN/A neitherReadNorWrite 17809977SN/A .name(name() + ".neitherReadNorWriteReqs") 17819977SN/A .desc("Number of requests that are neither read nor write"); 17829243SN/A 17839977SN/A perBankRdBursts 17849243SN/A .init(banksPerRank * ranksPerChannel) 17859977SN/A .name(name() + ".perBankRdBursts") 17869977SN/A .desc("Per bank write bursts"); 17879243SN/A 17889977SN/A perBankWrBursts 17899243SN/A .init(banksPerRank * ranksPerChannel) 17909977SN/A .name(name() + ".perBankWrBursts") 17919977SN/A .desc("Per bank write bursts"); 17929243SN/A 17939243SN/A avgRdQLen 17949243SN/A .name(name() + ".avgRdQLen") 17959977SN/A .desc("Average read queue length when enqueuing") 17969243SN/A .precision(2); 17979243SN/A 17989243SN/A avgWrQLen 17999243SN/A .name(name() + ".avgWrQLen") 18009977SN/A .desc("Average write queue length when enqueuing") 18019243SN/A .precision(2); 18029243SN/A 18039243SN/A totQLat 18049243SN/A .name(name() + ".totQLat") 18059977SN/A .desc("Total ticks spent queuing"); 18069243SN/A 18079243SN/A totBusLat 18089243SN/A .name(name() + ".totBusLat") 18099977SN/A .desc("Total ticks spent in databus transfers"); 18109243SN/A 18119243SN/A totMemAccLat 18129243SN/A .name(name() + ".totMemAccLat") 18139977SN/A .desc("Total ticks spent from burst creation until serviced " 18149977SN/A "by the DRAM"); 18159243SN/A 18169243SN/A avgQLat 18179243SN/A .name(name() + ".avgQLat") 18189977SN/A .desc("Average queueing delay per DRAM burst") 18199243SN/A .precision(2); 18209243SN/A 18219831SN/A avgQLat = totQLat / (readBursts - servicedByWrQ); 18229243SN/A 18239243SN/A avgBusLat 18249243SN/A .name(name() + ".avgBusLat") 18259977SN/A .desc("Average bus latency per DRAM burst") 18269243SN/A .precision(2); 18279243SN/A 18289831SN/A avgBusLat = totBusLat / (readBursts - servicedByWrQ); 18299243SN/A 18309243SN/A avgMemAccLat 18319243SN/A .name(name() + ".avgMemAccLat") 18329977SN/A .desc("Average memory access latency per DRAM burst") 18339243SN/A .precision(2); 18349243SN/A 18359831SN/A avgMemAccLat = totMemAccLat / (readBursts - servicedByWrQ); 18369243SN/A 18379243SN/A numRdRetry 18389243SN/A .name(name() + ".numRdRetry") 18399977SN/A .desc("Number of times read queue was full causing retry"); 18409243SN/A 18419243SN/A numWrRetry 18429243SN/A .name(name() + ".numWrRetry") 18439977SN/A .desc("Number of times write queue was full causing retry"); 18449243SN/A 18459243SN/A readRowHits 18469243SN/A .name(name() + ".readRowHits") 18479243SN/A .desc("Number of row buffer hits during reads"); 18489243SN/A 18499243SN/A writeRowHits 18509243SN/A .name(name() + ".writeRowHits") 18519243SN/A .desc("Number of row buffer hits during writes"); 18529243SN/A 18539243SN/A readRowHitRate 18549243SN/A .name(name() + ".readRowHitRate") 18559243SN/A .desc("Row buffer hit rate for reads") 18569243SN/A .precision(2); 18579243SN/A 18589831SN/A readRowHitRate = (readRowHits / (readBursts - servicedByWrQ)) * 100; 18599243SN/A 18609243SN/A writeRowHitRate 18619243SN/A .name(name() + ".writeRowHitRate") 18629243SN/A .desc("Row buffer hit rate for writes") 18639243SN/A .precision(2); 18649243SN/A 18659977SN/A writeRowHitRate = (writeRowHits / (writeBursts - mergedWrBursts)) * 100; 18669243SN/A 18679243SN/A readPktSize 18689831SN/A .init(ceilLog2(burstSize) + 1) 18699243SN/A .name(name() + ".readPktSize") 18709977SN/A .desc("Read request sizes (log2)"); 18719243SN/A 18729243SN/A writePktSize 18739831SN/A .init(ceilLog2(burstSize) + 1) 18749243SN/A .name(name() + ".writePktSize") 18759977SN/A .desc("Write request sizes (log2)"); 18769243SN/A 18779243SN/A rdQLenPdf 18789567SN/A .init(readBufferSize) 18799243SN/A .name(name() + ".rdQLenPdf") 18809243SN/A .desc("What read queue length does an incoming req see"); 18819243SN/A 18829243SN/A wrQLenPdf 18839567SN/A .init(writeBufferSize) 18849243SN/A .name(name() + ".wrQLenPdf") 18859243SN/A .desc("What write queue length does an incoming req see"); 18869243SN/A 18879727SN/A bytesPerActivate 188810141SN/A .init(maxAccessesPerRow) 18899727SN/A .name(name() + ".bytesPerActivate") 18909727SN/A .desc("Bytes accessed per row activation") 18919727SN/A .flags(nozero); 18929243SN/A 189310147Sandreas.hansson@arm.com rdPerTurnAround 189410147Sandreas.hansson@arm.com .init(readBufferSize) 189510147Sandreas.hansson@arm.com .name(name() + ".rdPerTurnAround") 189610147Sandreas.hansson@arm.com .desc("Reads before turning the bus around for writes") 189710147Sandreas.hansson@arm.com .flags(nozero); 189810147Sandreas.hansson@arm.com 189910147Sandreas.hansson@arm.com wrPerTurnAround 190010147Sandreas.hansson@arm.com .init(writeBufferSize) 190110147Sandreas.hansson@arm.com .name(name() + ".wrPerTurnAround") 190210147Sandreas.hansson@arm.com .desc("Writes before turning the bus around for reads") 190310147Sandreas.hansson@arm.com .flags(nozero); 190410147Sandreas.hansson@arm.com 19059975SN/A bytesReadDRAM 19069975SN/A .name(name() + ".bytesReadDRAM") 19079975SN/A .desc("Total number of bytes read from DRAM"); 19089975SN/A 19099975SN/A bytesReadWrQ 19109975SN/A .name(name() + ".bytesReadWrQ") 19119975SN/A .desc("Total number of bytes read from write queue"); 19129243SN/A 19139243SN/A bytesWritten 19149243SN/A .name(name() + ".bytesWritten") 19159977SN/A .desc("Total number of bytes written to DRAM"); 19169243SN/A 19179977SN/A bytesReadSys 19189977SN/A .name(name() + ".bytesReadSys") 19199977SN/A .desc("Total read bytes from the system interface side"); 19209243SN/A 19219977SN/A bytesWrittenSys 19229977SN/A .name(name() + ".bytesWrittenSys") 19239977SN/A .desc("Total written bytes from the system interface side"); 19249243SN/A 19259243SN/A avgRdBW 19269243SN/A .name(name() + ".avgRdBW") 19279977SN/A .desc("Average DRAM read bandwidth in MiByte/s") 19289243SN/A .precision(2); 19299243SN/A 19309977SN/A avgRdBW = (bytesReadDRAM / 1000000) / simSeconds; 19319243SN/A 19329243SN/A avgWrBW 19339243SN/A .name(name() + ".avgWrBW") 19349977SN/A .desc("Average achieved write bandwidth in MiByte/s") 19359243SN/A .precision(2); 19369243SN/A 19379243SN/A avgWrBW = (bytesWritten / 1000000) / simSeconds; 19389243SN/A 19399977SN/A avgRdBWSys 19409977SN/A .name(name() + ".avgRdBWSys") 19419977SN/A .desc("Average system read bandwidth in MiByte/s") 19429243SN/A .precision(2); 19439243SN/A 19449977SN/A avgRdBWSys = (bytesReadSys / 1000000) / simSeconds; 19459243SN/A 19469977SN/A avgWrBWSys 19479977SN/A .name(name() + ".avgWrBWSys") 19489977SN/A .desc("Average system write bandwidth in MiByte/s") 19499243SN/A .precision(2); 19509243SN/A 19519977SN/A avgWrBWSys = (bytesWrittenSys / 1000000) / simSeconds; 19529243SN/A 19539243SN/A peakBW 19549243SN/A .name(name() + ".peakBW") 19559977SN/A .desc("Theoretical peak bandwidth in MiByte/s") 19569243SN/A .precision(2); 19579243SN/A 19589831SN/A peakBW = (SimClock::Frequency / tBURST) * burstSize / 1000000; 19599243SN/A 19609243SN/A busUtil 19619243SN/A .name(name() + ".busUtil") 19629243SN/A .desc("Data bus utilization in percentage") 19639243SN/A .precision(2); 19649243SN/A 19659243SN/A busUtil = (avgRdBW + avgWrBW) / peakBW * 100; 19669243SN/A 19679243SN/A totGap 19689243SN/A .name(name() + ".totGap") 19699243SN/A .desc("Total gap between requests"); 19709243SN/A 19719243SN/A avgGap 19729243SN/A .name(name() + ".avgGap") 19739243SN/A .desc("Average gap between requests") 19749243SN/A .precision(2); 19759243SN/A 19769243SN/A avgGap = totGap / (readReqs + writeReqs); 19779975SN/A 19789975SN/A // Stats for DRAM Power calculation based on Micron datasheet 19799975SN/A busUtilRead 19809975SN/A .name(name() + ".busUtilRead") 19819975SN/A .desc("Data bus utilization in percentage for reads") 19829975SN/A .precision(2); 19839975SN/A 19849975SN/A busUtilRead = avgRdBW / peakBW * 100; 19859975SN/A 19869975SN/A busUtilWrite 19879975SN/A .name(name() + ".busUtilWrite") 19889975SN/A .desc("Data bus utilization in percentage for writes") 19899975SN/A .precision(2); 19909975SN/A 19919975SN/A busUtilWrite = avgWrBW / peakBW * 100; 19929975SN/A 19939975SN/A pageHitRate 19949975SN/A .name(name() + ".pageHitRate") 19959975SN/A .desc("Row buffer hit rate, read and write combined") 19969975SN/A .precision(2); 19979975SN/A 19989977SN/A pageHitRate = (writeRowHits + readRowHits) / 19999977SN/A (writeBursts - mergedWrBursts + readBursts - servicedByWrQ) * 100; 20009975SN/A 200110208Sandreas.hansson@arm.com pwrStateTime 200210208Sandreas.hansson@arm.com .init(5) 200310208Sandreas.hansson@arm.com .name(name() + ".memoryStateTime") 200410208Sandreas.hansson@arm.com .desc("Time in different power states"); 200510208Sandreas.hansson@arm.com pwrStateTime.subname(0, "IDLE"); 200610208Sandreas.hansson@arm.com pwrStateTime.subname(1, "REF"); 200710208Sandreas.hansson@arm.com pwrStateTime.subname(2, "PRE_PDN"); 200810208Sandreas.hansson@arm.com pwrStateTime.subname(3, "ACT"); 200910208Sandreas.hansson@arm.com pwrStateTime.subname(4, "ACT_PDN"); 201010432SOmar.Naji@arm.com 201110432SOmar.Naji@arm.com actEnergy 201210432SOmar.Naji@arm.com .init(ranksPerChannel) 201310432SOmar.Naji@arm.com .name(name() + ".actEnergy") 201410432SOmar.Naji@arm.com .desc("Energy for activate commands per rank (pJ)"); 201510432SOmar.Naji@arm.com 201610432SOmar.Naji@arm.com preEnergy 201710432SOmar.Naji@arm.com .init(ranksPerChannel) 201810432SOmar.Naji@arm.com .name(name() + ".preEnergy") 201910432SOmar.Naji@arm.com .desc("Energy for precharge commands per rank (pJ)"); 202010432SOmar.Naji@arm.com 202110432SOmar.Naji@arm.com readEnergy 202210432SOmar.Naji@arm.com .init(ranksPerChannel) 202310432SOmar.Naji@arm.com .name(name() + ".readEnergy") 202410432SOmar.Naji@arm.com .desc("Energy for read commands per rank (pJ)"); 202510432SOmar.Naji@arm.com 202610432SOmar.Naji@arm.com writeEnergy 202710432SOmar.Naji@arm.com .init(ranksPerChannel) 202810432SOmar.Naji@arm.com .name(name() + ".writeEnergy") 202910432SOmar.Naji@arm.com .desc("Energy for write commands per rank (pJ)"); 203010432SOmar.Naji@arm.com 203110432SOmar.Naji@arm.com refreshEnergy 203210432SOmar.Naji@arm.com .init(ranksPerChannel) 203310432SOmar.Naji@arm.com .name(name() + ".refreshEnergy") 203410432SOmar.Naji@arm.com .desc("Energy for refresh commands per rank (pJ)"); 203510432SOmar.Naji@arm.com 203610432SOmar.Naji@arm.com actBackEnergy 203710432SOmar.Naji@arm.com .init(ranksPerChannel) 203810432SOmar.Naji@arm.com .name(name() + ".actBackEnergy") 203910432SOmar.Naji@arm.com .desc("Energy for active background per rank (pJ)"); 204010432SOmar.Naji@arm.com 204110432SOmar.Naji@arm.com preBackEnergy 204210432SOmar.Naji@arm.com .init(ranksPerChannel) 204310432SOmar.Naji@arm.com .name(name() + ".preBackEnergy") 204410432SOmar.Naji@arm.com .desc("Energy for precharge background per rank (pJ)"); 204510432SOmar.Naji@arm.com 204610432SOmar.Naji@arm.com totalEnergy 204710432SOmar.Naji@arm.com .init(ranksPerChannel) 204810432SOmar.Naji@arm.com .name(name() + ".totalEnergy") 204910432SOmar.Naji@arm.com .desc("Total energy per rank (pJ)"); 205010432SOmar.Naji@arm.com 205110432SOmar.Naji@arm.com averagePower 205210432SOmar.Naji@arm.com .init(ranksPerChannel) 205310432SOmar.Naji@arm.com .name(name() + ".averagePower") 205410432SOmar.Naji@arm.com .desc("Core power per rank (mW)"); 20559243SN/A} 20569243SN/A 20579243SN/Avoid 205810146Sandreas.hansson@arm.comDRAMCtrl::recvFunctional(PacketPtr pkt) 20599243SN/A{ 20609243SN/A // rely on the abstract memory 20619243SN/A functionalAccess(pkt); 20629243SN/A} 20639243SN/A 20649294SN/ABaseSlavePort& 206510146Sandreas.hansson@arm.comDRAMCtrl::getSlavePort(const string &if_name, PortID idx) 20669243SN/A{ 20679243SN/A if (if_name != "port") { 20689243SN/A return MemObject::getSlavePort(if_name, idx); 20699243SN/A } else { 20709243SN/A return port; 20719243SN/A } 20729243SN/A} 20739243SN/A 20749243SN/Aunsigned int 207510146Sandreas.hansson@arm.comDRAMCtrl::drain(DrainManager *dm) 20769243SN/A{ 20779342SN/A unsigned int count = port.drain(dm); 20789243SN/A 20799243SN/A // if there is anything in any of our internal queues, keep track 20809243SN/A // of that as well 20819567SN/A if (!(writeQueue.empty() && readQueue.empty() && 20829567SN/A respQueue.empty())) { 20839352SN/A DPRINTF(Drain, "DRAM controller not drained, write: %d, read: %d," 20849567SN/A " resp: %d\n", writeQueue.size(), readQueue.size(), 20859567SN/A respQueue.size()); 20869243SN/A ++count; 20879342SN/A drainManager = dm; 208810206Sandreas.hansson@arm.com 20899352SN/A // the only part that is not drained automatically over time 209010206Sandreas.hansson@arm.com // is the write queue, thus kick things into action if needed 209110206Sandreas.hansson@arm.com if (!writeQueue.empty() && !nextReqEvent.scheduled()) { 209210206Sandreas.hansson@arm.com schedule(nextReqEvent, curTick()); 209310206Sandreas.hansson@arm.com } 20949243SN/A } 20959243SN/A 20969243SN/A if (count) 20979342SN/A setDrainState(Drainable::Draining); 20989243SN/A else 20999342SN/A setDrainState(Drainable::Drained); 21009243SN/A return count; 21019243SN/A} 21029243SN/A 210310146Sandreas.hansson@arm.comDRAMCtrl::MemoryPort::MemoryPort(const std::string& name, DRAMCtrl& _memory) 21049243SN/A : QueuedSlavePort(name, &_memory, queue), queue(_memory, *this), 21059243SN/A memory(_memory) 21069243SN/A{ } 21079243SN/A 21089243SN/AAddrRangeList 210910146Sandreas.hansson@arm.comDRAMCtrl::MemoryPort::getAddrRanges() const 21109243SN/A{ 21119243SN/A AddrRangeList ranges; 21129243SN/A ranges.push_back(memory.getAddrRange()); 21139243SN/A return ranges; 21149243SN/A} 21159243SN/A 21169243SN/Avoid 211710146Sandreas.hansson@arm.comDRAMCtrl::MemoryPort::recvFunctional(PacketPtr pkt) 21189243SN/A{ 21199243SN/A pkt->pushLabel(memory.name()); 21209243SN/A 21219243SN/A if (!queue.checkFunctional(pkt)) { 21229243SN/A // Default implementation of SimpleTimingPort::recvFunctional() 21239243SN/A // calls recvAtomic() and throws away the latency; we can save a 21249243SN/A // little here by just not calculating the latency. 21259243SN/A memory.recvFunctional(pkt); 21269243SN/A } 21279243SN/A 21289243SN/A pkt->popLabel(); 21299243SN/A} 21309243SN/A 21319243SN/ATick 213210146Sandreas.hansson@arm.comDRAMCtrl::MemoryPort::recvAtomic(PacketPtr pkt) 21339243SN/A{ 21349243SN/A return memory.recvAtomic(pkt); 21359243SN/A} 21369243SN/A 21379243SN/Abool 213810146Sandreas.hansson@arm.comDRAMCtrl::MemoryPort::recvTimingReq(PacketPtr pkt) 21399243SN/A{ 21409243SN/A // pass it to the memory controller 21419243SN/A return memory.recvTimingReq(pkt); 21429243SN/A} 21439243SN/A 214410146Sandreas.hansson@arm.comDRAMCtrl* 214510146Sandreas.hansson@arm.comDRAMCtrlParams::create() 21469243SN/A{ 214710146Sandreas.hansson@arm.com return new DRAMCtrl(this); 21489243SN/A} 2149