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 nodeset.
27 #include "irlinkednodeset.h"
31 static ir_lnk_nodeset_entry_t null_nodeset_entry;
34 #define HashSet ir_lnk_nodeset_t
35 #define HashSetIterator ir_lnk_nodeset_iterator_t
36 #define ValueType ir_lnk_nodeset_entry_t
37 #define NullValue null_nodeset_entry
38 #define KeyType ir_node*
39 #define ConstKeyType const ir_node*
40 #define GetKey(value) (value).node
41 #define InitData(self,value,key) do { (value).node = (key); (value).list.next = NULL; (value).list.prev = NULL; } while (0)
42 #define Hash(self,key) ((unsigned)((key)->node_nr))
43 #define KeysEqual(self,key1,key2) (key1) == (key2)
44 #define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0]))
45 #define EntrySetEmpty(value) (value).node = NULL
46 #define EntrySetDeleted(value) do { (value).node = (ir_node*) -1; list_del(&(value).list); } while (0)
47 #define EntryIsEmpty(value) ((value).node == NULL)
48 #define EntryIsDeleted(value) ((value).node == (ir_node*)-1)
50 #define hashset_init ir_lnk_nodeset_init
51 #define hashset_init_size ir_lnk_nodeset_init_size
52 #define hashset_destroy ir_lnk_nodeset_destroy
53 ir_lnk_nodeset_entry_t *ir_lnk_nodeset_insert_(ir_lnk_nodeset_t *nodeset, ir_node *node);
54 #define hashset_insert ir_lnk_nodeset_insert_
55 #define hashset_remove ir_lnk_nodeset_remove
56 ir_lnk_nodeset_entry_t *ir_lnk_nodeset_find_(const ir_lnk_nodeset_t *nodeset, const ir_node *node);
57 #define hashset_find ir_lnk_nodeset_find_
58 #define hashset_size ir_lnk_nodeset_size
60 #define ADDITIONAL_INIT INIT_LIST_HEAD(&self->elem_list); INIT_LIST_HEAD(&self->all_iters);
61 #define ADDITIONAL_TERM INIT_LIST_HEAD(&self->elem_list); INIT_LIST_HEAD(&self->all_iters);
63 #define HAVE_OWN_RESIZE
71 static void resize(HashSet *self, size_t new_size)
73 HashSetEntry *old_entries = self->entries;
74 HashSetEntry *new_entries;
75 list_head list = self->elem_list;
79 /* allocate a new array with double size */
80 new_entries = Alloc(new_size);
81 SetRangeEmpty(new_entries, new_size);
83 /* use the new array */
84 self->entries = new_entries;
85 self->num_buckets = new_size;
86 self->num_elements = 0;
87 self->num_deleted = 0;
89 self->entries_version++;
91 reset_thresholds(self);
93 assert(!list_empty(&self->elem_list));
94 list.next->prev = &list;
95 list.prev->next = &list;
97 /* reinsert all elements */
98 INIT_LIST_HEAD(&self->elem_list);
99 list_for_each_entry(ValueType, entry, &list, list) {
100 res &= ir_lnk_nodeset_insert(self, EntryGetValue(*entry).node);
102 /* all re-inserted data must be new, if not, we found a node twice ... */
105 /* now we can free the old array */
109 int ir_lnk_nodeset_insert(ir_lnk_nodeset_t *nodeset, ir_node *node)
111 ir_lnk_nodeset_entry_t *entry = ir_lnk_nodeset_insert_(nodeset, node);
113 if (entry->list.next == NULL) {
114 /* we have added a new element */
115 list_add_tail(&entry->list, &nodeset->elem_list);
121 int ir_lnk_nodeset_contains(const ir_lnk_nodeset_t *nodeset, const ir_node *node)
123 return ir_lnk_nodeset_find_(nodeset, node) != NULL;
126 void ir_lnk_nodeset_iterator_init(ir_lnk_nodeset_iterator_t *iterator,
127 const ir_lnk_nodeset_t *nodeset)
129 iterator->iter = nodeset->elem_list.next;
130 iterator->nodeset = nodeset;
133 ir_node *ir_lnk_nodeset_iterator_next(ir_lnk_nodeset_iterator_t *iterator)
136 if (iterator->iter == &iterator->nodeset->elem_list)
139 res = list_entry(iterator->iter, ir_lnk_nodeset_entry_t, list)->node;
140 iterator->iter = iterator->iter->next;
145 void ir_lnk_nodeset_remove_iterator(ir_lnk_nodeset_t *nodeset,
146 ir_lnk_nodeset_iterator_t *iterator)
148 ir_lnk_nodeset_entry_t *rem = list_entry(iterator->iter->prev, ir_lnk_nodeset_entry_t, list);
150 ir_lnk_nodeset_remove(nodeset, rem->node);