]> git.ipfire.org Git - thirdparty/gcc.git/blob - libbanshee/engine/ufind.h
Merge tree-ssa-20020619-branch into mainline.
[thirdparty/gcc.git] / libbanshee / engine / ufind.h
1 /*
2 * Copyright (c) 2000-2001
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 */
30
31 #ifndef UFIND_H
32 #define UFIND_H
33
34 #include <regions.h>
35 #include "linkage.h"
36 #include "bool.h"
37
38 EXTERN_C_BEGIN
39
40 struct uf_element;
41
42 typedef struct uf_element *uf_element;
43 typedef void *uf_info;
44
45 typedef uf_info (*combine_fn_ptr)(uf_info,uf_info);
46
47 struct uf_element *new_uf_element(region r,uf_info i);
48 uf_info uf_get_info(struct uf_element *);
49 bool uf_unify(combine_fn_ptr,struct uf_element *,struct uf_element *);
50 bool uf_union(struct uf_element *,struct uf_element *);
51 bool uf_eq(struct uf_element *,struct uf_element *);
52 void uf_update(struct uf_element *,uf_info i);
53
54 #define DECLARE_UFIND(name,type) \
55 typedef struct name *name; \
56 typedef type (* name ## _combine_fn_ptr)(type info1,type info2); \
57 name new_ ## name(region r, type info); \
58 type name ## _get_info(name); \
59 bool name ## _unify(name ## _combine_fn_ptr,name e1, name e2); \
60 bool name ## _union(name e1, name e2); \
61 bool name ## _eq(name e1, name e2); \
62 void name ## _update(name e1, type info);
63
64 #define DEFINE_UFIND(name,type) \
65 name new_ ## name(region r, type info) \
66 { \
67 return (name)new_uf_element(r,info);\
68 }\
69 type name ## _get_info(name elem) \
70 { \
71 return (type)uf_get_info((struct uf_element *)elem);\
72 } \
73 bool name ## _unify(name ## _combine_fn_ptr cmb,name e1, name e2) \
74 { \
75 return uf_unify((combine_fn_ptr)cmb,(struct uf_element *)e1,(struct uf_element *)e2); \
76 } \
77 bool name ## _union(name e1, name e2) \
78 { \
79 return uf_union((struct uf_element *)e1,(struct uf_element *)e2); \
80 }\
81 bool name ## _eq(name e1, name e2) \
82 { \
83 return uf_eq((struct uf_element *)e1,(struct uf_element *)e2); \
84 } \
85 void name ##_update(name e1, type info) \
86 { \
87 uf_update((struct uf_element *)e1,(uf_info)info); \
88 } \
89
90 EXTERN_C_END
91
92 #endif /* UFIND_H */
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178