summaryrefslogtreecommitdiffstats
path: root/Documentation/rt-mutex-design.txt
diff options
context:
space:
mode:
authorXishi Qiu <qiuxishi@huawei.com>2013-11-06 13:18:21 -0800
committerJiri Kosina <jkosina@suse.cz>2013-12-02 14:45:19 +0100
commitc79a8d85d7f540e9dbe3e3111c41d14395a0c9e2 (patch)
tree198f357e8400c622c42303a663275371ba512350 /Documentation/rt-mutex-design.txt
parent48807e17101773117e36916f767fc12018e0eb21 (diff)
doc: fix some typos in documentations
Fix some typos in five documentations, no functional change. Signed-off-by: Xishi Qiu <qiuxishi@huawei.com> Acked-by: Rob Landley <rob@landley.net> Signed-off-by: Jiri Kosina <jkosina@suse.cz>
Diffstat (limited to 'Documentation/rt-mutex-design.txt')
-rw-r--r--Documentation/rt-mutex-design.txt2
1 files changed, 1 insertions, 1 deletions
diff --git a/Documentation/rt-mutex-design.txt b/Documentation/rt-mutex-design.txt
index a5bcd7f5c33..8666070d318 100644
--- a/Documentation/rt-mutex-design.txt
+++ b/Documentation/rt-mutex-design.txt
@@ -30,7 +30,7 @@ is something called unbounded priority inversion. That is when the high
priority process is prevented from running by a lower priority process for
an undetermined amount of time.
-The classic example of unbounded priority inversion is were you have three
+The classic example of unbounded priority inversion is where you have three
processes, let's call them processes A, B, and C, where A is the highest
priority process, C is the lowest, and B is in between. A tries to grab a lock
that C owns and must wait and lets C run to release the lock. But in the