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-02-14 00:09:55 -05: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-02 15:28:18 -07: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-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:34 -04:00
2008-04-17 10:42:34 -04:00
2008-04-17 10:42:34 -04:00
2008-03-08 20:29:43 +08:00
2008-04-17 10:42:54 -04:00
2008-02-18 11:15:19 -03:00
2008-04-13 23:40:51 -07:00
2008-02-08 14:47:26 -08:00
2008-03-05 12:04:09 -06:00
2008-02-22 14:20:08 -08:00