dram_ctrl.cc revision 11190
19243SN/A/* 210889Sandreas.hansson@arm.com * Copyright (c) 2010-2015 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 4310618SOmar.Naji@arm.com * Omar Naji 449243SN/A */ 459243SN/A 4610146Sandreas.hansson@arm.com#include "base/bitfield.hh" 479356SN/A#include "base/trace.hh" 4810146Sandreas.hansson@arm.com#include "debug/DRAM.hh" 4910247Sandreas.hansson@arm.com#include "debug/DRAMPower.hh" 5010208Sandreas.hansson@arm.com#include "debug/DRAMState.hh" 519352SN/A#include "debug/Drain.hh" 5210146Sandreas.hansson@arm.com#include "mem/dram_ctrl.hh" 539814SN/A#include "sim/system.hh" 549243SN/A 559243SN/Ausing namespace std; 5610432SOmar.Naji@arm.comusing namespace Data; 579243SN/A 5810146Sandreas.hansson@arm.comDRAMCtrl::DRAMCtrl(const DRAMCtrlParams* p) : 599243SN/A AbstractMemory(p), 6010619Sandreas.hansson@arm.com port(name() + ".port", *this), isTimingMode(false), 619243SN/A retryRdReq(false), retryWrReq(false), 6210211Sandreas.hansson@arm.com busState(READ), 6310618SOmar.Naji@arm.com nextReqEvent(this), respondEvent(this), 6410489SOmar.Naji@arm.com deviceSize(p->device_size), 659831SN/A deviceBusWidth(p->device_bus_width), burstLength(p->burst_length), 669831SN/A deviceRowBufferSize(p->device_rowbuffer_size), 679831SN/A devicesPerRank(p->devices_per_rank), 689831SN/A burstSize((devicesPerRank * burstLength * deviceBusWidth) / 8), 699831SN/A rowBufferSize(devicesPerRank * deviceRowBufferSize), 7010140SN/A columnsPerRowBuffer(rowBufferSize / burstSize), 7110646Sandreas.hansson@arm.com columnsPerStripe(range.interleaved() ? range.granularity() / burstSize : 1), 729243SN/A ranksPerChannel(p->ranks_per_channel), 7310394Swendy.elsasser@arm.com bankGroupsPerRank(p->bank_groups_per_rank), 7410394Swendy.elsasser@arm.com bankGroupArch(p->bank_groups_per_rank > 0), 759566SN/A banksPerRank(p->banks_per_rank), channels(p->channels), rowsPerBank(0), 769243SN/A readBufferSize(p->read_buffer_size), 779243SN/A writeBufferSize(p->write_buffer_size), 7810140SN/A writeHighThreshold(writeBufferSize * p->write_high_thresh_perc / 100.0), 7910140SN/A writeLowThreshold(writeBufferSize * p->write_low_thresh_perc / 100.0), 8010147Sandreas.hansson@arm.com minWritesPerSwitch(p->min_writes_per_switch), 8110147Sandreas.hansson@arm.com writesThisTime(0), readsThisTime(0), 8210393Swendy.elsasser@arm.com tCK(p->tCK), tWTR(p->tWTR), tRTW(p->tRTW), tCS(p->tCS), tBURST(p->tBURST), 8310394Swendy.elsasser@arm.com tCCD_L(p->tCCD_L), tRCD(p->tRCD), tCL(p->tCL), tRP(p->tRP), tRAS(p->tRAS), 8410394Swendy.elsasser@arm.com tWR(p->tWR), tRTP(p->tRTP), tRFC(p->tRFC), tREFI(p->tREFI), tRRD(p->tRRD), 8510394Swendy.elsasser@arm.com tRRD_L(p->tRRD_L), tXAW(p->tXAW), activationLimit(p->activation_limit), 869243SN/A memSchedPolicy(p->mem_sched_policy), addrMapping(p->addr_mapping), 879243SN/A pageMgmt(p->page_policy), 8810141SN/A maxAccessesPerRow(p->max_accesses_per_row), 899726SN/A frontendLatency(p->static_frontend_latency), 909726SN/A backendLatency(p->static_backend_latency), 9110618SOmar.Naji@arm.com busBusyUntil(0), prevArrival(0), 9210618SOmar.Naji@arm.com nextReqTime(0), activeRank(0), timeStampOffset(0) 939243SN/A{ 9410620Sandreas.hansson@arm.com // sanity check the ranks since we rely on bit slicing for the 9510620Sandreas.hansson@arm.com // address decoding 9610620Sandreas.hansson@arm.com fatal_if(!isPowerOf2(ranksPerChannel), "DRAM rank count of %d is not " 9710620Sandreas.hansson@arm.com "allowed, must be a power of two\n", ranksPerChannel); 9810620Sandreas.hansson@arm.com 9910889Sandreas.hansson@arm.com fatal_if(!isPowerOf2(burstSize), "DRAM burst size %d is not allowed, " 10010889Sandreas.hansson@arm.com "must be a power of two\n", burstSize); 10110889Sandreas.hansson@arm.com 10210618SOmar.Naji@arm.com for (int i = 0; i < ranksPerChannel; i++) { 10310618SOmar.Naji@arm.com Rank* rank = new Rank(*this, p); 10410618SOmar.Naji@arm.com ranks.push_back(rank); 10510432SOmar.Naji@arm.com 10610618SOmar.Naji@arm.com rank->actTicks.resize(activationLimit, 0); 10710618SOmar.Naji@arm.com rank->banks.resize(banksPerRank); 10810618SOmar.Naji@arm.com rank->rank = i; 10910432SOmar.Naji@arm.com 11010246Sandreas.hansson@arm.com for (int b = 0; b < banksPerRank; b++) { 11110618SOmar.Naji@arm.com rank->banks[b].bank = b; 11210561SOmar.Naji@arm.com // GDDR addressing of banks to BG is linear. 11310561SOmar.Naji@arm.com // Here we assume that all DRAM generations address bank groups as 11410561SOmar.Naji@arm.com // follows: 11510394Swendy.elsasser@arm.com if (bankGroupArch) { 11610394Swendy.elsasser@arm.com // Simply assign lower bits to bank group in order to 11710394Swendy.elsasser@arm.com // rotate across bank groups as banks are incremented 11810394Swendy.elsasser@arm.com // e.g. with 4 banks per bank group and 16 banks total: 11910394Swendy.elsasser@arm.com // banks 0,4,8,12 are in bank group 0 12010394Swendy.elsasser@arm.com // banks 1,5,9,13 are in bank group 1 12110394Swendy.elsasser@arm.com // banks 2,6,10,14 are in bank group 2 12210394Swendy.elsasser@arm.com // banks 3,7,11,15 are in bank group 3 12310618SOmar.Naji@arm.com rank->banks[b].bankgr = b % bankGroupsPerRank; 12410394Swendy.elsasser@arm.com } else { 12510394Swendy.elsasser@arm.com // No bank groups; simply assign to bank number 12610618SOmar.Naji@arm.com rank->banks[b].bankgr = b; 12710394Swendy.elsasser@arm.com } 12810246Sandreas.hansson@arm.com } 12910246Sandreas.hansson@arm.com } 13010246Sandreas.hansson@arm.com 13110140SN/A // perform a basic check of the write thresholds 13210140SN/A if (p->write_low_thresh_perc >= p->write_high_thresh_perc) 13310140SN/A fatal("Write buffer low threshold %d must be smaller than the " 13410140SN/A "high threshold %d\n", p->write_low_thresh_perc, 13510140SN/A p->write_high_thresh_perc); 1369243SN/A 1379243SN/A // determine the rows per bank by looking at the total capacity 1389567SN/A uint64_t capacity = ULL(1) << ceilLog2(AbstractMemory::size()); 1399243SN/A 14010489SOmar.Naji@arm.com // determine the dram actual capacity from the DRAM config in Mbytes 14110489SOmar.Naji@arm.com uint64_t deviceCapacity = deviceSize / (1024 * 1024) * devicesPerRank * 14210489SOmar.Naji@arm.com ranksPerChannel; 14310489SOmar.Naji@arm.com 14410489SOmar.Naji@arm.com // if actual DRAM size does not match memory capacity in system warn! 14510489SOmar.Naji@arm.com if (deviceCapacity != capacity / (1024 * 1024)) 14610489SOmar.Naji@arm.com warn("DRAM device capacity (%d Mbytes) does not match the " 14710489SOmar.Naji@arm.com "address range assigned (%d Mbytes)\n", deviceCapacity, 14810489SOmar.Naji@arm.com capacity / (1024 * 1024)); 14910489SOmar.Naji@arm.com 1509243SN/A DPRINTF(DRAM, "Memory capacity %lld (%lld) bytes\n", capacity, 1519243SN/A AbstractMemory::size()); 1529831SN/A 1539831SN/A DPRINTF(DRAM, "Row buffer size %d bytes with %d columns per row buffer\n", 1549831SN/A rowBufferSize, columnsPerRowBuffer); 1559831SN/A 1569831SN/A rowsPerBank = capacity / (rowBufferSize * banksPerRank * ranksPerChannel); 1579243SN/A 15810207Sandreas.hansson@arm.com // some basic sanity checks 15910207Sandreas.hansson@arm.com if (tREFI <= tRP || tREFI <= tRFC) { 16010207Sandreas.hansson@arm.com fatal("tREFI (%d) must be larger than tRP (%d) and tRFC (%d)\n", 16110207Sandreas.hansson@arm.com tREFI, tRP, tRFC); 16210207Sandreas.hansson@arm.com } 16310394Swendy.elsasser@arm.com 16410394Swendy.elsasser@arm.com // basic bank group architecture checks -> 16510394Swendy.elsasser@arm.com if (bankGroupArch) { 16610394Swendy.elsasser@arm.com // must have at least one bank per bank group 16710394Swendy.elsasser@arm.com if (bankGroupsPerRank > banksPerRank) { 16810394Swendy.elsasser@arm.com fatal("banks per rank (%d) must be equal to or larger than " 16910394Swendy.elsasser@arm.com "banks groups per rank (%d)\n", 17010394Swendy.elsasser@arm.com banksPerRank, bankGroupsPerRank); 17110394Swendy.elsasser@arm.com } 17210394Swendy.elsasser@arm.com // must have same number of banks in each bank group 17310394Swendy.elsasser@arm.com if ((banksPerRank % bankGroupsPerRank) != 0) { 17410394Swendy.elsasser@arm.com fatal("Banks per rank (%d) must be evenly divisible by bank groups " 17510394Swendy.elsasser@arm.com "per rank (%d) for equal banks per bank group\n", 17610394Swendy.elsasser@arm.com banksPerRank, bankGroupsPerRank); 17710394Swendy.elsasser@arm.com } 17810394Swendy.elsasser@arm.com // tCCD_L should be greater than minimal, back-to-back burst delay 17910394Swendy.elsasser@arm.com if (tCCD_L <= tBURST) { 18010394Swendy.elsasser@arm.com fatal("tCCD_L (%d) should be larger than tBURST (%d) when " 18110394Swendy.elsasser@arm.com "bank groups per rank (%d) is greater than 1\n", 18210394Swendy.elsasser@arm.com tCCD_L, tBURST, bankGroupsPerRank); 18310394Swendy.elsasser@arm.com } 18410394Swendy.elsasser@arm.com // tRRD_L is greater than minimal, same bank group ACT-to-ACT delay 18510561SOmar.Naji@arm.com // some datasheets might specify it equal to tRRD 18610561SOmar.Naji@arm.com if (tRRD_L < tRRD) { 18710394Swendy.elsasser@arm.com fatal("tRRD_L (%d) should be larger than tRRD (%d) when " 18810394Swendy.elsasser@arm.com "bank groups per rank (%d) is greater than 1\n", 18910394Swendy.elsasser@arm.com tRRD_L, tRRD, bankGroupsPerRank); 19010394Swendy.elsasser@arm.com } 19110394Swendy.elsasser@arm.com } 19210394Swendy.elsasser@arm.com 1939243SN/A} 1949243SN/A 1959243SN/Avoid 19610146Sandreas.hansson@arm.comDRAMCtrl::init() 19710140SN/A{ 19810466Sandreas.hansson@arm.com AbstractMemory::init(); 19910466Sandreas.hansson@arm.com 20010466Sandreas.hansson@arm.com if (!port.isConnected()) { 20110146Sandreas.hansson@arm.com fatal("DRAMCtrl %s is unconnected!\n", name()); 20210140SN/A } else { 20310140SN/A port.sendRangeChange(); 20410140SN/A } 20510646Sandreas.hansson@arm.com 20610646Sandreas.hansson@arm.com // a bit of sanity checks on the interleaving, save it for here to 20710646Sandreas.hansson@arm.com // ensure that the system pointer is initialised 20810646Sandreas.hansson@arm.com if (range.interleaved()) { 20910646Sandreas.hansson@arm.com if (channels != range.stripes()) 21010646Sandreas.hansson@arm.com fatal("%s has %d interleaved address stripes but %d channel(s)\n", 21110646Sandreas.hansson@arm.com name(), range.stripes(), channels); 21210646Sandreas.hansson@arm.com 21310646Sandreas.hansson@arm.com if (addrMapping == Enums::RoRaBaChCo) { 21410646Sandreas.hansson@arm.com if (rowBufferSize != range.granularity()) { 21510646Sandreas.hansson@arm.com fatal("Channel interleaving of %s doesn't match RoRaBaChCo " 21610646Sandreas.hansson@arm.com "address map\n", name()); 21710646Sandreas.hansson@arm.com } 21810646Sandreas.hansson@arm.com } else if (addrMapping == Enums::RoRaBaCoCh || 21910646Sandreas.hansson@arm.com addrMapping == Enums::RoCoRaBaCh) { 22010646Sandreas.hansson@arm.com // for the interleavings with channel bits in the bottom, 22110646Sandreas.hansson@arm.com // if the system uses a channel striping granularity that 22210646Sandreas.hansson@arm.com // is larger than the DRAM burst size, then map the 22310646Sandreas.hansson@arm.com // sequential accesses within a stripe to a number of 22410646Sandreas.hansson@arm.com // columns in the DRAM, effectively placing some of the 22510646Sandreas.hansson@arm.com // lower-order column bits as the least-significant bits 22610646Sandreas.hansson@arm.com // of the address (above the ones denoting the burst size) 22710646Sandreas.hansson@arm.com assert(columnsPerStripe >= 1); 22810646Sandreas.hansson@arm.com 22910646Sandreas.hansson@arm.com // channel striping has to be done at a granularity that 23010646Sandreas.hansson@arm.com // is equal or larger to a cache line 23110646Sandreas.hansson@arm.com if (system()->cacheLineSize() > range.granularity()) { 23210646Sandreas.hansson@arm.com fatal("Channel interleaving of %s must be at least as large " 23310646Sandreas.hansson@arm.com "as the cache line size\n", name()); 23410646Sandreas.hansson@arm.com } 23510646Sandreas.hansson@arm.com 23610646Sandreas.hansson@arm.com // ...and equal or smaller than the row-buffer size 23710646Sandreas.hansson@arm.com if (rowBufferSize < range.granularity()) { 23810646Sandreas.hansson@arm.com fatal("Channel interleaving of %s must be at most as large " 23910646Sandreas.hansson@arm.com "as the row-buffer size\n", name()); 24010646Sandreas.hansson@arm.com } 24110646Sandreas.hansson@arm.com // this is essentially the check above, so just to be sure 24210646Sandreas.hansson@arm.com assert(columnsPerStripe <= columnsPerRowBuffer); 24310646Sandreas.hansson@arm.com } 24410646Sandreas.hansson@arm.com } 24510140SN/A} 24610140SN/A 24710140SN/Avoid 24810146Sandreas.hansson@arm.comDRAMCtrl::startup() 2499243SN/A{ 25010619Sandreas.hansson@arm.com // remember the memory system mode of operation 25110619Sandreas.hansson@arm.com isTimingMode = system()->isTimingMode(); 25210618SOmar.Naji@arm.com 25310619Sandreas.hansson@arm.com if (isTimingMode) { 25410619Sandreas.hansson@arm.com // timestamp offset should be in clock cycles for DRAMPower 25510619Sandreas.hansson@arm.com timeStampOffset = divCeil(curTick(), tCK); 25610619Sandreas.hansson@arm.com 25710619Sandreas.hansson@arm.com // update the start tick for the precharge accounting to the 25810619Sandreas.hansson@arm.com // current tick 25910619Sandreas.hansson@arm.com for (auto r : ranks) { 26010619Sandreas.hansson@arm.com r->startup(curTick() + tREFI - tRP); 26110619Sandreas.hansson@arm.com } 26210619Sandreas.hansson@arm.com 26310619Sandreas.hansson@arm.com // shift the bus busy time sufficiently far ahead that we never 26410619Sandreas.hansson@arm.com // have to worry about negative values when computing the time for 26510619Sandreas.hansson@arm.com // the next request, this will add an insignificant bubble at the 26610619Sandreas.hansson@arm.com // start of simulation 26710619Sandreas.hansson@arm.com busBusyUntil = curTick() + tRP + tRCD + tCL; 26810618SOmar.Naji@arm.com } 2699243SN/A} 2709243SN/A 2719243SN/ATick 27210146Sandreas.hansson@arm.comDRAMCtrl::recvAtomic(PacketPtr pkt) 2739243SN/A{ 2749243SN/A DPRINTF(DRAM, "recvAtomic: %s 0x%x\n", pkt->cmdString(), pkt->getAddr()); 2759243SN/A 2769243SN/A // do the actual memory access and turn the packet into a response 2779243SN/A access(pkt); 2789243SN/A 2799243SN/A Tick latency = 0; 2809243SN/A if (!pkt->memInhibitAsserted() && pkt->hasData()) { 2819243SN/A // this value is not supposed to be accurate, just enough to 2829243SN/A // keep things going, mimic a closed page 2839243SN/A latency = tRP + tRCD + tCL; 2849243SN/A } 2859243SN/A return latency; 2869243SN/A} 2879243SN/A 2889243SN/Abool 28910146Sandreas.hansson@arm.comDRAMCtrl::readQueueFull(unsigned int neededEntries) const 2909243SN/A{ 2919831SN/A DPRINTF(DRAM, "Read queue limit %d, current size %d, entries needed %d\n", 2929831SN/A readBufferSize, readQueue.size() + respQueue.size(), 2939831SN/A neededEntries); 2949243SN/A 2959831SN/A return 2969831SN/A (readQueue.size() + respQueue.size() + neededEntries) > readBufferSize; 2979243SN/A} 2989243SN/A 2999243SN/Abool 30010146Sandreas.hansson@arm.comDRAMCtrl::writeQueueFull(unsigned int neededEntries) const 3019243SN/A{ 3029831SN/A DPRINTF(DRAM, "Write queue limit %d, current size %d, entries needed %d\n", 3039831SN/A writeBufferSize, writeQueue.size(), neededEntries); 3049831SN/A return (writeQueue.size() + neededEntries) > writeBufferSize; 3059243SN/A} 3069243SN/A 30710146Sandreas.hansson@arm.comDRAMCtrl::DRAMPacket* 30810146Sandreas.hansson@arm.comDRAMCtrl::decodeAddr(PacketPtr pkt, Addr dramPktAddr, unsigned size, 30910143SN/A bool isRead) 3109243SN/A{ 3119669SN/A // decode the address based on the address mapping scheme, with 31210136SN/A // Ro, Ra, Co, Ba and Ch denoting row, rank, column, bank and 31310136SN/A // channel, respectively 3149243SN/A uint8_t rank; 3159967SN/A uint8_t bank; 31610245Sandreas.hansson@arm.com // use a 64-bit unsigned during the computations as the row is 31710245Sandreas.hansson@arm.com // always the top bits, and check before creating the DRAMPacket 31810245Sandreas.hansson@arm.com uint64_t row; 3199243SN/A 32010286Sandreas.hansson@arm.com // truncate the address to a DRAM burst, which makes it unique to 32110286Sandreas.hansson@arm.com // a specific column, row, bank, rank and channel 3229831SN/A Addr addr = dramPktAddr / burstSize; 3239243SN/A 3249491SN/A // we have removed the lowest order address bits that denote the 3259831SN/A // position within the column 32610136SN/A if (addrMapping == Enums::RoRaBaChCo) { 3279491SN/A // the lowest order bits denote the column to ensure that 3289491SN/A // sequential cache lines occupy the same row 3299831SN/A addr = addr / columnsPerRowBuffer; 3309243SN/A 3319669SN/A // take out the channel part of the address 3329566SN/A addr = addr / channels; 3339566SN/A 3349669SN/A // after the channel bits, get the bank bits to interleave 3359669SN/A // over the banks 3369669SN/A bank = addr % banksPerRank; 3379669SN/A addr = addr / banksPerRank; 3389669SN/A 3399669SN/A // after the bank, we get the rank bits which thus interleaves 3409669SN/A // over the ranks 3419669SN/A rank = addr % ranksPerChannel; 3429669SN/A addr = addr / ranksPerChannel; 3439669SN/A 34411189Sandreas.hansson@arm.com // lastly, get the row bits, no need to remove them from addr 3459669SN/A row = addr % rowsPerBank; 34610136SN/A } else if (addrMapping == Enums::RoRaBaCoCh) { 34710286Sandreas.hansson@arm.com // take out the lower-order column bits 34810286Sandreas.hansson@arm.com addr = addr / columnsPerStripe; 34910286Sandreas.hansson@arm.com 3509669SN/A // take out the channel part of the address 3519669SN/A addr = addr / channels; 3529669SN/A 35310286Sandreas.hansson@arm.com // next, the higher-order column bites 35410286Sandreas.hansson@arm.com addr = addr / (columnsPerRowBuffer / columnsPerStripe); 3559669SN/A 3569669SN/A // after the column bits, we get the bank bits to interleave 3579491SN/A // over the banks 3589243SN/A bank = addr % banksPerRank; 3599243SN/A addr = addr / banksPerRank; 3609243SN/A 3619491SN/A // after the bank, we get the rank bits which thus interleaves 3629491SN/A // over the ranks 3639243SN/A rank = addr % ranksPerChannel; 3649243SN/A addr = addr / ranksPerChannel; 3659243SN/A 36611189Sandreas.hansson@arm.com // lastly, get the row bits, no need to remove them from addr 3679243SN/A row = addr % rowsPerBank; 36810136SN/A } else if (addrMapping == Enums::RoCoRaBaCh) { 3699491SN/A // optimise for closed page mode and utilise maximum 3709491SN/A // parallelism of the DRAM (at the cost of power) 3719491SN/A 37210286Sandreas.hansson@arm.com // take out the lower-order column bits 37310286Sandreas.hansson@arm.com addr = addr / columnsPerStripe; 37410286Sandreas.hansson@arm.com 3759566SN/A // take out the channel part of the address, not that this has 3769566SN/A // to match with how accesses are interleaved between the 3779566SN/A // controllers in the address mapping 3789566SN/A addr = addr / channels; 3799566SN/A 3809491SN/A // start with the bank bits, as this provides the maximum 3819491SN/A // opportunity for parallelism between requests 3829243SN/A bank = addr % banksPerRank; 3839243SN/A addr = addr / banksPerRank; 3849243SN/A 3859491SN/A // next get the rank bits 3869243SN/A rank = addr % ranksPerChannel; 3879243SN/A addr = addr / ranksPerChannel; 3889243SN/A 38910286Sandreas.hansson@arm.com // next, the higher-order column bites 39010286Sandreas.hansson@arm.com addr = addr / (columnsPerRowBuffer / columnsPerStripe); 3919243SN/A 39211189Sandreas.hansson@arm.com // lastly, get the row bits, no need to remove them from addr 3939243SN/A row = addr % rowsPerBank; 3949243SN/A } else 3959243SN/A panic("Unknown address mapping policy chosen!"); 3969243SN/A 3979243SN/A assert(rank < ranksPerChannel); 3989243SN/A assert(bank < banksPerRank); 3999243SN/A assert(row < rowsPerBank); 40010245Sandreas.hansson@arm.com assert(row < Bank::NO_ROW); 4019243SN/A 4029243SN/A DPRINTF(DRAM, "Address: %lld Rank %d Bank %d Row %d\n", 4039831SN/A dramPktAddr, rank, bank, row); 4049243SN/A 4059243SN/A // create the corresponding DRAM packet with the entry time and 4069567SN/A // ready time set to the current tick, the latter will be updated 4079567SN/A // later 4089967SN/A uint16_t bank_id = banksPerRank * rank + bank; 4099967SN/A return new DRAMPacket(pkt, isRead, rank, bank, row, bank_id, dramPktAddr, 41010618SOmar.Naji@arm.com size, ranks[rank]->banks[bank], *ranks[rank]); 4119243SN/A} 4129243SN/A 4139243SN/Avoid 41410146Sandreas.hansson@arm.comDRAMCtrl::addToReadQueue(PacketPtr pkt, unsigned int pktCount) 4159243SN/A{ 4169243SN/A // only add to the read queue here. whenever the request is 4179243SN/A // eventually done, set the readyTime, and call schedule() 4189243SN/A assert(!pkt->isWrite()); 4199243SN/A 4209831SN/A assert(pktCount != 0); 4219831SN/A 4229831SN/A // if the request size is larger than burst size, the pkt is split into 4239831SN/A // multiple DRAM packets 4249831SN/A // Note if the pkt starting address is not aligened to burst size, the 4259831SN/A // address of first DRAM packet is kept unaliged. Subsequent DRAM packets 4269831SN/A // are aligned to burst size boundaries. This is to ensure we accurately 4279831SN/A // check read packets against packets in write queue. 4289243SN/A Addr addr = pkt->getAddr(); 4299831SN/A unsigned pktsServicedByWrQ = 0; 4309831SN/A BurstHelper* burst_helper = NULL; 4319831SN/A for (int cnt = 0; cnt < pktCount; ++cnt) { 4329831SN/A unsigned size = std::min((addr | (burstSize - 1)) + 1, 4339831SN/A pkt->getAddr() + pkt->getSize()) - addr; 4349831SN/A readPktSize[ceilLog2(size)]++; 4359831SN/A readBursts++; 4369243SN/A 4379831SN/A // First check write buffer to see if the data is already at 4389831SN/A // the controller 4399831SN/A bool foundInWrQ = false; 44010889Sandreas.hansson@arm.com Addr burst_addr = burstAlign(addr); 44110889Sandreas.hansson@arm.com // if the burst address is not present then there is no need 44210889Sandreas.hansson@arm.com // looking any further 44310889Sandreas.hansson@arm.com if (isInWriteQueue.find(burst_addr) != isInWriteQueue.end()) { 44410889Sandreas.hansson@arm.com for (const auto& p : writeQueue) { 44510889Sandreas.hansson@arm.com // check if the read is subsumed in the write queue 44610889Sandreas.hansson@arm.com // packet we are looking at 44710889Sandreas.hansson@arm.com if (p->addr <= addr && (addr + size) <= (p->addr + p->size)) { 44810889Sandreas.hansson@arm.com foundInWrQ = true; 44910889Sandreas.hansson@arm.com servicedByWrQ++; 45010889Sandreas.hansson@arm.com pktsServicedByWrQ++; 45110889Sandreas.hansson@arm.com DPRINTF(DRAM, "Read to addr %lld with size %d serviced by " 45210889Sandreas.hansson@arm.com "write queue\n", addr, size); 45310889Sandreas.hansson@arm.com bytesReadWrQ += burstSize; 45410889Sandreas.hansson@arm.com break; 45510889Sandreas.hansson@arm.com } 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 52310889Sandreas.hansson@arm.com // queue and keep track of whether we have merged or not 52410889Sandreas.hansson@arm.com bool merged = isInWriteQueue.find(burstAlign(addr)) != 52510889Sandreas.hansson@arm.com isInWriteQueue.end(); 5269243SN/A 5279832SN/A // if the item was not merged we need to create a new write 5289832SN/A // and enqueue it 5299832SN/A if (!merged) { 5309966SN/A DRAMPacket* dram_pkt = decodeAddr(pkt, addr, size, false); 5319243SN/A 5329832SN/A assert(writeQueue.size() < writeBufferSize); 5339832SN/A wrQLenPdf[writeQueue.size()]++; 5349243SN/A 5359832SN/A DPRINTF(DRAM, "Adding to write queue\n"); 5369831SN/A 5379832SN/A writeQueue.push_back(dram_pkt); 53810889Sandreas.hansson@arm.com isInWriteQueue.insert(burstAlign(addr)); 53910889Sandreas.hansson@arm.com assert(writeQueue.size() == isInWriteQueue.size()); 5409831SN/A 5419832SN/A // Update stats 5429832SN/A avgWrQLen = writeQueue.size(); 5439977SN/A } else { 54410889Sandreas.hansson@arm.com DPRINTF(DRAM, "Merging write burst with existing queue entry\n"); 54510889Sandreas.hansson@arm.com 5469977SN/A // keep track of the fact that this burst effectively 5479977SN/A // disappeared as it was merged with an existing one 5489977SN/A mergedWrBursts++; 5499832SN/A } 5509832SN/A 5519831SN/A // Starting address of next dram pkt (aligend to burstSize boundary) 5529831SN/A addr = (addr | (burstSize - 1)) + 1; 5539831SN/A } 5549243SN/A 5559243SN/A // we do not wait for the writes to be send to the actual memory, 5569243SN/A // but instead take responsibility for the consistency here and 5579243SN/A // snoop the write queue for any upcoming reads 5589831SN/A // @todo, if a pkt size is larger than burst size, we might need a 5599831SN/A // different front end latency 5609726SN/A accessAndRespond(pkt, frontendLatency); 5619243SN/A 56210206Sandreas.hansson@arm.com // If we are not already scheduled to get a request out of the 56310206Sandreas.hansson@arm.com // queue, do so now 56410206Sandreas.hansson@arm.com if (!nextReqEvent.scheduled()) { 56510206Sandreas.hansson@arm.com DPRINTF(DRAM, "Request scheduled immediately\n"); 56610206Sandreas.hansson@arm.com schedule(nextReqEvent, curTick()); 5679243SN/A } 5689243SN/A} 5699243SN/A 5709243SN/Avoid 57110146Sandreas.hansson@arm.comDRAMCtrl::printQs() const { 5729243SN/A DPRINTF(DRAM, "===READ QUEUE===\n\n"); 5739833SN/A for (auto i = readQueue.begin() ; i != readQueue.end() ; ++i) { 5749243SN/A DPRINTF(DRAM, "Read %lu\n", (*i)->addr); 5759243SN/A } 5769243SN/A DPRINTF(DRAM, "\n===RESP QUEUE===\n\n"); 5779833SN/A for (auto i = respQueue.begin() ; i != respQueue.end() ; ++i) { 5789243SN/A DPRINTF(DRAM, "Response %lu\n", (*i)->addr); 5799243SN/A } 5809243SN/A DPRINTF(DRAM, "\n===WRITE QUEUE===\n\n"); 5819833SN/A for (auto i = writeQueue.begin() ; i != writeQueue.end() ; ++i) { 5829243SN/A DPRINTF(DRAM, "Write %lu\n", (*i)->addr); 5839243SN/A } 5849243SN/A} 5859243SN/A 5869243SN/Abool 58710146Sandreas.hansson@arm.comDRAMCtrl::recvTimingReq(PacketPtr pkt) 5889243SN/A{ 5899243SN/A // This is where we enter from the outside world 5909567SN/A DPRINTF(DRAM, "recvTimingReq: request %s addr %lld size %d\n", 5919831SN/A pkt->cmdString(), pkt->getAddr(), pkt->getSize()); 5929243SN/A 59310883Sali.jafri@arm.com // simply drop inhibited packets and clean evictions 59410883Sali.jafri@arm.com if (pkt->memInhibitAsserted() || 59510883Sali.jafri@arm.com pkt->cmd == MemCmd::CleanEvict) { 59610883Sali.jafri@arm.com DPRINTF(DRAM, "Inhibited packet or clean evict -- Dropping it now\n"); 59711190Sandreas.hansson@arm.com pendingDelete.reset(pkt); 5989567SN/A return true; 5999567SN/A } 6009243SN/A 6019243SN/A // Calc avg gap between requests 6029243SN/A if (prevArrival != 0) { 6039243SN/A totGap += curTick() - prevArrival; 6049243SN/A } 6059243SN/A prevArrival = curTick(); 6069243SN/A 6079831SN/A 6089831SN/A // Find out how many dram packets a pkt translates to 6099831SN/A // If the burst size is equal or larger than the pkt size, then a pkt 6109831SN/A // translates to only one dram packet. Otherwise, a pkt translates to 6119831SN/A // multiple dram packets 6129243SN/A unsigned size = pkt->getSize(); 6139831SN/A unsigned offset = pkt->getAddr() & (burstSize - 1); 6149831SN/A unsigned int dram_pkt_count = divCeil(offset + size, burstSize); 6159243SN/A 6169243SN/A // check local buffers and do not accept if full 6179243SN/A if (pkt->isRead()) { 6189567SN/A assert(size != 0); 6199831SN/A if (readQueueFull(dram_pkt_count)) { 6209567SN/A DPRINTF(DRAM, "Read queue full, not accepting\n"); 6219243SN/A // remember that we have to retry this port 6229243SN/A retryRdReq = true; 6239243SN/A numRdRetry++; 6249243SN/A return false; 6259243SN/A } else { 6269831SN/A addToReadQueue(pkt, dram_pkt_count); 6279243SN/A readReqs++; 6289977SN/A bytesReadSys += size; 6299243SN/A } 6309243SN/A } else if (pkt->isWrite()) { 6319567SN/A assert(size != 0); 6329831SN/A if (writeQueueFull(dram_pkt_count)) { 6339567SN/A DPRINTF(DRAM, "Write queue full, not accepting\n"); 6349243SN/A // remember that we have to retry this port 6359243SN/A retryWrReq = true; 6369243SN/A numWrRetry++; 6379243SN/A return false; 6389243SN/A } else { 6399831SN/A addToWriteQueue(pkt, dram_pkt_count); 6409243SN/A writeReqs++; 6419977SN/A bytesWrittenSys += size; 6429243SN/A } 6439243SN/A } else { 6449243SN/A DPRINTF(DRAM,"Neither read nor write, ignore timing\n"); 6459243SN/A neitherReadNorWrite++; 6469726SN/A accessAndRespond(pkt, 1); 6479243SN/A } 6489243SN/A 6499243SN/A return true; 6509243SN/A} 6519243SN/A 6529243SN/Avoid 65310146Sandreas.hansson@arm.comDRAMCtrl::processRespondEvent() 6549243SN/A{ 6559243SN/A DPRINTF(DRAM, 6569243SN/A "processRespondEvent(): Some req has reached its readyTime\n"); 6579243SN/A 6589831SN/A DRAMPacket* dram_pkt = respQueue.front(); 6599243SN/A 6609831SN/A if (dram_pkt->burstHelper) { 6619831SN/A // it is a split packet 6629831SN/A dram_pkt->burstHelper->burstsServiced++; 6639831SN/A if (dram_pkt->burstHelper->burstsServiced == 66410143SN/A dram_pkt->burstHelper->burstCount) { 6659831SN/A // we have now serviced all children packets of a system packet 6669831SN/A // so we can now respond to the requester 6679831SN/A // @todo we probably want to have a different front end and back 6689831SN/A // end latency for split packets 6699831SN/A accessAndRespond(dram_pkt->pkt, frontendLatency + backendLatency); 6709831SN/A delete dram_pkt->burstHelper; 6719831SN/A dram_pkt->burstHelper = NULL; 6729831SN/A } 6739831SN/A } else { 6749831SN/A // it is not a split packet 6759831SN/A accessAndRespond(dram_pkt->pkt, frontendLatency + backendLatency); 6769831SN/A } 6779243SN/A 6789831SN/A delete respQueue.front(); 6799831SN/A respQueue.pop_front(); 6809243SN/A 6819831SN/A if (!respQueue.empty()) { 6829831SN/A assert(respQueue.front()->readyTime >= curTick()); 6839831SN/A assert(!respondEvent.scheduled()); 6849831SN/A schedule(respondEvent, respQueue.front()->readyTime); 6859831SN/A } else { 6869831SN/A // if there is nothing left in any queue, signal a drain 68710913Sandreas.sandberg@arm.com if (drainState() == DrainState::Draining && 68810913Sandreas.sandberg@arm.com writeQueue.empty() && readQueue.empty()) { 68910913Sandreas.sandberg@arm.com 69010509SAli.Saidi@ARM.com DPRINTF(Drain, "DRAM controller done draining\n"); 69110913Sandreas.sandberg@arm.com signalDrainDone(); 6929831SN/A } 6939831SN/A } 6949567SN/A 6959831SN/A // We have made a location in the queue available at this point, 6969831SN/A // so if there is a read that was forced to wait, retry now 6979831SN/A if (retryRdReq) { 6989831SN/A retryRdReq = false; 69910713Sandreas.hansson@arm.com port.sendRetryReq(); 7009831SN/A } 7019243SN/A} 7029243SN/A 70310618SOmar.Naji@arm.combool 70410890Swendy.elsasser@arm.comDRAMCtrl::chooseNext(std::deque<DRAMPacket*>& queue, Tick extra_col_delay) 7059243SN/A{ 70610206Sandreas.hansson@arm.com // This method does the arbitration between requests. The chosen 70710206Sandreas.hansson@arm.com // packet is simply moved to the head of the queue. The other 70810206Sandreas.hansson@arm.com // methods know that this is the place to look. For example, with 70910206Sandreas.hansson@arm.com // FCFS, this method does nothing 71010206Sandreas.hansson@arm.com assert(!queue.empty()); 7119243SN/A 71210618SOmar.Naji@arm.com // bool to indicate if a packet to an available rank is found 71310618SOmar.Naji@arm.com bool found_packet = false; 71410206Sandreas.hansson@arm.com if (queue.size() == 1) { 71510618SOmar.Naji@arm.com DRAMPacket* dram_pkt = queue.front(); 71610618SOmar.Naji@arm.com // available rank corresponds to state refresh idle 71710618SOmar.Naji@arm.com if (ranks[dram_pkt->rank]->isAvailable()) { 71810618SOmar.Naji@arm.com found_packet = true; 71910618SOmar.Naji@arm.com DPRINTF(DRAM, "Single request, going to a free rank\n"); 72010618SOmar.Naji@arm.com } else { 72110618SOmar.Naji@arm.com DPRINTF(DRAM, "Single request, going to a busy rank\n"); 72210618SOmar.Naji@arm.com } 72310618SOmar.Naji@arm.com return found_packet; 7249243SN/A } 7259243SN/A 7269243SN/A if (memSchedPolicy == Enums::fcfs) { 72710618SOmar.Naji@arm.com // check if there is a packet going to a free rank 72810618SOmar.Naji@arm.com for(auto i = queue.begin(); i != queue.end() ; ++i) { 72910618SOmar.Naji@arm.com DRAMPacket* dram_pkt = *i; 73010618SOmar.Naji@arm.com if (ranks[dram_pkt->rank]->isAvailable()) { 73110618SOmar.Naji@arm.com queue.erase(i); 73210618SOmar.Naji@arm.com queue.push_front(dram_pkt); 73310618SOmar.Naji@arm.com found_packet = true; 73410618SOmar.Naji@arm.com break; 73510618SOmar.Naji@arm.com } 73610618SOmar.Naji@arm.com } 7379243SN/A } else if (memSchedPolicy == Enums::frfcfs) { 73810890Swendy.elsasser@arm.com found_packet = reorderQueue(queue, extra_col_delay); 7399243SN/A } else 7409243SN/A panic("No scheduling policy chosen\n"); 74110618SOmar.Naji@arm.com return found_packet; 7429243SN/A} 7439243SN/A 74410618SOmar.Naji@arm.combool 74510890Swendy.elsasser@arm.comDRAMCtrl::reorderQueue(std::deque<DRAMPacket*>& queue, Tick extra_col_delay) 7469974SN/A{ 74710890Swendy.elsasser@arm.com // Only determine this if needed 7489974SN/A uint64_t earliest_banks = 0; 74910890Swendy.elsasser@arm.com bool hidden_bank_prep = false; 7509974SN/A 75110890Swendy.elsasser@arm.com // search for seamless row hits first, if no seamless row hit is 75210890Swendy.elsasser@arm.com // found then determine if there are other packets that can be issued 75310890Swendy.elsasser@arm.com // without incurring additional bus delay due to bank timing 75410890Swendy.elsasser@arm.com // Will select closed rows first to enable more open row possibilies 75510890Swendy.elsasser@arm.com // in future selections 75610890Swendy.elsasser@arm.com bool found_hidden_bank = false; 75710890Swendy.elsasser@arm.com 75810890Swendy.elsasser@arm.com // remember if we found a row hit, not seamless, but bank prepped 75910890Swendy.elsasser@arm.com // and ready 76010890Swendy.elsasser@arm.com bool found_prepped_pkt = false; 76110890Swendy.elsasser@arm.com 76210890Swendy.elsasser@arm.com // if we have no row hit, prepped or not, and no seamless packet, 76310890Swendy.elsasser@arm.com // just go for the earliest possible 7649974SN/A bool found_earliest_pkt = false; 76510890Swendy.elsasser@arm.com 76610618SOmar.Naji@arm.com auto selected_pkt_it = queue.end(); 7679974SN/A 76810890Swendy.elsasser@arm.com // time we need to issue a column command to be seamless 76910890Swendy.elsasser@arm.com const Tick min_col_at = std::max(busBusyUntil - tCL + extra_col_delay, 77010890Swendy.elsasser@arm.com curTick()); 77110890Swendy.elsasser@arm.com 7729974SN/A for (auto i = queue.begin(); i != queue.end() ; ++i) { 7739974SN/A DRAMPacket* dram_pkt = *i; 7749974SN/A const Bank& bank = dram_pkt->bankRef; 77510890Swendy.elsasser@arm.com 77610890Swendy.elsasser@arm.com // check if rank is available, if not, jump to the next packet 77710618SOmar.Naji@arm.com if (dram_pkt->rankRef.isAvailable()) { 77810890Swendy.elsasser@arm.com // check if it is a row hit 77910618SOmar.Naji@arm.com if (bank.openRow == dram_pkt->row) { 78010890Swendy.elsasser@arm.com // no additional rank-to-rank or same bank-group 78110890Swendy.elsasser@arm.com // delays, or we switched read/write and might as well 78210890Swendy.elsasser@arm.com // go for the row hit 78310890Swendy.elsasser@arm.com if (bank.colAllowedAt <= min_col_at) { 78410890Swendy.elsasser@arm.com // FCFS within the hits, giving priority to 78510890Swendy.elsasser@arm.com // commands that can issue seamlessly, without 78610890Swendy.elsasser@arm.com // additional delay, such as same rank accesses 78710890Swendy.elsasser@arm.com // and/or different bank-group accesses 78810890Swendy.elsasser@arm.com DPRINTF(DRAM, "Seamless row buffer hit\n"); 78910618SOmar.Naji@arm.com selected_pkt_it = i; 79010890Swendy.elsasser@arm.com // no need to look through the remaining queue entries 79110618SOmar.Naji@arm.com break; 79210890Swendy.elsasser@arm.com } else if (!found_hidden_bank && !found_prepped_pkt) { 79310890Swendy.elsasser@arm.com // if we did not find a packet to a closed row that can 79410890Swendy.elsasser@arm.com // issue the bank commands without incurring delay, and 79510890Swendy.elsasser@arm.com // did not yet find a packet to a prepped row, remember 79610890Swendy.elsasser@arm.com // the current one 79710618SOmar.Naji@arm.com selected_pkt_it = i; 79810890Swendy.elsasser@arm.com found_prepped_pkt = true; 79910890Swendy.elsasser@arm.com DPRINTF(DRAM, "Prepped row buffer hit\n"); 80010618SOmar.Naji@arm.com } 80110890Swendy.elsasser@arm.com } else if (!found_earliest_pkt) { 80210890Swendy.elsasser@arm.com // if we have not initialised the bank status, do it 80310890Swendy.elsasser@arm.com // now, and only once per scheduling decisions 80410890Swendy.elsasser@arm.com if (earliest_banks == 0) { 80510890Swendy.elsasser@arm.com // determine entries with earliest bank delay 80610890Swendy.elsasser@arm.com pair<uint64_t, bool> bankStatus = 80710890Swendy.elsasser@arm.com minBankPrep(queue, min_col_at); 80810890Swendy.elsasser@arm.com earliest_banks = bankStatus.first; 80910890Swendy.elsasser@arm.com hidden_bank_prep = bankStatus.second; 81010890Swendy.elsasser@arm.com } 81110211Sandreas.hansson@arm.com 81210890Swendy.elsasser@arm.com // bank is amongst first available banks 81310890Swendy.elsasser@arm.com // minBankPrep will give priority to packets that can 81410890Swendy.elsasser@arm.com // issue seamlessly 81510890Swendy.elsasser@arm.com if (bits(earliest_banks, dram_pkt->bankId, dram_pkt->bankId)) { 81610618SOmar.Naji@arm.com found_earliest_pkt = true; 81710890Swendy.elsasser@arm.com found_hidden_bank = hidden_bank_prep; 81810890Swendy.elsasser@arm.com 81910890Swendy.elsasser@arm.com // give priority to packets that can issue 82010890Swendy.elsasser@arm.com // bank commands 'behind the scenes' 82110890Swendy.elsasser@arm.com // any additional delay if any will be due to 82210890Swendy.elsasser@arm.com // col-to-col command requirements 82310890Swendy.elsasser@arm.com if (hidden_bank_prep || !found_prepped_pkt) 82410890Swendy.elsasser@arm.com selected_pkt_it = i; 82510618SOmar.Naji@arm.com } 8269974SN/A } 8279974SN/A } 8289974SN/A } 8299974SN/A 83010618SOmar.Naji@arm.com if (selected_pkt_it != queue.end()) { 83110618SOmar.Naji@arm.com DRAMPacket* selected_pkt = *selected_pkt_it; 83210618SOmar.Naji@arm.com queue.erase(selected_pkt_it); 83310618SOmar.Naji@arm.com queue.push_front(selected_pkt); 83410890Swendy.elsasser@arm.com return true; 83510618SOmar.Naji@arm.com } 83610890Swendy.elsasser@arm.com 83710890Swendy.elsasser@arm.com return false; 8389974SN/A} 8399974SN/A 8409974SN/Avoid 84110146Sandreas.hansson@arm.comDRAMCtrl::accessAndRespond(PacketPtr pkt, Tick static_latency) 8429243SN/A{ 8439243SN/A DPRINTF(DRAM, "Responding to Address %lld.. ",pkt->getAddr()); 8449243SN/A 8459243SN/A bool needsResponse = pkt->needsResponse(); 8469243SN/A // do the actual memory access which also turns the packet into a 8479243SN/A // response 8489243SN/A access(pkt); 8499243SN/A 8509243SN/A // turn packet around to go back to requester if response expected 8519243SN/A if (needsResponse) { 8529243SN/A // access already turned the packet into a response 8539243SN/A assert(pkt->isResponse()); 85410721SMarco.Balboni@ARM.com // response_time consumes the static latency and is charged also 85510721SMarco.Balboni@ARM.com // with headerDelay that takes into account the delay provided by 85610721SMarco.Balboni@ARM.com // the xbar and also the payloadDelay that takes into account the 85710721SMarco.Balboni@ARM.com // number of data beats. 85810721SMarco.Balboni@ARM.com Tick response_time = curTick() + static_latency + pkt->headerDelay + 85910721SMarco.Balboni@ARM.com pkt->payloadDelay; 86010721SMarco.Balboni@ARM.com // Here we reset the timing of the packet before sending it out. 86110694SMarco.Balboni@ARM.com pkt->headerDelay = pkt->payloadDelay = 0; 8629549SN/A 8639726SN/A // queue the packet in the response queue to be sent out after 8649726SN/A // the static latency has passed 86510721SMarco.Balboni@ARM.com port.schedTimingResp(pkt, response_time); 8669243SN/A } else { 8679587SN/A // @todo the packet is going to be deleted, and the DRAMPacket 8689587SN/A // is still having a pointer to it 86911190Sandreas.hansson@arm.com pendingDelete.reset(pkt); 8709243SN/A } 8719243SN/A 8729243SN/A DPRINTF(DRAM, "Done\n"); 8739243SN/A 8749243SN/A return; 8759243SN/A} 8769243SN/A 8779243SN/Avoid 87810618SOmar.Naji@arm.comDRAMCtrl::activateBank(Rank& rank_ref, Bank& bank_ref, 87910618SOmar.Naji@arm.com Tick act_tick, uint32_t row) 8809488SN/A{ 88110618SOmar.Naji@arm.com assert(rank_ref.actTicks.size() == activationLimit); 8829488SN/A 8839488SN/A DPRINTF(DRAM, "Activate at tick %d\n", act_tick); 8849488SN/A 88510207Sandreas.hansson@arm.com // update the open row 88610618SOmar.Naji@arm.com assert(bank_ref.openRow == Bank::NO_ROW); 88710618SOmar.Naji@arm.com bank_ref.openRow = row; 88810207Sandreas.hansson@arm.com 88910207Sandreas.hansson@arm.com // start counting anew, this covers both the case when we 89010207Sandreas.hansson@arm.com // auto-precharged, and when this access is forced to 89110207Sandreas.hansson@arm.com // precharge 89210618SOmar.Naji@arm.com bank_ref.bytesAccessed = 0; 89310618SOmar.Naji@arm.com bank_ref.rowAccesses = 0; 89410207Sandreas.hansson@arm.com 89510618SOmar.Naji@arm.com ++rank_ref.numBanksActive; 89610618SOmar.Naji@arm.com assert(rank_ref.numBanksActive <= banksPerRank); 89710207Sandreas.hansson@arm.com 89810247Sandreas.hansson@arm.com DPRINTF(DRAM, "Activate bank %d, rank %d at tick %lld, now got %d active\n", 89910618SOmar.Naji@arm.com bank_ref.bank, rank_ref.rank, act_tick, 90010618SOmar.Naji@arm.com ranks[rank_ref.rank]->numBanksActive); 90110247Sandreas.hansson@arm.com 90210618SOmar.Naji@arm.com rank_ref.power.powerlib.doCommand(MemCommand::ACT, bank_ref.bank, 90310618SOmar.Naji@arm.com divCeil(act_tick, tCK) - 90410618SOmar.Naji@arm.com timeStampOffset); 90510432SOmar.Naji@arm.com 90610432SOmar.Naji@arm.com DPRINTF(DRAMPower, "%llu,ACT,%d,%d\n", divCeil(act_tick, tCK) - 90710618SOmar.Naji@arm.com timeStampOffset, bank_ref.bank, rank_ref.rank); 9089975SN/A 90910211Sandreas.hansson@arm.com // The next access has to respect tRAS for this bank 91010618SOmar.Naji@arm.com bank_ref.preAllowedAt = act_tick + tRAS; 91110211Sandreas.hansson@arm.com 91210211Sandreas.hansson@arm.com // Respect the row-to-column command delay 91310618SOmar.Naji@arm.com bank_ref.colAllowedAt = std::max(act_tick + tRCD, bank_ref.colAllowedAt); 91410211Sandreas.hansson@arm.com 9159971SN/A // start by enforcing tRRD 9169971SN/A for(int i = 0; i < banksPerRank; i++) { 91710210Sandreas.hansson@arm.com // next activate to any bank in this rank must not happen 91810210Sandreas.hansson@arm.com // before tRRD 91910618SOmar.Naji@arm.com if (bankGroupArch && (bank_ref.bankgr == rank_ref.banks[i].bankgr)) { 92010394Swendy.elsasser@arm.com // bank group architecture requires longer delays between 92110394Swendy.elsasser@arm.com // ACT commands within the same bank group. Use tRRD_L 92210394Swendy.elsasser@arm.com // in this case 92310618SOmar.Naji@arm.com rank_ref.banks[i].actAllowedAt = std::max(act_tick + tRRD_L, 92410618SOmar.Naji@arm.com rank_ref.banks[i].actAllowedAt); 92510394Swendy.elsasser@arm.com } else { 92610394Swendy.elsasser@arm.com // use shorter tRRD value when either 92710394Swendy.elsasser@arm.com // 1) bank group architecture is not supportted 92810394Swendy.elsasser@arm.com // 2) bank is in a different bank group 92910618SOmar.Naji@arm.com rank_ref.banks[i].actAllowedAt = std::max(act_tick + tRRD, 93010618SOmar.Naji@arm.com rank_ref.banks[i].actAllowedAt); 93110394Swendy.elsasser@arm.com } 9329971SN/A } 93310208Sandreas.hansson@arm.com 9349971SN/A // next, we deal with tXAW, if the activation limit is disabled 93510492SOmar.Naji@arm.com // then we directly schedule an activate power event 93610618SOmar.Naji@arm.com if (!rank_ref.actTicks.empty()) { 93710492SOmar.Naji@arm.com // sanity check 93810618SOmar.Naji@arm.com if (rank_ref.actTicks.back() && 93910618SOmar.Naji@arm.com (act_tick - rank_ref.actTicks.back()) < tXAW) { 94010492SOmar.Naji@arm.com panic("Got %d activates in window %d (%llu - %llu) which " 94110492SOmar.Naji@arm.com "is smaller than %llu\n", activationLimit, act_tick - 94210618SOmar.Naji@arm.com rank_ref.actTicks.back(), act_tick, 94310618SOmar.Naji@arm.com rank_ref.actTicks.back(), tXAW); 94410492SOmar.Naji@arm.com } 9459824SN/A 94610492SOmar.Naji@arm.com // shift the times used for the book keeping, the last element 94710492SOmar.Naji@arm.com // (highest index) is the oldest one and hence the lowest value 94810618SOmar.Naji@arm.com rank_ref.actTicks.pop_back(); 9499488SN/A 95010492SOmar.Naji@arm.com // record an new activation (in the future) 95110618SOmar.Naji@arm.com rank_ref.actTicks.push_front(act_tick); 9529488SN/A 95310492SOmar.Naji@arm.com // cannot activate more than X times in time window tXAW, push the 95410492SOmar.Naji@arm.com // next one (the X + 1'st activate) to be tXAW away from the 95510492SOmar.Naji@arm.com // oldest in our window of X 95610618SOmar.Naji@arm.com if (rank_ref.actTicks.back() && 95710618SOmar.Naji@arm.com (act_tick - rank_ref.actTicks.back()) < tXAW) { 95810492SOmar.Naji@arm.com DPRINTF(DRAM, "Enforcing tXAW with X = %d, next activate " 95910492SOmar.Naji@arm.com "no earlier than %llu\n", activationLimit, 96010618SOmar.Naji@arm.com rank_ref.actTicks.back() + tXAW); 9619488SN/A for(int j = 0; j < banksPerRank; j++) 9629488SN/A // next activate must not happen before end of window 96310618SOmar.Naji@arm.com rank_ref.banks[j].actAllowedAt = 96410618SOmar.Naji@arm.com std::max(rank_ref.actTicks.back() + tXAW, 96510618SOmar.Naji@arm.com rank_ref.banks[j].actAllowedAt); 96610492SOmar.Naji@arm.com } 9679488SN/A } 96810208Sandreas.hansson@arm.com 96910208Sandreas.hansson@arm.com // at the point when this activate takes place, make sure we 97010208Sandreas.hansson@arm.com // transition to the active power state 97110618SOmar.Naji@arm.com if (!rank_ref.activateEvent.scheduled()) 97210618SOmar.Naji@arm.com schedule(rank_ref.activateEvent, act_tick); 97310618SOmar.Naji@arm.com else if (rank_ref.activateEvent.when() > act_tick) 97410208Sandreas.hansson@arm.com // move it sooner in time 97510618SOmar.Naji@arm.com reschedule(rank_ref.activateEvent, act_tick); 97610208Sandreas.hansson@arm.com} 97710208Sandreas.hansson@arm.com 97810208Sandreas.hansson@arm.comvoid 97910618SOmar.Naji@arm.comDRAMCtrl::prechargeBank(Rank& rank_ref, 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 99710618SOmar.Naji@arm.com assert(rank_ref.numBanksActive != 0); 99810618SOmar.Naji@arm.com --rank_ref.numBanksActive; 99910207Sandreas.hansson@arm.com 100010247Sandreas.hansson@arm.com DPRINTF(DRAM, "Precharging bank %d, rank %d at tick %lld, now got " 100110618SOmar.Naji@arm.com "%d active\n", bank.bank, rank_ref.rank, pre_at, 100210618SOmar.Naji@arm.com rank_ref.numBanksActive); 100310247Sandreas.hansson@arm.com 100410432SOmar.Naji@arm.com if (trace) { 100510207Sandreas.hansson@arm.com 100610618SOmar.Naji@arm.com rank_ref.power.powerlib.doCommand(MemCommand::PRE, bank.bank, 100710432SOmar.Naji@arm.com divCeil(pre_at, tCK) - 100810432SOmar.Naji@arm.com timeStampOffset); 100910432SOmar.Naji@arm.com DPRINTF(DRAMPower, "%llu,PRE,%d,%d\n", divCeil(pre_at, tCK) - 101010618SOmar.Naji@arm.com timeStampOffset, bank.bank, rank_ref.rank); 101110432SOmar.Naji@arm.com } 101210208Sandreas.hansson@arm.com // if we look at the current number of active banks we might be 101310208Sandreas.hansson@arm.com // tempted to think the DRAM is now idle, however this can be 101410208Sandreas.hansson@arm.com // undone by an activate that is scheduled to happen before we 101510208Sandreas.hansson@arm.com // would have reached the idle state, so schedule an event and 101610208Sandreas.hansson@arm.com // rather check once we actually make it to the point in time when 101710208Sandreas.hansson@arm.com // the (last) precharge takes place 101810618SOmar.Naji@arm.com if (!rank_ref.prechargeEvent.scheduled()) 101910618SOmar.Naji@arm.com schedule(rank_ref.prechargeEvent, pre_done_at); 102010618SOmar.Naji@arm.com else if (rank_ref.prechargeEvent.when() < pre_done_at) 102110618SOmar.Naji@arm.com reschedule(rank_ref.prechargeEvent, pre_done_at); 102210207Sandreas.hansson@arm.com} 102310207Sandreas.hansson@arm.com 102410207Sandreas.hansson@arm.comvoid 102510146Sandreas.hansson@arm.comDRAMCtrl::doDRAMAccess(DRAMPacket* dram_pkt) 10269243SN/A{ 10279243SN/A DPRINTF(DRAM, "Timing access to addr %lld, rank/bank/row %d %d %d\n", 10289243SN/A dram_pkt->addr, dram_pkt->rank, dram_pkt->bank, dram_pkt->row); 10299243SN/A 103010618SOmar.Naji@arm.com // get the rank 103110618SOmar.Naji@arm.com Rank& rank = dram_pkt->rankRef; 103210618SOmar.Naji@arm.com 103310211Sandreas.hansson@arm.com // get the bank 10349967SN/A Bank& bank = dram_pkt->bankRef; 10359243SN/A 103610211Sandreas.hansson@arm.com // for the state we need to track if it is a row hit or not 103710211Sandreas.hansson@arm.com bool row_hit = true; 103810211Sandreas.hansson@arm.com 103910211Sandreas.hansson@arm.com // respect any constraints on the command (e.g. tRCD or tCCD) 104010211Sandreas.hansson@arm.com Tick cmd_at = std::max(bank.colAllowedAt, curTick()); 104110211Sandreas.hansson@arm.com 104210211Sandreas.hansson@arm.com // Determine the access latency and update the bank state 104310211Sandreas.hansson@arm.com if (bank.openRow == dram_pkt->row) { 104410211Sandreas.hansson@arm.com // nothing to do 104510209Sandreas.hansson@arm.com } else { 104610211Sandreas.hansson@arm.com row_hit = false; 104710211Sandreas.hansson@arm.com 104810209Sandreas.hansson@arm.com // If there is a page open, precharge it. 104910209Sandreas.hansson@arm.com if (bank.openRow != Bank::NO_ROW) { 105010618SOmar.Naji@arm.com prechargeBank(rank, bank, std::max(bank.preAllowedAt, curTick())); 10519488SN/A } 10529973SN/A 105310211Sandreas.hansson@arm.com // next we need to account for the delay in activating the 105410211Sandreas.hansson@arm.com // page 105510211Sandreas.hansson@arm.com Tick act_tick = std::max(bank.actAllowedAt, curTick()); 10569973SN/A 105710210Sandreas.hansson@arm.com // Record the activation and deal with all the global timing 105810210Sandreas.hansson@arm.com // constraints caused be a new activation (tRRD and tXAW) 105910618SOmar.Naji@arm.com activateBank(rank, bank, act_tick, dram_pkt->row); 106010210Sandreas.hansson@arm.com 106110211Sandreas.hansson@arm.com // issue the command as early as possible 106210211Sandreas.hansson@arm.com cmd_at = bank.colAllowedAt; 106310209Sandreas.hansson@arm.com } 106410209Sandreas.hansson@arm.com 106510211Sandreas.hansson@arm.com // we need to wait until the bus is available before we can issue 106610211Sandreas.hansson@arm.com // the command 106710211Sandreas.hansson@arm.com cmd_at = std::max(cmd_at, busBusyUntil - tCL); 106810211Sandreas.hansson@arm.com 106910211Sandreas.hansson@arm.com // update the packet ready time 107010211Sandreas.hansson@arm.com dram_pkt->readyTime = cmd_at + tCL + tBURST; 107110211Sandreas.hansson@arm.com 107210211Sandreas.hansson@arm.com // only one burst can use the bus at any one point in time 107310211Sandreas.hansson@arm.com assert(dram_pkt->readyTime - busBusyUntil >= tBURST); 107410211Sandreas.hansson@arm.com 107510394Swendy.elsasser@arm.com // update the time for the next read/write burst for each 107610394Swendy.elsasser@arm.com // bank (add a max with tCCD/tCCD_L here) 107710394Swendy.elsasser@arm.com Tick cmd_dly; 107810394Swendy.elsasser@arm.com for(int j = 0; j < ranksPerChannel; j++) { 107910394Swendy.elsasser@arm.com for(int i = 0; i < banksPerRank; i++) { 108010394Swendy.elsasser@arm.com // next burst to same bank group in this rank must not happen 108110394Swendy.elsasser@arm.com // before tCCD_L. Different bank group timing requirement is 108210394Swendy.elsasser@arm.com // tBURST; Add tCS for different ranks 108310394Swendy.elsasser@arm.com if (dram_pkt->rank == j) { 108410618SOmar.Naji@arm.com if (bankGroupArch && 108510618SOmar.Naji@arm.com (bank.bankgr == ranks[j]->banks[i].bankgr)) { 108610394Swendy.elsasser@arm.com // bank group architecture requires longer delays between 108710394Swendy.elsasser@arm.com // RD/WR burst commands to the same bank group. 108810394Swendy.elsasser@arm.com // Use tCCD_L in this case 108910394Swendy.elsasser@arm.com cmd_dly = tCCD_L; 109010394Swendy.elsasser@arm.com } else { 109110394Swendy.elsasser@arm.com // use tBURST (equivalent to tCCD_S), the shorter 109210394Swendy.elsasser@arm.com // cas-to-cas delay value, when either: 109310394Swendy.elsasser@arm.com // 1) bank group architecture is not supportted 109410394Swendy.elsasser@arm.com // 2) bank is in a different bank group 109510394Swendy.elsasser@arm.com cmd_dly = tBURST; 109610394Swendy.elsasser@arm.com } 109710394Swendy.elsasser@arm.com } else { 109810394Swendy.elsasser@arm.com // different rank is by default in a different bank group 109910394Swendy.elsasser@arm.com // use tBURST (equivalent to tCCD_S), which is the shorter 110010394Swendy.elsasser@arm.com // cas-to-cas delay in this case 110110394Swendy.elsasser@arm.com // Add tCS to account for rank-to-rank bus delay requirements 110210394Swendy.elsasser@arm.com cmd_dly = tBURST + tCS; 110310394Swendy.elsasser@arm.com } 110410618SOmar.Naji@arm.com ranks[j]->banks[i].colAllowedAt = std::max(cmd_at + cmd_dly, 110510618SOmar.Naji@arm.com ranks[j]->banks[i].colAllowedAt); 110610394Swendy.elsasser@arm.com } 110710394Swendy.elsasser@arm.com } 110810211Sandreas.hansson@arm.com 110910393Swendy.elsasser@arm.com // Save rank of current access 111010393Swendy.elsasser@arm.com activeRank = dram_pkt->rank; 111110393Swendy.elsasser@arm.com 111210212Sandreas.hansson@arm.com // If this is a write, we also need to respect the write recovery 111310212Sandreas.hansson@arm.com // time before a precharge, in the case of a read, respect the 111410212Sandreas.hansson@arm.com // read to precharge constraint 111510212Sandreas.hansson@arm.com bank.preAllowedAt = std::max(bank.preAllowedAt, 111610212Sandreas.hansson@arm.com dram_pkt->isRead ? cmd_at + tRTP : 111710212Sandreas.hansson@arm.com dram_pkt->readyTime + tWR); 111810210Sandreas.hansson@arm.com 111910209Sandreas.hansson@arm.com // increment the bytes accessed and the accesses per row 112010209Sandreas.hansson@arm.com bank.bytesAccessed += burstSize; 112110209Sandreas.hansson@arm.com ++bank.rowAccesses; 112210209Sandreas.hansson@arm.com 112310209Sandreas.hansson@arm.com // if we reached the max, then issue with an auto-precharge 112410209Sandreas.hansson@arm.com bool auto_precharge = pageMgmt == Enums::close || 112510209Sandreas.hansson@arm.com bank.rowAccesses == maxAccessesPerRow; 112610209Sandreas.hansson@arm.com 112710209Sandreas.hansson@arm.com // if we did not hit the limit, we might still want to 112810209Sandreas.hansson@arm.com // auto-precharge 112910209Sandreas.hansson@arm.com if (!auto_precharge && 113010209Sandreas.hansson@arm.com (pageMgmt == Enums::open_adaptive || 113110209Sandreas.hansson@arm.com pageMgmt == Enums::close_adaptive)) { 113210209Sandreas.hansson@arm.com // a twist on the open and close page policies: 113310209Sandreas.hansson@arm.com // 1) open_adaptive page policy does not blindly keep the 113410209Sandreas.hansson@arm.com // page open, but close it if there are no row hits, and there 113510209Sandreas.hansson@arm.com // are bank conflicts in the queue 113610209Sandreas.hansson@arm.com // 2) close_adaptive page policy does not blindly close the 113710209Sandreas.hansson@arm.com // page, but closes it only if there are no row hits in the queue. 113810209Sandreas.hansson@arm.com // In this case, only force an auto precharge when there 113910209Sandreas.hansson@arm.com // are no same page hits in the queue 114010209Sandreas.hansson@arm.com bool got_more_hits = false; 114110209Sandreas.hansson@arm.com bool got_bank_conflict = false; 114210209Sandreas.hansson@arm.com 114310209Sandreas.hansson@arm.com // either look at the read queue or write queue 114410209Sandreas.hansson@arm.com const deque<DRAMPacket*>& queue = dram_pkt->isRead ? readQueue : 114510209Sandreas.hansson@arm.com writeQueue; 114610209Sandreas.hansson@arm.com auto p = queue.begin(); 114710209Sandreas.hansson@arm.com // make sure we are not considering the packet that we are 114810209Sandreas.hansson@arm.com // currently dealing with (which is the head of the queue) 114910209Sandreas.hansson@arm.com ++p; 115010209Sandreas.hansson@arm.com 115110809Srb639@drexel.edu // keep on looking until we find a hit or reach the end of the queue 115210809Srb639@drexel.edu // 1) if a hit is found, then both open and close adaptive policies keep 115310809Srb639@drexel.edu // the page open 115410809Srb639@drexel.edu // 2) if no hit is found, got_bank_conflict is set to true if a bank 115510809Srb639@drexel.edu // conflict request is waiting in the queue 115610809Srb639@drexel.edu while (!got_more_hits && p != queue.end()) { 115710209Sandreas.hansson@arm.com bool same_rank_bank = (dram_pkt->rank == (*p)->rank) && 115810209Sandreas.hansson@arm.com (dram_pkt->bank == (*p)->bank); 115910209Sandreas.hansson@arm.com bool same_row = dram_pkt->row == (*p)->row; 116010209Sandreas.hansson@arm.com got_more_hits |= same_rank_bank && same_row; 116110209Sandreas.hansson@arm.com got_bank_conflict |= same_rank_bank && !same_row; 11629973SN/A ++p; 116310141SN/A } 116410141SN/A 116510209Sandreas.hansson@arm.com // auto pre-charge when either 116610209Sandreas.hansson@arm.com // 1) open_adaptive policy, we have not got any more hits, and 116710209Sandreas.hansson@arm.com // have a bank conflict 116810209Sandreas.hansson@arm.com // 2) close_adaptive policy and we have not got any more hits 116910209Sandreas.hansson@arm.com auto_precharge = !got_more_hits && 117010209Sandreas.hansson@arm.com (got_bank_conflict || pageMgmt == Enums::close_adaptive); 117110209Sandreas.hansson@arm.com } 117210142SN/A 117310247Sandreas.hansson@arm.com // DRAMPower trace command to be written 117410247Sandreas.hansson@arm.com std::string mem_cmd = dram_pkt->isRead ? "RD" : "WR"; 117510247Sandreas.hansson@arm.com 117610432SOmar.Naji@arm.com // MemCommand required for DRAMPower library 117710432SOmar.Naji@arm.com MemCommand::cmds command = (mem_cmd == "RD") ? MemCommand::RD : 117810432SOmar.Naji@arm.com MemCommand::WR; 117910432SOmar.Naji@arm.com 118010209Sandreas.hansson@arm.com // if this access should use auto-precharge, then we are 118110209Sandreas.hansson@arm.com // closing the row 118210209Sandreas.hansson@arm.com if (auto_precharge) { 118310432SOmar.Naji@arm.com // if auto-precharge push a PRE command at the correct tick to the 118410432SOmar.Naji@arm.com // list used by DRAMPower library to calculate power 118510618SOmar.Naji@arm.com prechargeBank(rank, bank, std::max(curTick(), bank.preAllowedAt)); 11869973SN/A 118710209Sandreas.hansson@arm.com DPRINTF(DRAM, "Auto-precharged bank: %d\n", dram_pkt->bankId); 118810209Sandreas.hansson@arm.com } 11899963SN/A 11909243SN/A // Update bus state 11919243SN/A busBusyUntil = dram_pkt->readyTime; 11929243SN/A 119310211Sandreas.hansson@arm.com DPRINTF(DRAM, "Access to %lld, ready at %lld bus busy until %lld.\n", 119410211Sandreas.hansson@arm.com dram_pkt->addr, dram_pkt->readyTime, busBusyUntil); 11959243SN/A 119610618SOmar.Naji@arm.com dram_pkt->rankRef.power.powerlib.doCommand(command, dram_pkt->bank, 119710432SOmar.Naji@arm.com divCeil(cmd_at, tCK) - 119810432SOmar.Naji@arm.com timeStampOffset); 119910432SOmar.Naji@arm.com 120010432SOmar.Naji@arm.com DPRINTF(DRAMPower, "%llu,%s,%d,%d\n", divCeil(cmd_at, tCK) - 120110432SOmar.Naji@arm.com timeStampOffset, mem_cmd, dram_pkt->bank, dram_pkt->rank); 120210247Sandreas.hansson@arm.com 120310206Sandreas.hansson@arm.com // Update the minimum timing between the requests, this is a 120410206Sandreas.hansson@arm.com // conservative estimate of when we have to schedule the next 120510206Sandreas.hansson@arm.com // request to not introduce any unecessary bubbles. In most cases 120610206Sandreas.hansson@arm.com // we will wake up sooner than we have to. 120710206Sandreas.hansson@arm.com nextReqTime = busBusyUntil - (tRP + tRCD + tCL); 12089972SN/A 120910206Sandreas.hansson@arm.com // Update the stats and schedule the next request 12109977SN/A if (dram_pkt->isRead) { 121110147Sandreas.hansson@arm.com ++readsThisTime; 121210211Sandreas.hansson@arm.com if (row_hit) 12139977SN/A readRowHits++; 12149977SN/A bytesReadDRAM += burstSize; 12159977SN/A perBankRdBursts[dram_pkt->bankId]++; 121610206Sandreas.hansson@arm.com 121710206Sandreas.hansson@arm.com // Update latency stats 121810206Sandreas.hansson@arm.com totMemAccLat += dram_pkt->readyTime - dram_pkt->entryTime; 121910206Sandreas.hansson@arm.com totBusLat += tBURST; 122010211Sandreas.hansson@arm.com totQLat += cmd_at - dram_pkt->entryTime; 12219977SN/A } else { 122210147Sandreas.hansson@arm.com ++writesThisTime; 122310211Sandreas.hansson@arm.com if (row_hit) 12249977SN/A writeRowHits++; 12259977SN/A bytesWritten += burstSize; 12269977SN/A perBankWrBursts[dram_pkt->bankId]++; 12279243SN/A } 12289243SN/A} 12299243SN/A 12309243SN/Avoid 123110206Sandreas.hansson@arm.comDRAMCtrl::processNextReqEvent() 12329243SN/A{ 123310618SOmar.Naji@arm.com int busyRanks = 0; 123410618SOmar.Naji@arm.com for (auto r : ranks) { 123510618SOmar.Naji@arm.com if (!r->isAvailable()) { 123610618SOmar.Naji@arm.com // rank is busy refreshing 123710618SOmar.Naji@arm.com busyRanks++; 123810618SOmar.Naji@arm.com 123910618SOmar.Naji@arm.com // let the rank know that if it was waiting to drain, it 124010618SOmar.Naji@arm.com // is now done and ready to proceed 124110618SOmar.Naji@arm.com r->checkDrainDone(); 124210618SOmar.Naji@arm.com } 124310618SOmar.Naji@arm.com } 124410618SOmar.Naji@arm.com 124510618SOmar.Naji@arm.com if (busyRanks == ranksPerChannel) { 124610618SOmar.Naji@arm.com // if all ranks are refreshing wait for them to finish 124710618SOmar.Naji@arm.com // and stall this state machine without taking any further 124810618SOmar.Naji@arm.com // action, and do not schedule a new nextReqEvent 124910618SOmar.Naji@arm.com return; 125010618SOmar.Naji@arm.com } 125110618SOmar.Naji@arm.com 125210393Swendy.elsasser@arm.com // pre-emptively set to false. Overwrite if in READ_TO_WRITE 125310393Swendy.elsasser@arm.com // or WRITE_TO_READ state 125410393Swendy.elsasser@arm.com bool switched_cmd_type = false; 125510206Sandreas.hansson@arm.com if (busState == READ_TO_WRITE) { 125610206Sandreas.hansson@arm.com DPRINTF(DRAM, "Switching to writes after %d reads with %d reads " 125710206Sandreas.hansson@arm.com "waiting\n", readsThisTime, readQueue.size()); 12589243SN/A 125910206Sandreas.hansson@arm.com // sample and reset the read-related stats as we are now 126010206Sandreas.hansson@arm.com // transitioning to writes, and all reads are done 126110206Sandreas.hansson@arm.com rdPerTurnAround.sample(readsThisTime); 126210206Sandreas.hansson@arm.com readsThisTime = 0; 126310206Sandreas.hansson@arm.com 126410206Sandreas.hansson@arm.com // now proceed to do the actual writes 126510206Sandreas.hansson@arm.com busState = WRITE; 126610393Swendy.elsasser@arm.com switched_cmd_type = true; 126710206Sandreas.hansson@arm.com } else if (busState == WRITE_TO_READ) { 126810206Sandreas.hansson@arm.com DPRINTF(DRAM, "Switching to reads after %d writes with %d writes " 126910206Sandreas.hansson@arm.com "waiting\n", writesThisTime, writeQueue.size()); 127010206Sandreas.hansson@arm.com 127110206Sandreas.hansson@arm.com wrPerTurnAround.sample(writesThisTime); 127210206Sandreas.hansson@arm.com writesThisTime = 0; 127310206Sandreas.hansson@arm.com 127410206Sandreas.hansson@arm.com busState = READ; 127510393Swendy.elsasser@arm.com switched_cmd_type = true; 127610206Sandreas.hansson@arm.com } 127710206Sandreas.hansson@arm.com 127810206Sandreas.hansson@arm.com // when we get here it is either a read or a write 127910206Sandreas.hansson@arm.com if (busState == READ) { 128010206Sandreas.hansson@arm.com 128110206Sandreas.hansson@arm.com // track if we should switch or not 128210206Sandreas.hansson@arm.com bool switch_to_writes = false; 128310206Sandreas.hansson@arm.com 128410206Sandreas.hansson@arm.com if (readQueue.empty()) { 128510206Sandreas.hansson@arm.com // In the case there is no read request to go next, 128610206Sandreas.hansson@arm.com // trigger writes if we have passed the low threshold (or 128710206Sandreas.hansson@arm.com // if we are draining) 128810206Sandreas.hansson@arm.com if (!writeQueue.empty() && 128910913Sandreas.sandberg@arm.com (drainState() == DrainState::Draining || 129010913Sandreas.sandberg@arm.com writeQueue.size() > writeLowThreshold)) { 129110206Sandreas.hansson@arm.com 129210206Sandreas.hansson@arm.com switch_to_writes = true; 129310206Sandreas.hansson@arm.com } else { 129410206Sandreas.hansson@arm.com // check if we are drained 129510913Sandreas.sandberg@arm.com if (drainState() == DrainState::Draining && 129610913Sandreas.sandberg@arm.com respQueue.empty()) { 129710913Sandreas.sandberg@arm.com 129810509SAli.Saidi@ARM.com DPRINTF(Drain, "DRAM controller done draining\n"); 129910913Sandreas.sandberg@arm.com signalDrainDone(); 130010206Sandreas.hansson@arm.com } 130110206Sandreas.hansson@arm.com 130210206Sandreas.hansson@arm.com // nothing to do, not even any point in scheduling an 130310206Sandreas.hansson@arm.com // event for the next request 130410206Sandreas.hansson@arm.com return; 130510206Sandreas.hansson@arm.com } 130610206Sandreas.hansson@arm.com } else { 130710618SOmar.Naji@arm.com // bool to check if there is a read to a free rank 130810618SOmar.Naji@arm.com bool found_read = false; 130910618SOmar.Naji@arm.com 131010206Sandreas.hansson@arm.com // Figure out which read request goes next, and move it to the 131110206Sandreas.hansson@arm.com // front of the read queue 131210890Swendy.elsasser@arm.com // If we are changing command type, incorporate the minimum 131310890Swendy.elsasser@arm.com // bus turnaround delay which will be tCS (different rank) case 131410890Swendy.elsasser@arm.com found_read = chooseNext(readQueue, 131510890Swendy.elsasser@arm.com switched_cmd_type ? tCS : 0); 131610618SOmar.Naji@arm.com 131710618SOmar.Naji@arm.com // if no read to an available rank is found then return 131810618SOmar.Naji@arm.com // at this point. There could be writes to the available ranks 131910618SOmar.Naji@arm.com // which are above the required threshold. However, to 132010618SOmar.Naji@arm.com // avoid adding more complexity to the code, return and wait 132110618SOmar.Naji@arm.com // for a refresh event to kick things into action again. 132210618SOmar.Naji@arm.com if (!found_read) 132310618SOmar.Naji@arm.com return; 132410206Sandreas.hansson@arm.com 132510215Sandreas.hansson@arm.com DRAMPacket* dram_pkt = readQueue.front(); 132610618SOmar.Naji@arm.com assert(dram_pkt->rankRef.isAvailable()); 132710393Swendy.elsasser@arm.com // here we get a bit creative and shift the bus busy time not 132810393Swendy.elsasser@arm.com // just the tWTR, but also a CAS latency to capture the fact 132910393Swendy.elsasser@arm.com // that we are allowed to prepare a new bank, but not issue a 133010393Swendy.elsasser@arm.com // read command until after tWTR, in essence we capture a 133110393Swendy.elsasser@arm.com // bubble on the data bus that is tWTR + tCL 133210394Swendy.elsasser@arm.com if (switched_cmd_type && dram_pkt->rank == activeRank) { 133310394Swendy.elsasser@arm.com busBusyUntil += tWTR + tCL; 133410393Swendy.elsasser@arm.com } 133510393Swendy.elsasser@arm.com 133610215Sandreas.hansson@arm.com doDRAMAccess(dram_pkt); 133710206Sandreas.hansson@arm.com 133810206Sandreas.hansson@arm.com // At this point we're done dealing with the request 133910215Sandreas.hansson@arm.com readQueue.pop_front(); 134010215Sandreas.hansson@arm.com 134110215Sandreas.hansson@arm.com // sanity check 134210215Sandreas.hansson@arm.com assert(dram_pkt->size <= burstSize); 134310215Sandreas.hansson@arm.com assert(dram_pkt->readyTime >= curTick()); 134410215Sandreas.hansson@arm.com 134510215Sandreas.hansson@arm.com // Insert into response queue. It will be sent back to the 134610215Sandreas.hansson@arm.com // requestor at its readyTime 134710215Sandreas.hansson@arm.com if (respQueue.empty()) { 134810215Sandreas.hansson@arm.com assert(!respondEvent.scheduled()); 134910215Sandreas.hansson@arm.com schedule(respondEvent, dram_pkt->readyTime); 135010215Sandreas.hansson@arm.com } else { 135110215Sandreas.hansson@arm.com assert(respQueue.back()->readyTime <= dram_pkt->readyTime); 135210215Sandreas.hansson@arm.com assert(respondEvent.scheduled()); 135310215Sandreas.hansson@arm.com } 135410215Sandreas.hansson@arm.com 135510215Sandreas.hansson@arm.com respQueue.push_back(dram_pkt); 135610206Sandreas.hansson@arm.com 135710206Sandreas.hansson@arm.com // we have so many writes that we have to transition 135810206Sandreas.hansson@arm.com if (writeQueue.size() > writeHighThreshold) { 135910206Sandreas.hansson@arm.com switch_to_writes = true; 136010206Sandreas.hansson@arm.com } 136110206Sandreas.hansson@arm.com } 136210206Sandreas.hansson@arm.com 136310206Sandreas.hansson@arm.com // switching to writes, either because the read queue is empty 136410206Sandreas.hansson@arm.com // and the writes have passed the low threshold (or we are 136510206Sandreas.hansson@arm.com // draining), or because the writes hit the hight threshold 136610206Sandreas.hansson@arm.com if (switch_to_writes) { 136710206Sandreas.hansson@arm.com // transition to writing 136810206Sandreas.hansson@arm.com busState = READ_TO_WRITE; 136910206Sandreas.hansson@arm.com } 13709352SN/A } else { 137110618SOmar.Naji@arm.com // bool to check if write to free rank is found 137210618SOmar.Naji@arm.com bool found_write = false; 137310618SOmar.Naji@arm.com 137410890Swendy.elsasser@arm.com // If we are changing command type, incorporate the minimum 137510890Swendy.elsasser@arm.com // bus turnaround delay 137610890Swendy.elsasser@arm.com found_write = chooseNext(writeQueue, 137710890Swendy.elsasser@arm.com switched_cmd_type ? std::min(tRTW, tCS) : 0); 137810618SOmar.Naji@arm.com 137910618SOmar.Naji@arm.com // if no writes to an available rank are found then return. 138010618SOmar.Naji@arm.com // There could be reads to the available ranks. However, to avoid 138110618SOmar.Naji@arm.com // adding more complexity to the code, return at this point and wait 138210618SOmar.Naji@arm.com // for a refresh event to kick things into action again. 138310618SOmar.Naji@arm.com if (!found_write) 138410618SOmar.Naji@arm.com return; 138510618SOmar.Naji@arm.com 138610206Sandreas.hansson@arm.com DRAMPacket* dram_pkt = writeQueue.front(); 138710618SOmar.Naji@arm.com assert(dram_pkt->rankRef.isAvailable()); 138810206Sandreas.hansson@arm.com // sanity check 138910206Sandreas.hansson@arm.com assert(dram_pkt->size <= burstSize); 139010393Swendy.elsasser@arm.com 139110394Swendy.elsasser@arm.com // add a bubble to the data bus, as defined by the 139210394Swendy.elsasser@arm.com // tRTW when access is to the same rank as previous burst 139310394Swendy.elsasser@arm.com // Different rank timing is handled with tCS, which is 139410394Swendy.elsasser@arm.com // applied to colAllowedAt 139510394Swendy.elsasser@arm.com if (switched_cmd_type && dram_pkt->rank == activeRank) { 139610394Swendy.elsasser@arm.com busBusyUntil += tRTW; 139710393Swendy.elsasser@arm.com } 139810393Swendy.elsasser@arm.com 139910206Sandreas.hansson@arm.com doDRAMAccess(dram_pkt); 140010206Sandreas.hansson@arm.com 140110206Sandreas.hansson@arm.com writeQueue.pop_front(); 140210889Sandreas.hansson@arm.com isInWriteQueue.erase(burstAlign(dram_pkt->addr)); 140310206Sandreas.hansson@arm.com delete dram_pkt; 140410206Sandreas.hansson@arm.com 140510206Sandreas.hansson@arm.com // If we emptied the write queue, or got sufficiently below the 140610206Sandreas.hansson@arm.com // threshold (using the minWritesPerSwitch as the hysteresis) and 140710206Sandreas.hansson@arm.com // are not draining, or we have reads waiting and have done enough 140810206Sandreas.hansson@arm.com // writes, then switch to reads. 140910206Sandreas.hansson@arm.com if (writeQueue.empty() || 141010206Sandreas.hansson@arm.com (writeQueue.size() + minWritesPerSwitch < writeLowThreshold && 141110913Sandreas.sandberg@arm.com drainState() != DrainState::Draining) || 141210206Sandreas.hansson@arm.com (!readQueue.empty() && writesThisTime >= minWritesPerSwitch)) { 141310206Sandreas.hansson@arm.com // turn the bus back around for reads again 141410206Sandreas.hansson@arm.com busState = WRITE_TO_READ; 141510206Sandreas.hansson@arm.com 141610206Sandreas.hansson@arm.com // note that the we switch back to reads also in the idle 141710206Sandreas.hansson@arm.com // case, which eventually will check for any draining and 141810206Sandreas.hansson@arm.com // also pause any further scheduling if there is really 141910206Sandreas.hansson@arm.com // nothing to do 142010206Sandreas.hansson@arm.com } 142110206Sandreas.hansson@arm.com } 142210618SOmar.Naji@arm.com // It is possible that a refresh to another rank kicks things back into 142310618SOmar.Naji@arm.com // action before reaching this point. 142410618SOmar.Naji@arm.com if (!nextReqEvent.scheduled()) 142510618SOmar.Naji@arm.com schedule(nextReqEvent, std::max(nextReqTime, curTick())); 142610206Sandreas.hansson@arm.com 142710206Sandreas.hansson@arm.com // If there is space available and we have writes waiting then let 142810206Sandreas.hansson@arm.com // them retry. This is done here to ensure that the retry does not 142910206Sandreas.hansson@arm.com // cause a nextReqEvent to be scheduled before we do so as part of 143010206Sandreas.hansson@arm.com // the next request processing 143110206Sandreas.hansson@arm.com if (retryWrReq && writeQueue.size() < writeBufferSize) { 143210206Sandreas.hansson@arm.com retryWrReq = false; 143310713Sandreas.hansson@arm.com port.sendRetryReq(); 14349352SN/A } 14359243SN/A} 14369243SN/A 143710890Swendy.elsasser@arm.compair<uint64_t, bool> 143810393Swendy.elsasser@arm.comDRAMCtrl::minBankPrep(const deque<DRAMPacket*>& queue, 143910890Swendy.elsasser@arm.com Tick min_col_at) const 14409967SN/A{ 14419967SN/A uint64_t bank_mask = 0; 144210211Sandreas.hansson@arm.com Tick min_act_at = MaxTick; 14439967SN/A 144410890Swendy.elsasser@arm.com // latest Tick for which ACT can occur without incurring additoinal 144510890Swendy.elsasser@arm.com // delay on the data bus 144610890Swendy.elsasser@arm.com const Tick hidden_act_max = std::max(min_col_at - tRCD, curTick()); 144710393Swendy.elsasser@arm.com 144810890Swendy.elsasser@arm.com // Flag condition when burst can issue back-to-back with previous burst 144910890Swendy.elsasser@arm.com bool found_seamless_bank = false; 145010890Swendy.elsasser@arm.com 145110890Swendy.elsasser@arm.com // Flag condition when bank can be opened without incurring additional 145210890Swendy.elsasser@arm.com // delay on the data bus 145310890Swendy.elsasser@arm.com bool hidden_bank_prep = false; 145410393Swendy.elsasser@arm.com 145510393Swendy.elsasser@arm.com // determine if we have queued transactions targetting the 14569967SN/A // bank in question 14579967SN/A vector<bool> got_waiting(ranksPerChannel * banksPerRank, false); 145810618SOmar.Naji@arm.com for (const auto& p : queue) { 145910618SOmar.Naji@arm.com if(p->rankRef.isAvailable()) 146010618SOmar.Naji@arm.com got_waiting[p->bankId] = true; 14619967SN/A } 14629967SN/A 146310890Swendy.elsasser@arm.com // Find command with optimal bank timing 146410890Swendy.elsasser@arm.com // Will prioritize commands that can issue seamlessly. 14659967SN/A for (int i = 0; i < ranksPerChannel; i++) { 14669967SN/A for (int j = 0; j < banksPerRank; j++) { 146710618SOmar.Naji@arm.com uint16_t bank_id = i * banksPerRank + j; 146810211Sandreas.hansson@arm.com 14699967SN/A // if we have waiting requests for the bank, and it is 14709967SN/A // amongst the first available, update the mask 147110211Sandreas.hansson@arm.com if (got_waiting[bank_id]) { 147210618SOmar.Naji@arm.com // make sure this rank is not currently refreshing. 147310618SOmar.Naji@arm.com assert(ranks[i]->isAvailable()); 147410211Sandreas.hansson@arm.com // simplistic approximation of when the bank can issue 147510211Sandreas.hansson@arm.com // an activate, ignoring any rank-to-rank switching 147610393Swendy.elsasser@arm.com // cost in this calculation 147710618SOmar.Naji@arm.com Tick act_at = ranks[i]->banks[j].openRow == Bank::NO_ROW ? 147810890Swendy.elsasser@arm.com std::max(ranks[i]->banks[j].actAllowedAt, curTick()) : 147910618SOmar.Naji@arm.com std::max(ranks[i]->banks[j].preAllowedAt, curTick()) + tRP; 148010211Sandreas.hansson@arm.com 148110890Swendy.elsasser@arm.com // When is the earliest the R/W burst can issue? 148210890Swendy.elsasser@arm.com Tick col_at = std::max(ranks[i]->banks[j].colAllowedAt, 148310890Swendy.elsasser@arm.com act_at + tRCD); 148410393Swendy.elsasser@arm.com 148510890Swendy.elsasser@arm.com // bank can issue burst back-to-back (seamlessly) with 148610890Swendy.elsasser@arm.com // previous burst 148710890Swendy.elsasser@arm.com bool new_seamless_bank = col_at <= min_col_at; 148810393Swendy.elsasser@arm.com 148910890Swendy.elsasser@arm.com // if we found a new seamless bank or we have no 149010890Swendy.elsasser@arm.com // seamless banks, and got a bank with an earlier 149110890Swendy.elsasser@arm.com // activate time, it should be added to the bit mask 149210890Swendy.elsasser@arm.com if (new_seamless_bank || 149310890Swendy.elsasser@arm.com (!found_seamless_bank && act_at <= min_act_at)) { 149410890Swendy.elsasser@arm.com // if we did not have a seamless bank before, and 149510890Swendy.elsasser@arm.com // we do now, reset the bank mask, also reset it 149610890Swendy.elsasser@arm.com // if we have not yet found a seamless bank and 149710890Swendy.elsasser@arm.com // the activate time is smaller than what we have 149810890Swendy.elsasser@arm.com // seen so far 149910890Swendy.elsasser@arm.com if (!found_seamless_bank && 150010890Swendy.elsasser@arm.com (new_seamless_bank || act_at < min_act_at)) { 150110890Swendy.elsasser@arm.com bank_mask = 0; 150210393Swendy.elsasser@arm.com } 150310890Swendy.elsasser@arm.com 150410890Swendy.elsasser@arm.com found_seamless_bank |= new_seamless_bank; 150510890Swendy.elsasser@arm.com 150610890Swendy.elsasser@arm.com // ACT can occur 'behind the scenes' 150710890Swendy.elsasser@arm.com hidden_bank_prep = act_at <= hidden_act_max; 150810890Swendy.elsasser@arm.com 150910890Swendy.elsasser@arm.com // set the bit corresponding to the available bank 151010890Swendy.elsasser@arm.com replaceBits(bank_mask, bank_id, bank_id, 1); 151110890Swendy.elsasser@arm.com min_act_at = act_at; 151210211Sandreas.hansson@arm.com } 15139967SN/A } 15149967SN/A } 15159967SN/A } 151610211Sandreas.hansson@arm.com 151710890Swendy.elsasser@arm.com return make_pair(bank_mask, hidden_bank_prep); 15189967SN/A} 15199967SN/A 152010618SOmar.Naji@arm.comDRAMCtrl::Rank::Rank(DRAMCtrl& _memory, const DRAMCtrlParams* _p) 152110618SOmar.Naji@arm.com : EventManager(&_memory), memory(_memory), 152210618SOmar.Naji@arm.com pwrStateTrans(PWR_IDLE), pwrState(PWR_IDLE), pwrStateTick(0), 152310618SOmar.Naji@arm.com refreshState(REF_IDLE), refreshDueAt(0), 152410618SOmar.Naji@arm.com power(_p, false), numBanksActive(0), 152510618SOmar.Naji@arm.com activateEvent(*this), prechargeEvent(*this), 152610618SOmar.Naji@arm.com refreshEvent(*this), powerEvent(*this) 152710618SOmar.Naji@arm.com{ } 152810618SOmar.Naji@arm.com 15299243SN/Avoid 153010618SOmar.Naji@arm.comDRAMCtrl::Rank::startup(Tick ref_tick) 153110618SOmar.Naji@arm.com{ 153210618SOmar.Naji@arm.com assert(ref_tick > curTick()); 153310618SOmar.Naji@arm.com 153410618SOmar.Naji@arm.com pwrStateTick = curTick(); 153510618SOmar.Naji@arm.com 153610618SOmar.Naji@arm.com // kick off the refresh, and give ourselves enough time to 153710618SOmar.Naji@arm.com // precharge 153810618SOmar.Naji@arm.com schedule(refreshEvent, ref_tick); 153910618SOmar.Naji@arm.com} 154010618SOmar.Naji@arm.com 154110618SOmar.Naji@arm.comvoid 154210619Sandreas.hansson@arm.comDRAMCtrl::Rank::suspend() 154310619Sandreas.hansson@arm.com{ 154410619Sandreas.hansson@arm.com deschedule(refreshEvent); 154510619Sandreas.hansson@arm.com} 154610619Sandreas.hansson@arm.com 154710619Sandreas.hansson@arm.comvoid 154810618SOmar.Naji@arm.comDRAMCtrl::Rank::checkDrainDone() 154910618SOmar.Naji@arm.com{ 155010618SOmar.Naji@arm.com // if this rank was waiting to drain it is now able to proceed to 155110618SOmar.Naji@arm.com // precharge 155210618SOmar.Naji@arm.com if (refreshState == REF_DRAIN) { 155310618SOmar.Naji@arm.com DPRINTF(DRAM, "Refresh drain done, now precharging\n"); 155410618SOmar.Naji@arm.com 155510618SOmar.Naji@arm.com refreshState = REF_PRE; 155610618SOmar.Naji@arm.com 155710618SOmar.Naji@arm.com // hand control back to the refresh event loop 155810618SOmar.Naji@arm.com schedule(refreshEvent, curTick()); 155910618SOmar.Naji@arm.com } 156010618SOmar.Naji@arm.com} 156110618SOmar.Naji@arm.com 156210618SOmar.Naji@arm.comvoid 156310618SOmar.Naji@arm.comDRAMCtrl::Rank::processActivateEvent() 156410618SOmar.Naji@arm.com{ 156510618SOmar.Naji@arm.com // we should transition to the active state as soon as any bank is active 156610618SOmar.Naji@arm.com if (pwrState != PWR_ACT) 156710618SOmar.Naji@arm.com // note that at this point numBanksActive could be back at 156810618SOmar.Naji@arm.com // zero again due to a precharge scheduled in the future 156910618SOmar.Naji@arm.com schedulePowerEvent(PWR_ACT, curTick()); 157010618SOmar.Naji@arm.com} 157110618SOmar.Naji@arm.com 157210618SOmar.Naji@arm.comvoid 157310618SOmar.Naji@arm.comDRAMCtrl::Rank::processPrechargeEvent() 157410618SOmar.Naji@arm.com{ 157510618SOmar.Naji@arm.com // if we reached zero, then special conditions apply as we track 157610618SOmar.Naji@arm.com // if all banks are precharged for the power models 157710618SOmar.Naji@arm.com if (numBanksActive == 0) { 157810618SOmar.Naji@arm.com // we should transition to the idle state when the last bank 157910618SOmar.Naji@arm.com // is precharged 158010618SOmar.Naji@arm.com schedulePowerEvent(PWR_IDLE, curTick()); 158110618SOmar.Naji@arm.com } 158210618SOmar.Naji@arm.com} 158310618SOmar.Naji@arm.com 158410618SOmar.Naji@arm.comvoid 158510618SOmar.Naji@arm.comDRAMCtrl::Rank::processRefreshEvent() 15869243SN/A{ 158710207Sandreas.hansson@arm.com // when first preparing the refresh, remember when it was due 158810207Sandreas.hansson@arm.com if (refreshState == REF_IDLE) { 158910207Sandreas.hansson@arm.com // remember when the refresh is due 159010207Sandreas.hansson@arm.com refreshDueAt = curTick(); 15919243SN/A 159210207Sandreas.hansson@arm.com // proceed to drain 159310207Sandreas.hansson@arm.com refreshState = REF_DRAIN; 15949243SN/A 159510207Sandreas.hansson@arm.com DPRINTF(DRAM, "Refresh due\n"); 159610207Sandreas.hansson@arm.com } 159710207Sandreas.hansson@arm.com 159810618SOmar.Naji@arm.com // let any scheduled read or write to the same rank go ahead, 159910618SOmar.Naji@arm.com // after which it will 160010207Sandreas.hansson@arm.com // hand control back to this event loop 160110207Sandreas.hansson@arm.com if (refreshState == REF_DRAIN) { 160210618SOmar.Naji@arm.com // if a request is at the moment being handled and this request is 160310618SOmar.Naji@arm.com // accessing the current rank then wait for it to finish 160410618SOmar.Naji@arm.com if ((rank == memory.activeRank) 160510618SOmar.Naji@arm.com && (memory.nextReqEvent.scheduled())) { 160610207Sandreas.hansson@arm.com // hand control over to the request loop until it is 160710207Sandreas.hansson@arm.com // evaluated next 160810207Sandreas.hansson@arm.com DPRINTF(DRAM, "Refresh awaiting draining\n"); 160910207Sandreas.hansson@arm.com 161010207Sandreas.hansson@arm.com return; 161110207Sandreas.hansson@arm.com } else { 161210207Sandreas.hansson@arm.com refreshState = REF_PRE; 161310207Sandreas.hansson@arm.com } 161410207Sandreas.hansson@arm.com } 161510207Sandreas.hansson@arm.com 161610207Sandreas.hansson@arm.com // at this point, ensure that all banks are precharged 161710207Sandreas.hansson@arm.com if (refreshState == REF_PRE) { 161810208Sandreas.hansson@arm.com // precharge any active bank if we are not already in the idle 161910208Sandreas.hansson@arm.com // state 162010208Sandreas.hansson@arm.com if (pwrState != PWR_IDLE) { 162110214Sandreas.hansson@arm.com // at the moment, we use a precharge all even if there is 162210214Sandreas.hansson@arm.com // only a single bank open 162310208Sandreas.hansson@arm.com DPRINTF(DRAM, "Precharging all\n"); 162410214Sandreas.hansson@arm.com 162510214Sandreas.hansson@arm.com // first determine when we can precharge 162610214Sandreas.hansson@arm.com Tick pre_at = curTick(); 162710618SOmar.Naji@arm.com 162810618SOmar.Naji@arm.com for (auto &b : banks) { 162910618SOmar.Naji@arm.com // respect both causality and any existing bank 163010618SOmar.Naji@arm.com // constraints, some banks could already have a 163110618SOmar.Naji@arm.com // (auto) precharge scheduled 163210618SOmar.Naji@arm.com pre_at = std::max(b.preAllowedAt, pre_at); 163310618SOmar.Naji@arm.com } 163410618SOmar.Naji@arm.com 163510618SOmar.Naji@arm.com // make sure all banks per rank are precharged, and for those that 163610618SOmar.Naji@arm.com // already are, update their availability 163710618SOmar.Naji@arm.com Tick act_allowed_at = pre_at + memory.tRP; 163810618SOmar.Naji@arm.com 163910618SOmar.Naji@arm.com for (auto &b : banks) { 164010618SOmar.Naji@arm.com if (b.openRow != Bank::NO_ROW) { 164110618SOmar.Naji@arm.com memory.prechargeBank(*this, b, pre_at, false); 164210618SOmar.Naji@arm.com } else { 164310618SOmar.Naji@arm.com b.actAllowedAt = std::max(b.actAllowedAt, act_allowed_at); 164410618SOmar.Naji@arm.com b.preAllowedAt = std::max(b.preAllowedAt, pre_at); 164510214Sandreas.hansson@arm.com } 164610214Sandreas.hansson@arm.com } 164710214Sandreas.hansson@arm.com 164810618SOmar.Naji@arm.com // precharge all banks in rank 164910618SOmar.Naji@arm.com power.powerlib.doCommand(MemCommand::PREA, 0, 165010618SOmar.Naji@arm.com divCeil(pre_at, memory.tCK) - 165110618SOmar.Naji@arm.com memory.timeStampOffset); 165210214Sandreas.hansson@arm.com 165310618SOmar.Naji@arm.com DPRINTF(DRAMPower, "%llu,PREA,0,%d\n", 165410618SOmar.Naji@arm.com divCeil(pre_at, memory.tCK) - 165510618SOmar.Naji@arm.com memory.timeStampOffset, rank); 165610208Sandreas.hansson@arm.com } else { 165710208Sandreas.hansson@arm.com DPRINTF(DRAM, "All banks already precharged, starting refresh\n"); 165810208Sandreas.hansson@arm.com 165910208Sandreas.hansson@arm.com // go ahead and kick the power state machine into gear if 166010208Sandreas.hansson@arm.com // we are already idle 166110208Sandreas.hansson@arm.com schedulePowerEvent(PWR_REF, curTick()); 16629975SN/A } 16639975SN/A 166410208Sandreas.hansson@arm.com refreshState = REF_RUN; 166510208Sandreas.hansson@arm.com assert(numBanksActive == 0); 16669243SN/A 166710208Sandreas.hansson@arm.com // wait for all banks to be precharged, at which point the 166810208Sandreas.hansson@arm.com // power state machine will transition to the idle state, and 166910208Sandreas.hansson@arm.com // automatically move to a refresh, at that point it will also 167010208Sandreas.hansson@arm.com // call this method to get the refresh event loop going again 167110207Sandreas.hansson@arm.com return; 167210207Sandreas.hansson@arm.com } 167310207Sandreas.hansson@arm.com 167410207Sandreas.hansson@arm.com // last but not least we perform the actual refresh 167510207Sandreas.hansson@arm.com if (refreshState == REF_RUN) { 167610207Sandreas.hansson@arm.com // should never get here with any banks active 167710207Sandreas.hansson@arm.com assert(numBanksActive == 0); 167810208Sandreas.hansson@arm.com assert(pwrState == PWR_REF); 167910207Sandreas.hansson@arm.com 168010618SOmar.Naji@arm.com Tick ref_done_at = curTick() + memory.tRFC; 168110207Sandreas.hansson@arm.com 168210618SOmar.Naji@arm.com for (auto &b : banks) { 168310618SOmar.Naji@arm.com b.actAllowedAt = ref_done_at; 168410618SOmar.Naji@arm.com } 168510247Sandreas.hansson@arm.com 168610618SOmar.Naji@arm.com // at the moment this affects all ranks 168710618SOmar.Naji@arm.com power.powerlib.doCommand(MemCommand::REF, 0, 168810618SOmar.Naji@arm.com divCeil(curTick(), memory.tCK) - 168910618SOmar.Naji@arm.com memory.timeStampOffset); 169010432SOmar.Naji@arm.com 169110618SOmar.Naji@arm.com // at the moment sort the list of commands and update the counters 169210618SOmar.Naji@arm.com // for DRAMPower libray when doing a refresh 169310618SOmar.Naji@arm.com sort(power.powerlib.cmdList.begin(), 169410618SOmar.Naji@arm.com power.powerlib.cmdList.end(), DRAMCtrl::sortTime); 169510432SOmar.Naji@arm.com 169610618SOmar.Naji@arm.com // update the counters for DRAMPower, passing false to 169710618SOmar.Naji@arm.com // indicate that this is not the last command in the 169810618SOmar.Naji@arm.com // list. DRAMPower requires this information for the 169910618SOmar.Naji@arm.com // correct calculation of the background energy at the end 170010618SOmar.Naji@arm.com // of the simulation. Ideally we would want to call this 170110618SOmar.Naji@arm.com // function with true once at the end of the 170210618SOmar.Naji@arm.com // simulation. However, the discarded energy is extremly 170310618SOmar.Naji@arm.com // small and does not effect the final results. 170410618SOmar.Naji@arm.com power.powerlib.updateCounters(false); 170510432SOmar.Naji@arm.com 170610618SOmar.Naji@arm.com // call the energy function 170710618SOmar.Naji@arm.com power.powerlib.calcEnergy(); 170810432SOmar.Naji@arm.com 170910618SOmar.Naji@arm.com // Update the stats 171010618SOmar.Naji@arm.com updatePowerStats(); 171110432SOmar.Naji@arm.com 171210618SOmar.Naji@arm.com DPRINTF(DRAMPower, "%llu,REF,0,%d\n", divCeil(curTick(), memory.tCK) - 171310618SOmar.Naji@arm.com memory.timeStampOffset, rank); 171410207Sandreas.hansson@arm.com 171510207Sandreas.hansson@arm.com // make sure we did not wait so long that we cannot make up 171610207Sandreas.hansson@arm.com // for it 171710618SOmar.Naji@arm.com if (refreshDueAt + memory.tREFI < ref_done_at) { 171810207Sandreas.hansson@arm.com fatal("Refresh was delayed so long we cannot catch up\n"); 171910207Sandreas.hansson@arm.com } 172010207Sandreas.hansson@arm.com 172110207Sandreas.hansson@arm.com // compensate for the delay in actually performing the refresh 172210207Sandreas.hansson@arm.com // when scheduling the next one 172310618SOmar.Naji@arm.com schedule(refreshEvent, refreshDueAt + memory.tREFI - memory.tRP); 172410207Sandreas.hansson@arm.com 172510208Sandreas.hansson@arm.com assert(!powerEvent.scheduled()); 172610207Sandreas.hansson@arm.com 172710208Sandreas.hansson@arm.com // move to the idle power state once the refresh is done, this 172810208Sandreas.hansson@arm.com // will also move the refresh state machine to the refresh 172910208Sandreas.hansson@arm.com // idle state 173010211Sandreas.hansson@arm.com schedulePowerEvent(PWR_IDLE, ref_done_at); 173110207Sandreas.hansson@arm.com 173210208Sandreas.hansson@arm.com DPRINTF(DRAMState, "Refresh done at %llu and next refresh at %llu\n", 173310618SOmar.Naji@arm.com ref_done_at, refreshDueAt + memory.tREFI); 173410208Sandreas.hansson@arm.com } 173510208Sandreas.hansson@arm.com} 173610208Sandreas.hansson@arm.com 173710208Sandreas.hansson@arm.comvoid 173810618SOmar.Naji@arm.comDRAMCtrl::Rank::schedulePowerEvent(PowerState pwr_state, Tick tick) 173910208Sandreas.hansson@arm.com{ 174010208Sandreas.hansson@arm.com // respect causality 174110208Sandreas.hansson@arm.com assert(tick >= curTick()); 174210208Sandreas.hansson@arm.com 174310208Sandreas.hansson@arm.com if (!powerEvent.scheduled()) { 174410208Sandreas.hansson@arm.com DPRINTF(DRAMState, "Scheduling power event at %llu to state %d\n", 174510208Sandreas.hansson@arm.com tick, pwr_state); 174610208Sandreas.hansson@arm.com 174710208Sandreas.hansson@arm.com // insert the new transition 174810208Sandreas.hansson@arm.com pwrStateTrans = pwr_state; 174910208Sandreas.hansson@arm.com 175010208Sandreas.hansson@arm.com schedule(powerEvent, tick); 175110208Sandreas.hansson@arm.com } else { 175210208Sandreas.hansson@arm.com panic("Scheduled power event at %llu to state %d, " 175310208Sandreas.hansson@arm.com "with scheduled event at %llu to %d\n", tick, pwr_state, 175410208Sandreas.hansson@arm.com powerEvent.when(), pwrStateTrans); 175510208Sandreas.hansson@arm.com } 175610208Sandreas.hansson@arm.com} 175710208Sandreas.hansson@arm.com 175810208Sandreas.hansson@arm.comvoid 175910618SOmar.Naji@arm.comDRAMCtrl::Rank::processPowerEvent() 176010208Sandreas.hansson@arm.com{ 176110208Sandreas.hansson@arm.com // remember where we were, and for how long 176210208Sandreas.hansson@arm.com Tick duration = curTick() - pwrStateTick; 176310208Sandreas.hansson@arm.com PowerState prev_state = pwrState; 176410208Sandreas.hansson@arm.com 176510208Sandreas.hansson@arm.com // update the accounting 176610208Sandreas.hansson@arm.com pwrStateTime[prev_state] += duration; 176710208Sandreas.hansson@arm.com 176810208Sandreas.hansson@arm.com pwrState = pwrStateTrans; 176910208Sandreas.hansson@arm.com pwrStateTick = curTick(); 177010208Sandreas.hansson@arm.com 177110208Sandreas.hansson@arm.com if (pwrState == PWR_IDLE) { 177210208Sandreas.hansson@arm.com DPRINTF(DRAMState, "All banks precharged\n"); 177310208Sandreas.hansson@arm.com 177410208Sandreas.hansson@arm.com // if we were refreshing, make sure we start scheduling requests again 177510208Sandreas.hansson@arm.com if (prev_state == PWR_REF) { 177610208Sandreas.hansson@arm.com DPRINTF(DRAMState, "Was refreshing for %llu ticks\n", duration); 177710208Sandreas.hansson@arm.com assert(pwrState == PWR_IDLE); 177810208Sandreas.hansson@arm.com 177910208Sandreas.hansson@arm.com // kick things into action again 178010208Sandreas.hansson@arm.com refreshState = REF_IDLE; 178110618SOmar.Naji@arm.com // a request event could be already scheduled by the state 178210618SOmar.Naji@arm.com // machine of the other rank 178310618SOmar.Naji@arm.com if (!memory.nextReqEvent.scheduled()) 178410618SOmar.Naji@arm.com schedule(memory.nextReqEvent, curTick()); 178510208Sandreas.hansson@arm.com } else { 178610208Sandreas.hansson@arm.com assert(prev_state == PWR_ACT); 178710208Sandreas.hansson@arm.com 178810208Sandreas.hansson@arm.com // if we have a pending refresh, and are now moving to 178910208Sandreas.hansson@arm.com // the idle state, direclty transition to a refresh 179010208Sandreas.hansson@arm.com if (refreshState == REF_RUN) { 179110208Sandreas.hansson@arm.com // there should be nothing waiting at this point 179210208Sandreas.hansson@arm.com assert(!powerEvent.scheduled()); 179310208Sandreas.hansson@arm.com 179410208Sandreas.hansson@arm.com // update the state in zero time and proceed below 179510208Sandreas.hansson@arm.com pwrState = PWR_REF; 179610208Sandreas.hansson@arm.com } 179710208Sandreas.hansson@arm.com } 179810208Sandreas.hansson@arm.com } 179910208Sandreas.hansson@arm.com 180010208Sandreas.hansson@arm.com // we transition to the refresh state, let the refresh state 180110208Sandreas.hansson@arm.com // machine know of this state update and let it deal with the 180210208Sandreas.hansson@arm.com // scheduling of the next power state transition as well as the 180310208Sandreas.hansson@arm.com // following refresh 180410208Sandreas.hansson@arm.com if (pwrState == PWR_REF) { 180510208Sandreas.hansson@arm.com DPRINTF(DRAMState, "Refreshing\n"); 180610208Sandreas.hansson@arm.com // kick the refresh event loop into action again, and that 180710208Sandreas.hansson@arm.com // in turn will schedule a transition to the idle power 180810208Sandreas.hansson@arm.com // state once the refresh is done 180910208Sandreas.hansson@arm.com assert(refreshState == REF_RUN); 181010208Sandreas.hansson@arm.com processRefreshEvent(); 181110207Sandreas.hansson@arm.com } 18129243SN/A} 18139243SN/A 18149243SN/Avoid 181510618SOmar.Naji@arm.comDRAMCtrl::Rank::updatePowerStats() 181610432SOmar.Naji@arm.com{ 181710432SOmar.Naji@arm.com // Get the energy and power from DRAMPower 181810432SOmar.Naji@arm.com Data::MemoryPowerModel::Energy energy = 181910618SOmar.Naji@arm.com power.powerlib.getEnergy(); 182010618SOmar.Naji@arm.com Data::MemoryPowerModel::Power rank_power = 182110618SOmar.Naji@arm.com power.powerlib.getPower(); 182210432SOmar.Naji@arm.com 182310618SOmar.Naji@arm.com actEnergy = energy.act_energy * memory.devicesPerRank; 182410618SOmar.Naji@arm.com preEnergy = energy.pre_energy * memory.devicesPerRank; 182510618SOmar.Naji@arm.com readEnergy = energy.read_energy * memory.devicesPerRank; 182610618SOmar.Naji@arm.com writeEnergy = energy.write_energy * memory.devicesPerRank; 182710618SOmar.Naji@arm.com refreshEnergy = energy.ref_energy * memory.devicesPerRank; 182810618SOmar.Naji@arm.com actBackEnergy = energy.act_stdby_energy * memory.devicesPerRank; 182910618SOmar.Naji@arm.com preBackEnergy = energy.pre_stdby_energy * memory.devicesPerRank; 183010618SOmar.Naji@arm.com totalEnergy = energy.total_energy * memory.devicesPerRank; 183110618SOmar.Naji@arm.com averagePower = rank_power.average_power * memory.devicesPerRank; 183210432SOmar.Naji@arm.com} 183310432SOmar.Naji@arm.com 183410432SOmar.Naji@arm.comvoid 183510618SOmar.Naji@arm.comDRAMCtrl::Rank::regStats() 183610618SOmar.Naji@arm.com{ 183710618SOmar.Naji@arm.com using namespace Stats; 183810618SOmar.Naji@arm.com 183910618SOmar.Naji@arm.com pwrStateTime 184010618SOmar.Naji@arm.com .init(5) 184110618SOmar.Naji@arm.com .name(name() + ".memoryStateTime") 184210618SOmar.Naji@arm.com .desc("Time in different power states"); 184310618SOmar.Naji@arm.com pwrStateTime.subname(0, "IDLE"); 184410618SOmar.Naji@arm.com pwrStateTime.subname(1, "REF"); 184510618SOmar.Naji@arm.com pwrStateTime.subname(2, "PRE_PDN"); 184610618SOmar.Naji@arm.com pwrStateTime.subname(3, "ACT"); 184710618SOmar.Naji@arm.com pwrStateTime.subname(4, "ACT_PDN"); 184810618SOmar.Naji@arm.com 184910618SOmar.Naji@arm.com actEnergy 185010618SOmar.Naji@arm.com .name(name() + ".actEnergy") 185110618SOmar.Naji@arm.com .desc("Energy for activate commands per rank (pJ)"); 185210618SOmar.Naji@arm.com 185310618SOmar.Naji@arm.com preEnergy 185410618SOmar.Naji@arm.com .name(name() + ".preEnergy") 185510618SOmar.Naji@arm.com .desc("Energy for precharge commands per rank (pJ)"); 185610618SOmar.Naji@arm.com 185710618SOmar.Naji@arm.com readEnergy 185810618SOmar.Naji@arm.com .name(name() + ".readEnergy") 185910618SOmar.Naji@arm.com .desc("Energy for read commands per rank (pJ)"); 186010618SOmar.Naji@arm.com 186110618SOmar.Naji@arm.com writeEnergy 186210618SOmar.Naji@arm.com .name(name() + ".writeEnergy") 186310618SOmar.Naji@arm.com .desc("Energy for write commands per rank (pJ)"); 186410618SOmar.Naji@arm.com 186510618SOmar.Naji@arm.com refreshEnergy 186610618SOmar.Naji@arm.com .name(name() + ".refreshEnergy") 186710618SOmar.Naji@arm.com .desc("Energy for refresh commands per rank (pJ)"); 186810618SOmar.Naji@arm.com 186910618SOmar.Naji@arm.com actBackEnergy 187010618SOmar.Naji@arm.com .name(name() + ".actBackEnergy") 187110618SOmar.Naji@arm.com .desc("Energy for active background per rank (pJ)"); 187210618SOmar.Naji@arm.com 187310618SOmar.Naji@arm.com preBackEnergy 187410618SOmar.Naji@arm.com .name(name() + ".preBackEnergy") 187510618SOmar.Naji@arm.com .desc("Energy for precharge background per rank (pJ)"); 187610618SOmar.Naji@arm.com 187710618SOmar.Naji@arm.com totalEnergy 187810618SOmar.Naji@arm.com .name(name() + ".totalEnergy") 187910618SOmar.Naji@arm.com .desc("Total energy per rank (pJ)"); 188010618SOmar.Naji@arm.com 188110618SOmar.Naji@arm.com averagePower 188210618SOmar.Naji@arm.com .name(name() + ".averagePower") 188310618SOmar.Naji@arm.com .desc("Core power per rank (mW)"); 188410618SOmar.Naji@arm.com} 188510618SOmar.Naji@arm.comvoid 188610146Sandreas.hansson@arm.comDRAMCtrl::regStats() 18879243SN/A{ 18889243SN/A using namespace Stats; 18899243SN/A 18909243SN/A AbstractMemory::regStats(); 18919243SN/A 189210618SOmar.Naji@arm.com for (auto r : ranks) { 189310618SOmar.Naji@arm.com r->regStats(); 189410618SOmar.Naji@arm.com } 189510618SOmar.Naji@arm.com 18969243SN/A readReqs 18979243SN/A .name(name() + ".readReqs") 18989977SN/A .desc("Number of read requests accepted"); 18999243SN/A 19009243SN/A writeReqs 19019243SN/A .name(name() + ".writeReqs") 19029977SN/A .desc("Number of write requests accepted"); 19039831SN/A 19049831SN/A readBursts 19059831SN/A .name(name() + ".readBursts") 19069977SN/A .desc("Number of DRAM read bursts, " 19079977SN/A "including those serviced by the write queue"); 19089831SN/A 19099831SN/A writeBursts 19109831SN/A .name(name() + ".writeBursts") 19119977SN/A .desc("Number of DRAM write bursts, " 19129977SN/A "including those merged in the write queue"); 19139243SN/A 19149243SN/A servicedByWrQ 19159243SN/A .name(name() + ".servicedByWrQ") 19169977SN/A .desc("Number of DRAM read bursts serviced by the write queue"); 19179977SN/A 19189977SN/A mergedWrBursts 19199977SN/A .name(name() + ".mergedWrBursts") 19209977SN/A .desc("Number of DRAM write bursts merged with an existing one"); 19219243SN/A 19229243SN/A neitherReadNorWrite 19239977SN/A .name(name() + ".neitherReadNorWriteReqs") 19249977SN/A .desc("Number of requests that are neither read nor write"); 19259243SN/A 19269977SN/A perBankRdBursts 19279243SN/A .init(banksPerRank * ranksPerChannel) 19289977SN/A .name(name() + ".perBankRdBursts") 19299977SN/A .desc("Per bank write bursts"); 19309243SN/A 19319977SN/A perBankWrBursts 19329243SN/A .init(banksPerRank * ranksPerChannel) 19339977SN/A .name(name() + ".perBankWrBursts") 19349977SN/A .desc("Per bank write bursts"); 19359243SN/A 19369243SN/A avgRdQLen 19379243SN/A .name(name() + ".avgRdQLen") 19389977SN/A .desc("Average read queue length when enqueuing") 19399243SN/A .precision(2); 19409243SN/A 19419243SN/A avgWrQLen 19429243SN/A .name(name() + ".avgWrQLen") 19439977SN/A .desc("Average write queue length when enqueuing") 19449243SN/A .precision(2); 19459243SN/A 19469243SN/A totQLat 19479243SN/A .name(name() + ".totQLat") 19489977SN/A .desc("Total ticks spent queuing"); 19499243SN/A 19509243SN/A totBusLat 19519243SN/A .name(name() + ".totBusLat") 19529977SN/A .desc("Total ticks spent in databus transfers"); 19539243SN/A 19549243SN/A totMemAccLat 19559243SN/A .name(name() + ".totMemAccLat") 19569977SN/A .desc("Total ticks spent from burst creation until serviced " 19579977SN/A "by the DRAM"); 19589243SN/A 19599243SN/A avgQLat 19609243SN/A .name(name() + ".avgQLat") 19619977SN/A .desc("Average queueing delay per DRAM burst") 19629243SN/A .precision(2); 19639243SN/A 19649831SN/A avgQLat = totQLat / (readBursts - servicedByWrQ); 19659243SN/A 19669243SN/A avgBusLat 19679243SN/A .name(name() + ".avgBusLat") 19689977SN/A .desc("Average bus latency per DRAM burst") 19699243SN/A .precision(2); 19709243SN/A 19719831SN/A avgBusLat = totBusLat / (readBursts - servicedByWrQ); 19729243SN/A 19739243SN/A avgMemAccLat 19749243SN/A .name(name() + ".avgMemAccLat") 19759977SN/A .desc("Average memory access latency per DRAM burst") 19769243SN/A .precision(2); 19779243SN/A 19789831SN/A avgMemAccLat = totMemAccLat / (readBursts - servicedByWrQ); 19799243SN/A 19809243SN/A numRdRetry 19819243SN/A .name(name() + ".numRdRetry") 19829977SN/A .desc("Number of times read queue was full causing retry"); 19839243SN/A 19849243SN/A numWrRetry 19859243SN/A .name(name() + ".numWrRetry") 19869977SN/A .desc("Number of times write queue was full causing retry"); 19879243SN/A 19889243SN/A readRowHits 19899243SN/A .name(name() + ".readRowHits") 19909243SN/A .desc("Number of row buffer hits during reads"); 19919243SN/A 19929243SN/A writeRowHits 19939243SN/A .name(name() + ".writeRowHits") 19949243SN/A .desc("Number of row buffer hits during writes"); 19959243SN/A 19969243SN/A readRowHitRate 19979243SN/A .name(name() + ".readRowHitRate") 19989243SN/A .desc("Row buffer hit rate for reads") 19999243SN/A .precision(2); 20009243SN/A 20019831SN/A readRowHitRate = (readRowHits / (readBursts - servicedByWrQ)) * 100; 20029243SN/A 20039243SN/A writeRowHitRate 20049243SN/A .name(name() + ".writeRowHitRate") 20059243SN/A .desc("Row buffer hit rate for writes") 20069243SN/A .precision(2); 20079243SN/A 20089977SN/A writeRowHitRate = (writeRowHits / (writeBursts - mergedWrBursts)) * 100; 20099243SN/A 20109243SN/A readPktSize 20119831SN/A .init(ceilLog2(burstSize) + 1) 20129243SN/A .name(name() + ".readPktSize") 20139977SN/A .desc("Read request sizes (log2)"); 20149243SN/A 20159243SN/A writePktSize 20169831SN/A .init(ceilLog2(burstSize) + 1) 20179243SN/A .name(name() + ".writePktSize") 20189977SN/A .desc("Write request sizes (log2)"); 20199243SN/A 20209243SN/A rdQLenPdf 20219567SN/A .init(readBufferSize) 20229243SN/A .name(name() + ".rdQLenPdf") 20239243SN/A .desc("What read queue length does an incoming req see"); 20249243SN/A 20259243SN/A wrQLenPdf 20269567SN/A .init(writeBufferSize) 20279243SN/A .name(name() + ".wrQLenPdf") 20289243SN/A .desc("What write queue length does an incoming req see"); 20299243SN/A 20309727SN/A bytesPerActivate 203110141SN/A .init(maxAccessesPerRow) 20329727SN/A .name(name() + ".bytesPerActivate") 20339727SN/A .desc("Bytes accessed per row activation") 20349727SN/A .flags(nozero); 20359243SN/A 203610147Sandreas.hansson@arm.com rdPerTurnAround 203710147Sandreas.hansson@arm.com .init(readBufferSize) 203810147Sandreas.hansson@arm.com .name(name() + ".rdPerTurnAround") 203910147Sandreas.hansson@arm.com .desc("Reads before turning the bus around for writes") 204010147Sandreas.hansson@arm.com .flags(nozero); 204110147Sandreas.hansson@arm.com 204210147Sandreas.hansson@arm.com wrPerTurnAround 204310147Sandreas.hansson@arm.com .init(writeBufferSize) 204410147Sandreas.hansson@arm.com .name(name() + ".wrPerTurnAround") 204510147Sandreas.hansson@arm.com .desc("Writes before turning the bus around for reads") 204610147Sandreas.hansson@arm.com .flags(nozero); 204710147Sandreas.hansson@arm.com 20489975SN/A bytesReadDRAM 20499975SN/A .name(name() + ".bytesReadDRAM") 20509975SN/A .desc("Total number of bytes read from DRAM"); 20519975SN/A 20529975SN/A bytesReadWrQ 20539975SN/A .name(name() + ".bytesReadWrQ") 20549975SN/A .desc("Total number of bytes read from write queue"); 20559243SN/A 20569243SN/A bytesWritten 20579243SN/A .name(name() + ".bytesWritten") 20589977SN/A .desc("Total number of bytes written to DRAM"); 20599243SN/A 20609977SN/A bytesReadSys 20619977SN/A .name(name() + ".bytesReadSys") 20629977SN/A .desc("Total read bytes from the system interface side"); 20639243SN/A 20649977SN/A bytesWrittenSys 20659977SN/A .name(name() + ".bytesWrittenSys") 20669977SN/A .desc("Total written bytes from the system interface side"); 20679243SN/A 20689243SN/A avgRdBW 20699243SN/A .name(name() + ".avgRdBW") 20709977SN/A .desc("Average DRAM read bandwidth in MiByte/s") 20719243SN/A .precision(2); 20729243SN/A 20739977SN/A avgRdBW = (bytesReadDRAM / 1000000) / simSeconds; 20749243SN/A 20759243SN/A avgWrBW 20769243SN/A .name(name() + ".avgWrBW") 20779977SN/A .desc("Average achieved write bandwidth in MiByte/s") 20789243SN/A .precision(2); 20799243SN/A 20809243SN/A avgWrBW = (bytesWritten / 1000000) / simSeconds; 20819243SN/A 20829977SN/A avgRdBWSys 20839977SN/A .name(name() + ".avgRdBWSys") 20849977SN/A .desc("Average system read bandwidth in MiByte/s") 20859243SN/A .precision(2); 20869243SN/A 20879977SN/A avgRdBWSys = (bytesReadSys / 1000000) / simSeconds; 20889243SN/A 20899977SN/A avgWrBWSys 20909977SN/A .name(name() + ".avgWrBWSys") 20919977SN/A .desc("Average system write bandwidth in MiByte/s") 20929243SN/A .precision(2); 20939243SN/A 20949977SN/A avgWrBWSys = (bytesWrittenSys / 1000000) / simSeconds; 20959243SN/A 20969243SN/A peakBW 20979243SN/A .name(name() + ".peakBW") 20989977SN/A .desc("Theoretical peak bandwidth in MiByte/s") 20999243SN/A .precision(2); 21009243SN/A 21019831SN/A peakBW = (SimClock::Frequency / tBURST) * burstSize / 1000000; 21029243SN/A 21039243SN/A busUtil 21049243SN/A .name(name() + ".busUtil") 21059243SN/A .desc("Data bus utilization in percentage") 21069243SN/A .precision(2); 21079243SN/A busUtil = (avgRdBW + avgWrBW) / peakBW * 100; 21089243SN/A 21099243SN/A totGap 21109243SN/A .name(name() + ".totGap") 21119243SN/A .desc("Total gap between requests"); 21129243SN/A 21139243SN/A avgGap 21149243SN/A .name(name() + ".avgGap") 21159243SN/A .desc("Average gap between requests") 21169243SN/A .precision(2); 21179243SN/A 21189243SN/A avgGap = totGap / (readReqs + writeReqs); 21199975SN/A 21209975SN/A // Stats for DRAM Power calculation based on Micron datasheet 21219975SN/A busUtilRead 21229975SN/A .name(name() + ".busUtilRead") 21239975SN/A .desc("Data bus utilization in percentage for reads") 21249975SN/A .precision(2); 21259975SN/A 21269975SN/A busUtilRead = avgRdBW / peakBW * 100; 21279975SN/A 21289975SN/A busUtilWrite 21299975SN/A .name(name() + ".busUtilWrite") 21309975SN/A .desc("Data bus utilization in percentage for writes") 21319975SN/A .precision(2); 21329975SN/A 21339975SN/A busUtilWrite = avgWrBW / peakBW * 100; 21349975SN/A 21359975SN/A pageHitRate 21369975SN/A .name(name() + ".pageHitRate") 21379975SN/A .desc("Row buffer hit rate, read and write combined") 21389975SN/A .precision(2); 21399975SN/A 21409977SN/A pageHitRate = (writeRowHits + readRowHits) / 21419977SN/A (writeBursts - mergedWrBursts + readBursts - servicedByWrQ) * 100; 21429243SN/A} 21439243SN/A 21449243SN/Avoid 214510146Sandreas.hansson@arm.comDRAMCtrl::recvFunctional(PacketPtr pkt) 21469243SN/A{ 21479243SN/A // rely on the abstract memory 21489243SN/A functionalAccess(pkt); 21499243SN/A} 21509243SN/A 21519294SN/ABaseSlavePort& 215210146Sandreas.hansson@arm.comDRAMCtrl::getSlavePort(const string &if_name, PortID idx) 21539243SN/A{ 21549243SN/A if (if_name != "port") { 21559243SN/A return MemObject::getSlavePort(if_name, idx); 21569243SN/A } else { 21579243SN/A return port; 21589243SN/A } 21599243SN/A} 21609243SN/A 216110913Sandreas.sandberg@arm.comDrainState 216210913Sandreas.sandberg@arm.comDRAMCtrl::drain() 21639243SN/A{ 21649243SN/A // if there is anything in any of our internal queues, keep track 21659243SN/A // of that as well 216610913Sandreas.sandberg@arm.com if (!(writeQueue.empty() && readQueue.empty() && respQueue.empty())) { 21679352SN/A DPRINTF(Drain, "DRAM controller not drained, write: %d, read: %d," 21689567SN/A " resp: %d\n", writeQueue.size(), readQueue.size(), 21699567SN/A respQueue.size()); 217010206Sandreas.hansson@arm.com 21719352SN/A // the only part that is not drained automatically over time 217210206Sandreas.hansson@arm.com // is the write queue, thus kick things into action if needed 217310206Sandreas.hansson@arm.com if (!writeQueue.empty() && !nextReqEvent.scheduled()) { 217410206Sandreas.hansson@arm.com schedule(nextReqEvent, curTick()); 217510206Sandreas.hansson@arm.com } 217610913Sandreas.sandberg@arm.com return DrainState::Draining; 217710912Sandreas.sandberg@arm.com } else { 217810913Sandreas.sandberg@arm.com return DrainState::Drained; 21799243SN/A } 21809243SN/A} 21819243SN/A 218210619Sandreas.hansson@arm.comvoid 218310619Sandreas.hansson@arm.comDRAMCtrl::drainResume() 218410619Sandreas.hansson@arm.com{ 218510619Sandreas.hansson@arm.com if (!isTimingMode && system()->isTimingMode()) { 218610619Sandreas.hansson@arm.com // if we switched to timing mode, kick things into action, 218710619Sandreas.hansson@arm.com // and behave as if we restored from a checkpoint 218810619Sandreas.hansson@arm.com startup(); 218910619Sandreas.hansson@arm.com } else if (isTimingMode && !system()->isTimingMode()) { 219010619Sandreas.hansson@arm.com // if we switch from timing mode, stop the refresh events to 219110619Sandreas.hansson@arm.com // not cause issues with KVM 219210619Sandreas.hansson@arm.com for (auto r : ranks) { 219310619Sandreas.hansson@arm.com r->suspend(); 219410619Sandreas.hansson@arm.com } 219510619Sandreas.hansson@arm.com } 219610619Sandreas.hansson@arm.com 219710619Sandreas.hansson@arm.com // update the mode 219810619Sandreas.hansson@arm.com isTimingMode = system()->isTimingMode(); 219910619Sandreas.hansson@arm.com} 220010619Sandreas.hansson@arm.com 220110146Sandreas.hansson@arm.comDRAMCtrl::MemoryPort::MemoryPort(const std::string& name, DRAMCtrl& _memory) 22029243SN/A : QueuedSlavePort(name, &_memory, queue), queue(_memory, *this), 22039243SN/A memory(_memory) 22049243SN/A{ } 22059243SN/A 22069243SN/AAddrRangeList 220710146Sandreas.hansson@arm.comDRAMCtrl::MemoryPort::getAddrRanges() const 22089243SN/A{ 22099243SN/A AddrRangeList ranges; 22109243SN/A ranges.push_back(memory.getAddrRange()); 22119243SN/A return ranges; 22129243SN/A} 22139243SN/A 22149243SN/Avoid 221510146Sandreas.hansson@arm.comDRAMCtrl::MemoryPort::recvFunctional(PacketPtr pkt) 22169243SN/A{ 22179243SN/A pkt->pushLabel(memory.name()); 22189243SN/A 22199243SN/A if (!queue.checkFunctional(pkt)) { 22209243SN/A // Default implementation of SimpleTimingPort::recvFunctional() 22219243SN/A // calls recvAtomic() and throws away the latency; we can save a 22229243SN/A // little here by just not calculating the latency. 22239243SN/A memory.recvFunctional(pkt); 22249243SN/A } 22259243SN/A 22269243SN/A pkt->popLabel(); 22279243SN/A} 22289243SN/A 22299243SN/ATick 223010146Sandreas.hansson@arm.comDRAMCtrl::MemoryPort::recvAtomic(PacketPtr pkt) 22319243SN/A{ 22329243SN/A return memory.recvAtomic(pkt); 22339243SN/A} 22349243SN/A 22359243SN/Abool 223610146Sandreas.hansson@arm.comDRAMCtrl::MemoryPort::recvTimingReq(PacketPtr pkt) 22379243SN/A{ 22389243SN/A // pass it to the memory controller 22399243SN/A return memory.recvTimingReq(pkt); 22409243SN/A} 22419243SN/A 224210146Sandreas.hansson@arm.comDRAMCtrl* 224310146Sandreas.hansson@arm.comDRAMCtrlParams::create() 22449243SN/A{ 224510146Sandreas.hansson@arm.com return new DRAMCtrl(this); 22469243SN/A} 2247