ruby/network/MessageBuffer.cc

80 MessageBuffer::areNSlotsAvailable(unsigned int n, Tick current_time)
95     if (m_time_last_time_pop < current_time) {
100         if (m_time_last_time_enqueue < current_time) {
150 MessageBuffer::enqueue(MsgPtr message, Tick current_time, Tick delta)
153     if (m_time_last_time_enqueue < current_time) {
155         m_time_last_time_enqueue = current_time;
170         arrival_time = current_time + delta;
174             if (m_last_arrival_time < current_time) {
175                 m_last_arrival_time = current_time;
179             arrival_time = current_time + random_time();
184     assert(arrival_time > current_time);
189                   *this, name(), current_time, delta, arrival_time,
203     assert(current_time >= msg_ptr->getLastEnqueueTime() &&
206     msg_ptr->updateDelayedTicks(current_time);
226 MessageBuffer::dequeue(Tick current_time, bool decrement_messages)
229     assert(isReady(current_time));
235     message->updateDelayedTicks(current_time);
242     if (m_time_last_time_pop < current_time) {
245         m_time_last_time_pop = current_time;
290 MessageBuffer::recycle(Tick current_time, Tick recycle_latency)
293     assert(isReady(current_time));
297     Tick future_time = current_time + recycle_latency;
326 MessageBuffer::reanalyzeMessages(Addr addr, Tick current_time)
339     reanalyzeList(m_stall_msg_map[addr], current_time);
344 MessageBuffer::reanalyzeAllMessages(Tick current_time)
358         reanalyzeList(map_iter->second, current_time);
364 MessageBuffer::stallMessage(Addr addr, Tick current_time)
367     assert(isReady(current_time));
373     dequeue(current_time, false);
399 MessageBuffer::isReady(Tick current_time) const
402         (m_prio_heap.front()->getLastEnqueueTime() <= current_time));