From mboxrd@z Thu Jan 1 00:00:00 1970 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 Message-ID: <20040405044250.GB2234@dualathlon.random> References: <20040325225919.GL20019@dualathlon.random> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: Sender: owner-linux-mm@kvack.org Return-Path: To: Rajesh Venkatasubramanian Cc: akpm@osdl.org, hugh@veritas.com, mbligh@aracnet.com, linux-kernel@vger.kernel.org, linux-mm@kvack.org List-ID: 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, send a message with 'unsubscribe linux-mm' in the body to majordomo@kvack.org. For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: aart@kvack.org