aboutsummaryrefslogtreecommitdiffstats
path: root/Documentation/rt-mutex-design.txt
diff options
context:
space:
mode:
authorXishi Qiu <qiuxishi@huawei.com>2013-11-06 16:18:21 -0500
committerJiri Kosina <jkosina@suse.cz>2013-12-02 08:45:19 -0500
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 a5bcd7f5c33f..8666070d3189 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
30priority process is prevented from running by a lower priority process for 30priority process is prevented from running by a lower priority process for
31an undetermined amount of time. 31an undetermined amount of time.
32 32
33The classic example of unbounded priority inversion is were you have three 33The classic example of unbounded priority inversion is where you have three
34processes, let's call them processes A, B, and C, where A is the highest 34processes, let's call them processes A, B, and C, where A is the highest
35priority process, C is the lowest, and B is in between. A tries to grab a lock 35priority process, C is the lowest, and B is in between. A tries to grab a lock
36that C owns and must wait and lets C run to release the lock. But in the 36that C owns and must wait and lets C run to release the lock. But in the