Coverage Report

Created: 2017-10-03 07: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
30.4k
#define xSF(TYPE,SUFFIX) TYPE ## SUFFIX
18
30.4k
#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
6.85k
{
35
6.85k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
6.85k
                  flags);
37
6.85k
}
isl_map.c:isl_basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
34
3.45k
{
35
3.45k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
3.45k
                  flags);
37
3.45k
}
isl_map.c:isl_basic_map_partial_lexopt
Line
Count
Source
34
3.40k
{
35
3.40k
  return SF(isl_tab_basic_map_partial_lexopt,SUFFIX)(bmap, dom, empty,
36
3.40k
                  flags);
37
3.40k
}
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.42k
{
90
8.42k
  int i;
91
8.42k
  TYPE *res;
92
8.42k
  isl_set *all_empty;
93
8.42k
94
8.42k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
2.93k
    
return 2.93k
SF2.93k
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
2.93k
                empty, flags);
97
8.42k
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 (5.48k
isl_set_plain_is_empty(dom)5.48k
) {
103
2.71k
    isl_space *space = isl_basic_map_get_space(bmap);
104
2.71k
    if (empty)
105
2.71k
      *empty = dom;
106
2.71k
    else
107
0
      isl_set_free(dom);
108
2.71k
    isl_basic_map_free(bmap);
109
2.71k
    return EMPTY(space);
110
2.71k
  }
111
5.48k
112
2.76k
  
res = 2.76k
SF2.76k
(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
2.76k
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
2.76k
115
2.76k
  if (empty)
116
2.76k
    all_empty = *empty;
117
3.68k
  for (i = 1; 
i < dom->n3.68k
;
++i918
) {
118
918
    TYPE *res_i;
119
918
120
918
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
918
        isl_basic_map_copy(bmap),
122
918
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
918
124
918
    res = ADD(res, res_i);
125
918
    if (empty)
126
918
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
918
  }
128
2.76k
129
2.76k
  if (empty)
130
2.76k
    *empty = all_empty;
131
2.76k
  isl_set_free(dom);
132
2.76k
  isl_basic_map_free(bmap);
133
2.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
8.42k
}
isl_map.c:basic_map_partial_lexopt_pw_multi_aff
Line
Count
Source
89
2.87k
{
90
2.87k
  int i;
91
2.87k
  TYPE *res;
92
2.87k
  isl_set *all_empty;
93
2.87k
94
2.87k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
2.30k
    
return 2.30k
SF2.30k
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
2.30k
                empty, flags);
97
2.87k
98
568
  dom = isl_set_make_disjoint(dom);
99
568
  if (!dom)
100
0
    goto error;
101
568
102
568
  
if (568
isl_set_plain_is_empty(dom)568
) {
103
284
    isl_space *space = isl_basic_map_get_space(bmap);
104
284
    if (empty)
105
284
      *empty = dom;
106
284
    else
107
0
      isl_set_free(dom);
108
284
    isl_basic_map_free(bmap);
109
284
    return EMPTY(space);
110
284
  }
111
568
112
284
  
res = 284
SF284
(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
284
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
284
115
284
  if (empty)
116
284
    all_empty = *empty;
117
1.08k
  for (i = 1; 
i < dom->n1.08k
;
++i802
) {
118
802
    TYPE *res_i;
119
802
120
802
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
802
        isl_basic_map_copy(bmap),
122
802
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
802
124
802
    res = ADD(res, res_i);
125
802
    if (empty)
126
802
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
802
  }
128
284
129
284
  if (empty)
130
284
    *empty = all_empty;
131
284
  isl_set_free(dom);
132
284
  isl_basic_map_free(bmap);
133
284
  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
2.87k
}
isl_map.c:basic_map_partial_lexopt
Line
Count
Source
89
5.55k
{
90
5.55k
  int i;
91
5.55k
  TYPE *res;
92
5.55k
  isl_set *all_empty;
93
5.55k
94
5.55k
  if (ISL_FL_ISSET(flags, ISL_OPT_FULL))
95
631
    
return 631
SF631
(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL,
96
631
                empty, flags);
97
5.55k
98
4.92k
  dom = isl_set_make_disjoint(dom);
99
4.92k
  if (!dom)
100
0
    goto error;
101
4.92k
102
4.92k
  
if (4.92k
isl_set_plain_is_empty(dom)4.92k
) {
103
2.43k
    isl_space *space = isl_basic_map_get_space(bmap);
104
2.43k
    if (empty)
105
2.43k
      *empty = dom;
106
2.43k
    else
107
0
      isl_set_free(dom);
108
2.43k
    isl_basic_map_free(bmap);
109
2.43k
    return EMPTY(space);
110
2.43k
  }
111
4.92k
112
2.48k
  
res = 2.48k
SF2.48k
(isl_basic_map_partial_lexopt,SUFFIX)(isl_basic_map_copy(bmap),
113
2.48k
      isl_basic_set_copy(dom->p[0]), empty, flags);
114
2.48k
115
2.48k
  if (empty)
116
2.48k
    all_empty = *empty;
117
2.60k
  for (i = 1; 
i < dom->n2.60k
;
++i116
) {
118
116
    TYPE *res_i;
119
116
120
116
    res_i = SF(isl_basic_map_partial_lexopt,SUFFIX)(
121
116
        isl_basic_map_copy(bmap),
122
116
        isl_basic_set_copy(dom->p[i]), empty, flags);
123
116
124
116
    res = ADD(res, res_i);
125
116
    if (empty)
126
116
      all_empty = isl_set_union_disjoint(all_empty, *empty);
127
116
  }
128
2.48k
129
2.48k
  if (empty)
130
2.48k
    *empty = all_empty;
131
2.48k
  isl_set_free(dom);
132
2.48k
  isl_basic_map_free(bmap);
133
2.48k
  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
5.55k
}
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
230
{
148
230
  ISL_FL_SET(flags, ISL_OPT_FULL);
149
230
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL, NULL, flags);
150
230
}
isl_basic_map_lexopt
Line
Count
Source
147
168
{
148
168
  ISL_FL_SET(flags, ISL_OPT_FULL);
149
168
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL, NULL, flags);
150
168
}
isl_basic_map_lexopt_pw_multi_aff
Line
Count
Source
147
62
{
148
62
  ISL_FL_SET(flags, ISL_OPT_FULL);
149
62
  return SF(isl_basic_map_partial_lexopt,SUFFIX)(bmap, NULL, NULL, flags);
150
62
}
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
}
Unexecuted instantiation: isl_basic_map_lexmin
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
}
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.5k
{
176
11.5k
  isl_bool aligned;
177
11.5k
178
11.5k
  aligned = isl_map_set_has_equal_params(map, dom);
179
11.5k
  if (aligned < 0)
180
0
    goto error;
181
11.5k
  
if (11.5k
aligned11.5k
)
182
11.5k
    
return 11.5k
SF11.5k
(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom,
183
11.5k
                empty, flags);
184
0
  
if (0
!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
11.5k
}
isl_map.c:isl_map_partial_lexopt
Line
Count
Source
175
11.5k
{
176
11.5k
  isl_bool aligned;
177
11.5k
178
11.5k
  aligned = isl_map_set_has_equal_params(map, dom);
179
11.5k
  if (aligned < 0)
180
0
    goto error;
181
11.5k
  
if (11.5k
aligned11.5k
)
182
11.5k
    
return 11.5k
SF11.5k
(isl_map_partial_lexopt_aligned,SUFFIX)(map, dom,
183
11.5k
                empty, flags);
184
0
  
if (0
!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
11.5k
}
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.97k
{
206
1.97k
  ISL_FL_SET(flags, ISL_OPT_FULL);
207
1.97k
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, NULL, NULL,
208
1.97k
              flags);
209
1.97k
}
isl_map_lexopt
Line
Count
Source
205
925
{
206
925
  ISL_FL_SET(flags, ISL_OPT_FULL);
207
925
  return SF(isl_map_partial_lexopt_aligned,SUFFIX)(map, NULL, NULL,
208
925
              flags);
209
925
}
isl_map_lexopt_pw_multi_aff
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.24k
{
213
1.24k
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
1.24k
}
isl_map_lexmin_pw_multi_aff
Line
Count
Source
212
527
{
213
527
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
527
}
isl_map_lexmin
Line
Count
Source
212
715
{
213
715
  return SF(isl_map_lexopt,SUFFIX)(map, 0);
214
715
}
215
216
__isl_give TYPE *SF(isl_map_lexmax,SUFFIX)(__isl_take isl_map *map)
217
736
{
218
736
  return 
SF736
(isl_map_lexopt,SUFFIX)(map,
ISL_OPT_MAX736
);
219
736
}
isl_map_lexmax_pw_multi_aff
Line
Count
Source
217
526
{
218
526
  return 
SF526
(isl_map_lexopt,SUFFIX)(map,
ISL_OPT_MAX526
);
219
526
}
isl_map_lexmax
Line
Count
Source
217
210
{
218
210
  return 
SF210
(isl_map_lexopt,SUFFIX)(map,
ISL_OPT_MAX210
);
219
210
}
220
221
__isl_give TYPE *SF(isl_set_lexmin,SUFFIX)(__isl_take isl_set *set)
222
657
{
223
657
  return SF(isl_map_lexmin,SUFFIX)(set);
224
657
}
isl_set_lexmin
Line
Count
Source
222
130
{
223
130
  return SF(isl_map_lexmin,SUFFIX)(set);
224
130
}
isl_set_lexmin_pw_multi_aff
Line
Count
Source
222
527
{
223
527
  return SF(isl_map_lexmin,SUFFIX)(set);
224
527
}
225
226
__isl_give TYPE *SF(isl_set_lexmax,SUFFIX)(__isl_take isl_set *set)
227
527
{
228
527
  return SF(isl_map_lexmax,SUFFIX)(set);
229
527
}
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
526
{
228
526
  return SF(isl_map_lexmax,SUFFIX)(set);
229
526
}