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)
52 u = isl_calloc_type(dim->ctx, UNION);
61 if (isl_hash_table_init(dim->ctx, &u->table, size) < 0)
72 __isl_give UNION *FN(UNION,zero)(__isl_take isl_dim *dim, enum isl_fold type)
74 return FN(UNION,alloc)(dim, type, 16);
77 __isl_give UNION *FN(UNION,zero)(__isl_take isl_dim *dim)
79 return FN(UNION,alloc)(dim, 16);
83 __isl_give UNION *FN(UNION,copy)(__isl_keep UNION *u)
94 int (*fn)(__isl_take PART *part, void *user);
98 static int call_on_copy(void **entry, void *user)
101 S(UNION,foreach_data) *data = (S(UNION,foreach_data) *)user;
103 return data->fn(FN(PART,copy)(part), data->user);
106 int FN(FN(UNION,foreach),PARTS)(__isl_keep UNION *u,
107 int (*fn)(__isl_take PART *part, void *user), void *user)
109 S(UNION,foreach_data) data = { fn, user };
114 return isl_hash_table_foreach(u->dim->ctx, &u->table,
115 &call_on_copy, &data);
118 static int has_dim(const void *entry, const void *val)
120 PART *part = (PART *)entry;
121 isl_dim *dim = (isl_dim *)val;
123 return isl_dim_equal(part->dim, dim);
126 __isl_give PART *FN(FN(UNION,extract),PARTS)(__isl_keep UNION *u,
127 __isl_take isl_dim *dim)
130 struct isl_hash_table_entry *entry;
135 hash = isl_dim_get_hash(dim);
136 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
140 return FN(PART,zero)(dim, u->type);
142 return FN(PART,zero)(dim);
145 return FN(PART,copy)(entry->data);
151 __isl_give UNION *FN(FN(UNION,add),PARTS)(__isl_take UNION *u,
152 __isl_take PART *part)
155 struct isl_hash_table_entry *entry;
160 if (FN(PART,is_zero)(part)) {
165 u = FN(UNION,cow)(u);
170 isl_assert(u->dim->ctx, isl_dim_match(part->dim, isl_dim_param, u->dim,
171 isl_dim_param), goto error);
173 hash = isl_dim_get_hash(part->dim);
174 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
175 &has_dim, part->dim, 1);
182 entry->data = FN(PART,add)(entry->data, FN(PART,copy)(part));
186 if (FN(PART,is_zero)(entry->data)) {
187 FN(PART,free)(entry->data);
188 isl_hash_table_remove(u->dim->ctx, &u->table, entry);
199 static int add_part(__isl_take PART *part, void *user)
201 UNION **u = (UNION **)user;
203 *u = FN(FN(UNION,add),PARTS)(*u, part);
208 __isl_give UNION *FN(UNION,dup)(__isl_keep UNION *u)
216 dup = FN(UNION,zero)(isl_dim_copy(u->dim), u->type);
218 dup = FN(UNION,zero)(isl_dim_copy(u->dim));
220 if (FN(FN(UNION,foreach),PARTS)(u, &add_part, &dup) < 0)
228 __isl_give UNION *FN(UNION,cow)(__isl_take UNION *u)
236 return FN(UNION,dup)(u);
239 static int free_u_entry(void **entry, void *user)
246 void FN(UNION,free)(__isl_take UNION *u)
254 isl_hash_table_foreach(u->dim->ctx, &u->table, &free_u_entry, NULL);
255 isl_hash_table_clear(&u->table);
256 isl_dim_free(u->dim);
265 static int align_entry(__isl_take PART *part, void *user)
268 S(UNION,align) *data = user;
270 exp = isl_reordering_extend_dim(isl_reordering_copy(data->exp),
271 FN(PART,get_dim)(part));
273 data->res = FN(FN(UNION,add),PARTS)(data->res,
274 FN(PART,realign)(part, exp));
279 __isl_give UNION *FN(UNION,align_params)(__isl_take UNION *u,
280 __isl_take isl_dim *model)
283 S(UNION,align) data = { NULL, NULL };
288 if (isl_dim_match(u->dim, isl_dim_param, model, isl_dim_param)) {
293 data.exp = isl_parameter_alignment_reordering(u->dim, model);
298 data.res = FN(UNION,alloc)(isl_dim_copy(data.exp->dim),
299 u->type, u->table.n);
301 data.res = FN(UNION,alloc)(isl_dim_copy(data.exp->dim), u->table.n);
303 if (FN(FN(UNION,foreach),PARTS)(u, &align_entry, &data) < 0)
306 isl_reordering_free(data.exp);
311 isl_reordering_free(data.exp);
313 FN(UNION,free)(data.res);
318 __isl_give UNION *FN(UNION,add)(__isl_take UNION *u1, __isl_take UNION *u2)
320 u1 = FN(UNION,align_params)(u1, FN(UNION,get_dim)(u2));
321 u2 = FN(UNION,align_params)(u2, FN(UNION,get_dim)(u1));
323 u1 = FN(UNION,cow)(u1);
328 if (FN(FN(UNION,foreach),PARTS)(u2, &add_part, &u1) < 0)
340 __isl_give UNION *FN(FN(UNION,from),PARTS)(__isl_take PART *part)
348 dim = FN(PART,get_dim)(part);
349 dim = isl_dim_drop(dim, isl_dim_in, 0, isl_dim_size(dim, isl_dim_in));
350 dim = isl_dim_drop(dim, isl_dim_out, 0, isl_dim_size(dim, isl_dim_out));
352 u = FN(UNION,zero)(dim, part->type);
354 u = FN(UNION,zero)(dim);
356 u = FN(FN(UNION,add),PARTS)(u, part);
361 S(UNION,match_bin_data) {
366 static __isl_give UNION *match_bin_op(__isl_take UNION *u1,
367 __isl_take UNION *u2, int (*fn)(void **, void *))
369 S(UNION,match_bin_data) data = { NULL, NULL };
371 u1 = FN(UNION,align_params)(u1, FN(UNION,get_dim)(u2));
372 u2 = FN(UNION,align_params)(u2, FN(UNION,get_dim)(u1));
379 data.res = FN(UNION,alloc)(isl_dim_copy(u1->dim), u1->type, u1->table.n);
381 data.res = FN(UNION,alloc)(isl_dim_copy(u1->dim), u1->table.n);
383 if (isl_hash_table_foreach(u1->dim->ctx, &u1->table, fn, &data) < 0)
392 FN(UNION,free)(data.res);
396 S(UNION,match_set_data) {
399 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*);
402 static int set_has_dim(const void *entry, const void *val)
404 isl_set *set = (isl_set *)entry;
405 isl_dim *dim = (isl_dim *)val;
407 return isl_dim_equal(set->dim, dim);
410 static int match_set_entry(void **entry, void *user)
412 S(UNION,match_set_data) *data = user;
414 struct isl_hash_table_entry *entry2;
419 hash = isl_dim_get_hash(pw->dim);
420 entry2 = isl_hash_table_find(data->uset->dim->ctx, &data->uset->table,
421 hash, &set_has_dim, pw->dim, 0);
425 pw = FN(PW,copy)(pw);
426 pw = data->fn(pw, isl_set_copy(entry2->data));
428 empty = FN(PW,is_zero)(pw);
438 data->res = FN(FN(UNION,add),PARTS)(data->res, pw);
443 static __isl_give UNION *match_set_op(__isl_take UNION *u,
444 __isl_take isl_union_set *uset,
445 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*))
447 S(UNION,match_set_data) data = { NULL, NULL, fn };
449 u = FN(UNION,align_params)(u, isl_union_set_get_dim(uset));
450 uset = isl_union_set_align_params(uset, FN(UNION,get_dim)(u));
457 data.res = FN(UNION,alloc)(isl_dim_copy(u->dim), u->type, u->table.n);
459 data.res = FN(UNION,alloc)(isl_dim_copy(u->dim), u->table.n);
461 if (isl_hash_table_foreach(u->dim->ctx, &u->table,
462 &match_set_entry, &data) < 0)
466 isl_union_set_free(uset);
470 isl_union_set_free(uset);
471 FN(UNION,free)(data.res);
475 __isl_give UNION *FN(UNION,intersect_domain)(__isl_take UNION *u,
476 __isl_take isl_union_set *uset)
478 return match_set_op(u, uset, &FN(PW,intersect_domain));
481 __isl_give UNION *FN(UNION,gist)(__isl_take UNION *u,
482 __isl_take isl_union_set *uset)
484 return match_set_op(u, uset, &FN(PW,gist));
487 __isl_give isl_qpolynomial *FN(UNION,eval)(__isl_take UNION *u,
488 __isl_take isl_point *pnt)
491 struct isl_hash_table_entry *entry;
497 hash = isl_dim_get_hash(pnt->dim);
498 entry = isl_hash_table_find(u->dim->ctx, &u->table,
499 hash, &has_dim, pnt->dim, 0);
501 qp = isl_qpolynomial_zero(isl_dim_copy(pnt->dim));
504 qp = FN(PART,eval)(FN(PART,copy)(entry->data), pnt);
514 static int coalesce_entry(void **entry, void *user)
516 PW **pw = (PW **)entry;
518 *pw = FN(PW,coalesce)(*pw);
525 __isl_give UNION *FN(UNION,coalesce)(__isl_take UNION *u)
530 if (isl_hash_table_foreach(u->dim->ctx, &u->table,
531 &coalesce_entry, NULL) < 0)
540 static int domain(__isl_take PART *part, void *user)
542 isl_union_set **uset = (isl_union_set **)user;
544 *uset = isl_union_set_add_set(*uset, FN(PART,domain)(part));
549 __isl_give isl_union_set *FN(UNION,domain)(__isl_take UNION *u)
553 uset = isl_union_set_empty(FN(UNION,get_dim)(u));
554 if (FN(FN(UNION,foreach),PARTS)(u, &domain, &uset) < 0)
561 isl_union_set_free(uset);
566 static int mul_isl_int(void **entry, void *user)
568 PW **pw = (PW **)entry;
571 *pw = FN(PW,mul_isl_int)(*pw, *v);
578 __isl_give UNION *FN(UNION,mul_isl_int)(__isl_take UNION *u, isl_int v)
580 if (isl_int_is_one(v))
583 if (u && isl_int_is_zero(v)) {
585 isl_dim *dim = FN(UNION,get_dim)(u);
587 zero = FN(UNION,zero)(dim, u->type);
589 zero = FN(UNION,zero)(dim);
595 u = FN(UNION,cow)(u);
600 if (isl_int_is_neg(v))
601 u->type = isl_fold_type_negate(u->type);
603 if (isl_hash_table_foreach(u->dim->ctx, &u->table, &mul_isl_int, v) < 0)