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/Sequencer.hh" 31#include "mem/ruby/system/System.hh" 32 33AbstractController::AbstractController(const Params *p) 34 : ClockedObject(p), Consumer(this), m_fully_busy_cycles(0), 35 m_request_count(0) 36{ 37 m_version = p->version; 38 m_transitions_per_cycle = p->transitions_per_cycle; 39 m_buffer_size = p->buffer_size; 40 m_recycle_latency = p->recycle_latency; 41 m_number_of_TBEs = p->number_of_TBEs; 42 m_is_blocking = false; 43 44 if (m_version == 0) { 45 // Combine the statistics from all controllers 46 // of this particular type. 47 Stats::registerDumpCallback(new StatsCallback(this)); 48 } 49} 50 51void 52AbstractController::init() 53{ 54 params()->ruby_system->registerAbstractController(this); 55} 56 57void 58AbstractController::clearStats() 59{ 60 m_requestProfileMap.clear(); 61 m_request_count = 0; 62 63 m_delayHistogram.clear(); 64 65 uint32_t size = Network::getNumberOfVirtualNetworks(); 66 m_delayVCHistogram.resize(size); 67 for (uint32_t i = 0; i < size; i++) { 68 m_delayVCHistogram[i].clear(); 69 } 70 71 Sequencer *seq = getSequencer(); 72 if (seq != NULL) { 73 seq->clearStats(); 74 } 75} 76 77void 78AbstractController::profileRequest(const std::string &request) 79{ 80 m_request_count++; 81 82 // if it doesn't exist, conveniently, it will be created with the 83 // default value which is 0 84 m_requestProfileMap[request]++; 85} 86 87void 88AbstractController::profileMsgDelay(uint32_t virtualNetwork, Cycles delay) 89{ 90 assert(virtualNetwork < m_delayVCHistogram.size()); 91 m_delayHistogram.add(delay); 92 m_delayVCHistogram[virtualNetwork].add(delay); 93} 94 95void 96AbstractController::connectWithPeer(AbstractController *c) 97{ 98 getQueuesFromPeer(c); 99 c->getQueuesFromPeer(this); 100} 101 102void 103AbstractController::stallBuffer(MessageBuffer* buf, Address addr) 104{ 105 if (m_waiting_buffers.count(addr) == 0) { 106 MsgVecType* msgVec = new MsgVecType;
| 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/Sequencer.hh" 31#include "mem/ruby/system/System.hh" 32 33AbstractController::AbstractController(const Params *p) 34 : ClockedObject(p), Consumer(this), m_fully_busy_cycles(0), 35 m_request_count(0) 36{ 37 m_version = p->version; 38 m_transitions_per_cycle = p->transitions_per_cycle; 39 m_buffer_size = p->buffer_size; 40 m_recycle_latency = p->recycle_latency; 41 m_number_of_TBEs = p->number_of_TBEs; 42 m_is_blocking = false; 43 44 if (m_version == 0) { 45 // Combine the statistics from all controllers 46 // of this particular type. 47 Stats::registerDumpCallback(new StatsCallback(this)); 48 } 49} 50 51void 52AbstractController::init() 53{ 54 params()->ruby_system->registerAbstractController(this); 55} 56 57void 58AbstractController::clearStats() 59{ 60 m_requestProfileMap.clear(); 61 m_request_count = 0; 62 63 m_delayHistogram.clear(); 64 65 uint32_t size = Network::getNumberOfVirtualNetworks(); 66 m_delayVCHistogram.resize(size); 67 for (uint32_t i = 0; i < size; i++) { 68 m_delayVCHistogram[i].clear(); 69 } 70 71 Sequencer *seq = getSequencer(); 72 if (seq != NULL) { 73 seq->clearStats(); 74 } 75} 76 77void 78AbstractController::profileRequest(const std::string &request) 79{ 80 m_request_count++; 81 82 // if it doesn't exist, conveniently, it will be created with the 83 // default value which is 0 84 m_requestProfileMap[request]++; 85} 86 87void 88AbstractController::profileMsgDelay(uint32_t virtualNetwork, Cycles delay) 89{ 90 assert(virtualNetwork < m_delayVCHistogram.size()); 91 m_delayHistogram.add(delay); 92 m_delayVCHistogram[virtualNetwork].add(delay); 93} 94 95void 96AbstractController::connectWithPeer(AbstractController *c) 97{ 98 getQueuesFromPeer(c); 99 c->getQueuesFromPeer(this); 100} 101 102void 103AbstractController::stallBuffer(MessageBuffer* buf, Address addr) 104{ 105 if (m_waiting_buffers.count(addr) == 0) { 106 MsgVecType* msgVec = new MsgVecType;
|