On Sun, 2009-09-20 at 17:52 +0000, Anders Kaseorg wrote:
> As it turns out, the 100% CPU time is spent bubble-sorting a list of
> readahead records. That’s idiotic. The C library comes with a standard
> qsort() function for a reason. This is easy to fix and we should do so.
>
Right, I'd looked into this before and switched to qsort() but then
broke other things.
Hadn't had a change to follow-up further.
Thanks for investigating and doing the patch, I'll certainly apply this
one! Good work!
Scott
--
Scott James Remnant
<email address hidden>
On Sun, 2009-09-20 at 17:52 +0000, Anders Kaseorg wrote:
> As it turns out, the 100% CPU time is spent bubble-sorting a list of
> readahead records. That’s idiotic. The C library comes with a standard
> qsort() function for a reason. This is easy to fix and we should do so.
>
Right, I'd looked into this before and switched to qsort() but then
broke other things.
Hadn't had a change to follow-up further.
Thanks for investigating and doing the patch, I'll certainly apply this
one! Good work!
Scott
--
Scott James Remnant
<email address hidden>