1/* 2 * Copyright (c) 2009 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; --- 132 unchanged lines hidden (view full) --- 141 typedef std::vector<MessageBuffer*> MsgVecType; 142 typedef std::map< Address, MsgVecType* > WaitingBufType; 143 WaitingBufType m_waiting_buffers; 144 145 unsigned int m_in_ports; 146 unsigned int m_cur_in_port; 147 int m_number_of_TBEs; 148 int m_transitions_per_cycle; |
149 unsigned int m_buffer_size; |
150 Cycles m_recycle_latency; 151 152 //! Map from physical network number to the Message Buffer. 153 std::map<uint32_t, MessageBuffer*> peerQueueMap; 154 155 //! Counter for the number of cycles when the transitions carried out 156 //! were equal to the maximum allowed 157 Stats::Scalar m_fully_busy_cycles; --- 21 unchanged lines hidden --- |