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; --- 109 unchanged lines hidden (view full) --- 118 void enqueue(MsgPtr message, Cycles delta); 119 120 //! Updates the delay cycles of the message at the head of the queue, 121 //! removes it from the queue and returns its total delay. 122 Cycles dequeue(); 123 124 void recycle(); 125 bool isEmpty() const { return m_prio_heap.size() == 0; } |
126 bool isStallMapEmpty() { return m_stall_msg_map.size() == 0; } 127 unsigned int getStallMapSize() { return m_stall_msg_map.size(); } |
128 129 void 130 setOrdering(bool order) 131 { 132 m_strict_fifo = order; 133 m_ordering_set = true; 134 } 135 --- 81 unchanged lines hidden --- |