2 * Copyright (C) 1995-2007 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
38 * The default comparison function for pointers.
41 * @return 0 if @p x and @p y are equal. Some value != 0 otherwise.
43 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;
56 * Define some convenience macros using the predefined hash function.
58 #define pset_insert_ptr(set,key) pset_insert(set, key, HASH_PTR(key))
59 #define pset_hinsert_ptr(set,key) pset_hinsert(set, key, HASH_PTR(key))
60 #define pset_remove_ptr(set,key) pset_remove(set, key, HASH_PTR(key))
61 #define pset_find_ptr(set,key) pset_find(set, key, HASH_PTR(key))
62 #define pset_new_ptr(slots) new_pset(pset_default_ptr_cmp, slots)
63 #define pset_new_ptr_default() pset_new_ptr(64)
65 /** The entry of a pset, representing an element pointer in the set and it's meta-information */
72 * The type of a set compare function.
74 * @param elt pointer to an element
75 * @param key pointer to another element
78 * 0 if the elements are identically, non-zero else
80 typedef int (*pset_cmp_fun) (const void *elt, const void *key);
85 * @param func The compare function of this pset.
86 * @param slots Initial number of collision chains. I.e., #slots
87 * different keys can be hashed without collisions.
92 pset *new_pset (pset_cmp_fun func, int slots);
97 * @param pset the pset
100 * This does NOT delete the elements of this pset, just it's pointers!
102 void del_pset (pset *pset);
105 * Returns the number of elements in a pset.
107 * @param pset the pset
109 int pset_count (pset *pset);
112 * Searches an element pointer in a pset.
114 * @param pset the pset to search in
115 * @param key the element to search
116 * @param hash the hash value of key
119 * the pointer of the found element in the pset or NULL if it was not found
121 void *pset_find (pset *pset, const void *key, unsigned hash);
124 * Inserts an element pointer into a pset.
126 * @param pset the pset to insert in
127 * @param key a pointer to the element to be inserted
128 * @param hash the hash-value of the element
130 * @return a pointer to the inserted element
133 * It is not possible to insert an element more than once. If an element
134 * that should be inserted is already in the set, this functions does
135 * nothing but returning its already existing set_entry.
138 void *pset_insert (pset *pset, const void *key, unsigned hash);
141 * Inserts an element pointer into a pset and returns its pset_entry.
143 * @param pset the pset to insert in
144 * @param key a pointer to the element to be inserted
145 * @param hash the hash-value of the element
147 * @return a pointer to the pset_entry of the inserted element
150 * It is not possible to insert an element more than once. If an element
151 * that should be inserted is already in the pset, this functions does
152 * nothing but returning its pset_entry.
154 pset_entry *pset_hinsert (pset *pset, const void *key, unsigned hash);
157 * Removes an element from a pset.
159 * @param pset the pset to delete in
160 * @param key a pointer to the element to be deleted
161 * @param hash the hash-value of the element
164 * the pointer to the removed element
167 * The current implementation did not allow to remove non-existing elements.
168 * @@@ so, does it do now?
169 * Further, it is allowed to remove elements during an iteration
170 * including the current one.
172 void *pset_remove (pset *pset, const void *key, unsigned hash);
175 * Returns the first element of a pset.
177 * @param pset the pset to iterate
179 * @return a pointer to the element or NULL if the set is empty
181 void *pset_first (pset *pset);
184 * Returns the next element of a pset.
186 * @param pset the pset to iterate
188 * @return a pointer to the next element or NULL if the
189 * iteration is finished
191 void *pset_next (pset *pset);
194 * Breaks the iteration of a set. Must be called before
195 * the next pset_first() call if the iteration was NOT
198 * @param pset the pset
200 void pset_break (pset *pset);
203 * Iterates oven an pset.
205 * @param pset the pset
206 * @param entry the iterator
208 #define foreach_pset(pset, entry) for (entry = pset_first(pset); entry; entry = pset_next(pset))
211 * Inserts all elements of the pointer set src into
212 * the set target (union).
214 * @param target the target set, will contain the union
215 * @param src a set, will not be changed
217 void pset_insert_pset_ptr(pset *target, pset *src);
219 #define new_pset(cmp, slots) (PSET_TRACE (new_pset) ((cmp), (slots)))
220 #define pset_find(pset, key, hash) \
221 _pset_search ((pset), (key), (hash), _pset_find)
222 #define pset_insert(pset, key, hash) \
223 _pset_search ((pset), (key), (hash), _pset_insert)
224 #define pset_hinsert(pset, key, hash) \
225 ((pset_entry *)_pset_search ((pset), (key), (hash), _pset_hinsert))
229 * Prints statistics on a set to stdout.
231 * @param pset the pset
233 void pset_stats (pset *pset);
235 # define pset_stats(s) ((void)0)
242 * Writes a description of a set to stdout. The description includes:
243 * - a header telling how many elements (nkey) and segments (nseg) are in use
244 * - for every collision chain the number of element with its hash values
246 * @param pset the pset
248 void pset_describe (pset *pset);
252 #define PSET_VRFY(pset) (void)0
257 typedef enum { _pset_find, _pset_insert, _pset_hinsert } _pset_action;
259 void *_pset_search (pset *, const void *, unsigned, _pset_action);
261 #if defined(DEBUG) && defined(HAVE_GNU_MALLOC)
262 extern const char *pset_tag;
264 # define PSET_TRACE pset_tag = SET_ID,
266 # define PSET_TRACE pset_tag = __FILE__,
268 #else /* !(DEBUG && HAVE_GNU_MALLOC) */
270 #endif /* !(DEBUG && HAVE_GNU_MALLOC) */