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 // Function for figuring out if any of the messages in the buffer need
120 // to be updated with the data from the packet.
121 // Return value indicates the number of messages that were updated.
122 // This required for debugging the code.
123 uint32_t functionalWrite(Packet *pkt);
124
125 private:
126 void reanalyzeList(std::list<MsgPtr> &, Tick);

--- 18 unchanged lines hidden (view full) ---

145 // pop happen the next cycle
146 Tick m_time_last_time_enqueue;
147 Tick m_time_last_time_pop;
148 Tick m_last_arrival_time;
149
150 unsigned int m_size_at_cycle_start;
151 unsigned int m_msgs_this_cycle;
152
153 int m_not_avail_count; // count the # of times I didn't have N
154 // slots available
155 uint64_t m_msg_counter;
156 int m_priority_rank;
157 const bool m_strict_fifo;
158 const bool m_randomization;
159
160 int m_input_link_id;
161 int m_vnet_id;
162};

--- 12 unchanged lines hidden ---