| /* |
| * Copyright (c) 2010 Advanced Micro Devices, Inc. |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions are |
| * met: redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer; |
| * redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution; |
| * neither the name of the copyright holders nor the names of its |
| * contributors may be used to endorse or promote products derived from |
| * this software without specific prior written permission. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| * |
| * Author: Lisa Hsu |
| * |
| */ |
| |
| #include "mem/ruby/structures/WireBuffer.hh" |
| |
| #include <algorithm> |
| #include <functional> |
| |
| #include "base/cprintf.hh" |
| #include "base/stl_helpers.hh" |
| #include "mem/ruby/system/RubySystem.hh" |
| |
| namespace gem5 |
| { |
| |
| namespace ruby |
| { |
| |
| // Output operator definition |
| |
| std::ostream& |
| operator<<(std::ostream& out, const WireBuffer& obj) |
| { |
| obj.print(out); |
| out << std::flush; |
| return out; |
| } |
| |
| |
| // **************************************************************** |
| |
| // CONSTRUCTOR |
| WireBuffer::WireBuffer(const Params &p) |
| : SimObject(p) |
| { |
| m_msg_counter = 0; |
| } |
| |
| void |
| WireBuffer::init() |
| { |
| } |
| |
| WireBuffer::~WireBuffer() |
| { |
| } |
| |
| void |
| WireBuffer::enqueue(MsgPtr message, Tick current_time, Tick delta) |
| { |
| m_msg_counter++; |
| Tick arrival_time = current_time + delta; |
| assert(arrival_time > current_time); |
| |
| Message* msg_ptr = message.get(); |
| msg_ptr->setLastEnqueueTime(arrival_time); |
| m_message_queue.push_back(message); |
| if (m_consumer_ptr != NULL) { |
| m_consumer_ptr-> |
| scheduleEventAbsolute(arrival_time); |
| } else { |
| panic("No Consumer for WireBuffer! %s\n", *this); |
| } |
| } |
| |
| void |
| WireBuffer::dequeue(Tick current_time) |
| { |
| assert(isReady(current_time)); |
| pop_heap(m_message_queue.begin(), m_message_queue.end(), |
| std::greater<MsgPtr>()); |
| m_message_queue.pop_back(); |
| } |
| |
| const Message* |
| WireBuffer::peek() |
| { |
| Message* msg_ptr = m_message_queue.front().get(); |
| assert(msg_ptr != NULL); |
| return msg_ptr; |
| } |
| |
| void |
| WireBuffer::recycle(Tick current_time, Tick recycle_latency) |
| { |
| // Because you don't want anything reordered, make sure the recycle latency |
| // is just 1 cycle. As a result, you really want to use this only in |
| // Wire-like situations because you don't want to deadlock as a result of |
| // being stuck behind something if you're not actually supposed to. |
| assert(isReady(current_time)); |
| MsgPtr node = m_message_queue.front(); |
| pop_heap(m_message_queue.begin(), m_message_queue.end(), |
| std::greater<MsgPtr>()); |
| |
| Tick future_time = current_time + recycle_latency; |
| node->setLastEnqueueTime(future_time); |
| |
| m_message_queue.back() = node; |
| push_heap(m_message_queue.begin(), m_message_queue.end(), |
| std::greater<MsgPtr>()); |
| m_consumer_ptr-> |
| scheduleEventAbsolute(future_time); |
| } |
| |
| bool |
| WireBuffer::isReady(Tick current_time) |
| { |
| return ((!m_message_queue.empty()) && |
| (m_message_queue.front()->getLastEnqueueTime() <= current_time)); |
| } |
| |
| void |
| WireBuffer::print(std::ostream& out) const |
| { |
| } |
| |
| void |
| WireBuffer::wakeup() |
| { |
| } |
| |
| } // namespace ruby |
| } // namespace gem5 |