TimerTable.hh (10441:5377550e1e15) | TimerTable.hh (11025:4872dbdea907) |
---|---|
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; --- 48 unchanged lines hidden (view full) --- 57 58 void 59 setDescription(const std::string& name) 60 { 61 m_name = name; 62 } 63 64 bool isReady() const; | 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; --- 48 unchanged lines hidden (view full) --- 57 58 void 59 setDescription(const std::string& name) 60 { 61 m_name = name; 62 } 63 64 bool isReady() const; |
65 const Address& readyAddress() const; 66 bool isSet(const Address& address) const { return !!m_map.count(address); } 67 void set(const Address& address, Cycles relative_latency); 68 void set(const Address& address, uint64_t relative_latency) | 65 Addr readyAddress() const; 66 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 | 69 { set(address, Cycles(relative_latency)); } 70 |
71 void unset(const Address& address); | 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 | 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 |
85 typedef std::map<Address, Cycles> AddressMap; | 85 typedef std::map |
86 AddressMap m_map; 87 mutable bool m_next_valid; 88 mutable Cycles m_next_time; // Only valid if m_next_valid is true | 86 AddressMap m_map; 87 mutable bool m_next_valid; 88 mutable Cycles m_next_time; // Only valid if m_next_valid is true |
89 mutable Address m_next_address; // Only valid if m_next_valid is true | 89 mutable Addr m_next_address; // Only valid if m_next_valid is true |
90 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__ | 90 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__ |