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;

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

357
358bool
359MessageBuffer::isReady() const
360{
361 return ((m_prio_heap.size() > 0) &&
362 (m_prio_heap.front()->getLastEnqueueTime() <= m_receiver->clockEdge()));
363}
364
365uint32_t
366MessageBuffer::functionalWrite(Packet *pkt)
367{
368 uint32_t num_functional_writes = 0;
369
370 // Check the priority heap and write any messages that may
371 // correspond to the address in the packet.
372 for (unsigned int i = 0; i < m_prio_heap.size(); ++i) {

--- 30 unchanged lines hidden ---