1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/* $OpenBSD: hash.c,v 1.3 2016/10/12 15:51:44 millert Exp $ */
/*
* Copyright (c) 2008 Joris Vink <joris@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/queue.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "cvs.h"
#include "hash.h"
#include "xmalloc.h"
void
hash_table_init(struct hash_table *htable, size_t hsize)
{
size_t i;
u_int power;
if (hsize < MIN_HASH_SIZE)
hsize = MIN_HASH_SIZE;
if (hsize > MAX_HASH_SIZE)
hsize = MAX_HASH_SIZE;
if ((hsize & (hsize - 1)) != 0) {
for (power = 0; hsize != 0; power++)
hsize >>= 1;
hsize = 1 << power;
}
htable->h_table = xcalloc(hsize, sizeof(struct hash_head));
htable->h_size = hsize;
for (i = 0; i < htable->h_size; i++)
SLIST_INIT(&(htable->h_table[i]));
}
void
hash_table_enter(struct hash_table *htable, struct hash_data *e)
{
uint32_t hashv;
struct hash_head *tableh;
struct hash_table_entry *entry;
hashv = hash4(e->h_key, strlen(e->h_key));
tableh = &(htable->h_table[(hashv & (htable->h_size - 1))]);
entry = xmalloc(sizeof(*entry));
entry->h_data.h_key = e->h_key;
entry->h_data.h_data = e->h_data;
SLIST_INSERT_HEAD(tableh, entry, h_list);
}
struct hash_data *
hash_table_find(struct hash_table *htable, const char *key, size_t len)
{
uint32_t hashv;
struct hash_head *tableh;
struct hash_table_entry *entry;
hashv = hash4(key, len);
tableh = &(htable->h_table[(hashv & (htable->h_size - 1))]);
SLIST_FOREACH(entry, tableh, h_list) {
if (!strcmp(entry->h_data.h_key, key))
return (&(entry->h_data));
}
return (NULL);
}
|
