Simplify semaphore implementation
Matthew Wilcox authored

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: default avatarMatthew Wilcox <willy@linux.intel.com>
b17170b2
Name Last commit Last update
..