Use an MIT licensed mergesort as the sorting algorithm for isl
[platform/upstream/isl.git] / isl_bound.h
1 #ifndef ISL_BOUND_H
2 #define ISL_BOUND_H
3
4 #include <isl/polynomial.h>
5
6 struct isl_bound {
7         /* input */
8         int check_tight;
9         int wrapping;
10         enum isl_fold type;
11         isl_space *dim;
12         isl_basic_set *bset;
13         isl_qpolynomial_fold *fold;
14
15         /* output */
16         isl_pw_qpolynomial_fold *pwf;
17         isl_pw_qpolynomial_fold *pwf_tight;
18 };
19
20 #endif