Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S261928AbUCLD24 (ORCPT ); Thu, 11 Mar 2004 22:28:56 -0500 Received: (majordomo@vger.kernel.org) by vger.kernel.org id S261932AbUCLD24 (ORCPT ); Thu, 11 Mar 2004 22:28:56 -0500 Received: from mx1.redhat.com ([66.187.233.31]:49065 "EHLO mx1.redhat.com") by vger.kernel.org with ESMTP id S261928AbUCLD2z (ORCPT ); Thu, 11 Mar 2004 22:28:55 -0500 Date: Thu, 11 Mar 2004 22:28:42 -0500 (EST) From: Rik van Riel X-X-Sender: riel@chimarrao.boston.redhat.com To: Andrea Arcangeli cc: Hugh Dickins , Ingo Molnar , Andrew Morton , , , William Lee Irwin III Subject: Re: anon_vma RFC2 In-Reply-To: <20040311135608.GI30940@dualathlon.random> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: linux-kernel-owner@vger.kernel.org X-Mailing-List: linux-kernel@vger.kernel.org Content-Length: 1086 Lines: 27 On Thu, 11 Mar 2004, Andrea Arcangeli wrote: > it's more complicated because it's more finegrined and it can handle > mremap too. I mean, the additional cost of tracking the vmas payoffs > because then we've a tiny list of vma to search for every page, > otherwise with the mm-wide model we'd need to search all of the vmas in > a mm. Actually, with the code Rajesh is working on there's no search problem with Hugh's idea. Considering the fact that we'll need Rajesh's code anyway, to deal with Ingo's test program and the real world programs that do similar things, I don't see how your objection to Hugh's code is still valid. -- "Debugging is twice as hard as writing the code in the first place. Therefore, if you write the code as cleverly as possible, you are, by definition, not smart enough to debug it." - Brian W. Kernighan - 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/