2 * Copyright (C) 1995-2011 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 optimized version of set for sets containing only pointers
24 * @author Markus Armbruster
25 * @note This code has been deprecated. Use pset_new or cpset for new
28 #ifndef FIRM_ADT_PSET_H
29 #define FIRM_ADT_PSET_H
38 * The default comparison function for pointers.
41 * @return 0 if @p x and @p y are equal. Some value != 0 otherwise.
43 FIRM_API int pset_default_ptr_cmp(const void *x, const void *y);
46 * The abstract type of a pset (Set of pointers).
48 * This kind of sets stores only pointer to elements, the elements itself
49 * must be stored somewhere else.
53 typedef struct pset pset;
55 /** Inserts into pointer set with default hash function. */
56 #define pset_insert_ptr(set,key) pset_insert(set, key, hash_ptr(key))
57 /** Inserts into pointer set with default hash function and return entry */
58 #define pset_hinsert_ptr(set,key) pset_hinsert(set, key, hash_ptr(key))
59 /** Removes pointer from pointer set with default hash function */
60 #define pset_remove_ptr(set,key) pset_remove(set, key, hash_ptr(key))
61 /** Finds pointer in pointer set with default hash function */
62 #define pset_find_ptr(set,key) pset_find(set, key, hash_ptr(key))
63 /** Creates new pointer set with default compare function */
64 #define pset_new_ptr(slots) new_pset(pset_default_ptr_cmp, slots)
65 /** Creates new pointer set with default compare function and default size */
66 #define pset_new_ptr_default() pset_new_ptr(64)
68 /** The entry of a pset, representing an element pointer in the set and its meta-information */
75 * The type of a set compare function.
77 * @param elt pointer to an element
78 * @param key pointer to another element
81 * 0 if the elements are identically, non-zero else
83 typedef int (*pset_cmp_fun) (const void *elt, const void *key);
88 * @param func The compare function of this pset.
89 * @param slots Initial number of collision chains. I.e., \#slots
90 * different keys can be hashed without collisions.
95 FIRM_API pset *new_pset(pset_cmp_fun func, size_t slots);
100 * @param pset the pset
103 * This does NOT delete the elements of this pset, just its pointers!
105 FIRM_API void del_pset(pset *pset);
108 * Returns the number of elements in a pset.
110 * @param pset the pset
112 FIRM_API size_t pset_count(pset *pset);
115 * Searches an element pointer in a pset.
117 * @param pset the pset to search in
118 * @param key the element to search
119 * @param hash the hash value of key
122 * the pointer of the found element in the pset or NULL if it was not found
124 FIRM_API void *pset_find(pset *pset, const void *key, unsigned hash);
127 * Inserts an element pointer into a pset.
129 * @param pset the pset to insert in
130 * @param key a pointer to the element to be inserted
131 * @param hash the hash-value of the element
133 * @return a pointer to the inserted element
136 * It is not possible to insert an element more than once. If an element
137 * that should be inserted is already in the set, this functions does
138 * nothing but returning its already existing set_entry.
141 FIRM_API void *pset_insert(pset *pset, const void *key, unsigned hash);
144 * Inserts an element pointer into a pset and returns its pset_entry.
146 * @param pset the pset to insert in
147 * @param key a pointer to the element to be inserted
148 * @param hash the hash-value of the element
150 * @return a pointer to the pset_entry of the inserted element
153 * It is not possible to insert an element more than once. If an element
154 * that should be inserted is already in the pset, this functions does
155 * nothing but returning its pset_entry.
157 FIRM_API pset_entry *pset_hinsert(pset *pset, const void *key, unsigned hash);
160 * Removes an element from a pset.
162 * @param pset the pset to delete in
163 * @param key a pointer to the element to be deleted
164 * @param hash the hash-value of the element
167 * the pointer to the removed element
170 * The current implementation did not allow to remove non-existing elements.
171 * @@@ so, does it do now?
172 * Further, it is allowed to remove elements during an iteration
173 * including the current one.
175 FIRM_API void *pset_remove(pset *pset, const void *key, unsigned hash);
178 * Returns the first element of a pset.
180 * @param pset the pset to iterate
182 * @return a pointer to the element or NULL if the set is empty
184 FIRM_API void *pset_first(pset *pset);
187 * Returns the next element of a pset.
189 * @param pset the pset to iterate
191 * @return a pointer to the next element or NULL if the
192 * iteration is finished
194 FIRM_API void *pset_next(pset *pset);
197 * Breaks the iteration of a set. Must be called before
198 * the next pset_first() call if the iteration was NOT
201 * @param pset the pset
203 FIRM_API void pset_break(pset *pset);
206 * Iterates oven an pset.
208 * @param pset the pset
209 * @param type type of iterator variable
210 * @param entry the iterator
212 #define foreach_pset(pset, type, entry) for (entry = (type)pset_first(pset); entry; entry = (type)pset_next(pset))
215 * Inserts all elements of the pointer set src into
216 * the set target (union).
218 * @param target the target set, will contain the union
219 * @param src a set, will not be changed
221 FIRM_API void pset_insert_pset_ptr(pset *target, pset *src);
223 #define new_pset(cmp, slots) ((new_pset) ((cmp), (slots)))
224 #define pset_find(pset, key, hash) \
225 _pset_search ((pset), (key), (hash), _pset_find)
226 #define pset_insert(pset, key, hash) \
227 _pset_search ((pset), (key), (hash), _pset_insert)
228 #define pset_hinsert(pset, key, hash) \
229 ((pset_entry *)_pset_search ((pset), (key), (hash), _pset_hinsert))
231 /** @privatesection */
233 typedef enum { _pset_find, _pset_insert, _pset_hinsert } _pset_action;
235 FIRM_API void *_pset_search(pset *, const void *, unsigned, _pset_action);