Searched refs:candidates (Results 1 - 18 of 18) sorted by relevance

/gem5/src/mem/cache/replacement_policies/
H A Drandom_rp.cc67 RandomRP::getVictim(const ReplacementCandidates& candidates) const
70 assert(candidates.size() > 0);
73 ReplaceableEntry* victim = candidates[random_mt.random<unsigned>(0,
74 candidates.size() - 1)];
76 // Visit all candidates to search for an invalid entry. If one is found,
78 for (const auto& candidate : candidates) {
H A Dfifo_rp.cc67 FIFORP::getVictim(const ReplacementCandidates& candidates) const
70 assert(candidates.size() > 0);
72 // Visit all candidates to find victim
73 ReplaceableEntry* victim = candidates[0];
74 for (const auto& candidate : candidates) {
H A Dsecond_chance_rp.cc85 SecondChanceRP::getVictim(const ReplacementCandidates& candidates) const
88 assert(candidates.size() > 0);
91 for (const auto& candidate : candidates) {
104 // Visit all candidates to find victim
105 ReplaceableEntry* victim = candidates[0];
109 victim = FIFORP::getVictim(candidates);
H A Dlfu_rp.cc66 LFURP::getVictim(const ReplacementCandidates& candidates) const
69 assert(candidates.size() > 0);
71 // Visit all candidates to find victim
72 ReplaceableEntry* victim = candidates[0];
73 for (const auto& candidate : candidates) {
H A Dlru_rp.cc69 LRURP::getVictim(const ReplacementCandidates& candidates) const
72 assert(candidates.size() > 0);
74 // Visit all candidates to find victim
75 ReplaceableEntry* victim = candidates[0];
76 for (const auto& candidate : candidates) {
H A Dmru_rp.cc69 MRURP::getVictim(const ReplacementCandidates& candidates) const
72 assert(candidates.size() > 0);
74 // Visit all candidates to find victim
75 ReplaceableEntry* victim = candidates[0];
76 for (const auto& candidate : candidates) {
H A Dbrrip_rp.cc93 BRRIPRP::getVictim(const ReplacementCandidates& candidates) const
96 assert(candidates.size() > 0);
99 ReplaceableEntry* victim = candidates[0];
105 // Visit all candidates to find victim
106 for (const auto& candidate : candidates) {
131 // Update RRPV of all candidates
132 for (const auto& candidate : candidates) {
H A Dbase.hh41 * Replacement candidates as chosen by the indexing policy.
91 * Find replacement victim among candidates.
93 * @param candidates Replacement candidates, selected by indexing policy.
97 const ReplacementCandidates& candidates) const = 0;
H A Drandom_rp.hh106 * @param candidates Replacement candidates, selected by indexing policy.
109 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
H A Dsecond_chance_rp.hh121 * @param cands Replacement candidates, selected by indexing policy.
124 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
H A Dtree_plru_rp.cc169 TreePLRURP::getVictim(const ReplacementCandidates& candidates) const
172 assert(candidates.size() > 0);
176 candidates[0]->replacementData)->tree.get();
193 return candidates[tree_index - (numLeaves - 1)];
H A Dfifo_rp.hh105 * @param cands Replacement candidates, selected by indexing policy.
108 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
H A Dlfu_rp.hh105 * @param cands Replacement candidates, selected by indexing policy.
108 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
H A Dlru_rp.hh103 * @param candidates Replacement candidates, selected by indexing policy.
106 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
H A Dmru_rp.hh105 * @param cands Replacement candidates, selected by indexing policy.
108 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
H A Dbrrip_rp.hh92 * in the near future, and is among the best eviction candidates.
153 * @param cands Replacement candidates, selected by indexing policy.
156 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
H A Dtree_plru_rp.hh196 * candidates share the same replacement data tree.
198 * @param candidates Replacement candidates, selected by indexing policy.
201 ReplaceableEntry* getVictim(const ReplacementCandidates& candidates) const
/gem5/src/gpu-compute/
H A Dkernel_cfg.cc224 std::set<uint32_t> candidates = basicBlock->postDominatorIds; local
225 candidates.erase(basicBlock->id);
228 setDifference(candidates,
233 assert(candidates.size() == 1);
235 BasicBlock* ipd_block = basicBlocks[*(candidates.begin())].get();

Completed in 17 milliseconds