1/* 2 * Copyright (c) 2008 Mark D. Hill and David A. Wood 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; --- 21 unchanged lines hidden (view full) --- 30 31#include "debug/RubyDma.hh" 32#include "debug/RubyStats.hh" 33#include "mem/protocol/SequencerMsg.hh" 34#include "mem/protocol/SequencerRequestType.hh" 35#include "mem/ruby/system/DMASequencer.hh" 36#include "mem/ruby/system/RubySystem.hh" 37 |
38DMARequest::DMARequest(uint64_t start_paddr, int len, bool write, 39 int bytes_completed, int bytes_issued, uint8_t *data, 40 PacketPtr pkt) 41 : start_paddr(start_paddr), len(len), write(write), 42 bytes_completed(bytes_completed), bytes_issued(bytes_issued), data(data), 43 pkt(pkt) 44{ 45} 46 |
47DMASequencer::DMASequencer(const Params *p) |
48 : RubyPort(p), m_outstanding_count(0), 49 m_max_outstanding_requests(p->max_outstanding_requests) |
50{ 51} 52 53void 54DMASequencer::init() 55{ 56 RubyPort::init(); |
57 m_data_block_mask = mask(RubySystem::getBlockSizeBits()); 58 59 for (const auto &s_port : slave_ports) 60 s_port->sendRangeChange(); 61} 62 63RequestStatus 64DMASequencer::makeRequest(PacketPtr pkt) 65{ |
66 if (m_outstanding_count == m_max_outstanding_requests) { |
67 return RequestStatus_BufferFull; 68 } 69 70 Addr paddr = pkt->getAddr(); 71 uint8_t* data = pkt->getPtr<uint8_t>(); 72 int len = pkt->getSize(); 73 bool write = pkt->isWrite(); 74 |
75 assert(m_outstanding_count < m_max_outstanding_requests); 76 Addr line_addr = makeLineAddress(paddr); 77 auto emplace_pair = 78 m_RequestTable.emplace(std::piecewise_construct, 79 std::forward_as_tuple(line_addr), 80 std::forward_as_tuple(paddr, len, write, 0, 81 0, data, pkt)); 82 DMARequest& active_request = emplace_pair.first->second; |
83 |
84 // This is pretty conservative. A regular Sequencer with a more beefy 85 // request table that can track multiple requests for a cache line should 86 // be used if a more aggressive policy is needed. 87 if (!emplace_pair.second) { 88 DPRINTF(RubyDma, "DMA aliased: addr %p, len %d\n", line_addr, len); 89 return RequestStatus_Aliased; 90 } |
91 |
92 DPRINTF(RubyDma, "DMA req created: addr %p, len %d\n", line_addr, len); 93 |
94 std::shared_ptr<SequencerMsg> msg = 95 std::make_shared<SequencerMsg>(clockEdge()); 96 msg->getPhysicalAddress() = paddr; |
97 msg->getLineAddress() = line_addr; |
98 msg->getType() = write ? SequencerRequestType_ST : SequencerRequestType_LD; 99 int offset = paddr & m_data_block_mask; 100 101 msg->getLen() = (offset + len) <= RubySystem::getBlockSizeBytes() ? 102 len : RubySystem::getBlockSizeBytes() - offset; 103 104 if (write && (data != NULL)) { 105 if (active_request.data != NULL) { 106 msg->getDataBlk().setData(data, offset, msg->getLen()); 107 } 108 } 109 |
110 m_outstanding_count++; 111 |
112 assert(m_mandatory_q_ptr != NULL); 113 m_mandatory_q_ptr->enqueue(msg, clockEdge(), cyclesToTicks(Cycles(1))); 114 active_request.bytes_issued += msg->getLen(); 115 116 return RequestStatus_Issued; 117} 118 119void |
120DMASequencer::issueNext(const Addr& address) |
121{ |
122 RequestTable::iterator i = m_RequestTable.find(address); 123 assert(i != m_RequestTable.end()); 124 125 DMARequest &active_request = i->second; 126 127 assert(m_outstanding_count <= m_max_outstanding_requests); |
128 active_request.bytes_completed = active_request.bytes_issued; 129 if (active_request.len == active_request.bytes_completed) { |
130 DPRINTF(RubyDma, "DMA request completed: addr %p, size %d\n", 131 address, active_request.len); 132 m_outstanding_count--; 133 PacketPtr pkt = active_request.pkt; 134 m_RequestTable.erase(i); 135 ruby_hit_callback(pkt); |
136 return; 137 } 138 139 std::shared_ptr<SequencerMsg> msg = 140 std::make_shared<SequencerMsg>(clockEdge()); 141 msg->getPhysicalAddress() = active_request.start_paddr + 142 active_request.bytes_completed; 143 --- 20 unchanged lines hidden (view full) --- 164 active_request.bytes_issued += msg->getLen(); 165 DPRINTF(RubyDma, 166 "DMA request bytes issued %d, bytes completed %d, total len %d\n", 167 active_request.bytes_issued, active_request.bytes_completed, 168 active_request.len); 169} 170 171void |
172DMASequencer::dataCallback(const DataBlock & dblk, const Addr& address) |
173{ |
174 175 RequestTable::iterator i = m_RequestTable.find(address); 176 assert(i != m_RequestTable.end()); 177 178 DMARequest &active_request = i->second; |
179 int len = active_request.bytes_issued - active_request.bytes_completed; 180 int offset = 0; 181 if (active_request.bytes_completed == 0) 182 offset = active_request.start_paddr & m_data_block_mask; 183 assert(!active_request.write); 184 if (active_request.data != NULL) { 185 memcpy(&active_request.data[active_request.bytes_completed], 186 dblk.getData(offset, len), len); 187 } |
188 issueNext(address); |
189} 190 191void |
192DMASequencer::ackCallback(const Addr& address) |
193{ |
194 RequestTable::iterator i = m_RequestTable.find(address); 195 assert(i != m_RequestTable.end()); 196 197 issueNext(address); |
198} 199 200void 201DMASequencer::recordRequestType(DMASequencerRequestType requestType) 202{ 203 DPRINTF(RubyStats, "Recorded statistic: %s\n", 204 DMASequencerRequestType_to_string(requestType)); 205} 206 207DMASequencer * 208DMASequencerParams::create() 209{ 210 return new DMASequencer(this); 211} |