Searched refs:ReplaceableEntry (Results 1 - 25 of 39) sorted by relevance
12
| /gem5/src/mem/cache/tags/indexing_policies/ |
| H A D | base.hh | 58 class ReplaceableEntry;
92 std::vector<std::vector<ReplaceableEntry*>> sets;
121 void setEntry(ReplaceableEntry* entry, const uint64_t index);
131 ReplaceableEntry* getEntry(const uint32_t set, const uint32_t way) const;
149 virtual std::vector<ReplaceableEntry*> getPossibleEntries(const Addr addr)
159 virtual Addr regenerateAddr(const Addr tag, const ReplaceableEntry* entry)
|
| H A D | set_associative.hh | 58 class ReplaceableEntry;
118 std::vector<ReplaceableEntry*> getPossibleEntries(const Addr addr) const
128 Addr regenerateAddr(const Addr tag, const ReplaceableEntry* entry) const
|
| H A D | skewed_associative.hh | 44 class ReplaceableEntry;
162 std::vector<ReplaceableEntry*> getPossibleEntries(const Addr addr) const
173 Addr regenerateAddr(const Addr tag, const ReplaceableEntry* entry) const
|
| H A D | set_associative.cc | 66 SetAssociative::regenerateAddr(const Addr tag, const ReplaceableEntry* entry)
72 std::vector<ReplaceableEntry*>
|
| H A D | base.cc | 74 ReplaceableEntry*
81 BaseIndexingPolicy::setEntry(ReplaceableEntry* entry, const uint64_t index)
|
| /gem5/src/mem/cache/replacement_policies/ |
| H A D | replaceable_entry.hh | 53 class ReplaceableEntry class
67 ReplaceableEntry() = default;
68 virtual ~ReplaceableEntry() = default;
|
| H A D | base.hh | 43 typedef std::vector<ReplaceableEntry*> ReplacementCandidates;
96 virtual ReplaceableEntry* getVictim(
|
| H A D | random_rp.cc | 66 ReplaceableEntry*
73 ReplaceableEntry* victim = candidates[random_mt.random<unsigned>(0,
|
| H A D | fifo_rp.cc | 66 ReplaceableEntry*
73 ReplaceableEntry* victim = candidates[0];
|
| H A D | random_rp.hh | 109 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
|
| H A D | second_chance_rp.hh | 124 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
|
| H A D | fifo_rp.hh | 108 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
|
| H A D | lfu_rp.hh | 108 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
|
| H A D | lru_rp.hh | 106 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
|
| H A D | mru_rp.hh | 108 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
|
| H A D | brrip_rp.hh | 156 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
|
| H A D | second_chance_rp.cc | 84 ReplaceableEntry*
105 ReplaceableEntry* victim = candidates[0];
|
| H A D | lfu_rp.cc | 65 ReplaceableEntry*
72 ReplaceableEntry* victim = candidates[0];
|
| H A D | lru_rp.cc | 68 ReplaceableEntry*
75 ReplaceableEntry* victim = candidates[0];
|
| H A D | mru_rp.cc | 68 ReplaceableEntry*
75 ReplaceableEntry* victim = candidates[0];
|
| H A D | tree_plru_rp.hh | 201 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
|
| H A D | brrip_rp.cc | 92 ReplaceableEntry*
99 ReplaceableEntry* victim = candidates[0];
|
| /gem5/src/mem/cache/prefetch/ |
| H A D | associative_set_impl.hh | 59 const std::vector<ReplaceableEntry*> selected_entries =
84 const std::vector<ReplaceableEntry*> selected_entries =
98 std::vector<ReplaceableEntry *> selected_entries =
|
| /gem5/src/mem/cache/tags/ |
| H A D | sector_blk.hh | 145 class SectorBlk : public ReplaceableEntry
|
| H A D | sector_blk.cc | 119 : ReplaceableEntry(), _tag(MaxAddr), _validCounter(0), _secureBit(false)
174 ReplaceableEntry::setPosition(set, way);
|
Completed in 20 milliseconds
12