MessageBuffer.cc (11321:02e930db812d) | MessageBuffer.cc (11732:e15e445c21a6) |
---|---|
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; --- 37 unchanged lines hidden (view full) --- 46 m_last_arrival_time(0), m_strict_fifo(p->ordered), 47 m_randomization(p->randomization) 48{ 49 m_msg_counter = 0; 50 m_consumer = NULL; 51 m_size_last_time_size_checked = 0; 52 m_size_at_cycle_start = 0; 53 m_msgs_this_cycle = 0; | 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; --- 37 unchanged lines hidden (view full) --- 46 m_last_arrival_time(0), m_strict_fifo(p->ordered), 47 m_randomization(p->randomization) 48{ 49 m_msg_counter = 0; 50 m_consumer = NULL; 51 m_size_last_time_size_checked = 0; 52 m_size_at_cycle_start = 0; 53 m_msgs_this_cycle = 0; |
54 m_not_avail_count = 0; | |
55 m_priority_rank = 0; 56 57 m_stall_msg_map.clear(); 58 m_input_link_id = 0; 59 m_vnet_id = 0; 60} 61 62unsigned int --- 282 unchanged lines hidden (view full) --- 345 346bool 347MessageBuffer::isReady(Tick current_time) const 348{ 349 return ((m_prio_heap.size() > 0) && 350 (m_prio_heap.front()->getLastEnqueueTime() <= current_time)); 351} 352 | 54 m_priority_rank = 0; 55 56 m_stall_msg_map.clear(); 57 m_input_link_id = 0; 58 m_vnet_id = 0; 59} 60 61unsigned int --- 282 unchanged lines hidden (view full) --- 344 345bool 346MessageBuffer::isReady(Tick current_time) const 347{ 348 return ((m_prio_heap.size() > 0) && 349 (m_prio_heap.front()->getLastEnqueueTime() <= current_time)); 350} 351 |
352void 353MessageBuffer::regStats() 354{ 355 m_not_avail_count 356 .name(name() + ".not_avail_count") 357 .desc("Number of times this buffer did not have N slots available") 358 .flags(Stats::nozero); 359} 360 |
|
353uint32_t 354MessageBuffer::functionalWrite(Packet *pkt) 355{ 356 uint32_t num_functional_writes = 0; 357 358 // Check the priority heap and write any messages that may 359 // correspond to the address in the packet. 360 for (unsigned int i = 0; i < m_prio_heap.size(); ++i) { --- 30 unchanged lines hidden --- | 361uint32_t 362MessageBuffer::functionalWrite(Packet *pkt) 363{ 364 uint32_t num_functional_writes = 0; 365 366 // Check the priority heap and write any messages that may 367 // correspond to the address in the packet. 368 for (unsigned int i = 0; i < m_prio_heap.size(); ++i) { --- 30 unchanged lines hidden --- |