[lkml]   [2005]   [Aug]   [28]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [PATCH] make radix tree gang lookup faster by using a bitmap search

On Sun, 28 Aug 2005, James Bottomley wrote:
> radix_tree_insert() is reliable from IRQ provided you don't try to use
> radix_tree_preload() and you defined your radix tree gfp flag to be

It would be better if it wasn't, though.

I really don't see why we made it irq-safe, and take the hit of disabling
interrupts in addition to the locking. That's a quite noticeable loss,
and I don't think it's really a valid thing to insert (or look up) page
cache entries from interrupts.

What _is_ it that makes us do that, btw? Is it just because we clear the
writeback tag bits or something? Sad. It makes page lookup noticeably more

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2009-11-18 23:46    [W:0.043 / U:6.672 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site