Coverage Report

Created: 2018-08-14 02:14

/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
104k
{
24
104k
  isl_factorizer *f = NULL;
25
104k
  int *len = NULL;
26
104k
27
104k
  if (!morph)
28
0
    return NULL;
29
104k
30
104k
  if (n_group > 0) {
31
43.7k
    len = isl_alloc_array(morph->dom->ctx, int, n_group);
32
43.7k
    if (!len)
33
0
      goto error;
34
104k
  }
35
104k
36
104k
  f = isl_alloc_type(morph->dom->ctx, struct isl_factorizer);
37
104k
  if (!f)
38
0
    goto error;
39
104k
40
104k
  f->morph = morph;
41
104k
  f->n_group = n_group;
42
104k
  f->len = len;
43
104k
44
104k
  return f;
45
0
error:
46
0
  free(len);
47
0
  isl_morph_free(morph);
48
0
  return NULL;
49
104k
}
50
51
void isl_factorizer_free(__isl_take isl_factorizer *f)
52
104k
{
53
104k
  if (!f)
54
0
    return;
55
104k
56
104k
  isl_morph_free(f->morph);
57
104k
  free(f->len);
58
104k
  free(f);
59
104k
}
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
60.4k
{
80
60.4k
  return isl_factorizer_alloc(isl_morph_identity(bset), 0);
81
60.4k
}
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
43.7k
{
86
43.7k
  int i;
87
43.7k
  unsigned nvar;
88
43.7k
  unsigned ovar;
89
43.7k
  isl_space *dim;
90
43.7k
  isl_basic_set *dom;
91
43.7k
  isl_basic_set *ran;
92
43.7k
  isl_morph *morph;
93
43.7k
  isl_factorizer *f;
94
43.7k
  isl_mat *id;
95
43.7k
96
43.7k
  if (!bset || !Q || !U)
97
0
    goto error;
98
43.7k
99
43.7k
  ovar = 1 + isl_space_offset(bset->dim, isl_dim_set);
100
43.7k
  id = isl_mat_identity(bset->ctx, ovar);
101
43.7k
  Q = isl_mat_diagonal(isl_mat_copy(id), Q);
102
43.7k
  U = isl_mat_diagonal(id, U);
103
43.7k
104
43.7k
  nvar = isl_basic_set_dim(bset, isl_dim_set);
105
43.7k
  dim = isl_basic_set_get_space(bset);
106
43.7k
  dom = isl_basic_set_universe(isl_space_copy(dim));
107
43.7k
  dim = isl_space_drop_dims(dim, isl_dim_set, 0, nvar);
108
43.7k
  dim = isl_space_add_dims(dim, isl_dim_set, nvar);
109
43.7k
  ran = isl_basic_set_universe(dim);
110
43.7k
  morph = isl_morph_alloc(dom, ran, Q, U);
111
43.7k
  f = isl_factorizer_alloc(morph, n);
112
43.7k
  if (!f)
113
0
    return NULL;
114
223k
  
for (i = 0; 43.7k
i < n;
++i180k
)
115
180k
    f->len[i] = len[i];
116
43.7k
  return f;
117
0
error:
118
0
  isl_mat_free(Q);
119
0
  isl_mat_free(U);
120
0
  return NULL;
121
43.7k
}
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
104k
{
136
104k
  int i, j;
137
104k
138
104k
  if (!H)
139
0
    return -1;
140
104k
141
104k
  g->pos = isl_alloc_array(H->ctx, int, H->n_col);
142
104k
  g->group = isl_alloc_array(H->ctx, int, H->n_col);
143
104k
  g->cnt = isl_alloc_array(H->ctx, int, H->n_col);
144
104k
  g->rowgroup = isl_alloc_array(H->ctx, int, H->n_row);
145
104k
146
104k
  if (!g->pos || !g->group || !g->cnt || !g->rowgroup)
147
0
    return -1;
148
104k
149
948k
  
for (i = 0; 104k
i < H->n_row;
++i844k
)
150
844k
    g->rowgroup[i] = -1;
151
488k
  for (i = 0, j = 0; i < H->n_col; 
++i384k
) {
152
891k
    for ( ; j < H->n_row; 
++j506k
)
153
891k
      if (!isl_int_is_zero(H->row[j][i]))
154
891k
        
break384k
;
155
384k
    g->pos[i] = j;
156
384k
  }
157
488k
  for (i = 0; i < H->n_col; 
++i384k
) {
158
384k
    g->group[i] = i;
159
384k
    g->cnt[i] = 1;
160
384k
  }
161
104k
162
104k
  return 0;
163
104k
}
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.65M
{
173
1.65M
  int p = g->group[k];
174
1.65M
  while (g->cnt[p] == 0)
175
56
    p = g->group[p];
176
1.65M
  g->group[k] = p;
177
1.65M
}
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
466k
{
187
466k
  int k;
188
466k
189
466k
  g->rowgroup[j] = g->group[i];
190
1.15M
  for (k = i + 1; k < H->n_col && 
j >= g->pos[k]930k
;
++k688k
) {
191
688k
    update_group(g, k);
192
688k
    update_group(g, i);
193
688k
    if (g->group[k] != g->group[i] &&
194
688k
        
!480k
isl_int_is_zero480k
(H->row[j][k])) {
195
143k
      isl_assert(H->ctx, g->cnt[g->group[k]] != 0, return -1);
196
143k
      isl_assert(H->ctx, g->cnt[g->group[i]] != 0, return -1);
197
143k
      if (g->group[i] < g->group[k]) {
198
143k
        g->cnt[g->group[i]] += g->cnt[g->group[k]];
199
143k
        g->cnt[g->group[k]] = 0;
200
143k
        g->group[g->group[k]] = g->group[i];
201
143k
      } else {
202
696
        g->cnt[g->group[k]] += g->cnt[g->group[i]];
203
696
        g->cnt[g->group[i]] = 0;
204
696
        g->group[g->group[i]] = g->group[k];
205
696
      }
206
143k
    }
207
688k
  }
208
466k
209
466k
  return 0;
210
466k
}
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
104k
{
216
104k
  int i, j;
217
104k
218
408k
  for (i = 0; i < H->n_col && 
g->cnt[0] < H->n_col364k
;
++i303k
) {
219
303k
    if (g->pos[i] == H->n_row)
220
0
      continue; /* A line direction */
221
303k
    if (g->rowgroup[g->pos[i]] == -1)
222
280k
      g->rowgroup[g->pos[i]] = i;
223
4.63M
    for (j = g->pos[i] + 1; j < H->n_row; 
++j4.33M
) {
224
4.33M
      if (isl_int_is_zero(H->row[j][i]))
225
4.33M
        
continue3.77M
;
226
555k
      if (g->rowgroup[j] != -1)
227
88.9k
        continue;
228
466k
      if (update_group_i_with_row_j(g, i, j, H) < 0)
229
0
        return -1;
230
466k
    }
231
303k
  }
232
384k
  
for (i = 1; 104k
i < H->n_col;
++i280k
)
233
280k
    update_group(g, i);
234
104k
235
104k
  return 0;
236
104k
}
237
238
static void clear_groups(struct isl_factor_groups *g)
239
104k
{
240
104k
  if (!g)
241
0
    return;
242
104k
  free(g->pos);
243
104k
  free(g->group);
244
104k
  free(g->cnt);
245
104k
  free(g->rowgroup);
246
104k
}
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
104k
{
259
104k
  int i, j, n, done;
260
104k
  isl_mat *H, *U, *Q;
261
104k
  unsigned nvar;
262
104k
  struct isl_factor_groups g = { 0 };
263
104k
  isl_factorizer *f;
264
104k
265
104k
  if (!bset)
266
0
    return NULL;
267
104k
268
104k
  isl_assert(bset->ctx, isl_basic_set_dim(bset, isl_dim_div) == 0,
269
104k
    return NULL);
270
104k
271
104k
  nvar = isl_basic_set_dim(bset, isl_dim_set);
272
104k
  if (nvar <= 1)
273
1
    return isl_factorizer_identity(bset);
274
104k
275
104k
  H = isl_mat_alloc(bset->ctx, bset->n_eq + bset->n_ineq, nvar);
276
104k
  if (!H)
277
0
    return NULL;
278
104k
  isl_mat_sub_copy(bset->ctx, H->row, bset->eq, bset->n_eq,
279
104k
    0, 1 + isl_space_offset(bset->dim, isl_dim_set), nvar);
280
104k
  isl_mat_sub_copy(bset->ctx, H->row + bset->n_eq, bset->ineq, bset->n_ineq,
281
104k
    0, 1 + isl_space_offset(bset->dim, isl_dim_set), nvar);
282
104k
  H = isl_mat_left_hermite(H, 0, &U, &Q);
283
104k
284
104k
  if (init_groups(&g, H) < 0)
285
0
    goto error;
286
104k
  if (update_groups(&g, H) < 0)
287
0
    goto error;
288
104k
289
104k
  if (g.cnt[0] == nvar) {
290
60.4k
    isl_mat_free(H);
291
60.4k
    isl_mat_free(U);
292
60.4k
    isl_mat_free(Q);
293
60.4k
    clear_groups(&g);
294
60.4k
295
60.4k
    return isl_factorizer_identity(bset);
296
60.4k
  }
297
43.7k
298
43.7k
  done = 0;
299
43.7k
  n = 0;
300
223k
  while (done != nvar) {
301
180k
    int group = g.group[done];
302
241k
    for (i = 1; i < g.cnt[group]; 
++i61.1k
) {
303
61.1k
      if (g.group[done + i] == group)
304
31.9k
        continue;
305
82.3k
      
for (j = done + g.cnt[group]; 29.1k
j < nvar;
++j53.1k
)
306
82.3k
        if (g.group[j] == group)
307
29.1k
          break;
308
29.1k
      if (j == nvar)
309
29.1k
        
isl_die0
(bset->ctx, isl_error_internal,
310
29.1k
          "internal error", goto error);
311
29.1k
      g.group[j] = g.group[done + i];
312
29.1k
      Q = isl_mat_swap_rows(Q, done + i, j);
313
29.1k
      U = isl_mat_swap_cols(U, done + i, j);
314
29.1k
    }
315
180k
    done += g.cnt[group];
316
180k
    g.pos[n++] = g.cnt[group];
317
180k
  }
318
43.7k
319
43.7k
  f = isl_factorizer_groups(bset, Q, U, n, g.pos);
320
43.7k
321
43.7k
  isl_mat_free(H);
322
43.7k
  clear_groups(&g);
323
43.7k
324
43.7k
  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
43.7k
}