Searched refs:numLeaves (Results 1 - 2 of 2) sorted by relevance

/gem5/src/mem/cache/replacement_policies/
H A Dtree_plru_rp.cc101 : BaseReplacementPolicy(p), numLeaves(p->num_leaves), count(0),
104 fatal_if(!isPowerOf2(numLeaves),
193 return candidates[tree_index - (numLeaves - 1)];
199 // Generate a tree instance every numLeaves created
200 if (count % numLeaves == 0) {
201 treeInstance = new PLRUTree(numLeaves - 1, false);
206 (count % numLeaves) + numLeaves - 1,
H A Dtree_plru_rp.hh66 * Consecutive calls to instantiateEntry() use the same tree up to numLeaves.
67 * When numLeaves replacement datas have been created, a new tree is generated,
109 const uint64_t numLeaves; member in class:TreePLRURP
138 * Shared tree pointer. A tree is shared between numLeaves nodes, so
206 * function use the same tree up to numLeaves. When numLeaves replacement

Completed in 5 milliseconds