diff options
| author | Jason McIntyre <jmc@cvs.openbsd.org> | 2006-11-15 17:25:41 +0000 |
|---|---|---|
| committer | Jason McIntyre <jmc@cvs.openbsd.org> | 2006-11-15 17:25:41 +0000 |
| commit | e18952f867bd725a272116b9df6aae3be96e5489 (patch) | |
| tree | 46502b80496aea2dd9caa3659e98b4f2b0761e73 /sys/kern/kern_lkm.c | |
| parent | 73ecd14bdf4f2b776887ebff4d9cfea758750261 (diff) | |
typos; from bret lambert
Diffstat (limited to 'sys/kern/kern_lkm.c')
| -rw-r--r-- | sys/kern/kern_lkm.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/sys/kern/kern_lkm.c b/sys/kern/kern_lkm.c index 9b26605a14b..8abf7606f98 100644 --- a/sys/kern/kern_lkm.c +++ b/sys/kern/kern_lkm.c @@ -1,4 +1,4 @@ -/* $OpenBSD: kern_lkm.c,v 1.42 2005/11/28 00:14:28 jsg Exp $ */ +/* $OpenBSD: kern_lkm.c,v 1.43 2006/11/15 17:25:40 jmc Exp $ */ /* $NetBSD: kern_lkm.c,v 1.31 1996/03/31 21:40:27 christos Exp $ */ /* @@ -156,7 +156,7 @@ lkmalloc(void) ret->sym_id = -1; /* * walk the list finding the first free id. as long as the list is - * kept sorted this is not too ineffcient, which is why we insert in + * kept sorted this is not too inefficient, which is why we insert in * order below. */ TAILQ_FOREACH(p, &lkmods, list) { |