Coverage Report

Created: 2018-10-23 03:11

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/tools/polly/lib/External/isl/isl_tab_lexopt_templ.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2008-2009 Katholieke Universiteit Leuven
3
 * Copyright 2010      INRIA Saclay
4
 * Copyright 2011      Sven Verdoolaege
5
 *
6
 * Use of this software is governed by the MIT license
7
 *
8
 * Written by Sven Verdoolaege, K.U.Leuven, Departement
9
 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10
 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
11
 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
12
 */
13
14
15.8k
#define xSF(TYPE,SUFFIX) TYPE ## SUFFIX
15
15.8k
#define SF(TYPE,SUFFIX) xSF(TYPE,SUFFIX)
16
17
/* Given a basic map with at least two parallel constraints (as found
18
 * by the function parallel_constraints), first look for more constraints
19
 * parallel to the two constraint and replace the found list of parallel
20
 * constraints by a single constraint with as "input" part the minimum
21
 * of the input parts of the list of constraints.  Then, recursively call
22
 * basic_map_partial_lexopt (possibly finding more parallel constraints)
23
 * and plug in the definition of the minimum in the result.
24
 *
25
 * As in parallel_constraints, only inequality constraints that only
26
 * involve input variables that do not occur in any other inequality
27
 * constraints are considered.
28
 *
29
 * More specifically, given a set of constraints
30
 *
31
 *  a x + b_i(p) >= 0
32
 *
33
 * Replace this set by a single constraint
34
 *
35
 *  a x + u >= 0
36
 *
37
 * with u a new parameter with constraints
38
 *
39
 *  u <= b_i(p)
40
 *
41
 * Any solution to the new system is also a solution for the original system
42
 * since
43
 *
44
 *  a x >= -u >= -b_i(p)
45
 *
46
 * Moreover, m = min_i(b_i(p)) satisfies the constraints on u and can
47
 * therefore be plugged into the solution.
48
 */
49
static TYPE *SF(basic_map_partial_lexopt_symm,SUFFIX)(
50
  __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
51
  __isl_give isl_set **empty, int max, int first, int second)
52
209
{
53
209
  int i, n, k;
54
209
  int *list = NULL;
55
209
  unsigned n_in, n_out, n_div;
56
209
  isl_ctx *ctx;
57
209
  isl_vec *var = NULL;
58
209
  isl_mat *cst = NULL;
59
209
  isl_space *map_space, *set_space;
60
209
61
209
  map_space = isl_basic_map_get_space(bmap);
62
209
  set_space = empty ? 
isl_basic_set_get_space(dom)6
: NULL;
63
209
64
209
  n_in = isl_basic_map_dim(bmap, isl_dim_param) +
65
209
         isl_basic_map_dim(bmap, isl_dim_in);
66
209
  n_out = isl_basic_map_dim(bmap, isl_dim_all) - n_in;
67
209
68
209
  ctx = isl_basic_map_get_ctx(bmap);
69
209
  list = isl_alloc_array(ctx, int, bmap->n_ineq);
70
209
  var = isl_vec_alloc(ctx, n_out);
71
209
  if ((bmap->n_ineq && !list) || (n_out && !var))
72
0
    goto error;
73
209
74
209
  list[0] = first;
75
209
  list[1] = second;
76
209
  isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out);
77
429
  for (i = second + 1, n = 2; i < bmap->n_ineq; 
++i220
) {
78
220
    if (isl_seq_eq(var->el, bmap->ineq[i] + 1 + n_in, n_out) &&
79
220
        
all_single_occurrence(bmap, i, n_in)3
)
80
0
      list[n++] = i;
81
220
  }
82
209
83
209
  cst = isl_mat_alloc(ctx, n, 1 + n_in);
84
209
  if (!cst)
85
0
    goto error;
86
209
87
627
  
for (i = 0; 209
i < n;
++i418
)
88
418
    isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in);
89
209
90
209
  bmap = isl_basic_map_cow(bmap);
91
209
  if (!bmap)
92
0
    goto error;
93
627
  
for (i = n - 1; 209
i >= 0;
--i418
)
94
418
    if (isl_basic_map_drop_inequality(bmap, list[i]) < 0)
95
0
      goto error;
96
209
97
209
  bmap = isl_basic_map_add_dims(bmap, isl_dim_in, 1);
98
209
  bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
99
209
  k = isl_basic_map_alloc_inequality(bmap);
100
209
  if (k < 0)
101
0
    goto error;
102
209
  isl_seq_clr(bmap->ineq[k], 1 + n_in);
103
209
  isl_int_set_si(bmap->ineq[k][1 + n_in], 1);
104
209
  isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out);
105
209
  bmap = isl_basic_map_finalize(bmap);
106
209
107
209
  n_div = isl_basic_set_dim(dom, isl_dim_div);
108
209
  dom = isl_basic_set_add_dims(dom, isl_dim_set, 1);
109
209
  dom = isl_basic_set_extend_constraints(dom, 0, n);
110
627
  for (i = 0; i < n; 
++i418
) {
111
418
    k = isl_basic_set_alloc_inequality(dom);
112
418
    if (k < 0)
113
0
      goto error;
114
418
    isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in);
115
418
    isl_int_set_si(dom->ineq[k][1 + n_in], -1);
116
418
    isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div);
117
418
  }
118
209
119
209
  isl_vec_free(var);
120
209
  free(list);
121
209
122
209
  return SF(basic_map_partial_lexopt_symm_core,SUFFIX)(bmap, dom, empty,
123
209
            max, cst, map_space, set_space);
124
209
error:
125
0
  isl_space_free(map_space);
126
0
  isl_space_free(set_space);
127
0
  isl_mat_free(cst);
128
0
  isl_vec_free(var);
129
0
  free(list);
130
0
  isl_basic_set_free(dom);
131
0
  isl_basic_map_free(bmap);
132
0
  return NULL;
133
209
}
isl_tab_pip.c:basic_map_partial_lexopt_symm
Line
Count
Source
52
55
{
53
55
  int i, n, k;
54
55
  int *list = NULL;
55
55
  unsigned n_in, n_out, n_div;
56
55
  isl_ctx *ctx;
57
55
  isl_vec *var = NULL;
58
55
  isl_mat *cst = NULL;
59
55
  isl_space *map_space, *set_space;
60
55
61
55
  map_space = isl_basic_map_get_space(bmap);
62
55
  set_space = empty ? 
isl_basic_set_get_space(dom)6
: NULL;
63
55
64
55
  n_in = isl_basic_map_dim(bmap, isl_dim_param) +
65
55
         isl_basic_map_dim(bmap, isl_dim_in);
66
55
  n_out = isl_basic_map_dim(bmap, isl_dim_all) - n_in;
67
55
68
55
  ctx = isl_basic_map_get_ctx(bmap);
69
55
  list = isl_alloc_array(ctx, int, bmap->n_ineq);
70
55
  var = isl_vec_alloc(ctx, n_out);
71
55
  if ((bmap->n_ineq && !list) || (n_out && !var))
72
0
    goto error;
73
55
74
55
  list[0] = first;
75
55
  list[1] = second;
76
55
  isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out);
77
135
  for (i = second + 1, n = 2; i < bmap->n_ineq; 
++i80
) {
78
80
    if (isl_seq_eq(var->el, bmap->ineq[i] + 1 + n_in, n_out) &&
79
80
        
all_single_occurrence(bmap, i, n_in)0
)
80
0
      list[n++] = i;
81
80
  }
82
55
83
55
  cst = isl_mat_alloc(ctx, n, 1 + n_in);
84
55
  if (!cst)
85
0
    goto error;
86
55
87
165
  
for (i = 0; 55
i < n;
++i110
)
88
110
    isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in);
89
55
90
55
  bmap = isl_basic_map_cow(bmap);
91
55
  if (!bmap)
92
0
    goto error;
93
165
  
for (i = n - 1; 55
i >= 0;
--i110
)
94
110
    if (isl_basic_map_drop_inequality(bmap, list[i]) < 0)
95
0
      goto error;
96
55
97
55
  bmap = isl_basic_map_add_dims(bmap, isl_dim_in, 1);
98
55
  bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
99
55
  k = isl_basic_map_alloc_inequality(bmap);
100
55
  if (k < 0)
101
0
    goto error;
102
55
  isl_seq_clr(bmap->ineq[k], 1 + n_in);
103
55
  isl_int_set_si(bmap->ineq[k][1 + n_in], 1);
104
55
  isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out);
105
55
  bmap = isl_basic_map_finalize(bmap);
106
55
107
55
  n_div = isl_basic_set_dim(dom, isl_dim_div);
108
55
  dom = isl_basic_set_add_dims(dom, isl_dim_set, 1);
109
55
  dom = isl_basic_set_extend_constraints(dom, 0, n);
110
165
  for (i = 0; i < n; 
++i110
) {
111
110
    k = isl_basic_set_alloc_inequality(dom);
112
110
    if (k < 0)
113
0
      goto error;
114
110
    isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in);
115
110
    isl_int_set_si(dom->ineq[k][1 + n_in], -1);
116
110
    isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div);
117
110
  }
118
55
119
55
  isl_vec_free(var);
120
55
  free(list);
121
55
122
55
  return SF(basic_map_partial_lexopt_symm_core,SUFFIX)(bmap, dom, empty,
123
55
            max, cst, map_space, set_space);
124
55
error:
125
0
  isl_space_free(map_space);
126
0
  isl_space_free(set_space);
127
0
  isl_mat_free(cst);
128
0
  isl_vec_free(var);
129
0
  free(list);
130
0
  isl_basic_set_free(dom);
131
0
  isl_basic_map_free(bmap);
132
0
  return NULL;
133
55
}
isl_tab_pip.c:basic_map_partial_lexopt_symm_pw_multi_aff
Line
Count
Source
52
154
{
53
154
  int i, n, k;
54
154
  int *list = NULL;
55
154
  unsigned n_in, n_out, n_div;
56
154
  isl_ctx *ctx;
57
154
  isl_vec *var = NULL;
58
154
  isl_mat *cst = NULL;
59
154
  isl_space *map_space, *set_space;
60
154
61
154
  map_space = isl_basic_map_get_space(bmap);
62
154
  set_space = empty ? 
isl_basic_set_get_space(dom)0
: NULL;
63
154
64
154
  n_in = isl_basic_map_dim(bmap, isl_dim_param) +
65
154
         isl_basic_map_dim(bmap, isl_dim_in);
66
154
  n_out = isl_basic_map_dim(bmap, isl_dim_all) - n_in;
67
154
68
154
  ctx = isl_basic_map_get_ctx(bmap);
69
154
  list = isl_alloc_array(ctx, int, bmap->n_ineq);
70
154
  var = isl_vec_alloc(ctx, n_out);
71
154
  if ((bmap->n_ineq && !list) || (n_out && !var))
72
0
    goto error;
73
154
74
154
  list[0] = first;
75
154
  list[1] = second;
76
154
  isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out);
77
294
  for (i = second + 1, n = 2; i < bmap->n_ineq; 
++i140
) {
78
140
    if (isl_seq_eq(var->el, bmap->ineq[i] + 1 + n_in, n_out) &&
79
140
        
all_single_occurrence(bmap, i, n_in)3
)
80
0
      list[n++] = i;
81
140
  }
82
154
83
154
  cst = isl_mat_alloc(ctx, n, 1 + n_in);
84
154
  if (!cst)
85
0
    goto error;
86
154
87
462
  
for (i = 0; 154
i < n;
++i308
)
88
308
    isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in);
89
154
90
154
  bmap = isl_basic_map_cow(bmap);
91
154
  if (!bmap)
92
0
    goto error;
93
462
  
for (i = n - 1; 154
i >= 0;
--i308
)
94
308
    if (isl_basic_map_drop_inequality(bmap, list[i]) < 0)
95
0
      goto error;
96
154
97
154
  bmap = isl_basic_map_add_dims(bmap, isl_dim_in, 1);
98
154
  bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
99
154
  k = isl_basic_map_alloc_inequality(bmap);
100
154
  if (k < 0)
101
0
    goto error;
102
154
  isl_seq_clr(bmap->ineq[k], 1 + n_in);
103
154
  isl_int_set_si(bmap->ineq[k][1 + n_in], 1);
104
154
  isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out);
105
154
  bmap = isl_basic_map_finalize(bmap);
106
154
107
154
  n_div = isl_basic_set_dim(dom, isl_dim_div);
108
154
  dom = isl_basic_set_add_dims(dom, isl_dim_set, 1);
109
154
  dom = isl_basic_set_extend_constraints(dom, 0, n);
110
462
  for (i = 0; i < n; 
++i308
) {
111
308
    k = isl_basic_set_alloc_inequality(dom);
112
308
    if (k < 0)
113
0
      goto error;
114
308
    isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in);
115
308
    isl_int_set_si(dom->ineq[k][1 + n_in], -1);
116
308
    isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div);
117
308
  }
118
154
119
154
  isl_vec_free(var);
120
154
  free(list);
121
154
122
154
  return SF(basic_map_partial_lexopt_symm_core,SUFFIX)(bmap, dom, empty,
123
154
            max, cst, map_space, set_space);
124
154
error:
125
0
  isl_space_free(map_space);
126
0
  isl_space_free(set_space);
127
0
  isl_mat_free(cst);
128
0
  isl_vec_free(var);
129
0
  free(list);
130
0
  isl_basic_set_free(dom);
131
0
  isl_basic_map_free(bmap);
132
0
  return NULL;
133
154
}
134
135
/* Recursive part of isl_tab_basic_map_partial_lexopt*, after detecting
136
 * equalities and removing redundant constraints.
137
 *
138
 * We first check if there are any parallel constraints (left).
139
 * If not, we are in the base case.
140
 * If there are parallel constraints, we replace them by a single
141
 * constraint in basic_map_partial_lexopt_symm_pma and then call
142
 * this function recursively to look for more parallel constraints.
143
 */
144
static __isl_give TYPE *SF(basic_map_partial_lexopt,SUFFIX)(
145
  __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
146
  __isl_give isl_set **empty, int max)
147
7.93k
{
148
7.93k
  isl_bool par = isl_bool_false;
149
7.93k
  int first, second;
150
7.93k
151
7.93k
  if (!bmap)
152
0
    goto error;
153
7.93k
154
7.93k
  if (bmap->ctx->opt->pip_symmetry)
155
7.93k
    par = parallel_constraints(bmap, &first, &second);
156
7.93k
  if (par < 0)
157
0
    goto error;
158
7.93k
  if (!par)
159
7.72k
    return SF(basic_map_partial_lexopt_base,SUFFIX)(bmap, dom,
160
7.72k
                empty, max);
161
209
162
209
  return SF(basic_map_partial_lexopt_symm,SUFFIX)(bmap, dom, empty, max,
163
209
               first, second);
164
209
error:
165
0
  isl_basic_set_free(dom);
166
0
  isl_basic_map_free(bmap);
167
0
  return NULL;
168
209
}
isl_tab_pip.c:basic_map_partial_lexopt
Line
Count
Source
147
3.66k
{
148
3.66k
  isl_bool par = isl_bool_false;
149
3.66k
  int first, second;
150
3.66k
151
3.66k
  if (!bmap)
152
0
    goto error;
153
3.66k
154
3.66k
  if (bmap->ctx->opt->pip_symmetry)
155
3.66k
    par = parallel_constraints(bmap, &first, &second);
156
3.66k
  if (par < 0)
157
0
    goto error;
158
3.66k
  if (!par)
159
3.60k
    return SF(basic_map_partial_lexopt_base,SUFFIX)(bmap, dom,
160
3.60k
                empty, max);
161
55
162
55
  return SF(basic_map_partial_lexopt_symm,SUFFIX)(bmap, dom, empty, max,
163
55
               first, second);
164
55
error:
165
0
  isl_basic_set_free(dom);
166
0
  isl_basic_map_free(bmap);
167
0
  return NULL;
168
55
}
isl_tab_pip.c:basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
147
4.27k
{
148
4.27k
  isl_bool par = isl_bool_false;
149
4.27k
  int first, second;
150
4.27k
151
4.27k
  if (!bmap)
152
0
    goto error;
153
4.27k
154
4.27k
  if (bmap->ctx->opt->pip_symmetry)
155
4.27k
    par = parallel_constraints(bmap, &first, &second);
156
4.27k
  if (par < 0)
157
0
    goto error;
158
4.27k
  if (!par)
159
4.12k
    return SF(basic_map_partial_lexopt_base,SUFFIX)(bmap, dom,
160
4.12k
                empty, max);
161
154
162
154
  return SF(basic_map_partial_lexopt_symm,SUFFIX)(bmap, dom, empty, max,
163
154
               first, second);
164
154
error:
165
0
  isl_basic_set_free(dom);
166
0
  isl_basic_map_free(bmap);
167
0
  return NULL;
168
154
}
169
170
/* Compute the lexicographic minimum (or maximum if "flags" includes
171
 * ISL_OPT_MAX) of "bmap" over the domain "dom" and return the result as
172
 * either a map or a piecewise multi-affine expression depending on TYPE.
173
 * If "empty" is not NULL, then *empty is assigned a set that
174
 * contains those parts of the domain where there is no solution.
175
 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
176
 * should be computed over the domain of "bmap".  "empty" is also NULL
177
 * in this case.
178
 * If "bmap" is marked as rational (ISL_BASIC_MAP_RATIONAL),
179
 * then we compute the rational optimum.  Otherwise, we compute
180
 * the integral optimum.
181
 *
182
 * We perform some preprocessing.  As the PILP solver does not
183
 * handle implicit equalities very well, we first make sure all
184
 * the equalities are explicitly available.
185
 *
186
 * We also add context constraints to the basic map and remove
187
 * redundant constraints.  This is only needed because of the
188
 * way we handle simple symmetries.  In particular, we currently look
189
 * for symmetries on the constraints, before we set up the main tableau.
190
 * It is then no good to look for symmetries on possibly redundant constraints.
191
 * If the domain was extracted from the basic map, then there is
192
 * no need to add back those constraints again.
193
 */
194
__isl_give TYPE *SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(
195
  __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
196
  __isl_give isl_set **empty, unsigned flags)
197
7.72k
{
198
7.72k
  int max, full;
199
7.72k
  isl_bool compatible;
200
7.72k
201
7.72k
  if (empty)
202
3.30k
    *empty = NULL;
203
7.72k
204
7.72k
  full = ISL_FL_ISSET(flags, ISL_OPT_FULL);
205
7.72k
  if (full)
206
4.41k
    dom = extract_domain(bmap, flags);
207
7.72k
  compatible = isl_basic_map_compatible_domain(bmap, dom);
208
7.72k
  if (compatible < 0)
209
0
    goto error;
210
7.72k
  if (!compatible)
211
7.72k
    
isl_die0
(isl_basic_map_get_ctx(bmap), isl_error_invalid,
212
7.72k
      "domain does not match input", goto error);
213
7.72k
214
7.72k
  max = ISL_FL_ISSET(flags, ISL_OPT_MAX);
215
7.72k
  if (isl_basic_set_dim(dom, isl_dim_all) == 0)
216
1.48k
    return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
217
1.48k
                  max);
218
6.24k
219
6.24k
  if (!full)
220
3.28k
    bmap = isl_basic_map_intersect_domain(bmap,
221
3.28k
                isl_basic_set_copy(dom));
222
6.24k
  bmap = isl_basic_map_detect_equalities(bmap);
223
6.24k
  bmap = isl_basic_map_remove_redundancies(bmap);
224
6.24k
225
6.24k
  return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, max);
226
6.24k
error:
227
0
  isl_basic_set_free(dom);
228
0
  isl_basic_map_free(bmap);
229
0
  return NULL;
230
6.24k
}
isl_tab_basic_map_partial_lexopt
Line
Count
Source
197
3.60k
{
198
3.60k
  int max, full;
199
3.60k
  isl_bool compatible;
200
3.60k
201
3.60k
  if (empty)
202
2.74k
    *empty = NULL;
203
3.60k
204
3.60k
  full = ISL_FL_ISSET(flags, ISL_OPT_FULL);
205
3.60k
  if (full)
206
863
    dom = extract_domain(bmap, flags);
207
3.60k
  compatible = isl_basic_map_compatible_domain(bmap, dom);
208
3.60k
  if (compatible < 0)
209
0
    goto error;
210
3.60k
  if (!compatible)
211
3.60k
    
isl_die0
(isl_basic_map_get_ctx(bmap), isl_error_invalid,
212
3.60k
      "domain does not match input", goto error);
213
3.60k
214
3.60k
  max = ISL_FL_ISSET(flags, ISL_OPT_MAX);
215
3.60k
  if (isl_basic_set_dim(dom, isl_dim_all) == 0)
216
95
    return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
217
95
                  max);
218
3.51k
219
3.51k
  if (!full)
220
2.72k
    bmap = isl_basic_map_intersect_domain(bmap,
221
2.72k
                isl_basic_set_copy(dom));
222
3.51k
  bmap = isl_basic_map_detect_equalities(bmap);
223
3.51k
  bmap = isl_basic_map_remove_redundancies(bmap);
224
3.51k
225
3.51k
  return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, max);
226
3.51k
error:
227
0
  isl_basic_set_free(dom);
228
0
  isl_basic_map_free(bmap);
229
0
  return NULL;
230
3.51k
}
isl_tab_basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
197
4.12k
{
198
4.12k
  int max, full;
199
4.12k
  isl_bool compatible;
200
4.12k
201
4.12k
  if (empty)
202
567
    *empty = NULL;
203
4.12k
204
4.12k
  full = ISL_FL_ISSET(flags, ISL_OPT_FULL);
205
4.12k
  if (full)
206
3.55k
    dom = extract_domain(bmap, flags);
207
4.12k
  compatible = isl_basic_map_compatible_domain(bmap, dom);
208
4.12k
  if (compatible < 0)
209
0
    goto error;
210
4.12k
  if (!compatible)
211
4.12k
    
isl_die0
(isl_basic_map_get_ctx(bmap), isl_error_invalid,
212
4.12k
      "domain does not match input", goto error);
213
4.12k
214
4.12k
  max = ISL_FL_ISSET(flags, ISL_OPT_MAX);
215
4.12k
  if (isl_basic_set_dim(dom, isl_dim_all) == 0)
216
1.38k
    return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
217
1.38k
                  max);
218
2.73k
219
2.73k
  if (!full)
220
567
    bmap = isl_basic_map_intersect_domain(bmap,
221
567
                isl_basic_set_copy(dom));
222
2.73k
  bmap = isl_basic_map_detect_equalities(bmap);
223
2.73k
  bmap = isl_basic_map_remove_redundancies(bmap);
224
2.73k
225
2.73k
  return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, max);
226
2.73k
error:
227
0
  isl_basic_set_free(dom);
228
0
  isl_basic_map_free(bmap);
229
0
  return NULL;
230
2.73k
}