Coverage Report

Created: 2019-04-21 11:35

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/tools/polly/lib/External/isl/isl_map_subtract.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 2008-2009 Katholieke Universiteit Leuven
3
 *
4
 * Use of this software is governed by the MIT license
5
 *
6
 * Written by Sven Verdoolaege, K.U.Leuven, Departement
7
 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
8
 */
9
10
#include <isl_map_private.h>
11
#include <isl_seq.h>
12
#include <isl/set.h>
13
#include <isl/map.h>
14
#include "isl_tab.h"
15
#include <isl_point_private.h>
16
#include <isl_vec_private.h>
17
18
#include <set_to_map.c>
19
#include <set_from_map.c>
20
21
/* Expand the constraint "c" into "v".  The initial "dim" dimensions
22
 * are the same, but "v" may have more divs than "c" and the divs of "c"
23
 * may appear in different positions in "v".
24
 * The number of divs in "c" is given by "n_div" and the mapping
25
 * of divs in "c" to divs in "v" is given by "div_map".
26
 *
27
 * Although it shouldn't happen in practice, it is theoretically
28
 * possible that two or more divs in "c" are mapped to the same div in "v".
29
 * These divs are then necessarily the same, so we simply add their
30
 * coefficients.
31
 */
32
static void expand_constraint(isl_vec *v, unsigned dim,
33
  isl_int *c, int *div_map, unsigned n_div)
34
107k
{
35
107k
  int i;
36
107k
37
107k
  isl_seq_cpy(v->el, c, 1 + dim);
38
107k
  isl_seq_clr(v->el + 1 + dim, v->size - (1 + dim));
39
107k
40
121k
  for (i = 0; i < n_div; 
++i14.3k
) {
41
14.3k
    int pos = 1 + dim + div_map[i];
42
14.3k
    isl_int_add(v->el[pos], v->el[pos], c[1 + dim + i]);
43
14.3k
  }
44
107k
}
45
46
/* Add all constraints of bmap to tab.  The equalities of bmap
47
 * are added as a pair of inequalities.
48
 */
49
static isl_stat tab_add_constraints(struct isl_tab *tab,
50
  __isl_keep isl_basic_map *bmap, int *div_map)
51
30.7k
{
52
30.7k
  int i;
53
30.7k
  unsigned dim;
54
30.7k
  unsigned tab_total;
55
30.7k
  unsigned bmap_total;
56
30.7k
  isl_vec *v;
57
30.7k
58
30.7k
  if (!tab || !bmap)
59
0
    return isl_stat_error;
60
30.7k
61
30.7k
  tab_total = isl_basic_map_total_dim(tab->bmap);
62
30.7k
  bmap_total = isl_basic_map_total_dim(bmap);
63
30.7k
  dim = isl_space_dim(tab->bmap->dim, isl_dim_all);
64
30.7k
65
30.7k
  if (isl_tab_extend_cons(tab, 2 * bmap->n_eq + bmap->n_ineq) < 0)
66
0
    return isl_stat_error;
67
30.7k
68
30.7k
  v = isl_vec_alloc(bmap->ctx, 1 + tab_total);
69
30.7k
  if (!v)
70
0
    return isl_stat_error;
71
30.7k
72
38.5k
  
for (i = 0; 30.7k
i < bmap->n_eq;
++i7.81k
) {
73
9.06k
    expand_constraint(v, dim, bmap->eq[i], div_map, bmap->n_div);
74
9.06k
    if (isl_tab_add_ineq(tab, v->el) < 0)
75
0
      goto error;
76
9.06k
    isl_seq_neg(bmap->eq[i], bmap->eq[i], 1 + bmap_total);
77
9.06k
    expand_constraint(v, dim, bmap->eq[i], div_map, bmap->n_div);
78
9.06k
    if (isl_tab_add_ineq(tab, v->el) < 0)
79
0
      goto error;
80
9.06k
    isl_seq_neg(bmap->eq[i], bmap->eq[i], 1 + bmap_total);
81
9.06k
    if (tab->empty)
82
1.24k
      break;
83
9.06k
  }
84
30.7k
85
91.5k
  
for (i = 0; 30.7k
i < bmap->n_ineq;
++i60.7k
) {
86
74.4k
    expand_constraint(v, dim, bmap->ineq[i], div_map, bmap->n_div);
87
74.4k
    if (isl_tab_add_ineq(tab, v->el) < 0)
88
0
      goto error;
89
74.4k
    if (tab->empty)
90
13.7k
      break;
91
74.4k
  }
92
30.7k
93
30.7k
  isl_vec_free(v);
94
30.7k
  return isl_stat_ok;
95
0
error:
96
0
  isl_vec_free(v);
97
0
  return isl_stat_error;
98
30.7k
}
99
100
/* Add a specific constraint of bmap (or its opposite) to tab.
101
 * The position of the constraint is specified by "c", where
102
 * the equalities of bmap are counted twice, once for the inequality
103
 * that is equal to the equality, and once for its negation.
104
 *
105
 * Each of these constraints has been added to "tab" before by
106
 * tab_add_constraints (and later removed again), so there should
107
 * already be a row available for the constraint.
108
 */
109
static isl_stat tab_add_constraint(struct isl_tab *tab,
110
  __isl_keep isl_basic_map *bmap, int *div_map, int c, int oppose)
111
14.9k
{
112
14.9k
  unsigned dim;
113
14.9k
  unsigned tab_total;
114
14.9k
  unsigned bmap_total;
115
14.9k
  isl_vec *v;
116
14.9k
  isl_stat r;
117
14.9k
118
14.9k
  if (!tab || !bmap)
119
0
    return isl_stat_error;
120
14.9k
121
14.9k
  tab_total = isl_basic_map_total_dim(tab->bmap);
122
14.9k
  bmap_total = isl_basic_map_total_dim(bmap);
123
14.9k
  dim = isl_space_dim(tab->bmap->dim, isl_dim_all);
124
14.9k
125
14.9k
  v = isl_vec_alloc(bmap->ctx, 1 + tab_total);
126
14.9k
  if (!v)
127
0
    return isl_stat_error;
128
14.9k
129
14.9k
  if (c < 2 * bmap->n_eq) {
130
3.60k
    if ((c % 2) != oppose)
131
1.98k
      isl_seq_neg(bmap->eq[c/2], bmap->eq[c/2],
132
1.98k
          1 + bmap_total);
133
3.60k
    if (oppose)
134
3.60k
      
isl_int_sub_ui2.68k
(bmap->eq[c/2][0], bmap->eq[c/2][0], 1);
135
3.60k
    expand_constraint(v, dim, bmap->eq[c/2], div_map, bmap->n_div);
136
3.60k
    r = isl_tab_add_ineq(tab, v->el);
137
3.60k
    if (oppose)
138
3.60k
      
isl_int_add_ui2.68k
(bmap->eq[c/2][0], bmap->eq[c/2][0], 1);
139
3.60k
    if ((c % 2) != oppose)
140
1.98k
      isl_seq_neg(bmap->eq[c/2], bmap->eq[c/2],
141
1.98k
          1 + bmap_total);
142
11.3k
  } else {
143
11.3k
    c -= 2 * bmap->n_eq;
144
11.3k
    if (oppose) {
145
9.94k
      isl_seq_neg(bmap->ineq[c], bmap->ineq[c],
146
9.94k
          1 + bmap_total);
147
9.94k
      isl_int_sub_ui(bmap->ineq[c][0], bmap->ineq[c][0], 1);
148
9.94k
    }
149
11.3k
    expand_constraint(v, dim, bmap->ineq[c], div_map, bmap->n_div);
150
11.3k
    r = isl_tab_add_ineq(tab, v->el);
151
11.3k
    if (oppose) {
152
9.94k
      isl_int_add_ui(bmap->ineq[c][0], bmap->ineq[c][0], 1);
153
9.94k
      isl_seq_neg(bmap->ineq[c], bmap->ineq[c],
154
9.94k
          1 + bmap_total);
155
9.94k
    }
156
11.3k
  }
157
14.9k
158
14.9k
  isl_vec_free(v);
159
14.9k
  return r;
160
14.9k
}
161
162
static isl_stat tab_add_divs(struct isl_tab *tab,
163
  __isl_keep isl_basic_map *bmap, int **div_map)
164
30.7k
{
165
30.7k
  int i, j;
166
30.7k
  struct isl_vec *vec;
167
30.7k
  unsigned total;
168
30.7k
  unsigned dim;
169
30.7k
170
30.7k
  if (!bmap)
171
0
    return isl_stat_error;
172
30.7k
  if (!bmap->n_div)
173
29.7k
    return isl_stat_ok;
174
1.01k
175
1.01k
  if (!*div_map)
176
575
    *div_map = isl_alloc_array(bmap->ctx, int, bmap->n_div);
177
1.01k
  if (!*div_map)
178
0
    return isl_stat_error;
179
1.01k
180
1.01k
  total = isl_basic_map_total_dim(tab->bmap);
181
1.01k
  dim = total - tab->bmap->n_div;
182
1.01k
  vec = isl_vec_alloc(bmap->ctx, 2 + total + bmap->n_div);
183
1.01k
  if (!vec)
184
0
    return isl_stat_error;
185
1.01k
186
2.58k
  
for (i = 0; 1.01k
i < bmap->n_div;
++i1.57k
) {
187
1.57k
    isl_seq_cpy(vec->el, bmap->div[i], 2 + dim);
188
1.57k
    isl_seq_clr(vec->el + 2 + dim, tab->bmap->n_div);
189
2.22k
    for (j = 0; j < i; 
++j652
)
190
1.57k
      
isl_int_add652
(vec->el[2 + dim + (*div_map)[j]],
191
1.57k
            vec->el[2 + dim + (*div_map)[j]],
192
1.57k
          bmap->div[i][2 + dim + j]);
193
2.70k
    for (j = 0; j < tab->bmap->n_div; 
++j1.13k
)
194
2.32k
      if (isl_seq_eq(tab->bmap->div[j],
195
2.32k
          vec->el, 2 + dim + tab->bmap->n_div))
196
1.19k
        break;
197
1.57k
    (*div_map)[i] = j;
198
1.57k
    if (j == tab->bmap->n_div) {
199
378
      vec->size = 2 + dim + tab->bmap->n_div;
200
378
      if (isl_tab_add_div(tab, vec) < 0)
201
0
        goto error;
202
378
    }
203
1.57k
  }
204
1.01k
205
1.01k
  isl_vec_free(vec);
206
1.01k
207
1.01k
  return isl_stat_ok;
208
0
error:
209
0
  isl_vec_free(vec);
210
0
211
0
  return isl_stat_error;
212
1.01k
}
213
214
/* Freeze all constraints of tableau tab.
215
 */
216
static int tab_freeze_constraints(struct isl_tab *tab)
217
30.7k
{
218
30.7k
  int i;
219
30.7k
220
195k
  for (i = 0; i < tab->n_con; 
++i165k
)
221
165k
    if (isl_tab_freeze_constraint(tab, i) < 0)
222
0
      return -1;
223
30.7k
224
30.7k
  return 0;
225
30.7k
}
226
227
/* Check for redundant constraints starting at offset.
228
 * Put the indices of the redundant constraints in index
229
 * and return the number of redundant constraints.
230
 */
231
static int n_non_redundant(isl_ctx *ctx, struct isl_tab *tab,
232
  int offset, int **index)
233
16.7k
{
234
16.7k
  int i, n;
235
16.7k
  int n_test = tab->n_con - offset;
236
16.7k
237
16.7k
  if (isl_tab_detect_redundant(tab) < 0)
238
0
    return -1;
239
16.7k
240
16.7k
  if (n_test == 0)
241
668
    return 0;
242
16.1k
  if (!*index)
243
15.7k
    *index = isl_alloc_array(ctx, int, n_test);
244
16.1k
  if (!*index)
245
0
    return -1;
246
16.1k
247
77.1k
  
for (n = 0, i = 0; 16.1k
i < n_test;
++i61.0k
) {
248
61.0k
    int r;
249
61.0k
    r = isl_tab_is_redundant(tab, offset + i);
250
61.0k
    if (r < 0)
251
0
      return -1;
252
61.0k
    if (r)
253
45.1k
      continue;
254
15.9k
    (*index)[n++] = i;
255
15.9k
  }
256
16.1k
257
16.1k
  return n;
258
16.1k
}
259
260
/* basic_map_collect_diff calls add on each of the pieces of
261
 * the set difference between bmap and map until the add method
262
 * return a negative value.
263
 */
264
struct isl_diff_collector {
265
  isl_stat (*add)(struct isl_diff_collector *dc,
266
        __isl_take isl_basic_map *bmap);
267
};
268
269
/* Compute the set difference between bmap and map and call
270
 * dc->add on each of the piece until this function returns
271
 * a negative value.
272
 * Return 0 on success and -1 on error.  dc->add returning
273
 * a negative value is treated as an error, but the calling
274
 * function can interpret the results based on the state of dc.
275
 *
276
 * Assumes that map has known divs.
277
 *
278
 * The difference is computed by a backtracking algorithm.
279
 * Each level corresponds to a basic map in "map".
280
 * When a node in entered for the first time, we check
281
 * if the corresonding basic map intersects the current piece
282
 * of "bmap".  If not, we move to the next level.
283
 * Otherwise, we split the current piece into as many
284
 * pieces as there are non-redundant constraints of the current
285
 * basic map in the intersection.  Each of these pieces is
286
 * handled by a child of the current node.
287
 * In particular, if there are n non-redundant constraints,
288
 * then for each 0 <= i < n, a piece is cut off by adding
289
 * constraints 0 <= j < i and adding the opposite of constraint i.
290
 * If there are no non-redundant constraints, meaning that the current
291
 * piece is a subset of the current basic map, then we simply backtrack.
292
 *
293
 * In the leaves, we check if the remaining piece has any integer points
294
 * and if so, pass it along to dc->add.  As a special case, if nothing
295
 * has been removed when we end up in a leaf, we simply pass along
296
 * the original basic map.
297
 */
298
static isl_stat basic_map_collect_diff(__isl_take isl_basic_map *bmap,
299
  __isl_take isl_map *map, struct isl_diff_collector *dc)
300
17.7k
{
301
17.7k
  int i;
302
17.7k
  int modified;
303
17.7k
  int level;
304
17.7k
  int init;
305
17.7k
  isl_bool empty;
306
17.7k
  isl_ctx *ctx;
307
17.7k
  struct isl_tab *tab = NULL;
308
17.7k
  struct isl_tab_undo **snap = NULL;
309
17.7k
  int *k = NULL;
310
17.7k
  int *n = NULL;
311
17.7k
  int **index = NULL;
312
17.7k
  int **div_map = NULL;
313
17.7k
314
17.7k
  empty = isl_basic_map_is_empty(bmap);
315
17.7k
  if (empty) {
316
0
    isl_basic_map_free(bmap);
317
0
    isl_map_free(map);
318
0
    return empty < 0 ? isl_stat_error : isl_stat_ok;
319
0
  }
320
17.7k
321
17.7k
  bmap = isl_basic_map_cow(bmap);
322
17.7k
  map = isl_map_cow(map);
323
17.7k
324
17.7k
  if (!bmap || !map)
325
0
    goto error;
326
17.7k
327
17.7k
  ctx = map->ctx;
328
17.7k
  snap = isl_alloc_array(map->ctx, struct isl_tab_undo *, map->n);
329
17.7k
  k = isl_alloc_array(map->ctx, int, map->n);
330
17.7k
  n = isl_alloc_array(map->ctx, int, map->n);
331
17.7k
  index = isl_calloc_array(map->ctx, int *, map->n);
332
17.7k
  div_map = isl_calloc_array(map->ctx, int *, map->n);
333
17.7k
  if (!snap || !k || !n || !index || !div_map)
334
0
    goto error;
335
17.7k
336
17.7k
  bmap = isl_basic_map_order_divs(bmap);
337
17.7k
  map = isl_map_order_divs(map);
338
17.7k
339
17.7k
  tab = isl_tab_from_basic_map(bmap, 1);
340
17.7k
  if (!tab)
341
0
    goto error;
342
17.7k
343
17.7k
  modified = 0;
344
17.7k
  level = 0;
345
17.7k
  init = 1;
346
17.7k
347
73.6k
  while (level >= 0) {
348
62.1k
    if (level >= map->n) {
349
13.5k
      int empty;
350
13.5k
      struct isl_basic_map *bm;
351
13.5k
      if (!modified) {
352
3.86k
        if (dc->add(dc, isl_basic_map_copy(bmap)) < 0)
353
389
          goto error;
354
3.47k
        break;
355
3.47k
      }
356
9.71k
      bm = isl_basic_map_copy(tab->bmap);
357
9.71k
      bm = isl_basic_map_cow(bm);
358
9.71k
      bm = isl_basic_map_update_from_tab(bm, tab);
359
9.71k
      bm = isl_basic_map_simplify(bm);
360
9.71k
      bm = isl_basic_map_finalize(bm);
361
9.71k
      empty = isl_basic_map_is_empty(bm);
362
9.71k
      if (empty)
363
446
        isl_basic_map_free(bm);
364
9.26k
      else if (dc->add(dc, bm) < 0)
365
2.41k
        goto error;
366
7.30k
      if (empty < 0)
367
0
        goto error;
368
7.30k
      level--;
369
7.30k
      init = 0;
370
7.30k
      continue;
371
7.30k
    }
372
48.6k
    if (init) {
373
30.7k
      int offset;
374
30.7k
      struct isl_tab_undo *snap2;
375
30.7k
      snap2 = isl_tab_snap(tab);
376
30.7k
      if (tab_add_divs(tab, map->p[level],
377
30.7k
           &div_map[level]) < 0)
378
0
        goto error;
379
30.7k
      offset = tab->n_con;
380
30.7k
      snap[level] = isl_tab_snap(tab);
381
30.7k
      if (tab_freeze_constraints(tab) < 0)
382
0
        goto error;
383
30.7k
      if (tab_add_constraints(tab, map->p[level],
384
30.7k
            div_map[level]) < 0)
385
0
        goto error;
386
30.7k
      k[level] = 0;
387
30.7k
      n[level] = 0;
388
30.7k
      if (tab->empty) {
389
13.9k
        if (isl_tab_rollback(tab, snap2) < 0)
390
0
          goto error;
391
13.9k
        level++;
392
13.9k
        continue;
393
13.9k
      }
394
16.7k
      modified = 1;
395
16.7k
      n[level] = n_non_redundant(ctx, tab, offset,
396
16.7k
                &index[level]);
397
16.7k
      if (n[level] < 0)
398
0
        goto error;
399
16.7k
      if (n[level] == 0) {
400
6.44k
        level--;
401
6.44k
        init = 0;
402
6.44k
        continue;
403
6.44k
      }
404
10.3k
      if (isl_tab_rollback(tab, snap[level]) < 0)
405
0
        goto error;
406
10.3k
      if (tab_add_constraint(tab, map->p[level],
407
10.3k
          div_map[level], index[level][0], 1) < 0)
408
0
        goto error;
409
10.3k
      level++;
410
10.3k
      continue;
411
17.8k
    } else {
412
17.8k
      if (k[level] + 1 >= n[level]) {
413
15.5k
        level--;
414
15.5k
        continue;
415
15.5k
      }
416
2.30k
      if (isl_tab_rollback(tab, snap[level]) < 0)
417
0
        goto error;
418
2.30k
      if (tab_add_constraint(tab, map->p[level],
419
2.30k
            div_map[level],
420
2.30k
            index[level][k[level]], 0) < 0)
421
0
        goto error;
422
2.30k
      snap[level] = isl_tab_snap(tab);
423
2.30k
      k[level]++;
424
2.30k
      if (tab_add_constraint(tab, map->p[level],
425
2.30k
            div_map[level],
426
2.30k
            index[level][k[level]], 1) < 0)
427
0
        goto error;
428
2.30k
      level++;
429
2.30k
      init = 1;
430
2.30k
      continue;
431
2.30k
    }
432
48.6k
  }
433
17.7k
434
17.7k
  isl_tab_free(tab);
435
14.9k
  free(snap);
436
14.9k
  free(n);
437
14.9k
  free(k);
438
39.3k
  for (i = 0; index && i < map->n; 
++i24.3k
)
439
24.3k
    free(index[i]);
440
14.9k
  free(index);
441
39.3k
  for (i = 0; div_map && i < map->n; 
++i24.3k
)
442
24.3k
    free(div_map[i]);
443
14.9k
  free(div_map);
444
14.9k
445
14.9k
  isl_basic_map_free(bmap);
446
14.9k
  isl_map_free(map);
447
14.9k
448
14.9k
  return isl_stat_ok;
449
2.79k
error:
450
2.79k
  isl_tab_free(tab);
451
2.79k
  free(snap);
452
2.79k
  free(n);
453
2.79k
  free(k);
454
8.00k
  for (i = 0; index && i < map->n; 
++i5.20k
)
455
5.20k
    free(index[i]);
456
2.79k
  free(index);
457
8.00k
  for (i = 0; div_map && i < map->n; 
++i5.20k
)
458
5.20k
    free(div_map[i]);
459
2.79k
  free(div_map);
460
2.79k
  isl_basic_map_free(bmap);
461
2.79k
  isl_map_free(map);
462
2.79k
  return isl_stat_error;
463
17.7k
}
464
465
/* A diff collector that actually collects all parts of the
466
 * set difference in the field diff.
467
 */
468
struct isl_subtract_diff_collector {
469
  struct isl_diff_collector dc;
470
  struct isl_map *diff;
471
};
472
473
/* isl_subtract_diff_collector callback.
474
 */
475
static isl_stat basic_map_subtract_add(struct isl_diff_collector *dc,
476
          __isl_take isl_basic_map *bmap)
477
10.3k
{
478
10.3k
  struct isl_subtract_diff_collector *sdc;
479
10.3k
  sdc = (struct isl_subtract_diff_collector *)dc;
480
10.3k
481
10.3k
  sdc->diff = isl_map_union_disjoint(sdc->diff,
482
10.3k
      isl_map_from_basic_map(bmap));
483
10.3k
484
10.3k
  return sdc->diff ? isl_stat_ok : 
isl_stat_error0
;
485
10.3k
}
486
487
/* Return the set difference between bmap and map.
488
 */
489
static __isl_give isl_map *basic_map_subtract(__isl_take isl_basic_map *bmap,
490
  __isl_take isl_map *map)
491
10.9k
{
492
10.9k
  struct isl_subtract_diff_collector sdc;
493
10.9k
  sdc.dc.add = &basic_map_subtract_add;
494
10.9k
  sdc.diff = isl_map_empty(isl_basic_map_get_space(bmap));
495
10.9k
  if (basic_map_collect_diff(bmap, map, &sdc.dc) < 0) {
496
0
    isl_map_free(sdc.diff);
497
0
    sdc.diff = NULL;
498
0
  }
499
10.9k
  return sdc.diff;
500
10.9k
}
501
502
/* Return an empty map living in the same space as "map1" and "map2".
503
 */
504
static __isl_give isl_map *replace_pair_by_empty( __isl_take isl_map *map1,
505
  __isl_take isl_map *map2)
506
1.55k
{
507
1.55k
  isl_space *space;
508
1.55k
509
1.55k
  space = isl_map_get_space(map1);
510
1.55k
  isl_map_free(map1);
511
1.55k
  isl_map_free(map2);
512
1.55k
  return isl_map_empty(space);
513
1.55k
}
514
515
/* Return the set difference between map1 and map2.
516
 * (U_i A_i) \ (U_j B_j) is computed as U_i (A_i \ (U_j B_j))
517
 *
518
 * If "map1" and "map2" are obviously equal to each other,
519
 * then return an empty map in the same space.
520
 *
521
 * If "map1" and "map2" are disjoint, then simply return "map1".
522
 */
523
static __isl_give isl_map *map_subtract( __isl_take isl_map *map1,
524
  __isl_take isl_map *map2)
525
10.6k
{
526
10.6k
  int i;
527
10.6k
  int equal, disjoint;
528
10.6k
  struct isl_map *diff;
529
10.6k
530
10.6k
  if (!map1 || !map2)
531
0
    goto error;
532
10.6k
533
10.6k
  isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
534
10.6k
535
10.6k
  equal = isl_map_plain_is_equal(map1, map2);
536
10.6k
  if (equal < 0)
537
0
    goto error;
538
10.6k
  if (equal)
539
1.55k
    return replace_pair_by_empty(map1, map2);
540
9.12k
541
9.12k
  disjoint = isl_map_is_disjoint(map1, map2);
542
9.12k
  if (disjoint < 0)
543
0
    goto error;
544
9.12k
  if (disjoint) {
545
5.16k
    isl_map_free(map2);
546
5.16k
    return map1;
547
5.16k
  }
548
3.96k
549
3.96k
  map1 = isl_map_compute_divs(map1);
550
3.96k
  map2 = isl_map_compute_divs(map2);
551
3.96k
  if (!map1 || !map2)
552
0
    goto error;
553
3.96k
554
3.96k
  map1 = isl_map_remove_empty_parts(map1);
555
3.96k
  map2 = isl_map_remove_empty_parts(map2);
556
3.96k
557
3.96k
  diff = isl_map_empty(isl_map_get_space(map1));
558
14.8k
  for (i = 0; i < map1->n; 
++i10.9k
) {
559
10.9k
    struct isl_map *d;
560
10.9k
    d = basic_map_subtract(isl_basic_map_copy(map1->p[i]),
561
10.9k
               isl_map_copy(map2));
562
10.9k
    if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT))
563
10.9k
      
diff = isl_map_union_disjoint(diff, d)3.24k
;
564
7.66k
    else
565
7.66k
      diff = isl_map_union(diff, d);
566
10.9k
  }
567
3.96k
568
3.96k
  isl_map_free(map1);
569
3.96k
  isl_map_free(map2);
570
3.96k
571
3.96k
  return diff;
572
0
error:
573
0
  isl_map_free(map1);
574
0
  isl_map_free(map2);
575
0
  return NULL;
576
3.96k
}
577
578
__isl_give isl_map *isl_map_subtract( __isl_take isl_map *map1,
579
  __isl_take isl_map *map2)
580
10.6k
{
581
10.6k
  return isl_map_align_params_map_map_and(map1, map2, &map_subtract);
582
10.6k
}
583
584
struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
585
7.29k
{
586
7.29k
  return set_from_map(isl_map_subtract(set_to_map(set1),
587
7.29k
              set_to_map(set2)));
588
7.29k
}
589
590
/* Remove the elements of "dom" from the domain of "map".
591
 */
592
static __isl_give isl_map *map_subtract_domain(__isl_take isl_map *map,
593
  __isl_take isl_set *dom)
594
18
{
595
18
  isl_bool ok;
596
18
  isl_map *ext_dom;
597
18
598
18
  ok = isl_map_compatible_domain(map, dom);
599
18
  if (ok < 0)
600
0
    goto error;
601
18
  if (!ok)
602
18
    
isl_die0
(isl_set_get_ctx(dom), isl_error_invalid,
603
18
      "incompatible spaces", goto error);
604
18
  
605
18
  ext_dom = isl_map_universe(isl_map_get_space(map));
606
18
  ext_dom = isl_map_intersect_domain(ext_dom, dom);
607
18
  return isl_map_subtract(map, ext_dom);
608
0
error:
609
0
  isl_map_free(map);
610
0
  isl_set_free(dom);
611
0
  return NULL;
612
18
}
613
614
__isl_give isl_map *isl_map_subtract_domain(__isl_take isl_map *map,
615
  __isl_take isl_set *dom)
616
18
{
617
18
  return isl_map_align_params_map_map_and(map, dom, &map_subtract_domain);
618
18
}
619
620
/* Remove the elements of "dom" from the range of "map".
621
 */
622
static __isl_give isl_map *map_subtract_range(__isl_take isl_map *map,
623
  __isl_take isl_set *dom)
624
2
{
625
2
  isl_bool ok;
626
2
  isl_map *ext_dom;
627
2
628
2
  ok = isl_map_compatible_range(map, dom);
629
2
  if (ok < 0)
630
0
    goto error;
631
2
  if (!ok)
632
2
    
isl_die0
(isl_set_get_ctx(dom), isl_error_invalid,
633
2
      "incompatible spaces", goto error);
634
2
  
635
2
  ext_dom = isl_map_universe(isl_map_get_space(map));
636
2
  ext_dom = isl_map_intersect_range(ext_dom, dom);
637
2
  return isl_map_subtract(map, ext_dom);
638
0
error:
639
0
  isl_map_free(map);
640
0
  isl_set_free(dom);
641
0
  return NULL;
642
2
}
643
644
__isl_give isl_map *isl_map_subtract_range(__isl_take isl_map *map,
645
  __isl_take isl_set *dom)
646
2
{
647
2
  return isl_map_align_params_map_map_and(map, dom, &map_subtract_range);
648
2
}
649
650
/* A diff collector that aborts as soon as its add function is called,
651
 * setting empty to 0.
652
 */
653
struct isl_is_empty_diff_collector {
654
  struct isl_diff_collector dc;
655
  isl_bool empty;
656
};
657
658
/* isl_is_empty_diff_collector callback.
659
 */
660
static isl_stat basic_map_is_empty_add(struct isl_diff_collector *dc,
661
          __isl_take isl_basic_map *bmap)
662
2.79k
{
663
2.79k
  struct isl_is_empty_diff_collector *edc;
664
2.79k
  edc = (struct isl_is_empty_diff_collector *)dc;
665
2.79k
666
2.79k
  edc->empty = 0;
667
2.79k
668
2.79k
  isl_basic_map_free(bmap);
669
2.79k
  return isl_stat_error;
670
2.79k
}
671
672
/* Check if bmap \ map is empty by computing this set difference
673
 * and breaking off as soon as the difference is known to be non-empty.
674
 */
675
static isl_bool basic_map_diff_is_empty(__isl_keep isl_basic_map *bmap,
676
  __isl_keep isl_map *map)
677
6.72k
{
678
6.72k
  isl_bool empty;
679
6.72k
  isl_stat r;
680
6.72k
  struct isl_is_empty_diff_collector edc;
681
6.72k
682
6.72k
  empty = isl_basic_map_plain_is_empty(bmap);
683
6.72k
  if (empty)
684
1
    return empty;
685
6.71k
686
6.71k
  edc.dc.add = &basic_map_is_empty_add;
687
6.71k
  edc.empty = isl_bool_true;
688
6.71k
  r = basic_map_collect_diff(isl_basic_map_copy(bmap),
689
6.71k
           isl_map_copy(map), &edc.dc);
690
6.71k
  if (!edc.empty)
691
2.79k
    return isl_bool_false;
692
3.92k
693
3.92k
  return r < 0 ? 
isl_bool_error0
: isl_bool_true;
694
3.92k
}
695
696
/* Check if map1 \ map2 is empty by checking if the set difference is empty
697
 * for each of the basic maps in map1.
698
 */
699
static isl_bool map_diff_is_empty(__isl_keep isl_map *map1,
700
  __isl_keep isl_map *map2)
701
6.15k
{
702
6.15k
  int i;
703
6.15k
  isl_bool is_empty = isl_bool_true;
704
6.15k
705
6.15k
  if (!map1 || !map2)
706
0
    return isl_bool_error;
707
6.15k
  
708
10.0k
  
for (i = 0; 6.15k
i < map1->n;
++i3.92k
) {
709
6.72k
    is_empty = basic_map_diff_is_empty(map1->p[i], map2);
710
6.72k
    if (is_empty < 0 || !is_empty)
711
2.79k
       break;
712
6.72k
  }
713
6.15k
714
6.15k
  return is_empty;
715
6.15k
}
716
717
/* Return true if "bmap" contains a single element.
718
 */
719
isl_bool isl_basic_map_plain_is_singleton(__isl_keep isl_basic_map *bmap)
720
5.48k
{
721
5.48k
  if (!bmap)
722
0
    return isl_bool_error;
723
5.48k
  if (bmap->n_div)
724
250
    return isl_bool_false;
725
5.23k
  if (bmap->n_ineq)
726
4.44k
    return isl_bool_false;
727
788
  return bmap->n_eq == isl_basic_map_total_dim(bmap);
728
788
}
729
730
/* Return true if "map" contains a single element.
731
 */
732
isl_bool isl_map_plain_is_singleton(__isl_keep isl_map *map)
733
6.31k
{
734
6.31k
  if (!map)
735
0
    return isl_bool_error;
736
6.31k
  if (map->n != 1)
737
833
    return isl_bool_false;
738
5.48k
739
5.48k
  return isl_basic_map_plain_is_singleton(map->p[0]);
740
5.48k
}
741
742
/* Given a singleton basic map, extract the single element
743
 * as an isl_point.
744
 */
745
static __isl_give isl_point *singleton_extract_point(
746
  __isl_keep isl_basic_map *bmap)
747
160
{
748
160
  int j;
749
160
  unsigned dim;
750
160
  struct isl_vec *point;
751
160
  isl_int m;
752
160
753
160
  if (!bmap)
754
0
    return NULL;
755
160
756
160
  dim = isl_basic_map_total_dim(bmap);
757
160
  isl_assert(bmap->ctx, bmap->n_eq == dim, return NULL);
758
160
  point = isl_vec_alloc(bmap->ctx, 1 + dim);
759
160
  if (!point)
760
0
    return NULL;
761
160
762
160
  isl_int_init(m);
763
160
764
160
  isl_int_set_si(point->el[0], 1);
765
359
  for (j = 0; j < bmap->n_eq; 
++j199
) {
766
199
    int i = dim - 1 - j;
767
199
    isl_assert(bmap->ctx,
768
199
        isl_seq_first_non_zero(bmap->eq[j] + 1, i) == -1,
769
199
        goto error);
770
199
    isl_assert(bmap->ctx,
771
199
        isl_int_is_one(bmap->eq[j][1 + i]) ||
772
199
        isl_int_is_negone(bmap->eq[j][1 + i]),
773
199
        goto error);
774
199
    isl_assert(bmap->ctx,
775
199
        isl_seq_first_non_zero(bmap->eq[j]+1+i+1, dim-i-1) == -1,
776
199
        goto error);
777
199
778
199
    isl_int_gcd(m, point->el[0], bmap->eq[j][1 + i]);
779
199
    isl_int_divexact(m, bmap->eq[j][1 + i], m);
780
199
    isl_int_abs(m, m);
781
199
    isl_seq_scale(point->el, point->el, m, 1 + i);
782
199
    isl_int_divexact(m, point->el[0], bmap->eq[j][1 + i]);
783
199
    isl_int_neg(m, m);
784
199
    isl_int_mul(point->el[1 + i], m, bmap->eq[j][0]);
785
199
  }
786
160
787
160
  isl_int_clear(m);
788
160
  return isl_point_alloc(isl_basic_map_get_space(bmap), point);
789
0
error:
790
0
  isl_int_clear(m);
791
0
  isl_vec_free(point);
792
0
  return NULL;
793
160
}
794
795
/* Return isl_bool_true if the singleton map "map1" is a subset of "map2",
796
 * i.e., if the single element of "map1" is also an element of "map2".
797
 * Assumes "map2" has known divs.
798
 */
799
static isl_bool map_is_singleton_subset(__isl_keep isl_map *map1,
800
  __isl_keep isl_map *map2)
801
160
{
802
160
  int i;
803
160
  isl_bool is_subset = isl_bool_false;
804
160
  struct isl_point *point;
805
160
806
160
  if (!map1 || !map2)
807
0
    return isl_bool_error;
808
160
  if (map1->n != 1)
809
160
    
isl_die0
(isl_map_get_ctx(map1), isl_error_invalid,
810
160
      "expecting single-disjunct input",
811
160
      return isl_bool_error);
812
160
813
160
  point = singleton_extract_point(map1->p[0]);
814
160
  if (!point)
815
0
    return isl_bool_error;
816
160
817
188
  
for (i = 0; 160
i < map2->n;
++i28
) {
818
171
    is_subset = isl_basic_map_contains_point(map2->p[i], point);
819
171
    if (is_subset)
820
143
      break;
821
171
  }
822
160
823
160
  isl_point_free(point);
824
160
  return is_subset;
825
160
}
826
827
static isl_bool map_is_subset(__isl_keep isl_map *map1,
828
  __isl_keep isl_map *map2)
829
14.7k
{
830
14.7k
  isl_bool is_subset = isl_bool_false;
831
14.7k
  isl_bool empty, single;
832
14.7k
  isl_bool rat1, rat2;
833
14.7k
834
14.7k
  if (!map1 || !map2)
835
0
    return isl_bool_error;
836
14.7k
837
14.7k
  if (!isl_map_has_equal_space(map1, map2))
838
24
    return isl_bool_false;
839
14.6k
840
14.6k
  empty = isl_map_is_empty(map1);
841
14.6k
  if (empty < 0)
842
0
    return isl_bool_error;
843
14.6k
  if (empty)
844
48
    return isl_bool_true;
845
14.6k
846
14.6k
  empty = isl_map_is_empty(map2);
847
14.6k
  if (empty < 0)
848
0
    return isl_bool_error;
849
14.6k
  if (empty)
850
5.56k
    return isl_bool_false;
851
9.07k
852
9.07k
  rat1 = isl_map_has_rational(map1);
853
9.07k
  rat2 = isl_map_has_rational(map2);
854
9.07k
  if (rat1 < 0 || rat2 < 0)
855
0
    return isl_bool_error;
856
9.07k
  if (rat1 && 
!rat214
)
857
2
    return isl_bool_false;
858
9.07k
859
9.07k
  if (isl_map_plain_is_universe(map2))
860
2.75k
    return isl_bool_true;
861
6.31k
862
6.31k
  single = isl_map_plain_is_singleton(map1);
863
6.31k
  if (single < 0)
864
0
    return isl_bool_error;
865
6.31k
  map2 = isl_map_compute_divs(isl_map_copy(map2));
866
6.31k
  if (single) {
867
160
    is_subset = map_is_singleton_subset(map1, map2);
868
160
    isl_map_free(map2);
869
160
    return is_subset;
870
160
  }
871
6.15k
  is_subset = map_diff_is_empty(map1, map2);
872
6.15k
  isl_map_free(map2);
873
6.15k
874
6.15k
  return is_subset;
875
6.15k
}
876
877
isl_bool isl_map_is_subset(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
878
14.7k
{
879
14.7k
  return isl_map_align_params_map_map_and_test(map1, map2,
880
14.7k
              &map_is_subset);
881
14.7k
}
882
883
isl_bool isl_set_is_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
884
7.90k
{
885
7.90k
  return isl_map_is_subset(set_to_map(set1), set_to_map(set2));
886
7.90k
}
887
888
__isl_give isl_map *isl_map_make_disjoint(__isl_take isl_map *map)
889
1.88k
{
890
1.88k
  int i;
891
1.88k
  struct isl_subtract_diff_collector sdc;
892
1.88k
  sdc.dc.add = &basic_map_subtract_add;
893
1.88k
894
1.88k
  if (!map)
895
0
    return NULL;
896
1.88k
  if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
897
1.88k
    
return map954
;
898
933
  if (map->n <= 1)
899
858
    return map;
900
75
901
75
  map = isl_map_compute_divs(map);
902
75
  map = isl_map_remove_empty_parts(map);
903
75
904
75
  if (!map || map->n <= 1)
905
0
    return map;
906
75
907
75
  sdc.diff = isl_map_from_basic_map(isl_basic_map_copy(map->p[0]));
908
75
909
158
  for (i = 1; i < map->n; 
++i83
) {
910
83
    struct isl_basic_map *bmap = isl_basic_map_copy(map->p[i]);
911
83
    struct isl_map *copy = isl_map_copy(sdc.diff);
912
83
    if (basic_map_collect_diff(bmap, copy, &sdc.dc) < 0) {
913
0
      isl_map_free(sdc.diff);
914
0
      sdc.diff = NULL;
915
0
      break;
916
0
    }
917
83
  }
918
75
919
75
  isl_map_free(map);
920
75
921
75
  return sdc.diff;
922
75
}
923
924
__isl_give isl_set *isl_set_make_disjoint(__isl_take isl_set *set)
925
1.87k
{
926
1.87k
  return set_from_map(isl_map_make_disjoint(set_to_map(set)));
927
1.87k
}
928
929
__isl_give isl_map *isl_map_complement(__isl_take isl_map *map)
930
2.10k
{
931
2.10k
  isl_map *universe;
932
2.10k
933
2.10k
  if (!map)
934
0
    return NULL;
935
2.10k
936
2.10k
  universe = isl_map_universe(isl_map_get_space(map));
937
2.10k
938
2.10k
  return isl_map_subtract(universe, map);
939
2.10k
}
940
941
__isl_give isl_set *isl_set_complement(__isl_take isl_set *set)
942
2.10k
{
943
2.10k
  return isl_map_complement(set);
944
2.10k
}