Messages in this thread | | | Date | Mon, 5 Apr 2004 06:42:50 +0200 | From | Andrea Arcangeli <> | Subject | Re: [RFC][PATCH 1/3] radix priority search tree - objrmap complexity fix |
| |
On Sun, Apr 04, 2004 at 11:14:25PM -0400, Rajesh Venkatasubramanian wrote: > > This patch fixes a couple of mask overflow bugs in the prio_tree > search code. These bugs trigger in some very rare corner cases. > The patch also removes a couple of BUG_ONs from the fast paths. > > Now the code is well-tested. I have tested all __vma_prio_tree_* > functions in the user-space with as many as 10 million vmas and > all prio_tree functions work fine.
This is a great news.
> > This patch is against 2.6.5-aa2. It will apply on top of Hugh's > patches also.
I'm releasing an update for this.
> If you like to test the prio_tree code further in the user-space, > the programs in the following link may help you. > > http://www-personal.engin.umich.edu/~vrajesh/linux/prio_tree/user_space/
thanks for this great work. - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |