1/* 2 * Copyright (c) 1999-2008 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; --- 102 unchanged lines hidden (view full) --- 111 112 void clear(); 113 void print(std::ostream& out) const; 114 void clearStats() { m_not_avail_count = 0; m_msg_counter = 0; } 115 116 void setIncomingLink(int link_id) { m_input_link_id = link_id; } 117 void setVnet(int net) { m_vnet_id = net; } 118 |
119 void regStats(); 120 |
121 // Function for figuring out if any of the messages in the buffer need 122 // to be updated with the data from the packet. 123 // Return value indicates the number of messages that were updated. 124 // This required for debugging the code. 125 uint32_t functionalWrite(Packet *pkt); 126 127 private: 128 void reanalyzeList(std::list<MsgPtr> &, Tick); --- 18 unchanged lines hidden (view full) --- 147 // pop happen the next cycle 148 Tick m_time_last_time_enqueue; 149 Tick m_time_last_time_pop; 150 Tick m_last_arrival_time; 151 152 unsigned int m_size_at_cycle_start; 153 unsigned int m_msgs_this_cycle; 154 |
155 Stats::Scalar m_not_avail_count; // count the # of times I didn't have N 156 // slots available |
157 uint64_t m_msg_counter; 158 int m_priority_rank; 159 const bool m_strict_fifo; 160 const bool m_randomization; 161 162 int m_input_link_id; 163 int m_vnet_id; 164}; --- 12 unchanged lines hidden --- |