|
From: | Samuel Thibault |
Subject: | Re: Build times of hurd and glibc for different versions of gnumach, hurd and glibc |
Date: | Wed, 20 Apr 2016 11:44:36 +0200 |
User-agent: | Mutt/1.5.21+34 (58baf7c9f32f) (2010-12-30) |
Richard Braun, on Wed 20 Apr 2016 11:40:39 +0200, wrote: > I wrote an incomplete vm_map_enter in X15 [1] that should be helpful. > In addition to a free hint pointer, it uses the red-black tree, making > all allocations at worst O(n). Well, the current algorithm also has O(n) worst case :) But I guess with the red-black tree you have less than O(n) amortised complexity? Samuel
[Prev in Thread] | Current Thread | [Next in Thread] |