2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief simplified hashmap for pointer -> pointer mappings
23 * @author Hubert Schmid
37 int dummy; /* dummy entry */
41 #define INITIAL_SLOTS 64
43 /** map a pmap into a set */
44 #define M2S(map) (set *)(map)
47 * compare the keys of two entry pairs
49 static int pmap_entry_cmp(const void *p1, const void *p2, size_t size) {
50 const pmap_entry *entry1 = p1;
51 const pmap_entry *entry2 = p2;
54 return entry1->key != entry2->key;
57 /* Creates a new empty map with an initial number of slots. */
58 pmap *pmap_create_ex(int slots) {
59 return (pmap *)new_set(pmap_entry_cmp, slots);
62 pmap *pmap_create(void) {
63 return pmap_create_ex(INITIAL_SLOTS);
66 void pmap_destroy(pmap *map) {
70 void pmap_insert(pmap *map, const void *key, void *value) {
74 p = set_insert(M2S(map), &entry, sizeof(pmap_entry), HASH_PTR(key));
78 int pmap_contains(pmap *map, const void *key) {
79 return set_find(M2S(map), &key, sizeof(pmap_entry), HASH_PTR(key)) != NULL;
82 pmap_entry * pmap_find(pmap *map, const void *key) {
83 return (pmap_entry *)set_find(M2S(map), &key, sizeof(pmap_entry), HASH_PTR(key));
87 void * pmap_get(pmap *map, const void *key) {
88 pmap_entry * entry = pmap_find(map, key);
89 return entry == NULL ? NULL : entry->value;
92 int pmap_count(pmap *map) {
93 return set_count(M2S(map));
96 pmap_entry *pmap_first(pmap *map) {
97 return (pmap_entry *) set_first(M2S(map));
100 pmap_entry *pmap_next(pmap *map) {
101 return (pmap_entry *) set_next(M2S(map));
104 void pmap_break(pmap *map) {