summaryrefslogtreecommitdiff
path: root/common
diff options
context:
space:
mode:
authorandvar <andvar@NetBSD.org>2022-05-24 20:50:17 +0000
committerandvar <andvar@NetBSD.org>2022-05-24 20:50:17 +0000
commit6a7344abbe6abad17f26ce35ffb034dc29b9c2c9 (patch)
tree574c44f364521acb5554cf341884a2d06d106f0b /common
parent15c4694562c12c74c3d67cc46ded2909c5aec357 (diff)
fix various typos in comment, documentation and log messages.
Diffstat (limited to 'common')
-rw-r--r--common/lib/libc/gen/ptree.c10
-rw-r--r--common/lib/libc/gen/radixtree.c8
2 files changed, 9 insertions, 9 deletions
diff --git a/common/lib/libc/gen/ptree.c b/common/lib/libc/gen/ptree.c
index da189550032..15b407afa7c 100644
--- a/common/lib/libc/gen/ptree.c
+++ b/common/lib/libc/gen/ptree.c
@@ -1,4 +1,4 @@
-/* $NetBSD: ptree.c,v 1.10 2012/10/06 22:15:09 matt Exp $ */
+/* $NetBSD: ptree.c,v 1.11 2022/05/24 20:50:17 andvar Exp $ */
/*-
* Copyright (c) 2008 The NetBSD Foundation, Inc.
@@ -40,7 +40,7 @@
#include <sys/types.h>
#include <sys/systm.h>
#include <lib/libkern/libkern.h>
-__KERNEL_RCSID(0, "$NetBSD: ptree.c,v 1.10 2012/10/06 22:15:09 matt Exp $");
+__KERNEL_RCSID(0, "$NetBSD: ptree.c,v 1.11 2022/05/24 20:50:17 andvar Exp $");
#else
#include <stddef.h>
#include <stdint.h>
@@ -53,7 +53,7 @@ __KERNEL_RCSID(0, "$NetBSD: ptree.c,v 1.10 2012/10/06 22:15:09 matt Exp $");
#else
#define KASSERT(e) do { } while (/*CONSTCOND*/ 0)
#endif
-__RCSID("$NetBSD: ptree.c,v 1.10 2012/10/06 22:15:09 matt Exp $");
+__RCSID("$NetBSD: ptree.c,v 1.11 2022/05/24 20:50:17 andvar Exp $");
#endif /* _KERNEL || _STANDALONE */
#ifdef _LIBC
@@ -582,7 +582,7 @@ ptree_insert_node_common(pt_tree_t *pt, void *item)
KASSERT(id.id_bitoff >= branch_bitoff);
/*
- * Decend the tree one level.
+ * Descend the tree one level.
*/
id.id_parent = ptn;
id.id_parent_slot = ptree_testnode(pt, target, id.id_parent);
@@ -1011,7 +1011,7 @@ ptree_remove_node(pt_tree_t *pt, void *item)
/*
* Now we are the normal removal case. Since after the
* target's leaf identity is removed from the its parent,
- * that parent will only have one decendent. So we can
+ * that parent will only have one descendant. So we can
* just as easily replace the node that has the parent's
* branch identity with the surviving node. This freeing
* parent from its branching duties which means it can
diff --git a/common/lib/libc/gen/radixtree.c b/common/lib/libc/gen/radixtree.c
index fc3ec78471a..dd391e6a9c0 100644
--- a/common/lib/libc/gen/radixtree.c
+++ b/common/lib/libc/gen/radixtree.c
@@ -1,4 +1,4 @@
-/* $NetBSD: radixtree.c,v 1.27 2020/05/14 08:34:19 msaitoh Exp $ */
+/* $NetBSD: radixtree.c,v 1.28 2022/05/24 20:50:17 andvar Exp $ */
/*-
* Copyright (c)2011,2012,2013 YAMAMOTO Takashi,
@@ -112,7 +112,7 @@
#include <sys/cdefs.h>
#if defined(_KERNEL) || defined(_STANDALONE)
-__KERNEL_RCSID(0, "$NetBSD: radixtree.c,v 1.27 2020/05/14 08:34:19 msaitoh Exp $");
+__KERNEL_RCSID(0, "$NetBSD: radixtree.c,v 1.28 2022/05/24 20:50:17 andvar Exp $");
#include <sys/param.h>
#include <sys/errno.h>
#include <sys/pool.h>
@@ -122,7 +122,7 @@ __KERNEL_RCSID(0, "$NetBSD: radixtree.c,v 1.27 2020/05/14 08:34:19 msaitoh Exp $
#include <lib/libsa/stand.h>
#endif /* defined(_STANDALONE) */
#else /* defined(_KERNEL) || defined(_STANDALONE) */
-__RCSID("$NetBSD: radixtree.c,v 1.27 2020/05/14 08:34:19 msaitoh Exp $");
+__RCSID("$NetBSD: radixtree.c,v 1.28 2022/05/24 20:50:17 andvar Exp $");
#include <assert.h>
#include <errno.h>
#include <stdbool.h>
@@ -911,7 +911,7 @@ scan_siblings:
descend:
/*
* following the left-most (or right-most in the case of
- * reverse scan) child node, decend until reaching the leaf or
+ * reverse scan) child node, descend until reaching the leaf or
* an non-matching entry.
*/
while (entry_match_p(*vpp, tagmask) && lastidx < t->t_height) {