Coverage Report

Created: 2017-08-21 19:50

/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
12.3k
#define xSF(TYPE,SUFFIX) TYPE ## SUFFIX
15
12.3k
#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
119
{
53
119
  int i, n, k;
54
119
  int *list = NULL;
55
119
  unsigned n_in, n_out, n_div;
56
119
  isl_ctx *ctx;
57
119
  isl_vec *var = NULL;
58
119
  isl_mat *cst = NULL;
59
119
  isl_space *map_space, *set_space;
60
119
61
119
  map_space = isl_basic_map_get_space(bmap);
62
6
  set_space = empty ? isl_basic_set_get_space(dom) : NULL;
63
119
64
119
  n_in = isl_basic_map_dim(bmap, isl_dim_param) +
65
119
         isl_basic_map_dim(bmap, isl_dim_in);
66
119
  n_out = isl_basic_map_dim(bmap, isl_dim_all) - n_in;
67
119
68
119
  ctx = isl_basic_map_get_ctx(bmap);
69
119
  list = isl_alloc_array(ctx, int, bmap->n_ineq);
70
119
  var = isl_vec_alloc(ctx, n_out);
71
119
  if (
(bmap->n_ineq && 119
!list119
) ||
(n_out && 119
!var119
))
72
0
    goto error;
73
119
74
119
  list[0] = first;
75
119
  list[1] = second;
76
119
  isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out);
77
228
  for (i = second + 1, n = 2; 
i < bmap->n_ineq228
;
++i109
)
{109
78
109
    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
119
  }
82
119
83
119
  cst = isl_mat_alloc(ctx, n, 1 + n_in);
84
119
  if (!cst)
85
0
    goto error;
86
119
87
357
  
for (i = 0; 119
i < n357
;
++i238
)
88
238
    isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in);
89
119
90
119
  bmap = isl_basic_map_cow(bmap);
91
119
  if (!bmap)
92
0
    goto error;
93
357
  
for (i = n - 1; 119
i >= 0357
;
--i238
)
94
238
    
if (238
isl_basic_map_drop_inequality(bmap, list[i]) < 0238
)
95
0
      goto error;
96
119
97
119
  bmap = isl_basic_map_add_dims(bmap, isl_dim_in, 1);
98
119
  bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
99
119
  k = isl_basic_map_alloc_inequality(bmap);
100
119
  if (k < 0)
101
0
    goto error;
102
119
  isl_seq_clr(bmap->ineq[k], 1 + n_in);
103
119
  isl_int_set_si(bmap->ineq[k][1 + n_in], 1);
104
119
  isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out);
105
119
  bmap = isl_basic_map_finalize(bmap);
106
119
107
119
  n_div = isl_basic_set_dim(dom, isl_dim_div);
108
119
  dom = isl_basic_set_add_dims(dom, isl_dim_set, 1);
109
119
  dom = isl_basic_set_extend_constraints(dom, 0, n);
110
357
  for (i = 0; 
i < n357
;
++i238
)
{238
111
238
    k = isl_basic_set_alloc_inequality(dom);
112
238
    if (k < 0)
113
0
      goto error;
114
238
    isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in);
115
238
    isl_int_set_si(dom->ineq[k][1 + n_in], -1);
116
238
    isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div);
117
238
  }
118
119
119
119
  isl_vec_free(var);
120
119
  free(list);
121
119
122
119
  return SF(basic_map_partial_lexopt_symm_core,SUFFIX)(bmap, dom, empty,
123
119
            max, cst, map_space, set_space);
124
119
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
119
  return NULL;
133
119
}
isl_tab_pip.c:basic_map_partial_lexopt_symm
Line
Count
Source
52
51
{
53
51
  int i, n, k;
54
51
  int *list = NULL;
55
51
  unsigned n_in, n_out, n_div;
56
51
  isl_ctx *ctx;
57
51
  isl_vec *var = NULL;
58
51
  isl_mat *cst = NULL;
59
51
  isl_space *map_space, *set_space;
60
51
61
51
  map_space = isl_basic_map_get_space(bmap);
62
6
  set_space = empty ? isl_basic_set_get_space(dom) : NULL;
63
51
64
51
  n_in = isl_basic_map_dim(bmap, isl_dim_param) +
65
51
         isl_basic_map_dim(bmap, isl_dim_in);
66
51
  n_out = isl_basic_map_dim(bmap, isl_dim_all) - n_in;
67
51
68
51
  ctx = isl_basic_map_get_ctx(bmap);
69
51
  list = isl_alloc_array(ctx, int, bmap->n_ineq);
70
51
  var = isl_vec_alloc(ctx, n_out);
71
51
  if (
(bmap->n_ineq && 51
!list51
) ||
(n_out && 51
!var51
))
72
0
    goto error;
73
51
74
51
  list[0] = first;
75
51
  list[1] = second;
76
51
  isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out);
77
128
  for (i = second + 1, n = 2; 
i < bmap->n_ineq128
;
++i77
)
{77
78
77
    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
77
  }
82
51
83
51
  cst = isl_mat_alloc(ctx, n, 1 + n_in);
84
51
  if (!cst)
85
0
    goto error;
86
51
87
153
  
for (i = 0; 51
i < n153
;
++i102
)
88
102
    isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in);
89
51
90
51
  bmap = isl_basic_map_cow(bmap);
91
51
  if (!bmap)
92
0
    goto error;
93
153
  
for (i = n - 1; 51
i >= 0153
;
--i102
)
94
102
    
if (102
isl_basic_map_drop_inequality(bmap, list[i]) < 0102
)
95
0
      goto error;
96
51
97
51
  bmap = isl_basic_map_add_dims(bmap, isl_dim_in, 1);
98
51
  bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
99
51
  k = isl_basic_map_alloc_inequality(bmap);
100
51
  if (k < 0)
101
0
    goto error;
102
51
  isl_seq_clr(bmap->ineq[k], 1 + n_in);
103
51
  isl_int_set_si(bmap->ineq[k][1 + n_in], 1);
104
51
  isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out);
105
51
  bmap = isl_basic_map_finalize(bmap);
106
51
107
51
  n_div = isl_basic_set_dim(dom, isl_dim_div);
108
51
  dom = isl_basic_set_add_dims(dom, isl_dim_set, 1);
109
51
  dom = isl_basic_set_extend_constraints(dom, 0, n);
110
153
  for (i = 0; 
i < n153
;
++i102
)
{102
111
102
    k = isl_basic_set_alloc_inequality(dom);
112
102
    if (k < 0)
113
0
      goto error;
114
102
    isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in);
115
102
    isl_int_set_si(dom->ineq[k][1 + n_in], -1);
116
102
    isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div);
117
102
  }
118
51
119
51
  isl_vec_free(var);
120
51
  free(list);
121
51
122
51
  return SF(basic_map_partial_lexopt_symm_core,SUFFIX)(bmap, dom, empty,
123
51
            max, cst, map_space, set_space);
124
51
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
51
  return NULL;
133
51
}
isl_tab_pip.c:basic_map_partial_lexopt_symm_pw_multi_aff
Line
Count
Source
52
68
{
53
68
  int i, n, k;
54
68
  int *list = NULL;
55
68
  unsigned n_in, n_out, n_div;
56
68
  isl_ctx *ctx;
57
68
  isl_vec *var = NULL;
58
68
  isl_mat *cst = NULL;
59
68
  isl_space *map_space, *set_space;
60
68
61
68
  map_space = isl_basic_map_get_space(bmap);
62
0
  set_space = empty ? isl_basic_set_get_space(dom) : NULL;
63
68
64
68
  n_in = isl_basic_map_dim(bmap, isl_dim_param) +
65
68
         isl_basic_map_dim(bmap, isl_dim_in);
66
68
  n_out = isl_basic_map_dim(bmap, isl_dim_all) - n_in;
67
68
68
68
  ctx = isl_basic_map_get_ctx(bmap);
69
68
  list = isl_alloc_array(ctx, int, bmap->n_ineq);
70
68
  var = isl_vec_alloc(ctx, n_out);
71
68
  if (
(bmap->n_ineq && 68
!list68
) ||
(n_out && 68
!var68
))
72
0
    goto error;
73
68
74
68
  list[0] = first;
75
68
  list[1] = second;
76
68
  isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out);
77
100
  for (i = second + 1, n = 2; 
i < bmap->n_ineq100
;
++i32
)
{32
78
32
    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
68
  }
82
68
83
68
  cst = isl_mat_alloc(ctx, n, 1 + n_in);
84
68
  if (!cst)
85
0
    goto error;
86
68
87
204
  
for (i = 0; 68
i < n204
;
++i136
)
88
136
    isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in);
89
68
90
68
  bmap = isl_basic_map_cow(bmap);
91
68
  if (!bmap)
92
0
    goto error;
93
204
  
for (i = n - 1; 68
i >= 0204
;
--i136
)
94
136
    
if (136
isl_basic_map_drop_inequality(bmap, list[i]) < 0136
)
95
0
      goto error;
96
68
97
68
  bmap = isl_basic_map_add_dims(bmap, isl_dim_in, 1);
98
68
  bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
99
68
  k = isl_basic_map_alloc_inequality(bmap);
100
68
  if (k < 0)
101
0
    goto error;
102
68
  isl_seq_clr(bmap->ineq[k], 1 + n_in);
103
68
  isl_int_set_si(bmap->ineq[k][1 + n_in], 1);
104
68
  isl_seq_cpy(bmap->ineq[k] + 1 + n_in + 1, var->el, n_out);
105
68
  bmap = isl_basic_map_finalize(bmap);
106
68
107
68
  n_div = isl_basic_set_dim(dom, isl_dim_div);
108
68
  dom = isl_basic_set_add_dims(dom, isl_dim_set, 1);
109
68
  dom = isl_basic_set_extend_constraints(dom, 0, n);
110
204
  for (i = 0; 
i < n204
;
++i136
)
{136
111
136
    k = isl_basic_set_alloc_inequality(dom);
112
136
    if (k < 0)
113
0
      goto error;
114
136
    isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in);
115
136
    isl_int_set_si(dom->ineq[k][1 + n_in], -1);
116
136
    isl_seq_clr(dom->ineq[k] + 1 + n_in + 1, n_div);
117
136
  }
118
68
119
68
  isl_vec_free(var);
120
68
  free(list);
121
68
122
68
  return SF(basic_map_partial_lexopt_symm_core,SUFFIX)(bmap, dom, empty,
123
68
            max, cst, map_space, set_space);
124
68
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
68
  return NULL;
133
68
}
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
6.16k
{
148
6.16k
  isl_bool par = isl_bool_false;
149
6.16k
  int first, second;
150
6.16k
151
6.16k
  if (!bmap)
152
0
    goto error;
153
6.16k
154
6.16k
  
if (6.16k
bmap->ctx->opt->pip_symmetry6.16k
)
155
6.16k
    par = parallel_constraints(bmap, &first, &second);
156
6.16k
  if (par < 0)
157
0
    goto error;
158
6.16k
  
if (6.16k
!par6.16k
)
159
6.04k
    
return 6.04k
SF6.04k
(basic_map_partial_lexopt_base,SUFFIX)(bmap, dom,
160
6.16k
                empty, max);
161
6.16k
162
119
  
return 119
SF119
(basic_map_partial_lexopt_symm,SUFFIX)(bmap, dom, empty, max,
163
6.16k
               first, second);
164
6.16k
error:
165
0
  isl_basic_set_free(dom);
166
0
  isl_basic_map_free(bmap);
167
6.16k
  return NULL;
168
6.16k
}
isl_tab_pip.c:basic_map_partial_lexopt
Line
Count
Source
147
3.05k
{
148
3.05k
  isl_bool par = isl_bool_false;
149
3.05k
  int first, second;
150
3.05k
151
3.05k
  if (!bmap)
152
0
    goto error;
153
3.05k
154
3.05k
  
if (3.05k
bmap->ctx->opt->pip_symmetry3.05k
)
155
3.05k
    par = parallel_constraints(bmap, &first, &second);
156
3.05k
  if (par < 0)
157
0
    goto error;
158
3.05k
  
if (3.05k
!par3.05k
)
159
3.00k
    
return 3.00k
SF3.00k
(basic_map_partial_lexopt_base,SUFFIX)(bmap, dom,
160
3.05k
                empty, max);
161
3.05k
162
51
  
return 51
SF51
(basic_map_partial_lexopt_symm,SUFFIX)(bmap, dom, empty, max,
163
3.05k
               first, second);
164
3.05k
error:
165
0
  isl_basic_set_free(dom);
166
0
  isl_basic_map_free(bmap);
167
3.05k
  return NULL;
168
3.05k
}
isl_tab_pip.c:basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
147
3.11k
{
148
3.11k
  isl_bool par = isl_bool_false;
149
3.11k
  int first, second;
150
3.11k
151
3.11k
  if (!bmap)
152
0
    goto error;
153
3.11k
154
3.11k
  
if (3.11k
bmap->ctx->opt->pip_symmetry3.11k
)
155
3.11k
    par = parallel_constraints(bmap, &first, &second);
156
3.11k
  if (par < 0)
157
0
    goto error;
158
3.11k
  
if (3.11k
!par3.11k
)
159
3.04k
    
return 3.04k
SF3.04k
(basic_map_partial_lexopt_base,SUFFIX)(bmap, dom,
160
3.11k
                empty, max);
161
3.11k
162
68
  
return 68
SF68
(basic_map_partial_lexopt_symm,SUFFIX)(bmap, dom, empty, max,
163
3.11k
               first, second);
164
3.11k
error:
165
0
  isl_basic_set_free(dom);
166
0
  isl_basic_map_free(bmap);
167
3.11k
  return NULL;
168
3.11k
}
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
6.04k
{
198
6.04k
  int max, full;
199
6.04k
  isl_bool compatible;
200
6.04k
201
6.04k
  if (empty)
202
3.31k
    *empty = NULL;
203
6.04k
204
6.04k
  full = ISL_FL_ISSET(flags, ISL_OPT_FULL);
205
6.04k
  if (full)
206
2.72k
    dom = extract_domain(bmap, flags);
207
6.04k
  compatible = isl_basic_map_compatible_domain(bmap, dom);
208
6.04k
  if (compatible < 0)
209
0
    goto error;
210
6.04k
  
if (6.04k
!compatible6.04k
)
211
0
    isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
212
6.04k
      "domain does not match input", goto error);
213
6.04k
214
6.04k
  
max = 6.04k
ISL_FL_ISSET6.04k
(flags, ISL_OPT_MAX);
215
6.04k
  if (isl_basic_set_dim(dom, isl_dim_all) == 0)
216
765
    
return 765
SF765
(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
217
6.04k
                  max);
218
6.04k
219
5.28k
  
if (5.28k
!full5.28k
)
220
5.28k
    bmap = isl_basic_map_intersect_domain(bmap,
221
5.28k
                isl_basic_set_copy(dom));
222
5.28k
  bmap = isl_basic_map_detect_equalities(bmap);
223
5.28k
  bmap = isl_basic_map_remove_redundancies(bmap);
224
5.28k
225
5.28k
  return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, max);
226
6.04k
error:
227
0
  isl_basic_set_free(dom);
228
0
  isl_basic_map_free(bmap);
229
6.04k
  return NULL;
230
6.04k
}
isl_tab_basic_map_partial_lexopt
Line
Count
Source
197
3.00k
{
198
3.00k
  int max, full;
199
3.00k
  isl_bool compatible;
200
3.00k
201
3.00k
  if (empty)
202
2.26k
    *empty = NULL;
203
3.00k
204
3.00k
  full = ISL_FL_ISSET(flags, ISL_OPT_FULL);
205
3.00k
  if (full)
206
740
    dom = extract_domain(bmap, flags);
207
3.00k
  compatible = isl_basic_map_compatible_domain(bmap, dom);
208
3.00k
  if (compatible < 0)
209
0
    goto error;
210
3.00k
  
if (3.00k
!compatible3.00k
)
211
0
    isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
212
3.00k
      "domain does not match input", goto error);
213
3.00k
214
3.00k
  
max = 3.00k
ISL_FL_ISSET3.00k
(flags, ISL_OPT_MAX);
215
3.00k
  if (isl_basic_set_dim(dom, isl_dim_all) == 0)
216
82
    
return 82
SF82
(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
217
3.00k
                  max);
218
3.00k
219
2.92k
  
if (2.92k
!full2.92k
)
220
2.92k
    bmap = isl_basic_map_intersect_domain(bmap,
221
2.92k
                isl_basic_set_copy(dom));
222
2.92k
  bmap = isl_basic_map_detect_equalities(bmap);
223
2.92k
  bmap = isl_basic_map_remove_redundancies(bmap);
224
2.92k
225
2.92k
  return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, max);
226
3.00k
error:
227
0
  isl_basic_set_free(dom);
228
0
  isl_basic_map_free(bmap);
229
3.00k
  return NULL;
230
3.00k
}
isl_tab_basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
197
3.04k
{
198
3.04k
  int max, full;
199
3.04k
  isl_bool compatible;
200
3.04k
201
3.04k
  if (empty)
202
1.05k
    *empty = NULL;
203
3.04k
204
3.04k
  full = ISL_FL_ISSET(flags, ISL_OPT_FULL);
205
3.04k
  if (full)
206
1.98k
    dom = extract_domain(bmap, flags);
207
3.04k
  compatible = isl_basic_map_compatible_domain(bmap, dom);
208
3.04k
  if (compatible < 0)
209
0
    goto error;
210
3.04k
  
if (3.04k
!compatible3.04k
)
211
0
    isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
212
3.04k
      "domain does not match input", goto error);
213
3.04k
214
3.04k
  
max = 3.04k
ISL_FL_ISSET3.04k
(flags, ISL_OPT_MAX);
215
3.04k
  if (isl_basic_set_dim(dom, isl_dim_all) == 0)
216
683
    
return 683
SF683
(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
217
3.04k
                  max);
218
3.04k
219
2.36k
  
if (2.36k
!full2.36k
)
220
2.36k
    bmap = isl_basic_map_intersect_domain(bmap,
221
2.36k
                isl_basic_set_copy(dom));
222
2.36k
  bmap = isl_basic_map_detect_equalities(bmap);
223
2.36k
  bmap = isl_basic_map_remove_redundancies(bmap);
224
2.36k
225
2.36k
  return SF(basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, max);
226
3.04k
error:
227
0
  isl_basic_set_free(dom);
228
0
  isl_basic_map_free(bmap);
229
3.04k
  return NULL;
230
3.04k
}