src/mem/ruby/network/garnet/flexible-pipeline/flitBuffer.cc

   1 /*
   2  * Copyright (c) 2008 Princeton University
   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  * Authors: Niket Agarwal
  29  */
  30
  31 #include "mem/ruby/network/garnet/flexible-pipeline/flitBuffer.hh"
  32
  33 flitBuffer::flitBuffer()
  34 {
  35         max_size = INFINITE_;
  36 }
  37
  38 flitBuffer::flitBuffer(int maximum_size)
  39 {
  40         max_size = maximum_size;
  41 }
  42
  43 bool flitBuffer::isEmpty()
  44 {
  45         return (m_buffer.size() == 0);
  46 }
  47
  48 bool flitBuffer::isReady()
  49 {
  50         if(m_buffer.size() != 0 )
  51         {
  52                 flit *t_flit = m_buffer.peekMin();
  53                 if(t_flit->get_time() <= g_eventQueue_ptr->getTime())
  54                         return true;
  55         }
  56         return false;
  57 }
  58
  59 bool flitBuffer::isReadyForNext()
  60 {
  61         if(m_buffer.size() != 0 )
  62         {
  63                 flit *t_flit = m_buffer.peekMin();
  64                 if(t_flit->get_time() <= (g_eventQueue_ptr->getTime() + 1))
  65                         return true;
  66         }
  67         return false;
  68 }
  69
  70 bool flitBuffer::isFull()
  71 {
  72         return (m_buffer.size() >= max_size);
  73 }
  74
  75 void flitBuffer::setMaxSize(int maximum)
  76 {
  77         max_size = maximum;
  78 }
  79
  80 flit* flitBuffer:: getTopFlit()
  81 {
  82         return m_buffer.extractMin();
  83 }
  84
  85 flit* flitBuffer::peekTopFlit()
  86 {
  87         return m_buffer.peekMin();
  88 }
  89
  90 void flitBuffer::insert(flit *flt)
  91 {
  92         m_buffer.insert(flt);
  93 }
  94
  95 void flitBuffer::print(std::ostream& out) const
  96 {
  97         out << "[flitBuffer: ";
  98         out << m_buffer.size() << "] " << std::endl;
  99 }