Module Name:    src
Committed By:   andvar
Date:           Mon Mar  6 21:39:06 UTC 2023

Modified Files:
        src/common/lib/libc/gen: radixtree.c
        src/sys/arch/mipsco/mipsco: machdep.c
        src/usr.bin/elf2ecoff: elf2ecoff.c

Log Message:
fix few typos in comments and log messages.


To generate a diff of this commit:
cvs rdiff -u -r1.28 -r1.29 src/common/lib/libc/gen/radixtree.c
cvs rdiff -u -r1.80 -r1.81 src/sys/arch/mipsco/mipsco/machdep.c
cvs rdiff -u -r1.33 -r1.34 src/usr.bin/elf2ecoff/elf2ecoff.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/gen/radixtree.c
diff -u src/common/lib/libc/gen/radixtree.c:1.28 src/common/lib/libc/gen/radixtree.c:1.29
--- src/common/lib/libc/gen/radixtree.c:1.28	Tue May 24 20:50:17 2022
+++ src/common/lib/libc/gen/radixtree.c	Mon Mar  6 21:39:06 2023
@@ -1,4 +1,4 @@
-/*	$NetBSD: radixtree.c,v 1.28 2022/05/24 20:50:17 andvar Exp $	*/
+/*	$NetBSD: radixtree.c,v 1.29 2023/03/06 21:39:06 andvar Exp $	*/
 
 /*-
  * Copyright (c)2011,2012,2013 YAMAMOTO Takashi,
@@ -104,7 +104,7 @@
  * intermediate nodes and quickly skips uninterested parts of a tree.
  *
  * A tree has RADIX_TREE_TAG_ID_MAX independent tag spaces, each of which are
- * identified by an zero-origin numbers, tagid.  For the current implementation,
+ * identified by a zero-origin numbers, tagid.  For the current implementation,
  * RADIX_TREE_TAG_ID_MAX is 2.  A set of tags is described as a bitmask tagmask,
  * which is a bitwise OR of (1 << tagid).
  */
@@ -112,7 +112,7 @@
 #include <sys/cdefs.h>
 
 #if defined(_KERNEL) || defined(_STANDALONE)
-__KERNEL_RCSID(0, "$NetBSD: radixtree.c,v 1.28 2022/05/24 20:50:17 andvar Exp $");
+__KERNEL_RCSID(0, "$NetBSD: radixtree.c,v 1.29 2023/03/06 21:39:06 andvar Exp $");
 #include <sys/param.h>
 #include <sys/errno.h>
 #include <sys/pool.h>
@@ -122,7 +122,7 @@ __KERNEL_RCSID(0, "$NetBSD: radixtree.c,
 #include <lib/libsa/stand.h>
 #endif /* defined(_STANDALONE) */
 #else /* defined(_KERNEL) || defined(_STANDALONE) */
-__RCSID("$NetBSD: radixtree.c,v 1.28 2022/05/24 20:50:17 andvar Exp $");
+__RCSID("$NetBSD: radixtree.c,v 1.29 2023/03/06 21:39:06 andvar Exp $");
 #include <assert.h>
 #include <errno.h>
 #include <stdbool.h>
@@ -912,7 +912,7 @@ descend:
 		/*
 		 * following the left-most (or right-most in the case of
 		 * reverse scan) child node, descend until reaching the leaf or
-		 * an non-matching entry.
+		 * a non-matching entry.
 		 */
 		while (entry_match_p(*vpp, tagmask) && lastidx < t->t_height) {
 			/*
@@ -952,7 +952,7 @@ descend:
  * Note that this function doesn't return index values of found nodes.
  * Thus, in the case of dense == false, if index values are important for
  * a caller, it's the caller's responsibility to check them, typically
- * by examinining the returned nodes using some caller-specific knowledge
+ * by examining the returned nodes using some caller-specific knowledge
  * about them.
  * In the case of dense == true, a node returned via results[N] is always for
  * the index (idx + N).

Index: src/sys/arch/mipsco/mipsco/machdep.c
diff -u src/sys/arch/mipsco/mipsco/machdep.c:1.80 src/sys/arch/mipsco/mipsco/machdep.c:1.81
--- src/sys/arch/mipsco/mipsco/machdep.c:1.80	Thu Dec 22 14:47:58 2016
+++ src/sys/arch/mipsco/mipsco/machdep.c	Mon Mar  6 21:39:06 2023
@@ -1,4 +1,4 @@
-/*	$NetBSD: machdep.c,v 1.80 2016/12/22 14:47:58 cherry Exp $	*/
+/*	$NetBSD: machdep.c,v 1.81 2023/03/06 21:39:06 andvar Exp $	*/
 
 /*
  * Copyright (c) 1988 University of Utah.
@@ -39,7 +39,7 @@
 
 #include <sys/cdefs.h>			/* RCS ID & Copyright macro defns */
 
-__KERNEL_RCSID(0, "$NetBSD: machdep.c,v 1.80 2016/12/22 14:47:58 cherry Exp $");
+__KERNEL_RCSID(0, "$NetBSD: machdep.c,v 1.81 2023/03/06 21:39:06 andvar Exp $");
 
 /* from: Utah Hdr: machdep.c 1.63 91/04/24 */
 
@@ -197,7 +197,7 @@ mach_init(int argc, char *argv[], char *
 #if NKSYMS || defined(DDB) || defined(LKM)
 	bi_syms = lookup_bootinfo(BTINFO_SYMTAB);
 
-	/* Load sysmbol table if present */
+	/* Load symbol table if present */
 	if (bi_syms != NULL) {
 		ssym = (void *)bi_syms->ssym;
 		esym = (void *)bi_syms->esym;

Index: src/usr.bin/elf2ecoff/elf2ecoff.c
diff -u src/usr.bin/elf2ecoff/elf2ecoff.c:1.33 src/usr.bin/elf2ecoff/elf2ecoff.c:1.34
--- src/usr.bin/elf2ecoff/elf2ecoff.c:1.33	Fri Feb 24 17:19:14 2017
+++ src/usr.bin/elf2ecoff/elf2ecoff.c	Mon Mar  6 21:39:06 2023
@@ -1,4 +1,4 @@
-/*	$NetBSD: elf2ecoff.c,v 1.33 2017/02/24 17:19:14 christos Exp $	*/
+/*	$NetBSD: elf2ecoff.c,v 1.34 2023/03/06 21:39:06 andvar Exp $	*/
 
 /*
  * Copyright (c) 1997 Jonathan Stone
@@ -246,7 +246,7 @@ usage:
 			nbss.len = ph[i].p_memsz - ph[i].p_filesz;
 
 			if (debug) {
-				fprintf(stderr, "  combinining PH %zu type %d "
+				fprintf(stderr, "  combining PH %zu type %d "
 				    "flags %#x with data, ndata = %d, "
 				    "nbss =%d\n", i, ph[i].p_type,
 				    ph[i].p_flags, ndata.len, nbss.len);
@@ -259,7 +259,7 @@ usage:
 			ntxt.vaddr = ph[i].p_vaddr;
 			ntxt.len = ph[i].p_filesz;
 			if (debug) {
-				fprintf(stderr, "  combinining PH %zu type %d "
+				fprintf(stderr, "  combining PH %zu type %d "
 				    "flags %#x with text, len = %d\n",
 				    i, ph[i].p_type, ph[i].p_flags, ntxt.len);
 			}
@@ -717,7 +717,7 @@ elf_symbol_table_to_ecoff(int out, int i
 
 
 /*
- * In-memory translation of ELF symbosl to ECOFF.
+ * In-memory translation of ELF symbols to ECOFF.
  */
 static void
 translate_syms(struct elf_syms *elfp, struct ecoff_syms *ecoffp)

Reply via email to