add isl_space_extend_domain_with_range
[isl.git] / isl_union_templ.c
blob9b54e1cd69abd25b7746120f108eee9b3d1e0741
1 /*
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,
8 * 91893 Orsay, France
9 */
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)
16 struct UNION {
17 int ref;
18 #ifdef HAS_TYPE
19 enum isl_fold type;
20 #endif
21 isl_space *dim;
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_space *FN(UNION,get_space)(__isl_keep UNION *u)
35 if (!u)
36 return NULL;
37 return isl_space_copy(u->dim);
40 #ifdef HAS_TYPE
41 static __isl_give UNION *FN(UNION,alloc)(__isl_take isl_space *dim,
42 enum isl_fold type, int size)
43 #else
44 static __isl_give UNION *FN(UNION,alloc)(__isl_take isl_space *dim, int size)
45 #endif
47 UNION *u;
49 dim = isl_space_params(dim);
50 if (!dim)
51 return NULL;
53 u = isl_calloc_type(dim->ctx, UNION);
54 if (!u)
55 return NULL;
57 u->ref = 1;
58 #ifdef HAS_TYPE
59 u->type = type;
60 #endif
61 u->dim = dim;
62 if (isl_hash_table_init(dim->ctx, &u->table, size) < 0)
63 goto error;
65 return u;
66 error:
67 isl_space_free(dim);
68 FN(UNION,free)(u);
69 return NULL;
72 #ifdef HAS_TYPE
73 __isl_give UNION *FN(UNION,zero)(__isl_take isl_space *dim, enum isl_fold type)
75 return FN(UNION,alloc)(dim, type, 16);
77 #else
78 __isl_give UNION *FN(UNION,zero)(__isl_take isl_space *dim)
80 return FN(UNION,alloc)(dim, 16);
82 #endif
84 __isl_give UNION *FN(UNION,copy)(__isl_keep UNION *u)
86 if (!u)
87 return NULL;
89 u->ref++;
90 return u;
93 S(UNION,foreach_data)
95 int (*fn)(__isl_take PART *part, void *user);
96 void *user;
99 static int call_on_copy(void **entry, void *user)
101 PART *part = *entry;
102 S(UNION,foreach_data) *data = (S(UNION,foreach_data) *)user;
104 return data->fn(FN(PART,copy)(part), data->user);
107 int FN(FN(UNION,foreach),PARTS)(__isl_keep UNION *u,
108 int (*fn)(__isl_take PART *part, void *user), void *user)
110 S(UNION,foreach_data) data = { fn, user };
112 if (!u)
113 return -1;
115 return isl_hash_table_foreach(u->dim->ctx, &u->table,
116 &call_on_copy, &data);
119 static int has_dim(const void *entry, const void *val)
121 PART *part = (PART *)entry;
122 isl_space *dim = (isl_space *)val;
124 return isl_space_is_equal(part->dim, dim);
127 __isl_give PART *FN(FN(UNION,extract),PARTS)(__isl_keep UNION *u,
128 __isl_take isl_space *dim)
130 uint32_t hash;
131 struct isl_hash_table_entry *entry;
133 if (!u || !dim)
134 goto error;
136 hash = isl_space_get_hash(dim);
137 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
138 &has_dim, dim, 0);
139 if (!entry)
140 #ifdef HAS_TYPE
141 return FN(PART,zero)(dim, u->type);
142 #else
143 return FN(PART,zero)(dim);
144 #endif
145 isl_space_free(dim);
146 return FN(PART,copy)(entry->data);
147 error:
148 isl_space_free(dim);
149 return NULL;
152 __isl_give UNION *FN(FN(UNION,add),PARTS)(__isl_take UNION *u,
153 __isl_take PART *part)
155 uint32_t hash;
156 struct isl_hash_table_entry *entry;
158 if (!part)
159 goto error;
161 if (FN(PART,is_zero)(part)) {
162 FN(PART,free)(part);
163 return u;
166 u = FN(UNION,cow)(u);
168 if (!u)
169 goto error;
171 isl_assert(u->dim->ctx, isl_space_match(part->dim, isl_dim_param, u->dim,
172 isl_dim_param), goto error);
174 hash = isl_space_get_hash(part->dim);
175 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
176 &has_dim, part->dim, 1);
177 if (!entry)
178 goto error;
180 if (!entry->data)
181 entry->data = part;
182 else {
183 entry->data = FN(PART,add)(entry->data, FN(PART,copy)(part));
184 if (!entry->data)
185 goto error;
186 FN(PART,free)(part);
187 if (FN(PART,is_zero)(entry->data)) {
188 FN(PART,free)(entry->data);
189 isl_hash_table_remove(u->dim->ctx, &u->table, entry);
193 return u;
194 error:
195 FN(PART,free)(part);
196 FN(UNION,free)(u);
197 return NULL;
200 static int add_part(__isl_take PART *part, void *user)
202 UNION **u = (UNION **)user;
204 *u = FN(FN(UNION,add),PARTS)(*u, part);
206 return 0;
209 __isl_give UNION *FN(UNION,dup)(__isl_keep UNION *u)
211 UNION *dup;
213 if (!u)
214 return NULL;
216 #ifdef HAS_TYPE
217 dup = FN(UNION,zero)(isl_space_copy(u->dim), u->type);
218 #else
219 dup = FN(UNION,zero)(isl_space_copy(u->dim));
220 #endif
221 if (FN(FN(UNION,foreach),PARTS)(u, &add_part, &dup) < 0)
222 goto error;
223 return dup;
224 error:
225 FN(UNION,free)(dup);
226 return NULL;
229 __isl_give UNION *FN(UNION,cow)(__isl_take UNION *u)
231 if (!u)
232 return NULL;
234 if (u->ref == 1)
235 return u;
236 u->ref--;
237 return FN(UNION,dup)(u);
240 static int free_u_entry(void **entry, void *user)
242 PART *part = *entry;
243 FN(PART,free)(part);
244 return 0;
247 void FN(UNION,free)(__isl_take UNION *u)
249 if (!u)
250 return;
252 if (--u->ref > 0)
253 return;
255 isl_hash_table_foreach(u->dim->ctx, &u->table, &free_u_entry, NULL);
256 isl_hash_table_clear(&u->table);
257 isl_space_free(u->dim);
258 free(u);
261 S(UNION,align) {
262 isl_reordering *exp;
263 UNION *res;
266 static int align_entry(__isl_take PART *part, void *user)
268 isl_reordering *exp;
269 S(UNION,align) *data = user;
271 exp = isl_reordering_extend_space(isl_reordering_copy(data->exp),
272 FN(PART,get_space)(part));
274 data->res = FN(FN(UNION,add),PARTS)(data->res,
275 FN(PART,realign)(part, exp));
277 return 0;
280 __isl_give UNION *FN(UNION,align_params)(__isl_take UNION *u,
281 __isl_take isl_space *model)
283 S(UNION,align) data = { NULL, NULL };
285 if (!u || !model)
286 goto error;
288 if (isl_space_match(u->dim, isl_dim_param, model, isl_dim_param)) {
289 isl_space_free(model);
290 return u;
293 data.exp = isl_parameter_alignment_reordering(u->dim, model);
294 if (!data.exp)
295 goto error;
297 #ifdef HAS_TYPE
298 data.res = FN(UNION,alloc)(isl_space_copy(data.exp->dim),
299 u->type, u->table.n);
300 #else
301 data.res = FN(UNION,alloc)(isl_space_copy(data.exp->dim), u->table.n);
302 #endif
303 if (FN(FN(UNION,foreach),PARTS)(u, &align_entry, &data) < 0)
304 goto error;
306 isl_reordering_free(data.exp);
307 FN(UNION,free)(u);
308 isl_space_free(model);
309 return data.res;
310 error:
311 isl_reordering_free(data.exp);
312 FN(UNION,free)(u);
313 FN(UNION,free)(data.res);
314 isl_space_free(model);
315 return NULL;
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_space)(u2));
321 u2 = FN(UNION,align_params)(u2, FN(UNION,get_space)(u1));
323 u1 = FN(UNION,cow)(u1);
325 if (!u1 || !u2)
326 goto error;
328 if (FN(FN(UNION,foreach),PARTS)(u2, &add_part, &u1) < 0)
329 goto error;
331 FN(UNION,free)(u2);
333 return u1;
334 error:
335 FN(UNION,free)(u1);
336 FN(UNION,free)(u2);
337 return NULL;
340 __isl_give UNION *FN(FN(UNION,from),PARTS)(__isl_take PART *part)
342 isl_space *dim;
343 UNION *u;
345 if (!part)
346 return NULL;
348 dim = FN(PART,get_space)(part);
349 dim = isl_space_drop_dims(dim, isl_dim_in, 0, isl_space_dim(dim, isl_dim_in));
350 dim = isl_space_drop_dims(dim, isl_dim_out, 0, isl_space_dim(dim, isl_dim_out));
351 #ifdef HAS_TYPE
352 u = FN(UNION,zero)(dim, part->type);
353 #else
354 u = FN(UNION,zero)(dim);
355 #endif
356 u = FN(FN(UNION,add),PARTS)(u, part);
358 return u;
361 S(UNION,match_bin_data) {
362 UNION *u2;
363 UNION *res;
366 /* This function is currently only used from isl_polynomial.c
367 * and not from isl_fold.c.
369 static __isl_give UNION *match_bin_op(__isl_take UNION *u1,
370 __isl_take UNION *u2,
371 int (*fn)(void **, void *)) __attribute__ ((unused));
372 static __isl_give UNION *match_bin_op(__isl_take UNION *u1,
373 __isl_take UNION *u2, int (*fn)(void **, void *))
375 S(UNION,match_bin_data) data = { NULL, NULL };
377 u1 = FN(UNION,align_params)(u1, FN(UNION,get_space)(u2));
378 u2 = FN(UNION,align_params)(u2, FN(UNION,get_space)(u1));
380 if (!u1 || !u2)
381 goto error;
383 data.u2 = u2;
384 #ifdef HAS_TYPE
385 data.res = FN(UNION,alloc)(isl_space_copy(u1->dim), u1->type, u1->table.n);
386 #else
387 data.res = FN(UNION,alloc)(isl_space_copy(u1->dim), u1->table.n);
388 #endif
389 if (isl_hash_table_foreach(u1->dim->ctx, &u1->table, fn, &data) < 0)
390 goto error;
392 FN(UNION,free)(u1);
393 FN(UNION,free)(u2);
394 return data.res;
395 error:
396 FN(UNION,free)(u1);
397 FN(UNION,free)(u2);
398 FN(UNION,free)(data.res);
399 return NULL;
402 S(UNION,match_set_data) {
403 isl_union_set *uset;
404 UNION *res;
405 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*);
408 static int set_has_dim(const void *entry, const void *val)
410 isl_set *set = (isl_set *)entry;
411 isl_space *dim = (isl_space *)val;
413 return isl_space_is_equal(set->dim, dim);
416 static int match_set_entry(void **entry, void *user)
418 S(UNION,match_set_data) *data = user;
419 uint32_t hash;
420 struct isl_hash_table_entry *entry2;
421 PW *pw = *entry;
422 int empty;
424 hash = isl_space_get_hash(pw->dim);
425 entry2 = isl_hash_table_find(data->uset->dim->ctx, &data->uset->table,
426 hash, &set_has_dim, pw->dim, 0);
427 if (!entry2)
428 return 0;
430 pw = FN(PW,copy)(pw);
431 pw = data->fn(pw, isl_set_copy(entry2->data));
433 empty = FN(PW,is_zero)(pw);
434 if (empty < 0) {
435 FN(PW,free)(pw);
436 return -1;
438 if (empty) {
439 FN(PW,free)(pw);
440 return 0;
443 data->res = FN(FN(UNION,add),PARTS)(data->res, pw);
445 return 0;
448 static __isl_give UNION *match_set_op(__isl_take UNION *u,
449 __isl_take isl_union_set *uset,
450 __isl_give PW *(*fn)(__isl_take PW*, __isl_take isl_set*))
452 S(UNION,match_set_data) data = { NULL, NULL, fn };
454 u = FN(UNION,align_params)(u, isl_union_set_get_space(uset));
455 uset = isl_union_set_align_params(uset, FN(UNION,get_space)(u));
457 if (!u || !uset)
458 goto error;
460 data.uset = uset;
461 #ifdef HAS_TYPE
462 data.res = FN(UNION,alloc)(isl_space_copy(u->dim), u->type, u->table.n);
463 #else
464 data.res = FN(UNION,alloc)(isl_space_copy(u->dim), u->table.n);
465 #endif
466 if (isl_hash_table_foreach(u->dim->ctx, &u->table,
467 &match_set_entry, &data) < 0)
468 goto error;
470 FN(UNION,free)(u);
471 isl_union_set_free(uset);
472 return data.res;
473 error:
474 FN(UNION,free)(u);
475 isl_union_set_free(uset);
476 FN(UNION,free)(data.res);
477 return NULL;
480 __isl_give UNION *FN(UNION,intersect_domain)(__isl_take UNION *u,
481 __isl_take isl_union_set *uset)
483 return match_set_op(u, uset, &FN(PW,intersect_domain));
486 __isl_give UNION *FN(UNION,gist)(__isl_take UNION *u,
487 __isl_take isl_union_set *uset)
489 return match_set_op(u, uset, &FN(PW,gist));
492 __isl_give isl_qpolynomial *FN(UNION,eval)(__isl_take UNION *u,
493 __isl_take isl_point *pnt)
495 uint32_t hash;
496 struct isl_hash_table_entry *entry;
497 isl_qpolynomial *qp;
499 if (!u || !pnt)
500 goto error;
502 hash = isl_space_get_hash(pnt->dim);
503 entry = isl_hash_table_find(u->dim->ctx, &u->table,
504 hash, &has_dim, pnt->dim, 0);
505 if (!entry) {
506 qp = isl_qpolynomial_zero(isl_space_copy(pnt->dim));
507 isl_point_free(pnt);
508 } else {
509 qp = FN(PART,eval)(FN(PART,copy)(entry->data), pnt);
511 FN(UNION,free)(u);
512 return qp;
513 error:
514 FN(UNION,free)(u);
515 isl_point_free(pnt);
516 return NULL;
519 static int coalesce_entry(void **entry, void *user)
521 PW **pw = (PW **)entry;
523 *pw = FN(PW,coalesce)(*pw);
524 if (!*pw)
525 return -1;
527 return 0;
530 __isl_give UNION *FN(UNION,coalesce)(__isl_take UNION *u)
532 if (!u)
533 return NULL;
535 if (isl_hash_table_foreach(u->dim->ctx, &u->table,
536 &coalesce_entry, NULL) < 0)
537 goto error;
539 return u;
540 error:
541 FN(UNION,free)(u);
542 return NULL;
545 static int domain(__isl_take PART *part, void *user)
547 isl_union_set **uset = (isl_union_set **)user;
549 *uset = isl_union_set_add_set(*uset, FN(PART,domain)(part));
551 return 0;
554 __isl_give isl_union_set *FN(UNION,domain)(__isl_take UNION *u)
556 isl_union_set *uset;
558 uset = isl_union_set_empty(FN(UNION,get_space)(u));
559 if (FN(FN(UNION,foreach),PARTS)(u, &domain, &uset) < 0)
560 goto error;
562 FN(UNION,free)(u);
564 return uset;
565 error:
566 isl_union_set_free(uset);
567 FN(UNION,free)(u);
568 return NULL;
571 static int mul_isl_int(void **entry, void *user)
573 PW **pw = (PW **)entry;
574 isl_int *v = user;
576 *pw = FN(PW,mul_isl_int)(*pw, *v);
577 if (!*pw)
578 return -1;
580 return 0;
583 __isl_give UNION *FN(UNION,mul_isl_int)(__isl_take UNION *u, isl_int v)
585 if (isl_int_is_one(v))
586 return u;
588 if (u && isl_int_is_zero(v)) {
589 UNION *zero;
590 isl_space *dim = FN(UNION,get_space)(u);
591 #ifdef HAS_TYPE
592 zero = FN(UNION,zero)(dim, u->type);
593 #else
594 zero = FN(UNION,zero)(dim);
595 #endif
596 FN(UNION,free)(u);
597 return zero;
600 u = FN(UNION,cow)(u);
601 if (!u)
602 return NULL;
604 #ifdef HAS_TYPE
605 if (isl_int_is_neg(v))
606 u->type = isl_fold_type_negate(u->type);
607 #endif
608 if (isl_hash_table_foreach(u->dim->ctx, &u->table, &mul_isl_int, v) < 0)
609 goto error;
611 return u;
612 error:
613 FN(UNION,free)(u);
614 return NULL;