| commit | b17170b2fac96705db3188f093f89e8e838418e4 | [log] [tgz] |
|---|---|---|
| author | Matthew Wilcox <matthew@wil.cx> | Fri Mar 14 14:35:22 2008 -0400 |
| committer | Matthew Wilcox <willy@linux.intel.com> | Thu Apr 17 10:42:54 2008 -0400 |
| tree | 3264d8a297cff20338b606559274c36fbf663f04 | |
| parent | f1241c87a16c4fe9f4f51d6ed3589f031c505e8d [diff] |
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>