double words;

from Bruno Rohee

5 files changed, 10 insertions, 10 deletions

diff --git a/share/doc/papers/diskperf/conclusions.ms b/share/doc/papers/diskperf/conclusions.ms
index 9e8c43e5df0..4d3ca3c60c8 100644
--- a/share/doc/papers/diskperf/conclusions.ms
+++ b/share/doc/papers/diskperf/conclusions.ms
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: conclusions.ms,v 1.3 2003/06/02 23:30:09 millert Exp $
+.\"	$OpenBSD: conclusions.ms,v 1.4 2003/10/30 14:52:24 jmc Exp $
 .\"
 .\" Copyright (c) 1983 The Regents of the University of California.
 .\" All rights reserved.
@@ -56,7 +56,7 @@ against the future value and expandability of newer technologies.
 Two important conclusions about storage systems in general
 can be drawn from these tests.
 The first is that buffering can be effective in smoothing
-the the effects of lower bus speeds and bus contention.
+the effects of lower bus speeds and bus contention.
 Even though the UDA50 is located on the relatively slow
 UNIBUS, its performance is similar to controllers located on
 the faster processor busses.
diff --git a/share/doc/papers/diskperf/tests.ms b/share/doc/papers/diskperf/tests.ms
index a961be50e39..d2fdcb9a774 100644
--- a/share/doc/papers/diskperf/tests.ms
+++ b/share/doc/papers/diskperf/tests.ms
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: tests.ms,v 1.3 2003/06/02 23:30:09 millert Exp $
+.\"	$OpenBSD: tests.ms,v 1.4 2003/10/30 14:52:24 jmc Exp $
 .\"
 .\" Copyright (c) 1983 The Regents of the University of California.
 .\" All rights reserved.
@@ -37,7 +37,7 @@ Our battery of tests consists of four programs,
 read_8192, write_8192, write_4096
 and rewrite_8192 originally written by [McKusick83]
 to evaluate the performance of the new file system in 4.2BSD.
-These programs all follow the the same model and are typified by
+These programs all follow the same model and are typified by
 read_8192 shown here.
 .DS
 #define	BUFSIZ 8192
diff --git a/share/doc/papers/kernmalloc/kernmalloc.t b/share/doc/papers/kernmalloc/kernmalloc.t
index 0539811a041..deb9b40bf35 100644
--- a/share/doc/papers/kernmalloc/kernmalloc.t
+++ b/share/doc/papers/kernmalloc/kernmalloc.t
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: kernmalloc.t,v 1.3 2003/06/02 23:30:09 millert Exp $
+.\"	$OpenBSD: kernmalloc.t,v 1.4 2003/10/30 14:52:24 jmc Exp $
 .\"
 .\" Copyright (c) 1988 The Regents of the University of California.
 .\" All rights reserved.
@@ -598,7 +598,7 @@ Two of the traditional UNIX
 memory allocators remain in the current system.
 The terminal subsystem uses \fIclist\fP\^s (character lists).
 That part of the system is expected to undergo major revision within
-the the next year or so, and it will probably be changed to use
+the next year or so, and it will probably be changed to use
 \fImbuf\fP\^s as it is merged into the network system.
 The other major allocator that remains is
 .RN getblk ,
diff --git a/share/doc/papers/kerntune/1.t b/share/doc/papers/kerntune/1.t
index c95c17b05bc..a5d6e6b450e 100644
--- a/share/doc/papers/kerntune/1.t
+++ b/share/doc/papers/kerntune/1.t
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: 1.t,v 1.3 2003/06/02 23:30:09 millert Exp $
+.\"	$OpenBSD: 1.t,v 1.4 2003/10/30 14:52:24 jmc Exp $
 .\"
 .\" Copyright (c) 1984 M. K. McKusick
 .\" Copyright (c) 1984 The Regents of the University of California.
@@ -35,7 +35,7 @@
 Introduction
 .PP
 The purpose of this paper is to describe the tools and techniques 
-that are available for improving the performance of the the kernel.
+that are available for improving the performance of the kernel.
 The primary tool used to measure the kernel is the hierarchical
 profiler \fIgprof\fP.
 The profiler enables the user to measure the cost of
diff --git a/share/doc/papers/newvm/a.t b/share/doc/papers/newvm/a.t
index 11c7547e2b2..0be41f29901 100644
--- a/share/doc/papers/newvm/a.t
+++ b/share/doc/papers/newvm/a.t
@@ -1,4 +1,4 @@
-.\"	$OpenBSD: a.t,v 1.3 2003/06/02 23:30:09 millert Exp $
+.\"	$OpenBSD: a.t,v 1.4 2003/10/30 14:52:24 jmc Exp $
 .\"
 .\" Copyright (c) 1986 The Regents of the University of California.
 .\" All rights reserved.
@@ -198,7 +198,7 @@ value = mset(sem, wait)
 result int value; semaphore *sem; int wait;
 .DE
 \fIMset\fP indivisibly tests and sets the semaphore \fIsem\fP.
-If the the previous value is zero, the process has acquired the lock
+If the previous value is zero, the process has acquired the lock
 and \fImset\fP returns true immediately.
 Otherwise, if the \fIwait\fP flag is zero,
 failure is returned.