Files
kernel-tenderloin-3.0/include
Matthew Wilcox b17170b2fa Simplify semaphore implementation
By removing the negative values of 'count' and relying on the wait_list to
indicate whether we have any waiters, we can simplify the implementation
by removing the protection against an unlikely race condition.  Thanks to
David Howells for his suggestions.

Signed-off-by: Matthew Wilcox <willy@linux.intel.com>
2008-04-17 10:42:54 -04:00
..
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:34 -04:00
2008-03-07 16:56:54 -06:00
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:54 -04:00