From mboxrd@z Thu Jan 1 00:00:00 1970 From: Peter Zijlstra Subject: Re: [PATCH v4 12/13] fair.c: Use generic rbtree impl in fair scheduler Date: Wed, 27 Jun 2012 14:36:34 +0200 Message-ID: <1340800594.10063.53.camel@twins> References: <1340424048-7759-1-git-send-email-daniel.santos@pobox.com> <1340424048-7759-13-git-send-email-daniel.santos@pobox.com> <1340712949.21991.57.camel@twins> <4FEA30B2.9010902@att.net> Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7BIT Return-path: In-Reply-To: <4FEA30B2.9010902@att.net> Sender: linux-doc-owner@vger.kernel.org To: Daniel Santos Cc: Andrew Morton , Christopher Li , David Daney , David Howells , David Rientjes , Hidetoshi Seto , "H. Peter Anvin" , Ingo Molnar , Ingo Molnar , Joe Perches , Konstantin Khlebnikov , linux-doc@vger.kernel.org, linux-sparse@vger.kernel.org, LKML , Paul Gortmaker , Paul Turner , Pavel Pisa , Richard Weinberger , Rob Landley , Steven Rostedt , Suresh Siddha List-Id: linux-sparse@vger.kernel.org On Tue, 2012-06-26 at 16:59 -0500, Daniel Santos wrote: > Also, to address why we're not using entity_before (or a less() > function) directly, there's two main reasons (one that doesn't even > affect CFS). The first reason is that an "is equal" evaluation would > also be required for insertions in trees with unique keys, Right, I saw that feature in your code, are there any such trees in the kernel? It would be good to have a kernel code conversion for each variant your code supports. > as well as > all lookups. This doesn't doesn't affect CFS because it isn't doing > lookups (it only cares about leftmost) and duplicate keys are allowed. > Right.. there's that. Too bad, partial order is slightly cheaper at times. A well, nothing for it.