Coverage Report

Created: 2018-02-20 12:54

/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
33.1k
#define xSF(TYPE,SUFFIX) TYPE ## SUFFIX
18
33.1k
#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.83k
{
35
7.83k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
7.83k
                  flags);
37
7.83k
}
isl_map.c:isl_basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
34
4.26k
{
35
4.26k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
4.26k
                  flags);
37
4.26k
}
isl_map.c:isl_basic_map_partial_lexopt
Line
Count
Source
34
3.56k
{
35
3.56k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
3.56k
                  flags);
37
3.56k
}
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.96k
{
90
8.96k
  int i;
91
8.96k
  TYPE *res;
92
8.96k
  isl_set *all_empty;
93
8.96k
94
8.96k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
8.96k
    
return 3.24k
SF3.24k
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
3.24k
                empty, flags);
97
5.71k
98
5.71k
  dom = isl_set_make_disjoint(dom);
99
5.71k
  if (!dom)
100
0
    goto error;
101
5.71k
102
5.71k
  if (isl_set_plain_is_empty(dom)) {
103
2.82k
    isl_space *space = isl_basic_map_get_space(bmap);
104
2.82k
    if (empty)
105
2.82k
      *empty = dom;
106
0
    else
107
0
      isl_set_free(dom);
108
2.82k
    isl_basic_map_free(bmap);
109
2.82k
    return EMPTY(space);
110
2.82k
  }
111
2.89k
112
2.89k
  res = SF(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
2.89k
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
2.89k
115
2.89k
  if (empty)
116
2.89k
    all_empty = *empty;
117
3.57k
  for (i = 1; i < dom->n; 
++i687
) {
118
687
    TYPE *res_i;
119
687
120
687
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
687
        isl_basic_map_copy(bmap),
122
687
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
687
124
687
    res = ADD(res, res_i);
125
687
    if (empty)
126
687
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
687
  }
128
2.89k
129
2.89k
  if (empty)
130
2.89k
    *empty = all_empty;
131
2.89k
  isl_set_free(dom);
132
2.89k
  isl_basic_map_free(bmap);
133
2.89k
  return res;
134
2.89k
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.89k
}
isl_map.c:basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
89
3.19k
{
90
3.19k
  int i;
91
3.19k
  TYPE *res;
92
3.19k
  isl_set *all_empty;
93
3.19k
94
3.19k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
3.19k
    
return 2.57k
SF2.57k
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
2.57k
                empty, flags);
97
622
98
622
  dom = isl_set_make_disjoint(dom);
99
622
  if (!dom)
100
0
    goto error;
101
622
102
622
  if (isl_set_plain_is_empty(dom)) {
103
305
    isl_space *space = isl_basic_map_get_space(bmap);
104
305
    if (empty)
105
305
      *empty = dom;
106
0
    else
107
0
      isl_set_free(dom);
108
305
    isl_basic_map_free(bmap);
109
305
    return EMPTY(space);
110
305
  }
111
317
112
317
  res = SF(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
317
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
317
115
317
  if (empty)
116
317
    all_empty = *empty;
117
864
  for (i = 1; i < dom->n; 
++i547
) {
118
547
    TYPE *res_i;
119
547
120
547
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
547
        isl_basic_map_copy(bmap),
122
547
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
547
124
547
    res = ADD(res, res_i);
125
547
    if (empty)
126
547
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
547
  }
128
317
129
317
  if (empty)
130
317
    *empty = all_empty;
131
317
  isl_set_free(dom);
132
317
  isl_basic_map_free(bmap);
133
317
  return res;
134
317
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
317
}
isl_map.c:basic_map_partial_lexopt
Line
Count
Source
89
5.76k
{
90
5.76k
  int i;
91
5.76k
  TYPE *res;
92
5.76k
  isl_set *all_empty;
93
5.76k
94
5.76k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
5.76k
    
return 673
SF673
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
673
                empty, flags);
97
5.09k
98
5.09k
  dom = isl_set_make_disjoint(dom);
99
5.09k
  if (!dom)
100
0
    goto error;
101
5.09k
102
5.09k
  if (isl_set_plain_is_empty(dom)) {
103
2.52k
    isl_space *space = isl_basic_map_get_space(bmap);
104
2.52k
    if (empty)
105
2.52k
      *empty = dom;
106
0
    else
107
0
      isl_set_free(dom);
108
2.52k
    isl_basic_map_free(bmap);
109
2.52k
    return EMPTY(space);
110
2.52k
  }
111
2.57k
112
2.57k
  res = SF(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
2.57k
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
2.57k
115
2.57k
  if (empty)
116
2.57k
    all_empty = *empty;
117
2.71k
  for (i = 1; i < dom->n; 
++i140
) {
118
140
    TYPE *res_i;
119
140
120
140
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
140
        isl_basic_map_copy(bmap),
122
140
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
140
124
140
    res = ADD(res, res_i);
125
140
    if (empty)
126
140
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
140
  }
128
2.57k
129
2.57k
  if (empty)
130
2.57k
    *empty = all_empty;
131
2.57k
  isl_set_free(dom);
132
2.57k
  isl_basic_map_free(bmap);
133
2.57k
  return res;
134
2.57k
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.57k
}
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
822
{
148
822
  ISL_FL_SET(flags, ISL_OPT_FULL);
149
822
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL, NULL, flags);
150
822
}
isl_basic_map_lexopt
Line
Count
Source
147
180
{
148
180
  ISL_FL_SET(flags, ISL_OPT_FULL);
149
180
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL, NULL, flags);
150
180
}
151
152
__isl_give TYPE *SF(isl_basic_map_lexmin,SUFFIX)(__isl_take isl_basic_map *bmap)
153
62
{
154
62
  return SF(isl_basic_map_lexopt,SUFFIX)(bmap, 0);
155
62
}
isl_basic_map_lexmin_pw_multi_aff
Line
Count
Source
153
62
{
154
62
  return SF(isl_basic_map_lexopt,SUFFIX)(bmap, 0);
155
62
}
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
11.9k
{
176
11.9k
  isl_bool aligned;
177
11.9k
178
11.9k
  aligned = isl_map_set_has_equal_params(map, dom);
179
11.9k
  if (aligned < 0)
180
0
    goto error;
181
11.9k
  if (aligned)
182
11.9k
    return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom,
183
11.9k
                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
11.9k
{
176
11.9k
  isl_bool aligned;
177
11.9k
178
11.9k
  aligned = isl_map_set_has_equal_params(map, dom);
179
11.9k
  if (aligned < 0)
180
0
    goto error;
181
11.9k
  if (aligned)
182
11.9k
    return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom,
183
11.9k
                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.11k
{
206
2.11k
  ISL_FL_SET(flags, ISL_OPT_FULL);
207
2.11k
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, NULL, NULL,
208
2.11k
              flags);
209
2.11k
}
isl_map_lexopt_pw_multi_aff
Line
Count
Source
205
1.06k
{
206
1.06k
  ISL_FL_SET(flags, ISL_OPT_FULL);
207
1.06k
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, NULL, NULL,
208
1.06k
              flags);
209
1.06k
}
isl_map_lexopt
Line
Count
Source
205
1.05k
{
206
1.05k
  ISL_FL_SET(flags, ISL_OPT_FULL);
207
1.05k
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, NULL, NULL,
208
1.05k
              flags);
209
1.05k
}
210
211
__isl_give TYPE *SF(isl_map_lexmin,SUFFIX)(__isl_take isl_map *map)
212
1.31k
{
213
1.31k
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
1.31k
}
isl_map_lexmin_pw_multi_aff
Line
Count
Source
212
533
{
213
533
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
533
}
isl_map_lexmin
Line
Count
Source
212
777
{
213
777
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
777
}
215
216
__isl_give TYPE *SF(isl_map_lexmax,SUFFIX)(__isl_take isl_map *map)
217
809
{
218
809
  return SF(isl_map_lexopt,SUFFIX)(map, ISL_OPT_MAX);
219
809
}
isl_map_lexmax_pw_multi_aff
Line
Count
Source
217
532
{
218
532
  return SF(isl_map_lexopt,SUFFIX)(map, ISL_OPT_MAX);
219
532
}
isl_map_lexmax
Line
Count
Source
217
277
{
218
277
  return SF(isl_map_lexopt,SUFFIX)(map, ISL_OPT_MAX);
219
277
}
220
221
__isl_give TYPE *SF(isl_set_lexmin,SUFFIX)(__isl_take isl_set *set)
222
668
{
223
668
  return SF(isl_map_lexmin,SUFFIX)(set);
224
668
}
isl_set_lexmin_pw_multi_aff
Line
Count
Source
222
533
{
223
533
  return SF(isl_map_lexmin,SUFFIX)(set);
224
533
}
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
533
{
228
533
  return SF(isl_map_lexmax,SUFFIX)(set);
229
533
}
isl_set_lexmax_pw_multi_aff
Line
Count
Source
227
532
{
228
532
  return SF(isl_map_lexmax,SUFFIX)(set);
229
532
}
isl_set_lexmax
Line
Count
Source
227
1
{
228
1
  return SF(isl_map_lexmax,SUFFIX)(set);
229
1
}