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; --- 17 unchanged lines hidden (view full) --- 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 */ 28 29#ifndef __MEM_RUBY_SLICC_INTERFACE_MESSAGE_HH__ 30#define __MEM_RUBY_SLICC_INTERFACE_MESSAGE_HH__ 31 32#include <iostream> 33 |
34#include "base/refcnt.hh" |
35#include "mem/ruby/common/Global.hh" 36#include "mem/ruby/eventqueue/RubyEventQueue.hh" 37 38class Message; |
39typedef RefCountingPtr<Message> MsgPtr; |
40 |
41class Message : public RefCounted |
42{ 43 public: 44 Message() |
45 : m_time(g_eventQueue_ptr->getTime()), 46 m_LastEnqueueTime(g_eventQueue_ptr->getTime()), 47 m_DelayedCycles(0) 48 { } |
49 |
50 Message(const Message &other) 51 : m_time(other.m_time), 52 m_LastEnqueueTime(other.m_LastEnqueueTime), 53 m_DelayedCycles(other.m_DelayedCycles) 54 { } 55 |
56 virtual ~Message() { } 57 58 virtual Message* clone() const = 0; |
59 virtual void print(std::ostream& out) const = 0; 60 61 void setDelayedCycles(const int& cycles) { m_DelayedCycles = cycles; } 62 const int& getDelayedCycles() const {return m_DelayedCycles;} 63 int& getDelayedCycles() {return m_DelayedCycles;} 64 void setLastEnqueueTime(const Time& time) { m_LastEnqueueTime = time; } 65 const Time& getLastEnqueueTime() const {return m_LastEnqueueTime;} 66 Time& getLastEnqueueTime() {return m_LastEnqueueTime;} --- 19 unchanged lines hidden --- |