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 A pointer hash-set (WARNING: deprecated!)
23 * @author Hubert Schmid
36 int dummy; /* dummy entry */
40 #define INITIAL_SLOTS 64
42 static int pcmp(const void *p1, const void *p2, size_t size) {
43 const void **q1 = (const void **)p1;
44 const void **q2 = (const void **)p2;
50 eset * eset_create(void) {
51 return (eset *) new_set(pcmp, INITIAL_SLOTS);
55 eset * eset_copy(eset *source) {
56 eset * ret = eset_create();
58 for (p = eset_first(source); p; p = eset_next(source)) {
65 void eset_destroy(eset *s) {
69 /* Returns the number of elements in the set. */
70 int eset_count(eset *s) {
71 return set_count((set *)s);
74 void eset_insert(eset *s, void *p) {
75 if (!eset_contains(s, p)) {
76 set_insert((set *)s, &p, sizeof(p), HASH_PTR(p));
81 int eset_contains(eset *s, void *p) {
82 return set_find((set *)s, &p, sizeof(p), HASH_PTR(p)) != NULL;
86 void * eset_first(eset *s) {
87 void * p = set_first((set *) s);
88 return p == NULL ? NULL : *((void **)p);
92 void * eset_next(eset *s) {
93 void *p = set_next((set *) s);
94 return p == NULL ? NULL : *((void **)p);
98 void eset_insert_all(eset *target, eset *source) {
100 for (p = eset_first(source); p; p = eset_next(source)) {
101 eset_insert(target, p);