Searched refs:tree (Results 1 - 11 of 11) sorted by relevance

/gem5/src/arch/sparc/
H A Dtlb_map.hh45 RangeMap tree; member in class:SparcISA::TlbMap
55 i = tree.upper_bound(r);
57 if (i == tree.begin()) {
66 return tree.end();
72 return tree.end();
74 return tree.end();
76 return tree.end();
81 return tree.end();
89 if (i != tree.end())
99 return tree
[all...]
/gem5/src/mem/cache/replacement_policies/
H A Dtree_plru_rp.cc34 * 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
94 TreePLRUReplData( const uint64_t index, std::shared_ptr<PLRUTree> tree) argument
115 PLRUTree* tree = treePLRU_replacement_data->tree.get(); local
141 PLRUTree* tree = treePLRU_replacement_data->tree.get(); local
175 const PLRUTree* tree = std::static_pointer_cast<TreePLRUReplData>( local
[all...]
H A Dtree_plru_rp.hh34 * The victim is chosen using a tree of bit timestamps.
36 * A tree contains consists of leafs that represent the direction to take when
39 * Let's assume each tree contains 8 replacement data entries. For example, if
40 * these entries are named from A to H, and the tree's bits are:
51 * grandparents, etc would be updated, and we'd end up with the following tree:
66 * Consecutive calls to instantiateEntry() use the same tree up to numLeaves.
67 * When numLeaves replacement datas have been created, a new tree is generated,
86 * Instead of implementing the tree itself with pointers, it is implemented
88 * tree, and its parent. Index 0 represents the root, 1 is its left node,
101 * Notice that the replacement data entries are not represented in the tree
142 std::shared_ptr<PLRUTree> tree; member in struct:TreePLRURP::TreePLRUReplData
[all...]
/gem5/src/base/
H A Daddr_range_map.hh57 * The AddrRangeMap uses an STL map to implement an interval tree for
138 return tree.end();
140 return tree.insert(std::make_pair(r, d)).first;
147 tree.erase(p);
156 tree.erase(p,q);
163 tree.erase(tree.begin(), tree.end());
169 return tree.begin();
175 return tree
[all...]
/gem5/src/mem/
H A Dstack_dist_calc.cc52 // Map type variable, representing a layer in the tree
55 // Initialize tree count for leaves
58 // Add the initial leaf layer to the tree
59 tree.push_back(tree_level);
64 // Initialize tree count for root
67 // Add the empty root layer to the tree
68 tree.push_back(tree_level);
70 // Add the initial root to the tree
71 tree[1][root_node->nodeIndex] = root_node;
77 for (auto& layer : tree) {
[all...]
H A Dstack_dist_calc.hh53 * of incoming addresses based on the partial sum hierarchy tree
57 * A tree structure is maintained and updated at each transaction
58 * (unique or non-unique). The tree is implemented as an STL vector
59 * with layers of the form <map> Each layer in this tree is an
61 * of leaf, intermediate and root nodes. For example, in a tree with 3
62 * layers, tree[0][5] gives a leaf node pointer for key=5 tree[1][1]
63 * gives an intermediate node pointer for key=1 tree[2][0] gives the
64 * root node in the tree.
71 * mark an old node in the tree i
400 TreeType tree; member in class:StackDistCalc
[all...]
/gem5/ext/googletest/googlemock/scripts/
H A Dgmock-config.in202 # it's not, we provide variables pointing to the source and build tree rather
203 # than to the install tree. We also locate Google Test using the configured
212 # assume that we are in a build tree.
/gem5/ext/googletest/googletest/scripts/
H A Dgtest-config.in202 # it's not, we provide variables pointing to the source and build tree rather
203 # than to the install tree. This allows building against a just-built gtest
210 # assume that we are in a build tree.
/gem5/util/stats/
H A Dprofile.py198 tree = self.tree
199 tree.aggregate(self, categorize, incategory=False)
200 self.total = tree.total()
203 if attr == 'tree':
328 symbols.tree.dot(dot, threshold=threshold)
454 data.tree.dot(dot, threshold=threshold)
/gem5/ext/ply/example/GardenSnake/
H A DGardenSnake.py652 tree = self.parser.parse(code)
653 #print tree
654 misc.set_filename(filename, tree)
655 syntax.check(tree)
656 gen = pycodegen.ModuleCodeGenerator(tree)
/gem5/src/python/m5/ext/pyfdt/
H A Dpyfdt.py858 tree = json.loads(buf)
862 _add_json_to_fdtnode(root, tree)
869 """Parse device tree filesystem and return a Fdt instance
870 Should be /proc/device-tree on a device, or the fusemount.py

Completed in 18 milliseconds