mirror of
https://github.com/dingusdev/dingusppc.git
synced 2025-02-13 17:30:33 +00:00
We do a linear scan in find_range (which is called on all TLB misses) to find the entries. The largest and most frequently hit entry is the system memory (which starts at 0). By ensuring that it's the first entry in the list, we end up only doing one iteration through the loop.