summaryrefslogtreecommitdiff
path: root/usr.bin/make/hash.c
diff options
context:
space:
mode:
authorrillig <rillig@NetBSD.org>2020-12-30 10:03:16 +0000
committerrillig <rillig@NetBSD.org>2020-12-30 10:03:16 +0000
commit3ba2f8a8af37a3d7e07dbe3217d8dd7fec18d3fc (patch)
tree9d25248baefcde00a2dab9ff91f6b32f1111cfc1 /usr.bin/make/hash.c
parent3d19af2a101764f2f2dfbfb3972ab972e19551c2 (diff)
make(1): format multi-line comments
Diffstat (limited to 'usr.bin/make/hash.c')
-rw-r--r--usr.bin/make/hash.c28
1 files changed, 18 insertions, 10 deletions
diff --git a/usr.bin/make/hash.c b/usr.bin/make/hash.c
index 65a0b16be16..82735f59c6f 100644
--- a/usr.bin/make/hash.c
+++ b/usr.bin/make/hash.c
@@ -1,4 +1,4 @@
-/* $NetBSD: hash.c,v 1.59 2020/12/15 15:20:05 rillig Exp $ */
+/* $NetBSD: hash.c,v 1.60 2020/12/30 10:03:16 rillig Exp $ */
/*
* Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
@@ -74,7 +74,7 @@
#include "make.h"
/* "@(#)hash.c 8.1 (Berkeley) 6/6/93" */
-MAKE_RCSID("$NetBSD: hash.c,v 1.59 2020/12/15 15:20:05 rillig Exp $");
+MAKE_RCSID("$NetBSD: hash.c,v 1.60 2020/12/30 10:03:16 rillig Exp $");
/*
* The ratio of # entries to # buckets at which we rebuild the table to
@@ -180,8 +180,10 @@ HashTable_FindValue(HashTable *t, const char *key)
return he != NULL ? he->value : NULL;
}
-/* Find the value corresponding to the key and the precomputed hash,
- * or return NULL. */
+/*
+ * Find the value corresponding to the key and the precomputed hash,
+ * or return NULL.
+ */
void *
HashTable_FindValueHash(HashTable *t, const char *key, unsigned int h)
{
@@ -189,8 +191,10 @@ HashTable_FindValueHash(HashTable *t, const char *key, unsigned int h)
return he != NULL ? he->value : NULL;
}
-/* Make the hash table larger. Any bucket numbers from the old table become
- * invalid; the hash codes stay valid though. */
+/*
+ * Make the hash table larger. Any bucket numbers from the old table become
+ * invalid; the hash codes stay valid though.
+ */
static void
HashTable_Enlarge(HashTable *t)
{
@@ -224,8 +228,10 @@ HashTable_Enlarge(HashTable *t)
t->maxchain = 0;
}
-/* Find or create an entry corresponding to the key.
- * Return in out_isNew whether a new entry has been created. */
+/*
+ * Find or create an entry corresponding to the key.
+ * Return in out_isNew whether a new entry has been created.
+ */
HashEntry *
HashTable_CreateEntry(HashTable *t, const char *key, Boolean *out_isNew)
{
@@ -291,8 +297,10 @@ HashIter_Init(HashIter *hi, HashTable *t)
hi->entry = NULL;
}
-/* Return the next entry in the hash table, or NULL if the end of the table
- * is reached. */
+/*
+ * Return the next entry in the hash table, or NULL if the end of the table
+ * is reached.
+ */
HashEntry *
HashIter_Next(HashIter *hi)
{