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_space
*FN(UNION
,get_space
)(__isl_keep UNION
*u
)
37 return isl_space_copy(u
->dim
);
41 static __isl_give UNION
*FN(UNION
,alloc
)(__isl_take isl_space
*dim
,
42 enum isl_fold type
, int size
)
44 static __isl_give UNION
*FN(UNION
,alloc
)(__isl_take isl_space
*dim
, int size
)
49 dim
= isl_space_params(dim
);
53 u
= isl_calloc_type(dim
->ctx
, UNION
);
62 if (isl_hash_table_init(dim
->ctx
, &u
->table
, size
) < 0)
73 __isl_give UNION
*FN(UNION
,zero
)(__isl_take isl_space
*dim
, enum isl_fold type
)
75 return FN(UNION
,alloc
)(dim
, type
, 16);
78 __isl_give UNION
*FN(UNION
,zero
)(__isl_take isl_space
*dim
)
80 return FN(UNION
,alloc
)(dim
, 16);
84 __isl_give UNION
*FN(UNION
,copy
)(__isl_keep UNION
*u
)
95 int (*fn
)(__isl_take PART
*part
, void *user
);
99 static int call_on_copy(void **entry
, void *user
)
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
};
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
)
131 struct isl_hash_table_entry
*entry
;
136 hash
= isl_space_get_hash(dim
);
137 entry
= isl_hash_table_find(u
->dim
->ctx
, &u
->table
, hash
,
141 return FN(PART
,zero
)(dim
, u
->type
);
143 return FN(PART
,zero
)(dim
);
146 return FN(PART
,copy
)(entry
->data
);
152 __isl_give UNION
*FN(FN(UNION
,add
),PARTS
)(__isl_take UNION
*u
,
153 __isl_take PART
*part
)
156 struct isl_hash_table_entry
*entry
;
161 if (FN(PART
,is_zero
)(part
)) {
166 u
= FN(UNION
,cow
)(u
);
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);
183 entry
->data
= FN(PART
,add
)(entry
->data
, FN(PART
,copy
)(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
);
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
);
209 __isl_give UNION
*FN(UNION
,dup
)(__isl_keep UNION
*u
)
217 dup
= FN(UNION
,zero
)(isl_space_copy(u
->dim
), u
->type
);
219 dup
= FN(UNION
,zero
)(isl_space_copy(u
->dim
));
221 if (FN(FN(UNION
,foreach
),PARTS
)(u
, &add_part
, &dup
) < 0)
229 __isl_give UNION
*FN(UNION
,cow
)(__isl_take UNION
*u
)
237 return FN(UNION
,dup
)(u
);
240 static int free_u_entry(void **entry
, void *user
)
247 void FN(UNION
,free
)(__isl_take UNION
*u
)
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
);
266 static int align_entry(__isl_take PART
*part
, void *user
)
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
));
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
};
288 if (isl_space_match(u
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
289 isl_space_free(model
);
293 data
.exp
= isl_parameter_alignment_reordering(u
->dim
, model
);
298 data
.res
= FN(UNION
,alloc
)(isl_space_copy(data
.exp
->dim
),
299 u
->type
, u
->table
.n
);
301 data
.res
= FN(UNION
,alloc
)(isl_space_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
);
308 isl_space_free(model
);
311 isl_reordering_free(data
.exp
);
313 FN(UNION
,free
)(data
.res
);
314 isl_space_free(model
);
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
);
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_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
));
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 /* 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
));
385 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u1
->dim
), u1
->type
, u1
->table
.n
);
387 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u1
->dim
), u1
->table
.n
);
389 if (isl_hash_table_foreach(u1
->dim
->ctx
, &u1
->table
, fn
, &data
) < 0)
398 FN(UNION
,free
)(data
.res
);
402 S(UNION
,match_set_data
) {
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
;
420 struct isl_hash_table_entry
*entry2
;
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);
430 pw
= FN(PW
,copy
)(pw
);
431 pw
= data
->fn(pw
, isl_set_copy(entry2
->data
));
433 empty
= FN(PW
,is_zero
)(pw
);
443 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
, pw
);
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
));
462 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->type
, u
->table
.n
);
464 data
.res
= FN(UNION
,alloc
)(isl_space_copy(u
->dim
), u
->table
.n
);
466 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
467 &match_set_entry
, &data
) < 0)
471 isl_union_set_free(uset
);
475 isl_union_set_free(uset
);
476 FN(UNION
,free
)(data
.res
);
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
)
496 struct isl_hash_table_entry
*entry
;
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);
506 qp
= isl_qpolynomial_zero(isl_space_copy(pnt
->dim
));
509 qp
= FN(PART
,eval
)(FN(PART
,copy
)(entry
->data
), pnt
);
519 static int coalesce_entry(void **entry
, void *user
)
521 PW
**pw
= (PW
**)entry
;
523 *pw
= FN(PW
,coalesce
)(*pw
);
530 __isl_give UNION
*FN(UNION
,coalesce
)(__isl_take UNION
*u
)
535 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
536 &coalesce_entry
, NULL
) < 0)
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
));
554 __isl_give isl_union_set
*FN(UNION
,domain
)(__isl_take UNION
*u
)
558 uset
= isl_union_set_empty(FN(UNION
,get_space
)(u
));
559 if (FN(FN(UNION
,foreach
),PARTS
)(u
, &domain
, &uset
) < 0)
566 isl_union_set_free(uset
);
571 static int mul_isl_int(void **entry
, void *user
)
573 PW
**pw
= (PW
**)entry
;
576 *pw
= FN(PW
,mul_isl_int
)(*pw
, *v
);
583 __isl_give UNION
*FN(UNION
,mul_isl_int
)(__isl_take UNION
*u
, isl_int v
)
585 if (isl_int_is_one(v
))
588 if (u
&& isl_int_is_zero(v
)) {
590 isl_space
*dim
= FN(UNION
,get_space
)(u
);
592 zero
= FN(UNION
,zero
)(dim
, u
->type
);
594 zero
= FN(UNION
,zero
)(dim
);
600 u
= FN(UNION
,cow
)(u
);
605 if (isl_int_is_neg(v
))
606 u
->type
= isl_fold_type_negate(u
->type
);
608 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
, &mul_isl_int
, v
) < 0)