Coverage Report

Created: 2017-04-28 04:32

/Users/buildslave/jenkins/sharedspace/clang-stage2-coverage-R@2/llvm/tools/polly/lib/External/isl/isl_map_lexopt_templ.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2010      INRIA Saclay
3
 * Copyright 2012      Ecole Normale Superieure
4
 *
5
 * Use of this software is governed by the MIT license
6
 *
7
 * Written by Sven Verdoolaege,
8
 * INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
9
 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
10
 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
11
 */
12
13
/* Function for computing the lexicographic optimum of a map
14
 * in the form of either an isl_map or an isl_pw_multi_aff.
15
 */
16
17
21.6k
#define xSF(TYPE,SUFFIX) TYPE ## SUFFIX
18
21.6k
#define SF(TYPE,SUFFIX) xSF(TYPE,SUFFIX)
19
20
/* Compute the lexicographic minimum (or maximum if "flags" includes
21
 * ISL_OPT_MAX) of "bmap" over the domain "dom" and return the result.
22
 * If "empty" is not NULL, then *empty is assigned a set that
23
 * contains those parts of the domain where there is no solution.
24
 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
25
 * should be computed over the domain of "bmap".  "empty" is also NULL
26
 * in this case.
27
 * If "bmap" is marked as rational (ISL_BASIC_MAP_RATIONAL),
28
 * then the rational optimum is computed.  Otherwise, the integral optimum
29
 * is computed.
30
 */
31
static __isl_give TYPE *SF(isl_basic_map_partial_lexopt,SUFFIX)(
32
  __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
33
  __isl_give isl_set **empty, unsigned flags)
34
4.58k
{
35
4.58k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
4.58k
                  flags);
37
4.58k
}
isl_map.c:isl_basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
34
2.37k
{
35
2.37k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
2.37k
                  flags);
37
2.37k
}
isl_map.c:isl_basic_map_partial_lexopt
Line
Count
Source
34
2.20k
{
35
2.20k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
2.20k
                  flags);
37
2.20k
}
38
39
__isl_give TYPE *SF(isl_basic_map_partial_lexmax,SUFFIX)(
40
  __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
41
  __isl_give isl_set **empty)
42
0
{
43
0
  unsigned flags = ISL_OPT_MAX;
44
0
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, flags);
45
0
}
Unexecuted instantiation: isl_basic_map_partial_lexmax_pw_multi_aff
Unexecuted instantiation: isl_basic_map_partial_lexmax
46
47
__isl_give TYPE *SF(isl_basic_map_partial_lexmin,SUFFIX)(
48
  __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
49
  __isl_give isl_set **empty)
50
1
{
51
1
  unsigned flags = 0;
52
1
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, flags);
53
1
}
Unexecuted instantiation: isl_basic_map_partial_lexmin_pw_multi_aff
isl_basic_map_partial_lexmin
Line
Count
Source
50
1
{
51
1
  unsigned flags = 0;
52
1
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty, flags);
53
1
}
54
55
__isl_give TYPE *SF(isl_basic_set_partial_lexmin,SUFFIX)(
56
  __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
57
  __isl_give isl_set **empty)
58
0
{
59
0
  return SF(isl_basic_map_partial_lexmin,SUFFIX)(bset, dom, empty);
60
0
}
Unexecuted instantiation: isl_basic_set_partial_lexmin_pw_multi_aff
Unexecuted instantiation: isl_basic_set_partial_lexmin
61
62
__isl_give TYPE *SF(isl_basic_set_partial_lexmax,SUFFIX)(
63
  __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
64
  __isl_give isl_set **empty)
65
0
{
66
0
  return SF(isl_basic_map_partial_lexmax,SUFFIX)(bset, dom, empty);
67
0
}
Unexecuted instantiation: isl_basic_set_partial_lexmax_pw_multi_aff
Unexecuted instantiation: isl_basic_set_partial_lexmax
68
69
/* Given a basic map "bmap", compute the lexicographically minimal
70
 * (or maximal) image element for each domain element in dom.
71
 * If empty is not NULL, then set *empty to those elements in dom
72
 * that do not have an image element.
73
 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
74
 * should be computed over the domain of "bmap".  "empty" is also NULL
75
 * in this case.
76
 *
77
 * We first make sure the basic sets in dom are disjoint and then
78
 * simply collect the results over each of the basic sets separately.
79
 * We could probably improve the efficiency a bit by moving the union
80
 * domain down into the parametric integer programming.
81
 *
82
 * If a full optimum is being computed (i.e., "flags" includes ISL_OPT_FULL),
83
 * then no domain is given and there is then also no need to consider
84
 * the disjuncts of the domain.
85
 */
86
static __isl_give TYPE *SF(basic_map_partial_lexopt,SUFFIX)(
87
  __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
88
  __isl_give isl_set **empty, unsigned flags)
89
5.61k
{
90
5.61k
  int i;
91
5.61k
  TYPE *res;
92
5.61k
  isl_set *all_empty;
93
5.61k
94
5.61k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
1.58k
    
return 1.58k
SF1.58k
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
1.58k
                empty, flags);
97
5.61k
98
4.03k
  dom = isl_set_make_disjoint(dom);
99
4.03k
  if (!dom)
100
0
    goto error;
101
4.03k
102
4.03k
  
if (4.03k
isl_set_plain_is_empty(dom)4.03k
)
{1.99k
103
1.99k
    isl_space *space = isl_basic_map_get_space(bmap);
104
1.99k
    if (empty)
105
1.99k
      *empty = dom;
106
1.99k
    else
107
0
      isl_set_free(dom);
108
1.99k
    isl_basic_map_free(bmap);
109
1.99k
    return EMPTY(space);
110
1.99k
  }
111
4.03k
112
2.04k
  
res = 2.04k
SF2.04k
(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
2.04k
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
2.04k
115
2.04k
  if (empty)
116
2.04k
    all_empty = *empty;
117
2.93k
  for (i = 1; 
i < dom->n2.93k
;
++i894
)
{894
118
894
    TYPE *res_i;
119
894
120
894
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
894
        isl_basic_map_copy(bmap),
122
894
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
894
124
894
    res = ADD(res, res_i);
125
894
    if (empty)
126
894
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
894
  }
128
2.04k
129
2.04k
  if (empty)
130
2.04k
    *empty = all_empty;
131
2.04k
  isl_set_free(dom);
132
2.04k
  isl_basic_map_free(bmap);
133
2.04k
  return res;
134
0
error:
135
0
  if (empty)
136
0
    *empty = NULL;
137
0
  isl_set_free(dom);
138
0
  isl_basic_map_free(bmap);
139
0
  return NULL;
140
4.03k
}
isl_map.c:basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
89
1.84k
{
90
1.84k
  int i;
91
1.84k
  TYPE *res;
92
1.84k
  isl_set *all_empty;
93
1.84k
94
1.84k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
1.28k
    
return 1.28k
SF1.28k
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
1.28k
                empty, flags);
97
1.84k
98
556
  dom = isl_set_make_disjoint(dom);
99
556
  if (!dom)
100
0
    goto error;
101
556
102
556
  
if (556
isl_set_plain_is_empty(dom)556
)
{278
103
278
    isl_space *space = isl_basic_map_get_space(bmap);
104
278
    if (empty)
105
278
      *empty = dom;
106
278
    else
107
0
      isl_set_free(dom);
108
278
    isl_basic_map_free(bmap);
109
278
    return EMPTY(space);
110
278
  }
111
556
112
278
  
res = 278
SF278
(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
278
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
278
115
278
  if (empty)
116
278
    all_empty = *empty;
117
1.06k
  for (i = 1; 
i < dom->n1.06k
;
++i790
)
{790
118
790
    TYPE *res_i;
119
790
120
790
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
790
        isl_basic_map_copy(bmap),
122
790
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
790
124
790
    res = ADD(res, res_i);
125
790
    if (empty)
126
790
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
790
  }
128
278
129
278
  if (empty)
130
278
    *empty = all_empty;
131
278
  isl_set_free(dom);
132
278
  isl_basic_map_free(bmap);
133
278
  return res;
134
0
error:
135
0
  if (empty)
136
0
    *empty = NULL;
137
0
  isl_set_free(dom);
138
0
  isl_basic_map_free(bmap);
139
0
  return NULL;
140
556
}
isl_map.c:basic_map_partial_lexopt
Line
Count
Source
89
3.77k
{
90
3.77k
  int i;
91
3.77k
  TYPE *res;
92
3.77k
  isl_set *all_empty;
93
3.77k
94
3.77k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
294
    
return 294
SF294
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
294
                empty, flags);
97
3.77k
98
3.48k
  dom = isl_set_make_disjoint(dom);
99
3.48k
  if (!dom)
100
0
    goto error;
101
3.48k
102
3.48k
  
if (3.48k
isl_set_plain_is_empty(dom)3.48k
)
{1.71k
103
1.71k
    isl_space *space = isl_basic_map_get_space(bmap);
104
1.71k
    if (empty)
105
1.71k
      *empty = dom;
106
1.71k
    else
107
0
      isl_set_free(dom);
108
1.71k
    isl_basic_map_free(bmap);
109
1.71k
    return EMPTY(space);
110
1.71k
  }
111
3.48k
112
1.76k
  
res = 1.76k
SF1.76k
(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
1.76k
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
1.76k
115
1.76k
  if (empty)
116
1.76k
    all_empty = *empty;
117
1.86k
  for (i = 1; 
i < dom->n1.86k
;
++i104
)
{104
118
104
    TYPE *res_i;
119
104
120
104
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
104
        isl_basic_map_copy(bmap),
122
104
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
104
124
104
    res = ADD(res, res_i);
125
104
    if (empty)
126
104
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
104
  }
128
1.76k
129
1.76k
  if (empty)
130
1.76k
    *empty = all_empty;
131
1.76k
  isl_set_free(dom);
132
1.76k
  isl_basic_map_free(bmap);
133
1.76k
  return res;
134
0
error:
135
0
  if (empty)
136
0
    *empty = NULL;
137
0
  isl_set_free(dom);
138
0
  isl_basic_map_free(bmap);
139
0
  return NULL;
140
3.48k
}
141
142
/* Compute the lexicographic minimum (or maximum if "flags" includes
143
 * ISL_OPT_MAX) of "bmap" over its domain.
144
 */
145
__isl_give TYPE *SF(isl_basic_map_lexopt,SUFFIX)(
146
  __isl_take isl_basic_map *bmap, unsigned flags)
147
63
{
148
63
  ISL_FL_SET(flags, ISL_OPT_FULL);
149
63
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL, NULL, flags);
150
63
}
isl_basic_map_lexopt
Line
Count
Source
147
45
{
148
45
  ISL_FL_SET(flags, ISL_OPT_FULL);
149
45
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL, NULL, flags);
150
45
}
isl_basic_map_lexopt_pw_multi_aff
Line
Count
Source
147
18
{
148
18
  ISL_FL_SET(flags, ISL_OPT_FULL);
149
18
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL, NULL, flags);
150
18
}
151
152
__isl_give TYPE *SF(isl_basic_map_lexmin,SUFFIX)(__isl_take isl_basic_map *bmap)
153
18
{
154
18
  return SF(isl_basic_map_lexopt,SUFFIX)(bmap, 0);
155
18
}
Unexecuted instantiation: isl_basic_map_lexmin
isl_basic_map_lexmin_pw_multi_aff
Line
Count
Source
153
18
{
154
18
  return SF(isl_basic_map_lexopt,SUFFIX)(bmap, 0);
155
18
}
156
157
static __isl_give TYPE *SF(isl_map_partial_lexopt_aligned,SUFFIX)(
158
  __isl_take isl_map *map, __isl_take isl_set *dom,
159
  __isl_give isl_set **empty, unsigned flags);
160
/* This function is currently only used when TYPE is defined as isl_map. */
161
static __isl_give TYPE *SF(isl_map_partial_lexopt,SUFFIX)(
162
  __isl_take isl_map *map, __isl_take isl_set *dom,
163
  __isl_give isl_set **empty, unsigned flags)
164
  __attribute__ ((unused));
165
166
/* Given a map "map", compute the lexicographically minimal
167
 * (or maximal) image element for each domain element in dom.
168
 * Set *empty to those elements in dom that do not have an image element.
169
 *
170
 * Align parameters if needed and then call isl_map_partial_lexopt_aligned.
171
 */
172
static __isl_give TYPE *SF(isl_map_partial_lexopt,SUFFIX)(
173
  __isl_take isl_map *map, __isl_take isl_set *dom,
174
  __isl_give isl_set **empty, unsigned flags)
175
9.24k
{
176
9.24k
  isl_bool aligned;
177
9.24k
178
9.24k
  aligned = isl_map_set_has_equal_params(map, dom);
179
9.24k
  if (aligned < 0)
180
0
    goto error;
181
9.24k
  
if (9.24k
aligned9.24k
)
182
9.24k
    
return 9.24k
SF9.24k
(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom,
183
9.24k
                empty, flags);
184
0
  
if (0
!isl_space_has_named_params(map->dim) ||0
185
0
      !isl_space_has_named_params(dom->dim))
186
0
    isl_die(map->ctx, isl_error_invalid,
187
0
      "unaligned unnamed parameters", goto error);
188
0
  map = isl_map_align_params(map, isl_map_get_space(dom));
189
0
  dom = isl_map_align_params(dom, isl_map_get_space(map));
190
0
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom, empty,
191
0
              flags);
192
0
error:
193
0
  if (empty)
194
0
    *empty = NULL;
195
0
  isl_set_free(dom);
196
0
  isl_map_free(map);
197
0
  return NULL;
198
0
}
isl_map.c:isl_map_partial_lexopt
Line
Count
Source
175
9.24k
{
176
9.24k
  isl_bool aligned;
177
9.24k
178
9.24k
  aligned = isl_map_set_has_equal_params(map, dom);
179
9.24k
  if (aligned < 0)
180
0
    goto error;
181
9.24k
  
if (9.24k
aligned9.24k
)
182
9.24k
    
return 9.24k
SF9.24k
(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom,
183
9.24k
                empty, flags);
184
0
  
if (0
!isl_space_has_named_params(map->dim) ||0
185
0
      !isl_space_has_named_params(dom->dim))
186
0
    isl_die(map->ctx, isl_error_invalid,
187
0
      "unaligned unnamed parameters", goto error);
188
0
  map = isl_map_align_params(map, isl_map_get_space(dom));
189
0
  dom = isl_map_align_params(dom, isl_map_get_space(map));
190
0
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom, empty,
191
0
              flags);
192
0
error:
193
0
  if (empty)
194
0
    *empty = NULL;
195
0
  isl_set_free(dom);
196
0
  isl_map_free(map);
197
0
  return NULL;
198
0
}
Unexecuted instantiation: isl_map.c:isl_map_partial_lexopt_pw_multi_aff
199
200
/* Compute the lexicographic minimum (or maximum if "flags" includes
201
 * ISL_OPT_MAX) of "map" over its domain.
202
 */
203
__isl_give TYPE *SF(isl_map_lexopt,SUFFIX)(__isl_take isl_map *map,
204
  unsigned flags)
205
1.18k
{
206
1.18k
  ISL_FL_SET(flags, ISL_OPT_FULL);
207
1.18k
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, NULL, NULL,
208
1.18k
              flags);
209
1.18k
}
isl_map_lexopt
Line
Count
Source
205
391
{
206
391
  ISL_FL_SET(flags, ISL_OPT_FULL);
207
391
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, NULL, NULL,
208
391
              flags);
209
391
}
isl_map_lexopt_pw_multi_aff
Line
Count
Source
205
797
{
206
797
  ISL_FL_SET(flags, ISL_OPT_FULL);
207
797
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, NULL, NULL,
208
797
              flags);
209
797
}
210
211
__isl_give TYPE *SF(isl_map_lexmin,SUFFIX)(__isl_take isl_map *map)
212
744
{
213
744
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
744
}
isl_map_lexmin_pw_multi_aff
Line
Count
Source
212
399
{
213
399
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
399
}
isl_map_lexmin
Line
Count
Source
212
345
{
213
345
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
345
}
215
216
__isl_give TYPE *SF(isl_map_lexmax,SUFFIX)(__isl_take isl_map *map)
217
444
{
218
444
  return 
SF444
(isl_map_lexopt,SUFFIX)(map,
ISL_OPT_MAX444
);
219
444
}
isl_map_lexmax_pw_multi_aff
Line
Count
Source
217
398
{
218
398
  return 
SF398
(isl_map_lexopt,SUFFIX)(map,
ISL_OPT_MAX398
);
219
398
}
isl_map_lexmax
Line
Count
Source
217
46
{
218
46
  return 
SF46
(isl_map_lexopt,SUFFIX)(map,
ISL_OPT_MAX46
);
219
46
}
220
221
__isl_give TYPE *SF(isl_set_lexmin,SUFFIX)(__isl_take isl_set *set)
222
461
{
223
461
  return SF(isl_map_lexmin,SUFFIX)(set);
224
461
}
isl_set_lexmin
Line
Count
Source
222
62
{
223
62
  return SF(isl_map_lexmin,SUFFIX)(set);
224
62
}
isl_set_lexmin_pw_multi_aff
Line
Count
Source
222
399
{
223
399
  return SF(isl_map_lexmin,SUFFIX)(set);
224
399
}
225
226
__isl_give TYPE *SF(isl_set_lexmax,SUFFIX)(__isl_take isl_set *set)
227
399
{
228
399
  return SF(isl_map_lexmax,SUFFIX)(set);
229
399
}
isl_set_lexmax
Line
Count
Source
227
1
{
228
1
  return SF(isl_map_lexmax,SUFFIX)(set);
229
1
}
isl_set_lexmax_pw_multi_aff
Line
Count
Source
227
398
{
228
398
  return SF(isl_map_lexmax,SUFFIX)(set);
229
398
}