[src/trunk]: src/common/lib/libc/gen Match the naming convention in the file.

[ad <ad%NetBSD.org@localhost>]

details:   https://anonhg.NetBSD.org/src/rev/5511a0777ead
branches:  trunk
changeset: 1009050:5511a0777ead
user:      ad <ad%NetBSD.org@localhost>
date:      Sat Apr 11 01:46:47 2020 +0000

description:
Match the naming convention in the file.

diffstat:

 common/lib/libc/gen/radixtree.c |  26 +++++++++++++-------------
 1 files changed, 13 insertions(+), 13 deletions(-)

diffs (109 lines):

diff -r da81a36db684 -r 5511a0777ead common/lib/libc/gen/radixtree.c
--- a/common/lib/libc/gen/radixtree.c   Sat Apr 11 01:42:56 2020 +0000
+++ b/common/lib/libc/gen/radixtree.c   Sat Apr 11 01:46:47 2020 +0000
@@ -1,4 +1,4 @@
-/*     $NetBSD: radixtree.c,v 1.25 2020/04/10 23:43:05 ad Exp $        */
+/*     $NetBSD: radixtree.c,v 1.26 2020/04/11 01:46:47 ad 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.25 2020/04/10 23:43:05 ad Exp $");
+__KERNEL_RCSID(0, "$NetBSD: radixtree.c,v 1.26 2020/04/11 01:46:47 ad Exp $");
 #include <sys/param.h>
 #include <sys/errno.h>
 #include <sys/pool.h>
@@ -122,7 +122,7 @@
 #include <lib/libsa/stand.h>
 #endif /* defined(_STANDALONE) */
 #else /* defined(_KERNEL) || defined(_STANDALONE) */
-__RCSID("$NetBSD: radixtree.c,v 1.25 2020/04/10 23:43:05 ad Exp $");
+__RCSID("$NetBSD: radixtree.c,v 1.26 2020/04/11 01:46:47 ad Exp $");
 #include <assert.h>
 #include <errno.h>
 #include <stdbool.h>
@@ -356,14 +356,14 @@
 #endif /* defined(_KERNEL) */
 
 /*
- * radix_tree_node_sum:
+ * radix_tree_sum_node:
  *
  * return the logical sum of all entries in the given node.  used to quickly
  * check for tag masks or empty nodes.
  */
 
 static uintptr_t
-radix_tree_node_sum(const struct radix_tree_node *n)
+radix_tree_sum_node(const struct radix_tree_node *n)
 {
 #if RADIX_TREE_PTR_PER_NODE > 16
        unsigned int i;
@@ -437,7 +437,7 @@
                radix_tree_node_init(n);
        }
 #endif /* defined(_KERNEL) */
-       KASSERT(n == NULL || radix_tree_node_sum(n) == 0);
+       KASSERT(n == NULL || radix_tree_sum_node(n) == 0);
        return n;
 }
 
@@ -445,7 +445,7 @@
 radix_tree_free_node(struct radix_tree_node *n)
 {
 
-       KASSERT(radix_tree_node_sum(n) == 0);
+       KASSERT(radix_tree_sum_node(n) == 0);
 #if defined(_KERNEL)
        pool_cache_put(radix_tree_node_cache, n);
 #elif defined(_STANDALONE)
@@ -627,7 +627,7 @@
                KASSERT(pptr != NULL);
                n = entry_ptr(*pptr);
                KASSERT(n != NULL);
-               if (radix_tree_node_sum(n) != 0) {
+               if (radix_tree_sum_node(n) != 0) {
                        break;
                }
                radix_tree_free_node(n);
@@ -735,7 +735,7 @@
                entry = *pptr;
                n = entry_ptr(entry);
                KASSERT(n != NULL);
-               if (radix_tree_node_sum(n) != 0) {
+               if (radix_tree_sum_node(n) != 0) {
                        break;
                }
                radix_tree_free_node(n);
@@ -762,8 +762,8 @@
                entry = *pptr;
                n = entry_ptr(entry);
                KASSERT(n != NULL);
-               KASSERT(radix_tree_node_sum(n) != 0);
-               newmask = radix_tree_node_sum(n) & RADIX_TREE_TAG_MASK;
+               KASSERT(radix_tree_sum_node(n) != 0);
+               newmask = radix_tree_sum_node(n) & RADIX_TREE_TAG_MASK;
                if (newmask == entry_tagmask(entry)) {
                        break;
                }
@@ -1139,7 +1139,7 @@
                if (0 < i) {
                        struct radix_tree_node *n = path_node(t, &path, i - 1);
 
-                       if ((radix_tree_node_sum(n) & tagmask) != 0) {
+                       if ((radix_tree_sum_node(n) & tagmask) != 0) {
                                break;
                        }
                }
@@ -1172,7 +1172,7 @@
                return;
        }
        n = entry_ptr(vp);
-       assert((radix_tree_node_sum(n) & RADIX_TREE_TAG_MASK) ==
+       assert((radix_tree_sum_node(n) & RADIX_TREE_TAG_MASK) ==
            entry_tagmask(vp));
        printf(" (%u children)\n", radix_tree_node_count_ptrs(n));
        for (i = 0; i < __arraycount(n->n_ptrs); i++) {