The case of the overly anonymous anon_vma
Posted Apr 24, 2010 20:33 UTC (Sat) by efexis
In reply to: The case of the overly anonymous anon_vma
Parent article: The case of the overly anonymous anon_vma
"eg, something indexed by page address"
That's what the page table is. But you can only index a fixed number of things from that, once you have a variable number of things (as there being any number of processes sharing that page), that's then another dimension, and can thus not be represented using a single dimension of the page address alone. A linked list might be slow for searching in, but in this case it looks like most operations are going to be either inserts (eg, at fork() time), deletes (at CoW or process termination time), and I guess possibly an action required on the whole group, although I couldn't suggest what. These seem like they'd all about as cheap on a linked list as you can get.
to post comments)