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)
23 struct isl_hash_table table;
26 __isl_give UNION *FN(UNION,cow)(__isl_take UNION *u);
28 isl_ctx *FN(UNION,get_ctx)(__isl_keep UNION *u)
30 return u ? u->dim->ctx : NULL;
33 __isl_give isl_dim *FN(UNION,get_dim)(__isl_keep UNION *u)
37 return isl_dim_copy(u->dim);
41 static __isl_give UNION *FN(UNION,alloc)(__isl_take isl_dim *dim,
42 enum isl_fold type, int size)
44 static __isl_give UNION *FN(UNION,alloc)(__isl_take isl_dim *dim, int size)
49 u = isl_calloc_type(ctx, UNION);
58 if (isl_hash_table_init(dim->ctx, &u->table, size) < 0)
69 __isl_give UNION *FN(UNION,zero)(__isl_take isl_dim *dim, enum isl_fold type)
71 return FN(UNION,alloc)(dim, type, 16);
74 __isl_give UNION *FN(UNION,zero)(__isl_take isl_dim *dim)
76 return FN(UNION,alloc)(dim, 16);
80 __isl_give UNION *FN(UNION,copy)(__isl_keep UNION *u)
91 int (*fn)(__isl_take PART *part, void *user);
95 static int call_on_copy(void **entry, void *user)
98 S(UNION,foreach_data) *data = (S(UNION,foreach_data) *)user;
100 return data->fn(FN(PART,copy)(part), data->user);
103 int FN(FN(UNION,foreach),PARTS)(__isl_keep UNION *u,
104 int (*fn)(__isl_take PART *part, void *user), void *user)
106 S(UNION,foreach_data) data = { fn, user };
111 return isl_hash_table_foreach(u->dim->ctx, &u->table,
112 &call_on_copy, &data);
115 static int has_dim(const void *entry, const void *val)
117 PART *part = (PART *)entry;
118 isl_dim *dim = (isl_dim *)val;
120 return isl_dim_equal(part->dim, dim);
123 __isl_give UNION *FN(FN(UNION,add),PARTS)(__isl_take UNION *u,
124 __isl_take PART *part)
127 struct isl_hash_table_entry *entry;
132 if (FN(PART,is_zero)(part)) {
137 u = FN(UNION,cow)(u);
142 isl_assert(u->dim->ctx, isl_dim_match(part->dim, isl_dim_param, u->dim,
143 isl_dim_param), goto error);
145 hash = isl_dim_get_hash(part->dim);
146 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
147 &has_dim, part->dim, 1);
154 entry->data = FN(PART,add)(entry->data, FN(PART,copy)(part));
158 if (FN(PART,is_zero)(entry->data)) {
159 FN(PART,free)(entry->data);
160 isl_hash_table_remove(u->dim->ctx, &u->table, entry);
171 static int add_part(__isl_take PART *part, void *user)
173 UNION **u = (UNION **)user;
175 *u = FN(FN(UNION,add),PARTS)(*u, part);
180 __isl_give UNION *FN(UNION,dup)(__isl_keep UNION *u)
188 dup = FN(UNION,zero)(isl_dim_copy(u->dim), u->type);
190 dup = FN(UNION,zero)(isl_dim_copy(u->dim));
192 if (FN(FN(UNION,foreach),PARTS)(u, &add_part, &dup) < 0)
200 __isl_give UNION *FN(UNION,cow)(__isl_take UNION *u)
208 return FN(UNION,dup)(u);
211 static int free_u_entry(void **entry, void *user)
218 void FN(UNION,free)(__isl_take UNION *u)
226 isl_hash_table_foreach(u->dim->ctx, &u->table, &free_u_entry, NULL);
227 isl_hash_table_clear(&u->table);
228 isl_dim_free(u->dim);
237 static int align_entry(__isl_take PART *part, void *user)
240 S(UNION,align) *data = user;
242 exp = isl_reordering_extend_dim(isl_reordering_copy(data->exp),
243 FN(PART,get_dim)(part));
245 data->res = FN(FN(UNION,add),PARTS)(data->res,
246 FN(PART,realign)(part, exp));
251 __isl_give UNION *FN(UNION,align_params)(__isl_take UNION *u,
252 __isl_take isl_dim *model)
255 S(UNION,align) data = { NULL, NULL };
260 if (isl_dim_match(u->dim, isl_dim_param, model, isl_dim_param)) {
265 data.exp = isl_parameter_alignment_reordering(u->dim, model);
270 data.res = FN(UNION,alloc)(isl_dim_copy(data.exp->dim),
271 u->type, u->table.n);
273 data.res = FN(UNION,alloc)(isl_dim_copy(data.exp->dim), u->table.n);
275 if (FN(FN(UNION,foreach),PARTS)(u, &align_entry, &data) < 0)
278 isl_reordering_free(data.exp);
283 isl_reordering_free(data.exp);
285 FN(UNION,free)(data.res);
290 __isl_give UNION *FN(UNION,add)(__isl_take UNION *u1, __isl_take UNION *u2)
292 u1 = FN(UNION,align_params)(u1, FN(UNION,get_dim)(u2));
293 u2 = FN(UNION,align_params)(u2, FN(UNION,get_dim)(u1));
295 u1 = FN(UNION,cow)(u1);
300 if (FN(FN(UNION,foreach),PARTS)(u2, &add_part, &u1) < 0)
312 __isl_give UNION *FN(FN(UNION,from),PARTS)(__isl_take PART *part)
320 dim = FN(PART,get_dim)(part);
321 dim = isl_dim_drop(dim, isl_dim_in, 0, isl_dim_size(dim, isl_dim_in));
322 dim = isl_dim_drop(dim, isl_dim_out, 0, isl_dim_size(dim, isl_dim_out));
324 u = FN(UNION,zero)(dim, part->type);
326 u = FN(UNION,zero)(dim);
328 u = FN(FN(UNION,add),PARTS)(u, part);
333 S(UNION,match_bin_data) {
338 static __isl_give UNION *match_bin_op(__isl_take UNION *u1,
339 __isl_take UNION *u2, int (*fn)(void **, void *))
341 S(UNION,match_bin_data) data = { NULL, NULL };
343 u1 = FN(UNION,align_params)(u1, FN(UNION,get_dim)(u2));
344 u2 = FN(UNION,align_params)(u2, FN(UNION,get_dim)(u1));
351 data.res = FN(UNION,alloc)(isl_dim_copy(u1->dim), u1->type, u1->table.n);
353 data.res = FN(UNION,alloc)(isl_dim_copy(u1->dim), u1->table.n);
355 if (isl_hash_table_foreach(u1->dim->ctx, &u1->table, fn, &data) < 0)
364 FN(UNION,free)(data.res);
368 S(UNION,match_set_data) {
371 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*);
374 static int set_has_dim(const void *entry, const void *val)
376 isl_set *set = (isl_set *)entry;
377 isl_dim *dim = (isl_dim *)val;
379 return isl_dim_equal(set->dim, dim);
382 static int match_set_entry(void **entry, void *user)
384 S(UNION,match_set_data) *data = user;
386 struct isl_hash_table_entry *entry2;
391 hash = isl_dim_get_hash(pw->dim);
392 entry2 = isl_hash_table_find(data->uset->dim->ctx, &data->uset->table,
393 hash, &set_has_dim, pw->dim, 0);
397 pw = FN(PW,copy)(pw);
398 pw = data->fn(pw, isl_set_copy(entry2->data));
400 empty = FN(PW,is_zero)(pw);
410 data->res = FN(FN(UNION,add),PARTS)(data->res, pw);
415 static __isl_give UNION *match_set_op(__isl_take UNION *u,
416 __isl_take isl_union_set *uset,
417 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*))
419 S(UNION,match_set_data) data = { NULL, NULL, fn };
421 u = FN(UNION,align_params)(u, isl_union_set_get_dim(uset));
422 uset = isl_union_set_align_params(uset, FN(UNION,get_dim)(u));
429 data.res = FN(UNION,alloc)(isl_dim_copy(u->dim), u->type, u->table.n);
431 data.res = FN(UNION,alloc)(isl_dim_copy(u->dim), u->table.n);
433 if (isl_hash_table_foreach(u->dim->ctx, &u->table,
434 &match_set_entry, &data) < 0)
438 isl_union_set_free(uset);
442 isl_union_set_free(uset);
443 FN(UNION,free)(data.res);
447 __isl_give UNION *FN(UNION,intersect_domain)(__isl_take UNION *u,
448 __isl_take isl_union_set *uset)
450 return match_set_op(u, uset, &FN(PW,intersect_domain));
453 __isl_give UNION *FN(UNION,gist)(__isl_take UNION *u,
454 __isl_take isl_union_set *uset)
456 return match_set_op(u, uset, &FN(PW,gist));
459 __isl_give isl_qpolynomial *FN(UNION,eval)(__isl_take UNION *u,
460 __isl_take isl_point *pnt)
463 struct isl_hash_table_entry *entry;
469 hash = isl_dim_get_hash(pnt->dim);
470 entry = isl_hash_table_find(u->dim->ctx, &u->table,
471 hash, &has_dim, pnt->dim, 0);
473 qp = isl_qpolynomial_zero(isl_dim_copy(pnt->dim));
476 qp = FN(PART,eval)(FN(PART,copy)(entry->data), pnt);
486 static int coalesce_entry(void **entry, void *user)
488 PW **pw = (PW **)entry;
490 *pw = FN(PW,coalesce)(*pw);
497 __isl_give UNION *FN(UNION,coalesce)(__isl_take UNION *u)
502 if (isl_hash_table_foreach(u->dim->ctx, &u->table,
503 &coalesce_entry, NULL) < 0)
512 static int domain(__isl_take PART *part, void *user)
514 isl_union_set **uset = (isl_union_set **)user;
516 *uset = isl_union_set_add_set(*uset, FN(PART,domain)(part));
521 __isl_give isl_union_set *FN(UNION,domain)(__isl_take UNION *u)
525 uset = isl_union_set_empty(FN(UNION,get_dim)(u));
526 if (FN(FN(UNION,foreach),PARTS)(u, &domain, &uset) < 0)
533 isl_union_set_free(uset);