1/*
2 * Copyright (c) 2010 Advanced Micro Devices, Inc.
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;

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

72void
73WireBuffer::enqueue(MsgPtr message, Cycles latency)
74{
75 m_msg_counter++;
76 Cycles current_time = g_system_ptr->curCycle();
77 Cycles arrival_time = current_time + latency;
78 assert(arrival_time > current_time);
79
80 Message* msg_ptr = message.get();
81 msg_ptr->setLastEnqueueTime(arrival_time);
82 m_message_queue.push_back(message);
83 if (m_consumer_ptr != NULL) {
84 m_consumer_ptr->
85 scheduleEventAbsolute(g_system_ptr->clockPeriod() * arrival_time);
86 } else {
87 panic("No Consumer for WireBuffer! %s\n", *this);
88 }
89}
90
91void
92WireBuffer::dequeue()
93{
94 assert(isReady());
95 pop_heap(m_message_queue.begin(), m_message_queue.end(),
96 greater<MsgPtr>());
97 m_message_queue.pop_back();
98}
99
100const Message*
101WireBuffer::peek()
102{
103 Message* msg_ptr = m_message_queue.front().get();
104 assert(msg_ptr != NULL);
105 return msg_ptr;
106}
107
108void
109WireBuffer::recycle()
110{
111 // Because you don't want anything reordered, make sure the recycle latency
112 // is just 1 cycle. As a result, you really want to use this only in
113 // Wire-like situations because you don't want to deadlock as a result of
114 // being stuck behind something if you're not actually supposed to.
115 assert(isReady());
116 MsgPtr node = m_message_queue.front();
117 pop_heap(m_message_queue.begin(), m_message_queue.end(), greater<MsgPtr>());
118
119 node->setLastEnqueueTime(g_system_ptr->curCycle() + Cycles(1));
120 m_message_queue.back() = node;
121 push_heap(m_message_queue.begin(), m_message_queue.end(),
122 greater<MsgPtr>());
123 m_consumer_ptr->
124 scheduleEventAbsolute(g_system_ptr->curCycle() + Cycles(1));
125}
126
127bool
128WireBuffer::isReady()
129{
130 return ((!m_message_queue.empty()) &&
131 (m_message_queue.front()->getLastEnqueueTime() <=
132 g_system_ptr->curCycle()));
133}
134
135void
136WireBuffer::print(ostream& out) const
137{
138}
139
140void
141WireBuffer::wakeup()
142{
143}
144
145WireBuffer *
146RubyWireBufferParams::create()
147{
148 return new WireBuffer(this);
149}