Coverage Report

Created: 2018-06-19 22:08

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/tools/polly/lib/External/isl/isl_factorization.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2005-2007 Universiteit Leiden
3
 * Copyright 2008-2009 Katholieke Universiteit Leuven
4
 * Copyright 2010      INRIA Saclay
5
 *
6
 * Use of this software is governed by the MIT license
7
 *
8
 * Written by Sven Verdoolaege, Leiden Institute of Advanced Computer Science,
9
 * Universiteit Leiden, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands
10
 * and K.U.Leuven, Departement Computerwetenschappen, Celestijnenlaan 200A,
11
 * B-3001 Leuven, Belgium
12
 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
13
 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France 
14
 */
15
16
#include <isl_map_private.h>
17
#include <isl_factorization.h>
18
#include <isl_space_private.h>
19
#include <isl_mat_private.h>
20
21
static __isl_give isl_factorizer *isl_factorizer_alloc(
22
  __isl_take isl_morph *morph, int n_group)
23
116k
{
24
116k
  isl_factorizer *f = NULL;
25
116k
  int *len = NULL;
26
116k
27
116k
  if (!morph)
28
0
    return NULL;
29
116k
30
116k
  if (n_group > 0) {
31
46.2k
    len = isl_alloc_array(morph->dom->ctx, int, n_group);
32
46.2k
    if (!len)
33
0
      goto error;
34
116k
  }
35
116k
36
116k
  f = isl_alloc_type(morph->dom->ctx, struct isl_factorizer);
37
116k
  if (!f)
38
0
    goto error;
39
116k
40
116k
  f->morph = morph;
41
116k
  f->n_group = n_group;
42
116k
  f->len = len;
43
116k
44
116k
  return f;
45
0
error:
46
0
  free(len);
47
0
  isl_morph_free(morph);
48
0
  return NULL;
49
116k
}
50
51
void isl_factorizer_free(__isl_take isl_factorizer *f)
52
116k
{
53
116k
  if (!f)
54
0
    return;
55
116k
56
116k
  isl_morph_free(f->morph);
57
116k
  free(f->len);
58
116k
  free(f);
59
116k
}
60
61
void isl_factorizer_dump(__isl_take isl_factorizer *f)
62
0
{
63
0
  int i;
64
0
65
0
  if (!f)
66
0
    return;
67
0
68
0
  isl_morph_print_internal(f->morph, stderr);
69
0
  fprintf(stderr, "[");
70
0
  for (i = 0; i < f->n_group; ++i) {
71
0
    if (i)
72
0
      fprintf(stderr, ", ");
73
0
    fprintf(stderr, "%d", f->len[i]);
74
0
  }
75
0
  fprintf(stderr, "]\n");
76
0
}
77
78
__isl_give isl_factorizer *isl_factorizer_identity(__isl_keep isl_basic_set *bset)
79
70.3k
{
80
70.3k
  return isl_factorizer_alloc(isl_morph_identity(bset), 0);
81
70.3k
}
82
83
__isl_give isl_factorizer *isl_factorizer_groups(__isl_keep isl_basic_set *bset,
84
  __isl_take isl_mat *Q, __isl_take isl_mat *U, int n, int *len)
85
46.2k
{
86
46.2k
  int i;
87
46.2k
  unsigned nvar;
88
46.2k
  unsigned ovar;
89
46.2k
  isl_space *dim;
90
46.2k
  isl_basic_set *dom;
91
46.2k
  isl_basic_set *ran;
92
46.2k
  isl_morph *morph;
93
46.2k
  isl_factorizer *f;
94
46.2k
  isl_mat *id;
95
46.2k
96
46.2k
  if (!bset || !Q || !U)
97
0
    goto error;
98
46.2k
99
46.2k
  ovar = 1 + isl_space_offset(bset->dim, isl_dim_set);
100
46.2k
  id = isl_mat_identity(bset->ctx, ovar);
101
46.2k
  Q = isl_mat_diagonal(isl_mat_copy(id), Q);
102
46.2k
  U = isl_mat_diagonal(id, U);
103
46.2k
104
46.2k
  nvar = isl_basic_set_dim(bset, isl_dim_set);
105
46.2k
  dim = isl_basic_set_get_space(bset);
106
46.2k
  dom = isl_basic_set_universe(isl_space_copy(dim));
107
46.2k
  dim = isl_space_drop_dims(dim, isl_dim_set, 0, nvar);
108
46.2k
  dim = isl_space_add_dims(dim, isl_dim_set, nvar);
109
46.2k
  ran = isl_basic_set_universe(dim);
110
46.2k
  morph = isl_morph_alloc(dom, ran, Q, U);
111
46.2k
  f = isl_factorizer_alloc(morph, n);
112
46.2k
  if (!f)
113
0
    return NULL;
114
228k
  
for (i = 0; 46.2k
i < n;
++i182k
)
115
182k
    f->len[i] = len[i];
116
46.2k
  return f;
117
0
error:
118
0
  isl_mat_free(Q);
119
0
  isl_mat_free(U);
120
0
  return NULL;
121
46.2k
}
122
123
struct isl_factor_groups {
124
  int *pos;   /* for each column: row position of pivot */
125
  int *group;   /* group to which a column belongs */
126
  int *cnt;   /* number of columns in the group */
127
  int *rowgroup;    /* group to which a constraint belongs */
128
};
129
130
/* Initialize isl_factor_groups structure: find pivot row positions,
131
 * each column initially belongs to its own group and the groups
132
 * of the constraints are still unknown.
133
 */
134
static int init_groups(struct isl_factor_groups *g, __isl_keep isl_mat *H)
135
116k
{
136
116k
  int i, j;
137
116k
138
116k
  if (!H)
139
0
    return -1;
140
116k
141
116k
  g->pos = isl_alloc_array(H->ctx, int, H->n_col);
142
116k
  g->group = isl_alloc_array(H->ctx, int, H->n_col);
143
116k
  g->cnt = isl_alloc_array(H->ctx, int, H->n_col);
144
116k
  g->rowgroup = isl_alloc_array(H->ctx, int, H->n_row);
145
116k
146
116k
  if (!g->pos || !g->group || !g->cnt || !g->rowgroup)
147
0
    return -1;
148
116k
149
1.10M
  
for (i = 0; 116k
i < H->n_row;
++i989k
)
150
989k
    g->rowgroup[i] = -1;
151
533k
  for (i = 0, j = 0; i < H->n_col; 
++i416k
) {
152
991k
    for ( ; j < H->n_row; 
++j575k
)
153
991k
      if (!isl_int_is_zero(H->row[j][i]))
154
991k
        
break416k
;
155
416k
    g->pos[i] = j;
156
416k
  }
157
533k
  for (i = 0; i < H->n_col; 
++i416k
) {
158
416k
    g->group[i] = i;
159
416k
    g->cnt[i] = 1;
160
416k
  }
161
116k
162
116k
  return 0;
163
116k
}
164
165
/* Update group[k] to the group column k belongs to.
166
 * When merging two groups, only the group of the current
167
 * group leader is changed.  Here we change the group of
168
 * the other members to also point to the group that the
169
 * old group leader now points to.
170
 */
171
static void update_group(struct isl_factor_groups *g, int k)
172
1.94M
{
173
1.94M
  int p = g->group[k];
174
1.94M
  while (g->cnt[p] == 0)
175
24
    p = g->group[p];
176
1.94M
  g->group[k] = p;
177
1.94M
}
178
179
/* Merge group i with all groups of the subsequent columns
180
 * with non-zero coefficients in row j of H.
181
 * (The previous columns are all zero; otherwise we would have handled
182
 * the row before.)
183
 */
184
static int update_group_i_with_row_j(struct isl_factor_groups *g, int i, int j,
185
  __isl_keep isl_mat *H)
186
574k
{
187
574k
  int k;
188
574k
189
574k
  g->rowgroup[j] = g->group[i];
190
1.39M
  for (k = i + 1; k < H->n_col && 
j >= g->pos[k]1.11M
;
++k820k
) {
191
820k
    update_group(g, k);
192
820k
    update_group(g, i);
193
820k
    if (g->group[k] != g->group[i] &&
194
820k
        
!540k
isl_int_is_zero540k
(H->row[j][k])) {
195
164k
      isl_assert(H->ctx, g->cnt[g->group[k]] != 0, return -1);
196
164k
      isl_assert(H->ctx, g->cnt[g->group[i]] != 0, return -1);
197
164k
      if (g->group[i] < g->group[k]) {
198
163k
        g->cnt[g->group[i]] += g->cnt[g->group[k]];
199
163k
        g->cnt[g->group[k]] = 0;
200
163k
        g->group[g->group[k]] = g->group[i];
201
163k
      } else {
202
682
        g->cnt[g->group[k]] += g->cnt[g->group[i]];
203
682
        g->cnt[g->group[i]] = 0;
204
682
        g->group[g->group[i]] = g->group[k];
205
682
      }
206
164k
    }
207
820k
  }
208
574k
209
574k
  return 0;
210
574k
}
211
212
/* Update the group information based on the constraint matrix.
213
 */
214
static int update_groups(struct isl_factor_groups *g, __isl_keep isl_mat *H)
215
116k
{
216
116k
  int i, j;
217
116k
218
441k
  for (i = 0; i < H->n_col && 
g->cnt[0] < H->n_col395k
;
++i325k
) {
219
325k
    if (g->pos[i] == H->n_row)
220
0
      continue; /* A line direction */
221
325k
    if (g->rowgroup[g->pos[i]] == -1)
222
288k
      g->rowgroup[g->pos[i]] = i;
223
4.96M
    for (j = g->pos[i] + 1; j < H->n_row; 
++j4.63M
) {
224
4.63M
      if (isl_int_is_zero(H->row[j][i]))
225
4.63M
        
continue3.93M
;
226
698k
      if (g->rowgroup[j] != -1)
227
123k
        continue;
228
574k
      if (update_group_i_with_row_j(g, i, j, H) < 0)
229
0
        return -1;
230
574k
    }
231
325k
  }
232
416k
  
for (i = 1; 116k
i < H->n_col;
++i299k
)
233
299k
    update_group(g, i);
234
116k
235
116k
  return 0;
236
116k
}
237
238
static void clear_groups(struct isl_factor_groups *g)
239
116k
{
240
116k
  if (!g)
241
0
    return;
242
116k
  free(g->pos);
243
116k
  free(g->group);
244
116k
  free(g->cnt);
245
116k
  free(g->rowgroup);
246
116k
}
247
248
/* Determine if the set variables of the basic set can be factorized and
249
 * return the results in an isl_factorizer.
250
 *
251
 * The algorithm works by first computing the Hermite normal form
252
 * and then grouping columns linked by one or more constraints together,
253
 * where a constraints "links" two or more columns if the constraint
254
 * has nonzero coefficients in the columns.
255
 */
256
__isl_give isl_factorizer *isl_basic_set_factorizer(
257
  __isl_keep isl_basic_set *bset)
258
116k
{
259
116k
  int i, j, n, done;
260
116k
  isl_mat *H, *U, *Q;
261
116k
  unsigned nvar;
262
116k
  struct isl_factor_groups g = { 0 };
263
116k
  isl_factorizer *f;
264
116k
265
116k
  if (!bset)
266
0
    return NULL;
267
116k
268
116k
  isl_assert(bset->ctx, isl_basic_set_dim(bset, isl_dim_div) == 0,
269
116k
    return NULL);
270
116k
271
116k
  nvar = isl_basic_set_dim(bset, isl_dim_set);
272
116k
  if (nvar <= 1)
273
1
    return isl_factorizer_identity(bset);
274
116k
275
116k
  H = isl_mat_alloc(bset->ctx, bset->n_eq + bset->n_ineq, nvar);
276
116k
  if (!H)
277
0
    return NULL;
278
116k
  isl_mat_sub_copy(bset->ctx, H->row, bset->eq, bset->n_eq,
279
116k
    0, 1 + isl_space_offset(bset->dim, isl_dim_set), nvar);
280
116k
  isl_mat_sub_copy(bset->ctx, H->row + bset->n_eq, bset->ineq, bset->n_ineq,
281
116k
    0, 1 + isl_space_offset(bset->dim, isl_dim_set), nvar);
282
116k
  H = isl_mat_left_hermite(H, 0, &U, &Q);
283
116k
284
116k
  if (init_groups(&g, H) < 0)
285
0
    goto error;
286
116k
  if (update_groups(&g, H) < 0)
287
0
    goto error;
288
116k
289
116k
  if (g.cnt[0] == nvar) {
290
70.3k
    isl_mat_free(H);
291
70.3k
    isl_mat_free(U);
292
70.3k
    isl_mat_free(Q);
293
70.3k
    clear_groups(&g);
294
70.3k
295
70.3k
    return isl_factorizer_identity(bset);
296
70.3k
  }
297
46.2k
298
46.2k
  done = 0;
299
46.2k
  n = 0;
300
228k
  while (done != nvar) {
301
182k
    int group = g.group[done];
302
252k
    for (i = 1; i < g.cnt[group]; 
++i70.5k
) {
303
70.5k
      if (g.group[done + i] == group)
304
39.5k
        continue;
305
95.6k
      
for (j = done + g.cnt[group]; 30.9k
j < nvar;
++j64.7k
)
306
95.6k
        if (g.group[j] == group)
307
30.9k
          break;
308
30.9k
      if (j == nvar)
309
30.9k
        
isl_die0
(bset->ctx, isl_error_internal,
310
30.9k
          "internal error", goto error);
311
30.9k
      g.group[j] = g.group[done + i];
312
30.9k
      Q = isl_mat_swap_rows(Q, done + i, j);
313
30.9k
      U = isl_mat_swap_cols(U, done + i, j);
314
30.9k
    }
315
182k
    done += g.cnt[group];
316
182k
    g.pos[n++] = g.cnt[group];
317
182k
  }
318
46.2k
319
46.2k
  f = isl_factorizer_groups(bset, Q, U, n, g.pos);
320
46.2k
321
46.2k
  isl_mat_free(H);
322
46.2k
  clear_groups(&g);
323
46.2k
324
46.2k
  return f;
325
0
error:
326
0
  isl_mat_free(H);
327
0
  isl_mat_free(U);
328
0
  isl_mat_free(Q);
329
0
  clear_groups(&g);
330
0
  return NULL;
331
46.2k
}