]> pilppa.com Git - linux-2.6-omap-h63xx.git/commit
projects / linux-2.6-omap-h63xx.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: f1241c8) | patch
Simplify semaphore implementation
authorMatthew Wilcox <matthew@wil.cx>
Fri, 14 Mar 2008 18:35:22 +0000 (14:35 -0400)
committerMatthew Wilcox <willy@linux.intel.com>
Thu, 17 Apr 2008 14:42:54 +0000 (10:42 -0400)
commitb17170b2fac96705db3188f093f89e8e838418e4
tree3264d8a297cff20338b606559274c36fbf663f04tree | snapshot
parentf1241c87a16c4fe9f4f51d6ed3589f031c505e8dcommit | 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>
include/linux/semaphore.h diff | blob | history
kernel/semaphore.c diff | blob | history
Unnamed repository; edit this file 'description' to name the repository.