sim: A trie data structure specifically to speed up paging lookups.
This change adds a trie data structure which stores an arbitrary pointer type based on an address and a number of relevant bits. Then lookups can be done against the trie where the tree is traversed and the first legitimate match found is returned.
This commit is contained in:
@@ -48,6 +48,7 @@ UnitTest('rangemaptest', 'rangemaptest.cc')
|
||||
UnitTest('rangemultimaptest', 'rangemultimaptest.cc')
|
||||
UnitTest('refcnttest', 'refcnttest.cc')
|
||||
UnitTest('strnumtest', 'strnumtest.cc')
|
||||
UnitTest('trietest', 'trietest.cc')
|
||||
|
||||
stattest_py = PySource('m5', 'stattestmain.py', skip_lib=True)
|
||||
stattest_swig = SwigSource('m5.internal', 'stattest.i', skip_lib=True)
|
||||
|
||||
Reference in New Issue
Block a user