| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2012-04-14 | sim: A trie data structure specifically to speed up paging lookups. | Gabe Black | |
| 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. | |||
 |
index : gem5 | |
| gem5 |
| summaryrefslogtreecommitdiff |