sim: A trie data structure specifically to speed up paging lookups.
authorGabe Black <gblack@eecs.umich.edu>
Sun, 15 Apr 2012 06:19:34 +0000 (23:19 -0700)
committerGabe Black <gblack@eecs.umich.edu>
Sun, 15 Apr 2012 06:19:34 +0000 (23:19 -0700)
commitc4c27ded423b9beb0e361421ca83fe0eac06a0d1
tree5d304f15bd0e6958e7db1ff20a0be58533f675fd
parent14edc6013d8d62782d58536214c669e12c64da37
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.
src/base/trie.hh [new file with mode: 0644]
src/unittest/SConscript
src/unittest/trietest.cc [new file with mode: 0644]