TimerTable.hh (11025:4872dbdea907) | TimerTable.hh (11111:6da33e720481) |
---|---|
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; --- 35 unchanged lines hidden (view full) --- 44 45 void 46 setConsumer(Consumer* consumer_ptr) 47 { 48 assert(m_consumer_ptr == NULL); 49 m_consumer_ptr = consumer_ptr; 50 } 51 | 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; --- 35 unchanged lines hidden (view full) --- 44 45 void 46 setConsumer(Consumer* consumer_ptr) 47 { 48 assert(m_consumer_ptr == NULL); 49 m_consumer_ptr = consumer_ptr; 50 } 51 |
52 void setClockObj(ClockedObject* obj) 53 { 54 assert(m_clockobj_ptr == NULL); 55 m_clockobj_ptr = obj; 56 } 57 | |
58 void 59 setDescription(const std::string& name) 60 { 61 m_name = name; 62 } 63 | 52 void 53 setDescription(const std::string& name) 54 { 55 m_name = name; 56 } 57 |
64 bool isReady() const; 65 Addr readyAddress() const; | 58 bool isReady(Tick curTime) const; 59 Addr nextAddress() const; |
66 bool isSet(Addr address) const { return !!m_map.count(address); } | 60 bool isSet(Addr address) const { return !!m_map.count(address); } |
67 void set(Addr address, Cycles relative_latency); 68 void set(Addr address, uint64_t relative_latency) 69 { set(address, Cycles(relative_latency)); } 70 | 61 void set(Addr address, Tick ready_time); |
71 void unset(Addr address); 72 void print(std::ostream& out) const; 73 74 private: 75 void updateNext() const; 76 77 // Private copy constructor and assignment operator 78 TimerTable(const TimerTable& obj); 79 TimerTable& operator=(const TimerTable& obj); 80 81 // Data Members (m_prefix) 82 83 // use a std::map for the address map as this container is sorted 84 // and ensures a well-defined iteration order | 62 void unset(Addr address); 63 void print(std::ostream& out) const; 64 65 private: 66 void updateNext() const; 67 68 // Private copy constructor and assignment operator 69 TimerTable(const TimerTable& obj); 70 TimerTable& operator=(const TimerTable& obj); 71 72 // Data Members (m_prefix) 73 74 // use a std::map for the address map as this container is sorted 75 // and ensures a well-defined iteration order |
85 typedef std::map<Addr, Cycles> AddressMap; | 76 typedef std::map<Addr, Tick> AddressMap; |
86 AddressMap m_map; 87 mutable bool m_next_valid; | 77 AddressMap m_map; 78 mutable bool m_next_valid; |
88 mutable Cycles m_next_time; // Only valid if m_next_valid is true | 79 mutable Tick m_next_time; // Only valid if m_next_valid is true |
89 mutable Addr m_next_address; // Only valid if m_next_valid is true 90 | 80 mutable Addr m_next_address; // Only valid if m_next_valid is true 81 |
91 //! Object used for querying time. 92 ClockedObject* m_clockobj_ptr; | |
93 //! Consumer to signal a wakeup() 94 Consumer* m_consumer_ptr; 95 96 std::string m_name; 97}; 98 99inline std::ostream& 100operator<<(std::ostream& out, const TimerTable& obj) 101{ 102 obj.print(out); 103 out << std::flush; 104 return out; 105} 106 107#endif // __MEM_RUBY_STRUCTURES_TIMERTABLE_HH__ | 82 //! Consumer to signal a wakeup() 83 Consumer* m_consumer_ptr; 84 85 std::string m_name; 86}; 87 88inline std::ostream& 89operator<<(std::ostream& out, const TimerTable& obj) 90{ 91 obj.print(out); 92 out << std::flush; 93 return out; 94} 95 96#endif // __MEM_RUBY_STRUCTURES_TIMERTABLE_HH__ |