Module Name:    src
Committed By:   andvar
Date:           Wed Dec  8 20:11:54 UTC 2021

Modified Files:
        src/common/lib/libc/arch/i386/string: strlen.S
        src/common/lib/libc/arch/x86_64/string: strlen.S
        src/lib/libc/include: reentrant.h
        src/sys/fs/ptyfs: ptyfs_vnops.c
        src/sys/miscfs/procfs: procfs_vnops.c

Log Message:
s/efficent/efficient/ in comments.


To generate a diff of this commit:
cvs rdiff -u -r1.3 -r1.4 src/common/lib/libc/arch/i386/string/strlen.S
cvs rdiff -u -r1.6 -r1.7 src/common/lib/libc/arch/x86_64/string/strlen.S
cvs rdiff -u -r1.20 -r1.21 src/lib/libc/include/reentrant.h
cvs rdiff -u -r1.67 -r1.68 src/sys/fs/ptyfs/ptyfs_vnops.c
cvs rdiff -u -r1.219 -r1.220 src/sys/miscfs/procfs/procfs_vnops.c

Please note that diffs are not public domain; they are subject to the
copyright notices on the relevant files.

Modified files:

Index: src/common/lib/libc/arch/i386/string/strlen.S
diff -u src/common/lib/libc/arch/i386/string/strlen.S:1.3 src/common/lib/libc/arch/i386/string/strlen.S:1.4
--- src/common/lib/libc/arch/i386/string/strlen.S:1.3	Mon Oct  4 21:02:40 2021
+++ src/common/lib/libc/arch/i386/string/strlen.S	Wed Dec  8 20:11:54 2021
@@ -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 @@ ENTRY(strlen)
 	/*
 	 * 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]:

Index: src/common/lib/libc/arch/x86_64/string/strlen.S
diff -u src/common/lib/libc/arch/x86_64/string/strlen.S:1.6 src/common/lib/libc/arch/x86_64/string/strlen.S:1.7
--- src/common/lib/libc/arch/x86_64/string/strlen.S:1.6	Sat Mar 22 19:16:34 2014
+++ src/common/lib/libc/arch/x86_64/string/strlen.S	Wed Dec  8 20:11:54 2021
@@ -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]:

Index: src/lib/libc/include/reentrant.h
diff -u src/lib/libc/include/reentrant.h:1.20 src/lib/libc/include/reentrant.h:1.21
--- src/lib/libc/include/reentrant.h:1.20	Wed Feb  8 18:00:37 2017
+++ src/lib/libc/include/reentrant.h	Wed Dec  8 20:11:54 2021
@@ -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-

Index: src/sys/fs/ptyfs/ptyfs_vnops.c
diff -u src/sys/fs/ptyfs/ptyfs_vnops.c:1.67 src/sys/fs/ptyfs/ptyfs_vnops.c:1.68
--- src/sys/fs/ptyfs/ptyfs_vnops.c:1.67	Wed Oct 20 03:08:17 2021
+++ src/sys/fs/ptyfs/ptyfs_vnops.c	Wed Dec  8 20:11:54 2021
@@ -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 @@ ptyfs_lookup(void *v)
  *
  * 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.

Index: src/sys/miscfs/procfs/procfs_vnops.c
diff -u src/sys/miscfs/procfs/procfs_vnops.c:1.219 src/sys/miscfs/procfs/procfs_vnops.c:1.220
--- src/sys/miscfs/procfs/procfs_vnops.c:1.219	Tue Oct  5 18:00:28 2021
+++ src/sys/miscfs/procfs/procfs_vnops.c	Wed Dec  8 20:11:54 2021
@@ -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 @@ procfs_root_readdir_callback(struct proc
  *
  * 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.

Reply via email to