hash.c 2.87 KB
Newer Older
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
/* hash.c - Alpine Package Keeper (APK)
 *
 * Copyright (C) 2005-2008 Natanael Copa <n@tanael.org>
 * Copyright (C) 2008 Timo Teräs <timo.teras@iki.fi>
 * All rights reserved.
 *
 * This program is free software; you can redistribute it and/or modify it 
 * under the terms of the GNU General Public License version 2 as published
 * by the Free Software Foundation. See http://www.gnu.org/ for details.
 */

#include "apk_defines.h"
#include "apk_hash.h"

void apk_hash_init(struct apk_hash *h, const struct apk_hash_ops *ops,
		   int num_buckets)
{
	h->ops = ops;
	h->buckets = apk_hash_array_resize(NULL, num_buckets);
	h->num_items = 0;
}

void apk_hash_free(struct apk_hash *h)
{
	apk_hash_foreach(h, (apk_hash_enumerator_f) h->ops->delete_item, NULL);
	free(h->buckets);
}

int apk_hash_foreach(struct apk_hash *h, apk_hash_enumerator_f e, void *ctx)
{
	apk_hash_node *pos, *n;
	ptrdiff_t offset = h->ops->node_offset;
	int i, r;

	for (i = 0; i < h->buckets->num; i++) {
		hlist_for_each_safe(pos, n, &h->buckets->item[i]) {
			r = e(((void *) pos) - offset, ctx);
38
			if (r != 0 && ctx != NULL)
39
40
41
42
43
44
45
				return r;
		}
	}

	return 0;
}

46
apk_hash_item apk_hash_get(struct apk_hash *h, apk_blob_t key)
47
48
49
50
51
{
	ptrdiff_t offset = h->ops->node_offset;
	unsigned long hash;
	apk_hash_node *pos;
	apk_hash_item item;
52
	apk_blob_t itemkey;
53
54

	hash = h->ops->hash_key(key) % h->buckets->num;
55
56
57
58
59
60
61
62
63
64
65
66
67
	if (h->ops->compare_item != NULL) {
		hlist_for_each(pos, &h->buckets->item[hash]) {
			item = ((void *) pos) - offset;
			if (h->ops->compare_item(item, key) == 0)
				return item;
		}
	} else {
		hlist_for_each(pos, &h->buckets->item[hash]) {
			item = ((void *) pos) - offset;
			itemkey = h->ops->get_key(item);
			if (h->ops->compare(key, itemkey) == 0)
				return item;
		}
68
69
70
71
72
73
74
75
76
77
	}

	return NULL;
}

void apk_hash_insert(struct apk_hash *h, apk_hash_item item)
{
	unsigned long hash;
	apk_hash_node *node;

78
79
80
81
82
	if (h->ops->hash_item == NULL)
		hash = h->ops->hash_key(h->ops->get_key(item));
	else
		hash = h->ops->hash_item(item);
	hash %= h->buckets->num;
83
84
85
86
87
	node = (apk_hash_node *) (item + h->ops->node_offset);
	hlist_add_head(node, &h->buckets->item[hash]);
	h->num_items++;
}

88
void apk_hash_delete(struct apk_hash *h, apk_blob_t key)
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
	ptrdiff_t offset = h->ops->node_offset;
	unsigned long hash;
	apk_hash_node *pos;
	apk_hash_item item;
	apk_blob_t itemkey;

	hash = h->ops->hash_key(key) % h->buckets->num;
	if (h->ops->compare_item != NULL) {
		hlist_for_each(pos, &h->buckets->item[hash]) {
			item = ((void *) pos) - offset;
			if (h->ops->compare_item(item, key) == 0) {
				hlist_del(pos, &h->buckets->item[hash]);
				h->ops->delete_item(item);
				return;
			}

		}
	} else {
		hlist_for_each(pos, &h->buckets->item[hash]) {
			item = ((void *) pos) - offset;
			itemkey = h->ops->get_key(item);
			if (h->ops->compare(key, itemkey) == 0) {
				hlist_del(pos, &h->buckets->item[hash]);
				h->ops->delete_item(item);
				return;
			}
		}
	}
118
119
}