cache/replacement_policies/tree_plru_rp.cc

34  * tree indexing functions, which map an index to the tree 2D-array.
48  * @param Index of the queried tree.
49  * @return The index of the parent tree.
58  * Get index of the subtree on the left of the given indexed tree.
60  * @param index The index of the queried tree.
61  * @return The index of the subtree to the left of the queried tree.
70  * Get index of the subtree on the right of the given indexed tree.
72  * @param index The index of the queried tree.
73  * @return The index of the subtree to the right of the queried tree.
83  * of its parent tree.
95     const uint64_t index, std::shared_ptr<PLRUTree> tree)
96     : index(index), tree(tree)
115     PLRUTree* tree = treePLRU_replacement_data->tree.get();
117     // Index of the tree entry we are currently checking
121     // Parse and update tree to make it point to the new LRU
126         // Go to the parent tree node
130         tree->at(tree_index) = right;
141     PLRUTree* tree = treePLRU_replacement_data->tree.get();
143     // Index of the tree entry we are currently checking
147     // Parse and update tree to make every bit point away from the new MRU
152         // Go to the parent tree node
156         tree->at(tree_index) = !right;
174     // Get tree
175     const PLRUTree* tree = std::static_pointer_cast<TreePLRUReplData>(
176             candidates[0]->replacementData)->tree.get();
178     // Index of the tree entry we are currently checking. Start with root.
181     // Parse tree
182     while (tree_index < tree->size()) {
183         // Go to the next tree entry
184         if (tree->at(tree_index)) {
191     // The tree index is currently at the leaf of the victim displaced by the
199     // Generate a tree instance every numLeaves created
204     // Create replacement data using current tree instance