diff options
| author | jkoshy <jkoshy@FreeBSD.org> | 1998-06-06 05:50:53 +0000 |
|---|---|---|
| committer | jkoshy <jkoshy@FreeBSD.org> | 1998-06-06 05:50:53 +0000 |
| commit | 0d7d76d9824e92ac3e2d5c95c38338e47b940aad (patch) | |
| tree | be821f05efcc76f3383e79528b109973541e2d79 /share | |
| parent | b4a37e244c5a9f59a7cc8f6048914ad390dd6bb6 (diff) | |
| download | FreeBSD-src-0d7d76d9824e92ac3e2d5c95c38338e47b940aad.zip FreeBSD-src-0d7d76d9824e92ac3e2d5c95c38338e47b940aad.tar.gz | |
Spelling corrections.
PR: 6868
Submitted by: Josh Gilliam <josh@quick.net>
Diffstat (limited to 'share')
| -rw-r--r-- | share/man/man3/intro.3 | 4 | ||||
| -rw-r--r-- | share/man/man3/queue.3 | 4 |
2 files changed, 4 insertions, 4 deletions
diff --git a/share/man/man3/intro.3 b/share/man/man3/intro.3 index 9142637..dbef4f5 100644 --- a/share/man/man3/intro.3 +++ b/share/man/man3/intro.3 @@ -30,7 +30,7 @@ .\" SUCH DAMAGE. .\" .\" @(#)intro.3 8.1 (Berkeley) 6/5/93 -.\" $Id$ +.\" $Id: intro.3,v 1.5 1997/02/22 13:24:16 peter Exp $ .\" .Dd June 5, 1993 .Dt INTRO 3 @@ -100,7 +100,7 @@ Use of these routines should, for the most part, be avoided. The manual page entry for each compatibility routine indicates the proper interface to use. .It Xr libkvm Pq Fl l Ns Ar kvm -Fuctions used to access kernel memory are in this library. They can be used +Functions used to access kernel memory are in this library. They can be used against both a running system and a crash dump. .Pq See Xr kvm 3 . ) .It Xr libl Pq Fl l Ns Ar l diff --git a/share/man/man3/queue.3 b/share/man/man3/queue.3 index 46ce9db..364be86 100644 --- a/share/man/man3/queue.3 +++ b/share/man/man3/queue.3 @@ -30,7 +30,7 @@ .\" SUCH DAMAGE. .\" .\" @(#)queue.3 8.2 (Berkeley) 1/24/94 -.\" $Id: queue.3,v 1.11 1997/03/09 00:49:00 mpp Exp $ +.\" $Id: queue.3,v 1.12 1997/03/19 02:57:50 bde Exp $ .\" .Dd January 24, 1994 .Dt QUEUE 3 @@ -598,7 +598,7 @@ while (head.lh_first != NULL) { /* List Deletion. */ n1 = head.lh_first; /* Faster List Delete. */ while (n1 != NULL) { - n2 = n1->entires.le_next; + n2 = n1->entries.le_next; free(n1); n1 = n2; } |
