1/*
2 * Copyright (c) 2011-2014 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;

--- 46 unchanged lines hidden (view full) ---

55{
56 params()->ruby_system->registerAbstractController(this);
57 m_delayHistogram.init(10);
58 uint32_t size = Network::getNumberOfVirtualNetworks();
59 for (uint32_t i = 0; i < size; i++) {
60 m_delayVCHistogram.push_back(new Stats::Histogram());
61 m_delayVCHistogram[i]->init(10);
62 }
63 if (getMemoryQueue()) {
64 getMemoryQueue()->setSender(this);
65 }
63}
64
65void
66AbstractController::resetStats()
67{
68 m_delayHistogram.reset();
69 uint32_t size = Network::getNumberOfVirtualNetworks();
70 for (uint32_t i = 0; i < size; i++) {

--- 39 unchanged lines hidden (view full) ---

110 //
111 // Wake up all possible lower rank (i.e. lower priority) buffers that could
112 // be waiting on this message.
113 //
114 for (int in_port_rank = m_cur_in_port - 1;
115 in_port_rank >= 0;
116 in_port_rank--) {
117 if ((*(m_waiting_buffers[addr]))[in_port_rank] != NULL) {
121 (*(m_waiting_buffers[addr]))[in_port_rank]->reanalyzeMessages(addr);
118 (*(m_waiting_buffers[addr]))[in_port_rank]->
119 reanalyzeMessages(addr, clockEdge());
120 }
121 }
122 delete m_waiting_buffers[addr];
123 m_waiting_buffers.erase(addr);
124 }
125}
126
127void
128AbstractController::wakeUpAllBuffers(Addr addr)
129{
130 if (m_waiting_buffers.count(addr) > 0) {
131 //
132 // Wake up all possible lower rank (i.e. lower priority) buffers that could
133 // be waiting on this message.
134 //
135 for (int in_port_rank = m_in_ports - 1;
136 in_port_rank >= 0;
137 in_port_rank--) {
138 if ((*(m_waiting_buffers[addr]))[in_port_rank] != NULL) {
141 (*(m_waiting_buffers[addr]))[in_port_rank]->reanalyzeMessages(addr);
139 (*(m_waiting_buffers[addr]))[in_port_rank]->
140 reanalyzeMessages(addr, clockEdge());
141 }
142 }
143 delete m_waiting_buffers[addr];
144 m_waiting_buffers.erase(addr);
145 }
146}
147
148void

--- 13 unchanged lines hidden (view full) ---

162 for (MsgVecType::iterator vec_iter = buf_iter->second->begin();
163 vec_iter != buf_iter->second->end();
164 ++vec_iter) {
165 //
166 // Make sure the MessageBuffer has not already be reanalyzed
167 //
168 if (*vec_iter != NULL &&
169 (wokeUpMsgBufs.count(*vec_iter) == 0)) {
171 (*vec_iter)->reanalyzeAllMessages();
170 (*vec_iter)->reanalyzeAllMessages(clockEdge());
171 wokeUpMsgBufs.insert(*vec_iter);
172 }
173 }
174 wokeUpMsgVecs.push_back(buf_iter->second);
175 }
176
177 for (std::vector<MsgVecType*>::iterator wb_iter = wokeUpMsgVecs.begin();
178 wb_iter != wokeUpMsgVecs.end();

--- 143 unchanged lines hidden (view full) ---

322 RubySystem::getBlockSizeBytes());
323 } else if (pkt->isWrite()) {
324 (*msg).m_Type = MemoryRequestType_MEMORY_WB;
325 (*msg).m_MessageSize = MessageSizeType_Writeback_Control;
326 } else {
327 panic("Incorrect packet type received from memory controller!");
328 }
329
331 getMemoryQueue()->enqueue(msg);
330 getMemoryQueue()->enqueue(msg, clockEdge(), cyclesToTicks(Cycles(1)));
331 delete pkt;
332}
333
334bool
335AbstractController::MemoryPort::recvTimingResp(PacketPtr pkt)
336{
337 controller->recvTimingResp(pkt);
338 return true;
339}
340
341AbstractController::MemoryPort::MemoryPort(const std::string &_name,
342 AbstractController *_controller,
343 const std::string &_label)
344 : QueuedMasterPort(_name, _controller, reqQueue, snoopRespQueue),
345 reqQueue(*_controller, *this, _label),
346 snoopRespQueue(*_controller, *this, _label),
347 controller(_controller)
348{
349}