lkml.org 
[lkml]   [2010]   [Jan]   [4]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH 2/2] x86: get more exact nr_irqs
On 01/04/2010 11:16 AM, Eric W. Biederman wrote:
>
> If we care about memory use efficiency let's replace irq_desc_ptrs
> with a rbtree or a radix_tree. Something that moves the memory use
> penalty onto those machines that have a lot of irqs.
>

rbtree doesn't make much sense for something that is addressed by index,
and doesn't need to answer questions of the form "give me the highest
member <= X". A hash table or radix tree makes sense, depending on the
expected sparseness of the index.

-hpa



\
 
 \ /
  Last update: 2010-01-04 20:35    [W:1.803 / U:0.296 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site