src/mem/ruby/slicc_interface/AbstractController.cc

   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
  33 AbstractController::AbstractController(const Params *p)
  34     : ClockedObject(p), Consumer(this)
  35 {
  36     m_version = p->version;
  37     m_clusterID = p->cluster_id;
  38
  39     m_transitions_per_cycle = p->transitions_per_cycle;
  40     m_buffer_size = p->buffer_size;
  41     m_recycle_latency = p->recycle_latency;
  42     m_number_of_TBEs = p->number_of_TBEs;
  43     m_is_blocking = false;
  44
  45     if (m_version == 0) {
  46         // Combine the statistics from all controllers
  47         // of this particular type.
  48         Stats::registerDumpCallback(new StatsCallback(this));
  49     }
  50 }
  51
  52 void
  53 AbstractController::init()
  54 {
  55     params()->ruby_system->registerAbstractController(this);
  56     m_delayHistogram.init(10);
  57     uint32_t size = Network::getNumberOfVirtualNetworks();
  58     for (uint32_t i = 0; i < size; i++) {
  59         m_delayVCHistogram.push_back(new Stats::Histogram());
  60         m_delayVCHistogram[i]->init(10);
  61     }
  62 }
  63
  64 void
  65 AbstractController::resetStats()
  66 {
  67     m_delayHistogram.reset();
  68     uint32_t size = Network::getNumberOfVirtualNetworks();
  69     for (uint32_t i = 0; i < size; i++) {
  70         m_delayVCHistogram[i]->reset();
  71     }
  72 }
  73
  74 void
  75 AbstractController::regStats()
  76 {
  77     m_fully_busy_cycles
  78         .name(name() + ".fully_busy_cycles")
  79         .desc("cycles for which number of transistions == max transitions")
  80         .flags(Stats::nozero);
  81 }
  82
  83 void
  84 AbstractController::profileMsgDelay(uint32_t virtualNetwork, Cycles delay)
  85 {
  86     assert(virtualNetwork < m_delayVCHistogram.size());
  87     m_delayHistogram.sample(delay);
  88     m_delayVCHistogram[virtualNetwork]->sample(delay);
  89 }
  90
  91 void
  92 AbstractController::connectWithPeer(AbstractController *c)
  93 {
  94     getQueuesFromPeer(c);
  95     c->getQueuesFromPeer(this);
  96 }
  97
  98 void
  99 AbstractController::stallBuffer(MessageBuffer* buf, Address addr)
 100 {
 101     if (m_waiting_buffers.count(addr) == 0) {
 102         MsgVecType* msgVec = new MsgVecType;
 103         msgVec->resize(m_in_ports, NULL);
 104         m_waiting_buffers[addr] = msgVec;
 105     }
 106     (*(m_waiting_buffers[addr]))[m_cur_in_port] = buf;
 107 }
 108
 109 void
 110 AbstractController::wakeUpBuffers(Address addr)
 111 {
 112     if (m_waiting_buffers.count(addr) > 0) {
 113         //
 114         // Wake up all possible lower rank (i.e. lower priority) buffers that could
 115         // be waiting on this message.
 116         //
 117         for (int in_port_rank = m_cur_in_port - 1;
 118              in_port_rank >= 0;
 119              in_port_rank--) {
 120             if ((*(m_waiting_buffers[addr]))[in_port_rank] != NULL) {
 121                 (*(m_waiting_buffers[addr]))[in_port_rank]->reanalyzeMessages(addr);
 122             }
 123         }
 124         delete m_waiting_buffers[addr];
 125         m_waiting_buffers.erase(addr);
 126     }
 127 }
 128
 129 void
 130 AbstractController::wakeUpAllBuffers(Address addr)
 131 {
 132     if (m_waiting_buffers.count(addr) > 0) {
 133         //
 134         // Wake up all possible lower rank (i.e. lower priority) buffers that could
 135         // be waiting on this message.
 136         //
 137         for (int in_port_rank = m_in_ports - 1;
 138              in_port_rank >= 0;
 139              in_port_rank--) {
 140             if ((*(m_waiting_buffers[addr]))[in_port_rank] != NULL) {
 141                 (*(m_waiting_buffers[addr]))[in_port_rank]->reanalyzeMessages(addr);
 142             }
 143         }
 144         delete m_waiting_buffers[addr];
 145         m_waiting_buffers.erase(addr);
 146     }
 147 }
 148
 149 void
 150 AbstractController::wakeUpAllBuffers()
 151 {
 152     //
 153     // Wake up all possible buffers that could be waiting on any message.
 154     //
 155
 156     std::vector<MsgVecType*> wokeUpMsgVecs;
 157
 158     if(m_waiting_buffers.size() > 0) {
 159         for (WaitingBufType::iterator buf_iter = m_waiting_buffers.begin();
 160              buf_iter != m_waiting_buffers.end();
 161              ++buf_iter) {
 162              for (MsgVecType::iterator vec_iter = buf_iter->second->begin();
 163                   vec_iter != buf_iter->second->end();
 164                   ++vec_iter) {
 165                   if (*vec_iter != NULL) {
 166                       (*vec_iter)->reanalyzeAllMessages();
 167                   }
 168              }
 169              wokeUpMsgVecs.push_back(buf_iter->second);
 170         }
 171
 172         for (std::vector<MsgVecType*>::iterator wb_iter = wokeUpMsgVecs.begin();
 173              wb_iter != wokeUpMsgVecs.end();
 174              ++wb_iter) {
 175              delete (*wb_iter);
 176         }
 177
 178         m_waiting_buffers.clear();
 179     }
 180 }
 181
 182 void
 183 AbstractController::blockOnQueue(Address addr, MessageBuffer* port)
 184 {
 185     m_is_blocking = true;
 186     m_block_map[addr] = port;
 187 }
 188
 189 void
 190 AbstractController::unblock(Address addr)
 191 {
 192     m_block_map.erase(addr);
 193     if (m_block_map.size() == 0) {
 194        m_is_blocking = false;
 195     }
 196 }