Fix 2-phase, in-order queue run delivery order

[exim.git] / doc / doc-misc / Ext-mbx-locking

diff --git a/doc/doc-misc/Ext-mbx-locking b/doc/doc-misc/Ext-mbx-locking
index f1b0523f69f35d928ebca7e005df0301c6c801df..30a547f63640df89f40ee910fb2b781f8f2d0521 100644 (file)
--- a/doc/doc-misc/Ext-mbx-locking
+++ b/doc/doc-misc/Ext-mbx-locking
@@ -43,7 +43,7 @@ writeable memory between such processes.
 
      A means of communicating this is by use of a file with a mutually
 agreed upon name.  A binary semaphore can be passed by means of the
-existance or non-existance of that file, provided that there is an
+existence or non-existence of that file, provided that there is an
 atomic means to create a file if and only if that file does not exist.
 In C terms:
 
@@ -81,7 +81,7 @@ locks held by that process when it terminates.
 exclusive (provided there are no other shared users of the lock) and
 to downgrade an exclusive lock to shared.  It is important that at no
 time is the lock ever removed; a process upgrading to exclusive must
-not relenquish its shared lock.
+not relinquish its shared lock.
 
      Most commonly, the resources being locked are files.  Shared
 locks are particularly important with files; multiple simultaneous
@@ -228,7 +228,7 @@ BEZERK AND MMDF
 
      Locking in the traditional UNIX formats was largely dictated by
 the status quo in other applications; however, additional protection
-is added against inadvertantly running multiple instances of a
+is added against inadvertently running multiple instances of a
 c-client application on the same mail file.
 
      (1) c-client attempts to create a .lock file (mail file name with