spelling

diff --git a/lib/libc/arch/amd64/string/strlen.S b/lib/libc/arch/amd64/string/strlen.S
index 881c5f1..02a57b4 100644 (file)
--- a/lib/libc/arch/amd64/string/strlen.S
+++ b/lib/libc/arch/amd64/string/strlen.S
@@ -1,4 +1,4 @@
-/*     $OpenBSD: strlen.S,v 1.8 2018/07/03 23:14:05 mortimer Exp $     */
+/*     $OpenBSD: strlen.S,v 1.9 2022/01/11 09:21:34 jsg Exp $  */
 /*     $NetBSD: strlen.S,v 1.6 2014/03/22 19:16:34 jakllsch Exp $      */
 
 /*-
@@ -40,7 +40,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]:
@@ -98,7 +98,7 @@
  * the rate of false positives is low.
  *
  * This is likely, because the false positive can only occur
- * if the most siginificant bit of a byte within the word is set.
+ * if the most significant bit of a byte within the word is set.
  * The expression will never fail for typical 7-bit ASCII strings.
  *
  * This typically takes 2 instructions not including those needed

diff --git a/lib/libc/gmon/mcount.c b/lib/libc/gmon/mcount.c
index f0ce70d..6846c10 100644 (file)
--- a/lib/libc/gmon/mcount.c
+++ b/lib/libc/gmon/mcount.c
@@ -1,4 +1,4 @@
-/*     $OpenBSD: mcount.c,v 1.15 2015/01/16 16:48:51 deraadt Exp $ */
+/*     $OpenBSD: mcount.c,v 1.16 2022/01/11 09:21:34 jsg Exp $ */
 /*-
  * Copyright (c) 1983, 1992, 1993
  *     The Regents of the University of California.  All rights reserved.
@@ -55,7 +55,7 @@ _MCOUNT_DECL(u_long frompc, u_long selfpc)
 
        /*
         * Do not profile execution if memory for the current CPU
-        * desciptor and profiling buffers has not yet been allocated
+        * descriptor and profiling buffers has not yet been allocated
         * or if the CPU we are running on has not yet set its trap
         * handler.
         */

diff --git a/sys/lib/libkern/arch/amd64/strlen.S b/sys/lib/libkern/arch/amd64/strlen.S
index f17d7c7..d1a8218 100644 (file)
--- a/sys/lib/libkern/arch/amd64/strlen.S
+++ b/sys/lib/libkern/arch/amd64/strlen.S
@@ -1,4 +1,4 @@
-/*     $OpenBSD: strlen.S,v 1.7 2018/07/13 05:56:57 guenther Exp $     */
+/*     $OpenBSD: strlen.S,v 1.8 2022/01/11 09:21:34 jsg Exp $  */
 /*     $NetBSD: strlen.S,v 1.6 2014/03/22 19:16:34 jakllsch Exp $      */
 
 /*-
@@ -40,7 +40,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]:
@@ -98,7 +98,7 @@
  * the rate of false positives is low.
  *
  * This is likely, because the false positive can only occur
- * if the most siginificant bit of a byte within the word is set.
+ * if the most significant bit of a byte within the word is set.
  * The expression will never fail for typical 7-bit ASCII strings.
  *
  * This typically takes 2 instructions not including those needed

diff --git a/sys/lib/libkern/arch/hppa/milli.S b/sys/lib/libkern/arch/hppa/milli.S
index 6956bc8..90b9a86 100644 (file)
--- a/sys/lib/libkern/arch/hppa/milli.S
+++ b/sys/lib/libkern/arch/hppa/milli.S
@@ -1,4 +1,4 @@
-;      $OpenBSD: milli.S,v 1.5 2001/03/29 04:08:20 mickey Exp $
+;      $OpenBSD: milli.S,v 1.6 2022/01/11 09:21:35 jsg Exp $
 ;
 ;  (c) Copyright 1986 HEWLETT-PACKARD COMPANY
 ;
@@ -180,7 +180,7 @@ pidr2: .equ 9
 
 cr10: .equ     10
 
-ccr: .equ      10                      ; Coprocessor Confiquration Register
+ccr: .equ      10                      ; Coprocessor Configuration Register
 
 cr11: .equ     11
 
@@ -228,7 +228,7 @@ ior: .equ   21                      ; Interruption Offset Register
 
 cr22: .equ     22
 
-ipsw: .equ     22                      ; Interrpution Processor Status Word
+ipsw: .equ     22                      ; Interruption Processor Status Word
 
 cr23: .equ     23
 
@@ -236,7 +236,7 @@ eirr: .equ  23                      ; External Interrupt Request
 
 cr24: .equ     24
 
-ppda: .equ     24                      ; Physcial Page Directory Address
+ppda: .equ     24                      ; Physical Page Directory Address
 
 tr0: .equ      24                      ; Temporary register 0
 

diff --git a/sys/lib/libkern/arch/m88k/bzero.S b/sys/lib/libkern/arch/m88k/bzero.S
index bccf23d..a5e03a6 100644 (file)
--- a/sys/lib/libkern/arch/m88k/bzero.S
+++ b/sys/lib/libkern/arch/m88k/bzero.S
@@ -1,4 +1,4 @@
-/*     $OpenBSD: bzero.S,v 1.2 2013/01/05 11:20:56 miod Exp $  */
+/*     $OpenBSD: bzero.S,v 1.3 2022/01/11 09:21:35 jsg Exp $   */
 /*
  * Mach Operating System
  * Copyright (c) 1993-1992 Carnegie Mellon University
@@ -99,7 +99,7 @@ ASLOCAL(top_of_main_loop)
         * Since we're doing the max, we know exactly where we're
         * jumping (the first one in the list!), so we can jump
         * right there.  However, we've still got to adjust
-        * the length, so we'll jump to where we ajust the length
+        * the length, so we'll jump to where we adjust the length
         * which just happens to fall through to the first store zero
         * in the list.
         *

diff --git a/sys/lib/libkern/mcount.c b/sys/lib/libkern/mcount.c
index 684ddad..e020ded 100644 (file)
--- a/sys/lib/libkern/mcount.c
+++ b/sys/lib/libkern/mcount.c
@@ -1,4 +1,4 @@
-/*     $OpenBSD: mcount.c,v 1.13 2013/03/12 09:37:16 mpi Exp $ */
+/*     $OpenBSD: mcount.c,v 1.14 2022/01/11 09:21:34 jsg Exp $ */
 /*     $NetBSD: mcount.c,v 1.3.6.1 1996/06/12 04:23:01 cgd Exp $       */
 
 /*-
@@ -57,7 +57,7 @@ _MCOUNT_DECL(u_long frompc, u_long selfpc)
 
        /*
         * Do not profile execution if memory for the current CPU
-        * desciptor and profiling buffers has not yet been allocated
+        * descriptor and profiling buffers has not yet been allocated
         * or if the CPU we are running on has not yet set its trap
         * handler.
         */