lkml.org 
[lkml]   [2008]   [May]   [8]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [patch] speed up / fix the new generic semaphore code (fix AIM7 40% regression with 2.6.26-rc1)


On Thu, 8 May 2008, Linus Torvalds wrote:
>
> Why don't we just make it do the same thing that the x86 semaphores used
> to do: make it signed, and decrement unconditionally. And callt eh
> slow-path if it became negative.
> ...
> and now we have an existing known-good implementation to look at?

Ok, after having thought that over, and looked at the code, I think I like
your version after all. The old implementation was pretty complex due to
the need to be so extra careful about the count that could change outside
of the lock, so everything considered, a new implementation that is
simpler is probably the better choice.

Ergo, I will just pull your scheduler tree.

Linus


\
 
 \ /
  Last update: 2008-05-08 20:33    [W:0.146 / U:0.092 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site