2 * Copyright 2010 INRIA Saclay
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
11 #define xFN(TYPE,NAME) TYPE ## _ ## NAME
12 #define FN(TYPE,NAME) xFN(TYPE,NAME)
13 #define xS(TYPE,NAME) struct TYPE ## _ ## NAME
14 #define S(TYPE,NAME) xS(TYPE,NAME)
20 struct isl_hash_table table;
23 __isl_give UNION *FN(UNION,cow)(__isl_take UNION *u);
25 isl_ctx *FN(UNION,get_ctx)(__isl_keep UNION *u)
27 return u ? u->dim->ctx : NULL;
30 __isl_give isl_dim *FN(UNION,get_dim)(__isl_keep UNION *u)
34 return isl_dim_copy(u->dim);
37 static __isl_give UNION *FN(UNION,alloc)(__isl_take isl_dim *dim, int size)
41 u = isl_calloc_type(ctx, UNION);
47 if (isl_hash_table_init(dim->ctx, &u->table, size) < 0)
57 __isl_give UNION *FN(UNION,zero)(__isl_take isl_dim *dim)
59 return FN(UNION,alloc)(dim, 16);
62 __isl_give UNION *FN(UNION,copy)(__isl_keep UNION *u)
73 int (*fn)(__isl_take PART *part, void *user);
77 static int call_on_copy(void **entry, void *user)
80 S(UNION,foreach_data) *data = (S(UNION,foreach_data) *)user;
82 return data->fn(FN(PART,copy)(part), data->user);
85 int FN(FN(UNION,foreach),PARTS)(__isl_keep UNION *u,
86 int (*fn)(__isl_take PART *part, void *user), void *user)
88 S(UNION,foreach_data) data = { fn, user };
93 return isl_hash_table_foreach(u->dim->ctx, &u->table,
94 &call_on_copy, &data);
97 static int has_dim(const void *entry, const void *val)
99 PART *part = (PART *)entry;
100 isl_dim *dim = (isl_dim *)val;
102 return isl_dim_equal(part->dim, dim);
105 __isl_give UNION *FN(FN(UNION,add),PARTS)(__isl_take UNION *u,
106 __isl_take PART *part)
109 struct isl_hash_table_entry *entry;
114 if (FN(PART,is_zero)(part)) {
119 u = FN(UNION,cow)(u);
124 isl_assert(u->dim->ctx, isl_dim_match(part->dim, isl_dim_param, u->dim,
125 isl_dim_param), goto error);
127 hash = isl_dim_get_hash(part->dim);
128 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
129 &has_dim, part->dim, 1);
136 entry->data = FN(PART,add)(entry->data, FN(PART,copy)(part));
140 if (FN(PART,is_zero)(entry->data)) {
141 FN(PART,free)(entry->data);
142 isl_hash_table_remove(u->dim->ctx, &u->table, entry);
153 static int add_part(__isl_take PART *part, void *user)
155 UNION **u = (UNION **)user;
157 *u = FN(FN(UNION,add),PARTS)(*u, part);
162 __isl_give UNION *FN(UNION,dup)(__isl_keep UNION *u)
169 dup = FN(UNION,zero)(isl_dim_copy(u->dim));
170 if (FN(FN(UNION,foreach),PARTS)(u, &add_part, &dup) < 0)
178 __isl_give UNION *FN(UNION,cow)(__isl_take UNION *u)
186 return FN(UNION,dup)(u);
189 static int free_u_entry(void **entry, void *user)
196 void FN(UNION,free)(__isl_take UNION *u)
204 isl_hash_table_foreach(u->dim->ctx, &u->table, &free_u_entry, NULL);
205 isl_hash_table_clear(&u->table);
206 isl_dim_free(u->dim);
210 __isl_give UNION *FN(UNION,add)(__isl_take UNION *u1, __isl_take UNION *u2)
212 u1 = FN(UNION,cow)(u1);
217 if (FN(FN(UNION,foreach),PARTS)(u2, &add_part, &u1) < 0)
229 __isl_give UNION *FN(FN(UNION,from),PARTS)(__isl_take PART *part)
237 dim = FN(PART,get_dim)(part);
238 dim = isl_dim_drop(dim, isl_dim_in, 0, isl_dim_size(dim, isl_dim_in));
239 dim = isl_dim_drop(dim, isl_dim_out, 0, isl_dim_size(dim, isl_dim_out));
240 u = FN(UNION,zero)(dim);
241 u = FN(FN(UNION,add),PARTS)(u, part);
246 S(UNION,match_bin_data) {
251 static __isl_give UNION *match_bin_op(__isl_take UNION *u1,
252 __isl_take UNION *u2, int (*fn)(void **, void *))
254 S(UNION,match_bin_data) data = { u2, NULL };
259 data.res = FN(UNION,alloc)(isl_dim_copy(u1->dim), u1->table.n);
260 if (isl_hash_table_foreach(u1->dim->ctx, &u1->table, fn, &data) < 0)
269 FN(UNION,free)(data.res);
273 S(UNION,match_set_data) {
276 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*);
279 static int set_has_dim(const void *entry, const void *val)
281 isl_set *set = (isl_set *)entry;
282 isl_dim *dim = (isl_dim *)val;
284 return isl_dim_equal(set->dim, dim);
287 static int match_set_entry(void **entry, void *user)
289 S(UNION,match_set_data) *data = user;
291 struct isl_hash_table_entry *entry2;
296 hash = isl_dim_get_hash(pw->dim);
297 entry2 = isl_hash_table_find(data->uset->dim->ctx, &data->uset->table,
298 hash, &set_has_dim, pw->dim, 0);
302 pw = FN(PW,copy)(pw);
303 pw = data->fn(pw, isl_set_copy(entry2->data));
305 empty = FN(PW,is_zero)(pw);
315 data->res = FN(FN(UNION,add),PARTS)(data->res, pw);
320 static __isl_give UNION *match_set_op(__isl_take UNION *u,
321 __isl_take isl_union_set *uset,
322 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*))
324 S(UNION,match_set_data) data = { uset, NULL, fn };
329 data.res = FN(UNION,alloc)(isl_dim_copy(u->dim), u->table.n);
330 if (isl_hash_table_foreach(u->dim->ctx, &u->table,
331 &match_set_entry, &data) < 0)
335 isl_union_set_free(uset);
339 isl_union_set_free(uset);
340 FN(UNION,free)(data.res);
344 __isl_give UNION *FN(UNION,intersect_domain)(__isl_take UNION *u,
345 __isl_take isl_union_set *uset)
347 return match_set_op(u, uset, &FN(PW,intersect_domain));
350 __isl_give UNION *FN(UNION,gist)(__isl_take UNION *u,
351 __isl_take isl_union_set *uset)
353 return match_set_op(u, uset, &FN(PW,gist));
356 __isl_give isl_qpolynomial *FN(UNION,eval)(__isl_take UNION *u,
357 __isl_take isl_point *pnt)
360 struct isl_hash_table_entry *entry;
366 hash = isl_dim_get_hash(pnt->dim);
367 entry = isl_hash_table_find(u->dim->ctx, &u->table,
368 hash, &has_dim, pnt->dim, 0);
370 qp = isl_qpolynomial_zero(isl_dim_copy(pnt->dim));
373 qp = FN(PART,eval)(FN(PART,copy)(entry->data), pnt);
383 static int coalesce_entry(void **entry, void *user)
385 PW **pw = (PW **)entry;
387 *pw = FN(PW,coalesce)(*pw);
394 __isl_give UNION *FN(UNION,coalesce)(__isl_take UNION *u)
399 if (isl_hash_table_foreach(u->dim->ctx, &u->table,
400 &coalesce_entry, NULL) < 0)
409 static int domain(__isl_take PART *part, void *user)
411 isl_union_set **uset = (isl_union_set **)user;
413 *uset = isl_union_set_add_set(*uset, FN(PART,domain)(part));
418 __isl_give isl_union_set *FN(UNION,domain)(__isl_take UNION *u)
422 uset = isl_union_set_empty(FN(UNION,get_dim)(u));
423 if (FN(FN(UNION,foreach),PARTS)(u, &domain, &uset) < 0)
430 isl_union_set_free(uset);