MessageBuffer.cc (10837:ecbab2522757) | MessageBuffer.cc (10893:f567e80c0714) |
---|---|
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; --- 108 unchanged lines hidden (view full) --- 117} 118 119const Message* 120MessageBuffer::peek() const 121{ 122 DPRINTF(RubyQueue, "Peeking at head of queue.\n"); 123 assert(isReady()); 124 | 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; --- 108 unchanged lines hidden (view full) --- 117} 118 119const Message* 120MessageBuffer::peek() const 121{ 122 DPRINTF(RubyQueue, "Peeking at head of queue.\n"); 123 assert(isReady()); 124 |
125 const Message* msg_ptr = m_prio_heap.front().m_msgptr.get(); | 125 const Message* msg_ptr = m_prio_heap.front().get(); |
126 assert(msg_ptr); 127 128 DPRINTF(RubyQueue, "Message: %s\n", (*msg_ptr)); 129 return msg_ptr; 130} 131 132// FIXME - move me somewhere else 133Cycles --- 65 unchanged lines hidden (view full) --- 199 Message* msg_ptr = message.get(); 200 assert(msg_ptr != NULL); 201 202 assert(m_sender->clockEdge() >= msg_ptr->getLastEnqueueTime() && 203 "ensure we aren't dequeued early"); 204 205 msg_ptr->updateDelayedTicks(m_sender->clockEdge()); 206 msg_ptr->setLastEnqueueTime(arrival_time); | 126 assert(msg_ptr); 127 128 DPRINTF(RubyQueue, "Message: %s\n", (*msg_ptr)); 129 return msg_ptr; 130} 131 132// FIXME - move me somewhere else 133Cycles --- 65 unchanged lines hidden (view full) --- 199 Message* msg_ptr = message.get(); 200 assert(msg_ptr != NULL); 201 202 assert(m_sender->clockEdge() >= msg_ptr->getLastEnqueueTime() && 203 "ensure we aren't dequeued early"); 204 205 msg_ptr->updateDelayedTicks(m_sender->clockEdge()); 206 msg_ptr->setLastEnqueueTime(arrival_time); |
207 msg_ptr->setMsgCounter(m_msg_counter); |
|
207 208 // Insert the message into the priority heap | 208 209 // Insert the message into the priority heap |
209 MessageBufferNode thisNode(arrival_time, m_msg_counter, message); 210 m_prio_heap.push_back(thisNode); 211 push_heap(m_prio_heap.begin(), m_prio_heap.end(), 212 greater<MessageBufferNode>()); | 210 m_prio_heap.push_back(message); 211 push_heap(m_prio_heap.begin(), m_prio_heap.end(), greater<MsgPtr>()); |
213 214 DPRINTF(RubyQueue, "Enqueue arrival_time: %lld, Message: %s\n", 215 arrival_time, *(message.get())); 216 217 // Schedule the wakeup 218 assert(m_consumer != NULL); 219 m_consumer->scheduleEventAbsolute(arrival_time); 220 m_consumer->storeEventInfo(m_vnet_id); 221} 222 223Cycles 224MessageBuffer::dequeue() 225{ 226 DPRINTF(RubyQueue, "Popping\n"); 227 assert(isReady()); 228 229 // get MsgPtr of the message about to be dequeued | 212 213 DPRINTF(RubyQueue, "Enqueue arrival_time: %lld, Message: %s\n", 214 arrival_time, *(message.get())); 215 216 // Schedule the wakeup 217 assert(m_consumer != NULL); 218 m_consumer->scheduleEventAbsolute(arrival_time); 219 m_consumer->storeEventInfo(m_vnet_id); 220} 221 222Cycles 223MessageBuffer::dequeue() 224{ 225 DPRINTF(RubyQueue, "Popping\n"); 226 assert(isReady()); 227 228 // get MsgPtr of the message about to be dequeued |
230 MsgPtr message = m_prio_heap.front().m_msgptr; | 229 MsgPtr message = m_prio_heap.front(); |
231 232 // get the delay cycles 233 message->updateDelayedTicks(m_receiver->clockEdge()); 234 Cycles delayCycles = 235 m_receiver->ticksToCycles(message->getDelayedTicks()); 236 237 // record previous size and time so the current buffer size isn't 238 // adjusted until next cycle 239 if (m_time_last_time_pop < m_receiver->clockEdge()) { 240 m_size_at_cycle_start = m_prio_heap.size(); 241 m_time_last_time_pop = m_receiver->clockEdge(); 242 } 243 244 pop_heap(m_prio_heap.begin(), m_prio_heap.end(), | 230 231 // get the delay cycles 232 message->updateDelayedTicks(m_receiver->clockEdge()); 233 Cycles delayCycles = 234 m_receiver->ticksToCycles(message->getDelayedTicks()); 235 236 // record previous size and time so the current buffer size isn't 237 // adjusted until next cycle 238 if (m_time_last_time_pop < m_receiver->clockEdge()) { 239 m_size_at_cycle_start = m_prio_heap.size(); 240 m_time_last_time_pop = m_receiver->clockEdge(); 241 } 242 243 pop_heap(m_prio_heap.begin(), m_prio_heap.end(), |
245 greater<MessageBufferNode>()); | 244 greater<MsgPtr>()); |
246 m_prio_heap.pop_back(); 247 248 return delayCycles; 249} 250 251void 252MessageBuffer::clear() 253{ --- 6 unchanged lines hidden (view full) --- 260 m_msgs_this_cycle = 0; 261} 262 263void 264MessageBuffer::recycle() 265{ 266 DPRINTF(RubyQueue, "Recycling.\n"); 267 assert(isReady()); | 245 m_prio_heap.pop_back(); 246 247 return delayCycles; 248} 249 250void 251MessageBuffer::clear() 252{ --- 6 unchanged lines hidden (view full) --- 259 m_msgs_this_cycle = 0; 260} 261 262void 263MessageBuffer::recycle() 264{ 265 DPRINTF(RubyQueue, "Recycling.\n"); 266 assert(isReady()); |
268 MessageBufferNode node = m_prio_heap.front(); 269 pop_heap(m_prio_heap.begin(), m_prio_heap.end(), 270 greater<MessageBufferNode>()); | 267 MsgPtr node = m_prio_heap.front(); 268 pop_heap(m_prio_heap.begin(), m_prio_heap.end(), greater<MsgPtr>()); |
271 | 269 |
272 node.m_time = m_receiver->clockEdge(m_recycle_latency); | 270 node->setLastEnqueueTime(m_receiver->clockEdge(m_recycle_latency)); |
273 m_prio_heap.back() = node; | 271 m_prio_heap.back() = node; |
274 push_heap(m_prio_heap.begin(), m_prio_heap.end(), 275 greater<MessageBufferNode>()); | 272 push_heap(m_prio_heap.begin(), m_prio_heap.end(), greater<MsgPtr>()); |
276 m_consumer-> 277 scheduleEventAbsolute(m_receiver->clockEdge(m_recycle_latency)); 278} 279 280void 281MessageBuffer::reanalyzeList(list<MsgPtr> <, Tick nextTick) 282{ 283 while(!lt.empty()) { 284 m_msg_counter++; | 273 m_consumer-> 274 scheduleEventAbsolute(m_receiver->clockEdge(m_recycle_latency)); 275} 276 277void 278MessageBuffer::reanalyzeList(list<MsgPtr> <, Tick nextTick) 279{ 280 while(!lt.empty()) { 281 m_msg_counter++; |
285 MessageBufferNode msgNode(nextTick, m_msg_counter, lt.front()); | 282 MsgPtr m = lt.front(); 283 m->setLastEnqueueTime(nextTick); 284 m->setMsgCounter(m_msg_counter); |
286 | 285 |
287 m_prio_heap.push_back(msgNode); | 286 m_prio_heap.push_back(m); |
288 push_heap(m_prio_heap.begin(), m_prio_heap.end(), | 287 push_heap(m_prio_heap.begin(), m_prio_heap.end(), |
289 greater<MessageBufferNode>()); | 288 greater<MsgPtr>()); |
290 291 m_consumer->scheduleEventAbsolute(nextTick); 292 lt.pop_front(); 293 } 294} 295 296void 297MessageBuffer::reanalyzeMessages(const Address& addr) --- 28 unchanged lines hidden (view full) --- 326} 327 328void 329MessageBuffer::stallMessage(const Address& addr) 330{ 331 DPRINTF(RubyQueue, "Stalling due to %s\n", addr); 332 assert(isReady()); 333 assert(addr.getOffset() == 0); | 289 290 m_consumer->scheduleEventAbsolute(nextTick); 291 lt.pop_front(); 292 } 293} 294 295void 296MessageBuffer::reanalyzeMessages(const Address& addr) --- 28 unchanged lines hidden (view full) --- 325} 326 327void 328MessageBuffer::stallMessage(const Address& addr) 329{ 330 DPRINTF(RubyQueue, "Stalling due to %s\n", addr); 331 assert(isReady()); 332 assert(addr.getOffset() == 0); |
334 MsgPtr message = m_prio_heap.front().m_msgptr; | 333 MsgPtr message = m_prio_heap.front(); |
335 336 dequeue(); 337 338 // 339 // Note: no event is scheduled to analyze the map at a later time. 340 // Instead the controller is responsible to call reanalyzeMessages when 341 // these addresses change state. 342 // 343 (m_stall_msg_map[addr]).push_back(message); 344} 345 346void 347MessageBuffer::print(ostream& out) const 348{ 349 ccprintf(out, "[MessageBuffer: "); 350 if (m_consumer != NULL) { 351 ccprintf(out, " consumer-yes "); 352 } 353 | 334 335 dequeue(); 336 337 // 338 // Note: no event is scheduled to analyze the map at a later time. 339 // Instead the controller is responsible to call reanalyzeMessages when 340 // these addresses change state. 341 // 342 (m_stall_msg_map[addr]).push_back(message); 343} 344 345void 346MessageBuffer::print(ostream& out) const 347{ 348 ccprintf(out, "[MessageBuffer: "); 349 if (m_consumer != NULL) { 350 ccprintf(out, " consumer-yes "); 351 } 352 |
354 vector<MessageBufferNode> copy(m_prio_heap); 355 sort_heap(copy.begin(), copy.end(), greater<MessageBufferNode>()); | 353 vector<MsgPtr> copy(m_prio_heap); 354 sort_heap(copy.begin(), copy.end(), greater<MsgPtr>()); |
356 ccprintf(out, "%s] %s", copy, m_name); 357} 358 359bool 360MessageBuffer::isReady() const 361{ 362 return ((m_prio_heap.size() > 0) && | 355 ccprintf(out, "%s] %s", copy, m_name); 356} 357 358bool 359MessageBuffer::isReady() const 360{ 361 return ((m_prio_heap.size() > 0) && |
363 (m_prio_heap.front().m_time <= m_receiver->clockEdge())); | 362 (m_prio_heap.front()->getLastEnqueueTime() <= m_receiver->clockEdge())); |
364} 365 366bool 367MessageBuffer::functionalRead(Packet *pkt) 368{ 369 // Check the priority heap and read any messages that may 370 // correspond to the address in the packet. 371 for (unsigned int i = 0; i < m_prio_heap.size(); ++i) { | 363} 364 365bool 366MessageBuffer::functionalRead(Packet *pkt) 367{ 368 // Check the priority heap and read any messages that may 369 // correspond to the address in the packet. 370 for (unsigned int i = 0; i < m_prio_heap.size(); ++i) { |
372 Message *msg = m_prio_heap[i].m_msgptr.get(); | 371 Message *msg = m_prio_heap[i].get(); |
373 if (msg->functionalRead(pkt)) return true; 374 } 375 376 // Read the messages in the stall queue that correspond 377 // to the address in the packet. 378 for (StallMsgMapType::iterator map_iter = m_stall_msg_map.begin(); 379 map_iter != m_stall_msg_map.end(); 380 ++map_iter) { --- 11 unchanged lines hidden (view full) --- 392uint32_t 393MessageBuffer::functionalWrite(Packet *pkt) 394{ 395 uint32_t num_functional_writes = 0; 396 397 // Check the priority heap and write any messages that may 398 // correspond to the address in the packet. 399 for (unsigned int i = 0; i < m_prio_heap.size(); ++i) { | 372 if (msg->functionalRead(pkt)) return true; 373 } 374 375 // Read the messages in the stall queue that correspond 376 // to the address in the packet. 377 for (StallMsgMapType::iterator map_iter = m_stall_msg_map.begin(); 378 map_iter != m_stall_msg_map.end(); 379 ++map_iter) { --- 11 unchanged lines hidden (view full) --- 391uint32_t 392MessageBuffer::functionalWrite(Packet *pkt) 393{ 394 uint32_t num_functional_writes = 0; 395 396 // Check the priority heap and write any messages that may 397 // correspond to the address in the packet. 398 for (unsigned int i = 0; i < m_prio_heap.size(); ++i) { |
400 Message *msg = m_prio_heap[i].m_msgptr.get(); | 399 Message *msg = m_prio_heap[i].get(); |
401 if (msg->functionalWrite(pkt)) { 402 num_functional_writes++; 403 } 404 } 405 406 // Check the stall queue and write any messages that may 407 // correspond to the address in the packet. 408 for (StallMsgMapType::iterator map_iter = m_stall_msg_map.begin(); --- 15 unchanged lines hidden --- | 400 if (msg->functionalWrite(pkt)) { 401 num_functional_writes++; 402 } 403 } 404 405 // Check the stall queue and write any messages that may 406 // correspond to the address in the packet. 407 for (StallMsgMapType::iterator map_iter = m_stall_msg_map.begin(); --- 15 unchanged lines hidden --- |