Searched refs:candidate (Results 1 - 8 of 8) sorted by relevance

/gem5/src/mem/cache/replacement_policies/
H A Drandom_rp.cc69 // There must be at least one replacement candidate
72 // Choose one candidate at random
78 for (const auto& candidate : candidates) {
80 candidate->replacementData)->valid) {
81 victim = candidate;
H A Dfifo_rp.cc69 // There must be at least one replacement candidate
74 for (const auto& candidate : candidates) {
77 candidate->replacementData)->tickInserted <
80 victim = candidate;
H A Dbrrip_rp.cc95 // There must be at least one replacement candidate
98 // Use first candidate as dummy victim
106 for (const auto& candidate : candidates) {
109 candidate->replacementData);
113 return candidate;
119 victim = candidate;
132 for (const auto& candidate : candidates) {
134 candidate->replacementData)->rrpv += diff;
H A Dsecond_chance_rp.cc87 // There must be at least one replacement candidate
91 for (const auto& candidate : candidates) {
92 // Cast candidate's replacement data
95 candidate->replacementData);
100 return candidate;
H A Dlfu_rp.cc68 // There must be at least one replacement candidate
73 for (const auto& candidate : candidates) {
76 candidate->replacementData)->refCount <
79 victim = candidate;
H A Dlru_rp.cc71 // There must be at least one replacement candidate
76 for (const auto& candidate : candidates) {
79 candidate->replacementData)->lastTouchTick <
82 victim = candidate;
H A Dmru_rp.cc71 // There must be at least one replacement candidate
76 for (const auto& candidate : candidates) {
79 candidate->replacementData)->lastTouchTick >
82 victim = candidate;
/gem5/src/mem/ruby/network/garnet2.0/
H A DRoutingUnit.cc83 // Identify the minimum weight among the candidate output links
92 // Collect all candidate output links with this minimum weight
109 // Randomly select any candidate output link
110 int candidate = 0; local
112 candidate = rand() % num_candidates;
114 output_link = output_link_candidates.at(candidate);

Completed in 10 milliseconds