summaryrefslogtreecommitdiff
path: root/hash.c
blob: 88d59bf26b4e38be0f5cfc2d3b2c4d0c6e92e2c9 (plain)
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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
/*
 * netsniff-ng - the packet sniffing beast
 * Copyright 2009, 2010 Daniel Borkmann.
 * Subject to the GPL, version 2.
 */

#include "hash.h"
#include "xmalloc.h"

/* Hash table implementation from the GIT project. */
/* Copyright 2008 (C) Linus Torvalds, GPL version 2 */

/*
 * Look up a hash entry in the hash table. Return the pointer to
 * the existing entry, or the empty slot if none existed. The caller
 * can then look at the (*ptr) to see whether it existed or not.
 */
static struct hash_table_entry *lookup_hash_entry(unsigned int hash,
						  const struct hash_table
								   *table)
{
	unsigned int size = table->size, nr = hash % size;
	struct hash_table_entry *array = table->array;

	while (array[nr].ptr) {
		if (array[nr].hash == hash)
			break;
		nr++;
		if (nr >= size)
			nr = 0;
	}

	return array + nr;
}


/*
 * Insert a new hash entry pointer into the table.
 *
 * If that hash entry already existed, return the pointer to
 * the existing entry (and the caller can create a list of the
 * pointers or do anything else). If it didn't exist, return
 * NULL (and the caller knows the pointer has been inserted).
 */
static void **insert_hash_entry(unsigned int hash, void *ptr,
				struct hash_table *table)
{
	struct hash_table_entry *entry = lookup_hash_entry(hash, table);

	if (!entry->ptr) {
		entry->ptr = ptr;
		entry->hash = hash;

		table->nr++;

		return NULL;
	}

	return &entry->ptr;
}

/*
 * Removes a hash entry pointer from the table.
 *
 * If that hash does not exist, NULL is returned, or, if that hash
 * exists and is the first entry, ptr_next will be set to that entry
 * and NULL is returned. Otherwise the caller must maintain the
 * remaining list.
 */
static void *remove_hash_entry(unsigned int hash, void *ptr, void *ptr_next,
			       struct hash_table *table)
{
	struct hash_table_entry *entry = lookup_hash_entry(hash, table);

	if (!entry->ptr)
		return NULL;

	else if (entry->ptr == ptr) {
		entry->ptr = ptr_next;
		entry->hash = hash;

		if (!ptr_next)
			table->nr--;

		return NULL;
	} else
		return entry->ptr;
}

static void grow_hash_table(struct hash_table *table)
{
	unsigned int i;
	unsigned int old_size = table->size, new_size;
	struct hash_table_entry *old_array = table->array, *new_array;

	new_size = alloc_nr(old_size);
	new_array = xcalloc(new_size, sizeof(struct hash_table_entry));

	table->size = new_size;
	table->array = new_array;
	table->nr = 0;

	for (i = 0; i < old_size; i++) {
		unsigned int hash = old_array[i].hash;
		void *ptr = old_array[i].ptr;

		if (ptr)
			insert_hash_entry(hash, ptr, table);
	}

	free(old_array);
}

void *lookup_hash(unsigned int hash, const struct hash_table *table)
{
	if (!table->array)
		return NULL;

	return lookup_hash_entry(hash, table)->ptr;
}

void *remove_hash(unsigned int hash, void *ptr, void *ptr_next,
		  struct hash_table *table)
{
	if (!table->array)
		return NULL;

	return remove_hash_entry(hash, ptr, ptr_next, table);
}

void **insert_hash(unsigned int hash, void *ptr, struct hash_table *table)
{
	unsigned int nr = table->nr;

	if (nr >= table->size/2)
		grow_hash_table(table);

	return insert_hash_entry(hash, ptr, table);
}

int for_each_hash(const struct hash_table *table, int (*fn)(void *))
{
	int sum = 0;
	unsigned int i;
	unsigned int size = table->size;
	struct hash_table_entry *array = table->array;

	for (i = 0; i < size; i++) {
		void *ptr = array->ptr;

		array++;
		if (ptr) {
			int val = fn(ptr);
			if (val < 0)
				return val;

			sum += val;
		}
	}

	return sum;
}

int for_each_hash_int(const struct hash_table *table, int (*fn)(void *, int),
		      int arg)
{
	int sum = 0;
	unsigned int i;
	unsigned int size = table->size;
	struct hash_table_entry *array = table->array;

	for (i = 0; i < size; i++) {
		void *ptr = array->ptr;

		array++;
		if (ptr) {
			int val = fn(ptr, arg);
			if (val < 0)
				return val;

			sum += val;
		}
	}

	return sum;
}

void free_hash(struct hash_table *table)
{
	free(table->array);

	table->array = NULL;
	table->size = 0;
	table->nr = 0;
}