Coverage Report

Created: 2017-04-29 12:21

/Users/buildslave/jenkins/sharedspace/clang-stage2-coverage-R@2/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
9.22k
#define xSF(TYPE,SUFFIX) TYPE ## SUFFIX
15
9.22k
#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
31
{
53
31
  int i, n, k;
54
31
  int *list = NULL;
55
31
  unsigned n_in, n_out, n_div;
56
31
  isl_ctx *ctx;
57
31
  isl_vec *var = NULL;
58
31
  isl_mat *cst = NULL;
59
31
  isl_space *map_space, *set_space;
60
31
61
31
  map_space = isl_basic_map_get_space(bmap);
62
6
  set_space = empty ? isl_basic_set_get_space(dom) : NULL;
63
31
64
31
  n_in = isl_basic_map_dim(bmap, isl_dim_param) +
65
31
         isl_basic_map_dim(bmap, isl_dim_in);
66
31
  n_out = isl_basic_map_dim(bmap, isl_dim_all) - n_in;
67
31
68
31
  ctx = isl_basic_map_get_ctx(bmap);
69
31
  list = isl_alloc_array(ctx, int, bmap->n_ineq);
70
31
  var = isl_vec_alloc(ctx, n_out);
71
31
  if (
(bmap->n_ineq && 31
!list31
) ||
(n_out && 31
!var31
))
72
0
    goto error;
73
31
74
31
  list[0] = first;
75
31
  list[1] = second;
76
31
  isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out);
77
57
  for (i = second + 1, n = 2; 
i < bmap->n_ineq57
;
++i26
)
{26
78
26
    if (isl_seq_eq(var->el, bmap->ineq[i] + 1 + n_in, n_out) &&
79
0
        all_single_occurrence(bmap, i, n_in))
80
0
      list[n++] = i;
81
26
  }
82
31
83
31
  cst = isl_mat_alloc(ctx, n, 1 + n_in);
84
31
  if (!cst)
85
0
    goto error;
86
31
87
93
  
for (i = 0; 31
i < n93
;
++i62
)
88
62
    isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in);
89
31
90
31
  bmap = isl_basic_map_cow(bmap);
91
31
  if (!bmap)
92
0
    goto error;
93
93
  
for (i = n - 1; 31
i >= 093
;
--i62
)
94
62
    
if (62
isl_basic_map_drop_inequality(bmap, list[i]) < 062
)
95
0
      goto error;
96
31
97
31
  bmap = isl_basic_map_add_dims(bmap, isl_dim_in, 1);
98
31
  bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
99
31
  k = isl_basic_map_alloc_inequality(bmap);
100
31
  if (k < 0)
101
0
    goto error;
102
31
  isl_seq_clr(bmap->ineq[k], 1 + n_in);
103
31
  isl_int_set_si(bmap->ineq[k][1 + n_in], 1);
104
31
  isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out);
105
31
  bmap = isl_basic_map_finalize(bmap);
106
31
107
31
  n_div = isl_basic_set_dim(dom, isl_dim_div);
108
31
  dom = isl_basic_set_add_dims(dom, isl_dim_set, 1);
109
31
  dom = isl_basic_set_extend_constraints(dom, 0, n);
110
93
  for (i = 0; 
i < n93
;
++i62
)
{62
111
62
    k = isl_basic_set_alloc_inequality(dom);
112
62
    if (k < 0)
113
0
      goto error;
114
62
    isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in);
115
62
    isl_int_set_si(dom->ineq[k][1 + n_in], -1);
116
62
    isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div);
117
62
  }
118
31
119
31
  isl_vec_free(var);
120
31
  free(list);
121
31
122
31
  return SF(basic_map_partial_lexopt_symm_core,SUFFIX)(bmap, dom, empty,
123
31
            max, cst, map_space, set_space);
124
0
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
31
}
isl_tab_pip.c:basic_map_partial_lexopt_symm
Line
Count
Source
52
13
{
53
13
  int i, n, k;
54
13
  int *list = NULL;
55
13
  unsigned n_in, n_out, n_div;
56
13
  isl_ctx *ctx;
57
13
  isl_vec *var = NULL;
58
13
  isl_mat *cst = NULL;
59
13
  isl_space *map_space, *set_space;
60
13
61
13
  map_space = isl_basic_map_get_space(bmap);
62
6
  set_space = empty ? isl_basic_set_get_space(dom) : NULL;
63
13
64
13
  n_in = isl_basic_map_dim(bmap, isl_dim_param) +
65
13
         isl_basic_map_dim(bmap, isl_dim_in);
66
13
  n_out = isl_basic_map_dim(bmap, isl_dim_all) - n_in;
67
13
68
13
  ctx = isl_basic_map_get_ctx(bmap);
69
13
  list = isl_alloc_array(ctx, int, bmap->n_ineq);
70
13
  var = isl_vec_alloc(ctx, n_out);
71
13
  if (
(bmap->n_ineq && 13
!list13
) ||
(n_out && 13
!var13
))
72
0
    goto error;
73
13
74
13
  list[0] = first;
75
13
  list[1] = second;
76
13
  isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out);
77
21
  for (i = second + 1, n = 2; 
i < bmap->n_ineq21
;
++i8
)
{8
78
8
    if (isl_seq_eq(var->el, bmap->ineq[i] + 1 + n_in, n_out) &&
79
0
        all_single_occurrence(bmap, i, n_in))
80
0
      list[n++] = i;
81
8
  }
82
13
83
13
  cst = isl_mat_alloc(ctx, n, 1 + n_in);
84
13
  if (!cst)
85
0
    goto error;
86
13
87
39
  
for (i = 0; 13
i < n39
;
++i26
)
88
26
    isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in);
89
13
90
13
  bmap = isl_basic_map_cow(bmap);
91
13
  if (!bmap)
92
0
    goto error;
93
39
  
for (i = n - 1; 13
i >= 039
;
--i26
)
94
26
    
if (26
isl_basic_map_drop_inequality(bmap, list[i]) < 026
)
95
0
      goto error;
96
13
97
13
  bmap = isl_basic_map_add_dims(bmap, isl_dim_in, 1);
98
13
  bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
99
13
  k = isl_basic_map_alloc_inequality(bmap);
100
13
  if (k < 0)
101
0
    goto error;
102
13
  isl_seq_clr(bmap->ineq[k], 1 + n_in);
103
13
  isl_int_set_si(bmap->ineq[k][1 + n_in], 1);
104
13
  isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out);
105
13
  bmap = isl_basic_map_finalize(bmap);
106
13
107
13
  n_div = isl_basic_set_dim(dom, isl_dim_div);
108
13
  dom = isl_basic_set_add_dims(dom, isl_dim_set, 1);
109
13
  dom = isl_basic_set_extend_constraints(dom, 0, n);
110
39
  for (i = 0; 
i < n39
;
++i26
)
{26
111
26
    k = isl_basic_set_alloc_inequality(dom);
112
26
    if (k < 0)
113
0
      goto error;
114
26
    isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in);
115
26
    isl_int_set_si(dom->ineq[k][1 + n_in], -1);
116
26
    isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div);
117
26
  }
118
13
119
13
  isl_vec_free(var);
120
13
  free(list);
121
13
122
13
  return SF(basic_map_partial_lexopt_symm_core,SUFFIX)(bmap, dom, empty,
123
13
            max, cst, map_space, set_space);
124
0
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
13
}
isl_tab_pip.c:basic_map_partial_lexopt_symm_pw_multi_aff
Line
Count
Source
52
18
{
53
18
  int i, n, k;
54
18
  int *list = NULL;
55
18
  unsigned n_in, n_out, n_div;
56
18
  isl_ctx *ctx;
57
18
  isl_vec *var = NULL;
58
18
  isl_mat *cst = NULL;
59
18
  isl_space *map_space, *set_space;
60
18
61
18
  map_space = isl_basic_map_get_space(bmap);
62
0
  set_space = empty ? isl_basic_set_get_space(dom) : NULL;
63
18
64
18
  n_in = isl_basic_map_dim(bmap, isl_dim_param) +
65
18
         isl_basic_map_dim(bmap, isl_dim_in);
66
18
  n_out = isl_basic_map_dim(bmap, isl_dim_all) - n_in;
67
18
68
18
  ctx = isl_basic_map_get_ctx(bmap);
69
18
  list = isl_alloc_array(ctx, int, bmap->n_ineq);
70
18
  var = isl_vec_alloc(ctx, n_out);
71
18
  if (
(bmap->n_ineq && 18
!list18
) ||
(n_out && 18
!var18
))
72
0
    goto error;
73
18
74
18
  list[0] = first;
75
18
  list[1] = second;
76
18
  isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out);
77
36
  for (i = second + 1, n = 2; 
i < bmap->n_ineq36
;
++i18
)
{18
78
18
    if (isl_seq_eq(var->el, bmap->ineq[i] + 1 + n_in, n_out) &&
79
0
        all_single_occurrence(bmap, i, n_in))
80
0
      list[n++] = i;
81
18
  }
82
18
83
18
  cst = isl_mat_alloc(ctx, n, 1 + n_in);
84
18
  if (!cst)
85
0
    goto error;
86
18
87
54
  
for (i = 0; 18
i < n54
;
++i36
)
88
36
    isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in);
89
18
90
18
  bmap = isl_basic_map_cow(bmap);
91
18
  if (!bmap)
92
0
    goto error;
93
54
  
for (i = n - 1; 18
i >= 054
;
--i36
)
94
36
    
if (36
isl_basic_map_drop_inequality(bmap, list[i]) < 036
)
95
0
      goto error;
96
18
97
18
  bmap = isl_basic_map_add_dims(bmap, isl_dim_in, 1);
98
18
  bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
99
18
  k = isl_basic_map_alloc_inequality(bmap);
100
18
  if (k < 0)
101
0
    goto error;
102
18
  isl_seq_clr(bmap->ineq[k], 1 + n_in);
103
18
  isl_int_set_si(bmap->ineq[k][1 + n_in], 1);
104
18
  isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out);
105
18
  bmap = isl_basic_map_finalize(bmap);
106
18
107
18
  n_div = isl_basic_set_dim(dom, isl_dim_div);
108
18
  dom = isl_basic_set_add_dims(dom, isl_dim_set, 1);
109
18
  dom = isl_basic_set_extend_constraints(dom, 0, n);
110
54
  for (i = 0; 
i < n54
;
++i36
)
{36
111
36
    k = isl_basic_set_alloc_inequality(dom);
112
36
    if (k < 0)
113
0
      goto error;
114
36
    isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in);
115
36
    isl_int_set_si(dom->ineq[k][1 + n_in], -1);
116
36
    isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div);
117
36
  }
118
18
119
18
  isl_vec_free(var);
120
18
  free(list);
121
18
122
18
  return SF(basic_map_partial_lexopt_symm_core,SUFFIX)(bmap, dom, empty,
123
18
            max, cst, map_space, set_space);
124
0
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
18
}
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
4.61k
{
148
4.61k
  isl_bool par = isl_bool_false;
149
4.61k
  int first, second;
150
4.61k
151
4.61k
  if (!bmap)
152
0
    goto error;
153
4.61k
154
4.61k
  
if (4.61k
bmap->ctx->opt->pip_symmetry4.61k
)
155
4.61k
    par = parallel_constraints(bmap, &first, &second);
156
4.61k
  if (par < 0)
157
0
    goto error;
158
4.61k
  
if (4.61k
!par4.61k
)
159
4.58k
    
return 4.58k
SF4.58k
(basic_map_partial_lexopt_base,SUFFIX)(bmap, dom,
160
4.58k
                empty, max);
161
4.61k
162
31
  
return 31
SF31
(basic_map_partial_lexopt_symm,SUFFIX)(bmap, dom, empty, max,
163
31
               first, second);
164
0
error:
165
0
  isl_basic_set_free(dom);
166
0
  isl_basic_map_free(bmap);
167
0
  return NULL;
168
4.61k
}
isl_tab_pip.c:basic_map_partial_lexopt
Line
Count
Source
147
2.22k
{
148
2.22k
  isl_bool par = isl_bool_false;
149
2.22k
  int first, second;
150
2.22k
151
2.22k
  if (!bmap)
152
0
    goto error;
153
2.22k
154
2.22k
  
if (2.22k
bmap->ctx->opt->pip_symmetry2.22k
)
155
2.22k
    par = parallel_constraints(bmap, &first, &second);
156
2.22k
  if (par < 0)
157
0
    goto error;
158
2.22k
  
if (2.22k
!par2.22k
)
159
2.20k
    
return 2.20k
SF2.20k
(basic_map_partial_lexopt_base,SUFFIX)(bmap, dom,
160
2.20k
                empty, max);
161
2.22k
162
13
  
return 13
SF13
(basic_map_partial_lexopt_symm,SUFFIX)(bmap, dom, empty, max,
163
13
               first, second);
164
0
error:
165
0
  isl_basic_set_free(dom);
166
0
  isl_basic_map_free(bmap);
167
0
  return NULL;
168
2.22k
}
isl_tab_pip.c:basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
147
2.39k
{
148
2.39k
  isl_bool par = isl_bool_false;
149
2.39k
  int first, second;
150
2.39k
151
2.39k
  if (!bmap)
152
0
    goto error;
153
2.39k
154
2.39k
  
if (2.39k
bmap->ctx->opt->pip_symmetry2.39k
)
155
2.39k
    par = parallel_constraints(bmap, &first, &second);
156
2.39k
  if (par < 0)
157
0
    goto error;
158
2.39k
  
if (2.39k
!par2.39k
)
159
2.37k
    
return 2.37k
SF2.37k
(basic_map_partial_lexopt_base,SUFFIX)(bmap, dom,
160
2.37k
                empty, max);
161
2.39k
162
18
  
return 18
SF18
(basic_map_partial_lexopt_symm,SUFFIX)(bmap, dom, empty, max,
163
18
               first, second);
164
0
error:
165
0
  isl_basic_set_free(dom);
166
0
  isl_basic_map_free(bmap);
167
0
  return NULL;
168
2.39k
}
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
4.58k
{
198
4.58k
  int max, full;
199
4.58k
  isl_bool compatible;
200
4.58k
201
4.58k
  if (empty)
202
2.93k
    *empty = NULL;
203
4.58k
204
4.58k
  full = ISL_FL_ISSET(flags, ISL_OPT_FULL);
205
4.58k
  if (full)
206
1.64k
    dom = extract_domain(bmap, flags);
207
4.58k
  compatible = isl_basic_map_compatible_domain(bmap, dom);
208
4.58k
  if (compatible < 0)
209
0
    goto error;
210
4.58k
  
if (4.58k
!compatible4.58k
)
211
0
    isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
212
4.58k
      "domain does not match input", goto error);
213
4.58k
214
4.58k
  
max = 4.58k
ISL_FL_ISSET4.58k
(flags, ISL_OPT_MAX);
215
4.58k
  if (isl_basic_set_dim(dom, isl_dim_all) == 0)
216
473
    
return 473
SF473
(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
217
473
                  max);
218
4.58k
219
4.10k
  
if (4.10k
!full4.10k
)
220
2.91k
    bmap = isl_basic_map_intersect_domain(bmap,
221
2.91k
                isl_basic_set_copy(dom));
222
4.10k
  bmap = isl_basic_map_detect_equalities(bmap);
223
4.10k
  bmap = isl_basic_map_remove_redundancies(bmap);
224
4.10k
225
4.10k
  return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, max);
226
0
error:
227
0
  isl_basic_set_free(dom);
228
0
  isl_basic_map_free(bmap);
229
0
  return NULL;
230
4.58k
}
isl_tab_basic_map_partial_lexopt
Line
Count
Source
197
2.20k
{
198
2.20k
  int max, full;
199
2.20k
  isl_bool compatible;
200
2.20k
201
2.20k
  if (empty)
202
1.86k
    *empty = NULL;
203
2.20k
204
2.20k
  full = ISL_FL_ISSET(flags, ISL_OPT_FULL);
205
2.20k
  if (full)
206
339
    dom = extract_domain(bmap, flags);
207
2.20k
  compatible = isl_basic_map_compatible_domain(bmap, dom);
208
2.20k
  if (compatible < 0)
209
0
    goto error;
210
2.20k
  
if (2.20k
!compatible2.20k
)
211
0
    isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
212
2.20k
      "domain does not match input", goto error);
213
2.20k
214
2.20k
  
max = 2.20k
ISL_FL_ISSET2.20k
(flags, ISL_OPT_MAX);
215
2.20k
  if (isl_basic_set_dim(dom, isl_dim_all) == 0)
216
50
    
return 50
SF50
(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
217
50
                  max);
218
2.20k
219
2.15k
  
if (2.15k
!full2.15k
)
220
1.85k
    bmap = isl_basic_map_intersect_domain(bmap,
221
1.85k
                isl_basic_set_copy(dom));
222
2.15k
  bmap = isl_basic_map_detect_equalities(bmap);
223
2.15k
  bmap = isl_basic_map_remove_redundancies(bmap);
224
2.15k
225
2.15k
  return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, max);
226
0
error:
227
0
  isl_basic_set_free(dom);
228
0
  isl_basic_map_free(bmap);
229
0
  return NULL;
230
2.20k
}
isl_tab_basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
197
2.37k
{
198
2.37k
  int max, full;
199
2.37k
  isl_bool compatible;
200
2.37k
201
2.37k
  if (empty)
202
1.06k
    *empty = NULL;
203
2.37k
204
2.37k
  full = ISL_FL_ISSET(flags, ISL_OPT_FULL);
205
2.37k
  if (full)
206
1.30k
    dom = extract_domain(bmap, flags);
207
2.37k
  compatible = isl_basic_map_compatible_domain(bmap, dom);
208
2.37k
  if (compatible < 0)
209
0
    goto error;
210
2.37k
  
if (2.37k
!compatible2.37k
)
211
0
    isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
212
2.37k
      "domain does not match input", goto error);
213
2.37k
214
2.37k
  
max = 2.37k
ISL_FL_ISSET2.37k
(flags, ISL_OPT_MAX);
215
2.37k
  if (isl_basic_set_dim(dom, isl_dim_all) == 0)
216
423
    
return 423
SF423
(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
217
423
                  max);
218
2.37k
219
1.95k
  
if (1.95k
!full1.95k
)
220
1.06k
    bmap = isl_basic_map_intersect_domain(bmap,
221
1.06k
                isl_basic_set_copy(dom));
222
1.95k
  bmap = isl_basic_map_detect_equalities(bmap);
223
1.95k
  bmap = isl_basic_map_remove_redundancies(bmap);
224
1.95k
225
1.95k
  return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, max);
226
0
error:
227
0
  isl_basic_set_free(dom);
228
0
  isl_basic_map_free(bmap);
229
0
  return NULL;
230
2.37k
}