X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=Documentation%2Frt-mutex-design.txt;h=8666070d31896eeb0c54f820189b14d95bd1833d;hb=7227fc0666606b0df2c0d2966a7f4859b01bdf74;hp=a5bcd7f5c33fb4d1d818c35b2044b0382179d013;hpb=42249094f79422fbf5ed4b54eeb48ff096809b8f;p=firefly-linux-kernel-4.4.55.git

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
 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