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 * @author Michael Beck
23 * @brief A linked nodemap.
28 #include "irlinkednodemap.h"
32 static ir_lnk_nodemap_entry_t null_nodemap_entry;
35 #define HashSet ir_lnk_nodemap_t
36 #define HashSetIterator ir_lnk_nodemap_iterator_t
37 #define ValueType ir_lnk_nodemap_entry_t
38 #define NullValue null_nodemap_entry
39 #define KeyType ir_node*
40 #define ConstKeyType const ir_node*
41 #define GetKey(value) (value).node
42 #define InitData(self,value,key) do { (value).node = (key); (value).list.next = NULL; (value).list.prev = NULL; } while(0)
43 #define Hash(self,key) ((unsigned)((key)->node_nr))
44 #define KeysEqual(self,key1,key2) (key1) == (key2)
45 #define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0]))
46 #define EntrySetEmpty(value) (value).node = NULL
47 #define EntrySetDeleted(value) do { (value).node = (ir_node*) -1; list_del(&(value).list); } while(0)
48 #define EntryIsEmpty(value) ((value).node == NULL)
49 #define EntryIsDeleted(value) ((value).node == (ir_node*)-1)
51 #define hashset_init ir_lnk_nodemap_init
52 #define hashset_init_size ir_lnk_nodemap_init_size
53 #define hashset_destroy ir_lnk_nodemap_destroy
54 #define hashset_insert _ir_lnk_nodemap_insert
55 #define hashset_remove ir_lnk_nodemap_remove
56 #define hashset_find _ir_lnk_nodemap_find
57 #define hashset_size ir_lnk_nodemap_size
59 #define ADDITIONAL_INIT INIT_LIST_HEAD(&self->elem_list); INIT_LIST_HEAD(&self->all_iters);
60 #define ADDITIONAL_TERM INIT_LIST_HEAD(&self->elem_list); INIT_LIST_HEAD(&self->all_iters);
63 #define HAVE_OWN_RESIZE
72 void resize(HashSet *self, size_t new_size)
74 HashSetEntry *old_entries = self->entries;
75 HashSetEntry *new_entries;
76 list_head list = self->elem_list;
80 /* allocate a new array with double size */
81 new_entries = Alloc(new_size);
82 SetRangeEmpty(new_entries, new_size);
84 /* use the new array */
85 self->entries = new_entries;
86 self->num_buckets = new_size;
87 self->num_elements = 0;
88 self->num_deleted = 0;
90 self->entries_version++;
92 reset_thresholds(self);
94 assert(!list_empty(&self->elem_list));
95 list.next->prev = &list;
96 list.prev->next = &list;
98 /* reinsert all elements */
99 INIT_LIST_HEAD(&self->elem_list);
100 list_for_each_entry(ValueType, entry, &list, list) {
101 res &= ir_lnk_nodemap_put(self, EntryGetValue(*entry).node, EntryGetValue(*entry).data);
103 /* all re-inserted data must be new, if not, we found a node twice ... */
106 /* now we can free the old array */
111 int ir_lnk_nodemap_put(ir_lnk_nodemap_t *nodemap, ir_node *node, void *data)
113 ir_lnk_nodemap_entry_t *entry = _ir_lnk_nodemap_insert(nodemap, node);
116 if (entry->list.next == NULL) {
117 /* we have added a new element */
118 list_add_tail(&entry->list, &nodemap->elem_list);
124 void *ir_lnk_nodemap_get(const ir_lnk_nodemap_t *nodemap, const ir_node *node)
126 ir_lnk_nodemap_entry_t *entry = _ir_lnk_nodemap_find(nodemap, node);
131 * Initializes a nodemap iterator. Sets the iterator before the first element in
132 * the linked nodemap.
134 * @param iterator Pointer to already allocated iterator memory
135 * @param nodemap Pointer to the nodemap
137 void ir_lnk_nodemap_iterator_init(ir_lnk_nodemap_iterator_t *iterator,
138 const ir_lnk_nodemap_t *nodemap) {
139 iterator->iter = nodemap->elem_list.next;
140 iterator->nodemap = nodemap;
144 * Advances the iterator and returns the current element or NULL if all elements
145 * in the linked nodemap have been processed.
146 * @attention It is not allowed to use ir_lnk_nodemap_insert or ir_lnk_nodemap_remove while
147 * iterating over a nodemap.
149 * @param iterator Pointer to the nodemap iterator.
150 * @returns Next element in the nodemap or NULL
152 ir_node *ir_lnk_nodemap_iterator_next(ir_lnk_nodemap_iterator_t *iterator) {
154 if (iterator->iter == &iterator->nodemap->elem_list)
157 res = list_entry(iterator->iter, ir_lnk_nodemap_entry_t, list)->node;
158 iterator->iter = iterator->iter->next;
164 * Removes the element the iterator currently points to.
166 * @param nodemap Pointer to the linked nodemap
167 * @param iterator Pointer to the nodemap iterator.
169 void ir_lnk_nodemap_remove_iterator(ir_lnk_nodemap_t *nodemap,
170 ir_lnk_nodemap_iterator_t *iterator) {
171 ir_lnk_nodemap_entry_t *rem = list_entry(iterator->iter->prev, ir_lnk_nodemap_entry_t, list);
173 ir_lnk_nodemap_remove(nodemap, rem->node);