aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorManfred Spraul <manfred@dbl.q-ag.de>2006-03-26 05:19:42 -0500
committerLinus Torvalds <torvalds@g5.osdl.org>2006-03-26 12:46:36 -0500
commit64bc0430ee78c03c5c4ce549e217bb74bff7ea5d (patch)
treefdeb7f4caac07183c0f603579adb91288c024820
parent9ae21d1bb376436285cd5346d3e4b3655d6dd1b9 (diff)
[PATCH] one ipc/sem.c->mutex.c converstion too many..
Ingo's sem2mutex patch incorrectly replaced one reference to ipc/sem.c with ipc/mutex.c in a comment. Signed-off-by: Manfred Spraul <manfred@colorfullife.com> Signed-off-by: Linus Torvalds <torvalds@osdl.org>
-rw-r--r--ipc/mqueue.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/ipc/mqueue.c b/ipc/mqueue.c
index a3bb0c8201c7..532ec3bf18d6 100644
--- a/ipc/mqueue.c
+++ b/ipc/mqueue.c
@@ -762,7 +762,7 @@ out_unlock:
762 * The receiver accepts the message and returns without grabbing the queue 762 * The receiver accepts the message and returns without grabbing the queue
763 * spinlock. Therefore an intermediate STATE_PENDING state and memory barriers 763 * spinlock. Therefore an intermediate STATE_PENDING state and memory barriers
764 * are necessary. The same algorithm is used for sysv semaphores, see 764 * are necessary. The same algorithm is used for sysv semaphores, see
765 * ipc/mutex.c fore more details. 765 * ipc/sem.c fore more details.
766 * 766 *
767 * The same algorithm is used for senders. 767 * The same algorithm is used for senders.
768 */ 768 */