WireBuffer.cc (11108:6342ddf6d733) | WireBuffer.cc (11116:d6fb95dbf3e2) |
---|---|
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; --- 43 unchanged lines hidden (view full) --- 52 53// **************************************************************** 54 55// CONSTRUCTOR 56WireBuffer::WireBuffer(const Params *p) 57 : SimObject(p) 58{ 59 m_msg_counter = 0; | 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; --- 43 unchanged lines hidden (view full) --- 52 53// **************************************************************** 54 55// CONSTRUCTOR 56WireBuffer::WireBuffer(const Params *p) 57 : SimObject(p) 58{ 59 m_msg_counter = 0; |
60 m_ruby_system = p->ruby_system; | |
61} 62 63void 64WireBuffer::init() 65{ 66} 67 68WireBuffer::~WireBuffer() 69{ 70} 71 72void | 60} 61 62void 63WireBuffer::init() 64{ 65} 66 67WireBuffer::~WireBuffer() 68{ 69} 70 71void |
73WireBuffer::enqueue(MsgPtr message, Cycles latency) | 72WireBuffer::enqueue(MsgPtr message, Tick current_time, Tick delta) |
74{ 75 m_msg_counter++; | 73{ 74 m_msg_counter++; |
76 Cycles current_time = m_ruby_system->curCycle(); 77 Cycles arrival_time = current_time + latency; | 75 Tick arrival_time = current_time + delta; |
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-> | 76 assert(arrival_time > current_time); 77 78 Message* msg_ptr = message.get(); 79 msg_ptr->setLastEnqueueTime(arrival_time); 80 m_message_queue.push_back(message); 81 if (m_consumer_ptr != NULL) { 82 m_consumer_ptr-> |
85 scheduleEventAbsolute(m_ruby_system->clockPeriod() * arrival_time); | 83 scheduleEventAbsolute(arrival_time); |
86 } else { 87 panic("No Consumer for WireBuffer! %s\n", *this); 88 } 89} 90 91void | 84 } else { 85 panic("No Consumer for WireBuffer! %s\n", *this); 86 } 87} 88 89void |
92WireBuffer::dequeue() | 90WireBuffer::dequeue(Tick current_time) |
93{ | 91{ |
94 assert(isReady()); | 92 assert(isReady(current_time)); |
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 | 93 pop_heap(m_message_queue.begin(), m_message_queue.end(), 94 greater<MsgPtr>()); 95 m_message_queue.pop_back(); 96} 97 98const Message* 99WireBuffer::peek() 100{ 101 Message* msg_ptr = m_message_queue.front().get(); 102 assert(msg_ptr != NULL); 103 return msg_ptr; 104} 105 106void |
109WireBuffer::recycle() | 107WireBuffer::recycle(Tick current_time, Tick recycle_latency) |
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. | 108{ 109 // Because you don't want anything reordered, make sure the recycle latency 110 // is just 1 cycle. As a result, you really want to use this only in 111 // Wire-like situations because you don't want to deadlock as a result of 112 // being stuck behind something if you're not actually supposed to. |
115 assert(isReady()); | 113 assert(isReady(current_time)); |
116 MsgPtr node = m_message_queue.front(); 117 pop_heap(m_message_queue.begin(), m_message_queue.end(), greater<MsgPtr>()); 118 | 114 MsgPtr node = m_message_queue.front(); 115 pop_heap(m_message_queue.begin(), m_message_queue.end(), greater<MsgPtr>()); 116 |
119 node->setLastEnqueueTime(m_ruby_system->curCycle() + Cycles(1)); | 117 Tick future_time = current_time + recycle_latency; 118 node->setLastEnqueueTime(future_time); 119 |
120 m_message_queue.back() = node; 121 push_heap(m_message_queue.begin(), m_message_queue.end(), 122 greater<MsgPtr>()); 123 m_consumer_ptr-> | 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(m_ruby_system->clockPeriod() 125 * (m_ruby_system->curCycle() + Cycles(1))); | 124 scheduleEventAbsolute(future_time); |
126} 127 128bool | 125} 126 127bool |
129WireBuffer::isReady() | 128WireBuffer::isReady(Tick current_time) |
130{ 131 return ((!m_message_queue.empty()) && | 129{ 130 return ((!m_message_queue.empty()) && |
132 (m_message_queue.front()->getLastEnqueueTime() <= 133 m_ruby_system->curCycle())); | 131 (m_message_queue.front()->getLastEnqueueTime() <= current_time)); |
134} 135 136void 137WireBuffer::print(ostream& out) const 138{ 139} 140 141void 142WireBuffer::wakeup() 143{ 144} 145 146WireBuffer * 147RubyWireBufferParams::create() 148{ 149 return new WireBuffer(this); 150} | 132} 133 134void 135WireBuffer::print(ostream& out) const 136{ 137} 138 139void 140WireBuffer::wakeup() 141{ 142} 143 144WireBuffer * 145RubyWireBufferParams::create() 146{ 147 return new WireBuffer(this); 148} |