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
);
232 __isl_give UNION
*FN(UNION
,add
)(__isl_take UNION
*u1
, __isl_take UNION
*u2
)
234 u1
= FN(UNION
,cow
)(u1
);
239 if (FN(FN(UNION
,foreach
),PARTS
)(u2
, &add_part
, &u1
) < 0)
251 __isl_give UNION
*FN(FN(UNION
,from
),PARTS
)(__isl_take PART
*part
)
259 dim
= FN(PART
,get_dim
)(part
);
260 dim
= isl_dim_drop(dim
, isl_dim_in
, 0, isl_dim_size(dim
, isl_dim_in
));
261 dim
= isl_dim_drop(dim
, isl_dim_out
, 0, isl_dim_size(dim
, isl_dim_out
));
263 u
= FN(UNION
,zero
)(dim
, part
->type
);
265 u
= FN(UNION
,zero
)(dim
);
267 u
= FN(FN(UNION
,add
),PARTS
)(u
, part
);
272 S(UNION
,match_bin_data
) {
277 static __isl_give UNION
*match_bin_op(__isl_take UNION
*u1
,
278 __isl_take UNION
*u2
, int (*fn
)(void **, void *))
280 S(UNION
,match_bin_data
) data
= { u2
, NULL
};
286 data
.res
= FN(UNION
,alloc
)(isl_dim_copy(u1
->dim
), u1
->type
, u1
->table
.n
);
288 data
.res
= FN(UNION
,alloc
)(isl_dim_copy(u1
->dim
), u1
->table
.n
);
290 if (isl_hash_table_foreach(u1
->dim
->ctx
, &u1
->table
, fn
, &data
) < 0)
299 FN(UNION
,free
)(data
.res
);
303 S(UNION
,match_set_data
) {
306 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*);
309 static int set_has_dim(const void *entry
, const void *val
)
311 isl_set
*set
= (isl_set
*)entry
;
312 isl_dim
*dim
= (isl_dim
*)val
;
314 return isl_dim_equal(set
->dim
, dim
);
317 static int match_set_entry(void **entry
, void *user
)
319 S(UNION
,match_set_data
) *data
= user
;
321 struct isl_hash_table_entry
*entry2
;
326 hash
= isl_dim_get_hash(pw
->dim
);
327 entry2
= isl_hash_table_find(data
->uset
->dim
->ctx
, &data
->uset
->table
,
328 hash
, &set_has_dim
, pw
->dim
, 0);
332 pw
= FN(PW
,copy
)(pw
);
333 pw
= data
->fn(pw
, isl_set_copy(entry2
->data
));
335 empty
= FN(PW
,is_zero
)(pw
);
345 data
->res
= FN(FN(UNION
,add
),PARTS
)(data
->res
, pw
);
350 static __isl_give UNION
*match_set_op(__isl_take UNION
*u
,
351 __isl_take isl_union_set
*uset
,
352 __isl_give PW
*(*fn
)(__isl_take PW
*, __isl_take isl_set
*))
354 S(UNION
,match_set_data
) data
= { uset
, NULL
, fn
};
360 data
.res
= FN(UNION
,alloc
)(isl_dim_copy(u
->dim
), u
->type
, u
->table
.n
);
362 data
.res
= FN(UNION
,alloc
)(isl_dim_copy(u
->dim
), u
->table
.n
);
364 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
365 &match_set_entry
, &data
) < 0)
369 isl_union_set_free(uset
);
373 isl_union_set_free(uset
);
374 FN(UNION
,free
)(data
.res
);
378 __isl_give UNION
*FN(UNION
,intersect_domain
)(__isl_take UNION
*u
,
379 __isl_take isl_union_set
*uset
)
381 return match_set_op(u
, uset
, &FN(PW
,intersect_domain
));
384 __isl_give UNION
*FN(UNION
,gist
)(__isl_take UNION
*u
,
385 __isl_take isl_union_set
*uset
)
387 return match_set_op(u
, uset
, &FN(PW
,gist
));
390 __isl_give isl_qpolynomial
*FN(UNION
,eval
)(__isl_take UNION
*u
,
391 __isl_take isl_point
*pnt
)
394 struct isl_hash_table_entry
*entry
;
400 hash
= isl_dim_get_hash(pnt
->dim
);
401 entry
= isl_hash_table_find(u
->dim
->ctx
, &u
->table
,
402 hash
, &has_dim
, pnt
->dim
, 0);
404 qp
= isl_qpolynomial_zero(isl_dim_copy(pnt
->dim
));
407 qp
= FN(PART
,eval
)(FN(PART
,copy
)(entry
->data
), pnt
);
417 static int coalesce_entry(void **entry
, void *user
)
419 PW
**pw
= (PW
**)entry
;
421 *pw
= FN(PW
,coalesce
)(*pw
);
428 __isl_give UNION
*FN(UNION
,coalesce
)(__isl_take UNION
*u
)
433 if (isl_hash_table_foreach(u
->dim
->ctx
, &u
->table
,
434 &coalesce_entry
, NULL
) < 0)
443 static int domain(__isl_take PART
*part
, void *user
)
445 isl_union_set
**uset
= (isl_union_set
**)user
;
447 *uset
= isl_union_set_add_set(*uset
, FN(PART
,domain
)(part
));
452 __isl_give isl_union_set
*FN(UNION
,domain
)(__isl_take UNION
*u
)
456 uset
= isl_union_set_empty(FN(UNION
,get_dim
)(u
));
457 if (FN(FN(UNION
,foreach
),PARTS
)(u
, &domain
, &uset
) < 0)
464 isl_union_set_free(uset
);