Source-Changes-HG archive
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index][Old Index]
[src/trunk]: src/sys/miscfs/procfs s/efficent/efficient/ in comments.
details: https://anonhg.NetBSD.org/src/rev/fd6c20ba3db5
branches: trunk
changeset: 1027170:fd6c20ba3db5
user: andvar <andvar%NetBSD.org@localhost>
date: Wed Dec 08 20:11:54 2021 +0000
description:
s/efficent/efficient/ in comments.
diffstat:
common/lib/libc/arch/i386/string/strlen.S | 4 ++--
common/lib/libc/arch/x86_64/string/strlen.S | 6 +++---
lib/libc/include/reentrant.h | 4 ++--
sys/fs/ptyfs/ptyfs_vnops.c | 6 +++---
sys/miscfs/procfs/procfs_vnops.c | 6 +++---
5 files changed, 13 insertions(+), 13 deletions(-)
diffs (118 lines):
diff -r 5f2549610059 -r fd6c20ba3db5 common/lib/libc/arch/i386/string/strlen.S
--- a/common/lib/libc/arch/i386/string/strlen.S Wed Dec 08 20:03:26 2021 +0000
+++ b/common/lib/libc/arch/i386/string/strlen.S Wed Dec 08 20:11:54 2021 +0000
@@ -6,7 +6,7 @@
#include <machine/asm.h>
#if defined(LIBC_SCCS)
- RCSID("$NetBSD: strlen.S,v 1.3 2021/10/04 21:02:40 andvar Exp $")
+ RCSID("$NetBSD: strlen.S,v 1.4 2021/12/08 20:11:54 andvar Exp $")
#endif
ENTRY(strlen)
@@ -24,7 +24,7 @@
/*
* There are many well known branch-free sequences which are used
* for determining whether a zero-byte is contained within a word.
- * These sequences are generally much more efficent than loading
+ * These sequences are generally much more efficient than loading
* and comparing each byte individually.
*
* The expression [1,2]:
diff -r 5f2549610059 -r fd6c20ba3db5 common/lib/libc/arch/x86_64/string/strlen.S
--- a/common/lib/libc/arch/x86_64/string/strlen.S Wed Dec 08 20:03:26 2021 +0000
+++ b/common/lib/libc/arch/x86_64/string/strlen.S Wed Dec 08 20:11:54 2021 +0000
@@ -1,4 +1,4 @@
-/* $NetBSD: strlen.S,v 1.6 2014/03/22 19:16:34 jakllsch Exp $ */
+/* $NetBSD: strlen.S,v 1.7 2021/12/08 20:11:54 andvar Exp $ */
/*-
* Copyright (c) 2009 The NetBSD Foundation, Inc.
@@ -37,13 +37,13 @@
#include <machine/asm.h>
#if defined(LIBC_SCCS)
- RCSID("$NetBSD: strlen.S,v 1.6 2014/03/22 19:16:34 jakllsch Exp $")
+ RCSID("$NetBSD: strlen.S,v 1.7 2021/12/08 20:11:54 andvar Exp $")
#endif
/*
* There are many well known branch-free sequences which are used
* for determining whether a zero-byte is contained within a word.
- * These sequences are generally much more efficent than loading
+ * These sequences are generally much more efficient than loading
* and comparing each byte individually.
*
* The expression [1,2]:
diff -r 5f2549610059 -r fd6c20ba3db5 lib/libc/include/reentrant.h
--- a/lib/libc/include/reentrant.h Wed Dec 08 20:03:26 2021 +0000
+++ b/lib/libc/include/reentrant.h Wed Dec 08 20:11:54 2021 +0000
@@ -1,4 +1,4 @@
-/* $NetBSD: reentrant.h,v 1.20 2017/02/08 18:00:37 christos Exp $ */
+/* $NetBSD: reentrant.h,v 1.21 2021/12/08 20:11:54 andvar Exp $ */
/*-
* Copyright (c) 1997, 1998, 2003 The NetBSD Foundation, Inc.
@@ -49,7 +49,7 @@
* One approach for thread safety is to provide discrete versions of the
* library: one thread safe, the other not. The disadvantage of this is
* that libc is rather large, and two copies of a library which are 99%+
- * identical is not an efficent use of resources.
+ * identical is not an efficient use of resources.
*
* Another approach is to provide a single thread safe library. However,
* it should not add significant run time or code size overhead to non-
diff -r 5f2549610059 -r fd6c20ba3db5 sys/fs/ptyfs/ptyfs_vnops.c
--- a/sys/fs/ptyfs/ptyfs_vnops.c Wed Dec 08 20:03:26 2021 +0000
+++ b/sys/fs/ptyfs/ptyfs_vnops.c Wed Dec 08 20:11:54 2021 +0000
@@ -1,4 +1,4 @@
-/* $NetBSD: ptyfs_vnops.c,v 1.67 2021/10/20 03:08:17 thorpej Exp $ */
+/* $NetBSD: ptyfs_vnops.c,v 1.68 2021/12/08 20:11:54 andvar Exp $ */
/*
* Copyright (c) 1993, 1995
@@ -76,7 +76,7 @@
*/
#include <sys/cdefs.h>
-__KERNEL_RCSID(0, "$NetBSD: ptyfs_vnops.c,v 1.67 2021/10/20 03:08:17 thorpej Exp $");
+__KERNEL_RCSID(0, "$NetBSD: ptyfs_vnops.c,v 1.68 2021/12/08 20:11:54 andvar Exp $");
#include <sys/param.h>
#include <sys/systm.h>
@@ -633,7 +633,7 @@
*
* the strategy here with ptyfs is to generate a single
* directory entry at a time (struct dirent) and then
- * copy that out to userland using uiomove. a more efficent
+ * copy that out to userland using uiomove. a more efficient
* though more complex implementation, would try to minimize
* the number of calls to uiomove(). for ptyfs, this is
* hardly worth the added code complexity.
diff -r 5f2549610059 -r fd6c20ba3db5 sys/miscfs/procfs/procfs_vnops.c
--- a/sys/miscfs/procfs/procfs_vnops.c Wed Dec 08 20:03:26 2021 +0000
+++ b/sys/miscfs/procfs/procfs_vnops.c Wed Dec 08 20:11:54 2021 +0000
@@ -1,4 +1,4 @@
-/* $NetBSD: procfs_vnops.c,v 1.219 2021/10/05 18:00:28 christos Exp $ */
+/* $NetBSD: procfs_vnops.c,v 1.220 2021/12/08 20:11:54 andvar Exp $ */
/*-
* Copyright (c) 2006, 2007, 2008, 2020 The NetBSD Foundation, Inc.
@@ -105,7 +105,7 @@
*/
#include <sys/cdefs.h>
-__KERNEL_RCSID(0, "$NetBSD: procfs_vnops.c,v 1.219 2021/10/05 18:00:28 christos Exp $");
+__KERNEL_RCSID(0, "$NetBSD: procfs_vnops.c,v 1.220 2021/12/08 20:11:54 andvar Exp $");
#include <sys/param.h>
#include <sys/atomic.h>
@@ -1259,7 +1259,7 @@
*
* the strategy here with procfs is to generate a single
* directory entry at a time (struct dirent) and then
- * copy that out to userland using uiomove. a more efficent
+ * copy that out to userland using uiomove. a more efficient
* though more complex implementation, would try to minimize
* the number of calls to uiomove(). for procfs, this is
* hardly worth the added code complexity.
Home |
Main Index |
Thread Index |
Old Index