path: root/Documentation/DocBook/kernel-locking.tmpl
diff options
mode: <>2006-06-26 19:05:40 +0200
committerAdrian Bunk <>2006-06-26 19:05:40 +0200
commit2e2d0dcc1bd7ca7c26ea5e29efb7f34bbd564f1c (patch)
tree425d5bbf1a5fac50cfba1d974651c786af940376 /Documentation/DocBook/kernel-locking.tmpl
parentf274afc9933e5fd5987a4a2a5f02687958f8ba65 (diff)
typo fixes
Signed-off-by: Adrian Bunk <>
Diffstat (limited to 'Documentation/DocBook/kernel-locking.tmpl')
1 files changed, 1 insertions, 1 deletions
diff --git a/Documentation/DocBook/kernel-locking.tmpl b/Documentation/DocBook/kernel-locking.tmpl
index 158ffe9bfade..644c3884fab9 100644
--- a/Documentation/DocBook/kernel-locking.tmpl
+++ b/Documentation/DocBook/kernel-locking.tmpl
@@ -1590,7 +1590,7 @@ the amount of locking which needs to be done.
Our final dilemma is this: when can we actually destroy the
removed element? Remember, a reader might be stepping through
- this element in the list right now: it we free this element and
+ this element in the list right now: if we free this element and
the <symbol>next</symbol> pointer changes, the reader will jump
off into garbage and crash. We need to wait until we know that
all the readers who were traversing the list when we deleted the