a098fad174
This patch adds some statistics to garnet that record the activity of certain structures in the on-chip network. These statistics, in a later patch, will be used for computing the energy consumed by the on-chip network.
183 lines
5.1 KiB
C++
183 lines
5.1 KiB
C++
/*
|
|
* Copyright (c) 2008 Princeton University
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met: redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer;
|
|
* redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution;
|
|
* neither the name of the copyright holders nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
* Authors: Niket Agarwal
|
|
*/
|
|
|
|
#ifndef __MEM_RUBY_NETWORK_GARNET_FIXED_PIPELINE_INPUT_UNIT_D_HH__
|
|
#define __MEM_RUBY_NETWORK_GARNET_FIXED_PIPELINE_INPUT_UNIT_D_HH__
|
|
|
|
#include <iostream>
|
|
#include <vector>
|
|
|
|
#include "mem/ruby/common/Consumer.hh"
|
|
#include "mem/ruby/network/garnet/fixed-pipeline/CreditLink_d.hh"
|
|
#include "mem/ruby/network/garnet/fixed-pipeline/NetworkLink_d.hh"
|
|
#include "mem/ruby/network/garnet/fixed-pipeline/Router_d.hh"
|
|
#include "mem/ruby/network/garnet/fixed-pipeline/VirtualChannel_d.hh"
|
|
#include "mem/ruby/network/garnet/fixed-pipeline/flitBuffer_d.hh"
|
|
#include "mem/ruby/network/garnet/NetworkHeader.hh"
|
|
|
|
class InputUnit_d : public Consumer
|
|
{
|
|
public:
|
|
InputUnit_d(int id, Router_d *router);
|
|
~InputUnit_d();
|
|
|
|
void wakeup();
|
|
flitBuffer_d* getCreditQueue() { return creditQueue; }
|
|
void print(std::ostream& out) const {};
|
|
|
|
inline int get_inlink_id() { return m_in_link->get_id(); }
|
|
|
|
inline void
|
|
set_vc_state(VC_state_type state, int vc, Cycles curTime)
|
|
{
|
|
m_vcs[vc]->set_state(state, curTime);
|
|
}
|
|
|
|
inline void
|
|
set_enqueue_time(int invc, Cycles time)
|
|
{
|
|
m_vcs[invc]->set_enqueue_time(time);
|
|
}
|
|
|
|
inline Cycles
|
|
get_enqueue_time(int invc)
|
|
{
|
|
return m_vcs[invc]->get_enqueue_time();
|
|
}
|
|
|
|
inline void
|
|
update_credit(int in_vc, int credit)
|
|
{
|
|
m_vcs[in_vc]->update_credit(credit);
|
|
}
|
|
|
|
inline bool
|
|
has_credits(int vc)
|
|
{
|
|
return m_vcs[vc]->has_credits();
|
|
}
|
|
|
|
inline void
|
|
increment_credit(int in_vc, bool free_signal, Cycles curTime)
|
|
{
|
|
flit_d *t_flit = new flit_d(in_vc, free_signal, curTime);
|
|
creditQueue->insert(t_flit);
|
|
m_credit_link->scheduleEventAbsolute(m_router->clockEdge(Cycles(1)));
|
|
}
|
|
|
|
inline int
|
|
get_outvc(int invc)
|
|
{
|
|
return m_vcs[invc]->get_outvc();
|
|
}
|
|
|
|
inline void
|
|
updateRoute(int vc, int outport, Cycles curTime)
|
|
{
|
|
m_vcs[vc]->set_outport(outport);
|
|
m_vcs[vc]->set_state(VC_AB_, curTime);
|
|
}
|
|
|
|
inline void
|
|
grant_vc(int in_vc, int out_vc, Cycles curTime)
|
|
{
|
|
m_vcs[in_vc]->grant_vc(out_vc, curTime);
|
|
}
|
|
|
|
inline flit_d*
|
|
peekTopFlit(int vc)
|
|
{
|
|
return m_vcs[vc]->peekTopFlit();
|
|
}
|
|
|
|
inline flit_d*
|
|
getTopFlit(int vc)
|
|
{
|
|
return m_vcs[vc]->getTopFlit();
|
|
}
|
|
|
|
inline bool
|
|
need_stage(int vc, VC_state_type state, flit_stage stage, Cycles cTime)
|
|
{
|
|
return m_vcs[vc]->need_stage(state, stage, cTime);
|
|
}
|
|
|
|
inline bool
|
|
isReady(int invc, Cycles curTime)
|
|
{
|
|
return m_vcs[invc]->isReady(curTime);
|
|
}
|
|
|
|
inline int
|
|
get_route(int vc)
|
|
{
|
|
return m_vcs[vc]->get_route();
|
|
}
|
|
|
|
inline void
|
|
set_in_link(NetworkLink_d *link)
|
|
{
|
|
m_in_link = link;
|
|
}
|
|
|
|
inline void
|
|
set_credit_link(CreditLink_d *credit_link)
|
|
{
|
|
m_credit_link = credit_link;
|
|
}
|
|
|
|
double get_buf_read_count(unsigned int vnet) const
|
|
{ return m_num_buffer_reads[vnet]; }
|
|
double get_buf_write_count(unsigned int vnet) const
|
|
{ return m_num_buffer_writes[vnet]; }
|
|
|
|
uint32_t functionalWrite(Packet *pkt);
|
|
void resetStats();
|
|
|
|
private:
|
|
int m_id;
|
|
int m_num_vcs;
|
|
int m_vc_per_vnet;
|
|
|
|
Router_d *m_router;
|
|
NetworkLink_d *m_in_link;
|
|
CreditLink_d *m_credit_link;
|
|
flitBuffer_d *creditQueue;
|
|
|
|
// Virtual channels
|
|
std::vector<VirtualChannel_d *> m_vcs;
|
|
|
|
// Statistical variables
|
|
std::vector<double> m_num_buffer_writes;
|
|
std::vector<double> m_num_buffer_reads;
|
|
};
|
|
|
|
#endif // __MEM_RUBY_NETWORK_GARNET_FIXED_PIPELINE_INPUT_UNIT_D_HH__
|