On Friday 14 November 2008 16:22, Jeremy Fitzhardinge wrote:
Yep. And leaving it alone is even simpler and still faster :)
I think its pretty nice. It means you can make the loops fairly
optimal even if they might have slightly different requirements
(different arguments, latency breaks, copy_page_range etc).
I think that's being way over dramatic. When switching to a
different page table structure, I assure you that copying and
pasting your new walking algorithm a few times will be the least
of your worries :)
It's not meant to be pluggable. Actually this came up last I think
when the UNSW wanted to add page table accessors to abstract this.
They came up with a good set of things, but in the end you can't
justify slowing things down in these paths unless you actually have
a replacement page table structure that gets you a *net win*. So
far, I haven't heard from them again.
No, adding a cycle here or an indirect function call there IMO is
not acceptable in core mm/ code without a good reason.
--