lkml.org 
[lkml]   [2002]   [Nov]   [14]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [BK PATCH 1/2] Remove NGROUPS hardlimit (resend w/o qsort)
On Thu, Nov 14, 2002 at 04:46:36PM -0800, Tim Hockin wrote:
> Offer an alternative? :) Linked list costs us as much or MORE for
> ->next as the gid_t. kmalloc() doesn't work for previous reasoning. I
> considered a list of gid arr[256] or similar. A voice reminds me that
> it doesn't impact us noticably in real use. Now, maybe other
> architectures will find a good reason to switch to kmalloc() list of
> smaller arrays, and the associated complextities or something else more
> clever.

Well, there are always B-trees; nice low arrival rates to the allocator
owing to elements/node and O(lg(n)) searches with low constants due to
big fat branching factors. Not my call though.


Bill
-
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/

\
 
 \ /
  Last update: 2005-03-22 13:31    [W:0.058 / U:1.988 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site