[ness ]
>> On paper it is really easy, yes. It all boils down to how easy it
>> is to find your parent. Depending on your particular
>> implementation of the mapping databse this might be a really
>> expensive and complex operation.
> [Assuming the mdb is implement as a down-pointer-only tree]
> Was it that expensive to add up pointers?
[Assuming that your assumption holds]
Depends. It adds about 50% storage overhead for the mapping database.
Further, the grant operation (as traditionally implemented) requires
that all child mappings need to have their pointer updated. For this
latter operation you also have to deal with locking problems for MP
systems.
eSk
_______________________________________________
L4-hurd mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/l4-hurd
