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 #include <isl_bound.h>
12 #include <isl_range.h>
13 #include <isl_polynomial_private.h>
15 static int compressed_guarded_poly_bound(__isl_take isl_basic_set *bset,
16 __isl_take isl_qpolynomial *poly, void *user)
18 struct isl_bound *bound = (struct isl_bound *)user;
19 return isl_qpolynomial_bound_on_domain_range(bset, poly, bound);
22 static int guarded_poly_bound(__isl_take isl_basic_set *bset,
23 __isl_take isl_qpolynomial *poly, void *user)
25 struct isl_bound *bound = (struct isl_bound *)user;
26 isl_pw_qpolynomial_fold *top_pwf;
27 isl_pw_qpolynomial_fold *top_pwf_tight;
30 unsigned orig_nvar, final_nvar;
33 bset = isl_basic_set_detect_equalities(bset);
39 return compressed_guarded_poly_bound(bset, poly, user);
41 orig_nvar = isl_basic_set_dim(bset, isl_dim_set);
43 morph = isl_basic_set_full_compression(bset);
45 bset = isl_morph_basic_set(isl_morph_copy(morph), bset);
46 poly = isl_qpolynomial_morph(poly, isl_morph_copy(morph));
48 final_nvar = isl_basic_set_dim(bset, isl_dim_set);
50 dim = isl_morph_get_ran_dim(morph);
51 dim = isl_dim_drop(dim, isl_dim_set, 0, isl_dim_size(dim, isl_dim_set));
54 top_pwf_tight = bound->pwf_tight;
56 bound->pwf = isl_pw_qpolynomial_fold_zero(isl_dim_copy(dim));
57 bound->pwf_tight = isl_pw_qpolynomial_fold_zero(dim);
59 r = compressed_guarded_poly_bound(bset, poly, user);
61 morph = isl_morph_remove_dom_dims(morph, isl_dim_set, 0, orig_nvar);
62 morph = isl_morph_remove_ran_dims(morph, isl_dim_set, 0, final_nvar);
63 morph = isl_morph_inverse(morph);
65 bound->pwf = isl_pw_qpolynomial_fold_morph(bound->pwf,
66 isl_morph_copy(morph));
67 bound->pwf_tight = isl_pw_qpolynomial_fold_morph(bound->pwf_tight, morph);
69 bound->pwf = isl_pw_qpolynomial_fold_add(top_pwf, bound->pwf);
70 bound->pwf_tight = isl_pw_qpolynomial_fold_add(top_pwf_tight,
75 isl_basic_set_free(bset);
76 isl_qpolynomial_free(poly);
80 static int basic_guarded_bound(__isl_take isl_basic_set *bset, void *user)
82 struct isl_bound *bound = (struct isl_bound *)user;
85 r = isl_qpolynomial_as_polynomial_on_domain(bound->qp, bset,
86 &guarded_poly_bound, user);
87 isl_basic_set_free(bset);
91 static int guarded_bound(__isl_take isl_set *set,
92 __isl_take isl_qpolynomial *qp, void *user)
94 struct isl_bound *bound = (struct isl_bound *)user;
99 set = isl_set_make_disjoint(set);
103 if (isl_set_foreach_basic_set(set, &basic_guarded_bound, bound) < 0)
107 isl_qpolynomial_free(qp);
112 isl_qpolynomial_free(qp);
116 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_bound(
117 __isl_take isl_pw_qpolynomial *pwqp, enum isl_fold type, int *tight)
121 struct isl_bound bound;
127 dim = isl_pw_qpolynomial_get_dim(pwqp);
128 nvar = isl_dim_size(dim, isl_dim_set);
130 if (isl_pw_qpolynomial_is_zero(pwqp)) {
131 isl_pw_qpolynomial_free(pwqp);
132 dim = isl_dim_drop(dim, isl_dim_set, 0, nvar);
135 return isl_pw_qpolynomial_fold_zero(dim);
142 return isl_pw_qpolynomial_fold_from_pw_qpolynomial(type, pwqp);
145 dim = isl_dim_drop(dim, isl_dim_set, 0, nvar);
147 bound.pwf = isl_pw_qpolynomial_fold_zero(isl_dim_copy(dim));
148 bound.pwf_tight = isl_pw_qpolynomial_fold_zero(isl_dim_copy(dim));
150 bound.check_tight = !!tight;
152 if (isl_pw_qpolynomial_foreach_lifted_piece(pwqp, guarded_bound, &bound))
155 covers = isl_pw_qpolynomial_fold_covers(bound.pwf_tight, bound.pwf);
163 isl_pw_qpolynomial_free(pwqp);
166 isl_pw_qpolynomial_fold_free(bound.pwf);
167 return bound.pwf_tight;
170 bound.pwf = isl_pw_qpolynomial_fold_add(bound.pwf, bound.pwf_tight);
174 isl_pw_qpolynomial_fold_free(bound.pwf_tight);
175 isl_pw_qpolynomial_fold_free(bound.pwf);
177 isl_pw_qpolynomial_free(pwqp);