Coverage Report

Created: 2018-08-14 02:14

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/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
32.7k
#define xSF(TYPE,SUFFIX) TYPE ## SUFFIX
18
32.7k
#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
7.60k
{
35
7.60k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
7.60k
                  flags);
37
7.60k
}
isl_map.c:isl_basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
34
4.00k
{
35
4.00k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
4.00k
                  flags);
37
4.00k
}
isl_map.c:isl_basic_map_partial_lexopt
Line
Count
Source
34
3.60k
{
35
3.60k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
3.60k
                  flags);
37
3.60k
}
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
8.87k
{
90
8.87k
  int i;
91
8.87k
  TYPE *res;
92
8.87k
  isl_set *all_empty;
93
8.87k
94
8.87k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
8.87k
    
return 3.38k
SF3.38k
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
3.38k
                empty, flags);
97
5.48k
98
5.48k
  dom = isl_set_make_disjoint(dom);
99
5.48k
  if (!dom)
100
0
    goto error;
101
5.48k
102
5.48k
  if (isl_set_plain_is_empty(dom)) {
103
2.70k
    isl_space *space = isl_basic_map_get_space(bmap);
104
2.70k
    if (empty)
105
2.70k
      *empty = dom;
106
0
    else
107
0
      isl_set_free(dom);
108
2.70k
    isl_basic_map_free(bmap);
109
2.70k
    return EMPTY(space);
110
2.70k
  }
111
2.77k
112
2.77k
  res = SF(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
2.77k
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
2.77k
115
2.77k
  if (empty)
116
2.77k
    all_empty = *empty;
117
3.21k
  for (i = 1; i < dom->n; 
++i436
) {
118
436
    TYPE *res_i;
119
436
120
436
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
436
        isl_basic_map_copy(bmap),
122
436
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
436
124
436
    res = ADD(res, res_i);
125
436
    if (empty)
126
436
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
436
  }
128
2.77k
129
2.77k
  if (empty)
130
2.77k
    *empty = all_empty;
131
2.77k
  isl_set_free(dom);
132
2.77k
  isl_basic_map_free(bmap);
133
2.77k
  return res;
134
2.77k
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
2.77k
}
isl_map.c:basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
89
3.05k
{
90
3.05k
  int i;
91
3.05k
  TYPE *res;
92
3.05k
  isl_set *all_empty;
93
3.05k
94
3.05k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
3.05k
    
return 2.70k
SF2.70k
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
2.70k
                empty, flags);
97
344
98
344
  dom = isl_set_make_disjoint(dom);
99
344
  if (!dom)
100
0
    goto error;
101
344
102
344
  if (isl_set_plain_is_empty(dom)) {
103
166
    isl_space *space = isl_basic_map_get_space(bmap);
104
166
    if (empty)
105
166
      *empty = dom;
106
0
    else
107
0
      isl_set_free(dom);
108
166
    isl_basic_map_free(bmap);
109
166
    return EMPTY(space);
110
166
  }
111
178
112
178
  res = SF(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
178
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
178
115
178
  if (empty)
116
178
    all_empty = *empty;
117
471
  for (i = 1; i < dom->n; 
++i293
) {
118
293
    TYPE *res_i;
119
293
120
293
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
293
        isl_basic_map_copy(bmap),
122
293
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
293
124
293
    res = ADD(res, res_i);
125
293
    if (empty)
126
293
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
293
  }
128
178
129
178
  if (empty)
130
178
    *empty = all_empty;
131
178
  isl_set_free(dom);
132
178
  isl_basic_map_free(bmap);
133
178
  return res;
134
178
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
178
}
isl_map.c:basic_map_partial_lexopt
Line
Count
Source
89
5.82k
{
90
5.82k
  int i;
91
5.82k
  TYPE *res;
92
5.82k
  isl_set *all_empty;
93
5.82k
94
5.82k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
5.82k
    
return 678
SF678
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
678
                empty, flags);
97
5.14k
98
5.14k
  dom = isl_set_make_disjoint(dom);
99
5.14k
  if (!dom)
100
0
    goto error;
101
5.14k
102
5.14k
  if (isl_set_plain_is_empty(dom)) {
103
2.54k
    isl_space *space = isl_basic_map_get_space(bmap);
104
2.54k
    if (empty)
105
2.54k
      *empty = dom;
106
0
    else
107
0
      isl_set_free(dom);
108
2.54k
    isl_basic_map_free(bmap);
109
2.54k
    return EMPTY(space);
110
2.54k
  }
111
2.59k
112
2.59k
  res = SF(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
2.59k
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
2.59k
115
2.59k
  if (empty)
116
2.59k
    all_empty = *empty;
117
2.74k
  for (i = 1; i < dom->n; 
++i143
) {
118
143
    TYPE *res_i;
119
143
120
143
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
143
        isl_basic_map_copy(bmap),
122
143
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
143
124
143
    res = ADD(res, res_i);
125
143
    if (empty)
126
143
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
143
  }
128
2.59k
129
2.59k
  if (empty)
130
2.59k
    *empty = all_empty;
131
2.59k
  isl_set_free(dom);
132
2.59k
  isl_basic_map_free(bmap);
133
2.59k
  return res;
134
2.59k
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
2.59k
}
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
1.00k
{
148
1.00k
  ISL_FL_SET(flags, ISL_OPT_FULL);
149
1.00k
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL, NULL, flags);
150
1.00k
}
isl_basic_map_lexopt_pw_multi_aff
Line
Count
Source
147
826
{
148
826
  ISL_FL_SET(flags, ISL_OPT_FULL);
149
826
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL, NULL, flags);
150
826
}
isl_basic_map_lexopt
Line
Count
Source
147
181
{
148
181
  ISL_FL_SET(flags, ISL_OPT_FULL);
149
181
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL, NULL, flags);
150
181
}
151
152
__isl_give TYPE *SF(isl_basic_map_lexmin,SUFFIX)(__isl_take isl_basic_map *bmap)
153
65
{
154
65
  return SF(isl_basic_map_lexopt,SUFFIX)(bmap, 0);
155
65
}
isl_basic_map_lexmin_pw_multi_aff
Line
Count
Source
153
65
{
154
65
  return SF(isl_basic_map_lexopt,SUFFIX)(bmap, 0);
155
65
}
Unexecuted instantiation: isl_basic_map_lexmin
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
12.0k
{
176
12.0k
  isl_bool aligned;
177
12.0k
178
12.0k
  aligned = isl_map_set_has_equal_params(map, dom);
179
12.0k
  if (aligned < 0)
180
0
    goto error;
181
12.0k
  if (aligned)
182
12.0k
    return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom,
183
12.0k
                empty, flags);
184
0
  if (!isl_space_has_named_params(map->dim) ||
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
12.0k
{
176
12.0k
  isl_bool aligned;
177
12.0k
178
12.0k
  aligned = isl_map_set_has_equal_params(map, dom);
179
12.0k
  if (aligned < 0)
180
0
    goto error;
181
12.0k
  if (aligned)
182
12.0k
    return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom,
183
12.0k
                empty, flags);
184
0
  if (!isl_space_has_named_params(map->dim) ||
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
2.13k
{
206
2.13k
  ISL_FL_SET(flags, ISL_OPT_FULL);
207
2.13k
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, NULL, NULL,
208
2.13k
              flags);
209
2.13k
}
isl_map_lexopt_pw_multi_aff
Line
Count
Source
205
1.09k
{
206
1.09k
  ISL_FL_SET(flags, ISL_OPT_FULL);
207
1.09k
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, NULL, NULL,
208
1.09k
              flags);
209
1.09k
}
isl_map_lexopt
Line
Count
Source
205
1.03k
{
206
1.03k
  ISL_FL_SET(flags, ISL_OPT_FULL);
207
1.03k
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, NULL, NULL,
208
1.03k
              flags);
209
1.03k
}
210
211
__isl_give TYPE *SF(isl_map_lexmin,SUFFIX)(__isl_take isl_map *map)
212
1.33k
{
213
1.33k
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
1.33k
}
isl_map_lexmin_pw_multi_aff
Line
Count
Source
212
548
{
213
548
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
548
}
isl_map_lexmin
Line
Count
Source
212
786
{
213
786
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
786
}
215
216
__isl_give TYPE *SF(isl_map_lexmax,SUFFIX)(__isl_take isl_map *map)
217
797
{
218
797
  return SF(isl_map_lexopt,SUFFIX)(map, ISL_OPT_MAX);
219
797
}
isl_map_lexmax_pw_multi_aff
Line
Count
Source
217
547
{
218
547
  return SF(isl_map_lexopt,SUFFIX)(map, ISL_OPT_MAX);
219
547
}
isl_map_lexmax
Line
Count
Source
217
250
{
218
250
  return SF(isl_map_lexopt,SUFFIX)(map, ISL_OPT_MAX);
219
250
}
220
221
__isl_give TYPE *SF(isl_set_lexmin,SUFFIX)(__isl_take isl_set *set)
222
683
{
223
683
  return SF(isl_map_lexmin,SUFFIX)(set);
224
683
}
isl_set_lexmin_pw_multi_aff
Line
Count
Source
222
548
{
223
548
  return SF(isl_map_lexmin,SUFFIX)(set);
224
548
}
isl_set_lexmin
Line
Count
Source
222
135
{
223
135
  return SF(isl_map_lexmin,SUFFIX)(set);
224
135
}
225
226
__isl_give TYPE *SF(isl_set_lexmax,SUFFIX)(__isl_take isl_set *set)
227
548
{
228
548
  return SF(isl_map_lexmax,SUFFIX)(set);
229
548
}
isl_set_lexmax_pw_multi_aff
Line
Count
Source
227
547
{
228
547
  return SF(isl_map_lexmax,SUFFIX)(set);
229
547
}
isl_set_lexmax
Line
Count
Source
227
1
{
228
1
  return SF(isl_map_lexmax,SUFFIX)(set);
229
1
}