AbstractController.cc revision 9596:aa73a81cf92c
1/* 2 * Copyright (c) 2011 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; 9 * redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the 11 * documentation and/or other materials provided with the distribution; 12 * neither the name of the copyright holders nor the names of its 13 * contributors may be used to endorse or promote products derived from 14 * this software without specific prior written permission. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 */ 28 29#include "mem/ruby/slicc_interface/AbstractController.hh" 30#include "mem/ruby/system/System.hh" 31 32AbstractController::AbstractController(const Params *p) 33 : ClockedObject(p), Consumer(this), m_fully_busy_cycles(0), 34 m_request_count(0) 35{ 36 m_version = p->version; 37 m_transitions_per_cycle = p->transitions_per_cycle; 38 m_buffer_size = p->buffer_size; 39 m_recycle_latency = p->recycle_latency; 40 m_number_of_TBEs = p->number_of_TBEs; 41 m_is_blocking = false; 42} 43 44void 45AbstractController::init() 46{ 47 params()->ruby_system->registerAbstractController(this); 48} 49 50void 51AbstractController::clearStats() 52{ 53 m_requestProfileMap.clear(); 54 m_request_count = 0; 55 56 m_delayHistogram.clear(); 57 58 uint32_t size = Network::getNumberOfVirtualNetworks(); 59 m_delayVCHistogram.resize(size); 60 for (uint32_t i = 0; i < size; i++) { 61 m_delayVCHistogram[i].clear(); 62 } 63} 64 65void 66AbstractController::profileRequest(const std::string &request) 67{ 68 m_request_count++; 69 70 // if it doesn't exist, conveniently, it will be created with the 71 // default value which is 0 72 m_requestProfileMap[request]++; 73} 74 75void 76AbstractController::profileMsgDelay(uint32_t virtualNetwork, Cycles delay) 77{ 78 assert(virtualNetwork < m_delayVCHistogram.size()); 79 m_delayHistogram.add(delay); 80 m_delayVCHistogram[virtualNetwork].add(delay); 81} 82 83void 84AbstractController::connectWithPeer(AbstractController *c) 85{ 86 getQueuesFromPeer(c); 87 c->getQueuesFromPeer(this); 88} 89 90void 91AbstractController::stallBuffer(MessageBuffer* buf, Address addr) 92{ 93 if (m_waiting_buffers.count(addr) == 0) { 94 MsgVecType* msgVec = new MsgVecType; 95 msgVec->resize(m_max_in_port_rank, NULL); 96 m_waiting_buffers[addr] = msgVec; 97 } 98 (*(m_waiting_buffers[addr]))[m_cur_in_port_rank] = buf; 99} 100 101void 102AbstractController::wakeUpBuffers(Address addr) 103{ 104 if (m_waiting_buffers.count(addr) > 0) { 105 // 106 // Wake up all possible lower rank (i.e. lower priority) buffers that could 107 // be waiting on this message. 108 // 109 for (int in_port_rank = m_cur_in_port_rank - 1; 110 in_port_rank >= 0; 111 in_port_rank--) { 112 if ((*(m_waiting_buffers[addr]))[in_port_rank] != NULL) { 113 (*(m_waiting_buffers[addr]))[in_port_rank]->reanalyzeMessages(addr); 114 } 115 } 116 delete m_waiting_buffers[addr]; 117 m_waiting_buffers.erase(addr); 118 } 119} 120 121void 122AbstractController::wakeUpAllBuffers(Address addr) 123{ 124 if (m_waiting_buffers.count(addr) > 0) { 125 // 126 // Wake up all possible lower rank (i.e. lower priority) buffers that could 127 // be waiting on this message. 128 // 129 for (int in_port_rank = m_max_in_port_rank - 1; 130 in_port_rank >= 0; 131 in_port_rank--) { 132 if ((*(m_waiting_buffers[addr]))[in_port_rank] != NULL) { 133 (*(m_waiting_buffers[addr]))[in_port_rank]->reanalyzeMessages(addr); 134 } 135 } 136 delete m_waiting_buffers[addr]; 137 m_waiting_buffers.erase(addr); 138 } 139} 140 141void 142AbstractController::wakeUpAllBuffers() 143{ 144 // 145 // Wake up all possible buffers that could be waiting on any message. 146 // 147 148 std::vector<MsgVecType*> wokeUpMsgVecs; 149 150 if(m_waiting_buffers.size() > 0) { 151 for (WaitingBufType::iterator buf_iter = m_waiting_buffers.begin(); 152 buf_iter != m_waiting_buffers.end(); 153 ++buf_iter) { 154 for (MsgVecType::iterator vec_iter = buf_iter->second->begin(); 155 vec_iter != buf_iter->second->end(); 156 ++vec_iter) { 157 if (*vec_iter != NULL) { 158 (*vec_iter)->reanalyzeAllMessages(); 159 } 160 } 161 wokeUpMsgVecs.push_back(buf_iter->second); 162 } 163 164 for (std::vector<MsgVecType*>::iterator wb_iter = wokeUpMsgVecs.begin(); 165 wb_iter != wokeUpMsgVecs.end(); 166 ++wb_iter) { 167 delete (*wb_iter); 168 } 169 170 m_waiting_buffers.clear(); 171 } 172} 173