On Tue, 2005-10-11 at 20:43 +0200, ness wrote: > > 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?
Espen will have to answer this, but my memory is that this would be something like a 25% to 50% increase in the size of the MDB nodes, which would be a good reason to ask for a really compelling justification before implementing it. shap _______________________________________________ L4-hurd mailing list [email protected] http://lists.gnu.org/mailman/listinfo/l4-hurd
