From a15f63a6fe43834f2c221da0b322b04fcc05a6d2 Mon Sep 17 00:00:00 2001
From: "Serge E. Hallyn" <serue@us.ibm.com>
Date: Tue, 28 Mar 2006 01:56:23 -0800
Subject: [PATCH] --- yaml --- r: 24465 b: refs/heads/master c:
 7b7a317cf863559b49b548a8b97b2f4bdf1e149e h: refs/heads/master i:   24463:
 398ae7b7ad9fe9be4cb2cab669c555bfa740d517 v: v3

---
 [refs]             | 2 +-
 trunk/ipc/mqueue.c | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/[refs] b/[refs]
index b43cbe9fd4de..dbea15abd21f 100644
--- a/[refs]
+++ b/[refs]
@@ -1,2 +1,2 @@
 ---
-refs/heads/master: 7a1e524a5fe6c5bf9dd4488e946fa835fda8c3d9
+refs/heads/master: 7b7a317cf863559b49b548a8b97b2f4bdf1e149e
diff --git a/trunk/ipc/mqueue.c b/trunk/ipc/mqueue.c
index 532ec3bf18d6..41ecbd440fed 100644
--- a/trunk/ipc/mqueue.c
+++ b/trunk/ipc/mqueue.c
@@ -762,7 +762,7 @@ asmlinkage long sys_mq_unlink(const char __user *u_name)
  * The receiver accepts the message and returns without grabbing the queue
  * spinlock. Therefore an intermediate STATE_PENDING state and memory barriers
  * are necessary. The same algorithm is used for sysv semaphores, see
- * ipc/sem.c fore more details.
+ * ipc/sem.c for more details.
  *
  * The same algorithm is used for senders.
  */