From fc27072b451dd8385401fadf198db69b0e87c72c Mon Sep 17 00:00:00 2001 From: Pavel Pisa Date: Tue, 12 Feb 2019 10:29:08 +0100 Subject: Implement LRU as simple priority queue with linear insert sort. Signed-off-by: Pavel Pisa --- qtmips_machine/cache.h | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'qtmips_machine/cache.h') diff --git a/qtmips_machine/cache.h b/qtmips_machine/cache.h index 200f3ce..827631b 100644 --- a/qtmips_machine/cache.h +++ b/qtmips_machine/cache.h @@ -67,7 +67,7 @@ public: enum LocationStatus location_status(std::uint32_t address) const; inline std::uint32_t get_change_counter() const { - return *p_change_counter; + return change_counter; } signals: void hit_update(unsigned) const; @@ -76,7 +76,6 @@ signals: void cache_update(unsigned associat, unsigned set, bool valid, bool dirty, std::uint32_t tag, const std::uint32_t *data) const; private: - std::uint32_t* p_change_counter; MachineConfigCache cnf; MemoryAccess *mem; unsigned access_pen_r, access_pen_w; @@ -96,6 +95,7 @@ private: } replc; // Data used for replacement policy mutable unsigned hit_read, miss_read, hit_write, miss_write; // Hit and miss counters + mutable std::uint32_t change_counter; std::uint32_t debug_rword(std::uint32_t address) const; bool access(std::uint32_t address, std::uint32_t *data, bool write, std::uint32_t value = 0) const; -- cgit v1.2.3