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 value set, containing expression for values.
32 static ir_valueset_entry_t null_valueset_entry;
35 #define HashSet ir_valueset_t
36 #define HashSetIterator ir_valueset_iterator_t
37 #define ValueType ir_valueset_entry_t
38 #define NullValue null_valueset_entry
39 #define KeyType ir_node*
40 #define ConstKeyType const ir_node*
41 #define GetKey(entry) (entry).value
42 #define InitData(self,entry,key) do { (entry).value = (key); (entry).list.next = NULL; (entry).list.prev = NULL; } while (0)
43 #define Hash(self,key) ir_node_hash(key)
44 #define KeysEqual(self,key1,key2) (key1) == (key2)
45 #define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0]))
46 #define EntrySetEmpty(entry) (entry).value = NULL
47 #define EntrySetDeleted(entry) do { (entry).data.value = (ir_node*) -1; list_del(&(entry).data.list); } while (0)
48 #define EntryIsEmpty(entry) ((entry).data.value == NULL)
49 #define EntryIsDeleted(entry) ((entry).data.value == (ir_node*)-1)
51 #define hashset_init ir_valueset_init
52 #define hashset_init_size ir_valueset_init_size
53 #define hashset_destroy ir_valueset_destroy
54 ir_valueset_entry_t *ir_valueset_insert_(ir_valueset_t *self, ir_node *value);
55 #define hashset_insert ir_valueset_insert_
56 #define hashset_remove ir_valueset_remove
57 ir_valueset_entry_t *ir_valueset_find_(const ir_valueset_t *self,
58 const ir_node *value);
59 #define hashset_find ir_valueset_find_
60 #define hashset_size ir_valueset_size
62 #define ADDITIONAL_INIT INIT_LIST_HEAD(&self->elem_list); INIT_LIST_HEAD(&self->all_iters);
63 #define ADDITIONAL_TERM INIT_LIST_HEAD(&self->elem_list); INIT_LIST_HEAD(&self->all_iters);
65 #define HAVE_OWN_RESIZE
67 #include "hashset.c.inl"
73 static void resize(HashSet *self, size_t new_size)
75 HashSetEntry *old_entries = self->entries;
76 HashSetEntry *new_entries;
77 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_valueset_insert(self, entry->value, entry->expr);
103 /* all re-inserted data must be new, if not, we found a node twice ... */
106 /* now we can free the old array */
110 int ir_valueset_insert(ir_valueset_t *valueset, ir_node *value, ir_node *expr)
112 ir_valueset_entry_t *entry = ir_valueset_insert_(valueset, value);
114 if (entry->list.next != NULL) {
115 /* this value is already inserted, do nothing */
119 /* new element added */
121 list_add_tail(&entry->list, &valueset->elem_list);
125 int ir_valueset_replace(ir_valueset_t *valueset, ir_node *value, ir_node *expr)
128 ir_valueset_entry_t *entry = ir_valueset_insert_(valueset, value);
130 if (entry->expr != expr) {
134 if (entry->list.next == NULL) {
135 /* we have added a new element */
136 list_add_tail(&entry->list, &valueset->elem_list);
142 void *ir_valueset_lookup(const ir_valueset_t *valueset, const ir_node *value)
144 ir_valueset_entry_t *entry = ir_valueset_find_(valueset, value);
150 void ir_valueset_iterator_init(ir_valueset_iterator_t *iterator,
151 const ir_valueset_t *valueset)
153 iterator->iter = valueset->elem_list.next;
154 iterator->valueset = valueset;
157 ir_node *ir_valueset_iterator_next(ir_valueset_iterator_t *iterator, ir_node **expr)
159 ir_valueset_entry_t *entry;
161 if (iterator->iter == &iterator->valueset->elem_list) {
166 entry = list_entry(iterator->iter, ir_valueset_entry_t, list);
167 iterator->iter = iterator->iter->next;
173 void ir_valueset_remove_iterator(ir_valueset_t *valueset, ir_valueset_iterator_t *iterator)
175 ir_valueset_entry_t *rem = list_entry(iterator->iter->prev, ir_valueset_entry_t, list);
177 ir_valueset_remove(valueset, rem->value);