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 optimized version of set for sets containing only pointers
24 * @author Markus Armbruster
26 * @note This code has been deprecated. Use pset_new or cpset for new
29 #ifndef FIRM_ADT_PSET_H
30 #define FIRM_ADT_PSET_H
40 * The default comparison function for pointers.
43 * @return 0 if @p x and @p y are equal. Some value != 0 otherwise.
45 FIRM_API int pset_default_ptr_cmp(const void *x, const void *y);
48 * The abstract type of a pset (Set of pointers).
50 * This kind of sets stores only pointer to elements, the elements itself
51 * must be stored somewhere else.
55 typedef struct pset pset;
58 * Define some convenience macros using the predefined hash function.
60 #define pset_insert_ptr(set,key) pset_insert(set, key, HASH_PTR(key))
61 #define pset_hinsert_ptr(set,key) pset_hinsert(set, key, HASH_PTR(key))
62 #define pset_remove_ptr(set,key) pset_remove(set, key, HASH_PTR(key))
63 #define pset_find_ptr(set,key) pset_find(set, key, HASH_PTR(key))
64 #define pset_new_ptr(slots) new_pset(pset_default_ptr_cmp, slots)
65 #define pset_new_ptr_default() pset_new_ptr(64)
67 /** The entry of a pset, representing an element pointer in the set and it's meta-information */
74 * The type of a set compare function.
76 * @param elt pointer to an element
77 * @param key pointer to another element
80 * 0 if the elements are identically, non-zero else
82 typedef int (*pset_cmp_fun) (const void *elt, const void *key);
87 * @param func The compare function of this pset.
88 * @param slots Initial number of collision chains. I.e., \#slots
89 * different keys can be hashed without collisions.
94 FIRM_API pset *new_pset(pset_cmp_fun func, int slots);
99 * @param pset the pset
102 * This does NOT delete the elements of this pset, just it's pointers!
104 FIRM_API void del_pset(pset *pset);
107 * Returns the number of elements in a pset.
109 * @param pset the pset
111 FIRM_API int pset_count(pset *pset);
114 * Searches an element pointer in a pset.
116 * @param pset the pset to search in
117 * @param key the element to search
118 * @param hash the hash value of key
121 * the pointer of the found element in the pset or NULL if it was not found
123 FIRM_API void *pset_find(pset *pset, const void *key, unsigned hash);
126 * Inserts an element pointer into a pset.
128 * @param pset the pset to insert in
129 * @param key a pointer to the element to be inserted
130 * @param hash the hash-value of the element
132 * @return a pointer to the inserted element
135 * It is not possible to insert an element more than once. If an element
136 * that should be inserted is already in the set, this functions does
137 * nothing but returning its already existing set_entry.
140 FIRM_API void *pset_insert(pset *pset, const void *key, unsigned hash);
143 * Inserts an element pointer into a pset and returns its pset_entry.
145 * @param pset the pset to insert in
146 * @param key a pointer to the element to be inserted
147 * @param hash the hash-value of the element
149 * @return a pointer to the pset_entry of the inserted element
152 * It is not possible to insert an element more than once. If an element
153 * that should be inserted is already in the pset, this functions does
154 * nothing but returning its pset_entry.
156 FIRM_API pset_entry *pset_hinsert(pset *pset, const void *key, unsigned hash);
159 * Removes an element from a pset.
161 * @param pset the pset to delete in
162 * @param key a pointer to the element to be deleted
163 * @param hash the hash-value of the element
166 * the pointer to the removed element
169 * The current implementation did not allow to remove non-existing elements.
170 * @@@ so, does it do now?
171 * Further, it is allowed to remove elements during an iteration
172 * including the current one.
174 FIRM_API void *pset_remove(pset *pset, const void *key, unsigned hash);
177 * Returns the first element of a pset.
179 * @param pset the pset to iterate
181 * @return a pointer to the element or NULL if the set is empty
183 FIRM_API void *pset_first(pset *pset);
186 * Returns the next element of a pset.
188 * @param pset the pset to iterate
190 * @return a pointer to the next element or NULL if the
191 * iteration is finished
193 FIRM_API void *pset_next(pset *pset);
196 * Breaks the iteration of a set. Must be called before
197 * the next pset_first() call if the iteration was NOT
200 * @param pset the pset
202 FIRM_API void pset_break(pset *pset);
205 * Iterates oven an pset.
207 * @param pset the pset
208 * @param entry the iterator
210 #define foreach_pset(pset, entry) for (entry = pset_first(pset); entry; entry = pset_next(pset))
213 * Inserts all elements of the pointer set src into
214 * the set target (union).
216 * @param target the target set, will contain the union
217 * @param src a set, will not be changed
219 FIRM_API void pset_insert_pset_ptr(pset *target, pset *src);
221 #define new_pset(cmp, slots) (PSET_TRACE (new_pset) ((cmp), (slots)))
222 #define pset_find(pset, key, hash) \
223 _pset_search ((pset), (key), (hash), _pset_find)
224 #define pset_insert(pset, key, hash) \
225 _pset_search ((pset), (key), (hash), _pset_insert)
226 #define pset_hinsert(pset, key, hash) \
227 ((pset_entry *)_pset_search ((pset), (key), (hash), _pset_hinsert))
231 * Prints statistics on a set to stdout.
233 * @param pset the pset
235 void pset_stats (pset *pset);
237 # define pset_stats(s) ((void)0)
244 * Writes a description of a set to stdout. The description includes:
245 * - a header telling how many elements (nkey) and segments (nseg) are in use
246 * - for every collision chain the number of element with its hash values
248 * @param pset the pset
250 void pset_describe (pset *pset);
254 #define PSET_VRFY(pset) (void)0
259 typedef enum { _pset_find, _pset_insert, _pset_hinsert } _pset_action;
261 FIRM_API void *_pset_search(pset *, const void *, unsigned, _pset_action);
263 #if defined(DEBUG) && defined(HAVE_GNU_MALLOC)
264 extern const char *pset_tag;
266 # define PSET_TRACE pset_tag = SET_ID,
268 # define PSET_TRACE pset_tag = __FILE__,
270 #else /* !(DEBUG && HAVE_GNU_MALLOC) */
272 #endif /* !(DEBUG && HAVE_GNU_MALLOC) */