Simplify semaphore implementation

Browse source

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>

...

This commit is contained in:

Matthew Wilcox 2008-03-14 14:35:22 -04:00 • committed by Matthew Wilcox

parent f1241c87a1

commit b17170b2fa

2 changed files with 27 additions and 60 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download patch file Download diff file Expand all files Collapse all files

9

include/linux/semaphore.h

View file

78

kernel/semaphore.c

View file