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;

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

132 //! Consumer to signal a wakeup(), can be NULL
133 Consumer* m_consumer;
134 std::vector<MsgPtr> m_prio_heap;
135
136 // use a std::map for the stalled messages as this container is
137 // sorted and ensures a well-defined iteration order
138 typedef std::map<Addr, std::list<MsgPtr> > StallMsgMapType;
139
140 StallMsgMapType m_stall_msg_map;
141
142 const unsigned int m_max_size;
143 Tick m_time_last_time_size_checked;
144 unsigned int m_size_last_time_size_checked;
145
146 // variables used so enqueues appear to happen immediately, while
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;

--- 26 unchanged lines hidden ---