24da30e317
This basically means changing all #include statements and changing autogenerated code so that it generates the correct paths. Because slicc generates #includes, I had to hard code the include paths to mem/protocol.
65 lines
1.4 KiB
C++
65 lines
1.4 KiB
C++
|
|
#ifndef LRUPOLICY_H
|
|
#define LRUPOLICY_H
|
|
|
|
#include "mem/ruby/system/AbstractReplacementPolicy.hh"
|
|
|
|
/* Simple true LRU replacement policy */
|
|
|
|
class LRUPolicy : public AbstractReplacementPolicy {
|
|
public:
|
|
|
|
LRUPolicy(Index num_sets, Index assoc);
|
|
~LRUPolicy();
|
|
|
|
void touch(Index set, Index way, Time time);
|
|
Index getVictim(Index set) const;
|
|
};
|
|
|
|
inline
|
|
LRUPolicy::LRUPolicy(Index num_sets, Index assoc)
|
|
: AbstractReplacementPolicy(num_sets, assoc)
|
|
{
|
|
}
|
|
|
|
inline
|
|
LRUPolicy::~LRUPolicy()
|
|
{
|
|
}
|
|
|
|
inline
|
|
void LRUPolicy::touch(Index set, Index index, Time time){
|
|
assert(index >= 0 && index < m_assoc);
|
|
assert(set >= 0 && set < m_num_sets);
|
|
|
|
m_last_ref_ptr[set][index] = time;
|
|
}
|
|
|
|
inline
|
|
Index LRUPolicy::getVictim(Index set) const {
|
|
// assert(m_assoc != 0);
|
|
Time time, smallest_time;
|
|
Index smallest_index;
|
|
|
|
smallest_index = 0;
|
|
smallest_time = m_last_ref_ptr[set][0];
|
|
|
|
for (unsigned int i=0; i < m_assoc; i++) {
|
|
time = m_last_ref_ptr[set][i];
|
|
//assert(m_cache[cacheSet][i].m_Permission != AccessPermission_NotPresent);
|
|
|
|
if (time < smallest_time){
|
|
smallest_index = i;
|
|
smallest_time = time;
|
|
}
|
|
}
|
|
|
|
// DEBUG_EXPR(CACHE_COMP, MedPrio, cacheSet);
|
|
// DEBUG_EXPR(CACHE_COMP, MedPrio, smallest_index);
|
|
// DEBUG_EXPR(CACHE_COMP, MedPrio, m_cache[cacheSet][smallest_index]);
|
|
// DEBUG_EXPR(CACHE_COMP, MedPrio, *this);
|
|
|
|
return smallest_index;
|
|
}
|
|
|
|
#endif // PSEUDOLRUBITS_H
|